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 |
|---|---|---|---|---|---|---|---|---|
ed8a3f8cab03a0c0be43a11c26b1cc2247619cb7 | 6a886fbc23fc46c252e3d171c2efac4f0c8972da | Shihabulminhaz/My_Competitive_Programming_Code | /Codeforces/A/1354A.cpp | C++ | cpp | 598 | no_license | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define max 10000007
int arr[5];
int main()
{
ll t,n,a,b,c,d,x,y,sum=0,check=0;
cin >> t;
while(t--){
cin >> a >> b>> c>>d;
if(b>=a) cout << b << endl;
else{
if(c<=d) cout << -1 << endl;
else{
... |
877e8c5e55f66329170c4b197f800a8e2fbca854 | 97fc27d56f64b396ef98744ec85cefdb08ccce11 | aokellermann/polybar | /src/utils/file.cpp | C++ | cpp | 6,955 | permissive | #include "utils/file.hpp"
#include <fcntl.h>
#include <glob.h>
#include <sys/stat.h>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <streambuf>
#include "errors.hpp"
#include "utils/env.hpp"
#include "utils/string.hpp"
POLYBAR_NS
// implementation of file_ptr {{{
file_ptr::file_ptr(const string&... |
44164d3344b7d5b2f775689bc56ed7ac5cb897f9 | 57c35facececea6fa02221ff4410e22f23563ae0 | N0689085/SoftEng | /lab18/src/track.cpp | C++ | cpp | 6,220 | no_license | #include <sstream>
#include <fstream>
#include <iostream>
#include <cassert>
#include <cmath>
#include "geometry.h"
#include "xmlparser.h"
#include "track.h"
using namespace GPS;
// Note: The implementation should exploit the relationship:
// totalTime() == restingTime() + travellingTime()
seconds Track::totalTim... |
8c8ac084da619be4d66d32b23efe40f0471a8667 | 02964cbb12b6b85658ba35c44adfc261eaa11410 | Vaa3D/vaa3d_tools | /hackathon/hanchuan/sscope/FlyCapture2/src/FlyCap2/ImageDrawingArea.cpp | C++ | cpp | 21,529 | permissive | //=============================================================================
// Copyright © 2008 Point Grey Research, Inc. All Rights Reserved.
//
// This software is the confidential and proprietary information of Point
// Grey Research, Inc. ("Confidential Information"). You shall not
// disclose such Confid... |
cf7e03db2d435b63ff5ae73beec89846439b747a | 9e25e653f11f8f1c2d29a85f5616b9a36665a602 | 0xlitf/Editor | /Editor/editorviewbase.cpp | C++ | cpp | 3,686 | no_license | #include "editorviewbase.h"
#include "EditorView.h"
#include <QtWidgets/QApplication>
#include <QDebug>
#include <QFile>
#include "EditorPage.h"
#include "EditorScene.h"
#include "ItemBase.h"
#include "EditorScene.h"
#include <QFileInfo>
#include <QtWidgets/QApplication>
#include <QFileInfo>
EditorViewBase::EditorView... |
d0ae2796e0a78ad0e8b8ef63982968f04d3d2c8c | 615f3f0d3fd30d08d1eee519aec253edf9c1996d | Wujfeng/Programado-Principoj-kaj-Praktikado | /ch4/exercises/exercise8.cpp | C++ | cpp | 1,161 | no_license | /*
A king rewards the inventor of chess.
*/
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main()
{
int square = 1; // There can't be a zero square.
double rice_grain = 1; // The inventor asks for at least one grain.
cout << "square " << '\t' << "rice grains" << ... |
8cf0470a23403e4299e6b8951f4ffdc89498a5a9 | e822e20a782c460f832ea183f7e69ae58e22f70c | qff233/asteria | /rocket/unique_ptr.hpp | C++ | hpp | 7,965 | permissive | // This file is part of Asteria.
// Copyleft 2018 - 2022, LH_Mouse. All wrongs reserved.
#ifndef ROCKET_UNIQUE_PTR_
#define ROCKET_UNIQUE_PTR_
#include "fwd.hpp"
#include "assert.hpp"
#include "throw.hpp"
#include "xallocator.hpp"
namespace rocket {
template<typename elementT, typename deleterT = default_delete<cons... |
ad2a375ba44970624ffabe424d083538f5577ed8 | ae8a12c26a3bd23e2eb3baaa5e0800492db100ca | elysionlab/client | /Filerun_candle_vgrid/Default Include/ACE 5.4/ACE_wrappers/examples/ASX/UPIPE_Event_Server/Options.cpp | C++ | cpp | 5,247 | no_license | // Options.cpp,v 4.12 2003/11/09 04:12:07 dhinton Exp
#include "ace/Get_Opt.h"
#include "ace/Log_Msg.h"
#include "ace/OS_NS_Thread.h"
#include "ace/OS_NS_stdio.h"
#include "Options.h"
ACE_RCSID(UPIPE_Event_Server, Options, "Options.cpp,v 4.12 2003/11/09 04:12:07 dhinton Exp")
#if defined (ACE_HAS_THREADS)
Options:... |
8fa955fb701cf29d114b9d67647b20009cacb719 | d45f9cda0e2fcddc012b760cac3a51e0e286fb04 | tsmith328/Project-Euler | /Problem 3/problem3.cpp | C++ | cpp | 1,658 | no_license | /*
* Project Euler
* Tyler Smith
* tsmith328@gatech.edu
*/
#include<iostream>
#include<list>
#include<cmath>
using std::cout;
using std::endl;
using std::list;
bool isPrime(long int);
void getFactors(long int, list<long int>*);
void onlyPrimes(const list<long int>*, list<long int>*);
int main()
{
list<long ... |
c29f452923d7a4f42ce6b55f68bac2e7c053f3b5 | c38f6a6cf430e6c00d423ccb44a69d3459827036 | kevinJheng/usbdm-eclipse-makefiles-build | /USBDM_DLL/src/OSBDM-JM60/osbdm_base.cpp | C++ | cpp | 16,978 | no_license | /* OSBDM-JM60 Windows USB Library
* Copyright (C) 2009 Freescale
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later ... |
92865d1f98bacbc76aa7e58bd1dc6e302f8a3e72 | c4c51538df8d7a81677650fec4b90dca637abda4 | cheasonxie0/CLBlast | /src/clblast.cpp | C++ | cpp | 148,203 | permissive |
// =================================================================================================
// This file is part of the CLBlast project. The project is licensed under Apache Version 2.0. This
// project loosely follows the Google C++ styleguide and uses a tab-size of two spaces and a max-
// width of 100 char... |
9cb69c9e2a811fcf653427d00c69e8bd3f3bdfdc | 32c5f183a6e44eb0d3ca6d183c16b08b16c37c0e | hugoam/two | /src/stl/unordered_set.hpp | C++ | hpp | 5,948 | permissive | #pragma once
#ifdef USE_STL
#include <unordered_set>
#else
#include <stl/buffer.hpp>
#include <stl/unordered_set.h>
#include <stl/hash_base.hpp>
namespace stl {
template <class Key, class Alloc>
inline unordered_set<Key, Alloc>::unordered_set()
: m_size(0)
{
m_buckets.resize(9, 0);
}
template <class Key, c... |
a5bf49f4e301e2753350d16f595cc055678534fe | 5e3295f4dd6dc226d32b1dd03eb964c0bdd26cd0 | Girl-Code-It/Beginner-CPP-Submissions | /Prachi bansal/Number patterns/pattern-6.cpp | C++ | cpp | 221 | no_license | #include<iostream>
using namespace std;
int main(){
for(int i=1;i<=5;i++){
int k=5;
for(int j=1;j<=5;j++){
if(j>=1 && j<=6-i){
cout<<k;
k--;
}else{
cout<<" ";
}
}
cout<<"\n";
}
return 0;
}
|
61dd6b4c7bb606419472886de45669d476916402 | 465994a30d3e0666d3e2e9e1597543f7e80d193f | HLSources/Tyrian-GroundAssault | /cl_dll/hud.cpp | C++ | cpp | 10,868 | no_license | /***
*
* Copyright (c) 1996-2002, Valve LLC. All rights reserved.
*
* This product contains software technology licensed from Id
* Software, Inc. ("Id Technology"). Id Technology (c) 1996 Id Software, Inc.
* All Rights Reserved.
*
* Use, distribution, and modification of this source code and/or resulting
* obje... |
a2ca831ffcf6f0003f8d759ca888303764962573 | eb42e48d97172e52e40f0c3a80bb4454c949157c | yfviar/Base-Data-Structure-C- | /未整理版/001--SqList.cpp | C++ | cpp | 2,808 | no_license | #include "stdio.h"
#include "malloc.h"
#define MaxSize 50
/*
写注释来复习~~
*/
typedef char ElemType; //元素类型
//“顺序表”类型
typedef struct {
ElemType data[MaxSize]; //存储元素的数组
int length; //表长
}SqList;
//初始化 空的“顺序表”
void InitList(SqList *&L){
L=(SqList *)malloc(sizeof(SqList)); //分配空间
L->length=0; //初... |
f0bf9bfba7f31c67f7e4ccb051f3ca8592e14602 | aeeb23ac156e26b0b5498790aceb86a2c3d0b4aa | pandagxnu/Smoothieware | /build/mbed_custom.cpp | C++ | cpp | 9,764 | no_license | /* Copyright 2013 Adam Green (http://mbed.org/users/AdamGreen/)
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... |
018af02c2e7fc287d474e41fde32a68f6f9ecc68 | a57245aac1eee210878c920f7e273549d0a75063 | IsraMekki/tiramisu_code_generator | /cmake-build-debug/programs_tiling/function13721/function13721_schedule_25/function13721_schedule_25_wrapper.cpp | C++ | cpp | 1,558 | no_license | #include "Halide.h"
#include "function13721_schedule_25_wrapper.h"
#include "tiramisu/utils.h"
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <fstream>
#include <chrono>
#define MAX_RAND 200
int main(int, char **){
Halide::Buffer<int32_t> buf00(128, 512);
Halide::Buffer<int32_t> buf01... |
027f8381e1702da754666a648d727527ae7f6d60 | 168d6f47a7fedd7df0fc41f352e5de7f17f9ffa6 | 1059444127/Project3D_now | /Application.hpp | C++ | hpp | 3,581 | no_license | #ifndef APPLICATION_HPP
#define APPLICATION_HPP
#include <QApplication>
#include <QList>
#include <QMap>
#include <opencv2/core/core.hpp>
#include "mainwindow.hpp"
#include "CalibrationData.hpp"
#include "scan3d.hpp"
class Application : public QApplication
{
Q_OBJECT
public:
Application(int & argc, char ** ... |
97e3c1c8ee17ae28b86f4c4908b3ee0b62b4a25a | 98428147b688b65cad25bc9b999341048960ede1 | yosupo06/library-checker-problems | /math/sqrt_mod/checker.cpp | C++ | cpp | 950 | permissive | #include <algorithm>
#include "testlib.h"
using namespace std;
using ll = long long;
template<class T, class U>
T pow_mod(T x, U n, T md) {
T r = 1 % md;
x %= md;
while (n) {
if (n & 1) r = (r * x) % md;
x = (x * x) % md;
n >>= 1;
}
return r;
}
int main(int argc, char *arg... |
bb589fa29b221f24779cc433d52adffc096f16ce | 7e8b0dd097d4046fffc45309266f35883cbcbc17 | banboooo044/AtCoder | /ABC033/D.cpp | C++ | cpp | 2,351 | no_license | #include <bits/stdc++.h>
#define REP(i,n) for (long i=0;i<(n);i++)
#define FOR(i,a,b) for (long i=(a);i<(b);i++)
#define RREP(i,n) for(long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl;
#define du... |
72874f6d1b0faf61b5d14e6db211e216909a35d8 | d65e9d737cef97903c601e2db0ae3e85c38de416 | atrivedi8988/DSA-Must-Do-Questions | /08_Bubble sort/Ideal Solutions/bubbleSort.cpp | C++ | cpp | 523 | no_license | #include <bits/stdc++.h>
using namespace std;
void bubbleSort(int arr[], int n)
{
// A function to implement bubble sort
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1])
swap(arr[j], arr[j + 1]);
}
}
// Printin... |
943709af57d2246e3025010f881379d8d3d24614 | 5e74346ed66b624e202530f473544a580fd01c32 | KEK-Co/Parallel_programming_2020_CI | /modules/task_3/mishina_n_dvumer_po_characteru/main.cpp | C++ | cpp | 2,841 | permissive | // Copyright 2020 Mishina Nadezhda
#define _USE_MATH_DEFINES
#include <gtest-mpi-listener.hpp>
#include <gtest/gtest.h>
#include <iostream>
#include "./dvumer_po_characteru.h"
TEST(Global_Optimization_MPI, Test_1) {
int rank;
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
double(*ptr)(double, double) = f1;
xy... |
d7cb100a983bb5de5b7e214f0cf3cdf7b3b52e62 | 9e3fc2b0bd7d1c2aa70d1be0562f2ed9ba556847 | tayloia/egg | /ovum/test/arithmetic.cpp | C++ | cpp | 12,119 | permissive | #include "ovum/test.h"
#include "ovum/dictionary.h"
namespace {
inline constexpr double zero = 0.0;
inline constexpr double half = 0.5;
inline constexpr double nine = 9.0;
inline constexpr double snan = std::numeric_limits<double>::quiet_NaN();
inline constexpr double qnan = std::numeric_limits<double>::sign... |
f06b6c079c365e4d2004ae3a01a362fd789336a2 | d8ac846fc1a111d642e6bf63f6ea0336a36bd272 | vei123/PATTestAdvanced | /C++/1024回文数.cpp | C++ | cpp | 1,233 | no_license | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
void delprezeros(string& s)
{
while (!s.empty() && s[0] == '0')
s.erase(0, 1);
}
bool isPalin(string s)
{
for (auto i = s.begin(), j = s.end() - 1; i < j; i++, j--)
if (*i != *j) return 0;
return 1;
}
string stradd(string a, string b... |
38e614c72310ea9ad83c62fe219fa9db5122ba4b | 309ded7c1616e1cbc7a8d63307ccadf651a0f7e1 | HarelSavitzky/DOOM-2D_OOP2_Project | /src/Main.cpp | C++ | cpp | 423 | no_license | #include <iostream>
#include <cstdlib>
#include <stdlib.h>
#include "Controller.h"
int main() try
{
Controller Game;
Game.manageGame();
return EXIT_SUCCESS;
}
catch (std::exception& e) //handle exception
{
std::cerr << e.what() << std::endl; //(print the error to win32 window)
return EXIT_FAILURE;
}
//---------... |
cf7e5a013419cb368050558f8f5247afdea87abf | ee1cc14d69dc986d470acf7f9c1c8f2989c5f772 | echohenry2006/bct-cpp2 | /findpaths.cpp | C++ | cpp | 9,222 | permissive | #include <cmath>
#include "bct.h"
/*
* Finds paths from a set of source nodes up to a given length. Note that there
* is no savepths argument; if all paths are desired, pass a valid pointer as
* the allpths argument. There is also no tpath argument as its value may
* overflow a C++ long. Since 0 is a valid nod... |
bc3b4231b873f7c2c35239d1c9ad9062f79e1517 | b93c6e720fcfcaba19a9399eb3579098347bf6eb | maddurivenkateswarlu/codingexamples | /eqilibrium.cpp | C++ | cpp | 698 | no_license | #include <iostream>
using namespace std;
int find_equilibrium(int arr[],int n);
int main() {
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int result=find_equilibrium(arr,n);
if(result==-1)
{
cout<<"there is no equilibrium index";
}
else
{
cout<<"equil... |
c9d1e171eb9f55bb376617e2f8a4e687c64a1260 | 56028b7c36b0a84b370bdfb338c2507db2762376 | ollyblue/foo | /vim-script/list.cpp | C++ | cpp | 39,991 | no_license | The heart of all programming is the creation and manipulation of data structures. So far in this series, we¡¯ve considered only Vimscript¡¯s scalar data types (strings, numbers, and booleans) and the scalar variables that store them. But the true power of programming Vim becomes apparent when its scripts can operate on... |
cabcaccd2afe9617e5d4828cdc4abb0d59848e5b | 8d807f9eba4f9d43ca0ab24e315eb0de4795a5d3 | hakumai-iida/BezierSample | /Prj_Android/app/src/main/jni/shared/draw/bezier/data/AnchorPointData.cpp | C++ | cpp | 37,351 | no_license | /*+----------------------------------------------------------------+
| Title: AnchorPointData.cpp [共通環境]
| Comment: アンカーポイントデータ（※[CLineObjectData]の構成要素）
| Author: K.Takayanagi
+----------------------------------------------------------------+*/
/*+--------------------------------------------------------------... |
5c1b45b9a6a382382bda3d58d52934c9e2a74e25 | a0be881995ff1839f78651b777a058dfa9b0d92b | Zerocoin/libzerocoin | /Accumulator.cpp | C++ | cpp | 2,902 | permissive | /**
* @file Accumulator.cpp
*
* @brief Accumulator and AccumulatorWitness classes for the Zerocoin library.
*
* @author Ian Miers, Christina Garman and Matthew Green
* @date June 2013
*
* @copyright Copyright 2013 Ian Miers, Christina Garman and Matthew Green
* @license This project is... |
6347c52cf803dc602193558196c5c20acc7952dc | 8d57cf4d9f8fa627c9290bbe29bc167c43165151 | lukaselmer/CPlusPlusLecture | /CppAdvanced/cpla_ws11/PackagedTask_Example/packaged_task_example.cpp | C++ | cpp | 708 | no_license | #include <future>
#include <iostream>
#include <thread>
#include <string>
static thread_local bool done{};
std::string to_string(bool b){
return b?"":"not ";
}
std::string compute_the_answer(int i){
using namespace std::literals;
std::this_thread::sleep_for(1s);
done=true;
return "I am "s + to_string(done)+"don... |
a8cb085251e7eef2fc79f23569370b69791494e4 | ba90b22db434c2cf1a8c4dcd2803ff74e6198b8b | SIN0DA/Ticktacktoe | /Ticktacktoe.cpp | C++ | cpp | 2,900 | no_license | #include "stdafx.h" // DO NOT PLACE ANY INCLUDES ABOVE HERE
#include <iostream>
#include <cstdlib>
#include <iomanip>
#include <string>
#include <cmath>
#include <vector>
using namespace std;
char square[10] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' };
int checkwin();
void Board();
int main(... |
382552216f952ffba10bd4942b006a7f94d25b38 | 621a33c3c45aff2ef3280e8b63b87d8b32f9e429 | DariaP/careercup | /solutions/21117662-alphabet.cpp | C++ | cpp | 3,734 | no_license | /*
Imagine an alphabet of words. Example:
a ==> 1
b ==> 2
c ==> 3
.
z ==> 26
ab ==> 27
ac ==> 28
.
az ==> 51
bc ==> 52
and so on.
Such that the sequence of characters need to be in ascending order only (ab is valid but ba is not). Given any word print its index if valid and 0 if not.
Input Output
ab 27
ba 0
aez 441
... |
c176be816fc5d289fb9faf87ddd451afc8834298 | 66ceb03729aeee3b2acebcfe9acb56402634d84c | brinkqiang/dmctpp | /src/CTPP2DTOA.cpp | C++ | cpp | 39,039 | permissive | /*-
* Copyright (c) 2004 - 2011 CTPP Team
*
* 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 and the followi... |
1adae13476631a7c504cab6240203faffc0cfebd | e7ead62d65e7f1c68928940fcc4c7291add37fb1 | prozessorkern/qlcplus | /webaccess/src/webaccess.cpp | C++ | cpp | 53,395 | permissive | /*
Q Light Controller Plus
webaccess.cpp
Copyright (c) Massimo Callegari
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.txt
Unless ... |
531ac0e0877299ea2500797c2f278d87b9dccb20 | a10f4b32c907f69acdd4654fb10369728b033a9e | zhaosj1991/DataStructure | /stack/test/test.cpp | C++ | cpp | 322 | no_license | #include "../stack.h"
#include <stdio.h>
int main(int argc, char const *argv[])
{
AStack<int> test_stack;
test_stack.push(1);
test_stack.push(11);
test_stack.push(111);
int a = 0;
test_stack.pop(a);
printf("%d\n", a);
test_stack.pop(a);
printf("%d\n", a);
test_stack.pop(a);
printf("%d\n", a);
return 0;... |
95de26de80b73b146ae2328146556f691a2113dc | b4fc178f0d798a6e2c76f878d7e001d35c3468f3 | YMDragon/OJ-code | /codeforces/444/E.cpp | C++ | cpp | 838 | no_license | #include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#define LL long long
#define oo (1<<30)
using namespace std;
struct edge{int s,t,d;}e[3010];
int n,sum,p[3010],s[3010],x[3010];
bool cmp(edge x,edge y){return x.d<y.d;}
int find(int x){ret... |
7b839ebfbfa59b1cd602ac292a6cec0bbea49be2 | 41517c60e6b8f6709ecb01b28863d9b3672e27a7 | yuan0105/libfon9 | /fon9/rc/RcSeedVisitor.hpp | C++ | hpp | 6,654 | permissive | // \file fon9/rc/RcSeedVisitor.hpp
// \author fonwinz@gmail.com
#ifndef __fon9_rc_RcSeedVisitor_hpp__
#define __fon9_rc_RcSeedVisitor_hpp__
#include "fon9/rc/RcSeedVisitor.h"
#include "fon9/seed/SeedSubr.hpp"
#include "fon9/Utility.hpp"
#include "fon9/NamedIx.hpp"
#include "fon9/CharVector.hpp"
#include "fon9/buffer/D... |
e657f71da900aeb1752d56c4dcfea2b007c82684 | fedcd4d325265d86a3a62946eecf50810717982e | elisvathi/gl-engine | /src/core/G_Shader.hpp | C++ | hpp | 1,412 | no_license | #pragma once
#include <GL/glew.h>
#include "G_Shader_Utils.hpp"
#include "G_Utils.hpp"
#include <glm/glm.hpp>
#include <string>
using namespace std;
using namespace glm;
class G_Shader {
public:
GLuint programID;
G_Shader(const char *vertex_path, const char *fragment_path)
{
programID = buildProgram(vertex_p... |
a38ddf4c8caad0ad76853ae5e3a54399283f3ec7 | c30603fba2f5fdc32604fe343285cf8b02ecf12d | redaaa99/Gestion-Association-Ensa | /ajoutmembre.cpp | C++ | cpp | 1,983 | no_license | #include "ajoutmembre.h"
#include "ui_ajoutmembre.h"
#include "mainwindow.h"
#include <QMessageBox>
ajoutmembre::ajoutmembre(QWidget *parent) :
QDialog(parent),
ui(new Ui::ajoutmembre)
{
ui->setupUi(this);
ui->textEdit_4->setPlaceholderText("AAAA-MM-JJ");
}
ajoutmembre::~ajoutmembre()
{
delete ui;... |
caa644813c35da1f7175d99b08cce21579c6d066 | 4f656ff03aee1102b9af34770c5b2ecb109df6f0 | rocdat/OPS | /apps/c/CloverLeaf_3D_HDF5/OpenACC/advec_mom_kernel2_z_openacc_kernel.cpp | C++ | cpp | 7,839 | no_license | //
// auto-generated by ops.py
//
#include "./OpenACC/clover_leaf_common.h"
#define OPS_GPU
extern int xdim0_advec_mom_kernel2_z;
int xdim0_advec_mom_kernel2_z_h = -1;
extern int ydim0_advec_mom_kernel2_z;
int ydim0_advec_mom_kernel2_z_h = -1;
extern int xdim1_advec_mom_kernel2_z;
int xdim1_advec_mom_kernel2_z_h = -1... |
110ffea64a40c6d14f0241d732a21ecd2c66f921 | 80f48d876f028081482af47e40c746308ff16ff8 | luunamten/SAVE | /HNTower/HNTower/Disk.cpp | C++ | cpp | 5,002 | no_license | #include "Disk.h"
#include <GL/glew.h>
#include <vector>
#include <cmath>
#include <glm\gtc\matrix_transform.hpp>
#include "Tool.h"
#include "CommonMatrix.h"
#include "GLContext.h"
int Disk::program = -1;
const float Disk::STEP = 0.005f;
Disk::Disk(std::string &src, float x, float y, float z)
{
this->vao = 0;
this... |
c705647300a3af2747b2ee73999e4fff02e70e17 | 62e0760243f432859c3a721ff092bdaf25a3c392 | Sitispeaks/turicreate | /src/external/boost/boost_1_68_0/libs/random/test/test_discrete_distribution.cpp | C++ | cpp | 6,547 | permissive | /* test_discrete_distribution.cpp
*
* Copyright Steven Watanabe 2010
* 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)
*
* $Id$
*
*/
#include <boost/random/discrete_distribution.hpp>
#include <boost/random/l... |
de94336906bab4b34a83337f5393ed4078f24b4f | d94a5713da468e749f13fbf0b9dabaa3ec9ccda9 | ivonnyssen/power_controller_every2 | /lib/sensors/Sensors.cpp | C++ | cpp | 1,861 | no_license | #include "Sensors.h"
#if defined(ARDUINO)
#else
#include <MockSD.h>
#endif
#define TINY_BME280_I2C
#include <TinyBME280.h>
SensorData sensorData[NUM_SENSOR_RECORDS]{0};
tiny::BME280 bme;
time_t sensorsLastLogTime;
void sensorsMeasureAndLog() {
for(int i = 0; i < NUM_SENSOR_RECORDS - 1; i++){
sensorData[i]... |
0dc49bbf74393a3e3e5ef7e1dce98a2e0c8d3f1f | 9242c4f9e888885302dde2148894070e51954beb | renwinping/QtReports | /qtreports/src/tags/line.hpp | C++ | hpp | 504 | permissive | #pragma once
#ifndef LINE_HPP
#define LINE_HPP
#include <QSharedPointer>
#include "widget.hpp"
namespace qtreports
{
namespace detail
{
/*! @~russian
@brief Класс, реализующий тэг <line>
Класс, реализующий тэг <line>
*/
class Line : public Widget {
public:
... |
ae6a75b84c10ec89d3ce15541556a1abbf901dc4 | 15aa88ea9ef2d1ac0d4fa03f7851f05069f425b8 | tizbac/mesa | /src/glsl/ast_to_hir.cpp | C++ | cpp | 137,714 | no_license | /*
* Copyright © 2010 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, pub... |
79d4a8f5504561c32a4de8394a5c291bf5f364c1 | d13b46ac19eba03c918907fe9972a2d6fd91d4a7 | arangodb/arangodb | /3rdParty/boost/1.78.0/libs/spirit/example/lex/lexer_debug_support.cpp | C++ | cpp | 3,447 | permissive | // Copyright (c) 2001-2011 Hartmut Kaiser
//
// 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)
// #define BOOST_SPIRIT_LEXERTL_DEBUG 1
#include <boost/spirit/include/lex_lexertl.hpp>
#include <boost/spirit/incl... |
499d22f0f61a44fd761b1762669c55cbdc03a261 | 052d366e021ac6469e3f32d4b4ff9357623057b9 | neveroldmilk/triton-inference-server | /src/backends/tensorflow/graphdef_backend.cc | C++ | cc | 6,505 | permissive | // Copyright (c) 2018-2020, NVIDIA 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:
// * Redistributions of source code must retain the above copyright
// notice, this list of ... |
8a2e20960d96173a685941d0ec322c0156867e17 | 60bdec080a8c53eaf80a7d60d26d2b4f27ce35ec | yjl9903/XLor-LibreOJ | /6584.cpp | C++ | cpp | 2,303 | no_license | #include <cstdio>
#include <cassert>
#include <functional>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
const int maxn = 500000 + 5;
int n, k, fa[maxn], ans[maxn], dep[maxn];
vector<int> edge[maxn];
int pre[maxn];
int find(int x) {
return x == pre[x] ? x : pre[x] = fi... |
965d6b961b663d7e26bbe78653f79146a38110fd | 4df26496400271df08a63d462f393a7915ef9f05 | ldc0111/Interview_related | /通用的编码题/线程池/logger.cpp | C++ | cpp | 1,060 | no_license | /*************************************************************************
> File Name: logger.cpp
> Author:
> Mail:
> Created Time: 2020年03月22日 星期日 20时26分51秒
************************************************************************/
#include<iostream>
#include "./2.2.mythreadpool.h"
#include "./logger.h"
#inclu... |
15b0a3de7ecde6677f599d04af1e34756088c7b6 | cc0bdc3c46af928e20dee2aaca83e9378c15acc8 | bstaletic/NanoRange | /test/algorithm/sort_heap.cpp | C++ | cpp | 4,970 | permissive | // Range v3 library
//
// Copyright Eric Niebler 2014
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
//
// C... |
6cadd7ff9c6b64e0a7c1bfcab2bac87d9c8c3c34 | 6d023cd21f4b1bae9ff4e72f08bc5a5eb2078ec1 | zahid26/programs | /queue.cpp | C++ | cpp | 881 | no_license | #include<stdio.h>
#include<conio.h>
#include<stdlib.h>
int Queue[5],front=-1, rare=-1;
void Enqueue()
{
if(front==-1)
{front++;rare++;
}
if(rare>4)
{
printf("Queue is full"); return;
}
else
{
printf("Enter data ");
scanf("%d",&Queue[rare]);
rare++;}
}
void Dequeue()
{
if(front==-1)
pri... |
221453c04f09949a8edf9b80c0ca4d0dafb14ad9 | 68dae6f3d5f56ce0041ac7679e70c6b97f77d48c | Silviameteoro/gcam-core | /cvs/objects/demographics/source/female.cpp | C++ | cpp | 4,673 | permissive | /*
* LEGAL NOTICE
* This computer software was prepared by Battelle Memorial Institute,
* hereinafter the Contractor, under Contract No. DE-AC05-76RL0 1830
* with the Department of Energy (DOE). NEITHER THE GOVERNMENT NOR THE
* CONTRACTOR MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY
* LIABILITY FOR THE USE OF... |
a866ed5359960cdf67fd9e287a1a3cfd4a12522e | a38bc8d563b2999bf6299fb6206a6565372b26d3 | azrul2202/WebKit-Smartphone | /webkit/WebKitTools/DumpRenderTree/unix/TestNetscapePlugin/TestNetscapePlugin.cpp | C++ | cpp | 14,519 | no_license | /*
* Copyright (C) 2006, 2007 Apple Inc. All rights reserved.
* Copyright (C) 2008 Zan Dobersek <zandobersek@gmail.com>
* Copyright (C) 2009 Holger Hans Peter Freyther
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
... |
68017baf97b0636fb7aeb30dc710054326cfb17a | a696a9781f137530fe4c60498abad17faf4bf949 | NicholasBlackburn1/xbox360Guitool | /source/mount.cpp | C++ | cpp | 11,657 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <debug.h>
#include <libfat/fat.h>
#include <libext2/ext2.h>
#include <libntfs/ntfs.h>
#include <libxtaf/xtaf.h>
#include <iso9660/iso9660.h>
#include <sys/iosupport.h>
#include <diskio/disc_io.h>
#include <byteswap.h>
#include "mount.h"
//#include "../... |
3f42cf100ecf34d081566fdba6589156b7da830f | fa97abff3a754015bd73371728abad56bb9ee912 | TimoHackel/ILA-SCNN | /tensorflow/core/user_ops/direct_sparse_to_dense.cc | C++ | cc | 4,386 | permissive | #include <omp.h>
#include <map>
#include <sstream>
#include "tensorflow/core/framework/op.h"
#include "tensorflow/core/framework/shape_inference.h"
#include "tensorflow/core/framework/common_shape_fns.h"
#if GOOGLE_CUDA
#include "direct_sparse_to_dense_gpu.h"
#endif //GOOGLE_CUDA
/** DirectSparseConvKD
* \ingroup ... |
0063aa0a8faee54450340658717a5492b910cb29 | 89c8a50fcb6865bc6232c58d41aa3cc52d4c6371 | saga-project/saga-cpp-legacy-adaptors | /sql/trunk/sql_fast_advert/jenkins_hash_new.hpp | C++ | hpp | 14,392 | permissive | // Copyright (c) 2005-2007 Hartmut Kaiser
//
// 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)
#if !defined(JENKINS_HASH_HPP_SEP_08_2007_0102PM)
#define JENKINS_HASH_HPP_SEP_08_2007_0102PM
#include <cstdlib>
#... |
71325936d8224932d9e49868cae10827a3596a48 | b65c5caaef7a23af3be57a40d265804a6221f444 | GabrielHogan/C-PlusPlus-Programs-2019-2020 | /2019-09-03 -- Skyhooks Shipping Sorting/Skyhooks Shipping Sorting/Skyhooks Shipping Sorting.cpp | C++ | cpp | 1,232 | no_license | // Skyhooks Shipping Sorting.cpp : Defines the entry point for the console application.
// Gabriel Hogan 8/27/2019
//All Header Files Used This Year!!!
#include "stdafx.h" // Always here, leave alone!!!
#include "iomanip" // Changing the look or formatting output!
#include "iostream" // Always add for in or out stream... |
71244196ce6430e3850f4eef8d64c18ea5c169a7 | c531ab66fe5ea9807767f3c94e2ef0deb19ef8de | HoncharAnton/lessons_cpp | /Code_Blocks_repos/test_task_12/main.cpp | C++ | cpp | 4,800 | no_license | #include <iostream>
void ten_stars()
{
int a = 10;
std::cout << "ten stars \n";
for (int b = 0; b < a; b++)
std::cout << "* ";
std::cout << std::endl<< std::endl;
}
void hundred_stars()
{
int a = 10;
std::cout << "one hundred \n";
for (int b = 0; b < a; b++)
{
... |
591e308e5f6ef6c0fdc7d7f9f21d32c95addb355 | 8d677604544a9563354af03ffe68dac404128819 | RemedyIT/ciaox11 | /connectors/dds4ccm/tests/port_status_listener/deadline_missed/receiver/psl_deadline_receiver_exec.cpp | C++ | cpp | 18,598 | permissive | // -*- C++ -*-
/**
* @file psl_deadline_receiver_exec.cpp
* @author Marcel Smit
*
* @brief Receiver component implementation of the deadline missed callback on
* the Port Status Listener.
*
* @copyright Copyright (c) Remedy IT Expertise BV
*/
//@@{__RIDL_REGEN_MARKER__} - HEADER_END : psl_deadlin... |
cc4db61d840b845ac15fb9b972a29b2293302d8e | 6c1b5efd1a2989805189eb1a5c3d4faaa43f9bbf | alfredgg/PCC | /src/PCC.hpp | C++ | hpp | 10,644 | no_license | /*
* PCCDataStructures.hpp
*
* Created on: Oct 20, 2015
* Author: alfred
*/
#ifndef SRC_PCC_HPP_
#define SRC_PCC_HPP_
#include "ofxNetwork.h"
#include "ofMain.h"
#include "ofxBox2d.h"
class ColorReceivedMessage {
public:
ofColor color;
string id;
ofColor discretizedColor;
float position;
ColorReceiv... |
768d657f4c3d0c510a454bce44a44f65b47c841a | 049b30c0b8a398e03b5f49fe6248433cc2cb4ad9 | skrzj-dev/libxccc | /test/test_vector/intf_xcvector_s/_xcvector_ds_api_u.hpp | C++ | hpp | 5,660 | permissive | /*
* Copyright block:
*
* Source file of libxccc project
*
* Copyright (c) 2019 Jakub Skrzyniarz, skrzj-dev@protonmail.com
*
* Licensed under: MIT license; See the file "LICENSE" of libxccc project for more information.
*
* Copyright block: end
*/
#ifndef _XCC_TEST_TPL_VECTOR_API_CCCVECTORDS_U_HPP_
#define _... |
67c01e1edf4cf3aa30b7d0817369dca9f39d1c0c | ca4e0e757adb20705c5bf16056fe14195af50cc7 | jovialio/stdtracer | /include/bits/stdtracer_base.hpp | C++ | hpp | 1,763 | permissive | #pragma once
#include <chrono>
#include <tuple>
#include <utility>
constexpr const char *header_fmt = "%5s %8s %16s %12s %12s %s\n";
constexpr const char *row_fmt = "%5d %8d %16f %12.2f %12.4f %s\n";
template <typename T, typename clock_t>
std::chrono::duration<T> since(const std::chrono::ti... |
56832520ee831b37cf6e16abf2f08b1ae691913b | 1b9e6d3fe17e898a1fd9495cca1c78280bf1d668 | tiqq111/AndroidDetection | /app/src/main/cpp/jni.cpp | C++ | cpp | 4,130 | permissive | #include <android/bitmap.h>
#include <android/log.h>
#include <jni.h>
#include <string>
#include <vector>
#include "Face.hpp"
#define TAG "FaceSDKNative"
#define LOGD(...) __android_log_print(ANDROID_LOG_DEBUG, TAG, __VA_ARGS__)
using namespace std;
static Face *ultra;
bool detection_sdk_init_ok = false;
extern "C"... |
1c519099511b65562baee48ac80bb053850f465f | 649b11d0e62560c67d994b80a0dcbeb0d0e61d93 | Tinaynox/daScript | /src/builtin/module_builtin_rtti.cpp | C++ | cpp | 55,268 | permissive | #include "daScript/misc/platform.h"
#include "module_builtin_rtti.h"
#include "daScript/simulate/simulate_nodes.h"
#include "daScript/ast/ast_interop.h"
#include "daScript/simulate/sim_policy.h"
#include "daScript/simulate/fs_file_info.h"
#include "daScript/simulate/simulate_visit_op.h"
#include "daScript/misc/perfo... |
0c960063359945f82fca54b73bea7f5454b6182b | 92a7abaec47ae5aa563ed06b3bbf778e73606c33 | geekhch/homework | /CPP/程序/第8章程序/s8_6/smain8_6_2.cpp | C++ | cpp | 1,794 | no_license | //主文件
//文件名：ch4_5\smain4_5.cpp
#include "sclass4_5_student.h" //包含类声明头文件
//主测试程序
void main()
{
CPerson oCP(7, 'm', "比尔.盖茨"); //创建一个CPerson类的对象
CStudent oCS(8, 'f', "希拉里.克林顿", "Grade Two"); //创建一个CStudent类的对象
CClerk oCC(9, 'm', "谢尔盖.布林", 5000.1); //创建一个CClerk类的对象
COnJobStudent oCO(10, 'm', ... |
4ae3f861c35f6b9c1a5fd789281e150a22f8ed18 | 29f44320691519fddda2a9adb62a3bdfc0c46b1f | Amankumar-code/GeeksForGeeksSolution | /Track/17.Graph/11. X Total Shapes.cpp | C++ | cpp | 1,208 | no_license | class Solution
{
public:
bool isvalid(int x,int y,int n,int m)
{
return(x<n&&x>=0&&y<m&&y>=0);
}
void trav(int y, int x, vector<vector<char>> &gr, vector<vector<int>> &vis, int dx[], int dy[], int n, int m)
{
vis[y][x]=1;
for(int i=0;i<4;i++)
{
in... |
39f8ffd9fec59638437512f8267b91e917a99620 | f92e64e22e96482d42a64ee6c2a6a43268615d7d | bigdoods/OpenInfraPlatform | /IfcBridge/src/OpenInfraPlatform/IfcBridge/entity/IfcTransportElementType.cpp | C++ | cpp | 5,002 | no_license | /*! \verbatim
* \copyright Copyright (c) 2014 Julian Amann. All rights reserved.
* \date 2014-02-15 23:00
* \author Julian Amann <julian.amann@tum.de> (https://www.cms.bgu.tum.de/en/team/amann)
* \brief This file is part of the BlueFramework.
* \endverbatim
*/
#include <sstream>
#include <limits>
#include "mo... |
dab9b7d18921ff3724f46de6da2f93c00281b619 | 7a29e420f795880d094a0087809d53b87d4a85e4 | cjnjuwhy/AdvancedProgramming | /Homework6/main.cpp | C++ | cpp | 367 | no_license | #include"ReverseWords.h"
#include"Palindrome.h"
using namespace std;
int main() {
ReverseWords* rw = new ReverseWords();
cout << rw->getSentence("test.dat") <<endl;
cout << rw->reverseString();
cout << "------------------------\n";
Palindrome* p = new Palindrome();
cout << p->GetOddNumber("2.txt") << "\t";
co... |
e14d719887c129c79f64de69407b36bc38c7ba0f | c106b61e3aa3bfb91609cc45462f440c30bf028d | KraemerDEM/fleece | /Fleece/Support/StringTable.cc | C++ | cc | 3,542 | permissive | //
// StringTable.cc
//
// Copyright (c) 2015 Couchbase, Inc All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Un... |
6bbfdfc2df17ef39d117f49dcc713da271eb3e41 | 52e74d6b529c1f6eb52c6b6a82aff6dfc372dd60 | runngezhang/sword_offer | /sword_offer/cpp/12_数值的整数次方.cpp | C++ | cpp | 3,324 | no_license | #include <iostream>
#include <vector>
#include <stdio.h>
#include <sys/time.h>
#include <cmath>
class Solution {
public:
// 暴力循环法
// 无法处理exponent为最小负数的情况
// 没有进行特殊情况判断，如0^0
double Power1(double base, int exponent) {
if (exponent == 0) {
return 1.0;
}
bool sign = fal... |
623971d796c90aed222dec8c49604156adeecb19 | 45f79617d9ca33f581f3cc854e35c0a70cf328ef | unofficial-shibboleth-mirror/cpp-opensaml | /saml/saml1/core/impl/ProtocolsImpl.cpp | C++ | cpp | 40,108 | no_license | /**
* Licensed to the University Corporation for Advanced Internet
* Development, Inc. (UCAID) under one or more contributor license
* agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* UCAID licenses this file to you under the Apache License... |
899faf4c0f3ce3bfc20acbffd5f41f305e54d5ab | 3baa532ed91443fc0ac9a9eee3b1b64d1d9e17c0 | qfs1998/myleetcode | /279.完全平方数.cpp | C++ | cpp | 523 | no_license | /*
* @lc app=leetcode.cn id=279 lang=cpp
*
* [279] 完全平方数
*/
/*动态规划*/
// class Solution {
// public:
// int numSquares(int n) {
// vector<int>f(n+1,n);
// f[0]=0;
// for(int i=1;i<=n;++i)
// {
// for(int j=1;j*j<=i;++j)
// {
// f[i]=min(f[i]... |
2043db82a6ef2a78eefa965f04b026644ff56592 | 1c3f39e10d7edcc9925a2150228189a0f197fda5 | rodrigofegui/JVM | /lib/Tipos/ArqClass.hpp | C++ | hpp | 2,307 | permissive | #ifndef TIPOS_ARQ_CLASS_HPP
#define TIPOS_ARQ_CLASS_HPP
/**
* @file ArqClass.hpp
*/
#include <string>
#include "../Interfaces/InterTabela.hpp"
#include "Campo.hpp"
/**
* @class ArqClass
* Representação de um arquivo .class
*/
class ArqClass {
private:
... |
f486ea8dbf1ebb2885b1ef3fb686309bb791b13d | 24d24dccd14b2d42259c7b6e23bb1312bb6f72b0 | artudi54/MemeCollector | /MemeCollector/cache/CachedImage.hpp | C++ | hpp | 762 | no_license | #pragma once
class CachedImage {
public:
CachedImage() noexcept(std::is_nothrow_constructible_v<QDateTime>) {};
CachedImage(const CachedImage&) = default;
CachedImage(CachedImage&&) noexcept = default;
CachedImage& operator=(const CachedImage&) = default;
CachedImage& operator=(CachedImage&&) noexcept = default;... |
a7ebd3b408929d72db045b7dd1c12eaba7fe5b80 | 7d9927ace657c5451d0ccd8b10f899640bcbc953 | yuta1125tp/mymikan | /src/kernel/window.hpp | C++ | hpp | 4,374 | no_license | /**
* @file window.hpp
* @brief 表示領域を表すWindowクラスを提供する。
*
*/
#pragma once
#include <vector>
#include <optional>
#include "graphics.hpp"
#include "frame_buffer.hpp"
/**
* @brief Windowクラスはグラフィックの表示領域を表す。
* タイトルやメニューがあるウインドウだけではなく、マウスカーソルの表示領域なども対象とする。
*
*/
class Window
{
public:
class WindowWriter : pu... |
68efdc1a95e6c8a3061758cdcfbec3a37a14bab9 | acd1a2604d0584dd29a69d9005b49abdc6617f94 | poborskii/CAADoc_SelectAgent | /CAAVisualization.edu/CAAVisManagerImpl.m/src/CAAEVis2DGraphVisuForObject.cpp | C++ | cpp | 5,057 | no_license | // COPYRIGHT DASSAULT SYSTEMES 2000
// Local Framework
#include "CAAEVis2DGraphVisuForObject.h"
// Visualization FrameWork
#include "CAT3x3Matrix.h"
#include "CATVisManager.h"
// Mathematics FrameWork
#include "CATMathVector2Df.h"
// Local FrameWork
#include "CAAVis2DGraphBoxRep.h" // The Graphic Representation
#... |
b39a57c0be8f7014ecbfd58108dcb2a1f79a6137 | 501c4a65792d1865be1f62042349dd50cb1c3bfe | roodkcab/zookeeper | /zookeeper-client/zookeeper-client-c/tests/TestClient.cc | C++ | cc | 50,992 | permissive | /**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you... |
f6e223313efda42aa04e0b29fb2aaaa3dd59c7f5 | e2cde218db3438df3e50bdf5cf78ec123d92367d | NHZlX/Paddle | /paddle/fluid/operators/average_accumulates_op.cc | C++ | cc | 9,004 | permissive | /* Copyright (c) 2018 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 by applicable law or... |
bba88e465cfa77a78aa02eff239742cd43fa1b2f | 5a744723244bec58fa1d44fb50ad79b8fd2f018d | bezumec82/cNpRPi | /RPiClient/src/main.cpp | C++ | cpp | 942 | no_license | #include <thread>
#include <iostream>
#include <capnp/ez-rpc.h>
#include "schema.capnp.h"
#define SERVER_ADDR "192.168.1.200:8000"
int main( int , char** )
{
::std::cout << "Starting executing client" << ::std::endl;
::std::thread client_thread( [&]()
{
::std::cout << "Client thread star... |
aedf8e1c9d930e08aaf26fc7205c46086085f82d | dbb1909fc749c645edb6e47b2ba42197abb5bd58 | mszacun/HiddenChannel | /cpp/Models.cpp | C++ | cpp | 2,129 | no_license | #include "Models.h"
unsigned int BasicMessagesQueue::GetAviableDataLength() {
unsigned int sum = 0;
for (auto& m : messages) {
sum += m->GetReamingDataToSend();
}
return sum;
}
DataSources BasicMessagesQueue::GetData(unsigned int amount) {
DataSources result;
while (amount > 0) {
... |
0887085c5046504fff625e0677f94fbb539c6967 | 2fad36922e1ab322708c0374c0ad77c0ec0ca461 | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-payment-cryptography-data/source/model/SessionKeyVisa.cpp | C++ | cpp | 1,513 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/payment-cryptography-data/model/SessionKeyVisa.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
name... |
97d15f46dc170d017a4501606905077c23d93289 | 62d3c58f533bc64cd3d52efc3407e6ca34f28721 | peter-haha/QZXing | /examples/QQrDecoder/QCameraControllerWidget.cpp | C++ | cpp | 14,568 | permissive | /****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the demonstration applications of the Qt Toolkit.
**
** $QT_BEGIN_LIC... |
e6de356947968690a84d528339dc7d635a25fdaa | d171b8f069fed86af96efd59f734d8c1a114f35e | bgyss/cppmm | /test/openexr/bind/imf_compression.cpp | C++ | cpp | 278 | no_license | #include <OpenEXR/ImfCompression.h>
#include <cppmm_bind.hpp>
namespace cppmm_bind {
namespace OPENEXR_IMF_INTERNAL_NAMESPACE {
namespace Imf = ::OPENEXR_IMF_INTERNAL_NAMESPACE;
enum Compression {};
} // namespace OPENEXR_IMF_INTERNAL_NAMESPACE
} // namespace cppmm_bind
|
fe555eafe1eacf08895baa8e6b32f17418179f7b | 0ee317b449706956359558736964a3365cfef51f | nice01qc/CLionProjects | /cppprime7/nice.cpp | C++ | cpp | 297 | no_license | //
// Created by nice01qc on 2018/2/9.
//
#include "nice.h"
void Girl::missBoy() {
cout << name << endl;
}
void Girl::seeBoy(Boy &boy1) {
cout << boy1.name << endl;
}
void Boy::missGirl() {
cout << name << endl;
}
void Boy::seeGirl(Girl &girl1) {
cout << girl1.name << endl;
} |
bb1bf9f1fc1ddc0dab468806d3e3b8e72e00c610 | 11eafad87d1ab9b82bf5b4cb617ae85a0d209d10 | orikama/learning-vulkan | /src/VkBackend.hpp | C++ | hpp | 5,058 | no_license | #pragma once
#include "core.hpp"
#define VULKAN_HPP_NO_STRUCT_CONSTRUCTORS
#include <vulkan/vulkan.hpp>
#include "Window.hpp"
#include <iostream> // TODO: Remove
// TODO: Remove this shit from here
static VKAPI_ATTR VkBool32 VKAPI_CALL
_debugMessageCallback(VkDebugUtilsMessageSeverityFlagBitsEXT message_severity,... |
2d589602d7d7a7565a18d289e650926f627a295f | 00d17ca67ea536d131be2686618c674eed93a847 | dhoehna/RipOutDOL | /Source/Core/Common/File.cpp | C++ | cpp | 2,191 | no_license | // Copyright 2008 Dolphin Emulator Project
// Licensed under GPLv2+
// Refer to the license.txt file included.
#include <cstddef>
#include <cstdio>
#include <string>
#ifdef _WIN32
#include <io.h>
#include "CommonFuncs.h"
#include "StringUtil.h"
#else
#include <unistd.h>
#endif
#include "CommonTypes.h"
#include "Fil... |
653b566c2f0007455e2528bb6da16e1623170c44 | 91c1818d2b92b124321fbd78126985aa9133359d | johnbower2012/balance_imaging | /rhic/coral/sourcesample_blast.cc | C++ | cc | 752 | no_license | #include <cstdlib>
#include <cmath>
#include <cstdio>
using namespace std;
#include "coral.h"
int main(){
int nsample;
CCHArray *Asource,*Xsource;
Asource=new CCHArray("parameters/apars_blast.dat");
CSourceCalc_Blast *scalc=new CSourceCalc_Blast();
//printf("Enter nsample (NMC=nsample^2): ");
//scanf("%... |
fba04e29d6b94001555ca4fc9d9ab74bf4a33e3b | d593b5b0596cf187140ac79fbeb60f4e2565eefc | RDTCREW/SoT-SDK_2_0_7_reserv | /SDK/SoT_wsp_lighting_classes.hpp | C++ | hpp | 671 | no_license | #pragma once
// Sea of Thieves (2.0) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "SoT_wsp_lighting_structs.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// B... |
afa612266c2003315005c7f56be3e6412a6bc5c6 | bc0f16d3db75852dd9ee1e547124d1a9ca229410 | pu2oqa/muServerDeps | /_Include/boost/log/keywords/scan_method.hpp | C++ | hpp | 1,182 | no_license | /*
* Copyright Andrey Semashev 2007 - 2015.
* 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)
*/
/*!
* \file keywords/scan_method.hpp
* \author Andrey Semashev
* \date 30.06.2... |
dc0da89a4b63635fcf48efd1ca4b9acc8de251cc | 0640d2f49f43af80e23b6a554c0b54fcf22bd9b7 | archercreat/dta-vs-osc | /sc-virt/src/tools/clang/lib/StaticAnalyzer/Checkers/PaddingChecker.cpp | C++ | cpp | 12,534 | permissive | //=======- PaddingChecker.cpp ------------------------------------*- C++ -*-==//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
c28652b5d0710d1b31d4e9c6753a265638d20ea0 | 5d92c200f0e3ef470e46cb7659d9b3b564344fa4 | andoporto/Programacion2014 | /UNIVERSIDAD/programacion/ejemplos/C/c/20041684727_misprogramas/misprogramas/progra1/HELLOWOR.CPP | C++ | cpp | 230 | no_license | #include<stdio.h>
#include<conio.h>
#include<DOS.H>
void main()
{
int i;
clrscr();
for (i=0;i<=30;i++)
{
delay(500);
printf("***********\n");
printf("Hello world\n");
}
getch();
} |
d919d140b82c39edd6f217af10cbffbbda7f6309 | 3a5020689cd515306a9e5baaea3d9c4a0937f1d0 | jaimeleonh/cmssw | /SimCalorimetry/CaloSimAlgos/src/CaloHitAnalyzer.cc | C++ | cc | 2,074 | permissive | #include "SimCalorimetry/CaloSimAlgos/interface/CaloHitAnalyzer.h"
#include "SimCalorimetry/CaloSimAlgos/interface/CaloValidationStatistics.h"
#include "SimCalorimetry/CaloSimAlgos/interface/CaloVSimParameterMap.h"
#include "SimCalorimetry/CaloSimAlgos/interface/CaloSimParameters.h"
#include "SimCalorimetry/CaloSimAlgo... |
f203d1c4affceec7f8b505149aca219afa61828f | 91b5b4e7c8cac4ab8cba4c6d890de940e26937df | RanJi0128/Chromium-customization | /upp/reference/Framebuffer/Ctrl.cpp | C++ | cpp | 1,156 | no_license | #include "Fb.h"
#ifdef GUI_FB
#define LLOG(x) // DLOG(x)
NAMESPACE_UPP
void Ctrl::GuiPlatformConstruct()
{
}
void Ctrl::GuiPlatformRemove()
{
}
void Ctrl::GuiPlatformGetTopRect(Rect& r) const
{
}
bool Ctrl::GuiPlatformRefreshFrameSpecial(const Rect& r)
{
return false;
}
bool Ctrl::GuiPlatformSetFullRefreshSpec... |
f114149308abf2810717675b060e8ec7406d12c4 | a6c5bb54d0206b7ed3d91cea3548fe04ed4222f8 | PaponAhasan/Competitive-Programming | /Programming -Topics/Data_Structure/Linked_List/Code/DeleteNode.cpp | C++ | cpp | 1,255 | no_license | #include"bits/stdc++.h"
using namespace std;
int n;
struct Node{
int data;
struct Node *next;
}*first=NULL;
void display(struct Node *p){
while(p!=NULL){
cout<<p->data<<" ";
p = p->next;
}
cout<<"\n";
}
void InsertLast(int key){
struct Node *t,*last;
t = new Node;
t->data = key;
... |
a05ea3890bc244e06afdfabf7c79f328ae48249c | 1226a2319a8ad6ed036b3cdc7210b9321373db90 | FX-Master/MCServer | /src/Entities/Entity.cpp | C++ | cpp | 33,085 | permissive |
#include "Globals.h" // NOTE: MSVC stupidness requires this to be the same across all modules
#include "Entity.h"
#include "../World.h"
#include "../Server.h"
#include "../Root.h"
#include "../Matrix4.h"
#include "../ClientHandle.h"
#include "../Chunk.h"
#include "../Simulator/FluidSimulator.h"
#include "../Bindings... |
bc832e45df25f43038e9e6209cbad4f984b356b2 | 43b7bd79537da30f17c72a92131dc199219a5022 | GJDuck/LowFat | /llvm-4.0.0.src/tools/clang/test/CodeGenCXX/mangle-unnamed.cpp | C++ | cpp | 1,955 | permissive | // RUN: %clang_cc1 -std=c++98 -emit-llvm %s -o - -triple=x86_64-apple-darwin10 | FileCheck %s
// RUN: %clang_cc1 -std=c++11 -emit-llvm %s -o - -triple=x86_64-apple-darwin10 | FileCheck %s
struct S {
virtual ~S() { }
};
// PR5706
// Make sure this doesn't crash; the mangling doesn't matter because the name
// doesn'... |
e4a93ca73e498b6dbece523dda57b5f34e6f3f3d | 27bcab7b1067434f5b45bc20b84a75883f5614fc | hfedor/IUM-Projekt | /IUM-Projekt.cpp | C++ | cpp | 5,934 | no_license | // IUM-Projekt.cpp : Ten plik zawiera funkcję „main”. W nim rozpoczyna się i kończy wykonywanie programu.
//
#include <iostream>
#include "DBAccess.h"
#include "Classator.h"
#include <string>
using namespace std;
/*
int main()
{
DBAccess dba("IUM_Projekt.db");
//dba.AddSessionToDB(3, "times... |
409fb0f409a5b83f51b15df505d9c26ea9706827 | d730d3f80f604a0ac8ebcbd42e87c6a19ab65aef | mrks/or-tools | /ortools/sat/synchronization.cc | C++ | cc | 24,742 | permissive | // Copyright 2010-2018 Google LLC
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
a81c9e98d9e6fb1858f49d552188138e59d3d1b0 | e0dc161a6e10ddc1995654263e6699691904372a | CarterLi/libunifex | /examples/p1897.cpp | C++ | cpp | 3,144 | permissive | /*
* Copyright 2019-present Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.