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 |
|---|---|---|---|---|---|---|---|---|
76a029faaa9b548c3bb8dca8ff65b64d5d9c51a1 | d0e046dd8f883af6083fe341626d6c9425987f27 | yshry/pcd_round | /project_round.cpp | C++ | cpp | 2,637 | no_license | #include <boost/program_options.hpp>
#include <boost/shared_ptr.hpp>
#include <boost/filesystem.hpp>
#include <pcl/point_cloud.h>
#include <pcl/visualization/cloud_viewer.h>
#include <pcl/io/pcd_io.h>
int main (int argc, char** argv)
{
std::string input_pcd;
namespace po = boost::program_options;
namespac... |
6234d661aeb76924d8efe4329680d3fa9631e129 | 8d84a6ecd6526f4663498c9acc2f207122477847 | sgzwiz/xbox_leak_may_2020 | /xbox_leak_may_2020/xbox trunk/xbox/private/xdktest/cafe6/xtests/debugger/bin/core/src/DisAsm PP/DisAsm PP.cpp | C++ | cpp | 26,177 | no_license | #include <xtl.h> //xbox #include <windows.h>
#include <xmmintrin.h>
const float FLOAT_ZERO = 0;
__int64 GlobalInt64 = 0;
__int64 FloatVal[] = // 32 bit register values for each integer
{
3225419779, // -3
3221225474, // -2
3212836866, // -1
0, // 0
1065353218, // 1
1073741826, // 2
10779... |
e0fa4264a5b6c6e6a300f6e282b5ee32dfc10775 | 1b11daefd281d7af01897a99fe9452845fe55e2d | airpod2/diva2 | /GroundStation/AlgorithmTesting/Module_Input.cpp | C++ | cpp | 6,124 | no_license | #include "Module_Input.h"
bool has_extension(const char *str, const char *suffix);
Module_Input::Module_Input(int sensorType)
{
this->sensorType = sensorType;
}
void Module_Input::setSensorType(int sensorType){
printf("[Module_Input::setSensorType] start\n");
this->sensorType = sensorType;
... |
a743cc2364a594c383817c17ba70f866f67f3828 | 568014fb5602ecc6ba47716d4194499d9a9f05ec | humdevs/humanitylink | /src/qt/askpassphrasedialog.cpp | C++ | cpp | 9,732 | permissive | #include "askpassphrasedialog.h"
#include "ui_askpassphrasedialog.h"
#include "guiconstants.h"
#include "walletmodel.h"
#include <QMessageBox>
#include <QPushButton>
#include <QKeyEvent>
AskPassphraseDialog::AskPassphraseDialog(Mode mode, QWidget *parent) :
QDialog(parent),
ui(new Ui::AskPassphraseDialog),
... |
ab8cf52503a9d83c0e991244b6bd14f042345ac6 | a3b6a9f961cea3252152371b773a4354c69ceba1 | bea-sax/tents-and-trees | /Field1D.cpp | C++ | cpp | 19,201 | no_license | //
// Created by Marcel Baur on 15/11/2020.
//
#include "Field1D.h"
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <iostream>
#include <sstream>
#include "Cell.h"
using namespace std;
void Field1D::generateFromFile(const string &path) {
ifstream file;
file.open(path, ios::in)... |
c42da2b91f1fb6808e91492507500c8131288aa7 | 2895c8e98a623120bbe3f2badb71c125ea0c975d | nbutacm/NBUTACM | /2017级/校赛5.5/WC有趣的暑假时光.cpp | C++ | cpp | 490 | no_license | #include<iostream>
using namespace std;
int main(){
//freopen("/Users/cccccccccchy/compare/WC有趣的暑假时光.in","r",stdin);
//freopen("/Users/cccccccccchy/compare/WC有趣的暑假时光.out","w",stdout);
int t,n,a,b,c,ans;
cin>>t;
while(t--){
cin>>n>>a>>b>>c;
ans=0;
if(n==1) ans=0;
else{
int MIN=min(a,min(b,c));
i... |
ccd1cf6e056e7428f2e685f1b10d3d48f7ac11eb | 530f1fb2826b3f37f8d410edaf12c607dad0d4f4 | zhuhaozhe/cpp_note | /rw_lock/test_rwlock.cpp | C++ | cpp | 867 | no_license | #include "rw_lock.h"
#include <string>
#include <iostream>
#include <utility>
#include <thread>
#include <chrono>
zone::read_write_mutex rwmutex;
void read_function(std::string & str) {
zone::unique_read_lock<zone::read_write_mutex> lock( rwmutex );
std::cout << "read_f: str: " << str << std::endl;
}
void wr... |
03dbf376c6c02ab844bad7dc49689bc8e033479b | 498560bf6b2f19060231fbb9ecc729eb56dd26ab | ashutosh0gupta/llvm_bmc | /examples/litmus/c/run-scripts/tmp_1/Z6.2+pooncerelease+ctrlonceonce+poonceonce.c.cbmc.cpp | C++ | cpp | 40,171 | no_license | // 0:vars:3
// 3:atom_1_X0_1:1
// 4:atom_2_X0_1:1
// 5:thr0:1
// 6:thr1:1
// 7:thr2:1
#define ADDRSIZE 8
#define NPROC 4
#define NCONTEXT 1
#define ASSUME(stmt) __CPROVER_assume(stmt)
#define ASSERT(stmt) __CPROVER_assert(stmt, "error")
#define max(a,b) (a>b?a:b)
char __get_rng();
char get_rng( char from, char to ) ... |
31aab585fe70112f99bfe56afc2be99a0d40867c | 7e3cebcb5d71bab675a149624c201b2b154d88cf | lucastle6969/comp371 | /src/HitBox2d.hpp | C++ | hpp | 815 | no_license | //
// Created by Ben Wiley on 2017-11-26.
//
#ifndef PROCEDURALWORLD_HITBOX2D_HPP
#define PROCEDURALWORLD_HITBOX2D_HPP
#include <limits>
#include <iostream>
#include "entities/DrawableEntity.hpp"
// Class that can test if one x-z box collides with another - can be specified directly
// or generated via DrawableEnti... |
c0be471a1505628a991e3a9cfaa1c9ac8379c614 | e112e6823165d7e9542e5700937e013e25c75732 | a4a881d4/WAVM | /Lib/LLVMJIT/LLVMEmitCore.cpp | C++ | cpp | 15,752 | permissive | #include <memory>
#include <vector>
#include "LLVMEmitFunctionContext.h"
#include "LLVMEmitModuleContext.h"
#include "LLVMJITPrivate.h"
#include "WAVM/IR/Module.h"
#include "WAVM/IR/Operators.h"
#include "WAVM/IR/Types.h"
#include "WAVM/Inline/Assert.h"
#include "WAVM/Inline/BasicTypes.h"
#include "WAVM/Runtime/Runtim... |
dcf6204c7f751f27da4a4658b2540da815b41a54 | 790a72f4e1b839aea92c00e860719441d3afccaa | MrKomish/NotThatNiceLookingDebugger | /src/main.cpp | C++ | cpp | 608 | permissive | #include <iostream>
#include <unistd.h>
#include <sys/ptrace.h>
#include <string>
#include "debugger.h"
#define CHILD_PROCESS_ID 0
int main(int argc, char * argv[]) {
if( argc < 2){
std::cout << "Please enter program name" << std::endl;
return -1;
}
char * programName = argv[1];
... |
077a71fd3bfaa478e8e4d24b4d5f2a494ed7bdf5 | 5affaf816dd1ca590dd919a1bc411dcf2a8b7abe | zy314099208/daily-code-training | /剑指offer/二叉树的深度.cpp | C++ | cpp | 659 | no_license | /*
题目描述
输入一棵二叉树，求该树的深度。
从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。
*/
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
int TreeDepth(TreeNode* pRoot)
{
if (pRoot... |
8471c31437a5b14ddc8aaf171325bad88c799889 | 50b87a82f58e2f249c5d83f16e536e8339959b0c | niuxu18/logTracker-old | /second/download/curl/gumtree/curl_new_log_13986.cpp | C++ | cpp | 497 | no_license | fputs(
" The Bearer Token and user name are formatted according to RFC\n"
" 6750.\n"
"\n"
" If this option is used several times, the last one will be used.\n"
"\n"
" -o, --output <file>\n"
" Write output to <file> instead of stdout. If you are using {} or\n"... |
dc34d9fb28c9c85de1a0dd1267de3b946706a505 | d8418840e5664f2c1d10dca58a7afb01a4d1e642 | jbandela/cppcomponents_rt | /cppcomponents_rt/external/cds-1.4.0/tests/test-hdr/set/hdr_intrusive_michael_set_nogc_lazy.cpp | C++ | cpp | 5,029 | permissive | /*
This file is a part of libcds - Concurrent Data Structures library
See http://libcds.sourceforge.net/
(C) Copyright Maxim Khiszinsky (libcds.sf.com) 2006-2013
Distributed under the BSD license (see accompanying file license.txt)
Version 1.4.0
*/
#include "set/hdr_intrusive_set.h"
#include <cd... |
59e63cf1815e8b098ea730515bbfdb1b27bdc201 | f2cf9d7180cc7148e18f92bbc07d41ed6e6997ac | slowfranklin/synology-ds | /usr/local/x86_64-pc-linux-gnu/x86_64-pc-linux-gnu/sys-root/usr/include/boost/geometry/algorithms/detail/intersection/interface.hpp | C++ | hpp | 8,757 | no_license | // Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// This file was modified by Oracle on 2014.
// Modifications copyright (c) 2014, Oracle and/or its affiliates.
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
// Use, ... |
8efd485c98a4cddba076a6fe8877dd684332fc4f | 5dada3468b2e5f1240e07964772f57e2e5991615 | Turtle-Corder/SR-NewWorld | /SR-Team/Client/Codes/Scene_Stage1.cpp | C++ | cpp | 12,792 | no_license | #include "stdafx.h"
#include "PreLoader.h"
#include "CubeTerrain.h"
#include "Player.h"
#include "Scene_Stage0.h"
#include "Sound_Manager.h"
#include "..\Headers\Scene_Stage1.h"
USING(Client)
CScene_Stage1::CScene_Stage1(LPDIRECT3DDEVICE9 _pDevice)
: CScene(_pDevice)
{
}
HRESULT CScene_Stage1::Setup_Scene()
{
SetW... |
90e02e9c85de14d303c2fd5b44c6e46e6ca5b8a9 | be5ec64ad81bd3049b419950984255ea751d2750 | JonasBurger/interactive_computer_graphics_fau_exercises | /a06/a06.hpp | C++ | hpp | 1,382 | no_license | #pragma once
#include "application.hpp"
#include "helper.hpp"
#include <glm/glm.hpp>
class Heightmap
{
float* pos;
int* ids;
int vertex_data_size, index_data_size;
GLuint vao;
GLuint vbo[2];
int w, h;
void load_to_gpu();
public:
Heightmap(int size);
//~Heightm... |
af9c85b57d9322d33ab91b103dde57c0270f2e51 | ea139a2b48dadcaaf0da63c1ab7f4c2a185349e4 | ikarienator/chromium | /ash/wm/overview/window_overview.cc | C++ | cc | 8,983 | permissive | // Copyright 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 "ash/wm/overview/window_overview.h"
#include <algorithm>
#include "ash/screen_ash.h"
#include "ash/shell.h"
#include "ash/shell_window_ids.h"
#... |
1c0272a89832e0fb9b74da2ae0af81854792ec2a | 4cbd8125cbda1c7a89317325ecf8139c395e645c | jonathanpoelen/falcon | /falcon/helper/use_const_reference.hpp | C++ | hpp | 338 | permissive | #ifndef FALCON_HELPER_USE_CONST_REFERENCE_HPP
#define FALCON_HELPER_USE_CONST_REFERENCE_HPP
#include <falcon/type_traits/use_def.hpp>
namespace falcon {
namespace _aux {
FALCON_USE_XXX_TRAIT_NAMED_DEF(const_reference, use_const_reference);
}
template <class T>
struct use_const_reference
: _aux::use_const_reference<... |
b2926dde8aa3bdf424e1c99b873ca6297e92d886 | b3a04b4fa94a739c59a5a98049171f0e4b07f4c7 | johnny-mac/play | /CodeGen/src/Jitter_CodeGen_x86.cpp | C++ | cpp | 37,223 | permissive | #include <functional>
#include <array>
#include <assert.h>
#include "Jitter_CodeGen_x86.h"
//Check if CPUID is available
#ifdef _WIN32
#define HAS_CPUID
#define HAS_CPUID_MSVC
#include <intrin.h>
#endif
#if defined(__linux__)
#if defined(__i386__) || defined(__x86_64__)
#define HAS_CPUID
#define HAS_CP... |
28168425a4814759ce74212921c3a205cb985409 | f17e19de0573c665a1cbe7b0653dd7a606f04808 | gabrielrussoc/competitive-programming | /simulado-obi/d.cpp | C++ | cpp | 799 | no_license | #include <cstdio>
#include <cstring>
#include <map>
#define pii pair<int,int>
#define mp make_pair
using namespace std;
int w,D,V;
int d[12];
map<pii,int> memo;
int dp(int n, int l){
if(l < 0 || n < 0) return 0;
if(l == 0 && n == 0) return 1;
if(memo.find(mp(n,l)) != memo.end()) return memo[mp(n,l)];
... |
91b3aa3f2135f22dc7265482d8f9688c4a875250 | 165e848702ee74d66dfe8783f2f888182b4e9c5a | iyoungman/algorithm-cpp | /Programmers/Programmers/입력개수 모를떄.cpp | C++ | cpp | 372 | no_license | #include <iostream>
#include <vector>
using namespace std;
int main() {
int num;
vector<int> a;
int count;
scanf("%d", &count);
//입력 개수 제한이 없을때 입력 후 벡터에 저장
do {
cin >> num;
a.push_back(num);
} while (getc(stdin) == ' ');
//벡터 출력
for (int i = 0; i < a.size(); i++)
{
printf("%d\n", a[i]);
}
ret... |
beca71f333001dfcbf3a98d87d0707702183e722 | 8baccd21589fb3ac74f317d304399f9fe26578e8 | drownedout/datamap | /node_modules/gdal/deps/libgdal/gdal/ogr/ogrsf_frmts/arcgen/ograrcgenlayer.cpp | C++ | cpp | 8,031 | permissive | /******************************************************************************
* $Id: ograrcgenlayer.cpp 27942 2014-11-11 00:57:41Z rouault $
*
* Project: Arc/Info Generate Translator
* Purpose: Implements OGRARCGENLayer class.
* Author: Even Rouault, <even dot rouault at mines dash paris dot org>
*
... |
bde92917e47d5d316b9cfb0d54e36d4375430e36 | fd5a3f7a4ac9c1ac4269da8f7e5cf04f55472123 | zhuchiheng/Adaptive-AUTOSAR | /test/ara/com/helper/ipv4_address_test.cpp | C++ | cpp | 810 | permissive | #include <gtest/gtest.h>
#include "../../../../src/ara/com/helper/ipv4_address.h"
namespace ara
{
namespace com
{
namespace helper
{
TEST(Ipv4AddressTest, Constructor)
{
const uint8_t cFirstOctet = 192;
const uint8_t cSecondOctet = 168;
... |
19e54f43f49916a89b042cb40d864e21e3a420de | 42492521490cac77e2b93e12422452b3d7e216ca | palestar/gamecq | /GCQL/RoomPassword.cpp | C++ | cpp | 1,177 | permissive | // RoomPassword.cpp : implementation file
//
#include "stdafx.h"
#include "gcql.h"
#include "RoomPassword.h"
#ifdef _DEBUG
//#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CRoomPassword dialog
CRoomP... |
0727bf2e9a94d0260add99ce30438e25c853d342 | 13f75cdee03bc51c55acaa95576ea9880131f575 | fngtrade/firstcoin | /src/checkpoints.cpp | C++ | cpp | 3,275 | permissive | // Copyright (c) 2009-2015 The Bitcоin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "checkpoints.h"
#include "chain.h"
#include "chainparams.h"
#include "main.h"
#include "uint256.h"
#include <stdin... |
0b39cae49eb31dcf18f035eadd171ef14939bda4 | f385153729f07f8b5c4f28f8900a980ce93ef483 | rushioda/PIXELVALID_athena | /athena/InnerDetector/InDetValidation/InDetTrackSplitterTool/src/InDetTrackSplitterTool.cxx | C++ | cxx | 38,920 | no_license | /*
Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
*/
/**
InDetTrackSplitterTool.cxx
AUTHOR: John Alison <johnda@hep.upenn.edu>
*/
#include "InDetTrackSplitterTool/InDetTrackSplitterTool.h"
#include "InDetIdentifier/TRT_ID.h"
#include "InDetIdentifier/SCT_ID.h"
#include "InDetRIO_OnTr... |
1e9f4ba830de7692ab0619a9e349d8523a9d1f56 | a2e24f4d94e9fbcd471645b75fd1ee8494615fec | ivan-kits/skia-opengl-emscripten | /src/chromium/ipc/ipc_mojo_bootstrap.cc | C++ | cc | 37,238 | 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 "ipc/ipc_mojo_bootstrap.h"
#include <inttypes.h>
#include <stdint.h>
#include <map>
#include <memory>
#include <set>
#include <utility>
#includ... |
f6ca720a17cced4094ac4fad71a6159dd24a4a66 | 7d985e4e796dfe5f042bb1c48db2043e17a0c015 | bino7/chromium | /services/shell/tests/lifecycle/lifecycle_unittest.cc | C++ | cc | 15,006 | permissive | // Copyright 2016 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 <memory>
#include "base/bind.h"
#include "base/command_line.h"
#include "base/macros.h"
#include "base/memory/ptr_util.h"
#include "base/process... |
f9344b9876cfd24d05c063e20e94c7cb5c6289fc | c2ca3dd34817642bed995d849c0a716a1dbfa47e | djzenma/DM-Cache-Simulator | /Cache.cpp | C++ | cpp | 976 | no_license | //
// Created by Mazen on 13.07.18.
//
#include <iostream>
#include "Cache.h"
using namespace std;
Cache::Cache() {
numIndexBits = static_cast<int>(log2(numLines));
numOffsetBits = static_cast<int>(log2(CACHE_LINE_SIZE));
numTagBits = 32 - numIndexBits - numOffsetBits;
}
// Direct Mapped Cache Simu... |
30a5f54d3f5cc2a98ea64387071f2a5c396e25d2 | 8942df488aa50feaee88fad8051ee892b4ebb99b | amkoxie/proxygen | /proxygen/lib/http/codec/compress/test/HeaderTableTests.cpp | C++ | cpp | 10,463 | permissive | /*
* Copyright (c) 2017, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
*/
#include <fo... |
8812fd82c510e882cacb1d590f03b6040074b4ae | fb7e7c1adb694669d25c4a85e6633fdf7ecb6bff | collaatje/Opdracht3_Weervoorspeller | /Weersvoorspeller/TextueelScherm.hpp | C++ | hpp | 1,056 | no_license | /*
* TextueelScherm.h
*
* Created on: 11 mrt. 2012
* Author: acer
*/
#ifndef TEXTUEELSCHERM_HPP_
#define TEXTUEELSCHERM_HPP_
#include <MAUI/Screen.h>
#include <MAUI/Font.h>
#include <MAUI/WidgetSkin.h>
#include <conprint.h>
#include "WeerData.hpp"
using namespace MAUI;
class... |
3259cd04b9f3198d0c3792c88edbac73f19b5ca5 | c7236d80dfd4d707a1fb83774929205ceb36af32 | denis-belov/xgk | /src/data/vec4/vec4.cpp | C++ | cpp | 2,331 | no_license | // These functions can be used with float[4] and __m128 data storages (4-dim vectors, quaternions).
// Data should be aligned with 16-byte alignment for better performance.
#include <cstdint>
#include <string.h>
#include <cstdio>
namespace XGK {
namespace DATA {
namespace VEC4 {
const uint8_t FLOAT_S... |
7c97122c95da5e459481bdf19b3eaf6ceab010d4 | 3344c5231b04bb7d700867a0d39e03b7e85ac2ce | vslavik/poedit | /deps/boost/libs/fusion/test/sequence/tuple_nest.cpp | C++ | cpp | 1,134 | permissive | /*=============================================================================
Copyright (C) 2015 Kohei Takahshi
Distributed under 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)
=============================================... |
1b690b2d019078de5f5449da180dd8786e6a7047 | c035de7508341503c881d289560677ce1f0521f0 | shubhamp41/chromium | /ui/views/view.cc | C++ | cc | 102,988 | permissive | // Copyright (c) 2012 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/views/view.h"
#include <algorithm>
#include <memory>
#include <utility>
#include "base/callback_helpers.h"
#include "base/check_op.h"
#... |
ffa7da338621d4ea5cecbaef3abc4eed3aefd07f | fd87ab2f70e41c19a75df71ae5a6b106b17cf7ab | LargeDumpling/Programming-Contest | /OnlineJudges/CodeVS/1227 方格取数 2/code.cpp | C++ | cpp | 2,416 | no_license | /*
Author: LargeDumpling
Email: LargeDumpling@qq.com
Edit History:
2016-03-02 File created.
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
const int MAXN=5050;
const int MAXM=40050;
const int INF=1... |
07d7b8620649352dad81a2f3665d367c0f581ca3 | 81cb2af6144cbcb28aa767aae6c25775c4d375ba | ashutosh0gupta/llvm_bmc | /examples/litmus/c/run-scripts/tmp_5/Z6.2+poreleaserelease+fencembonceonce+poacquirerelease.c.cbmc.cpp | C++ | cpp | 40,829 | no_license | // Global variabls:
// 4:atom_2_X0_1:1
// 0:vars:3
// 3:atom_1_X0_1:1
// Local global variabls:
// 0:thr0:1
// 1:thr1:1
// 2:thr2:1
#define ADDRSIZE 5
#define LOCALADDRSIZE 3
#define NTHREAD 4
#define NCONTEXT 5
#define ASSUME(stmt) __CPROVER_assume(stmt)
#define ASSERT(stmt) __CPROVER_assert(stmt, "error")
#define m... |
8ba4d2160b415d06b04cdf73a94b0a5a71828339 | b306093158f6fae64673f0c2de2e07ce0b91097c | coronalabs/corona | /external/Angle/Project/samples/Asteroids/glm/gtx/string_cast.hpp | C++ | hpp | 2,479 | permissive | ///////////////////////////////////////////////////////////////////////////////////
/// OpenGL Mathematics (glm.g-truc.net)
///
/// Copyright (c) 2005 - 2013 G-Truc Creation (www.g-truc.net)
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documentatio... |
8e051695cd0f10a2b3a3ee3147b32b8a124ab19f | a37cb0771d8b262c0e321441d317140bd690bf5a | egparedes/dawn | /dawn/test/unit-test/dawn/Optimizer/Passes/samples/boundary_condition_test_stencil_01.cpp | C++ | cpp | 1,152 | permissive | //===--------------------------------------------------------------------------------*- C++ -*-===//
// _ _
// | | | |
// __ _| |_ ___| | __ _ _ __ __ _
// / _` | __/ __| |/ _` | '_ \ / _` |
// | (_| | || (_... |
deb1e215523189055df64644ef93fff51d4e8b23 | ef765e5e5c49ca6aa0b80027866875565bb50d50 | hungtn95/EECS_268 | /Inheritance with Farm Animal/FarmAnimal.cpp | C++ | cpp | 504 | no_license | /**
* @file : FarmAnimal.cpp
* @author : Hung Nguyen
* @date : 2014.10.02
* Purpose: Implementation of FarmAnimal class
*/
#include "FarmAnimal.h"
FarmAnimal::FarmAnimal()
{
m_name = "unset";
m_sound = "unset";
}
std::string FarmAnimal::getName() const
{
return (m_name);
}
void FarmAnimal::setNam... |
a30aa9d383f58c27d5af50b47205f8a02630bcef | f6941f095697e8b35211c4a7b8b947c37da844ef | yuede/Lintcode | /Cpp/Trailing-Zeros.cpp | C++ | cpp | 291 | no_license | class Solution {
public:
// param n : description of n
// return: description of return
long long trailingZeros(long long n) {
long long res = 5, cnt = 0;
while (res <= n) {
cnt += n / res;
res *= 5;
}
return cnt;
}
};
|
4161014269ce470306d08c9392894336da614499 | 1722ff577e2555cfd9fe38dafd08fa7f43d6546b | dds-bridge/dds | /src/TimerList.cpp | C++ | cpp | 2,740 | permissive | /*
DDS, a bridge double dummy solver.
Copyright (C) 2006-2014 by Bo Haglund /
2014-2018 by Bo Haglund & Soren Hein.
See LICENSE and README.
*/
/*
See TimerList.h for some description.
*/
// #include <sstream>
// #include "dds.h"
#include "TimerList.h"
TimerList::TimerList()
{
TimerList::Reset(... |
5bf3de78bec3b781e38402839e8a3fdf44c03565 | 3bd1e23674c576fe0f818837609a47934771a76b | shadlyd15/Binary-Search-Tree-C- | /main.cpp | C++ | cpp | 2,173 | no_license | // C program to demonstrate insert operation in binary search tree
#include<stdio.h>
#include<stdlib.h>
struct node
{
int key;
struct node *left, *right;
};
// A utility function to create a new BST node
struct node *newNode(int item)
{
struct node *temp = (struct node *)malloc(sizeof(struct node));
... |
6087e8453dc48effc923e2f35b75bb44c8acef1f | 2b13fad89ccb728bcec236f14a821d75bf191cf2 | wjhsmn424896/openvino | /inference-engine/src/readers/ir_reader/ie_ir_parser.hpp | C++ | hpp | 13,737 | permissive | // Copyright (C) 2018-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#ifdef IR_READER_V10
# include <ngraph/node.hpp>
# include <ngraph/op/util/sub_graph_base.hpp>
# include <ie_ngraph_utils.hpp>
#endif // IR_READER_V10
#include <ie_blob.h>
#include <cpp/ie_cnn_network.h>
#include <ie... |
9b341aea2bc23a2db0e6c5b864096f296d1a6956 | 2595b77a2f3d3de743a5b161de29e4b2bce73411 | Harshi-99/Programs_ | /longestIncreasingSubsequence.cpp | C++ | cpp | 486 | no_license | #include <bits/stdc++.h>
using namespace std;
subsequence(int a[], int n)
{
vector<int>count(n,1);
for(int i=1; i<n; i++)
{
for(int j=0; j<i; j++)
{
if(a[i] >= a[j] && count[i] <= count[j])
count[i] = count[j] + 1;
}
}
... |
3553b0d0e38e7f90fc6496c51404878f02d3dcf8 | 6a484db2e29a89300fec81872bb48aa9a8f342db | nqqw/ft_containers | /.history/Map_20210602201025.hpp | C++ | hpp | 23,294 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Map.hpp :+: :+: :+: ... |
be475790da3306833ecbd2bd3f1dbcb5bcb6de49 | 58260c1baab05097250a4f58248a85e8800e2feb | markusryoti/matrix-calcs | /main.cpp | C++ | cpp | 2,502 | no_license | #include "mat_math.h"
#include <iostream>
int main(int argc, char const *argv[])
{
bool keep_alive = true;
while (keep_alive)
{
int a_rows, a_columns, b_rows, b_columns;
double **mat_a;
double **mat_b;
double **mat_result;
std::cout << "\nEnter values for matrix A" << std::endl;
set_... |
4d54c7601c3838016a0f195697ba0d3e476c9d8f | c26e3255ee3a9bd0ffd7ca36e8a87881f6240b16 | ParkerWen/fbthrift | /thrift/lib/cpp2/async/RocketClientChannel.cpp | C++ | cpp | 19,854 | permissive | /*
* Copyright 2015-present Facebook, 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 or a... |
880db8e4d674cbd0451564a62a099be8ccae0e66 | c4394c8e1b954d46d22a4dbabefc7d45c6c53751 | jdmoorman/subgraph-matching | /src/svo_bitset.hh | C++ | hh | 6,174 | permissive | /* vim: set sw=4 sts=4 et foldmethod=syntax : */
#ifndef GLASGOW_SUBGRAPH_SOLVER_GUARD_SRC_SVO_BITSET_HH
#define GLASGOW_SUBGRAPH_SOLVER_GUARD_SRC_SVO_BITSET_HH 1
#include <algorithm>
#include <array>
#include <cstring>
#include <limits>
class SVOBitset
{
private:
using BitWord = unsigned long long;
... |
cb6b4089520e359400ce61ba20b99053c04e6ab5 | 6b7b36e3e24d4c7818d3e49723a3c2b5630d209a | ucsd-cse125-sp20/cse125-sp20-group1 | /server/glm-0.9.7.1/test/core/core_type_mat4x4.cpp | C++ | cpp | 10,672 | permissive | ///////////////////////////////////////////////////////////////////////////////////
/// OpenGL Mathematics (glm.g-truc.net)
///
/// Copyright (c) 2005 - 2015 G-Truc Creation (www.g-truc.net)
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documentatio... |
e668f943d453bbbb3412024d715b521262bfa3ff | c284e75241b237ba01d16de88563c88f0c5bda56 | mxmlnkn/scaromare | /common/cudacommon.cpp | C++ | cpp | 4,249 | no_license |
#include <cstdint>
#include <cassert>
#include <iostream>
#include <cstdlib> // malloc, free
#include <cuda.h>
void checkCudaError(const cudaError_t rValue, const char * file, int line )
{
if ( (rValue) != cudaSuccess )
std::cout << "CUDA error in " << file
<< " line:" << line << " : "
... |
1157cc3b7d72b294de1806c37ee0f735bdf54366 | 22d19c1ee575a496e3ca6521afd226934d647c41 | KS0525/Graduation | /MyPG.cpp | C++ | cpp | 10,531 | no_license | #include "MyPG.h"
#include "Task_logo.h"
#define MYDEBUG
#define REFRESHRATE 60
namespace MyPG
{
//---------------------------------------------------------------------------------------
//ウインドウへメッセージの表示
// 引数
// x,y 表示位置
// str フォーマット前文字列
// ... 可変個引数指定
//-----------------------------------------... |
65756c209369dd83fef37cc8a83b9ac316283f97 | 20f7b73b3bf6739151de12e7f98cf3066c87a001 | yair-k/Win2000SRC | /private/windbg64/debugger/wrkspc/windbg.cpp | C++ | cpp | 5,158 | no_license | #include "precomp.hxx"
#pragma hdrstop
#include "cppmacro.h"
//
// WINDBG
//
//
// Transport Layer:
//
CAll_TLs_WKSP::
CAll_TLs_WKSP()
{
const int nRows = 2;
const int nCols = 4;
static LPSTR rgsz[nRows][nCols] = {
{ szWDBG_DEFAULT_TL_NAME, "Debugging on same machine", "tlloc.dll", "" ... |
680bb9717791a088ebd630ccbc3a4b85969813ce | 7545d296e552ddbf1939c0ff0d3036ca06be603e | vaibhavantil/here-data-sdk-cpp | /olp-cpp-sdk-dataservice-read/src/VolatileLayerClientImpl.cpp | C++ | cpp | 11,437 | permissive | /*
* Copyright (C) 2019-2021 HERE Europe B.V.
*
* 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... |
a0ce84bf318b508190c5e53079ad11c1c0c885b4 | 49bc65319b8431eca9b42db60a27a0e6331f7e41 | Redwanuzzaman/OOP-Practice | /Array of objects.cpp | C++ | cpp | 468 | no_license | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;
class Student
{
public:
int arr[5];
void input()
{
for(int i = 0; i < 5; i++)
{
cin >> arr[i];
}
}
int calculateTotalScore()
... |
122963bff0ce8a4ba061f607c2c1d16f4cc45049 | aeb7fd44f00cab69613ecfaea6a5d81c5fd81055 | penguinman-99/DDaBaeC | /CH7/CH7_12/소스.cpp | C++ | cpp | 236 | no_license | #include <iostream>
#include <vector>
using namespace std;
int result = 0;
int func(int a) {
if (a ==1)
return 0;
else if (a == 2)
return 1;
else
return func(a - 1) + func(a-2);
}
int main() {
cout<<func(6);
return 0;
} |
4cf30080cae51493163d940666dd7d14d588959b | 70720aceaf55261d93228658ad8fc633dfb5f55c | BenjaminRubio/CompetitiveProgramming | /Problems/Matcomgrader/MountainRanges.cpp | C++ | cpp | 568 | no_license | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repx(i, a, b) for (int i = (int)a; i < (int)b; i++)
int N, X;
vector<int> A;
int main()
{
cin >> N >> X;
A.resize(N);
rep(i, N) cin >> A[i];
int ans = 0;
rep(i, N)
{
bool done = ... |
289aae518aaf2033f92256bfaadee6b8ac9555f3 | 2b4eee607e2c5b6660ffedf439c5a89a16e790d8 | ahmet-uyar/cudf | /cpp/include/cudf/concatenate.hpp | C++ | hpp | 3,476 | permissive | /*
* Copyright (c) 2020-2023, NVIDIA CORPORATION.
*
* 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... |
64a7a079e5208d8d95deafda035dc4072d267144 | 74d845965677a67780fb37c9bedca79d10fcbccd | timblechmann/nt2 | /modules/boost/simd/swar/include/boost/simd/toolbox/swar/functions/scalar/split.hpp | C++ | hpp | 1,405 | permissive | //==============================================================================
// Copyright 2003 - 2011 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2011 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// Se... |
1f1e9651bf741441e3846972ac94cc7ee825e342 | fa5b419f797ca967a8c2946e59d7a47c2672ddaf | sailfish009/binding_affinity_calculator | /lib/rosetta/source/src/core/energy_methods/MembraneCbetaEnergy.fwd.hh | C++ | hh | 1,032 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
227ae7121a27ab1bdb3475e85cc2008ac909b702 | bb5d3808d072ea4e3bb3ea92a096205843173d01 | vladfridman/wisey | /include/ThreadExpression.hpp | C++ | hpp | 687 | no_license | //
// ThreadExpression.hpp
// Wisey
//
// Created by Vladimir Fridman on 10/16/17.
// Copyright © 2017 Vladimir Fridman. All rights reserved.
//
#ifndef ThreadExpression_h
#define ThreadExpression_h
#include "IExpressionAssignable.hpp"
#include "IVariable.hpp"
namespace wisey {
/**
* Represents the curre... |
42077f105b97ba0c46cd41daecdbf18cf58c603c | 373986045c26adad749a4c856be422df1f497e52 | simdc3d/SimDC3D-Desenvolvimento | /FNSS-Protocol-Stack.cpp | C++ | cpp | 274 | no_license | #include "FNSS-Protocol-Stack.h"
namespace fnss {
ProtocolStack::ProtocolStack(const std::string &name_) : name(name_) {}
std::string ProtocolStack::getName() const {
return this->name;
}
void ProtocolStack::setName(const std::string &name_) {
this->name = name_;
}
} |
7ce74bc3e65f17f9c3eb0f86b3c3e73d42de5813 | a7ef852a6a536f23ff14b1d97232c064e0118037 | 199ChenNuo/DataBase | /performanceTest.cpp | C++ | cpp | 551 | no_license | #include "test.h"
#include <windows.h>
using namespace std;
void fetchPerformance() {
RBTree tree;
Cache cache;
dataFileName = "data100w.txt";
indexFileName = "indexFordata100w.txt";
treeFromFile(tree, cache);
LARGE_INTEGER nFreq;
LARGE_INTEGER t1;
LARGE_INTEGER t2;
double dt;
QueryPerformanceFrequency(&... |
66d2dd1f7ecb0031fe9e024f6ff60e469bbccedd | ba3248e3de8601c3b5701b4ac21c4376a55fb4df | tongxingwy/chromium-1 | /net/base/sdch_manager_unittest.cc | C++ | cc | 25,151 | 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 <limits.h>
#include <string>
#include "base/logging.h"
#include "base/memory/scoped_ptr.h"
#include "base/strings/stringprintf.h"
#include "bas... |
d30c1f52eac97461c8489da922fd0b0e4e9dc658 | 6ac29d0155b718b9a2d8e88942483c829a856241 | annaliceN/CarpentryCAD | /Features/Matrix4D.cpp | C++ | cpp | 25,453 | no_license |
#include "Matrix4D.h"
#include <sstream>
using namespace Base;
Matrix4D::Matrix4D(void)
{
setToUnity();
}
Matrix4D::Matrix4D(float a11, float a12, float a13, float a14,
float a21, float a22, float a23, float a24,
float a31, float a32, float a33, float a34,
float a41, float a42, float a43, float a44)
{
dMtrx4D[0... |
8e09b3b9b47f8a65dbadef00b4a65f82032bf062 | 90d2ae625136517054398638aab6ba3bbd34700b | 15831944/job_mobile | /lib/lib_XT12/Samples/DockingPane/DynamicPanes/MainFrm.cpp | C++ | cpp | 13,456 | no_license | // MainFrm.cpp : implementation of the CMainFrame class
//
// This file is a part of the XTREME TOOLKIT PRO MFC class library.
// (c)1998-2008 Codejock Software, All Rights Reserved.
//
// THIS SOURCE FILE IS THE PROPERTY OF CODEJOCK SOFTWARE AND IS NOT TO BE
// RE-DISTRIBUTED BY ANY MEANS WHATSOEVER WITHOUT THE EXPRES... |
f69cc63ebdff562554e001cb8df267318f75b7a9 | 0a1bf2a59ca2407dd90cecab74c0a7c075b1014d | junxzm1990/ASAN-- | /testcases/juliet_test_suite/testcases/CWE415_Double_Free/s02/CWE415_Double_Free__new_delete_wchar_t_81_bad.cpp | C++ | cpp | 923 | no_license | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE415_Double_Free__new_delete_wchar_t_81_bad.cpp
Label Definition File: CWE415_Double_Free__new_delete.label.xml
Template File: sources-sinks-81_bad.tmpl.cpp
*/
/*
* @description
* CWE: 415 Double Free
* BadSource: Allocate data using new and Deallocae data usi... |
23facb724560802fe898f838d672423a13cbb9fc | f932850de693579bf305debe62c1c0b584b09fd8 | 17636191639/SneakerTrading | /network/mysocket.cpp | C++ | cpp | 5,748 | no_license | #include "mysocket.h"
#include <QMap>
#include <QDataStream>
#include <QDebug>
#include "globalvars.h"
#include <QBuffer>
#include <QImage>
MySocket::MySocket(QTcpSocket *socket, QObject *parent) : QObject(parent)
{
m_tcpBlockSize = 0;
m_socket = socket;
connect(m_socket, SIGNAL(disconnected()),
... |
a5c5396f38667464afbf4a7b625d21760b8514a2 | b07320facb9ebf1254f7d54daedd88912fd9a4b7 | puyuliao/ZeroJudge | /c714.cpp | C++ | cpp | 3,192 | permissive | #include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define N 50006
#define int int64_t
const int INF = 1e6;
struct treap{
treap *l,*r;
int key,pri,sz,data,keytag,datatag;
treap(int _k,int _d):key(_k),data(_d),sz(1),pri(rand()),keyt... |
cf25c8a664ddff2a177a9bef656ca26e5ac1b483 | 0883dc4080c03f6bb4cc720edc0f7cfd13c9d819 | kmhatre118/ME210_Final_Project | /src/main.cpp | C++ | cpp | 7,994 | no_license | #include <Arduino.h>
#include "Teensy.h"
#include <Metro.h>
#define LINE_LEFT_THRESH 200
#define LINE_RIGHT_THRESH 110
#define PUSH_THRESHOLD 30
#define IR_THRESHOLD 50
void turnRight(void);
void RespToKey(void);
uint8_t TestForKey(void);
void readIRSignal(void);
void checkGlobalEvents(void);
void oreintToBeacon(v... |
426ded91e976ca371af90fc938ad153da33cf62f | 749dcc58f4f9f12d28198f084de89eafcc4f3198 | naiza2000/learning101 | /New folder/Pointer.cpp | C++ | cpp | 254 | no_license | #include <stdio.h>
void update(int *a,int *b) {
*a=*a+ *b;
*b =*a- *b-*b;
if(*b<0)
*b = -*b;
}
int main() {
int a, b;
int *pa = &a, *pb = &b;
scanf("%d %d", &a, &b);
update(pa, pb);
printf("%d\n%d", a, b);
return 0;
}
|
99b84b50e706c5c43e01096512baf66603e6e41f | 0799a969332faf9a99ae13ab39eeeb8953a7334a | xxzl0130/ProgrammingExperience | /source/RobotController/RobotControllerGUI/GeneratedFiles/RelWithDebInfo/moc_RemoteSetDialog.cpp | C++ | cpp | 6,005 | permissive | /****************************************************************************
** Meta object code from reading C++ file 'RemoteSetDialog.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.11.1)
**
** WARNING! All changes made in this file will be lost!
****************************************************... |
df3dc9ef6d539520d703a3be740f47b3c09e4ec6 | 236ddec29ab6f21fe9f0ed35d5bb69ba0d5b3613 | qingyunerya/QTRaspiProject | /first/mainwindow.cpp | C++ | cpp | 2,923 | no_license | #include "mainwindow.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
wiringPiSetup();
ui->setupUi(this);
pinMode(23,OUTPUT);
pinMode(24,OUTPUT);
pinMode(25,OUTPUT);
index=0;num=0;num2=0;
timer1=new QTimer(this);
... |
c34d6453e45a312c289922f75b2327075e8bb1f2 | 3a28c8dd86e6a438d563ee59564288da0abcb5c5 | xulongjun/Leetcode | /May-LeetCoding-Challenge/31-Edit-Distance/Edit-Distance.cpp | C++ | cpp | 615 | no_license | class Solution {
public:
int minDistance(string word1, string word2) {
int n = word1.size();
int m = word2.size();
vector<vector<int>> dp(n+1, vector<int>(m+1, 0));
for (int i = 1; i <= m; i++) dp[0][i] = i;
for (int i = 1; i <= n; i++) dp[i][0] = i;
for (int... |
5ee320ed453c6802b47c898b7d307dd821352ef0 | 2f2358ccd9e743631bdafe488949d3c2944441c8 | JonForShort/jones-debugger | /source/main_window.cc | C++ | cc | 2,048 | permissive | //
// MIT License
//
// Copyright 2019
//
// 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, modify, merge, publi... |
ddfec27929fb79b4653e07ca9253bc4dd47218df | 50bdad5e8520763725f65b63db3ae80e0de553e4 | FishinLab/Algorithms_FisHinLab | /introduction_for_algorithms/quick_sort/quick_sort.cpp | C++ | cpp | 1,287 | no_license | #include <iostream>
#include <vector>
using namespace std;
void partition(vector<int>* p_src_data , int start, int end, int sep)
{
int c = 1;
int limit = end - start + 1;
int i_begin = *(p_src_data->begin());
while(c < limit)
{
if(i_begin > (*p_src_data)[c])
{
int tmp ... |
54bfe9e53b5219bdafd451541ddf9f5ba5498d40 | c04184a147776fcde687d9cd1ea7a27debe8a87c | LinLidi/Search-engine-word-segmentation-module | /Datastruct&Algorithm:数据结构和算法/Code/DCM_mergrSort.cpp | C++ | cpp | 854 | no_license | void Merge(int r[],int rNew[],int s,int m, int t){ // i,j分别指向两个待合并的有序子序列，k指向最终有序序列的当前记录
int i=s;
int j=m+1;
int k=s;
while (i<=m && j<=t){
if (r[i]<=r[j])
rNew[k++] = r[i++]; //取r[i]和r[j]中较小者放入r1[k]
else rNew[k++] = r[j++];
}
while (i<=m)
rNew[k++] = r[i++]... |
6fb9f57735467dc2a6d5cdcc504be337562d1fb7 | 4b1dbf400efcd4cac9b06e2844bb89f2a8a50a80 | webstorage119/File-Locker | /src/locker.cpp | C++ | cpp | 551 | permissive | #include <iostream>
#include <string>
#include "append_sfx.h"
using namespace std;
int main( int argc, char* argv[] )
{
try
{
if ( argc < 4 )
{
cout << "Usage : " << argv[0] << " <plain_text_path> <key> <output_path>\n";
return -1;
}
const string rawSfxPath = "bin/sfx";
const string plainTextPath = a... |
929e5bf3e25cb12a67cbac43ca674e34ca95cc96 | 81d509f236230e79b15b7c739101241a5886b04c | TechSmith/desktop-duplication-cpp | /src/base_renderer.cpp | C++ | cpp | 4,583 | permissive | #include "base_renderer.h"
#include "renderer.h"
#include "meta/array.h"
#include "PlainPixelShader.h"
#include "VertexShader.h"
using error = renderer::error;
base_renderer::base_renderer(init_args && args)
: device_m(std::move(args.device))
, deviceContext_m(std::move(args.deviceContext))
{
createDiscreteSamp... |
0f4ffbadb233b030e64b93de7f17f13b3950dc3a | 83afeaa3277db325c808d1996eb162731b3f9fe1 | xiaotdl/a_tour_of_cpp | /ch2_user_defined_types/test_union.cpp | C++ | cpp | 1,036 | no_license | #include <iostream>
using namespace std;
// A union is a struct in which all members are allocated at the same address
// so that the union occupies only as much space as its largest member.
// Naturally, a union can hold a value for only one member at a time.
// For example, consider a symbol table entry that ho... |
f8394e76b02ec1e1d75598fa293fb2a884a9bb60 | 896b7971bd933bd55ea789dda0d2c23886181cf5 | rishithellathmeethal/Kratos | /kratos/sources/mat_variables.cpp | C++ | cpp | 11,150 | permissive | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ \.
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main authors: Josep Maria Carbonell
//
// System in... |
7e7b1db03a2e2e80e4a185217ede21bce44bf8d3 | e6ebb99cdaac786cb53cc1177c9c320e4e201f30 | strigazi/athena | /DetectorDescription/AGDD/AGDDHandlers/src/mposWedgeHandler.cxx | C++ | cxx | 1,029 | permissive | /*
Copyright (C) 2002-2020 CERN for the benefit of the ATLAS collaboration
*/
#include "AGDDHandlers/mposWedgeHandler.h"
#include "AGDDKernel/AGDDPositioner.h"
#include "GeoModelKernel/Units.h"
#include <iostream>
#include <vector>
mposWedgeHandler::mposWedgeHandler(std::string s):XMLHandler(s),p(0)
{
}
void mpos... |
f356a529b6a8ad794f3a95a4bd469b6509780a01 | de221bc94325fa44f6e33b66737de7952b3895d0 | hengyuanzhi/LeetCode_OJ | /Git_LeetCode/main.cpp | C++ | cpp | 705 | no_license | #include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include "defstruct.h"
#include"168_ExcelSheetColumnTitle.cpp"
using namespace std;
int main()
{
Solution solu;
//TreeNode *t = new TreeNode(1);
//t->left = new TreeNode(2);
//t->right = new TreeNode(3);
//TreeNode* t = new Tree... |
3f18c930a7260bdaaf89f0a669fd4f0baa3e80c3 | c4bfdbde65943b2e7809fcf712b2249328d6032a | tell271/tell | /src/save/arg.cc | C++ | cc | 1,034 | no_license | #include "tell/arg.h"
#include <cassert>
#include <cstdlib>
#include <iostream>
tell::Arg_base::Exception::Exception(const std::string& msg,
const std::string& arg)
: std::runtime_error(msg + ": " + arg)
{
}
void tell::Arg_base::parse(int argc, const char* argv[])
{
Arg<bool> usg("-h", "print usage info... |
32e7ec070af99620ea3d377b15817169e868fea0 | 431c2f52dc4073fe228f857b1953fe7aec652722 | MutazManaa/Huji-Programming-Proj2014-2017 | /cpp workshop Huji 2015/ex2/MIR.cpp | C++ | cpp | 3,100 | no_license | /*
* MIR.cpp
*
* Created on: Sep 8, 2015
* Author: mutazmanaa
*/
#include <list>
#include <map>
#include <vector>
#include <string>
#include <sstream>
#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <cstdlib>
#include <cassert>
#include <cstdio>
#include <fstream>
#incl... |
75a43389d3d44b412c2791ad1f00fe49f771fba0 | c72828b8cfcd1ce6bac23cab043f42a2331c9dd7 | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/windows/appcompat/shims/general/forcedirectdrawemulation.cpp | C++ | cpp | 1,723 | no_license | /*++
Copyright (c) 2000 Microsoft Corporation
Module Name:
ForceDirectDrawEmulation.cpp
Abstract:
Some applications don't handle aspects of hardware acceleration correctly.
For example, Dragon Lore 2 creates a surface and assumes that the pitch is
double the width for 16bpp. However, this i... |
cb21bba19085acafd73f1d339ec69ffdd6dff2f6 | 8f3f3f2bc8dd5849284e7191889ef4b8d0bdb013 | crazyleeyang/incubator-doris | /be/src/olap/store.cpp | C++ | cpp | 23,718 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
7e3eb282d9e29a6f111959fed443acb71b9679fd | 17bc1ca49b300e415666fb0b43ce0c1848390cc7 | imalikshake/raytracer | /basicRaytracer/Source/skeleton.cpp | C++ | cpp | 9,718 | no_license | #include <iostream>
#include <glm/glm.hpp>
#include <SDL.h>
#include "SDLauxiliary.h"
#include "TestModel.h"
#include <stdlib.h> /* srand, rand */
using namespace std;
using glm::vec3;
using glm::mat3;
#define PI 3.14159265358979323846f
/* --------------------------------------------------------------... |
9e45af97f14e8ca7c412bf7e75a05b1eb6dfbd4e | 68a00bb5a009c289d14d033923c52285bbf5c8ec | iamtend0/projet_apoo | /src/Etudiant.cpp | C++ | cpp | 11,199 | no_license | #include "../header/Etudiant.h"
#include "../header/Experiences.h"
#include "../header/RendezVous.h"
#include <algorithm>
//FONCTEUR
class VectorOfEtudiant
{
const int Numero;
public:
VectorOfEtudiant(const int &numero)
: Numero(numero)
{}
bool operator()(const Etudiant *e) //SURCHARGE DE ()
{
re... |
4840a85ec883f415efaf31947450fa877676ab5c | 9f81f4d9228219becbc43ae87833286a5c3684e2 | tupl/CPP-Playground | /CPPCode-Playground/depth_first_search.cpp | C++ | cpp | 973 | no_license | #include <algorithm>
#include <unordered_set>
class Solution {
public:
void visit(vector<unordered_set<int>>& adjList, vector<bool>& visited, int i) {
unordered_set<int> adj = adjList[i];
visited[i] = true;
for(auto it = adj.begin(); it != adj.end(); ++it) {
int vertex = *it;
... |
7483c003fe400bfb7d257b4a4dc9803e58e2eba0 | 49f330f10159f1ca5b4fdd3e4ca7e09054baf105 | CloudXNS/LDNS-Selector-Windows | /code/third/cpprestsdk/Release/libs/websocketpp/examples/subprotocol_server/subprotocol_server.cpp | C++ | cpp | 1,278 | permissive | #include <iostream>
#include <websocketpp/config/asio_no_tls.hpp>
#include <websocketpp/server.hpp>
typedef websocketpp::server<websocketpp::config::asio> server;
using websocketpp::connection_hdl;
using websocketpp::lib::placeholders::_1;
using websocketpp::lib::placeholders::_2;
using websocketpp::lib::b... |
ed9c4b9ef96ca2f4fe2377a7d5bca26b2855acb8 | da3724ff5e6d62934cabf6b85c2c06e0762d6923 | vinzenz/html5 | /include/html5/html/interface/object.hh | C++ | hh | 229 | permissive | #ifndef GUARD_HTML5_HTML_INTERFACE_OBJECT_HH_INCLUDED
#define GUARD_HTML5_HTML_INTERFACE_OBJECT_HH_INCLUDED
namespace html5 {
namespace html {
namespace interface {
}}}
#endif //GUARD_HTML5_HTML_INTERFACE_OBJECT_HH_INCLUDED
|
af4d19930844a4eefc89b13b7533a59c55bc326c | d0f1f5770fcd31b655e453ebcc6da440e3000f9e | haribaz/IPMP1921 | /week-9/dp/diceThrow.cpp | C++ | cpp | 659 | no_license | class Solution {
public:
int numRollsToTarget(int d, int f, int target) {
vector<vector<long long>> dp(d, vector<long long>(target+1, 0));
for(int j=1; j<=target && j<=f; j++) {
dp[0][j] = 1;
}
for(int i=1; i<d; i++) {
for(int j=1; j<=target;... |
71a32b483ddcbcbee51f69dec100256299fd5b55 | 2bafe95f2007f21a70e73f2514197edde524bb82 | zhanglpg/CppTools | /commonlibs/errorstatus.hpp | C++ | hpp | 848 | no_license |
#ifndef ERROR_STATUS_COMMONLIBS_HPP
#define ERROR_STATUS_COMMONLIBS_HPP
#include "commonlibs/common_errorcode.hpp"
namespace commonlibs
{
template <class saver_implementer>
class errorStatus_Saver
{
protected :
std::string s_errmsg;
unsigned int u_errorcode ;
public:
void se... |
2c628cba708d552614266f0a6293509cae5debff | a7ae271b5ee024f845436c76a484d012eb8d543e | 2bite/ARK-SDK | /SDK/ARKSurvivalEvolved_DinoCharacterStatusComponent_BP_Spider_functions.cpp | C++ | cpp | 1,247 | permissive | // ARKSurvivalEvolved (332.8) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_DinoCharacterStatusComponent_BP_Spider_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//-------------------------------------------... |
e292d6f25e6370170707f3913ab3fd802c189c83 | daa0d6e5f27abb0457f88413d117a689a30028a4 | RTYPE-EPITECH/RType | /RType/Server/Sources/HandleThread.cpp | C++ | cpp | 1,025 | no_license | #include <iostream>
#include <stdexcept>
#include "HandleThread.hpp"
#include "Game.hpp"
#ifdef _WIN32
# include "WThread.hpp"
#else
# include "UThread.hpp"
#endif
HandleThread::HandleThread()
{
#ifdef _WIN32
_t = new WThread();
#else
_t = new UThread();
#endif
}
HandleThread::~HandleThread()
{
delete (_t);
}
boo... |
95ad51b8e2a3069782b1f6c3194e892da2c8dc02 | c15a20e0ced1e72971b4891d548f95a0eadf5e7d | caomw/litiv | /modules/utils/src/GLImageProcUtils.cpp | C++ | cpp | 57,173 | permissive |
// This file is part of the LITIV framework; visit the original repository at
// https://github.com/plstcharles/litiv for more information.
//
// Copyright 2015 Pierre-Luc St-Charles; pierre-luc.st-charles<at>polymtl.ca
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file ... |
f483be5a0145c5cff6e6434e7fc90a08f61ca168 | 49b6313022e0d592bcc397b03b5deb8c4b6bed35 | valentin-dufois/Protocol-Bernardo | /Talkers/Behaviours/T-2/B-21/B-21.hpp | C++ | hpp | 644 | no_license | //
// B-21.hpp
// Talkers
//
// Created by Valentin Dufois on 2020-02-03.
//
#ifndef B_21_hpp
#define B_21_hpp
#ifdef B21
#undef B21
#endif
#include "../../Behaviour.hpp"
class B21: public Behaviour {
public:
B21(): Behaviour(21, // ID
2, // Tree ID
1, // Is tree ... |
a7e8c825d8d8aa54244d56a28fa0470beb0ed93c | d9bee0f7c59960bdd048d9bdf8c13d65cfa8b7ad | gauravengine/CPP_Freak | /450_DSA/lcs.cpp | C++ | cpp | 1,861 | no_license | #include<bits/stdc++.h>
const int mod=1e9+7;
using namespace std;
int lcs(int, int, string, string);
int main()
{
int t,n,k,x,y;
cin>>t;
while(t--)
{
cin>>x>>y; // Take size of both the strings as input
string s1,s2;
cin>>s1>>s2; // Take both the string as ... |
f44acdb6fd85929d6e725a3f7b17052f2e33890d | 3da10bccdb9fe53db3deb86d06a0778c81636f10 | 5GL/5GL | /src/leveldb/issues/issue178_test.cc | C++ | cc | 2,569 | permissive | // Copyright (c) 2018 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
// Test for issue 178: a manual compaction causes deleted data to reappear.
#include <iostream>
#includ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.