blob_id stringlengths 40 40 | content_id stringlengths 40 40 | repo_name stringlengths 5 114 | path stringlengths 5 318 | language stringclasses 5
values | extension stringclasses 12
values | length_bytes int64 200 200k | license_type stringclasses 2
values | content stringlengths 143 200k |
|---|---|---|---|---|---|---|---|---|
abe5e44027608272eef1fb92c768d5fe8816a6d2 | f6629cc76d5c49b2bf184118c8f26bcb1975e846 | proaholic/Win2K3 | /NT/shell/ext/cscui/volclean.cpp | C++ | cpp | 8,683 | no_license | //+-------------------------------------------------------------------------
//
// Microsoft Windows
//
// Copyright (C) Microsoft Corporation, 1997 - 1999
//
// File: volclean.cpp
//
// Authors;
// Jeff Saathoff (jeffreys)
//
// Notes;
// CSC disk cleanup implementation (IEmptyVolumeCache)
//---------... |
2f850a0b41c84a0ab4cb187bc600e90d45c9000f | 15cf83bb7d1093533698e6302d4d8c47fe5bd9e4 | bigflyboy/GameEngine | /GameEngineOnMac/GLInit.cpp | C++ | cpp | 1,512 | no_license | //
// GLInit.cpp
// GameEngineOnMac
//
// Created by 王志远 on 2017/4/12.
// Copyright © 2017年 王志远. All rights reserved.
//
#include "GLInit.hpp"
GLInit::GLInit(){
}
GLInit::~GLInit(){
}
void GLInit::GlFWInit(){
glfwInit();
glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
glfwWindowHint(GLFW_CO... |
29a83d863f8c877d6334327545485c0da2b953fb | 276f8072e881bf5dde52af6cc55812d215549bc2 | cginternals/openll | /ll-opengl/source/examples/labeling-at-point/PointDrawable.cpp | C++ | cpp | 1,950 | permissive | #include "PointDrawable.h"
#include <glm/vec2.hpp>
#include <glbinding/gl/enum.h>
#include <glbinding/gl/functions.h>
#include <globjects/Program.h>
#include <globjects/VertexArray.h>
#include <globjects/VertexAttributeBinding.h>
#include <globjects/Buffer.h>
#include <globjects/Shader.h>
using namespace gl;
name... |
5ca4154b6d4126a9d0e2bb2cd89d4c4995106534 | 359741362af2a74176450649550f7c46fde138d5 | EmperorNao/Fractals | /Fractals/Fractals/Complex.cpp | C++ | cpp | 564 | no_license | #include "Complex.h"
double Complex::real() {
return Re;
}
double Complex::imag() {
return Im;
}
Complex operator*(Complex a, Complex b) {
Complex t(a.real()*b.real() - a.imag()* b. imag(), a.real()*b.imag() + b.real()*a.imag());
return t;
}
Complex operator+(Complex a, Complex b) {
Complex t(a.real() ... |
45d0fa2b212143cdd0197e985de68c26efe9fea3 | f2813b323b72b01e9a470fe86af2cab941f27544 | dorlan/botan | /src/lib/utils/os_utils.cpp | C++ | cpp | 11,595 | permissive | /*
* OS and machine specific utility functions
* (C) 2015,2016,2017 Jack Lloyd
* (C) 2016 Daniel Neus
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/internal/os_utils.h>
#include <botan/cpuid.h>
#include <botan/exceptn.h>
#include <botan/mem_ops.h>
#include <chrono>
#inclu... |
1a4eb414fe0be734019490a3f05bb3ae320c4cc6 | 2125f205f7dcc477f7c7513328b95c8560329f83 | axkibe/node-vtk | /wrappers/7.0.0/vtkGenericGlyph3DFilterWrap.cc | C++ | cc | 42,327 | permissive | /* this file has been autogenerated by vtkNodeJsWrap */
/* editing this might proof futile */
#define VTK_WRAPPING_CXX
#define VTK_STREAMS_FWD_ONLY
#include <nan.h>
#include "vtkPolyDataAlgorithmWrap.h"
#include "vtkGenericGlyph3DFilterWrap.h"
#include "vtkObjectWrap.h"
#include "vtkPolyDataWrap.h"
#include "../../pl... |
0fecf7cb9c39ce0211d3787aea2e50c4771a8248 | 332b319402efe24027ace301d19559033f1adee6 | ngoanhtan/ArkGameFrame | /Frame/Server/ProxyServer/ProxyServerNet_ServerPlugin/AFProxyNetServerPlugin.cpp | C++ | cpp | 2,801 | permissive | /*****************************************************************************
// * This source file is part of ArkGameFrame *
// * For the latest info, see https://github.com/ArkGame *
// * *
// *... |
cf6b6eb5a3f3ff9621684372df3a7d0d90544452 | 701fb0c4a692ca350277a9fb100eadca16235599 | liangsheng/ACM | /normal/CF/CF_335/E.cpp | C++ | cpp | 1,879 | no_license | #include <bits/stdc++.h>
#define eps 1e-8
#define zero(x) (((x)>0?(x):-(x))<eps)
#define pause cout << " press ansy key to continue...", cin >> chh
#define file_r(x) freopen(x, "r", stdin)
#define file_w(x) freopen(x, "w", stdout)
#define lowbit(x) ((x) & (-x))
#define repit(i, c) for (__typeof__((c).begin()) i ... |
d4b9bb2c20e01972febedbc56f7e25960a69e293 | 7458c34de0185a442ecf88597d06083537e144ae | kapoorp99/hacktoberfest2021 | /seriesofcrime.cpp | C++ | cpp | 961 | no_license | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
long long int n,m;
cin>>n;
cin>>m;
char array[... |
5fe046f496e2f7f578d8e55fd61cc0bf100a2217 | 988261d3feeac1db89d5cc6b76261457999eab01 | codesome/Parallel-SCC | /sandbox/test.cpp | C++ | cpp | 620 | no_license | #include <iostream>
#include <thread>
#include "AtomicQueue.h"
using namespace std;
int main(int argc, char const *argv[]) {
AtomicEnDqQueue<int> tasks;
thread t1([&tasks](){
for (int i = 0; i < 1e4; ++i) {
tasks.enqueue(i);
}
});
thread t2([&tasks](){
for (int i = 0; i < 1e4; ++i) {
tasks.enqueue(i);... |
0ed0f5b412d7e4fcf102b4d0b428b3f3e1d814aa | faf9df36b7688700ce67717ef7cb896d760de515 | kobutri/openGL_tutorial | /source/shader.cpp | C++ | cpp | 2,574 | no_license | //
// Created by trist on 25.04.2018.
//
#include <iostream>
#include "shader.h"
void Shader::init(const std::string &vertexPath, const std::string &fragmentPath) {
unsigned int vertexShader;
unsigned int fragmentShader;
createShader(loadShader(vertexPath), vertexShader, GL_VERTEX_SHADER);
createShade... |
c27dc73b394759f77f87c075b69e0568c948f56a | 0c3028953ef19ebb8626c2312e80ea4c8e6fa75b | wtrsltnk/zynlab | /zyn.serialization/ResonanceSerializer.cpp | C++ | cpp | 2,524 | no_license | /*
ZynAddSubFX - a software synthesizer
Resonance.cpp - Resonance
Copyright (C) 2002-2005 Nasca Octavian Paul
Author: Nasca Octavian Paul
This program is free software; you can redistribute it and/or modify
it under the terms of version 2 of the GNU General Public License
as published by the Free Softwa... |
2f03bf11c91b79edb5cf21a18e5c1147bb706ab1 | 4280e96841ee018f9fa4ee91a1627ed9ac2c274d | mapu/toolchains | /llvm-3.8.0-r267675/lib/Transforms/Utils/FunctionImportUtils.cpp | C++ | cpp | 10,559 | permissive | //===- lib/Transforms/Utils/FunctionImportUtils.cpp - Importing utilities -===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
05ccef4ee31bb48289e16b704263b914cb3555f4 | 2cc19cff398cbb0e8c08d1de2648ebadefaae873 | sajdoann/FireWall | /sajdoann/src/Game/Objects/Virus.cpp | C++ | cpp | 2,368 | no_license | /**
* @author Anna Sajdokova <sajdoann@fit.cvut.cz>
* @date 5/14/2020
*/
#include "Virus.h"
#include "../Board/Board.h"
#include "MovingObject.h"
#include "Object.h"
#include "ObjectWithMoveAttributes.h"
Virus &Virus::operator=(const Virus &other) {
if (this == &other) return *this;
if (strategy != nullptr) de... |
c97e1a513db792f5287c53d13456e82d66ba6c6c | 37b5862b3ecc3cd261da8076f630247c1f7d9947 | isabella232/azure-iot-mobility-digitaltwin | /tools/src/dtdl-definition/dtdl-composer.cpp | C++ | cpp | 2,781 | permissive | // ---------------------------------------------------------------------------------
// <copyright company="Microsoft">
// Copyright (c) Microsoft Corporation. All rights reserved.
// </copyright>
// ---------------------------------------------------------------------------------
#include <iostream>
#include "dt... |
5e806b2514a7fb700c83209b41698a1163cb72b3 | 91807c1d22bb0d1fa4ba812242bbaa6f89ea4eb4 | dalip98/Data-Structures-and-Algorithm | /Codeforces Global Round3/Ques1/main.cpp | C++ | cpp | 549 | no_license | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios::sync_with_stdio(0);
ll a,b,c; cin>>a>>b>>c;
ll sum=0;
if(a>b)
{
sum+=b;
if(a>=b+1)
{
sum+=(b+1);
}
else
... |
54eb9a642f31b78bc698f3718019d69693c72f6c | 06cbbcd35aefaed5458c445928e5f32825740d1e | MATF-RS19/RS040-escape-from-college | /sources/level3.cpp | C++ | cpp | 4,901 | no_license | #include "headers/level3.h"
#include "headers/game.h"
#include "headers/player.h"
#include "headers/tips.h"
#include "headers/meni.h"
#include "headers/score.h"
extern Player * player;
extern Score * score;
extern Tips * tips;
extern Game * game;
extern Meni * pocetak;
Level3::Level3(){
setSceneRect(0, 0, 800, 6... |
726198c86b94be7e7fcb55b2a7e58db06bad9e89 | f7bd4e9023b805982df8a308328f33320617851a | Kent-Kjeldaas/Flight-Controller | /src/Flight Controller - On Board/main.cpp | C++ | cpp | 1,016 | no_license | #include "Configuration.h"
#include <Math.h>
#include <PID_v1.h>
#include <PinChangeInt.h>
#include <Servo.h>
#include <Wire.h>
// Angles
float angleX,angleY,angleZ = 0.0;
// RX Signals
int throttle=THROTTLE_RMIN;
volatile int rx_values[4]; // ROLL, PITCH, THROTTLE, YAW
// PID variables
double pid_roll_in, pid_ro... |
68898febe2d43a391915e3b4e581d369aec01066 | b62baef6f236587ca5fb93a02501c06ae787d536 | Sara-Asgari/Datasets | /ReaSE/src/applications/ddos/TribeFloodNetwork.cc | C++ | cc | 14,053 | no_license | #include <sstream>
#include <iostream>
#include <limits.h>
#include "TribeFloodNetwork.h"
#include "PingPayload_m.h"
#include "ICMP.h"
#include "IPControlInfo_hacked_m.h"
#include "IPv6ControlInfo_hacked_m.h"
#include "UDPPacket.h"
#include "UDPControlInfo_m.h"
#include "RoutingTableAccess.h"
#include "ARP.h"
#include ... |
6f3ad833c21053fd1367d79969f62e0f98f104dc | f882775189306a1f9051ec9b6317419c7fb1354b | natsuki1996/atcoder-practice | /contests/arc068/D/main.cpp | C++ | cpp | 325 | permissive | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a;
cin >> n;
map<int, int> mp;
rep(i, n) {
cin >> a;
mp[a]++;
}
ll ans = mp.size();
if (ans % 2 == 0) ans--;
cout << ans << end... |
940d8763f0d4bb4e314b9c90fdb8817027da13e4 | ed56dc1f24059f32f6c6aa7df91414f939057c1a | denyzamelchor/spectre | /tests/Unit/Evolution/Systems/GrMhd/ValenciaDivClean/Test_Sources.cpp | C++ | cpp | 901 | permissive | // Distributed under the MIT License.
// See LICENSE.txt for details.
#include "tests/Unit/TestingFramework.hpp"
#include "DataStructures/DataVector.hpp"
#include "Evolution/Systems/GrMhd/ValenciaDivClean/Sources.hpp"
#include "tests/Unit/Pypp/CheckWithRandomValues.hpp"
#include "tests/Unit/Pypp/SetupLocalPythonEnvir... |
6e00930b8eb48c08e617613d57285b3cdb06a12e | 3f97d65a9d72fe059a3e352a60e7ae5f5c25c77d | zxnxzf/pdfium | /xfa/fgas/font/cfgas_pdffontmgr.cpp | C++ | cpp | 5,881 | permissive | // Copyright 2017 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "xfa/fgas/font/cfgas_pdffontmgr.h"
#include <algorithm>
#include "c... |
f5bad994386042bb2fca9950be0107342c56d2fa | 323a626f35f66dd44fe570fc24dffc9487da3059 | smhemel/Codeforces-Online-Judge | /VK Cup 2018 - Wild-card Round 1 - A. 2-3-numbers/VK Cup 2018 - Wild-card Round 1 - A. 2-3-numbers/main.cpp | C++ | cpp | 461 | no_license | //
// main.cpp
// VK Cup 2018 - Wild-card Round 1 - A. 2-3-numbers
//
// Created by S M HEMEL on 18/3/18.
// Copyright © 2018 Eastern University. All rights reserved.
//
#include <iostream>
#include <cmath>
#define ll long long int
using namespace std;
int main() {
ll l,r,cnt = 0;
cin >> l >> r;
for (l... |
98b47755575070a6fe79e68af3fa418af3c91060 | f0896dcedc52f017d334f2d0b304e7f78515c339 | isliulin/DM_DFT | /SM_DM_DFT_W10_32/AnalogGrabber.cpp | C++ | cpp | 14,582 | no_license | // AnalogGrabber.cpp : implementation file
//
#include "stdafx.h"
#include "AnalogGrabber.h"
#include "Defines.h"
#include <stdio.h>
#include <wtypes.h>
//+del kwmoon 080318
//#include "board.h"
//#include "pcibrd.h"
#include "Global.h"
#include <mil.h>
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static c... |
e29b74625c86aab01bd13e30ba9d3922bafee8c8 | cbe0d0ab50a893eb549346f8353f534d8eb7ce91 | acc-cosc-1337-fall-2019/acc-cosc-1337-fall-2019-Fortress117 | /src/homework/tic_tac_toe/tic_tac_toe.cpp | C++ | cpp | 2,236 | permissive | //cpp
#include "tic_tac_toe.h"
bool TicTacToe::game_over()
{
if (check_column_win() == true || check_row_win() == true ||
check_diagonal_win() == true)
{
set_winner();
return true;
}
else if (check_board_full() == true)
{
winner = "C";
return true;
}
return false;
}
void TicTacToe::start_game(string ... |
0ff732ae47e8247e0e17457a33bcf07cc7364efa | ec70421793be045573749b479330833a831075c2 | pfepark/Cpp11_14 | /CppDay7/1_Conversion6.cpp | C++ | cpp | 376 | no_license | #include <iostream>
void foo(int n) { std::cout << "int" << std::endl; }
void foo(void* n) { std::cout << "void*" << std::endl; }
void goo(char* n) { std::cout << "void*" << std::endl; }
int main()
{
foo(0); // 0은 포인터로 변환되기도 하지만 정확히는 int이다.
foo((void*)0); // 포인터 버전 호출
#define NULL (void*)0
goo(NULL)... |
1129ed5b6b775f048fab16d3cb347fccbd2bb38b | 3cf7ac09ac8d1ce4eecb6ea99290f04c5e970595 | hughsonm/mqtt-embedded-project | /Sensor/src/sensor.cpp | C++ | cpp | 2,193 | no_license | #include <iostream>
#include <fstream>
#include <vector>
#include <mqtt/async_client.h>
#include <mqtt/topic.h>
#include <wiringPi.h>
#include <chrono>
#include <ratio>
#include <openssl/aes.h>
#include "crypt.h"
class Sensor{
double ym2{0.0};
double ym1{0.0};
double y{0.0};
double xm2{1.0};
int count{0};
public:... |
8f7cf2a65734ed0ad44be6466dcb014a6ccf6374 | f1fb1130e3b79a2bdb3554a943dd81c1b986fcf6 | brinkqiang2cpp/exprtk | /exprtk_simple_example_01.cpp | C++ | cpp | 1,730 | permissive | /*
**************************************************************
* C++ Mathematical Expression Toolkit Library *
* *
* Simple Example 1 *
* Author: Arash Partow (1999-2021) ... |
74be77321eaba941f596d32b4780bd6cb59dcc1c | ca5d21b452b4460963ba7fc9db671180beaf26e7 | ciaozer/luogu | /sequence_structure/P5705.cpp | C++ | cpp | 201 | no_license | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string a;
cin>>a;
reverse(a.begin(), a.end());
cout<<a;
// system("pause");
return 0;
} |
508d7968901723bb8c4631658e98e35db6c01ddb | e26d6e148c0ed11c66df1f959fa4c154e920c1f5 | larytet/hazelcast-cpp-client | /hazelcast/src/hazelcast/client/spi/impl/ProxyManager.cpp | C++ | cpp | 2,184 | permissive | /*
* Copyright (c) 2008-2017, Hazelcast, Inc. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required ... |
f9f5d3d94009c43ee7632c0f4d52e2045581444a | a8b109aad8a0c7fb8bdf33e71c91a832590e075e | kfarsany/undergraduate | /ICS_46/program4/heap_priority_queue.hpp | C++ | hpp | 21,988 | no_license | #ifndef HEAP_PRIORITY_QUEUE_HPP_
#define HEAP_PRIORITY_QUEUE_HPP_
#include <string>
#include <iostream>
#include <sstream>
#include <initializer_list>
#include "ics_exceptions.hpp"
#include <utility> //For std::swap function
#include "array_stack.hpp" //See operator <<
namespace ics {
#ifndef und... |
4409341fd9bb0d0a8653b5264b593597e82167ec | d424047c11ba08416f1838f63be2ee96bec6917e | kenrick95/code-archive | /2015-01-19 USACO January 2015/a.cpp | C++ | cpp | 1,106 | no_license | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
//#include <bits/stdc++.h>
#define INF 1000000000000LL
typedef long long int64;
typedef unsigned long long qword;
using namespace std;
/* Problem:
* URL:
*/
int main(){
freopen... |
31e426eaee2c7755784b0e680634db0881e29871 | 1e517b320c0dedf38ca501749ed2312d5331afed | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/inetsrv/iis/ui/itools/keyring/krdoc.cpp | C++ | cpp | 50,702 | no_license | // KRDoc.cpp : implementation of the CKeyRingDoc class
//
#include "stdafx.h"
#include "keyobjs.h"
#include "intrlkey.h"
#include <shlobj.h>
#include "machine.h"
#include "KeyRing.h"
#include "KRDoc.h"
#include "KRView.h"
#include "ConctDlg.h"
#include "InfoDlg.h"
#include "passdlg.h"
#include "ImprtDlg.h"
//#incl... |
e2cee9534768c00195f19fb36c3eb7a0df2d822a | e634628e58e9a490c36d442cf7d473c7364c30f7 | hyl946/opensource_apple | /download/unzip/Security/Security-57337.50.23/SecurityTests/clxutils/clTool/clTool.cpp | C++ | cpp | 8,500 | no_license | /*
* clTool.cpp - menu-driven CL exerciser
*/
#include <security_cdsa_utils/cuPrintCert.h>
#include <security_cdsa_utils/cuOidParser.h>
#include <security_cdsa_utils/cuFileIo.h>
#include <clAppUtils/clutils.h>
#include <utilLib/common.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <time.h>
#... |
8ac451c081626843f9a265ce8af2664c3c2cef87 | 5925515a5a2adaa00ef0dd5faf7f40f58c405510 | jaivox/speech | /archive/jaivox_0.1/test/gensrc0/CxxSession.cc | C++ | cc | 2,864 | permissive |
#include "CxxSession.h"
#define BSIZE 4096
#define LSIZE 1024
int MaxWaitPeriods = 10;
int defaultWaitForMsg = 1;
int defaultWaitAfterSend = 1;
// make same as CxxResponder.cc
char terminateMessage [] = "JviaTerminate";
char requestUwho [] = "JviaWho";
char invalidMessage [] = "JviaInvalid";
char responseMessage []... |
6732dc15a6e0d4af9843d87447233efcecba2100 | ed30634d7bf5efa7937f089a39277135f681dab9 | massbrowser/android | /chrome/browser/android/vr_shell/ui_elements/textured_element.cc | C++ | cc | 2,479 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/android/vr_shell/ui_elements/textured_element.h"
#include "base/trace_event/trace_event.h"
#include "cc/paint/skia_paint_canvas.... |
65a3753ae84e453e8a42d32d8b6470b011dbfbe7 | b28ce32749214e3a7473120d07a1b3fa5dba4a2e | diohabara/competitive_programming | /aoj/alds1_11_c.cpp | C++ | cpp | 1,508 | no_license | #include<iostream>
#include<queue>
using namespace std;
static const int N = 100;
static const int INFTY = (1<<21);
int n, M[N][N];
int d[N]; // 距離で訪問状態(color)を管理する
void bfs(int s)
{
queue<int> q; // 標準ライブラリのqueueを使用
q.push(s);
for (int i = 0; i < n; i++) {
d[i] = INFTY; // 距離を十分に大きい値に初期化する
... |
1cd3b68ba381e669c87e65a8613837d20da2dcfe | 3d745bd895389bf58386e03979a40ae576c590b0 | AlexGreason/ExaThought | /src/predicates.cpp | C++ | cpp | 2,658 | no_license | //
// Created by exa on 5/12/19.
//
#include <cassert>
#include <cstring>
#include <fstream>
#include <iostream>
#include "predicates.h"
#include "eval.h"
#define NPREDS 29
void print_array(int* arr, int rows, int cols){
for(int r = 0; r < rows; r++){
for(int c = 0; c < cols; c++){
std::cout ... |
67ab5c0c5efc7eca957162845e937712507943d0 | 76169cdc5525c0f351ef2afdf732d11d9af9fc38 | timopulkkinen/BubbleFish | /chrome/test/chromedriver/chrome/web_view_impl.cc | C++ | cc | 14,778 | permissive | // Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/test/chromedriver/chrome/web_view_impl.h"
#include "base/bind.h"
#include "base/json/json_writer.h"
#include "base/logging.h"
#inclu... |
a17189ce8d3cf49b75448b632ae06fae920bcd81 | 73c14b97b90dbbc52edf9de8014b0cabc477ac1a | animebing/leetcode | /Easy/168ExcelSheetColumnTitle.cpp | C++ | cpp | 377 | no_license | // stay here, i can't understand the solution totally
class Solution {
public:
string convertToTitle(int n) {
string res;
int residual;
while (n){
n--;
residual = n % 26;
res.push_back(residual+'A');
n /= 26;
}
reve... |
c99bfc2e6a11482a56324c129b604ea395727a1d | b7d3035ecb6b2be8320f24f2586cfa3d9ccd17d4 | bennuttle/igvc-software | /src/common/datastructures/ImageData.hpp | C++ | hpp | 515 | no_license | #ifndef IMAGEDATA_H
#define IMAGEDATA_H
#include <opencv2/opencv.hpp>
#include <common/datastructures/SensorData.hpp>
using namespace cv;
class ImageData : public SensorData
{
public:
ImageData() {}
ImageData(Mat image): SensorData(), _img(image) {}
ImageData(Mat image, double time): SensorData(time),... |
04942e902960463d4d2854f02a19953168df8158 | d9754504013fe74ef09da463e9c22188721e1067 | OgnjenArsenijevic/LeetCode-solutions | /266. Palindrome Permutation.cpp | C++ | cpp | 490 | no_license | ///266. Palindrome Permutation
///Author: Ognjen Arsenijevic
///username: ognjen1998
class Solution
{
public:
bool canPermutePalindrome(string s)
{
unordered_map<char,int> ump;
for(int i=0;i<s.size();i++)
ump[s[i]]++;
int cnt=0;
for(unordered_map<char,int>::iterator ... |
5a424926e87b6ab7f48c6aa2afdceccfd5205cdf | 1c449addc86a58595a48bdc1bb31b9877f2e7788 | webosce/media-resource-calculator | /tests/test_video_resource_table.cpp | C++ | cpp | 9,409 | permissive | /*
* Copyright (c) 2008-2018 LG Electronics, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law... |
f0a27693e47e84214bb5878a57cdf1f7d8b7d805 | 7daa0695a656f25281e4e7fb88090972444c7c4d | GabrielCzar/Grafos | /busca_em_profundidade/main.cpp | C++ | cpp | 2,421 | no_license | /*
BFS(G, s): // busca em largura
// INICIALIZAÇÃO // Lista // Matriz
para cada vértice u de G (excluindo o s) // O(v)
cor[u] <- branco; d[u] <- oo; pi[u] <- NULO // O(v)
cor[s] <- cinza; d[s] <- 0; pi[s] <- NULO // O(1)
decla... |
6bef3f728368850682cba788d367764ec2152995 | 536268c9d6ad3a00c2bf512adce13ef0a27c0db0 | Midnightshao/ProjectShaoGame | /Classes/PropertyData/PropertyData.hpp | C++ | hpp | 630 | no_license | //
// PropertyData.hpp
// PojectGame
//
// Created by shao on 2018/4/23.
//
#ifndef PropertyData_hpp
#define PropertyData_hpp
#include <iostream>
#include "cocos2d.h"
USING_NS_CC;
class PropertyData : public Node{
public:
bool init();
CREATE_FUNC(PropertyData);
public:
CC_SYNTHESIZE(int, ID, ... |
9ef2f7ffa2de01cc290762a9dc774c146668ab95 | 4376625fea030dfb03b03ff8287b6542b3e2f806 | Samsung/Castanets | /third_party/blink/renderer/core/animation/document_animations.cc | C++ | cc | 4,314 | permissive | /*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditio... |
5a32798dcd9830c1e9078f78dcaf726d9dcee5d6 | d162f180b51bc689bc964f0b438a279b367d061e | arximboldi/lager | /test/event_loop/queue.cpp | C++ | cpp | 1,150 | permissive | //
// lager - library for functional interactive c++ programs
// Copyright (C) 2017 Juan Pedro Bolivar Puente
//
// This file is part of lager.
//
// lager is free software: you can redistribute it and/or modify
// it under the terms of the MIT License, as detailed in the LICENSE
// file located at the root of this sou... |
df6f7e2805d5d5f6eecf2069015fee5dc7bc68a5 | f59ca1ea59b6bb219ebdba26bd7b104ee0736b3d | tingxingdong/rocFFT | /src/library/repo.cpp | C++ | cpp | 1,430 | no_license | #include <vector>
#include <assert.h>
#include <iostream>
#include "rocfft.h"
#include "./plan.h"
#include "./repo.h"
void Repo::CreatePlan(rocfft_plan plan)
{
Repo &repo = Repo::GetRepo();
if(repo.planUnique.find(*plan) == repo.planUnique.end())
{
TreeNode *rootPlan = TreeNode::CreateNode();
rootPlan->dimen... |
0e38af57cde476aa30b081e7f5f7306d70baeda0 | 193a2c84ebeed4efd6db4d170dceb834bf085d04 | paarongiroux/ISIS3 | /isis/src/base/objs/GradientOperator/unitTest.cpp | C++ | cpp | 1,544 | permissive | #include <iostream>
#include <cstdlib>
#include "InterestOperator.h"
#include "InterestOperatorFactory.h"
#include "GradientOperator.h"
#include "Chip.h"
#include "Cube.h"
#include "Pvl.h"
#include "PvlGroup.h"
#include "Preference.h"
using namespace Isis;
int main() {
Isis::Preference::Preferences(true);
try {
... |
913a1ac678748d15e0798f1bd05f6a186d61d50a | d3e8f7ca4c71832aa298f4c0e74daebd46151d91 | DedoGamingONE/tp | /rel/d/a/tag/d_a_tag_assistance/d_a_tag_assistance.cpp | C++ | cpp | 3,215 | no_license | //
// Generated By: dol2asm
// Translation Unit: d_a_tag_assistance
//
#include "rel/d/a/tag/d_a_tag_assistance/d_a_tag_assistance.h"
#include "dol2asm.h"
#include "dolphin/types.h"
//
// Types:
//
struct fopAc_ac_c {
/* 80018B64 */ fopAc_ac_c();
/* 80018C8C */ ~fopAc_ac_c();
};
struct daTagAssist_c {};
//... |
1fdb3c92f1d0b0a82cc4942b6165e55f606c5df9 | 67636bdf55e72872ddbc84c83f68eae14b36e4b0 | DuaneShaffer/OrionUO | /OrionUO/ExceptionFilter.cpp | C++ | cpp | 7,873 | permissive | // This is an open source non-commercial project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
//----------------------------------------------------------------------------------
#include "stdafx.h"
#if defined(ORION_WINDOWS)
#include <psapi.h>
#... |
817d4b8b17970aa1ad2b90c6f31bcec329108d5c | 09e427913f4a0a162bdfd2d649cab8fec3ea5851 | Ritika-dey/heap_cpp | /K elements with most occurrence.cpp | C++ | cpp | 450 | no_license | #include <bits/stdc++.h>
using namespace std;
void kmostOccurrence(int arr[], int n, int k){
map<int,int>m;
for(int i=0;i<n;i++) m[arr[i]]++;
priority_queue<pair<int,int>> q;
for(auto p:m){
q.emplace(p.second,p.first);
}
while(k--){
cout<<q.top().second<<" ";
q.pop();
}
}
... |
6d2c64915ec4d249bfde1196e616e1f644f42da5 | 9a0524e7b598e8c1839af6a67cdfc3fc72814114 | dbanziziki/cpp_modules | /cpp_module_04/ex01/Dog.hpp | C++ | hpp | 357 | no_license | #ifndef __DOG_H__
#define __DOG_H__
#include "Animal.hpp"
#include "Brain.hpp"
class Dog : public Animal {
private:
Brain *_brain;
/* data */
public:
Dog(void);
Dog(std::string type);
virtual ~Dog();
Dog(Dog const &src);
Dog &operator=(Dog const &rhs);
virtual void makeSound();
... |
1d1291d0a95b677040db09432ecc0b9b29b68091 | f18f89dbfc58a3fe86603e795118b4d1d0d0d54d | xgy1221/jdcoin | /src/test/DoS_tests.cpp | C++ | cpp | 6,084 | no_license | // Copyright (c) 2011-2014 The Bitcoin Core developers
// Copyright (c) 2019 The JDCOIN developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
//
// Unit tests for denial-of-service detection/prevention code
//
#inclu... |
27441b74da8c8af4ee1270dd628d1fdeae4df083 | 0df58f0bf877c937094aa467f980cc87adcc97f0 | njoy/ENDFtk | /src/ENDFtk/tree/Section.hpp | C++ | hpp | 2,063 | permissive | #ifndef NJOY_ENDFTK_TREE_SECTION
#define NJOY_ENDFTK_TREE_SECTION
// system includes
// other includes
#include "boost/hana.hpp"
#include "range/v3/view/subrange.hpp"
#include "ENDFtk/HeadRecord.hpp"
#include "ENDFtk/section.hpp"
#include "boost/hana.hpp"
namespace njoy {
namespace ENDFtk {
// hana namespace decl... |
dc55b93ddf6775dd516800b3da2c732a994df53a | dc16fe76399b1ddcd7fedb282b68cb1b2ad20816 | ningfengh/practice | /linked_list_c/83_Remove_Duplicates_from_Sorted_List.cpp | C++ | cpp | 1,187 | no_license | #include <iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
void AppendList(ListNode** head, int value)
{
ListNode *appnode = new ListNode(value);
ListNode *temp = *head;
if (*head == NULL)
{
*head = appnode;
}
... |
8319f87bd1737d4cdeb7d2c004bb0578c3fd3ef9 | f85e7ed50da7666e98d5c850d652995540ed02b3 | vxl/vxl | /contrib/brl/bbas/volm/exe/volm_evaluate_output_tiles.cxx | C++ | cxx | 4,176 | no_license | //:
// \file
// \brief executable to evaluate output tiles using the ground truth camera
// \author Ozge C. Ozcanli
// \date Nov 18, 2012
#include <volm/volm_io.h>
#include <volm/volm_tile.h>
#include "vul/vul_arg.h"
#include "vul/vul_file.h"
#include "vil/vil_image_view.h"
#include "vil/vil_load.h"
#include <bkml/bkm... |
dfd007c3321d810094a97a0ad94fd94f848d0422 | b17d6fa727a7221274256255d83d25d5e216728c | yazevnul/ysda-search-engine | /src/library/crawler/simple_crawler_impl/urls.cpp | C++ | cpp | 1,125 | no_license | #include "urls.h"
#include <library/save_load/save_load.h>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#include <cassert>
// ysave_load::{Load,Save} specializations BEGIN
template <>
void ysave_loa... |
7d300b5f8d5027dfbaf7d1d03d7b777f2b936618 | ab9cdba3d0f60710e71c55fd5a7788f7e043d6de | lynch829/Gate | /source/general/include/GateApplicationMgr.hh | C++ | hh | 2,937 | no_license | /*----------------------
Copyright (C): OpenGATE Collaboration
This software is distributed under the terms
of the GNU Lesser General Public Licence (LGPL)
See GATE/LICENSE.txt for further details
----------------------*/
#ifndef GateApplicationMgr_H
#define GateApplicationMgr_H 1
#include "globals.hh"
#... |
f33d68e1419c4d63e325495ad5732c788be33593 | 03310232e9a55866807b9bcdb5eed4dcd05704df | google-research/structured-additive-IR | /sair_attributes.cc | C++ | cc | 65,282 | permissive | // Copyright 2020 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... |
776b98c82183803b9548f2f908ff1e6e7519ef87 | ee50dd344f3e2e6d0cdbec82f005eac50ea88915 | ngtranminhtuan/Algorithm-Immediately | /07. Heap/1 [hackerearth] Monk and Multiplication Sol 2.cpp | C++ | cpp | 1,181 | no_license | // Problem: Monk and Multiplication
// Link: https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/practice-problems/algorithm/monk-and-multiplication/
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> minHeap;
long lon... |
26123a3f4a975680c77953e1966ff8b58690bb12 | dee624ffae4b89e2f6024a4a1fcf321a1129fbfd | nrupprecht/GFlow | /GFlowSim/src/compute/neighbor-history.cpp | C++ | cpp | 392 | no_license | #include "neighbor-history.hpp"
namespace GFlowSimulation {
int& NeighborHistory::in_contact(const int id0, const int j) {
// See if id1 is in id0's contact vector.
return contact_vector[id0][j];
}
real& NeighborHistory::value(const int id0, const int j) {
// Return the history value. For the sake ... |
650a517363fbd16e9a36b989881704e269fd0e02 | 0f13e4ea317312daae8472d7a204361ddd161bd0 | tao558/kwiver | /vital/types/detected_object_set_util.cxx | C++ | cxx | 2,516 | permissive | /*ckwg +29
* Copyright 2019 by Kitware, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of... |
0835d65e383d7aa6ea049657fa059cf927e90675 | f9842534590e50de8922199c183e4716ffc9f863 | g-akash/spoj_codes | /weighting_the_stones.cpp | C++ | cpp | 1,350 | no_license | #include <iostream>
#include <vector>
#include <unordered_map>
#include <string>
#include <math.h>
#include <map>
#include <queue>
#include <algorithm>
#include <list>
using namespace std;
#define ll long long int
#define umm(x,y) unordered_map<x,y >
#define pb push_back
#define foi(n) for(int i=0;i<n;i++)
#define f... |
6c1b0bd5e4d658b0d4f68e8647b0fb3ef82b8a46 | 26683c4d390c92e6b53d4bfab225cb20501f025f | shachash1984/ConcurrencyAndParallelism | /ConcurrencyAndParalellism/FileMonitor.cpp | C++ | cpp | 1,385 | no_license | #ifndef _SILENCE_TR2_SYS_NAMESPACE_DEPRECATION_WARNING
#define _SILENCE_TR2_SYS_NAMESPACE_DEPRECATION_WARNING
#include <filesystem>
#include <vector>
#include <string>
#include <iostream>
#include <future>
using namespace std::tr2::sys;
using namespace std;
class FileMonitor
{
public:
void push_back(string file)
{... |
4cca0334912c14afba92158bee1cb7faf4da7dd3 | b06a70dfcc973c05f3e2941e3b47a1d99a31d339 | jesuswr/cp-codes-and-problems | /E1.weights_division.cpp | C++ | cpp | 2,125 | no_license | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <string>
#include <cstring>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pair<i... |
365a15011a8b003ed7f42ca51e7caa8e7806ee3a | 4509ca3d7aadf95d3d1c0351476e946d0deeb900 | mrnuku/sunrise | /win32/con_win.cpp | C++ | cpp | 25,019 | no_license | #include "precompiled.h"
#pragma hdrstop
/*#include <errno.h>
#include <float.h>
#include <fcntl.h>
#include <stdio.h>
#include <direct.h>
#include <io.h>
#include <conio.h>*/
using namespace WindowsNS;
const int MAX_EDIT_LINE = 256;
typedef struct autoComplete_s {
bool valid;
int length;
char completionS... |
aee2622333e6a50e1810e4b7f0662629f3c7c113 | 1f93c807bfe33cddd315a7ffc3efd78a0d9a4c44 | JohanMabille/boost.simd | /bench/function/simd/is_ngtz/regular.int32_t.m10_10.cpp | C++ | cpp | 838 | permissive | // -------------------------------------------------------------------------------------------------
// Copyright 2017 - NumScale SAS
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE.txt or copy at
// ... |
c46db0531db16f3cc111bf35ba1a422f0fda0e0f | 49de6cafb9c30652aacf5ebb2242269ed411c8ed | KqSMea8/sstd_library | /sstd_boost/sstd/libs/hana/test/_include/auto/length.hpp | C++ | hpp | 1,421 | permissive | // Copyright Louis Dionne 2013-2017
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
#ifndef BOOST_HANA_TEST_AUTO_LENGTH_HPP
#define BOOST_HANA_TEST_AUTO_LENGTH_HPP
#include <sstd/boost/hana/assert.hpp>
#include <sstd/boos... |
81d48e7d878345a55bf145033ae869bbf05cca6d | 18033df220feed704e6a869d48fdcc38f6ee3217 | yoavamit/tink | /testing/cc/deterministic_aead_impl_test.cc | C++ | cc | 4,333 | permissive | // Copyright 2020 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in w... |
45d0e068273916c4b901a9d02958beae2c4e5a65 | a51b19af886bb4f3f1d43640d1fcac999a67a2dc | wallydz/chromium-1 | /ui/display/display_util.cc | C++ | cc | 1,228 | permissive | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/display/display_util.h"
#include "base/logging.h"
namespace ui {
namespace {
// A list of bogus sizes in mm that should be ignored.
// Se... |
0ffed3b8823ff201c72494a3b1d722b0d43ce140 | 09b8c9dc91d4fc7178c0d6306de433f49012ba16 | xander-sun/sycurobot | /hl_kid_public/Vision_obj/Localisation/Field/GoalObservation.cpp | C++ | cpp | 7,281 | no_license | #include "GoalObservation.hpp"
#include "Field/Field.hpp"
#include "CameraState/CameraState.hpp"
#include "RhIO.hpp"
#include "rhoban_utils/logging/logger.h"
#include "Utils/Interface.h"
static rhoban_utils::Logger out("GoalObservation");
using Vision_obj::Utils::CameraState;
using namespace rhoban_geometry;
usin... |
2176659f6221a1c40557a6c0e0048fbb32eb4825 | b7b4d34de2f216f364f83bc855badb6193c1c7fb | ClintonKildepstein/FarDroid | /Lang.hpp | C++ | hpp | 1,156 | no_license | #ifndef lang_hpp
#define lang_hpp
enum
{
MTitle,
MOk,
MCancel,
MYes,
MNo,
MAlwaysYes,
MAlwaysNo,
MRetry,
MRetryRoot,
MSkip,
MConfTitle,
MConfAddToDisk,
MConfAddToDiskLabel,
MConfPrefix,
MConfSafeMode,
MConfNative,
MConfBusybox,
MConfShowLinksAsDirs,
MConfShowAllFilesystems,
MConfUseSU,
MCo... |
6407a900621d4f6d3aa65a074b066e07a2353005 | 475b36a070ebacd647ceee244fb9e5ef33b653e4 | fahimfarhan/praetorian-opengl | /offline-4/crammer.cpp | C++ | cpp | 378 | permissive | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
Vector3f b;
A << 1,2,3, 4,5,6, 7,8,10;
b << 3, 3, 4;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the vector b:\n" << b << endl;
Vector3f x = A.colPivHouseholderQr()... |
5548f239b6d46260e20a35647af25b2c13739515 | 7ba57a595c72fc02641139688d7c535cd05f56e3 | pandaming/my_leetcode | /src/flattenBinaryTreeToLinkedList.cpp | C++ | cpp | 1,105 | no_license | // Given a binary tree, flatten it to a linked list in-place.
// For example,
// Given
// 1
// / \
// 2 5
// / \ \
// 3 4 6
// The flattened tree should look like:
// 1
// \
// 2
// \
// 3
// \
// 4
// \
// 5
// ... |
7f798abe1459a4a7652a3dfff6ae8511656ed505 | b42b701dbe746b630ece5f384b6f8e4539a2a41b | mfacchinelli/tudat | /Tudat/Astrodynamics/EarthOrientation/terrestrialTimeScaleConverter.cpp | C++ | cpp | 3,074 | permissive | /* Copyright (c) 2010-2018, Delft University of Technology
* All rigths reserved
*
* This file is part of the Tudat. Redistribution and use in source and
* binary forms, with or without modification, are permitted exclusively
* under the terms of the Modified BSD license. You should have receiv... |
ad106c9e9ec22c43ecb36c6851d04bf50bbe0275 | 6e824139cb6ce01f7bef2ed1a7d3baef5c0b1189 | cadviz/AHRUnrealEngine | /Engine/Source/Editor/BlueprintGraph/Private/K2Node_FunctionResult.cpp | C++ | cpp | 3,135 | no_license | // Copyright 1998-2015 Epic Games, Inc. All Rights Reserved.
#include "BlueprintGraphPrivatePCH.h"
#include "KismetCompiler.h"
#include "VariableSetHandler.h"
struct FFillDefaultPinValueHelper
{
private:
static void FillInner(const UEdGraphSchema_K2* K2Schema, UEdGraphPin* Pin)
{
if(K2Schema && Pin)
{
const... |
1511254c4657418531c511a21a57e59139ec3f49 | 8628768d91f5efb93067fb2f3764af8e3290862c | nv-chromium/chromium-crosswalk | /content/browser/indexed_db/indexed_db_database.cc | C++ | cc | 73,822 | permissive | // Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/indexed_db/indexed_db_database.h"
#include <math.h>
#include <limits>
#include <set>
#include "base/auto_reset.h"
#include... |
b40f22e466c1f2c1ab6b131655e7bb28a15af748 | c88a655eff9a3902340079eedd76c61baea4430e | esoobservatory/fitsliberator | /boost/library/boost/math/distributions/poisson.hpp | C++ | hpp | 23,062 | no_license | // boost\math\distributions\poisson.hpp
// Copyright John Maddock 2006.
// Copyright Paul A. Bristow 2007.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
// or copy at http://www.boost.org/LICENSE_1_0.txt)
// Poisson distribu... |
65f798bdcb587bac3ba22ca9905b1a262f3fc2ba | a3668edeced95a7076c799b612a94f9ae6dbbfba | strigazi/athena | /MuonSpectrometer/MuonCnv/MuonIdCnv/src/MuonIdCnv_entries.cxx | C++ | cxx | 526 | permissive | /*
Copyright (C) 2002-2018 CERN for the benefit of the ATLAS collaboration
*/
#include "MDT_IDDetDescrCnv.h"
#include "CSC_IDDetDescrCnv.h"
#include "RPC_IDDetDescrCnv.h"
#include "TGC_IDDetDescrCnv.h"
// for nSW
#include "sTGC_IDDetDescrCnv.h"
#include "MM_IDDetDescrCnv.h"
DECLARE_CONVERTER( MDT_IDDetDescrCnv )
DE... |
2f1c9fa3802dfb9faff49957fca563e08fe341a6 | 10f0f6550756ad5f5b7888fa4761cb149199f4c4 | LeBrendanJames/NBA_Simulation | /Simulation/player.cpp | C++ | cpp | 5,292 | no_license | //
// Created by Brendan on 6/26/2018.
//
#include "player.h"
// Constructor
Player::Player(DBInterface * db, int pID, GameState * gmState){
this->db = db;
this->playerID = pID;
plyrStats = new AdvStats;
calcPriors(gmState);
}
Player::Player(const Player &player){
this->db = player.db;
this... |
0e969e8789b6f1867c189f365707171ab47f9061 | af40ee0031e3a589af97888c8829233fed77570d | make1122/tencentcloud-sdk-cpp | /vpc/src/v20170312/model/IpGeolocationInfo.cpp | C++ | cpp | 9,612 | permissive | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... |
38fcbbeb76b8b287c0974b50e09c797bbb8f1def | 39772b06f3a1f69dcd0e1b8bc5a19213992aad08 | DINOZYAVIER/project-manager | /sources/project_handler.cpp | C++ | cpp | 1,593 | no_license | #include "include/precompiled.h"
#include "include/project_handler.h"
ProjectHandler::ProjectHandler( QJsonArray json, QString id, QString name )
: ProjectFile( id, name )
{
for( auto file : json )
{
QJsonObject fileObject = file.toObject();
QString fileID = fileObject.value( "id" ).toStrin... |
cf340949607bbfb6bce2023ea43287c5fc8df5c0 | 521840c995feaf7855bf4e2af36393b0e716cbcb | dog-pp/Graphics-Physics-Project2 | /RyanHammond-Graphics Proj2/TheEngine/cPlayer.cpp | C++ | cpp | 3,737 | no_license | #include "cPlayer.h"
#include "Input.h"
#include "Render.h"
cPlayer* cPlayer::m_pTheOnePlayer = 0;
cPlayer::cPlayer()
{
this->m_physicsInfo.speed = 5.f;
this->m_physicsInfo.angularSpeed = 5.f;
}
cPlayer* cPlayer::getInstance(void)
{
if (cPlayer::m_pTheOnePlayer == 0)
{
cPlayer::m_pTheOnePlayer = new cPlayer()... |
b4c4e6a76f20bad6a2c052195edda558fe602d8d | 9902f7cc5d45c04c904fdbef12911829593ecac0 | NCAR/lrose-core | /codebase/apps/titan/src/Rview/zoom_calc.cc | C++ | cc | 5,943 | permissive | // *=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
// ** Copyright UCAR (c) 1990 - 2016
// ** University Corporation for Atmospheric Research (UCAR)
// ** National Center for Atmospheric Research (NCAR)
// ** Bo... |
6bb73400492e0a4aedaad846d97895d959830edd | 7650b9a31c70a0dd25002e8f1f7388f6eb3fc2cc | chenyu2202863/smart_cpp_lib | /test/VldTest/VldTest/VldTest.cpp | C++ | cpp | 230 | no_license | // VldTest.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <vld/vld.h>
#pragma comment(lib, "vld")
int _tmain(int argc, _TCHAR* argv[])
{
system("pause");
return 0;
}
|
faea95b7cd596b9f0a7a13211e9267f0732ddc87 | 442a9aebc20b99afcd25e6e50c8f7a8edb96a4cd | IY/getedenus | /EDENCS/UtlVector.hpp | C++ | hpp | 20,633 | no_license | #pragma once
#include <cstring>
#include "UtlMemory.hpp"
template <class T>
inline T* Construct(T* pMemory)
{
return ::new(pMemory) T();
}
template <class T>
inline T* CopyConstruct(T* pMemory, T const& src)
{
return ::new(pMemory) T(src);
}
template <class T>
inline void Destruct(T* pMemory)
{
pMemory->~T();... |
a737d3b6bc6e380b0ade87712751b1046b1a8e2b | fa55c89d73dc642d5cf589413514edcbae11ed33 | Quant2017/Design3D | /Intermediate/Build/Win64/Design3D/Inc/Engine/MaterialExpressionTime.gen.cpp | C++ | cpp | 8,107 | no_license | // Copyright 1998-2019 Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
==============================================================... |
bab9e0e350060e652519e475fb2f48e54beb20e0 | 0decea59168af3959ce28d71f5dc16026e6ed8c0 | laitr01/LearnC- | /ArrowOperator/main.cpp | C++ | cpp | 1,761 | no_license | #include <iostream>
using namespace std;
struct student{
int student_no;
string student_name;
};
int recursive(int n);
int main()
{
//39 | Arrow Operator with Pointers to Access Structure Members | CPP Programming Video Tutorials
student peter;
student *stdStr;
stdStr = &peter;
peter.stude... |
77363202363027a5af68e9dbd3f271a38eba98d6 | fb84a096b153eb3214531921acaf7967e16d1fdc | huaweicloud/huaweicloud-sdk-cpp-v3 | /dds/src/v3/model/ResetPasswordResponse.cpp | C++ | cpp | 568 | permissive |
#include "huaweicloud/dds/v3/model/ResetPasswordResponse.h"
namespace HuaweiCloud {
namespace Sdk {
namespace Dds {
namespace V3 {
namespace Model {
ResetPasswordResponse::ResetPasswordResponse()
{
}
ResetPasswordResponse::~ResetPasswordResponse() = default;
void ResetPasswordResponse::validate()
{
}
web::jso... |
f0321226e489b26239d16304bbff367b8adaa2ca | 4b29374a17e9139bcfc710eef61b299691993348 | yarda/libhidx | /libhidx/include/libhidx/hid/Control.hh | C++ | hh | 5,221 | no_license | //
// hidviz - Tool for in-depth analysis of USB HID devices communication
// Copyright (C) 2017 Ondrej Budai <ondrej@budai.cz>
//
// This file is part of hidviz.
//
// hidviz is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Soft... |
d6c3eacef0accea95de1ed660ab4724aac822d9d | 1b8b46a5da3993d5bfd3320095ad3b20856dfc79 | dickynovanto1103/CP | /Online Judges/Codeforces/Round 747 (Div 2)/e1.cpp | C++ | cpp | 952 | no_license | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define unvisited -1
#define visited 1
#define eps 1e-9
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define uint64 unsigned long long
#define FastSlowInput ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define d... |
cfa9142e826cdccf74785684dcccbd79e200066b | 9eb44d703c457ebd8b2e98ac1f54b23ba62df6a6 | ch-sy/semita | /src/systems/ControlSystem.cpp | C++ | cpp | 2,197 | permissive | // MIT License
//
// Copyright(c) 2019 Christian Seybert
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files(the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, m... |
489bbfa84ce2902cd43e1379b458b1e729368885 | 2d8f02917eb2e048e7d5b65e4f656364275b619c | PixelExperience/hardware_custom_interfaces | /wifi/1.0-legacy/wifi_sta_iface.cpp | C++ | cpp | 27,716 | no_license | /*
* Copyright (C) 2016 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
1d0fd15dd23d5df740eaf41e5a633b635f452815 | 486406328de690f1b64e098361d37c48de91bcd1 | Parantido/sipphone | /src/dskphone/logic/talk/negohelper/negohelper.cpp | C++ | cpp | 19,065 | no_license | #ifdef IF_SUPPORT_VIDEO
#include "negohelper.h"
#include "talk/talklogic/include/modtalklogic.h"
//#include "commonunits/sipsender.h"
#include "talk/talklogic/include/callinfo.h"
#include "media/mediacommonfun.h"
#include "record/include/modrecord.h"
#include <interfacedefine.h>
#define DELAY_SHOW_TIP 500
IMPLEMENT_... |
e17cc7b5f37761891920f17569d642fe850e126c | 2e18c24d761d590d1b366dbf5a5918e10cef243e | agemo999/ParalelaB58060 | /Solucion Etiquetas/buzon.cpp | C++ | cpp | 1,083 | no_license |
#include "buzon.h"
#include <iostream>
using namespace std;
buzon::buzon() {
id=msgget(KEY,IPC_CREAT| 0600);
if(-1==id){
perror("Buzon::Buzon");
exit(7);
}
}
//Se encarga de enviar un mensaje al buzon
int buzon::Enviar(char * veces, char * etiqueta, int tipo ){
size_t len=sizeof(A)-s... |
fd783e69073c3ebbc5de9a4da88e561aeff980a4 | 989255ffb72b173b1c7c682961b97a04cdcbb245 | bkianmajd/image_recognition | /source/components/menu_runner/menu_runner_test.cpp | C++ | cpp | 275 | no_license | #include "components/menu_runner/menu_runner.h"
#include <iostream>
#include "gtest/gtest.h"
namespace poker {
class MenuRunnerTest : public testing::Test {
public:
MenuRunnerTest() {}
protected:
};
TEST_F(MenuRunnerTest, ConstructDestruct) {}
} // namespace poker
|
74a449527d8a5843af06e246b7d552c060dfdde8 | 7be0287b7361bad6fc2535ee3da9c2ec5d112890 | hm3lamps/Data-Structures-and-Algorithms | /queue/LRUcache.cpp | C++ | cpp | 895 | no_license | #include<iostream>
#include<map>
#include<iterator>
#include<list>
using namespace std;
class lruCache{
list<int> cacheKey;
map<int, list<int>::iterator> ma;
int cacheSize;
public:
lruCache(int);
void refer(int);
void display();
};
lruCache :: lruCache(int item){
cacheSize = item;
}
void lruCache::refer(... |
f68a62b3edfda7e777f09b3894cf837af98e61cc | c8a73aea3b23d71994f8bd5711a756b530ac8090 | shouth/CompetitiveProgramming | /ABC/ABC001-100/ABC041-050/ABC042/A_iroha_and_haiku_abc_edition.cpp | C++ | cpp | 483 | no_license | #include <utility>
#include <bitset>
#include <tuple>
#include <string>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <complex>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main() ... |
5eb4ff38fe8a70cdd728bda21cd848307f4c927b | eb07d99597239ac901ee1058c62ff45820ccb241 | wzj1988tv/code-imitator | /data/dataset_2017/dataset_2017_8_formatted/OKuang/8294486_5630967708385280_OKuang.cpp | C++ | cpp | 500 | no_license | #include <cstdio>
using namespace std;
int d, n, k, s;
double ans, tans;
int main() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
int T;
scanf("%d", &T);
for (int tcas = 1; tcas <= T; tcas++) {
ans = 1e32;
scanf("%d%d", &d, &n);
for (int i = 0; i < n; i++) {
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.