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 |
|---|---|---|---|---|---|---|---|---|
76c86f16a39ec4d71677b8f216e064e642892550 | d7a9d4d2dd02d0781719a17108d698856d7bd673 | devangle/nginx-quic | /quic_module/chromium/quic_ngx_stream.cc | C++ | cc | 6,642 | permissive |
/*
* Copyright (C) sunlei
*/
#include "quic_ngx_stream.h"
#include "net/third_party/quiche/src/quic/core/quic_session.h"
#include "net/third_party/quiche/src/quic/platform/api/quic_text_utils.h"
namespace quic {
QuicNgxStream::QuicNgxStream(
QuicStreamId id,
QuicSpdySession* session,
StreamType type,... |
a08c9841e3b4ff877d37b8d81ddfb483ece0c32d | e97d1d7a2ed2b37051fe083c27c62ad61ca94454 | undermoonoldman/Re0-LeetCode | /111.Minimum Depth of Binary Tree/c++/main.cpp | C++ | cpp | 1,058 | no_license | /**111. Minimum Depth of Binary Tree
* Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.*/
#include <iostream>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
... |
6cdd7b942c4b5aea747616735c5f2c18790744aa | d72c0a540185c33827b1e6b9f3b9a840f4d2d931 | lexvandersluijs/ProCamToolkit | /mapamok/src/projector.cpp | C++ | cpp | 7,502 | permissive | #include "testApp.h"
using namespace ofxCv;
using namespace cv;
void projector::initializeFromMesh(ofMesh& objectMesh)
{
int n = objectMesh.getNumVertices();
objectPoints.resize(n);
imagePoints.resize(n);
referencePoints.resize(n, false);
for(int i = 0; i < n; i++) {
objectPoints[i] = toCv(objectMesh.getVertex... |
7a49322f4151cedc0a299ca38635ceb0e6266028 | f76dd554f7181abaa080d2b734b69542221ef0c4 | indigo-dc/oneclient | /test/unit/events/manager_test.cc | C++ | cc | 2,424 | permissive | /**
* @file manager_test.cc
* @author Krzysztof Trzepla
* @copyright (C) 2016 ACK CYFRONET AGH
* @copyright This software is released under the MIT license cited in
* 'LICENSE.txt'
*/
#include "utils.h"
using namespace one::client::events;
struct ManagerTest : public ::testing::Test {
bool handlerCalled = ... |
bb45305f0fd85c3bc0c6effd8e8e800d3d776982 | 58c083d89d68672a524c252d75ff1f830563c51e | hugo-aponte/PersonalProjects | /HashImplementations/main.cpp | C++ | cpp | 5,556 | no_license |
/*
Hugo Aponte
main function for hash object implementations
*/
#include "pa5.h"
/*
The Chaining Hash was faster at searching and removing while the Probeing Hash was faster at inserting items. I was expecting something like this since Probing Hash
does not depend on an extra data structure like C... |
48e6b90901de8940144ae7079bbf8b55437ad416 | c6eb6a1ea322eaa0c5705b93186117a594427140 | ExpLife/Norton_AntiVirus_SourceCode | /Consumer/r12.0.6/src/Engine/ScanMgr/EraserCallbacks.cpp | C++ | cpp | 1,540 | no_license | #include "StdAfx.h"
#include "erasercallbacks.h"
#include "ScanManager.h"
CEraserCallbacks::CEraserCallbacks(void)
{
}
CEraserCallbacks::~CEraserCallbacks(void)
{
}
// Initialization
void CEraserCallbacks::Initialize(CScanManager* pScanMgr)
{
if( pScanMgr )
m_pScanMgr = pScanMgr;
}
//... |
ec09a57a2dedbdb68cdc349e6d9afe804aeebe41 | 2ca29421e249d764f2ac03286a9fd5a3a804c253 | clcheungac/clcheungac.github.io | /TIC1/code/C08/ConstReturnValues.cpp | C++ | cpp | 694 | no_license | //: C08:ConstReturnValues.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Constant return by value
// Result cannot be used as an lvalue
class X {
int i;
public:
X(int ii = 0);
void modify();
};
X::X(int ii) { i =... |
343c9e9fdc800c568b5d8fba92bb24038cef179c | e6be938e81c47e8446fa6828a635821c4b742e0e | celbalrai/BYTZ | /src/test/prevector_tests.cpp | C++ | cpp | 9,181 | permissive | // Copyright (c) 2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <vector>
#include <prevector.h>
#include <reverse_iterator.h>
#include <serialize.h>
#include <streams.h>
#include <tes... |
658fd1c1624239c9bb9ee67f030a995288d2085d | ee1f57d2d44e8e6b565090a4ac86afdbf370a45e | Ahren09/CS31 | /Lecture Notes/大Tsing.cpp | C++ | cpp | 909 | no_license | #include <iostream>
#include <string>
using namespace std;
const int INF = 10000;
const int M = 3;
const int N=3;
int h[M+1][N] = {
{3,2,3},
{2,1,7},
{7,3,5},
{1,1,2}
};
int v[M][N+1] = {
{2,2,3,4},
{3,3,5,4},
{1,1,2,3}
};
/*
int shortest_path(int x, int y){
if(!x && !y)
... |
d926d5e8b80f61dbe01c695848134688186b34ff | c1c42414bcb3126a33cea658c4db61f309c6957c | icqlc/chiapos | /src/cmd.cpp | C++ | cpp | 7,702 | permissive | #include <iostream>
#include <ctime>
#include <set>
#include <fcntl.h>
#include "cxxopts.hpp"
#include "../lib/include/picosha2.hpp"
#include "plotter_disk.hpp"
#include "bls.hpp"
using std::string;
using std::vector;
using std::endl;
using std::cout;
using namespace bls;
static void HexToBytes(const string &hex, ui... |
7626e059c5b41f927ff300409fc19b493b3f5c47 | b2bef566bd81e4496b9299cde956d61373666036 | Svxy/The-Simpsons-Hit-and-Run | /game/code/camera/burnoutcam.cpp | C++ | cpp | 6,995 | no_license | //=============================================================================
// Copyright (C) 2002 Radical Entertainment Ltd. All rights reserved.
//
// File: BurnoutCam.cpp
//
// Description: Implement BurnoutCam
//
// History: 10/7/2002 + Created -- Cary Brisebois
//
//=================================... |
e78e3a4e741859513da08825c738538b5879128d | 565e4f84e7d4104beda7bdb8f58e059c1371cd70 | vlimant/usercode | /cmssw/RecoMuon/WhatWentWrongInL3Muon/src/MuonKinematics.cc | C++ | cc | 1,516 | no_license | #include "RecoMuon/WhatWentWrongInL3Muon/interface/MuonKinematics.h"
MuonKinematics::MuonKinematics(const edm::ParameterSet& iConfig)
{
HEPsourceLabel = iConfig.getParameter<edm::InputTag>("HEPsourceLabel");
etaMin = iConfig.getParameter<double>("etaMin");
etaMax = iConfig.getParameter<double>("etaMax");
}
Muo... |
40ce1fa400fd828c38960ef3cbada25f8c61253f | cf90c5f1d1b6672923241792d04c04b05d2fbac3 | oar-team/batsched | /src/schedule.hpp | C++ | hpp | 5,557 | no_license | #pragma once
#include <list>
#include <set>
#include "exact_numbers.hpp"
#include "locality.hpp"
#include "json_workload.hpp"
#include <intervalset.hpp>
class Schedule
{
public:
struct TimeSlice
{
Rational begin;
Rational end;
Rational length;
IntervalSet available_machines;
... |
56cd2c6a3c24d12b42eafe24eaacb70ed4087513 | 46fbce90409cf7516f183d626feb34a23c367426 | intel/earlyapp | /ext/MediaSDK/src/vaapi_utils_drm.cpp | C++ | cpp | 20,404 | permissive | /******************************************************************************\
Copyright (c) 2005-2018, Intel Corporation
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source c... |
41f85968a291d86147f21f1858756aa6b0ced349 | 25e2cc454009143a9e8ec79148a0cdb8af848666 | luisbg/hawktracer | /examples/example_simple_callstack.cpp | C++ | cpp | 970 | permissive | #include <hawktracer.h>
static void fnc_bar()
{
HT_TP_GLOBAL_SCOPED_STRING("bar");
}
static void fnc_foo()
{
HT_TP_GLOBAL_SCOPED_STRING("foo");
for (int i = 0; i < 16; i++)
{
fnc_bar();
}
}
static void fnc_start()
{
HT_TP_GLOBAL_SCOPED_STRING("start");
for (int i = 0; i < 32; i+... |
fbce5811759437bdbe9a18baebff14cfcca31db9 | 2048f1408172092ccb9cb1df1a6639e5700a265e | Springhead/dependency | /src/boost/mpl/list_c.hpp | C++ | hpp | 1,922 | no_license |
#ifndef BOOST_MPL_LIST_C_HPP_INCLUDED
#define BOOST_MPL_LIST_C_HPP_INCLUDED
// Copyright Aleksey Gurtovoy 2000-2004
//
// 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)
//
// See http://www.boost.org/libs/mpl ... |
1a552e830b578e78e080ef61bc4a92293808c44e | 1685fc841452e3fd40ff3d4cb13a5c9751b5edd3 | sshockwave/Online-Judge-Solutions | /LibreOJ/2496.cpp | C++ | cpp | 3,194 | permissive | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
#include <fstream>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
T i=0;char c;
while(!isdigit(c=getchar())&&c!='-');
bool neg=c=='-';
neg?... |
8ed2a829315ed9a4d8fc5071640c2dd985c16308 | 108662943b1aed8710cc5b458985be7c8fc618f2 | IW4M-Storm/fourdeltaone | /warfare2/Updater.cpp | C++ | cpp | 7,605 | no_license | #include "StdInc.h"
#include <tinyxml.h>
#include <stdint.h>
#include <list>
#include <unordered_set>
#include <string>
extern "C"
{
#include "sha1.h"
};
struct cache_t
{
std::string name;
int version;
};
struct cacheFile_t
{
private:
std::list<cache_t> caches;
public:
void Parse(const char* str)
{
TiXmlDo... |
9d5128f448694b27e666a0e7429174c0cba3785d | b358869dcb687c922cff3e37c2ecb87038b36b30 | domijin/ComPhy | /3-3/INTEGRATION/trap.cpp | C++ | cpp | 574 | permissive | /***********************************
FEB 25 2014
This is a bare-bones trapezoidal integration
routine for interval x0=0 to xf=1. (Modify
as needed.) It calls an external function
that can be chosen as needed.
************************************/
#include<iostream>
using namespace std;
extern double f(... |
2aca28d098febf5624ad9576f6c17c28a8eee43c | 5fc70a611df605cfa90c1aa7189b500fc31aa4f0 | boris9000/stcrypt | /stcrypt/trunk/common/toycert/stcrypt-toycert.cpp | C++ | cpp | 22,018 | no_license | //================================================================================================================================================
// FILE: stcrypt-toycert.cpp
// (c) GIE 2010-03-24 17:02
//
//==========================================================================================================... |
8206a2e34360cfd87cebe08712110447537723da | 4690b6c4d6aee2987ee349f15d764ec438de5f3f | xxyyzz/Competitive-Programming_Solutions | /ZeroJudge/B051.cpp | C++ | cpp | 948 | no_license | #include <iostream>
using namespace std;
struct data{
char str[100];
};
data s[10000];
int n;
bool cmp(data a,data b){
int alen=strlen(a.str),blen=strlen(b.str),mlen=min(alen,blen);
for(int i=0;i<mlen;i++)
if(a.str[i]!=b.str[i]) return (a.str[i]>b.str[i]);
if(alen>blen){
for(int i=ble... |
7f8b150cf57353532fdc23f56e089d0fedc922e5 | b38c584c1b0b908926d874c2d91afcbffc24db1d | githubfk/c-stl | /stl_2.cpp | C++ | cpp | 734 | permissive | #include <iostream>
#include <list>
using namespace std;
void PrintlistContents(const list<int>& listInput);
int main()
{
list<int> a;
a.push_front(10);
a.push_front(100);
a.push_front(20);
a.push_back(1919);
a.insert(a.begin(), 777);
a.insert(a.end(), 4, 999);
list<int> b;
b.push... |
b174cfcd8eb6cb4140a44597df0429e5962060d2 | b72a3247fe81094f5f33af912682d2a35a63df63 | anton-potapov/openvino | /inference-engine/tests/functional/plugin/myriad/shared_tests_instances/behavior/infer_request_config.cpp | C++ | cpp | 3,813 | permissive | // Copyright (C) 2018-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include "multi-device/multi_device_config.hpp"
#include "vpu/vpu_plugin_config.hpp"
#include "behavior/infer_request_config.hpp"
namespace {
const std::vector<InferenceEngine::Precision> netPrecisions = {
Inference... |
19e202eb4c047e971fd06b2387f0ff669205b47c | 2321d2866f45ae8b8d08047d157f2ac211dfda5f | byx2000/ByxScript | /src/Common/Value.cpp | C++ | cpp | 8,932 | no_license | #include "Value.h"
#include "../ByxVM/ByxVM.h"
using namespace std;
Value::Value()
: iVal(0), type(DataType::Unknown)
{
}
Value::Value(int val)
: iVal(val), type(DataType::Integer)
{
}
Value::Value(double val)
: dVal(val), type(DataType::Double)
{
}
DataType Value::getType() const
{
return type;
}
Value V... |
f28088b74a903fabc788a645b07a0ab239c3ca89 | d42a624fae0e5c61e66d74be63bf6e98cd25fe01 | gideontong/USBLoaderGX | /source/StartUpProcess.cpp | C++ | cpp | 11,023 | no_license | #include <unistd.h>
#include "StartUpProcess.h"
#include "GUI/gui.h"
#include "video.h"
#include "audio.h"
#include "input.h"
#include "themes/CTheme.h"
#include "gecko.h"
#include "Controls/DeviceHandler.hpp"
#include "wad/nandtitle.h"
#include "SystemMenu/SystemMenuResources.h"
#include "system/IosLoader.h"
#include ... |
2333c9d6a8e8fc4503c24f72ad0920da176662ce | c929e311b3760d331acaa6f774e1072d6a2a7717 | pytorch/pytorch | /torch/csrc/jit/passes/create_functional_graphs.cpp | C++ | cpp | 7,529 | permissive | #include <torch/csrc/jit/passes/create_functional_graphs.h>
#include <c10/util/Exception.h>
#include <torch/csrc/jit/ir/alias_analysis.h>
#include <torch/csrc/jit/passes/constant_pooling.h>
#include <torch/csrc/jit/passes/utils/subgraph_utils.h>
#include <torch/csrc/utils/memory.h>
#include <cstddef>
#include <limits... |
59dda20c025d8d1ca9c30e9348723c50d125d1fd | addbe972a76269280aed36cb6ea4af5877e888f5 | WhiZTiM/coliru | /Archive2/c9/0bcb5878e2b07f/main.cpp | C++ | cpp | 613 | no_license | #include <iostream>
#include <sstream>
#include <stdexcept>
using namespace std;
template<class T>
int toInt(const T& t)
{
std::stringstream s(t);
int i;
s >> i;
if (s.fail()) throw invalid_argument("toInt() was unable to convert its argument.");
return i;
}
int extract(const st... |
e9c298eba5da4e9134ceb21550a20a4f65fadf50 | 578c90f62b07970ed89a46975494bfa23ea0735d | kspine/referance_solution | /empery_center/src/player/league.cpp | C++ | cpp | 35,750 | no_license | #include "../precompiled.hpp"
#include "common.hpp"
#include "../mmain.hpp"
#include "../msg/cs_league.hpp"
#include "../msg/sl_league.hpp"
#include "../msg/err_league.hpp"
#include "../msg/sc_league.hpp"
#include "../account.hpp"
#include "../singletons/player_session_map.hpp"
#include "../singletons/legion_member_ma... |
c5b8d0ac7d776363df2c8fd0c19312bb5416cf5e | c6b82c06c850014ffe3a0c7742b635f8b408ae37 | hatemets/snake | /Direction.hpp | C++ | hpp | 378 | no_license | #ifndef AUXILIARY_HPP
#define AUXILIARY_HPP
struct Direction
{
bool m_up, m_down, m_left, m_right;
Direction() : m_up(false), m_down(false), m_left(false), m_right(false) {}
bool operator==(const Direction& m_direction)
{
return (m_up == m_direction.m_up && m_down == m_direction.m_down && m_left == m_direction... |
d022ec81acb1e3e9557e65ad45f632df92e77df2 | 6a7340b6e0e1da0bf379f6d3de6120107fb2a4d7 | Leerw/ProgrammingPractice4ZJU | /Kruskal.cpp | C++ | cpp | 1,686 | no_license | /**
* int kruskal() {
* 令最小生成树的边权之和为ans，最小生成树的当前边数为Num_Edge
* 讲所有边按边权从小到大排序
* for (从小到大枚举所有边) {
* if (当前测试边的两个顶点在不同的连通块中) {
* 将该测试边加入到最小生成树中
* ans += 测试边的边权
* 最小生成树的当前边数加一
* 当前边数等于顶点数时结束循环
* }
* }
* return ans;
*... |
c759ce2b287a09850907af742b5e74b233464540 | 6d6811904e81193a1f179e9509ea3a34ecc2b5f1 | Abu-Kaisar/Toph-Solutions | /The Bachelor's Problem.cpp | C++ | cpp | 1,539 | no_license | /***
Bismillahir Rahmanir Rahim
Read the name of Allah, who created you!!!
Author : Shah Newaj Rabbi Shishir
Department of CSE, City University, Bangladesh.
***/
#include <bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define ssf... |
ea304b44ed4176970f7964454ce7e96b137d0b1d | 1abcdf3b3a1dc5d3a9d9267fbf5346040bae04ed | Alcyneus/uv_ground | /src/headers/src/service/autoTest/unitTest/errorRateTest/telemetryErrorRateTest.hpp | C++ | hpp | 1,721 | no_license | #if !defined(_TELEMETRY_ERROR_RATE_TEST_HPP_)
#define _TELEMETRY_ERROR_RATE_TEST_HPP_
#include <unistd.h>
#include "iio.hpp"
#include "satelliteSimulation.hpp"
#include "bitSync.hpp"
#include "debug.hpp"
class TelemetryErrorRateTest
{
private:
IIO *iioRx = NULL;
SatelliteSimulation * simulation = NULL;
... |
9aa532db1f7125eb4bfc3ea38da3ba36cc510b65 | 42fd121c07c5f2a1be8b451f2b77a4580177334c | AndyAlpha/chromium-crosswalk | /components/arc/test/fake_policy_instance.cc | C++ | cc | 1,158 | 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 "components/arc/test/fake_policy_instance.h"
#include "base/run_loop.h"
namespace arc {
FakePolicyInstance::FakePolicyInstance(
mojo::Inter... |
6b21a5352f2154203f6f315264389f40961208c1 | f58eaa9e48ebff8b19b1373a516b07227c8dd13d | csalles/maratona | /100.cpp | C++ | cpp | 681 | no_license |
//f(n) = 3*n+1, se n for impar
#include <stdio.h>
/*
int ciclo(int n) {
if(n==1) return 1;
else if(n%2==0) return ciclo(n/2)+1;
else return ciclo(3*n+1)+1;
}
*/
int ciclo(int n) {
int ret = 1;
while(n!=1) {
ret++;
n = (n%2) ? 3*n+1 : n/2;
}
return ret;
}
/*
int ciclo(int n) {
for(int ret=1; ;ret++) {... |
159bdb85c69497daab903d0ad664f9b13311eab8 | f5d477100c1935972c9f36677a2b562ebed516d7 | belerico/t_cpp_pl | /X.6 A Tour of C++: Concurrency and Utilities/X.6.2.cpp | C++ | cpp | 769 | no_license | /*
Write a program with two treads: one that writes hello every second and one that
writes world! every second.
*/
#include <chrono>
#include <iostream>
#include <mutex>
#include <string>
#include <thread>
using namespace std;
mutex print_mutex;
void thread_print(string &msg)
{
while (true)
{
... |
b0b3d57a50de7994d1ce1581d678f8a01d4656cc | 1da31a0b2adbb3b89b26dedc1cb14204a16da4ea | KPRSN/MotorCity | /MotorCity/Common/MapGenerator.cpp | C++ | cpp | 3,995 | permissive | //
// MapGenerator.cpp
// MotorCity
//
// Created by Karl Persson on 2013-12-09.
// Copyright (c) 2013 Karl Persson. All rights reserved.
//
#include "MapGenerator.h"
// Get roads from bitmap
bool MapGenerator::getRoads(Tiles& tiles, Tiles& destinationTiles, TextureManager& textureManager) {
sf::Image image;
... |
99d821574a45d6f6c1a7ee71f36788128b44cc69 | 8e16fc01759540544b8c5b8bb1b3be7085e0a418 | whhrrr/Chatting_software | /MFCClient/MFCClient.cpp | C++ | cpp | 2,847 | no_license |
// MFCClient.cpp: 定义应用程序的类行为。
//
#include "pch.h"
#include "framework.h"
#include "MFCClient.h"
#include "MFCClientDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CMFCClientApp
BEGIN_MESSAGE_MAP(CMFCClientApp, CWinApp)
ON_COMMAND(ID_HELP, &CWinApp::OnHelp)
END_MESSAGE_MAP()
// CMFCClientApp 构造
CMFCClien... |
9d780114415a1e22eac5c9d3bbdcb53f4ba0cc58 | d76b1d4ebd5a89fd908ef3ec035fe872e72e5d00 | Miklakapi/Logic_Game | /Logic_Game/Logic_Game/Doors.cpp | C++ | cpp | 2,074 | no_license | #include "Doors.hpp"
Doors::Doors(int number, string textureFile){
Door::setDoorTexture(textureFile);
this->number = number;
door = new Door[number];
}
void Doors::setDoorPosition(int number, Vector2f position) {
(door + number)->setDoorPosition(position);
}
void Doors::setDoorSize(int number, Vector2f size) {
... |
e8ea5e25cf75aa45350f8fd1049a6b1fdf046b9e | 98705a8dbf06bca87a7216daca5d77c892ed5288 | jiachengii/chromium | /third_party/blink/renderer/core/exported/local_frame_client_impl.cc | C++ | cc | 43,379 | permissive | /*
* Copyright (C) 2009, 2012 Google Inc. All rights reserved.
* Copyright (C) 2011 Apple 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... |
ea08525c9785c7e54371bb25a24e6f12c0390caf | 55d8bc366663e6c2ab29e51757b0722cf262ac76 | strigazi/athena | /Trigger/TrigT1/TrigT1Muctpi/src/Algorithms/L1MuctpiPatGen.cxx | C++ | cxx | 4,085 | permissive | /*
Copyright (C) 2002-2018 CERN for the benefit of the ATLAS collaboration
*/
// $Id: L1MuctpiPatGen.cxx 441850 2011-06-06 14:50:52Z krasznaa $
// Gaudi/Athena include(s):
#include "AthenaKernel/errorcheck.h"
// TrigT1 include(s):
#include "TrigT1Interfaces/Lvl1MuCTPIInput.h"
// Local include(s):
#include "L1Muct... |
a4c997a7283be1133793c8efae83cd5cc4512441 | 5d5b095cd259c8783b776735c1da9ccbcc114cf9 | FirstLoveLife/tight_pair | /tests/libcxx/get_non_const.cpp | C++ | cpp | 1,863 | permissive | /*
* The MIT License (MIT)
*
* Copyright (c) 2017-2018 Morwenn
*
* 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,... |
32d238df01c493066e7b0641b6cecc9cf70f35e4 | 850d01c90bbb4fe172b05793fb68ff676c698183 | KhronosGroup/VK-GL-CTS | /external/vulkancts/modules/vulkan/dynamic_state/vktDynamicStateInheritanceTests.cpp | C++ | cpp | 44,293 | permissive | /*------------------------------------------------------------------------
* Vulkan Conformance Tests
* ------------------------
*
* Copyright (c) 2020 NVIDIA Corporation
* Copyright (c) 2023 LunarG, Inc.
* Copyright (c) 2023 Nintendo
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you ma... |
7dfa6f3036f11e73f390ad0d9194a10b213c1adc | e0e206a2050af3018880c4d73e065b2fda9b88fe | uel-dataexchange/Opencascade_uel | /drv/Approx/Approx_FitAndDivide2d_0.cxx | C++ | cxx | 1,146 | no_license | // This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#include <Approx_FitAndDivide2d.hxx>
#ifndef _AppC... |
eeab908e640dcb697d08bd9a589b5dd0cf1bb6f6 | 0950abc2ee3d97cf48494899d8f871d1e8a629ea | Pankajadhana97-bit/COMPETITIVE_CODING | /Christmas_Heist.cpp | C++ | cpp | 661 | no_license | #include<bits/stdc++.h>
/*
Pankaj Adhana
Panjab university;
*/
/* Defined values---------------------------------------------------- */
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define cases int t=1;cin>>t; while(t--) { solve();} return 0
#define ll long long int
#define vec vector<ll>
#define a... |
8bb8f0828b411694c464b8788a1565a35bf3f2ca | e1bc28cbaac45eeb29f068c0751e0bcfde457745 | compy-art/SoT-SDK | /SDK/SoT_BP_ResourceIslandWashedUpChestsSpawner_classes.hpp | C++ | hpp | 829 | no_license | #pragma once
// Sea of Thieves (1.4) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "SoT_BP_ResourceIslandWashedUpChestsSpawner_structs.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//-------------------------------------------------------... |
a32818472a2167676365741bf11addfe935e21ea | fdc4184961e65e180964b5465c10941f60547629 | bobobo1618/Halide | /src/CodeGen_ARM.cpp | C++ | cpp | 46,514 | permissive | #include <iostream>
#include <sstream>
#include "CodeGen_ARM.h"
#include "IROperator.h"
#include "IRMatch.h"
#include "IREquality.h"
#include "Debug.h"
#include "Util.h"
#include "Simplify.h"
#include "IntegerDivisionTable.h"
#include "IRPrinter.h"
#include "LLVM_Headers.h"
namespace Halide {
namespace Internal {
us... |
e5489eeb5d6d08be0d0ac83559b33ac9f161d267 | 1e26f9b894d2cf82c3029cb5deec05cc95e8cfec | bacTlink/caffe_illu | /include/caffe/layers/shuffle_channel_layer.hpp | C++ | hpp | 1,210 | permissive | #ifndef CAFFE_SHUFFLE_CHANNEL_LAYER_HPP_
#define CAFFE_SHUFFLE_CHANNEL_LAYER_HPP_
#include <utility>
#include <vector>
#include "caffe/blob.hpp"
#include "caffe/layer.hpp"
#include "caffe/proto/caffe.pb.h"
namespace caffe {
template <typename Dtype>
class ShuffleChannelLayer : public Layer<Dtype> {
public:
expli... |
341d0d299782e45c315ce2fdb0640587aa1029be | 6e6a3f0066a167bef4afbdf30080a31391bfb756 | msrLi/portingSources | /ACE/ACE_wrappers/TAO/tests/UNKNOWN_Exception/server.cpp | C++ | cpp | 5,867 | permissive | #include "ace/Get_Opt.h"
#include "testS.h"
#include "tao/PortableServer/Root_POA.h"
#include "ace/OS_NS_stdio.h"
const ACE_TCHAR *ior_output_file = ACE_TEXT("ior");
static int done = 0;
void
throw_exception (void)
{
throw 1;
}
class test_i :
public POA_test
{
public:
test_i (CORBA::ORB_ptr orb);
void norm... |
bcb9defdc7e76caa5799bbb5103458faaeaddf0c | 04ebf597e84e544206490b2bb6960f3c282c0e7f | mashoujiang/openvino | /ngraph/test/type_prop/mvn.cpp | C++ | cpp | 2,769 | permissive | // Copyright (C) 2018-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include "gtest/gtest.h"
#include "ngraph/ngraph.hpp"
#include "util/type_prop.hpp"
using namespace std;
using namespace ngraph;
// ------------------------------ V0 ------------------------------
TEST(type_prop, mvn)
{
auto ... |
ec37eedf205664751b2f4094acc207925a2de6e6 | e580cee913b56c2678f9011397c3d335e0a2ff11 | pedro-hbl/abcg | /examples/eliteaim/openglwindow.hpp | C++ | hpp | 847 | permissive | #ifndef OPENGLWINDOW_HPP_
#define OPENGLWINDOW_HPP_
#include <array>
#include <glm/vec2.hpp>
#include <random>
#include "abcg.hpp"
class OpenGLWindow : public abcg::OpenGLWindow {
protected:
void initializeGL() override;
void paintGL() override;
void paintUI() override;
void resizeGL(int width... |
bdb17f84c857c403ddadf2f6d064af3cb175cd80 | 2469094fea93956a5953a01e39b14c63c8e29490 | alejgh/HeadFirstDesignPatterns | /Command/src/StereoOnWithCDCommand.cpp | C++ | cpp | 314 | no_license | #include "StereoOnWithCDCommand.h"
#include "Stereo.h"
StereoOnWithCDCommand::StereoOnWithCDCommand(Stereo &stereo)
: mStereo(stereo)
{}
void StereoOnWithCDCommand::execute()
{
mStereo.on();
mStereo.setCD();
mStereo.setVolume(11);
}
void StereoOnWithCDCommand::undo()
{
mStereo.off();
}
|
76696aadd02dc42579e9e98060490df6bf016827 | a8b0f5e3ddaffc8c0e1b98f93d89e191dc830b01 | kthr/libEidomatica | /src/templates/list_node.hpp | C++ | hpp | 429 | permissive | /*
* listNode.hpp
*
* Created on: Jul 10, 2013
* Author: kthierbach
*/
#ifndef LISTNODE_HPP_
#define LISTNODE_HPP_
namespace elib
{
template <class T>
class ListNode
{
public:
ListNode(T& data, ListNode<T> *head)
:head(head), data(new T(data))
{
}
~ListNode()
{
delete data;
}
ListNode... |
3299b6f772fb852e93d8a53f437e2353351ce1fc | 4e84bf73a59ba52351218dbd471eb6b1f40d7eb6 | lendres/ButtonSuite-Arduino | /src/AlwaysOnButton.cpp | C++ | cpp | 1,314 | permissive | /*
The MIT License (MIT)
Copyright (c) 2019 Lance A. Endres
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, modi... |
f3de001d0b122dfcfaf116502268d4c1fd8ef65d | 70fa1d3ed2043cbeaabf1a03f315f2dec6258477 | kyt9613/BIT_ACADEMY_CPP_COURSE | /2016-07-13/2016-07-13_5.cpp | C++ | cpp | 765 | no_license | // 다음의 객체의 속성과 행동을 구조체 or 클래스 로 작성해보세요
// 커피
// 사랑
// 군대
class army
{
// 속성
int happiness=100; // 사기
int hungry=50; // 허기
int remain=500; // 남은 복무일
// 행동
void work() // 작업
{
happiness--;
hungry++;
}
void eat() // 식사
{
happiness++;
hungry--;
}
void sleep() // 취침
{
happiness++;
remain--;
}... |
27927c116a56f177cba6ca8a5a6553ea0769a73d | 470cb0abe0df92813697951210d40631a51a02ff | ValleyBell/vgmtrans | /src/formats/KonamiSnesScanner.cpp | C++ | cpp | 6,462 | permissive | #include "stdafx.h"
#include "KonamiSnesScanner.h"
#include "KonamiSnesSeq.h"
#include "KonamiSnesInstr.h"
#include "SNESDSP.h"
using namespace std;
//; Ganbare Goemon 4
//13d3: 8f 1e 06 mov $06,#$1e
//13d6: 8f 00 0a mov $0a,#$00
//13d9: 8f 39 0b mov $0b,#$39 ; set header address $3900 to $0a/b
//13... |
45d1c54e48abafa994696203459e91eea31f823f | fc2b8cfe4821ba5d8d6767ec3e932a271cbd4e5a | VaramIshitha/filament | /libs/utils/src/JobSystem.cpp | C++ | cpp | 19,414 | permissive | /*
* 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... |
c5f78bfa13879bfccce014f09a2a262f53c127e2 | 51effb80dd9a5eec1009a1058dc48c4c668f3d81 | lionkor/antsim3 | /tilemap_editor.cpp | C++ | cpp | 1,193 | permissive | #include "Engine.h"
int main(int argc, char** argv) {
ArgsParser parser(argc, argv);
int width = 100;
int height = 100;
parser.register_arg("w", width);
parser.register_arg("width", width);
parser.register_arg("h", height);
parser.register_arg("height", height);
bool ok = parser.parse... |
2e59260538e2639255eead79d1b11482af738215 | e83983ba52db99eb52c4bc4a5af63fcdbba4d3a4 | zhushaoben/training | /2019暑期训练/Codeforces Round #579 (Div. 3)/F. Complete the Projects.cpp | C++ | cpp | 526 | no_license | #include<bits/stdc++.h>
using namespace std;
#define maxn 105
#define maxm
struct Node{
int a,b;
bool operator <(const Node &b)const{
if(b>=0)return a<b.a;
return
}
}a[maxn],b[maxn];
int s1,s2;
int main(){
int n,m,x,y,ans=0,;scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
scanf("%d%d",&x,&y);
if(y>=0)a[s1++]=... |
14ff1c713a32a6ad44eee236c2e647f74219a635 | a6dfeba18de352ba5210ba9965e6d33e8ca75bd3 | HumbleHunger/Cpp | /test/10.34.cpp | C++ | cpp | 513 | no_license | /*************************************************************************
> File Name: 10.34.cpp
> Author:
> Mail:
> Created Time: 2020年10月23日 星期五 16时11分16秒
************************************************************************/
#include<iostream>
#include<iterator>
#include<vector>
using namespace std;
int ... |
497d70e7c05d6adb14f75f606a97369ed0b56828 | dd9f13b26b3d220f1d58872d690aa22f73fd0ffc | Mari-Jun/DarkNess_Room | /File/CreditPage.cpp | C++ | cpp | 4,194 | no_license | #include "Resource.hpp"
#include "CreditPage.hpp"
//CreditPage 정의
CreditPage::CreditPage(int B) : BackClick(B) {
}
const int CreditPage::GetBackClick() const{
//BackClick값을 반환한다.
return BackClick;
}
const bool CreditPage::BackRange(const int y, const int x) const {
//Back버튼의 범위 안에 있는지 확인
if (y ... |
55ffa87f897e54a66f61a46a4b9e10690bbf6fa8 | 0aa8ce413608afdfcc94b18e177e1ec80e258397 | Plop2323/cred | /tests/core_tests/tx_validation.cpp | C++ | cpp | 28,074 | permissive | // Copyright (c) 2014-2018, The Cred Project
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are
// permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
... |
23acfffe5145d7156fda411cea9f589865b98cad | 35fb91e12ebbad51fb64203ef48231cf1da037f8 | VeeraAnudeep/trinity | /library/src/main/cpp/message/message_queue.cc | C++ | cc | 4,082 | permissive | /*
* Copyright (C) 2019 Trinity. All rights reserved.
* Copyright (C) 2019 Wang LianJie <wlanjie888@gmail.com>
*
* 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.apac... |
e026dd8026c8e1964b6c3f2fde793978aebceb7c | a31514d0f82a4809e3bfc4c8dab85d75bd77d974 | wcc19940308/muduo-study | /echo/echo-server/echo.cc | C++ | cc | 1,572 | no_license | #include "main/Acceptor.h"
#include "main/InetAddress.h"
#include "main/TcpStream.h"
#include <thread>
#include <string.h>
// a thread-per-connection current echo server
int main(int argc, char* argv[])
{
// 初始化struct sockaddr
InetAddress listenAddr(3007);
// socket, bind, listen初始化工作
Acceptor accepto... |
2d24a48bc24802a40331e89f29e2613c7f9fa583 | eeba83d03dd9214afa7ee06db6e67bdb3940ba32 | bright-starry-sky/nebula-graph | /src/planner/match/StartVidFinder.cpp | C++ | cpp | 1,159 | permissive | /* Copyright (c) 2020 vesoft inc. All rights reserved.
*
* This source code is licensed under Apache 2.0 License,
* attached with Common Clause Condition 1.0, found in the LICENSES directory.
*/
#include "planner/match/StartVidFinder.h"
namespace nebula {
namespace graph {
bool StartVidFinder::match(PatternContex... |
09701542f013a8c6eab3d79fd05c9d1bc9c47a78 | ee5d1ed1b4802a6a362d83c6d8da5988bfa209a4 | 2bite/ARK-SDK | /SDK/ARKSurvivalEvolved_PrimalItemSkin_ChibiDino_Manta_classes.hpp | C++ | hpp | 871 | permissive | #pragma once
// ARKSurvivalEvolved (332.8) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_PrimalItemSkin_ChibiDino_Manta_structs.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Classes
//------------------------------------------... |
eb3799714d61963b7d1d80a0529ed6fe728362c9 | ba545bba53e0b216a612d7680f0fc2ff8d08ee0a | liufile/BlackHatWallet | /src/qt/blkc/blkcgui.cpp | C++ | cpp | 21,940 | permissive | // Copyright (c) 2019-2020 The PIVX developers
// Copyright (c) 2021 The BlackHat developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "qt/blkc/blkcgui.h"
#ifdef Q_OS_MAC
#include "macdockiconhandler.h"
#endif
#... |
ca95050d8d226a7ec85c367dc9a135bfdd6cd6b5 | 8e21ef9ec63466835e719b07c2fa735fb7439ef3 | msrishu65/codes | /codes/repeat/ismajority.cpp | C++ | cpp | 455 | no_license | #include<iostream>
using namespace std;
int findfirst(int a[],int start,int end,int x)
{
if(start<end)
{
int mid=(start+end)/2;
if(a[mid]>a[mid-1] && a[mid==x])
return mid;
else if(a[mid]==x || a[mid]>x)
return findfirst(a,start,mid-1,x);
else
return findfirst(a,mid+1,end,x);
}
retu... |
2166f2de7f3ca6f6c732862a9fee29f23ecc4fd3 | 9a8836dc331fea963798a341f43f43834585f49b | knagakura/procon | /atcoder/abc151/f.cpp | C++ | cpp | 1,124 | no_license | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... |
ca26738ec35a898df0f570f6ad6be693abd7846d | e7704f4c7198860f5363e985d40ea8ddde739cab | visualambda/simpleIDE | /edbee-data/code/cpp/b_qlistqabstractbutton_w.hpp | C++ | hpp | 254 | no_license | ////////// GENERATED FILE, EDITS WILL BE LOST //////////
#ifndef HOPPY_MODULE_qtah_qlistqabstractbuttonwrap
#define HOPPY_MODULE_qtah_qlistqabstractbuttonwrap
extern "C" {
} // extern "C"
#endif // ifndef HOPPY_MODULE_qtah_qlistqabstractbuttonwrap
|
bcdab3fa068944bb64d2ef7cffc3dc8f538d1d4a | 71e8cead1eed53fc092441f5f0a3ce340866422b | svdhiren/DSA-practice | /Graphs/number of paths of particular length.cpp | C++ | cpp | 1,189 | no_license | #include<iostream>
using namespace std;
int v;
void dfs(int G[20][20], int ar[], int cur, int n)
{
if(n==5){
if(cur==3){
for(int i=0;i<5;i++) cout<<ar[i]<<" ";
cout<<"\n";
}
else return;
}
for(int i=1;i<=v;i++){
if(G[cur][i]==1){
ar[n++]=i... |
752070428bc33054ae0a9ac906f4aeb892f5e85c | dcc377763978492363b3fe67207209cbece2525e | akeshavan/ANTS | /Examples/SetOrigin.cxx | C++ | cxx | 5,075 | permissive | /*=========================================================================
Program: Advanced Normalization Tools
Module: $RCSfile: SetOrigin.cxx,v $
Language: C++
Date: $Date: 2008/11/15 23:46:06 $
Version: $Revision: 1.19 $
Copyright (c) ConsortiumOfANTS. All rights reserved.
See accompan... |
554caf1d6b56ef8742a1a398653132ac892b3478 | 3874c357174aa4a1898415cc4f0cbac10dc11b41 | KraiZeur/Examples | /SoftwareDesign/C++/DesignPatterns/Decorator.cpp | C++ | cpp | 858 | no_license | #include <iostream>
class Component {
private:
public:
Component() {}
virtual ~Component() {}
virtual unsigned int getPrice()=0;
};
class Pizza : public Component {
private:
public:
unsigned int getPrice() {
return 150;
}
};
class Decorator : public Component {
protected:
Component* _component;
publi... |
9d4dff0646c9717bae8635827ba8611ec199c21c | 5059993e68b3efa060c59a2d6607216f280d0196 | donovan680/Plasma | /Systems/Networking/NetworkingBindingExtensions.hpp | C++ | hpp | 700 | permissive | ////////////////////////////////////////////////////////////////////////////////////////////////////
///
/// Authors: Joshua Claeys
/// Copyright 2017, DigiPen Institute of Technology
///
////////////////////////////////////////////////////////////////////////////////////////////////////
#pragma once
namespace Plasma
... |
9c451c65d3ee0c85d3a99684c155b2f297184fe3 | ba1fce65afa60cf70d4919f96d5fcb1632f50c87 | apple/swift-libcxx | /test/std/numerics/rand/rand.dis/rand.dist.norm/rand.dist.norm.chisq/ctor_double.pass.cpp | C++ | cpp | 859 | permissive | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
bee607d9e6554c77f0e25fffea6a9d7e41c02b69 | 365492bef0c394c8f7ae583da509b60633c19d1a | emcniece/fps-moba | /game/client/death.cpp | C++ | cpp | 8,797 | no_license | //========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose: Draws the death notices
//
// $NoKeywords: $
//=============================================================================//
#include "cbase.h"
#include "hud_macros.h"
#include "hudelement.h"
#include "c_playerresource.h"
#inc... |
948f81f9b63a92eea3f9e63a80122adf82d93c25 | 5738dbe911fbbbf69e406053de09d2d241eecfee | sKAR04/CP-Practice | /Codeforces/556/556A.cpp | C++ | cpp | 1,759 | no_license | /*
######################################################
# I don't know what I'm doing with my life O.O #
######################################################
*/
#include <bits/stdc++.h>
using namespace std;
//Optimizations
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC... |
d00d2773445ea948b707895e60763416becf6f76 | 0588e4ac740117646c532b2df6559af406c380f5 | graphstream/gs-nui | /src-test/org/graphstream/nui/views/camera/test/data/gen-glm-lookat-data.cpp | C++ | cpp | 1,574 | no_license | #include <glm/mat4x4.hpp> // glm::mat4
#include <glm/vec4.hpp>
#include <glm/ext.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include <glm/detail/func_geometric.hpp>
#include <GL/gl.h>
#include <iostream>
#include <fstream>
#include <random>
#include <stdexcept>
#include <string>
#include <chrono>
#define PRINTM(mat,... |
f7a7af9d26a52bc6d6432b3e59a3fb11b25d2720 | ff0643befef95bf81b97014415799f8b20bbacac | vrunal1994/Vegeta | /asg6/asg6/smallSprite.cpp | C++ | cpp | 2,076 | no_license | #include <cmath>
#include "smallSprite.h"
#include "gamedata.h"
#include "frameFactory.h"
#include "vegeta.h"
#include "SDL/SDL_rotozoom.h"
smallSprite::smallSprite(const string& n, const Vector2f& pos, const Vector2f& vel):
Drawable(n, pos, vel),
explosion(NULL),
frame( FrameFactory::getInstance().getFrame(n) ... |
6d998948314e5a8eb5bc22726b5497d0ce31f872 | 4e21b0b436124d66b073885a7d82d8fa11c50a19 | Shah-Shishir/Codeforces-Solutions | /17A. Noldbach problem.cpp | C++ | cpp | 1,928 | permissive | /***
Bismillahir Rahmanir Rahim
Read the name of Allah, who created you!!!
Author : Shah Newaj Rabbi Shishir
Department of CSE, City University, Bangladesh.
***/
#include <bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define ssf... |
cbfae702f5c8f6ac7c937c745bb5ea7b0460837e | 3a79499cd0ae89517ea4a26ec6ed5fba31d2796c | 1124418652/ten_algrithom | /graph/graph/graphSearch.cpp | C++ | cpp | 2,275 | no_license | #include "stdafx.h"
#include "graphSearch.h"
void breadthFirstSearch(const std::vector<int> *g, int n)
{
int i; // 用于遍历节点的循环变量
int *nodeSearched = new int[n]; // 用于保存每个节点是否已经被访问的数组
for (i = 0; i < n; ++i)
{
nodeSearched[i] = 0;
}
for (i = 0; i < n; ++i) // 因为图可能是断开的，所以需要以所有节点为起始节点进行
... |
735d86b2eb9e2f5dea1c82dbef46ecbd0cae479a | 1be9af37ab568717fcc3d71d189f5c4fda445833 | guluuu3/spoj | /spoj_MSE06H.cpp | C++ | cpp | 1,368 | no_license | //http://www.quora.com/How-do-I-solve-the-JAPAN-problem-using-Binary-Indexed-Tree
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MAX 1100
int bit_tree[MAX];
pair<int,int> p[1000010];
long long int get_sum(int idx)
{
long long int sum=0;
while(idx>0)
{
sum=sum+bit_tree[idx];
... |
ad6f386e215e9176762cb539484a9931d58f5e59 | c9ab00ac3fd80d2c47f778f7d008cccd34deef72 | Mikalai/punk_project_a | /source/tests/test13.cpp | C++ | cpp | 21,848 | no_license | #include "test13.h"
#include <type_traits>
namespace Test13
{
// class Selectable
// {
// public:
// int m_index;
// float m_t;
// Math::mat4 m_view_model;
// float m_width;
// float m_height;
// float m_fovy;
// Math::vec3 m_view_position;
// Math::vec3... |
a368e4191a4b1805a6f7058a77349c0fd6e3d3ef | 64482ea2c5d8a9263d351c8b54090fb4c35cfe68 | renishb10/chromium | /chrome/browser/ui/views/frame/browser_view_layout_unittest.cc | C++ | cc | 10,943 | 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 "chrome/browser/ui/views/frame/browser_view_layout.h"
#include "base/macros.h"
#include "chrome/browser/ui/views/frame/browser_view.h"
#include ... |
430d10b0e8630aa2292a358dcfcd27028ca6505a | 15ec125bc2ee421a6871fd28a3e3d868888bfd3e | XinYao1994/ray | /src/ray/gcs/gcs_server/gcs_server.cc | C++ | cc | 31,915 | permissive | // Copyright 2017 The Ray Authors.
//
// 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 i... |
5ec1f3a247450d00b4e3b51e803bfabf282039c8 | dadc580bbb0e41f24941b4275efb67d28a952489 | lvcargnini/DBT-RISE-RISCV | /riscv.sc/src/sc_main.cpp | C++ | cpp | 8,349 | permissive | ////////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2017, MINRES Technologies GmbH
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redist... |
6aace34c2857f77e30f761d1aa7ea76d7154bac2 | 4431dcde6539849250e42925d97687258c8f0436 | SREERAGI18/chromium | /components/paint_preview/renderer/paint_preview_recorder_impl.cc | C++ | cc | 17,273 | permissive | // Copyright 2019 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 "components/paint_preview/renderer/paint_preview_recorder_impl.h"
#include <memory>
#include <utility>
#include "base/auto_reset.h"
#include "b... |
012149fc18794536a572b687a5b0a51140e864fe | 88aef34d14c76015ef276a015bd74fb8aee19a85 | CapOM/ChromiumGStreamerBackend | /chrome/browser/sync/profile_sync_components_factory_impl.cc | C++ | cc | 24,396 | 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 "chrome/browser/sync/profile_sync_components_factory_impl.h"
#include "base/command_line.h"
#include "base/prefs/pref_service.h"
#include "b... |
8e3e7c5f311bd02a8e97ea5e35a98eef0373fc81 | 523da7790f8c923d3915af23efefdbcc98d50cc7 | joe-nano/deepdrive-sim | /Plugins/DeepDrivePlugin/Source/DeepDrivePlugin/Private/Capture/CaptureBuffer.cpp | C++ | cpp | 1,161 | permissive |
#include "DeepDrivePluginPrivatePCH.h"
#include "Private/Capture/CaptureBuffer.h"
#include "Private/Capture/CaptureBufferPool.h"
CaptureBuffer::CaptureBuffer(CaptureBufferPool &captureBufferPool, EPixelFormat pixelFormat, uint32 width, uint32 height, uint32 stride)
: m_CaptureBufferPool(captureBufferPool)
, m_Pixel... |
45f4869a00682008d1397f18584903ad2add4395 | 120bcb064f2c2b12fbd75e873799b13fae2506b9 | 0gGhost/DPP | /src/dpp/discordclient.cpp | C++ | cpp | 3,324 | permissive | #include <string>
#include <iostream>
#include <fstream>
#include <dpp/discordclient.h>
#include <spdlog/spdlog.h>
DiscordClient::DiscordClient(uint32_t _shard_id, uint32_t _max_shards, const std::string &_token, spdlog::logger* _logger) : WSClient("gateway.discord.gg", "443"), shard_id(_shard_id), max_shards(_max_sha... |
623a1bc167f866b324c5e272c504ee0583b1e511 | 6cf133680a40f0d78751d8335d711766baf7a485 | liumonac/textureGenerator | /release/moc_window.cpp | C++ | cpp | 4,239 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'window.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.4.1)
**
** WARNING! All changes made in this file will be lost!
**************************************************************... |
108713595d6cc8503448bf7b1fc03c00f6bd83c6 | 2869872d3b35d17a99caed6127935ee804b2e8aa | jclouise/stellar-core | /src/process/test/ProcessTests.cpp | C++ | cpp | 6,099 | permissive | // Copyright 2014 Stellar Development Foundation and contributors. Licensed
// under the Apache License, Version 2.0. See the COPYING file at the root
// of this distribution or at http://www.apache.org/licenses/LICENSE-2.0
#include "util/asio.h"
#include "lib/catch.hpp"
#include "lib/util/format.h"
#include "main/App... |
e0bcd829592ce8951e186ef3b26ff16c3d48eccc | 5413a69bc9a394cb30a34d9d4d9bb62bbda345ac | simintao/datastructure | /base/test/CompareTest.cc | C++ | cc | 3,569 | permissive | #include <array>
#include <ctime>
#include <iostream>
#include <vector>
#include "Array.h"
#include "Vector.h"
#include "absl/time/clock.h"
#include "absl/time/time.h"
#include "gtest/gtest.h"
TEST(CompareTest, comparetest) {
bool flag = true;
size_t value;
if (flag == true) {
absl::Time startTime, endTime;
... |
2158cf8d75a67d8d890b989b6415c2573f76267c | 5caff898111dd747141ac45eee1db2b79bed2b7d | Squarespace/envoy | /test/extensions/filters/network/mongo_proxy/proxy_test.cc | C++ | cc | 26,895 | permissive | #include <chrono>
#include <cstdint>
#include <memory>
#include <string>
#include "envoy/extensions/filters/common/fault/v3/fault.pb.h"
#include "envoy/stats/stats.h"
#include "envoy/type/v3/percent.pb.h"
#include "extensions/filters/network/mongo_proxy/bson_impl.h"
#include "extensions/filters/network/mongo_proxy/co... |
e754c8ba1e640e035dbf1c34f6e336619c2bfe10 | 11273f818f3905199effa676653b5a06d33096f1 | loopDelicious/cuberite | /src/Entities/EnderCrystal.cpp | C++ | cpp | 934 | permissive |
#include "Globals.h" // NOTE: MSVC stupidness requires this to be the same across all modules
#include "EnderCrystal.h"
#include "../ClientHandle.h"
#include "../Chunk.h"
#include "../World.h"
cEnderCrystal::cEnderCrystal(Vector3d a_Pos):
Super(etEnderCrystal, a_Pos, 1.0, 1.0)
{
SetMaxHealth(5);
}
void c... |
23218b94ed4a82c5e2c3fefc2674414000a3deaf | bf4b239d1a9e9715034a3f41ab7cd56cc7784735 | anjingbin/starccm | /xercesc/xerces-c1_7_0-SolForCC/include/xercesc/util/Transcoders/ICU/ICUTransService.hpp | C++ | hpp | 10,830 | permissive | /*
* The Apache Software License, Version 1.1
*
* Copyright (c) 1999-2000 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of ... |
78355ecce0041df1c619577fd3d479fcc004159e | fbfb7aa5e7717ba3a53f27de76892429029ce3e9 | hackzoomuck/algorithm-study | /algorithm/2579 계단 오르기.cpp | C++ | cpp | 1,155 | no_license | #include <iostream>
#include <algorithm>
using namespace std;
int arr[301][2] = { 0, }; //arr[i][0] = +1 , arr[i][1] = +2
int stair[301] = { 0, };
int check[301][2] = { 0, };
//1, 2 1+1+1(x)
//고민은 1+1 이후에 체크를 어떻게 할 것인가? 체크해주는 배열로?
//2+1+1(x)
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> stai... |
9ad7527ea1086973671abcd5691eaf340535a649 | d2ec6533817491630eef9199775ffb7a913409f9 | davestroud/C-Index | /MakingDecisions/IfElseStatement/DivisionByZero.cpp | C++ | cpp | 875 | no_license | // This program asks the user for two numbers, num1 and num2.
// num1 is divided by num2 and the result is displayed.
// Before the division operation, however, num2 is tested
// for the value 0. If it contains 0, the division does not
// take place.
#include <iostream>
using namespace std;
int main(int argc, char co... |
ce4d23cfe4b3f1741c802d2f413b1dfe07dd373d | a27c1c00d0d5dec2c85d0140e39c663d4895eda7 | itm2018/bitcoin | /src/wallet/rpcdump.cpp | C++ | cpp | 47,700 | permissive | // Copyright (c) 2009-2016 The Marscoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "base58.h"
#include "chain.h"
#include "rpc/safemode.h"
#include "rpc/server.h"
#include "init.h"
#include "validat... |
8ea679221872f5176bd91b884f6f0e0c36f74025 | 11eaaeebc1514fecd70b1c3d672b8b204c9cb419 | jhormanpa/Udea-informatica2 | /Ejercicio8/main.cpp | C++ | cpp | 1,495 | no_license | #include <iostream>
using namespace std;
int main()
/* Este programa calcula el factorial de un número ingresado por el usuario*/
{
int i,fact=1, numero; /* declaramos las variables a usar en el programa, un contador fact, el número a calcular
y un "i" para aumentar o contador también ... |
fea4c073ab75d7a6815e0aae976e7301119ea740 | 96d29de9c5ae7d5f694b13e7489caf59d54dd8b7 | nagyist/ParaView | /Remoting/ServerManager/vtkSMObject.cxx | C++ | cxx | 1,272 | permissive | // SPDX-FileCopyrightText: Copyright (c) Kitware Inc.
// SPDX-License-Identifier: BSD-3-Clause
#include "vtkSMObject.h"
#include "vtkObjectFactory.h"
#include <cctype>
vtkStandardNewMacro(vtkSMObject);
//---------------------------------------------------------------------------
vtkSMObject::vtkSMObject() = default;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.