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 |
|---|---|---|---|---|---|---|---|---|
2c33474edfbc389dafcec8aa45dd3abbb41a6a1c | 8f0552538e918ab39679e20b00da48c4f4a20d00 | MeteoSwiss-APN/gtclang | /test/integration-test/PassSetNonTempCaches/MultipleCaches_1.cpp | C++ | cpp | 1,429 | permissive | //===--------------------------------------------------------------------------------*- C++ -*-===//
// _ _
// | | | |
// __ _| |_ ___| | __ _ _ __ __ _
// / _` | __/ __| |/ _` | '_ \ / _` |
// | (_| | || (_... |
2c5f056819320837572f59a6a2a607ba0eb66a72 | 80ac353ae5850de8f28403ec847e3d708f0a6f41 | buckle2000/gqe | /include/GQE/Core/assets/ConfigHandler.hpp | C++ | hpp | 3,650 | permissive | /**
* Provides the ConfigHandler class used by the AssetManager to manage all
* ConfigReader assets for the application.
*
* @file include/GQE/Core/assets/ConfigHandler.hpp
* @author Ryan Lindeman
* @date 20120428 - Initial Release
*/
#ifndef CORE_CONFIG_HANDLER_HPP_INCLUDED
#define CORE_CONFIG_HAND... |
6bbbafa0fa780ceb0c39af9765a56ccea7ab27cc | f4e7c0b7b632d54b80bf21b33969eff3cbb3cfe7 | otcshare/chromium-src | /components/performance_manager/graph/worker_node.cc | C++ | cc | 687 | 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/performance_manager/public/graph/worker_node.h"
#include "components/performance_manager/graph/worker_node_impl.h"
namespace perfor... |
9712ffa9727a65f4c563ad0a6c750b437daca6d9 | 6549146f313e09b966de4e4408a0a7effa59372f | camil0palacios/Competitive-programming | /solutions/RPC/07 - 2022/f.cpp | C++ | cpp | 1,653 | no_license | #include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define fori(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define fore(i,a,b) for(int i = a; i <= b; i++)
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define sz(v) (int) v.size()
#define mp make... |
3f8f5b2d9c8fefa67e6ad8ea84c0344bea67aca2 | 9b49b4fcbb24335c21d45c6ea15406d89101c7b0 | eisuke1222/ESfile | /06_Wizard/input.cpp | C++ | cpp | 36,501 | no_license | //=============================================================================
//
// 入力処理 [input.cpp]
// Author : Eisuke Sakagawa
//
//=============================================================================
//*****************************************************************************
// ヘッダファイルのインクルード
//*****... |
18ed6aa85daa70f6303b8cc0e2ebd4c918ebe113 | 9bfafea8322945668fdd2c0895f2ac98b76fe54b | SOFTK2765/PS | /BOJ/17140.cpp | C++ | cpp | 1,972 | no_license | #include <bits/stdc++.h>
using namespace std;
int a[101][101];
int cnt[101];
int main()
{
int r, c, k;
scanf("%d %d %d", &r, &c, &k);
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
scanf(" %d", &a[i][j]);
int t = 0, mxrow = 3, mxcol = 3;
bool flag = false;
while(t<=100)
{
... |
2e8d4e55c66bf121ae2be38064373828ddf2f77c | b21554f1e9d2314dbea22a9a1ea850ae085d0153 | dawidjaja/competitive-programming | /kattis/ivana.cpp | C++ | cpp | 929 | no_license | #include <bits/stdc++.h>
#define vi vector<int>
using namespace std;
int n;
const int INF = 1e9 + 7;
vi s;
int dp[105][105];
int mv(int x, int a) {
return (x + a + n) % n;
}
int f(int l, int r) {
if (l == r) return s[l];
int &ret = dp[l][r];
if (ret != INF) {
return ret;
}
ret = ma... |
a49678c5ee421f2a1fdb4b8d1ea5558dc2ba08fe | 5ce2e4bb4b86d0a5bc70595d369f1b9753ceaf80 | victordomingos/Learning_cpp | /025-PRODUCTION2d.cpp | C++ | cpp | 1,699 | no_license | /* Produção 2 - parte IV
2019-05-02 Victor Domingos
Ler 5 números para um array.
Escrever numa só linha :
“Há x pares, y ímpares, z maiores que o primeiro, w abaixo da média.”
*/
#include <iostream>
using namespace std;
int main()
{
float nums[5] = { 0.0 };
float nums_sum = 0;
... |
e44daa70fef3cd53f095bda35ac9fd2c5401fb0d | 9a2204c841ab0bc1f5f20b398c51e9794fcc12c6 | paullewallencom/tizen-978-1-7839-8190-8 | /_/1908OS_02_Codes/helloWorldNative/src/helloWorldNativeForm.cpp | C++ | cpp | 1,395 | permissive | #include "helloWorldNativeForm.h"
#include "AppResourceId.h"
using namespace Tizen::Base;
using namespace Tizen::App;
using namespace Tizen::Ui;
using namespace Tizen::Ui::Controls;
helloWorldNativeForm::helloWorldNativeForm(void)
{
}
helloWorldNativeForm::~helloWorldNativeForm(void)
{
}
bool
helloWorldNativeForm::... |
a2ad90fa45e3b53e81e7d952ecb0ff39e6559d01 | bd45ba5ba3b5a7ff650a44403ed8a78099ae9c7f | julimamani/JuegoED_Final | /TDA Cola/EJ5a.cpp | C++ | cpp | 340 | no_license | const int MAX=16;
typedef int tcola[MAX];
void iniciar_cola(tcola &cola)
{
cola[8]=MAX-1;
cola[9]=MAX-1;
}
void agregar_cola (tcola &cola, int nuevo)
{
if(cola_llena(cola)==true)
{
cout<<"cola llena"<<endl;
}
else
{
cola[9]=sig(cola[9]);
cola[cola[9]]=nuevo;
}
}
bool cola_vacia(tcola cola)
{
return (... |
74ada1949d0e1740b0172bffb757e291744e24d6 | 393836029e72b3d529aa7d910870e91d7d51cb81 | dipta007/Competitive-Programming | /@DOC by DIPTA/dipta007_final/Graph/mst-prims.cpp | C++ | cpp | 2,104 | permissive | // This function runs Prim's algorithm for constructing minimum
// weight spanning trees.
//
// Running time: O(|V|^2)
//
// INPUT: w[i][j] = cost of edge from i to j
//
// NOTE: Make sure that w[i][j] is nonnegative and
// symmetric. Missing edges should be given -1
// weight.
//
... |
140b45fef964c46407eb6305e18029de25403d9a | 6ce87b5e4578d1801bc1c1e3366727d2ca1ee1a8 | rosen90/GitHub | /EclipseCpp/AngyBirds/GameObjects/Bird.cpp | C++ | cpp | 533 | no_license | /*
* Bird.cpp
*
* Created on: Nov 11, 2014
* Author: Rosen
*/
#include "Bird.h"
#include "../Interfaces/Constants.h"
Bird::Bird(int x, int y, int width, int height) : PhisicalObject(x, y, width, height,
b2_dynamicBody, 1, 180, 45)
{
m_Shape = &m_birdShape;
}
void Bird::SetDimentions(int width, int heig... |
c4c6f2fbdd5fdec2c682830885ee0286515e296b | c79301fe8b3112f4f1b6c380e4d118da2dc614b5 | saleh-indev/gestionEtudiantMaster | /Releve2Notes.cpp | C++ | cpp | 2,463 | no_license | #include <iostream>
#include "Releve2Notes.h"
using namespace std;
Releve2Notes::Releve2Notes():Etudiant(){
mention("");
moyduSemestre(0.0);
moyenneGen(0.0);
creditTotSem(0);
creditTot(0);
}
Releve2Notes::~Releve2Notes(){}
double Releve2Notes::calculMoyduSemestre(double nts[], int coefs... |
0790e3f21fb19588070f277f96939915b80818d2 | d12314dfa77b5080157e201af07c94383d1a415f | undeadinu/rhino-developer-samples | /cpp/SampleRdkMarmalade/MarmaladeAutoMaterial.cpp | C++ | cpp | 10,959 | no_license |
#include "stdafx.h"
#include "MarmaladeAutoMaterial.h"
#include "MarmaladePlugIn.h"
#include "MarmaladeColorSection.h"
// Automatic materials such as Orange, Satin and Lemon Curd are based on the various shaders
// and use the RDK Automatic UI instead of a hard-coded UI. This makes it possible to use the
// same mate... |
bb7d9f7b7e44076a7ffebe02b6d5cfcae378e58a | 5862e45bacf30748de42dd28e3b6153c3e379ec0 | gregorycook/releases-comm-central | /mailnews/extensions/smime/src/nsMsgComposeSecure.cpp | C++ | cpp | 36,522 | no_license | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "nsMsgComposeSecure.h"
#... |
dbc8c338fdfe5e26f31fcb79d1bc9b0ce124bfbd | 7e8f8e7fc5cde44ad72890327c8e27ba4f6baf80 | tenonno/Siv3D-BMS | /Include/Siv3D/Print.hpp | C++ | hpp | 1,480 | no_license | //-----------------------------------------------
//
// This file is part of the Siv3D Engine.
//
// Copyright (c) 2008-2017 Ryo Suzuki
// Copyright (c) 2016-2017 OpenSiv3D Project
//
// Licensed under the MIT License.
//
//-----------------------------------------------
# pragma once
# include <memory>
# include "Fw... |
7be67fef811965b4803891aa1f4045d27b84fdd7 | 66deea9f70d4364f21904fe2cec2b20407cbebfd | jeffamstutz/boost.simd | /test/function/simd/minmod.cpp | C++ | cpp | 1,097 | permissive | //==================================================================================================
/**
Copyright 2016 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
**/
//====================================... |
cb610c26bba17521ffacc0150f8eb27db991e57c | 251094a6fa8196e1eebc9adc8362a8a8af5bb399 | MsNahid/CodeForces--Problem-solutions | /codeforces-112a-solution.cpp | C++ | cpp | 614 | no_license | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
#define sz 102
char str[sz + 2], str2[sz + 2];
int main(){
int i, j, k;
while(gets(str)){
gets(str2);
for(i = 0; str[i]; i++){
if(str[i] >= 'A' && str[i] <= 'Z')... |
86421b4f3fa8fc0e75056b2d4406600b6be797f3 | 760fe4399ba5235757d9817c0a17a70384674110 | eternity6666/life-in-acm | /practive/NCU/18summer/8.11/g.cpp | C++ | cpp | 620 | no_license | #include <bits/stdc++.h>
#define usefre
const int mod = 1000000007;
using namespace std;
int main()
{
#ifdef usefre
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
long long n;
cin >> n;
long long ans = 0;
ans = (n * (n * (n * (n - 6) % mod + 23 ) % mod - 42 ) % mod + 24) % mo... |
a6d41bd9deb3201cf4f3141ffa584477c0cb84bd | ec8fafbc8218284a44fcfd82000b278cbfa6138d | blakesullivan/ZOIDS---Top-Dog | /Top Dog V2/Top Dog V2/TargetState.cpp | C++ | cpp | 359 | no_license | //Blake Sullivan - TargetState.cpp
#include "TargetState.h"
AI_SEARCH_TARGET::AI_SEARCH_TARGET(Character* thepBot, Level *w, Object* pTar)
{
}
void AI_SEARCH_TARGET::activate()
{
}
void AI_SEARCH_TARGET::process()
{
}
void AI_SEARCH_TARGET::terminate()
{
}
int AI_SEARCH_TARGET::getStatus()
{
return 0;
}
void AI_SEARC... |
2ca0a74c0085f976a66df6750103b80a282f1dd0 | 4493277776fe8259fa445c45a9afd419413f39ad | mahtab04/Cpp-Programs | /CodeChef/Triangel.cpp | C++ | cpp | 330 | no_license | //Problem Link -> https://www.codechef.com/problems/FLOW013
#include <iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int a, b, c;
cin >> a >> b >> c;
if (a + b + c == 180)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
re... |
af0360b48f8299f1100a4f731063c2ec521614d7 | 7d8dffec254353ff818b3ee7a27e2301c27316d3 | htcondor/htcondor | /src/condor_utils/utc_time.cpp | C++ | cpp | 2,236 | permissive | /***************************************************************
*
* Copyright (C) 1990-2007, Condor Team, Computer Sciences Department,
* University of Wisconsin-Madison, WI.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you
* may not use this file except in compliance with the License. Y... |
6fb3725f2c043ff5eae06923e30ac9a7d8f2526e | ae37928cbb351fafce9d8f8c8f0d1295e9fa9c42 | wiwitrifai/competitive-programming | /codechef/nov16/chsqr.cpp | C++ | cpp | 416 | no_license | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int k;
scanf("%d", &k);
int first = k/2 + 1;
for (int i = 0; i < k; i++) {
for (int j = 0, z = first; j < k; j++, z++) {
if (z > k)
z = 1;
printf("%d ", z);
}
... |
4a99f4a7a3d3b18bb529e68162cc13d1c2ab25f7 | 8db97cab352fe116bc2b7e3e7d1c7470a506a04d | AAlab1819/RaysaGohtami-01082170033 | /Week07-Greedy/AA-978B-File Name.cpp | C++ | cpp | 707 | permissive | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
char array[n];
for(int i=0;i<n;i++)
{
cin>>array[i];
}
int total=0;
for(int i=0;i<n;i++)
{
if(array[i]!='x')
{
continue;
... |
b44aa5fc1d9b872a8efe9e938fdc0f5c2305b033 | ceedae4ec70a07ff61af313f5a0f56f8abca4c7f | Brayton-Han/OOP | /Homework 1/E01_13.cpp | C++ | cpp | 871 | no_license | function :
1）提示输入行数rows和列数cols;
2）一个带有边框（*）的rows*cols矩形。
下面是rows=6 cols=16的输出
****************
* *
* *
* *
* *
****************
Analysis:
把这个图形分成两个部分，分别是边界和内部。
边界上是"*"，内部是" "。
输出时，采用两重循环，当碰到边界时输出"*"，
否则输出" "。
#include <iostream>
#include... |
c570a0fb27f3dce1139cc2adb93591cd9af9e906 | f166833dc8efc70d4142a5f9e546f9092819408e | tachyon83/code-rhino | /DAY200~299/DAY297-BOJ21941-문자열 제거/yunkyu.cpp | C++ | cpp | 1,090 | no_license | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
using namespace std;
map<string, int> mp;
string s;
vector<string> keys;
int dp[1001];
int dfs(int ind) {
if (ind >= s.length())
return 0;
if (dp[ind] != 0)
return dp[ind];
for (int i = 0; i < keys.size(); i++) {
... |
482274913bfa4c933e16cc7ebd61221e848f2694 | ac35ff857bb9db6941d4cbc5dd23bf7ece4aebbb | Jiefei-Wang/AltStats | /src/RcppExports.cpp | C++ | cpp | 6,059 | no_license | // Generated by using Rcpp::compileAttributes() -> do not edit by hand
// Generator token: 10BE3573-1514-4C36-9D1C-5A225CD40393
#include <Rcpp.h>
using namespace Rcpp;
// C_has_pointer
bool C_has_pointer(SEXP x);
RcppExport SEXP _AltStats_C_has_pointer(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
... |
3132e6f1a6db10c250f329d83b0784f877ec88cc | 07f4f3e05bafa8b940d8a88fb49603c933741a6a | FannyZhao123/CS246-Object-Oriented-Software-Development | /tut/tutorial10/more-stl-examples/more_complex_stl.cc | C++ | cc | 1,284 | no_license | #include <algorithm>
#include <vector>
#include <map>
#include <iostream>
#include <iterator>
using namespace std;
void print_pair(pair<int,int> p){
cout << p.first << ": " << p.second << endl;
}
class Occurrences{
map<int,int> occurrences;
public:
void operator() (int i){
if(occurrences.count(i) == 0) occu... |
99ceb6480c3e9bc0a59320431c1e951e26b4c73a | d046270758fde469d2d3e70c24c92ebe48df4aba | guanzhongheng/project_my | /moore/node/rpc_secure.hpp | C++ | hpp | 1,596 | permissive | #pragma once
#include <boost/asio/ssl/context.hpp>
#include <boost/asio/ssl/stream.hpp>
#include <moore/node/rpc.hpp>
namespace rai
{
/**
* Specialization of rai::rpc with TLS support
*/
class rpc_secure : public rpc
{
public:
rpc_secure (boost::asio::io_service & service_a, rai::node & node_a, rai::rpc_config cons... |
e082801687805a82ea8ceccd76cca242881dab3c | bd67c77e0471143fadc00f9ee4089b05bfcb2864 | metux/chromium-suckless | /blimp/net/engine_connection_manager_unittest.cc | C++ | cc | 3,251 | permissive | // Copyright 2015 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 "blimp/net/engine_connection_manager.h"
#include <stddef.h>
#include <string>
#include <utility>
#include "base/callback_helpers.h"
#include "... |
f8b8a59f5bd8a29f77ac63fa916915a13124d95a | ced8e92de0c372519d412d8bcdb2629a5cddead0 | khorost/khorost-lib | /external/include/websocketpp/transport/asio/security/tls.hpp | C++ | hpp | 16,365 | permissive | /*
* Copyright (c) 2015, Peter Thorson. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of cond... |
3d1d4f3a397302967ea79a34f58a156885161cfd | 514112eb4e704499f267347c4ee33d71e9900d8e | ghazp/Spelprojekt | /GameClient/Minimap.cpp | C++ | cpp | 5,529 | no_license | #include "Minimap.h"
#include "Graphics.h"
#include "Input.h"
Minimap::Minimap()
{
m_sprite = NULL;
m_view = NULL;
}
Minimap::Minimap(string _file, FLOAT2 _terrainMin, FLOAT2 _terrainMax, FLOAT2 _cameraPos)
{
m_terrainMin = _terrainMin;
m_terrainMax = _terrainMax;
m_screenSpacePos = FLOAT2(0.79215f, 0.7235f);
m... |
fbb895b49cc4cdb1f6142b138207ff4e2f79052f | a3175ea2deb8cc96c73ffebcb96f2743eb4dbe30 | inspiralpatterns/master | /SMC 9/DTU guest /02393/modul 3/resources/liveClass.cpp | C++ | cpp | 3,055 | no_license | #include <iostream>
using namespace std;
/* 02393 - module 3
DATA TYPES AND POINTERS */
/* defining a structure */
struct intarray{
int* array;
int size;
};
/* obs: if we define a structure we could allow for multiple outputs from a
function (in this case, the function returns a struct containing both the primes... |
3a9ee93af99e6800f11db71dc8199fc1f03ca25b | 8d499f22397e18fec7cafc019a8e9e5a7204f6e7 | ShristDas/C- | /lastlab4.CPP | C++ | cpp | 524 | no_license | /*WAP to use pointer for both base and derived classes and call the member function.
Use virtual keyword.*/
#include<iostream>
using namespace std;
class A
{
public:
int a=100;
virtual void show()
{
cout<<"The pointer of the base class:"<<a<<"\n";
}
};
class B:public A
{
public:
int d=200;
... |
4372a0e87d429874648b0fa9c7433a4048dd2d39 | b2d1edf6082c7fb945e1cdf22e6fba04c2bc1912 | osrf/mentor2 | /model_plugins/SimpleConnectionsPlugin.hh | C++ | hh | 3,147 | no_license | /*
* Copyright (C) 2015 Open Source Robotics Foundation
*
* 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 appl... |
8742fd1e7f554fb00c16ef565aa1c330ffad63db | 0aba55f7e34a1409eae28cacf9ccccf7cf54629c | DanilaFoxPro/UnotUI | /code/unotui/utility/general.cpp | C++ | cpp | 5,002 | permissive |
#include <iostream>
#include <system_error> // For throwing exeptions around.
#include <fstream> // I think I load shader files using that.
#include <cstring> //strcpy
#include <unotui\utility\deps\stb_image.h> // For loading images. Duh.
#include <unotui\utility\deps\opengl_includes.h>
#include <unotui\utility\coor... |
e060e80f29c36c549aec644a2bba06d6018866bb | 0432769a6d623d892ebd763260e398357a2f4eac | Mr-Phoebe/ACM-ICPC | /OJ/HDU/HDU 3714.cpp | C++ | cpp | 2,152 | no_license | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cma... |
192d05bbf0a0cb6317ed2f952396cf673fe5d046 | 3e7297943d35f7328ab526174f5c35266c84cece | vivekdhir77/Everyday | /cpp/Twins.cpp | C++ | cpp | 647 | no_license | //https://codeforces.com/problemset/problem/160/A
#include <iostream>
#include <cmath>
#include <cstdio>
#include <string.h>
#define ll long long int
using namespace std;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int n;
cin>>n;
int nos[n];
for(int i=0;i... |
eae3f61e2af7c65611f887763fc179c49bac0098 | f1eba65cb86aaddda5d3f5d594fdf77302f13379 | leahneukirchen/adventofcode2017 | /day25.cc | C++ | cc | 702 | permissive | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
struct trans;
using state = pair<trans,trans>;
struct trans {
int w, m;
state *n;
};
enum {
L = -1,
R = +1
};
int main() {
int l = 12399302;
state A, B, C, D, E, F;
A = {{1, R, &B}, {0, R, &C}};
B = {{0, L, &A}, {0, R, &D}};
C =... |
efc356d3596e403c0794a3576dc21f1d56b8c7c8 | bd1f466755e49f34a6761f7c32cee8969d2bcf15 | ashutosh0gupta/llvm_bmc | /examples/litmus/c/run-scripts/tmp_10/W+RWC+poll+poaa+dmb.sypa.c.cbmc_out.cpp | C++ | cpp | 53,879 | no_license | // Global variabls:
// 0:vars:3
// 3:atom_1_X0_1:1
// 4:atom_1_X2_0:1
// 5:atom_2_X2_0:1
// Local global variabls:
// 0:thr0:1
// 1:thr1:1
// 2:thr2:1
#define ADDRSIZE 6
#define LOCALADDRSIZE 3
#define NTHREAD 4
#define NCONTEXT 10
#define ASSUME(stmt) __CPROVER_assume(stmt)
#define ASSERT(stmt) __CPROVER_assert(stmt,... |
2d24529ace4c1852bbd53d06bfcdce874445a4a9 | 06309319f3d9c26e4e4222d7243231e3be94811a | Bobarshad/armnn | /src/backends/aclCommon/ArmComputeTensorUtils.cpp | C++ | cpp | 11,012 | permissive | //
// Copyright © 2017 Arm Ltd. All rights reserved.
// SPDX-License-Identifier: MIT
//
#include <aclCommon/ArmComputeTensorUtils.hpp>
#include <aclCommon/ArmComputeUtils.hpp>
#include "armnn/Exceptions.hpp"
#include <armnn/Descriptors.hpp>
namespace armnn
{
namespace armcomputetensorutils
{
arm_compute::DataType Ge... |
6a995840425cea3bcda331b638dfcc48428cafc3 | df0af0dd3af724cb04e26d1802adb80a95499250 | kyx0r/FA_Patcher | /boost_lib/boost/archive/polymorphic_xml_oarchive.hpp | C++ | hpp | 1,121 | permissive | #ifndef BOOST_ARCHIVE_POLYMORPHIC_XML_OARCHIVE_HPP
#define BOOST_ARCHIVE_POLYMORPHIC_XML_OARCHIVE_HPP
// MS compatible compilers support #pragma once
#if defined(_MSC_VER)
# pragma once
#endif
/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
// polymorphic_xml_oarchive.hpp
// (C) Copy... |
0dd877a28308324a61dd14656ac14a1d4fbec3cb | 850686cb4698951563a804a8b31a467f39097164 | FalcoTech/FT2019 | /src/main/cpp/Commands/Premade2.cpp | C++ | cpp | 2,288 | no_license | // RobotBuilder Version: 2.0
//
// This file was generated by RobotBuilder. It contains sections of
// code that are automatically generated and assigned by robotbuilder.
// These sections will be updated in the future when you export to
// C++ from RobotBuilder. Do not put any code or make any change in
// the blocks ... |
2dcc16200be0e500c59630358c1e0cbe6019564d | aee37e9a028754750e80e28657b5bd2dca6c91ce | psenzee/senzee5 | /blog/pair_v00100/compiler/source/rewriter/pair_rewriter.cpp | C++ | cpp | 8,448 | no_license | #include "opcode.h"
#include <stdio.h>
#include <conio.h>
const unsigned char _test_code1[] =
{
0x05, 0x07, 0x00, 0x00, 0x00, 0x1c, 0x50, 0x0e, 0x05, 0x08, 0x00, 0x00, 0x00, 0x66, 0x00, 0x00,
0x00, 0x00, 0x09, 0x03, 0x1d, 0x00, 0x6a, 0x00, 0x05, 0x16, 0x00, 0x00, 0x00, 0x6a, 0x01, 0x68,
0x01, 0x51,... |
74699663c7ab7714d78fab1212a8cd245fdfa7e8 | 71dc99383a25fe56231b125d8fccd6fa5ecfc0d3 | l5d1l5/Chombo_4 | /example/DomainDecomposition/EBDarcyAdvectDiffuseReact/src/EBDarcy.cpp | C++ | cpp | 7,581 | permissive |
#include "EBDarcy.H"
#include "EBParabolicIntegrators.H"
#include "Chombo_ParmParse.H"
#include "Chombo_NamespaceHeader.H"
#include "DebugFunctions.H"
using Proto::Var;
/*******/
EBDarcy::
EBDarcy(shared_ptr<EBEncyclopedia<2, Real> > & a_brit,
shared_ptr<GeometryService<2> > & a_geoserv,
const... |
5ae0dd3f09ed29d9a0d3c52a5bb47a486b428cea | 4a344c3b43ea2e12d516fb2e9d4c9167972ec9c5 | a-ahmed/SCUM_SDK | /SDK/SCUM_Zombie_Tactical_Jacket_01_classes.hpp | C++ | hpp | 677 | no_license | #pragma once
// SCUM (Dumped by Hinnie) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGeneratedClass Zombie_Tactical... |
d38701cfe11b3bd382a7855102da364e17a48d26 | a4c215ff5f41fdf0438764494e2d24bfddafc599 | LeoCognard/EpreuveE5.2-Equilibreuse-2020 | /TD4/build-CommandeMoteur_MesureVitesse_etu-Desktop_Qt_5_15_0_GCC_64bit-Debug/moc_equilibreuse.cpp | C++ | cpp | 4,078 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'equilibreuse.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.15.0)
**
** WARNING! All changes made in this file will be lost!
*******************************************************... |
8573332d10df2b241114e06276014e128904e918 | db2e62bc7fa43aa3a069169de2967c0d1742fe13 | 3660628/chtmoneyhub | /moneyhub2.2/Security/BankLoader/BankLoader.cpp | C++ | cpp | 9,994 | no_license | #include "stdafx.h"
#include "BankLoader.h"
#include "windows.h"
#include <assert.h>
#include <Psapi.h>
#include <TlHelp32.h>
#include "VerifyCache.h"
#include "../../Security/Authentication/encryption/MD5.h"
#include "../Authentication/ModuleVerifier/export.h"
#include "../../Include/LogPrintf.h"
#include ".... |
57b0749e859fc0eaa353de16250370f60d9019be | 3e5a45f2f8981bd1b75bc4997fa989c48858f2fe | beldenfox/LLGL | /sources/Renderer/Vulkan/RenderState/VKFence.cpp | C++ | cpp | 988 | permissive | /*
* VKFence.cpp
*
* This file is part of the "LLGL" project (Copyright (c) 2015-2019 by Lukas Hermanns)
* See "LICENSE.txt" for license information.
*/
#include "VKFence.h"
#include "../VKCore.h"
namespace LLGL
{
VKFence::VKFence(const VKPtr<VkDevice>& device) :
fence_ { device, vkDestroyFence }
{
V... |
d9db1bd27b22351fd13b6bb89fbd08c1430f9fe4 | 4808f971ef1417fc947915be44eb7083a03887d0 | dkurt/opencv | /modules/imgproc/src/phasecorr.cpp | C++ | cpp | 21,801 | permissive | // This file is a part of OpenCV project.
// See opencv/LICENSE and http://opencv.org/license.html for the actual licensing terms.
// See also opencv/doc/LICENSE_CHANGE_NOTICE.txt. Below is the original license:
/*********************************************************************
* Software License Agreement (BSD L... |
44e9fcf6fdf003bf031e92ebab6ec6fcaa853b5c | e79509c978910a56fdf6611bad223a131cd5cb6c | eunchong/chromium-1 | /content/browser/frame_host/navigation_request.cc | C++ | cc | 19,606 | 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 "content/browser/frame_host/navigation_request.h"
#include <utility>
#include "content/browser/devtools/render_frame_devtools_agent_host.h"
#in... |
77d8cad0c7f9d13c1bca8455792af6b0b0e1a01f | 375b9edb3e881af8eb07193756d8fd0429cf76b1 | gswei/China-Telecom-International-Clearing | /newcommonplugin/src/CallFee.cpp | C++ | cpp | 8,330 | no_license | /****************************************************************
Project
Copyright (c) 2005-2006. All Rights Reserved.
广州普信科技有限公司
SUBSYSTEM: 用户自定义插件头文件
FILE: C_CallFee.cpp
AUTHOR: weixy
Create Time: 2007-11-19
==================================================================
Des... |
4206869581877f80caef7e07fab5e263f8b4c776 | 39440cb416b6a2ef6d079010853c52d1d035a8a8 | yuvrajkumarViT/CodeChef_Solutions | /Left Rotation/main.cpp | C++ | cpp | 466 | no_license | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
int d;
cin>>n>>d;
int arr[n];
int arrs[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int k=0;
int b=0;
for(int i=d;i<n;i++)
{
arrs[k]=arr[i];
k++;
}
for(i... |
a6394270aa876975ff97a56fed03a7a45dcd1c0c | 39944c052e4c049cbdad92eec1450116163f2d3f | Sudipta-Trisha/AtCoder-Problems-Solutions | /AtCoder Beginner Contest 174/D - Alter Altar/sol.cpp | C++ | cpp | 637 | no_license |
/**
* author : Sudipta Banik Trisha
* created : August 02, 2020 6:00 PM
* Problem Name : D - Alter Altar
* Problem Limit : 2000 ms , 1024 MB
* Problem Url : https://atcoder.jp/contests/abc174/tasks/abc174_d
* @genarated by : ai-virtual-assistant
**/
#include<bits/stdc++.h>
usi... |
fc7b4ed855c5ecacdabf533c6f05aecb3239f3b1 | 13262820dbe093b97be4272e0ca8571cb873ad2f | PortableApps/palemoon27 | /dom/canvas/WebGLContext.cpp | C++ | cpp | 60,952 | no_license | /* -*- Mode: C++; tab-width: 20; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "WebGLContext.h"
#inclu... |
9771338f5cb1ac97b3fad499659fd413816194f0 | 16bc54d153cd91eab1ae415de7557f5b00021167 | smeenai/llvm-project | /clang/test/CodeGenCXX/debug-info-ctor.cpp | C++ | cpp | 233 | permissive | // RUN: %clang -emit-llvm -g -S %s -o - | FileCheck %s
struct X {
X(int v);
int value;
};
X::X(int v) {
// CHECK_TEMPORARILY_DISABLED: call void @_ZN1XC2Ei(ptr %this1, i32 %tmp), !dbg
// TEMPORARY CHECK: X
value = v;
}
|
d5c35aef8790bbddf02ba9dc3d42d0c7ae975452 | 82897496b28af8dba6df943f21e97c2d9724f72d | rfdnl/fyp-engine | /Subsystem/Test/TestFonts.hpp | C++ | hpp | 224 | no_license | #ifndef TEST_FONTS_HPP
#define TEST_FONTS_HPP
#include "TestBase.hpp"
class TestFonts : public TestBase {
public:
TestFonts(Engine& engine);
~TestFonts();
void Draw() override;
};
#endif // TEST_FONTS_HPP
|
139ba771090828e15821c486f43d844472b2e772 | cc3d89e8356b6367abdc35cfd95e71bd7482054c | Lentono/ShapeConquest | /ShapeConquest/ShapeConquest/Graphics Pipeline/RenderTarget.cpp | C++ | cpp | 1,446 | permissive | #include "RenderTarget.h"
#include <utility>
RenderTarget::RenderTarget(std::vector<std::shared_ptr<Texture>> targets, std::shared_ptr<DepthStencil> depthStencil,
std::shared_ptr<BlendState> blendState, std::shared_ptr<DepthState> depthState, std::vector<glm::vec4> clearColours, bool clearDepthStencil, bool clearCol... |
c77af984c02ad45d634f4840cd5ff8a705bc74e9 | 0179975952a97ccc664edbf00b37d3527e9876d6 | Bernini0/Codes | /hello/unlucky.cpp | C++ | cpp | 780 | no_license | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
// printf("%d",n);
int arr[n];
int arr2[n];
char str[2*n+1];
scanf("%s",str);
for (int i = 0; i < n; i++)
{
arr[i] = str[i]-48;
}
for (int i = n; i < 2*n; i++)
{
arr2[i-n] =... |
b3928c78a896910a7adb42ead2cc0559b778dc61 | 1eaf00068832822fc2d1676eb774a652dde8a4de | Vikalp19041999/LeetCode-solutions | /Min Stack.cpp | C++ | cpp | 705 | no_license | class MinStack {
public:
/** initialize your data structure here. */
stack<int> s1;
stack<int> min;
MinStack() {
}
void push(int val) {
s1.push(val);
if(min.empty() || min.top() >= val) {
min.push(val);
}
}
void pop() {
if(min.top() =... |
7c50d78466d9ff2b4b2a50e65ead3461fc693de6 | f0b77e0ba941bc7627455ba87f5b3895252a3418 | dingshiyu/aliyun-openapi-cpp-sdk | /alidns/src/model/DescribeBatchResultDetailRequest.cc | C++ | cc | 2,722 | permissive | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required... |
f84df98547c04f519d41536a4211baa07103efa1 | 879353c7b3fa2a3bbbf66e5df2393b5a1b060fa6 | metux/chromium-suckless | /third_party/pdfium/core/fpdfdoc/cpdf_annot.cpp | C++ | cpp | 16,471 | permissive | // Copyright 2016 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "core/fpdfdoc/cpdf_annot.h"
#include "core/fpdfapi/page/cpdf_form.h"... |
3052da5c317a9bafd3da13607a97eb5a92081e4c | 299872982db92e5acee895c2b204f640f49f0ebb | joeykrakowski/enjin-cpp-sdk | /test/unit/events/EventTypeDefTest.cpp | C++ | cpp | 6,189 | permissive | /* Copyright 2021 Enjin Pte. Ltd.
*
* 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... |
f1bca02b2d8a120e35b409183585806115b99176 | 6aff861596bed5fe4d9b2af597d27822c9f46703 | rooi/osgqtquick | /src/qml/osg/sphere.cpp | C++ | cpp | 1,927 | no_license | #include "sphere.hpp"
#include "sphereindex.hpp"
#include <osgQtQml/Index>
#include <osg/Shape>
#include <QDebug>
namespace osg {
SphereQtQml::Index::Index(Sphere *box) :
ShapeQtQml::Index(box),
qthis(0)
{
othis = box;
}
void SphereQtQml::Index::classBegin()
{
if(!othis) othis = new Sphere();
... |
e4106f482542ad7b1554a7d503a88eacd829d1c1 | b706f572b34938c59d7bcb3a0cefba2b8f781e7b | Mishanyny/oop_labs | /zd1.cpp | C++ | cpp | 1,216 | no_license | #include <iostream>
#include <math.h>
using namespace std;
struct X
{
int number;
X* p_next;
void set_num_from_keyboard();
bool check_grade_of_num_two();
};
void X::set_num_from_keyboard()
{
cout<<"Enter the num."<<endl;
cin>>number;
};
bool X::check_grade_of_num_two()
{
if (number &... |
c22f59990b12fd87a003c517e02e88afd473b21a | 49c9c7432f6843cf0e528b2353354b88af5f37f5 | PyRPy/algorithms_books | /leetcodeCpp/two_sum.cpp | C++ | cpp | 1,054 | no_license | #include <vector>
#include <iostream>
#include <map>
using namespace std ;
class Solution
{
public:
vector <int> twoSum(vector <int>& nums, int target) {
map <int,int> res_hash;
vector <int> result;
int i;
for(i=0;i<nums.size();i++)
{
... |
73a6b219c0a0dc52f6f96cf45bd67757a2fd054f | feaefaa7aa7fdf0a186d0b4ada5adb5c0bcd08f1 | asad14053/My-Online-Judge-Solution | /All code of my PC/code_chef(august_long)a.cpp | C++ | cpp | 5,755 | no_license | /// Md.ASADUZZAMAN
/// Dept of ICT
/// MBSTU
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define fr(i,a,b) for(int i=(a);i<(b);i++)
#define rfr(i,a,b) for(int i=(b-1);i>=(a);i--)
#define freach(i, c) for( __typeof( (c).begin() ) i = (c).begin(); i != (c).e... |
f8a6b1639d319758229c7b4976b19a2ffd782525 | 62defae37e43a17b9f3d0ce96017aee89d421c11 | DheerendraRathor/Graphics | /A2/src/draw_cube.cpp | C++ | cpp | 2,462 | no_license | #include <iostream>
#include <GL/glew.h>
using namespace std;
#include "draw_cube.hpp"
#include "draw_rectangle.hpp"
void draw_cube(double length, double width, double height) {
glPushMatrix();
glTranslated(0.0, 0.0, width / 2);
draw_rectangle(length, height);
glPopMatrix();
glPushMatrix... |
877fa81cb6a985dbad0a74bba992b67235e2c48e | ce31e4fbbe46193a71afe274b9f57b57cf697ebc | mhochsteger/blaze | /blazetest/src/mathtest/smatdmatmult/HCbSUDa.cpp | C++ | cpp | 4,581 | permissive | //=================================================================================================
/*!
// \file src/mathtest/smatdmatmult/HCbSUDa.cpp
// \brief Source file for the HCbSUDa sparse matrix/dense matrix multiplication math test
//
// Copyright (C) 2012-2019 Klaus Iglberger - All Rights Reserved
//
// T... |
276c2521af2199730c5b47873cfefbca63c27ab4 | 5e5ac8851d2bf3b93751c74fe0f06eb37a54169b | meniossin/src | /third_party/blink/renderer/core/css/properties/longhands/column_fill_custom.cc | C++ | cc | 603 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/core/css/properties/longhands/column_fill.h"
namespace blink {
namespace CSSLonghand {
const CSSValue* ColumnFill::... |
110a1de8599caab14fa3c2f72af4759219e24e9c | d85fb41f387dd8abd563a8cdf9cd7dec87d2cbde | SnowJambi/cpp-assignment-2 | /Assignment2/Assignment2.cpp | C++ | cpp | 4,651 | no_license | // Author: Lachlan Jadezak CIT 207385
// Version: 15/11/2019
#include <iostream>
#include <fstream>
#include "Product.h"
#include "Stock.h"
#include "Functions.h"
using namespace std;
int main()
{
// Open products file, ensure it is present
ifstream inProducts("products.txt");
if (!inProducts) {
cout << "ERROR: C... |
99075b64ba18f8bbff22d5f68cc2c968ad272f2a | d160a2312a24809b04db6e6e619cd4a991053c83 | yiw2/ikran | /native/chrome-18.0.1017.0/src/sip/src/media/webrtc/WebrtcAudioProvider.cpp | C++ | cpp | 32,318 | no_license | /* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (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.mozilla.org/MPL/
*
... |
960de52b1e0735ec92ba22945a24c28825374a9b | b5f908fcd23b341f3210866e553d6c86676985f0 | lbensaad/WinRobot | /JNI/JNIAdapter/JNIAdapter.cpp | C++ | cpp | 7,759 | permissive | // JNIAdapter.cpp
//
#include "stdafx.h"
#include "com_caoym_WinRobot.h"
#include "com_caoym_WinFileMappingBuffer.h"
#include "WinRobotJNIAdapter.h"
#include "FileMappingAdapter.h"
#include "debuglogger.h"
#include "JniObj_T.h"
//#include "mainpage.h"
#ifdef _MANAGED
#pragma managed(push, off)
#endif
HMODULE g_hModule... |
239347be21850fa03a5b54241228baa43613efa7 | ebb394e85a7ce91ca1f072f0afdc2e760a26bbe9 | abdullahkhan-z/AnalysisSitus | /src/asiAlgo/blends/asiAlgo_FindCrossEdges.cpp | C++ | cpp | 5,746 | no_license | //-----------------------------------------------------------------------------
// Created on: 01 October 2018
//-----------------------------------------------------------------------------
// Copyright (c) 2018-present, Sergey Slyadnev
// All rights reserved.
//
// Redistribution and use in source and binary forms, w... |
5df2122a9eacbd60704d44803ee732b5e53c3e47 | e8718b27fd49144b5762ef3d458fc16df560069b | bitspace-source/eos-benchmark-pi | /eos-benchmark/eos-benchmark.cpp | C++ | cpp | 563 | no_license | #include <eosiolib/eosio.hpp>
#include <eosiolib/print.hpp>
using namespace eosio;
class hello : public eosio::contract {
public:
using contract::contract;
/// @abi action
void pi( uint64_t iterations, uint64_t difficulty ) {
uint64_t offset = 1000000000000000000;
uint64_t pi = offset;... |
8d54727a431789969cb9eb4efef4d43dcc2a2aa9 | 87d41a249891da3b4979dc1d9a6b7218e4f1ab48 | Leeseungeun1/sgalgorithm | /HW4/closestPairMainD&C.cpp | C++ | cpp | 2,878 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#define ERROR_BOUND 1.0e-30
void errorExit(const char *s);
void sortXid (double *X, unsigned *Xid, unsigned *TMP, unsigned N);
// input : X[] (x position array of N points)
// Xid[] (index array of X (initially [0,1,...,N-... |
c7f6992d858773fcbb623675b6244437e2f925b6 | 1670fd0f669a85f6d6d78bde9862735a3aa4786c | michaelnuzzo/noiseUtility | /Source/PluginProcessor.cpp | C++ | cpp | 5,963 | no_license | /*
==============================================================================
This file contains the basic framework code for a JUCE plugin processor.
==============================================================================
*/
#include "PluginProcessor.h"
#include "PluginEditor.h"
//===... |
ead3834fae6a7f4b196e29cc4f0da4ce3ebb6cc9 | 2183a46b858755b9a5aeeac4884e5dfca67ad589 | AnBaolei1984/Paddle-Lite | /lite/tests/kernels/pad2d_compute_test.cc | C++ | cc | 6,063 | permissive | // Copyright (c) 2019 PaddlePaddle Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required... |
20b213c7b508f00587dbd9515a85d503f5b37871 | 4b16cc19e9f46c7d0f99806b0701aa30e2960602 | leekeonl/C- | /test11.cpp | C++ | cpp | 463 | no_license | #include <iostream>
using namespace std;
class Circle {
public:
int radius ;
double getArea();
};
double Circle::getArea() {
return 3.14*radius*radius;
}
int main() {
Circle donut; // circle 타입의 donut 객체 변수
donut.radius = 2;
double area = donut.getArea();
cout << "donut 면적은 " << area << e... |
e94d618b5ce742f1fa933b64bb391298653fd78c | eef4013204bbd851e77ed7bf4726696bb52e5119 | KDE/kcron | /src/crontablib/ctunit.cpp | C++ | cpp | 7,195 | no_license | /*
CT Unit of Time Interval Implementation
--------------------------------------------------------------------
SPDX-FileCopyrightText: 1999 Gary Meyer <gary@meyer.net>
--------------------------------------------------------------------
SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "ctunit... |
4cafa6276e6d309902dad4b126085f395f77e639 | d92df23f8f324a0d844bd3964ee111269997d44d | ravindkv/cms-tty-run2 | /Ntuple_Skim/src/EventPick.cpp | C++ | cpp | 25,889 | no_license | #include"../interface/EventPick.h"
#include <TLorentzVector.h>
#include <iostream>
#include <iomanip>
EventPick::EventPick(std::string titleIn){
title = titleIn;
year = "2016";
saveCutflows = false;
printEvent = -1;
loosePhotonVeto=true;
cutFlow_ele = new TH1D("cut_flow_ele","cut flow e+jets... |
dc5816e0e17fbb050275649f1fd0d44700fd858b | 9d9dc678e4165d55eafabca5bcef03cffc50d503 | UMD-SIVE-Lab/qesmpi | /tests/utils/test_population.cpp | C++ | cpp | 2,006 | no_license | #include "utils/population.h"
#include "utils/population_gen.h"
#include <vector>
#include "gtest/gtest.h"
#include "gmock/gmock.h"
using namespace std;
using namespace sivelab;
using ::testing::ElementsAre;
using ::testing::ContainerEq;
class PopulationTest: public testing::Test {
public:
std::vector<double> m... |
b406b281bb2aac4ee363d8d799ad76421a87dad3 | 89b0a4a4f37dc55818f809571f790d889765e108 | Samsung/icu | /source/test/intltest/collationtest.cpp | C++ | cpp | 75,030 | permissive | // © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
*******************************************************************************
* Copyright (C) 2012-2015, International Business Machines
* Corporation and others. All Rights Reserved.
************... |
1d38e607c940d64d2ffefb2c3d21417516c27cbc | a8d6320e9533d5aa8c35c2ba012fa41fe8fc8947 | dhivyadharshin/pytorch | /test/cpp/api/misc.cpp | C++ | cpp | 2,099 | permissive | #include <gtest/gtest.h>
#include <torch/torch.h>
#include <test/cpp/api/support.h>
#include <functional>
using namespace torch::test;
void torch_warn_once_A() {
TORCH_WARN_ONCE("warn once");
}
void torch_warn_once_B() {
TORCH_WARN_ONCE("warn something else once");
}
void torch_warn() {
TORCH_WARN("warn mu... |
a2763c0569e1cc094c632ac8adef13b29a53fc36 | 005ac3c7a559daf93c4b47083c7775c9aad75cff | Irreversibility/lorina | /test/verilog.cpp | C++ | cpp | 11,398 | permissive | #include <catch.hpp>
#include <lorina/verilog.hpp>
using namespace lorina;
class simple_verilog_reader : public verilog_reader
{
public:
simple_verilog_reader() {}
void on_module_header( const std::string& module_name, const std::vector<std::string>& inouts ) const override
{
(void)module_name;
(void)... |
20499d482c056993be3ab5f7ff550fac8ac518ac | c6761c2e59c8d2178b5f9f25ac4d9a46b39af57a | GoncaloFDS/AVT-openGL | /MicroMachines/src/Timer.cpp | C++ | cpp | 711 | no_license | #include "Timer.h"
float Timer::deltaTime = 0;
float Timer::elapsedTime = 0;
bool Timer::isPaused = false;
std::clock_t Timer::m_CurrentTime;
std::clock_t Timer::m_DeltaTime;
Timer::Timer() {}
void Timer::Start() {
Timer::Tick();
}
void Timer::Tick() {
if (isPaused)
return;
auto temp = clock();
m_DeltaTime =... |
9eed585edce41ff6919165ed605959f2162b9dd8 | c8d6407735a1c3d19d9a6aa0f2d1b3154d9c4c0a | GTAResources/re3 | /src/control/Cranes.cpp | C++ | cpp | 748 | no_license | #include "common.h"
#include "patcher.h"
#include "Cranes.h"
WRAPPER bool CCranes::IsThisCarBeingTargettedByAnyCrane(CVehicle*) { EAXJMP(0x5451E0); }
WRAPPER bool CCranes::IsThisCarBeingCarriedByAnyCrane(CVehicle*) { EAXJMP(0x545190); }
WRAPPER bool CCranes::IsThisCarPickedUp(float, float, CVehicle*) { EAXJMP(0x543940... |
1ff2eda77ebe9b8e443951de6145b17c65b647aa | d9864c44a0b272cdba677b10e59288d98b5ad91a | hiroshi-maybe/atcoder | /solutions/AbbreviateFox.cpp | C++ | cpp | 3,137 | no_license | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
d86752f07205492f8f0fea765b449204ebd797d7 | 2bffd41073137b4b735f80605fe70ad0f5977a82 | mohan-chinnappan-n/dataloader | /windows-dependencies/autoit/AutoItX/StandardDLL/VC6/Example/main.cpp | C++ | cpp | 763 | permissive | // Empty project additions:
// Added "AutoIt3.h" include
// Added "AutoItX3.lib" to the input linker libraries
//
// AutoItX3.dll needs to be in the run path during execution
#include <Windows.h>
#include "AutoIt3.h"
int APIENTRY WinMain(HINSTANCE hInstance,
HINSTANCE hPrevInstance,
... |
ce324cbc530c2e45d0340ee01f24736cfde951c4 | 2f0aea08b6ee7a46c165134968c297586d261c52 | shuklayash/DS-ALGO-Practice | /sameTree.cpp | C++ | cpp | 743 | no_license | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... |
eea264b203488153979e87fdc53e2ee61c9c884f | bc93c86c11cc81120b2845a39db90134ccb9f172 | asianhawk/PSS | /purenessscopeserver/purenessscopeserver/PurenessScopeServer/PurenessScopeServer.cpp | C++ | cpp | 9,438 | no_license | // PurenessScopeServer.cpp : 定义控制台应用程序的入口点。
//
// 有时候的说，重新站起来绝对不是一件容易的事情，但是我现在必须站起来。要做好样的，freeeyes
// add by freeeyes, freebird92
// 2008-12-22(冬至)
// 从Twitter的主程序中吸收了一些有用的小技巧，不断融合。
// 没有目标的坚持是无用的，努力的让PSS更加适合开发，尽量减少开发者开发量，让写代码变的舒适。
// 并提供更完备的错误分析机制，和一些更好的程序编程技巧。
// 现在PSS不是一个人在努力了，它有了更多的伙伴，他们会帮助你不断成长。
// add by freeeyes... |
279a6232d0be1e9fa99837cc483a9d26f72e860d | 143033242494acbaa5f285b95b4b0a860451d4cb | aliyun/aliyun-openapi-cpp-sdk | /green/src/model/SendVerifyCodeToEmailRequest.cc | C++ | cc | 1,658 | permissive | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required... |
704bed575ca009c7f186dbf97d57948d8d090d05 | a6e3a36928fe1e54f4a00a12fa1f34f0276c0787 | a1230119/Cplusplus-lab | /lab2/Elo.cpp | C++ | cpp | 487 | no_license | #include "Elo.h"
void Elo::setK(int k){
K=k;
}
void Elo::setRA(int ra){
RA=ra;
}
void Elo::setRB(int rb){
RB=rb;
}
int Elo::getK(){
return K;
}
int Elo::getRA(){
return RA;
}
int Elo::getRB(){
return RB;
}
int Elo::calRA(float sa, int RA, int RB){
double EA=1/(pow(10,(RB-RA)/400.0)+1);
int ratingRA=round(RA+K*... |
37220757e199eb98e7a199a8914515ddc9183737 | 7c9575818b528611fe1f12650fe3fab3a102b7a3 | rkudiyarov/ClutterWebkit | /WebKit2/Shared/BackingStore.cpp | C++ | cpp | 3,789 | no_license | /*
* Copyright (C) 2010 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions a... |
f41305be3af323f9d119c8d0c454bda6a7398e15 | 52ef20768a7173e38c90144812b38ae908805b4d | grantr/mako | /internal/cxx/queue_test.cc | C++ | cc | 4,951 | permissive | // Copyright 2019 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in ... |
82271d31a5bf1b1db04c9e62f96369bdd2e82058 | f96115c5c37bf7872a5aee416770488a1f0e116b | gokmonk/methcla | /engine/plugins/soundfile_api_dummy.cpp | C++ | cpp | 6,549 | permissive | // Copyright 2013 Samplecount S.L.
//
// 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 t... |
248e486820317491031fd1fb8b339dacdc154dfa | 42e3fcfa86db9e6f598b74302356baeea963c134 | Aidonis/AiEngine | /AiEngine/src/Quad.cpp | C++ | cpp | 3,108 | no_license | #include "Quad.h"
Quad::Quad(){
const char * VertexShader = // Vertex Shaders deal with objects in 3D space
"#version 330\n"
"layout(location = 0) in vec3 position;"
"layout(location = 1) in vec4 color;"
"layout(location = 2) in vec2 texcoord;"
"uniform mat4 mvp_matrix;"
"out vec4 vColor;"
"out vec2 U... |
fe45feb939cc3c58d9a35507bfba005e3088debe | 3809ee3bb1a6308696ddb850ec263aca66009dc0 | coinapilla/coinapilla | /src/qt/sendcoinsentry.cpp | C++ | cpp | 4,424 | no_license | #include "sendcoinsentry.h"
#include "ui_sendcoinsentry.h"
#include "guiutil.h"
#include "bitcoinunits.h"
#include "addressbookpage.h"
#include "walletmodel.h"
#include "optionsmodel.h"
#include "addresstablemodel.h"
#include <QApplication>
#include <QClipboard>
SendCoinsEntry::SendCoinsEntry(QWidget *parent) :
... |
9d2a3b59788a4abd5b02c2056f1c5e2ab70a9f84 | af417f08c7639e77d45cfbb3a1253ea797bdd360 | denis-pakhorukov/computer-graphics-course | /course-work/main_original.cpp | C++ | cpp | 16,907 | no_license | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <GL/glut.h>
#ifdef _WIN32
#define drand48() ((float)rand()/RAND_MAX)
#endif
/* #define SCREEN_SAVER_MODE */
enum SprayType {
PS_WATERFALL,
PS_FOUNTAIN
};
typedef struct {
double x, y, z;
double radius;
} PSsphere;
typedef struct {
... |
a677cdfe5d88f8ef362a5adb1de65d4364a269c8 | 375df5b7e396bbcc1d1f7d989ed4c7dce28d2111 | ltwell/QtBinPatcher | /QtBinPatcher.cpp | C++ | cpp | 19,391 | permissive | /*******************************************************************************
Yuri V. Krugloff. 2013-2014. http://www.tver-soft.org
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or
distribute this software,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.