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 |
|---|---|---|---|---|---|---|---|---|
ca07bddb6c081306d46e61a9848db40d1eb834f9 | 1f79a21a4eb7a7cb26f3f69def8ae8852f356085 | ptomulik/txpl | /test/txpl/lexer/get_word_test.cpp | C++ | cpp | 4,725 | permissive | // Copyright (C) 2015, Pawel Tomulik <ptomulik@meil.pw.edu.pl>
//
// 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_TEST_MODULE test_txpl_lexer_get_word
#include <txpl/test_config.hpp>
#include <boo... |
7b53ccd147b946f0a9bad05288cf0313279ec2ff | 9b18d11daf234601d233d24716d88d65bda6abb0 | Metaleg/old-University-projects | /old/vision/Lutsiv_lab2/main.cpp | C++ | cpp | 2,495 | no_license | #include <stdlib.h>
#include <opencv2/opencv.hpp>
#include <cv.h>
#define SIZE 6
char temp[][21] = {"own.jpeg", "own_90.jpeg", "own_180.jpeg", "own_270.jpeg",
"own_m.jpeg", "own_m_90.jpeg", "own_m_180.jpeg"};
char name_res[][11] = {"r90", "r180", "r270", "r_m", "r_m_r90", "r_m_r180"};
char name_... |
67e9f6640eaa12e909ee5e5fb937a004b851f7cb | 537a53b3a74ddeb4ed4a0393a86a1956cff53fe4 | ddk992001/khang | /Project Euler/Problem 16.cpp | C++ | cpp | 828 | no_license | // POWER DIGIT SUM
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
string add(string a, string b) {
string res = "";
int overflow = 0;
if (a.size() != b.size()) {
int size = a.size() - b.size();
for (int i = 0; i < size; i++)
b = '0' + b;
}
for (int i = a.siz... |
717bc6e41f644c71828dc0d8a08e55090f07f5c2 | cd68f1c30e17c9cc2e61adf4a8e8e4b0837f8135 | MichaelHDesigns/Aezora | /src/qt/aezora/masternodewizarddialog.cpp | C++ | cpp | 15,629 | permissive | // Copyright (c) 2019 The PIVX developers
// Copyright (c) 2020 The AEZORA developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "qt/aezora/masternodewizarddialog.h"
#include "qt/aezora/forms/ui_masternodewizarddia... |
407f889a69ef609a4a43fbc4bcd6dc08179b7f95 | 4f83416dcb89ca208f8c640410743fe5fb77d9cf | morlac/ESP8266-TuringPi-WiFi-Controller | /lib/WebPages/BackupConfiguration.cpp | C++ | cpp | 395 | permissive | #include "WebPages.h"
#include <FS.h>
#include <LittleFS.h>
void handleBackupConfiguration()
{
sendAuthentication();
server.sendHeader( "Content-Disposition",
"attachment; filename=\"tpictl-config.json\"");
LittleFS.begin();
File configFile = LittleFS.open( APP_CONFIG_FILE_JSON, "r");
server.streamFile(... |
d2155da08e5dbeda989cc24d417b32098419941d | 1e6037df805a636fb20f09bcc2a578c91c37634d | ak795/acm | /spoj/AIBOHP/1.cpp | C++ | cpp | 1,098 | no_license | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstr... |
1c00913afdfbf3597c3015a83fc18279caa6e67d | 57e9ea4f10945d6662a6618db8307afd25fb59c1 | kutiny/ApoyoCpp | /Curso/Clase2_3_4/Ejercicios/01.cpp | C++ | cpp | 633 | no_license | /*
Solicite al usuario el ingreso de un numero entero
Si el numero ingresado es par el programa deberá calcular
la potencia que como base utilice el numero ingresado por el usuario
y como exponente el numero 2 e imprimir:
EL NUMERO x ES PAR.
SU CUADRADO ES (x^2)
Si el numero ingresado es im... |
90bb301be8c81cf49cfd26046ab9f6b9877f3c5b | 105aae439b721083e047c27798afc8648f0a9fd4 | Shihabulminhaz/My_Competitive_Programming_Code | /Codeforces/A/1166A.cpp | C++ | cpp | 701 | no_license | #include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define max 10000007
int main()
{
int t,n,l;
string s,ans;
cin >> t... |
5419496331366430a4e309888c9c964902c195ac | 4b5c9b47c0966b08edc8ecf2f4ffe919701f0964 | paulromano/openmc | /src/geometry.cpp | C++ | cpp | 14,985 | permissive | #include "openmc/geometry.h"
#include <array>
#include <fmt/core.h>
#include <fmt/ostream.h>
#include "openmc/cell.h"
#include "openmc/constants.h"
#include "openmc/error.h"
#include "openmc/lattice.h"
#include "openmc/settings.h"
#include "openmc/simulation.h"
#include "openmc/string_utils.h"
#include "openmc/surfa... |
ef6fc0a79c812b4377b230fb6e4a19dda9041215 | dd304eac4f1f0b4830fd947a2d2143ebdbcf295a | himanshusuman555/C-plus-plus-beginning | /c++/4. Dynamic mem allocation 2.CPP | C++ | cpp | 709 | no_license | #include<iostream.h>
#include<conio.h>
void main()
{
int **p; //double pointer because one pointer store row and other column
int nc,nr,r,c; //no of rows // no of columns
clrscr();
cout<<"Enter no of rows and columns";
cin>>nr>>nc; //2 ,3
p=new int *[nr]; // nr=2 memory allocated for rows in h... |
36da50f30b2f54fafcbcfabad8f8b18f4b5f7a78 | 43ac4083733e8ed9956bb4a04b0739e033e60de5 | huuck/Match3 | /external/include/match3-toolbox/DefaultTile.cpp | C++ | cpp | 494 | no_license | #include "DefaultTile.h"
DefaultTile::DefaultTile(int row_, int column_, int type_) {
_row = row_;
_column = column_;
_type = type_;
}
int DefaultTile::getRow() {
return _row;
}
int DefaultTile::getColumn() {
return _column;
}
void DefaultTile::setRow(int row_) {
_row = row_;
}
void DefaultTile::setColumn(i... |
ce5edb0ae6b9aa00939210c51ea04be8fb7e0ebe | 07eeac33cad3a436416235c3ba396bda0f1c3bce | WilliamRutherford/Squaring-the-Circle | /PiSingle.cpp | C++ | cpp | 656 | no_license | #include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
double r; // the radius of the circle
int counter=0;
double distance =0;
cin >> r;
for (double i = 1 ; i <= r-1 ; i++ ) // the x value
{
for(double j = 0 ; j <= r ; j++ ) // the y value
{
distance=sqrt(pow(i,2... |
13eb60473c1b6acf58d7a131cc51c5e5ac2eb02c | 49bdc5934be75e1e35a3060072e03da4722a71c9 | logicallon/controllerScheme | /src/Robot.cpp | C++ | cpp | 204 | no_license | #include "Robot.hpp"
void
Robot::
OperatorControl()
{
while (IsOperatorControl() && IsEnabled())
{
Drive();
Forklift();
intakeOuttake();
Camera();
}
}
START_ROBOT_CLASS(Robot)
|
534eca372395c226b6453b3f11b4d1e4379d3590 | 5e2e1ea81cb928093edba84070f523907ba76081 | lourivalcs/trabalhos_faculdade | /estruturas_de_dados/Estacionamento.cpp | C++ | cpp | 3,258 | no_license | #include<stdio.h>
#include<string.h>
#define TAMANHO 10
typedef struct {
char placa[8];
int manobras;
}SCarro;
typedef struct STACK {
SCarro carros[TAMANHO];
int Indice;
}PILHA;
void push(PILHA* pPilha, SCarro* pCarro);
SCarro top(PILHA* pPilha);
SCarro pop(PILHA* pPilha);
void InicializaPilha(PILHA* pPilha);
... |
ccadc37a08f544e721d6bd1036399532415234eb | 7b6854114d3d1e0e827af4b2de6837163dffa584 | mridulsharma612/PrepBytes_CPP | /week_1/boxs_toys.cpp | C++ | cpp | 821 | no_license | // Tina and Rahul have 1 toy each. They are entering into an amusement park but it is not allowed to take the toys inside, so they have to keep it in the boxes provided by the park management. They want to keep the toys together in one box. There are N boxes in total, at this moment there are ti toys present in ith box... |
ce3e7e718a21ead46d48a652f7aecaf17bb5e21a | 840a4d5280d9a4050123255d8d04deaaa38a2bc5 | LeBulldoge/N-Body-simulation | /nbody/Shader.cpp | C++ | cpp | 1,367 | no_license | #include "Shader.h"
#include <string>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
Shader::Shader() : id(0) {}
void Shader::source(GLenum type, const string &file)
{
if (!id) id = glCreateProgram();
string code;
try
{
stringstream sstream;
{
ifstream stream;
stream.... |
d1ae49b04e0bae4464bd883df764ff823a808508 | e1fde667c4101f0760b3370c3b6ee785cbc17960 | filmskin/CS_Offer | /C++_Code/static_variable.cpp | C++ | cpp | 594 | no_license | /*
* @Author: xuezaigds@gmail.com
* @Last Modified time: 2016-03-01 11:33:36
*/
#include <iostream>
using std::cout;
static int a = 20;
static void func_1(){
cout << "Global variable: " << a << "\n";
}
void func_2(){
static int a = 1;
a += 1;
cout << "Local variable :" << a << "\n";
}
int main ( ) ... |
d1d9bb2aef3ac12940f4bd9cadd48cc26de7a466 | 81b645f417b72c9fffbbf8a254c751ef88f38e14 | OleksandrZheleznyi/other_tasks | /11/7/complex.cpp | C++ | cpp | 917 | no_license | #include "complex0.h"
//#include <iostream>
//using namespace std;
Complex::Complex()
{
x=0.0;
y=0.0;
}
Complex::Complex(double a, double b)
{
x=a;
y=b;
}
Complex::~Complex()
{
}
Complex Complex::operator+(const Complex & n) const
{
return Complex(x+n.x, y+n.y);
}
Complex Complex::operator-(const Complex & n) ... |
e095f034588fb4460e8c563cd5cb84d11ed1a431 | 4029c02879e412baf387a9b8cbbe37ec3f71d416 | HaoxinGuo/CPlusPlusPrimerProblemset | /Code/Chapter15/Exercise_15_03.cpp | C++ | cpp | 833 | no_license | // 练习15.6：将Quote和Bulk_quote的对象传递给15.2.1节（第529页）练习中的
// print_total函数，检查该函数是否正确。
#include <iostream>
#include<string>
using namespace std;
class Quote {
public:
Quote() = default;
Quote(string &book, double sale_price) :bookNo(book), price(sale_price) {};
string isbn() const { return bookNo; };
virtual double net... |
e0307cd98112f334c1992480b7e2582a0f16e536 | 2c191f8ea1217324c24025ec99af046537631d9b | Plaristote/Boots | /include/Boots/Network/socket.hpp | C++ | hpp | 2,753 | permissive | #ifndef _NETWORK_SOCKET_HPP_
# define _NETWORK_SOCKET_HPP_
# ifdef _WIN32
# include <Winsock2.h>
# include <WS2tcpip.h>
# else
# include <sys/socket.h>
# include <netinet/in.h>
# endif
# include <string>
# include <list>
# include "buffer.hpp"
# include "../Sync/observatory_poly.hpp"
# include "../Sync/semaphore... |
88755d5dfc8c097b1257c3d2ce87e1a06b411691 | 6b500af0b7103704bfc0229fff6f7f7ecbb89a25 | alexf2/ImageResizer | /AWSResizer/BSC.cpp | C++ | cpp | 11,277 | no_license | #include "stdafx.h"
#include "CMultipartForm.h"
#include "BSC.h"
HRESULT __fastcall CAwsBindStatusCallback::InternalStartAsyncUpload( std::auto_ptr<CMultipartForm> apFrm, IBindingNotify* pNotify, BSTR bstrURL, bool bRelative, IUnknown* pUnkContainer )
{
m_apFrm = apFrm;
m_spNotify = pNotify;
HRESULT hr = S_OK;
... |
b6a855b00991df6c759712af481d1e769c6ca414 | e0d2707fd339ce65519da38d40c1fe459ad13383 | agilecomputing/nomads | /aci/cpp/DisService/TargetBasedReplicationController.cpp | C++ | cpp | 36,526 | no_license | /*
* TargetBasedReplicationController.cpp
*
* This file is part of the IHMC DisService Library/Component
* Copyright (c) 2006-2014 IHMC.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* version 3 (GPLv3) as published by the Free So... |
fe5f2324cab762985b1cd41856711877150bfac0 | f9f9574f968034ab1b0bd1228ab4a5bfec56d201 | archercreat/dta-vs-osc | /attacking_anti_tamper/taint_cpp/extern/Triton/src/libtriton/includes/triton/pythonUtils.hpp | C++ | hpp | 2,339 | permissive | //! \file
/*
** Copyright (C) - Triton
**
** This program is under the terms of the BSD License.
*/
#ifndef TRITON_PYTHONUTILS_H
#define TRITON PYTHONUTILS_H
#include <triton/pythonBindings.hpp>
#include <triton/tritonTypes.hpp>
//! The Triton namespace
namespace triton {
/*!
* \addtogroup triton
* @{
*/
... |
67499b8fc7f2b567ca7fbfdfc2bbcbda97664b51 | de717fc02f833364aa7e37acd6b4283faf995f3f | FutureWang123/dreamcast-docs | /CPU/SRCS/kos-1.2.0/examples/dreamcast/cpp/gltest/gltest.cpp | C++ | cpp | 6,075 | no_license | /* KallistiOS 1.2.0
gltest.cpp
(c)2001-2002 Dan Potter
*/
#include <kos.h>
#include <GL/gl.h>
#include <GL/glu.h>
#include <pcx/pcx.h>
/*
This is a really simple KallistiGL example. It shows off several things:
basic matrix control, perspective, the AUTO_UV feature, and controlling
the image with maple input.... |
b84d912a38bd13c9a7f33a2c5a7c54435ed655da | 13be039be2bea6da1787c33cf42c143f66298649 | matthewh806/FreakQuincy | /lib/include/engine/ExponentialTimeADSR.hpp | C++ | hpp | 1,023 | no_license | #ifndef EXPONENTIALTIMEADSR_HPP
#define EXPONENTIALTIMEADSR_HPP
#include "engine/AbstractEnvelope.hpp"
namespace engine {
class ExponentialTimeADSR : public AbstractEnvelope {
public:
ExponentialTimeADSR(float attackTime, float decayTime, float sustainLevel, float releaseTime, double ... |
7d054d53da02b0b885d7ca27d41873b811128209 | 8769f568d93c195e9253d54f88ebd0ab4b39782b | manojmula/Cpp | /if_else.cpp | C++ | cpp | 345 | no_license | #include<iostream>
using namespace std;
int main()
{
int num{};
const int target{10};
cout<<"Ente a number and i will compare it to "<<target<<" : ";
cin>>num;
if(num>=target)
{
cout<<"\n===================================================="<<endl;
cout<<num<<" is greater tha... |
b340de9ffe1b9e34d75355e95588c84208073fdc | c1b59fb79a15704d0ea04f9b8f6da34d53f4020e | huytd/chemthan | /Graph/TreeCentroidDecomposition.cpp | C++ | cpp | 890 | no_license | #include <bits/stdc++.h>
using namespace std;
//O(nlogn)
const int MAXN = 100000 + 10;
int n;
vector<int> adj[MAXN];
int del[MAXN];
int size[MAXN];
void dfs(int u, int p) {
size[u] = 1;
for (int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
if (v != p && !del[v]) {
dfs(v, u);
size[u] +... |
2a2f97860e25c433712e0073156b7f9f00445585 | 484a69c82bc94d34147a73b2ee97cd6b2363c519 | FeiYeYe/CodeOptimizationTechniques | /src/openCL/standardOpenCL_float.cpp | C++ | cpp | 11,526 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <iostream>
#include <sstream>
#include <fstream>
#include <sys/time.h>
#include <sys/resource.h>
#include <iomanip>
#include <CL/cl.h>
#include "Array2D.h"
using namespace std;
typedef float E; // Define the type of elements being used.
const in... |
5026186d7a1d70457ef9c577660eb27e68fac0ef | b99e5d92c7d28e3b3ce3457af2f5762ec0e3e6b5 | Datta2901/CCC | /.history/Day 2/Answers/ReverseVowels_20210305151226.cpp | C++ | cpp | 340 | no_license | #include<bits/stdc++.h>
using namespace std;
bool isVowel(char a){
if(a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u'|| a == 'A' || a == 'E' || a == 'I' || a == 'O' || a == 'U'){
return true;
}
return false;
}
int main(){
string name;
cin >> name;
vector<int>vowels;
for()
... |
97576e28c3d33ec1a5553e7a1328be64ee6f20e2 | e61a4ae08fef323442254fd3f8eb69f9e1ce568e | ak795/acm | /project_euler/109/1.cpp | C++ | cpp | 3,681 | no_license | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility... |
24ef3a1b41a8166c7ba547fe2ccd7942264dd7dc | aa883ba816a53b62a239ceb19d165e879b87fcb5 | BillYang2016/Codes | /bsoj3414-civilization.cpp | C++ | cpp | 1,801 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
inline LL Get_Int() {
LL num=0,bj=1;
char x=getchar();
while(!isdigit(x)) {if(x=='-')bj=-1;x=getchar();}
while(isdigit(x)) {num=num*10+x-'0';x=getchar();}
return num*bj;
}
const int maxn=205;
const LL mod1=1e9+7,mod2=1e9+9,mod=mo... |
c77de3faa4fc356c02923841a1e806709b4c22d1 | 61b9b7de9b110d2b6aabf0bb2d95b307b32df59d | D0m021ng/reading | /Algorithm/vijos/1037.cpp | C++ | cpp | 2,568 | no_license | #include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
#define MAXN 105
#define MAXH 2005
int dp[MAXN][MAXH], sum[MAXN];
/***********************************************************************
* 思路：设dp[i][j]表示前i块水晶堆成高度差为j的双塔时，较矮的塔
* 最大高度。此时，对于第i块水晶，有2种情况，选或不选。其中，
... |
0d3cba4c86350ebe5fc625b60ab2d1fd83bee071 | ca140e1df71c978d18303590b4941652df1aff02 | kkskk/openrasp | /agent/php5/hook/checker/check_utils.cc | C++ | cc | 2,144 | permissive | /*
* Copyright 2017-2019 Baidu 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 agreed... |
b758ac65e6c3a3a29615d0a47ef61cf8ef65afb2 | 96fb134e6c297617fcc49c70e483d3a22d10f0e5 | VictorMuncaciu/CloudComputing | /Generated/Generated.cpp | C++ | cpp | 811 | no_license | // Generated.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
int main()
{
std::cout << "Hello World!\n";
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Star... |
ca81cc52a2883649f1d14b2fc2b4bb6d0d0b69eb | eebc1028dc2725a6cebd97aedd06d20356bcc127 | yangjianying/football_ndk | /standalone/SaschaWillems/computedemo1/old_bak/computedemo1_1.cpp | C++ | cpp | 50,809 | no_license | /*
* Vulkan Example - Compute shader image processing
*
* Copyright (C) 2016 by Sascha Willems - www.saschawillems.de
*
* This code is licensed under the MIT license (MIT) (http://opensource.org/licenses/MIT)
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <vector... |
2239eb559b8ed6b95486862c8833f73e2d72d0c8 | 1ffb492b1e7a9e1943b6036e21e2fde53b1ebcb0 | sumedhachugh/DSA_udemy | /24 Tower of Hanoi.cpp | C++ | cpp | 742 | no_license | /******************************************************************************
Tower of Hanoi using Recursion
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile ... |
e5b03742ae4be5390c355bea18569d93d0d40486 | c89e228564dfa814b67b5627ca0f663d0f891234 | utwente-fmt/dftcalc | /dfttest/TestResult.cpp | C++ | cpp | 441 | permissive | #include "TestResult.h"
const YAML::Node& Test::TestResult::readYAMLNode(const YAML::Node& node) {
readYAMLNodeSpecific(node);
if(const YAML::Node itemNode = node["stats"]) {
itemNode >> stats;
}
return node;
}
YAML::Emitter& Test::TestResult::writeYAMLNode(YAML::Emitter& out) const {
out << YAML::BeginMap;
... |
7fbd0fc92681f0b3ff8201fd7651850b18068f16 | 897bcca4f93abf56c184001293c07992b0ad4fe2 | radhika011/Buffer | /Project 3 - Library Management System/teacher.cpp | C++ | cpp | 6,510 | no_license | #include "teacher.h"
using namespace std;
teacher::teacher()
{
dept = " ";
designation = " ";
}
void teacher::input(string name,string email,string password,string dept,string designation)
{
user u;
fstream fout;
fout.open("teacher.csv",ios::out | ios::app);
person::input(name,email); ... |
c087ea3eb314366c1f5780a47c8efcdfc792917b | 868810300dbaa72fdc12b91fd472c9357870e63e | shaoxq1205/uvm_40_bit_dummy | /libs/verification/qxluvc/qclk/uvm/env/src/DPI/qclk_proxy_dpi.cpp | C++ | cpp | 6,328 | no_license |
#include <string>
#include <stdio.h>
#include "svdpi.h"
#ifndef PALLADIUM
#include "XlBitVecCaster.h"
#include "XlSvBridgeSync.h"
using namespace XlVip;
#endif
using std::string;
extern "C" {
#ifdef PALLADIUM
static svScope hdlScope_clock[256];
static int hdlScope_handle=0;
#endif
//----------------------... |
7435c04cb07aa15c12404425a7fa5ebd597fbdba | 01f321133632813e1c5b1d041e7014d65e02065c | muttleyxd/chromium | /ui/ozone/platform/wayland/host/wayland_data_device.cc | C++ | cc | 7,213 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/ozone/platform/wayland/host/wayland_data_device.h"
#include <memory>
#include <string>
#include <utility>
#include "base/bind.h"
#include "... |
e4020ef8945a985828acd08e4f8918b4b94963ae | 0e3d36a1a70c3234b0415b1b0604c028f2035be1 | Petercov/Quiver-Engine | /src/utils/dmxedit/luamain.cpp | C++ | cpp | 9,765 | no_license | //=============================================================================
//
// The copyright to the contents herein is the property of Valve, L.L.C.
// The contents may be used and/or copied only with the written permission of
// Valve, L.L.C., or in accordance with the terms and conditions stipulated in
// the ... |
8b3f829e84b4dfd21222693b52d69559f3a49474 | 99c4521b51119b0b90017d135536cfd1e8e3d421 | gsim047/udklib | /udk/tSHA512.cpp | C++ | cpp | 1,111 | no_license | #include "tSHA512.h"
#include <stdio.h>
#include <string.h>
#include "_sha_h.cpp"
void tSHA512::init()
{
state = (char *)(new SHA512_CTX);
SHA512_Init((SHA512_CTX *)state);
}// tSHA512::init
tSHA512::tSHA512() :
tHash(),
state(NULL)
{
init();
}// tSHA512::tSHA512
tSHA512::tSHA512(const string &str) :
tH... |
8cd37837a4731846612e21a10a6afef0f8024f0c | 6c4bb0ad5a0640e97271ed00aae7bfd79db2101c | satoshinm/CuberiteForge | /Tools/AnvilStats/Processor.cpp | C++ | cpp | 13,806 | permissive |
// Processor.cpp
// Implements the cProcessor class representing the overall processor engine that manages threads, calls callbacks etc.
#include "Globals.h"
#include "Processor.h"
#include "Callback.h"
#include "../../src/WorldStorage/FastNBT.h"
#include "zlib/zlib.h"
#include "Utils.h"
const int CHUNK_INFLATE... |
f106c058a15bd36055a82c0db34c3cb331f96867 | 7fa0fb5a9878a30d84a370828c99caef2b92fb38 | iocumine/boringssl | /ssl/test/handshake_util.cc | C++ | cc | 17,094 | permissive | /* Copyright (c) 2018, Google Inc.
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS... |
48b819b1f90240801900ad17dc59172079d68496 | 60832a16cb7563236ffed02e366ab81960f4f3de | Babdodook/D3D9_SolarSystem | /D3D9_SolarSystem/Neptune.cpp | C++ | cpp | 1,235 | no_license | #include "Neptune.h"
CNeptune::CNeptune()
{
}
CNeptune::~CNeptune()
{
}
void CNeptune::OnInit(LPDIRECT3DDEVICE9 _pd3dDevice)
{
m_pd3dDevice = _pd3dDevice;
CPlanet::CreatePlanet(1.8f, 10, 10, "Neptune.jpg");
}
void CNeptune::OnUpdate()
{
SetupMatrix();
}
void CNeptune::OnRender()
{
m_pd3dDevice->SetTexture(0,... |
714e991acde8f9761a72981845628dfada050c77 | ced109fac35baca34e278f07cc4d43e9eb71e138 | PiNengShaoNian/cpp-primer | /ch1/1.4.cpp | C++ | cpp | 251 | no_license | #include <iostream>
int main()
{
std::cout << "请输入两个数" << std::endl;
int v1, v2;
std::cin >> v1 >> v2;
int result = v2 * v1; //3423432
std::cout << v1 << "*" << v2 << "=" << result << std::endl;
return 0;
} |
18d216844ee30f8cc49da23da79efa90809fd894 | 4d3801303f82e6e7d634d6e43c3987ad924bb960 | SakhawatCoU/Code | /clock.cpp | C++ | cpp | 556 | no_license | #include <bits/stdc++.h>
using namespace std;
//programme er runtime calculate korar sample code
int main()
{
clock_t beginn, endd;
double time_spent;
beginn = clock();
while(1)
{
endd = clock();
time_spent = (double)(endd - beginn) / CLOCKS_PER_SEC;
if(time_spent>2.00)
... |
ec33ba5891dba323110c52dfda1b13a54f646525 | 7a515846876c2e62a2e7af31f630097a1bbe515e | JunTae-Kim/spill | /originalcode2.cpp | C++ | cpp | 4,568 | no_license |
#include <opencv2/opencv.hpp>
#include <iostream>
#include <raspicam/raspicam_cv.h>
#include <opencv/cv.hpp>
#include <opencv2/highgui.hpp>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <wiringPi.h>
#include <softPwm.h>
#define SERVO 1
#define RANGE 100
using namespace cv;
using namespace std;
... |
b90356e823c6751c100289fcc6ff0272bb9c73fc | e384c774cacd9d8ebeeba6a1aedbb49d96f27fb8 | SaifHaiderMalik/OOP | /Labs/Saif/Misc/t25.cpp | C++ | cpp | 256 | no_license | #include<iostream>
using namespace std;
// GENERIC FUNCTION / Template Function
template<class T> void display(T a){
cout << "This is : " << a <<endl;
}
int main(void){
display(30);
display('B');
display("hello");
display(4.5);
} |
e2039249d7f53d34c85977216966983cf9f58aa7 | 70125c24b6530f27e6e5c9433f6f2d94ec1a516d | JustinRuaux/test_project | /main.cpp | C++ | cpp | 640 | no_license | /*
* main.cpp
*
* Created on: 2 oct. 2019
* Author: justinruaux
*/
#include "vector.hpp"
#include <cmath>
#include <sstream>
#include <cassert>
#include <iostream>
double const pi { std::acos(-1.0) };
using namespace std;
int main()
{
Vector zero { };
Vector e1 { 1.0, 0.0 };
Vector e2 { 0.0, 1.0 }... |
1b6edec7c9cd0cb3239a3ca201886ee43cd6c77d | 52b57eb380402a30b9cb62f11427102e708b0384 | victorv/arrayfire | /src/backend/cpu/kernel/unwrap.hpp | C++ | hpp | 2,532 | permissive | /*******************************************************
* Copyright (c) 2015, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
**********************************************... |
1d794e4f2a40e19e7fa044f13070fda8796cf1f2 | 9dcaba222a0a3ebba222de744c9270ff05be2153 | notwatermango/Kattis-Problem-Archive | /below3/ants.cc | C++ | cc | 668 | permissive | #include <iostream>
using namespace std;
// ? Time Optimization possible
// 0.07s
int main(){
int tc;
cin>>tc;
for (int lll = 0; lll < tc; lll++)
{
int l,n;
cin>>l>>n;
int x;
int mind = 0;
int maxd = 0;
int ldis,sdis;
for (int i = 0; i < n; i++)
... |
a0977cf620cc4de8a570eb405e4b134c8eeaf3d9 | 92348104c0680afeb3be4f41ecc1a2d17e60f648 | samkit96/LeetcodeSolutions | /Medium/sort-the-matrix-diagonally.cpp | C++ | cpp | 1,438 | no_license | // Problem: https://leetcode.com/problems/sort-the-matrix-diagonally/
class Solution {
public:
/**
* HINT: Difference of j and i is constant across a diagonal.
*/
vector<vector<int>> diagonalSort(vector<vector<int>>& mat) {
int n = mat.size();
if (n <=1) return mat;
int... |
11f90d74cc90e978d27f41042d89d1388abb2c42 | e1b6847a9d0a8bb45fdc102e662db33b30272914 | likewind1993/-Offer- | /solutions/14.链表中倒数第k个结点.cpp | C++ | cpp | 571 | permissive | class Solution {
public:
ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
if(pListHead == NULL || k == 0) return NULL;
ListNode * p_dummy = new ListNode(-1);
p_dummy->next = pListHead;
ListNode * p_slow = p_dummy, * p_fast = pListHead;
for(unsigned int ... |
4b1297efde50e618c416e656e913d89ece53471c | 1e418da8dcd6ee0abf36862c12a40b7b1d5f02df | TheShadow29/CS475m-Computer-Graphics | /Assignment2_2/sudeep1/lighting.cpp | C++ | cpp | 4,312 | no_license | #include <GL/glut.h>
#include<iostream>
#include<vector>
#include "all_lighting.cpp"
using namespace std;
//Our function for processing ASCII keys
void processNormalKeys(unsigned char key, int x, int y) {
switch(key)
{
case 'x':
case 'X': // rotate the along the x axis to view the c... |
611f11e18c219ff614bc35a5025539f246426bec | 6d3c99965ba6e6224011d98da261d21cb22e59b6 | OlehKulykov/LzmaSDKObjC | /src/LzmaSDKObjCFileEncoder.cpp | C++ | cpp | 6,531 | permissive | /*
* Copyright (c) 2015 - 2020 Oleh Kulykov <olehkulykov@gmail.com>
*
* 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... |
b8ffd9176a6f012e4f3260bb75d2f2a21ba03d2b | 6265ebcb4bda55d041985d283e5b02207510f14e | friendshipCoin/friendshipcoin-core | /src/masternode-payments.cpp | C++ | cpp | 11,662 | no_license | // Copyright (c) 2014-2015 The Dash developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "masternode-payments.h"
#include "masternodeman.h"
#include "darksend.h"
#include "util.h"
#include "sync.h"
#include "s... |
5dc185efa30301787625b9b80c276c2e37632866 | a32ede4b9514985da07e68490fb4e461317161c2 | ArsThaumaturgis/panda3d | /direct/src/plugin/p3dFileParams.cxx | C++ | cxx | 4,438 | permissive | /**
* PANDA 3D SOFTWARE
* Copyright (c) Carnegie Mellon University. All rights reserved.
*
* All use of this software is subject to the terms of the revised BSD
* license. You should have received a copy of this license along
* with this source code in a file named "LICENSE."
*
* @file p3dFileParams.cxx
* @a... |
ec26a93401035a00d1bac8231f73cf50b75595c8 | f4451bb2921ed42d40df3d0058559593b39fe928 | mogumbo/ogre | /RenderSystems/GL3Plus/src/GLSL/src/OgreGLSLShader.cpp | C++ | cpp | 26,992 | permissive | /*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2014 Torus Knot Software Ltd
Permission is hereby granted, free of charge, to any... |
38da83190cdce56ba595c3b468aacf831f36f542 | 7ad0870c7e70993235005e0886dff5e29730de5a | manvis/IYFEngine | /tools/IYFEditor/include/AssetList.hpp | C++ | hpp | 2,203 | permissive | // The IYFEngine
//
// Copyright (C) 2015-2018, Manvydas Šliamka
//
// 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
// condi... |
40666bd211d359897d2c9215c70199d76f344733 | b5e9a257d549f2f4bfa50c45dce2c3c6ed45d692 | KrissyRayD242/ufo | /src/ufo/predictors/PredictorBase.cc | C++ | cc | 2,183 | permissive | /*
* (C) Copyright 2020 UCAR
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
*/
#include "ufo/predictors/PredictorBase.h"
#include <map>
#include "eckit/config/LocalConfiguration.h"
#include "oops/util/abor1_... |
da717366d5df8b2a64afcd3e7df37ce4eda85b18 | a77c11a358f84f4b93e220307fcb46f234cafa5b | zhangf911/wxsj2 | /Server/Server/ActionModule/ActionDelegator.cpp | C++ | cpp | 16,628 | no_license | ///////////////////////////////////////////////////////////////////////////////
// 文件名：ActionDelegator_T
// 程序员：高骐
// 功能说明：动作的代理类 , 角色动作的公共接口和常用功能
//
// 修改记录：
//
//
//
///////////////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "Type.h"
#include "ActionLogic.... |
537e2bcb28366b37566be3fe5d958bb3a5d6988a | 36abfd73f3ac434f331bfc3dcb8b029bbad5fa76 | lukejw16/Reality | /Source/Reality/Private/MainMenuCharacter.cpp | C++ | cpp | 748 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "MainMenuCharacter.h"
// Sets default values
AMainMenuCharacter::AMainMenuCharacter()
{
// Set this character to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCa... |
ce03880628fe936fcd612c9e2a4f6c2fe2573462 | 7274ee9c542fcc72393e78786ee33b9007bdf16a | Codeon-GmbH/mulle-clang | /test/CXX/dcl.decl/dcl.fct.def/dcl.fct.def.default/p2.cpp | C++ | cpp | 4,580 | permissive | // RUN: %clang_cc1 -std=c++11 -fsyntax-only -verify -fcxx-exceptions %s
// An explicitly-defaulted function may be declared constexpr only if it would
// have been implicitly declared as constexpr.
struct S1 {
constexpr S1() = default; // expected-error {{defaulted definition of default constructor is not constexpr}... |
ec06255f162c8c947f33930bd2b549fb754030d8 | 797ff53d027df7534a58015f2f0560fbfe5ba00d | itohdak/Competitive_Programming | /Codeforces/Div2/prev/597/D.cpp | C++ | cpp | 2,515 | no_license | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... |
ed01a395af926589af3b292170641457dbd70a2d | 58b6d3666100cf2c9b83517a145956bab864f6e8 | Strongc/Workflow | /Source/Runtime/WfRuntime.cpp | C++ | cpp | 16,542 | permissive | #include "WfRuntime.h"
namespace vl
{
using namespace reflection;
using namespace reflection::description;
using namespace workflow::runtime;
using namespace collections;
namespace workflow
{
namespace runtime
{
/***********************************************************************
WfRuntimeGlobalContext... |
e99b6f7513992f77ea085c1901344e75b4c43732 | cee4b80fb87e29f24811005ff098192e9b600cd9 | lcscs/scs | /plugins/trace_api_plugin/test/test_responses.cpp | C++ | cpp | 23,992 | permissive | #define BOOST_TEST_MODULE trace_data_responses
#include <boost/test/included/unit_test.hpp>
#include <fc/variant_object.hpp>
#include <lcscs/trace_api/request_handler.hpp>
#include <lcscs/trace_api/test_common.hpp>
using namespace lcscs;
using namespace lcscs::trace_api;
using namespace lcscs::trace_api::test_common... |
6451cd76b89733011995a8d9d3995726b21db713 | 1b05c4cf655643a5a5f0f2298c892f53148d5cff | Benyuss/Bevgraf | /kotelezobeadando/kotelezobeadando/Transformations.cpp | C++ | cpp | 541 | no_license | #include "Transformations.h"
void matrixMultiplication(double a[][3], double b[][3], double c[][3]) {
int i, j, k;
double sum;
for (i = 0; i < 3; i++)
for (j = 0; j < 3; j++) {
sum = 0;
for (k = 0; k < 3; k++)
sum = sum + a[i][k] * b[k][j];
c[i][j] = sum;
}
}
HomogenPoint transform(double m[][3], ... |
d813840aa2071d54ff4a4acf46ce80eb2f3df560 | 83f7b6227ef407f62a29ef918c0ca12808697580 | speedpat/seleniumcpp | /tests/dummy_test.cpp | C++ | cpp | 798 | permissive | /*
* Copyright (C) 2014 Patrick Heeb
*
* 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 agre... |
c7afa88c5bb298aa9af60943ba888dc5da1c3a67 | 62733c56cdad8fc1282d3f53ee08e9eb75b60b5e | danhnguyen0902/SPOJ-Algorithm-and-Data-Structures | /SPOJ/DSUBSEQ.cpp | C++ | cpp | 837 | no_license | #include <stdio.h>
#include <string.h>
#define max_n 100000
#define modulo 1000000007
int *dp = new int [max_n + 1];
int *ans = new int [max_n + 1];
int *prev = new int [128];
int main() {
int i, j, c, t, l;
char str[max_n + 1];
str[0] = ' '; // (**********************************)
scanf("%d", &t);
for (i = 1;... |
42ffea2ead56571a3920c665f1a14d2097149060 | 66665ddb48fc2e7c1ebef910667f3793036e4510 | phyrephox/four-d_explore | /dep/anvil/src/misc/types.cpp | C++ | cpp | 108,451 | permissive | //
// Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.
//
// 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
/... |
676a440aefceaf5877b0230f66dd6e0d1ef0d378 | 48f7e90f7d0368785285e0768d2f1a16f886e500 | brycelelbach/nt2 | /modules/sdk/unit/simd/is_equal.cpp | C++ | cpp | 2,002 | permissive | /*******************************************************************************
* Copyright 2003 & onward LASMEA UMR 6602 CNRS/Univ. Clermont II
* Copyright 2009 & onward LRI UMR 8623 CNRS/Univ Paris Sud XI
*
* Distributed under the Boost Software License, Version 1.0.
* ... |
dbd85528d2919c6ca0179408613f114df306e775 | e2e8e0c90fb8e4632461ae1557cba0628c7350a6 | FeiZhan/Algo-Collection | /answers/lintcode/Combination Sum.cpp | C++ | cpp | 1,824 | permissive | //@level Medium
//@type Backtracking Array
//@result Accepted Total Runtime: 17 ms 100% test cases passed.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
/**
* @param candidates: A list of integers
* @param target:An integer
*... |
39ee78b1552630878adf27aa325d58dcbc2e6e6c | 67362f2870b3676813686e792b0da2a429a0a685 | xsolla/store-ue4-sdk | /Source/XsollaStore/Private/XsollaOrderCheckObject.cpp | C++ | cpp | 8,552 | permissive | // Copyright 2023 Xsolla Inc. All Rights Reserved.
#include "XsollaOrderCheckObject.h"
#include "Engine/EngineTypes.h"
#include "Engine/World.h"
#include "IWebSocket.h"
#include "Serialization/JsonReader.h"
#include "Serialization/JsonSerializer.h"
#include "TimerManager.h"
#include "WebSocketsModule.h"
#include "Xso... |
81a68ab830798413e89b00ff9b81c0a380a48ef4 | a8dccc4e8184dd72b13fffd56ae75682ffb49006 | paralin/hl2sdk-dota | /game/shared/swarm/asw_weapon_mining_laser_shared.cpp | C++ | cpp | 20,327 | no_license | #include "cbase.h"
#include "npcevent.h"
#include "Sprite.h"
#include "beam_shared.h"
#include "takedamageinfo.h"
#include "gamerules.h"
#include "in_buttons.h"
#include "soundenvelope.h"
#ifdef CLIENT_DLL
#include "c_baseplayer.h"
#include "c_asw_player.h"
#include "c_asw_marine.h"
#include "c_te_effect_... |
de14ae5ad10bc789f00a5a9d5e83dade04a894ab | ba8b9263763c9ad62345f3f4d052122eb79a628b | MasahiroNakajima1202/commander | /game/hit_checker_actor_tile_field.cpp | C++ | cpp | 3,602 | no_license | //*****************************************************************************
// 攻撃判定とキャラクター間の当たり判定クラス
// author: 中島将浩
// update: 2015/10/31
//*****************************************************************************
#include "hit_checker_actor_tile_field.h"
#include "battle_object_accessor.h"
#include "battl... |
27ce162f681801b042398cb5ce4098bf75bead97 | 53093c29961a697bdabc8f9bf1feff1638a9dc0a | arajkumar/competitive-programming | /gcj/1/1.cc | C++ | cc | 663 | no_license | #include <stdio.h>
#include<stdint.h>
#include <inttypes.h>
int main(int argc, char** argv) {
int t;
scanf("%d", &t);
for (int i = 1; i <= t; i++) {
int s_max;
int aud_count = 0;
int level_aud_count = 0;
scanf("%d", &s_max);
char level_map[s_max + 10];
scanf("%s", level_map);
//printf... |
cc97d542ae79351cab384c8e84da80f47da8f280 | faffb62a89a5458edb8524e258ef91cbdb429a83 | ericbin1/RailwayMonitor | /build/Demo/DemoDlg.cpp | C++ | cpp | 47,898 | no_license |
// DemoDlg.cpp : 实现文件
//
#include "stdafx.h"
#include "Demo.h"
#include "DemoDlg.h"
#include "afxdialogex.h"
#include "mmsystem.h"
#include "json/json.h"
#include "CvvImage.h"
#include "RDC.h"
#include "list.h"
#include "frame.h"
#include "railwaymonitor.h"
#include <stdio.h>
#include <queue>
#include <audioclient.h>... |
d887fc3ec747adbca5bdd694dad3af8b07836c67 | bd5fd61ad292062d3c2e331a383e9350e74e39b0 | BetsyMcPhail/seal-tk | /sealtk/core/KwiverFileVideoSourceFactory.hpp | C++ | hpp | 1,172 | permissive | /* This file is part of SEAL-TK, and is distributed under the OSI-approved BSD
* 3-Clause License. See top-level LICENSE file or
* https://github.com/Kitware/seal-tk/blob/master/LICENSE for details. */
#ifndef sealtk_core_KwiverFileVideoSourceFactory_hpp
#define sealtk_core_KwiverFileVideoSourceFactory_hpp
#include... |
2ee5426712c3ba3d173d3aec0e098fd33882dc2e | 37a1c4bd05f1b0a13d09b876a3dd05c2ea7b2f8a | Ginson/budgetwarrior | /include/data_cache.hpp | C++ | hpp | 2,617 | permissive | //=======================================================================
// Copyright (c) 2013-2020 Baptiste Wicht.
// Distributed under the terms of the MIT License.
// (See accompanying file LICENSE or copy at
// http://opensource.org/licenses/MIT)
//=================================================================... |
14d2bc5bf6a00ba2d0fb2c54fdd3b3b6a31e7c8f | b0222b2955ecf3c92c44ecc56e3afad923fab1ce | pacien/duckdb | /src/catalog/catalog_entry/view_catalog_entry.cpp | C++ | cpp | 2,101 | permissive | #include "duckdb/catalog/catalog_entry/view_catalog_entry.hpp"
#include "duckdb/catalog/catalog_entry/schema_catalog_entry.hpp"
#include "duckdb/common/exception.hpp"
#include "duckdb/common/serializer.hpp"
#include "duckdb/parser/parsed_data/create_view_info.hpp"
#include "duckdb/common/limits.hpp"
#include <algorit... |
b975f1b8b44bf32e13dbeb1fdb8cae151c62fdef | e2ce736947d4fb038709169e663f89b3173d39f3 | openxla/iree | /compiler/src/iree/compiler/Dialect/Flow/Transforms/TensorPadToTensorInsertSlice.cpp | C++ | cpp | 5,154 | permissive | // Copyright 2020 The IREE Authors
//
// Licensed under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//===- TensorPadToInsertSlice.cpp ----- Pass to legalize tensor.pad -------===//
//
// Pass to co... |
db7c134b859a93e80304ebbe20411ef3d5ea221d | c4b18046b0fb7a82ca02a349ac9eb39f003b8b91 | recantha/redwing-pi | /arduino/firmata/StandardFirmata/.build/leonardo/src/sketch.cpp | C++ | cpp | 21,878 | no_license | #include <Arduino.h>
void readAndReportData(byte address, int theRegister, byte numBytes);
void outputPort(byte portNumber, byte portValue, byte forceSend);
void checkDigitalInputs(void);
void setPinModeCallback(byte pin, int mode);
void analogWriteCallback(byte pin, int value);
void digitalWriteCallback(byte port, int... |
e0569fd9f8c9cb1977c97c17a19846a6c3b6b1f6 | 710d0ead5004110c0a0c362354e44da1def5337e | MedAnisBenSalah/VMultiplayer | /VMultiplayer/Address.cpp | C++ | cpp | 4,716 | permissive | /* =========================================================
V:Multiplayer - http://www.vmultiplayer.com
-- File: Address.cpp
-- Project: Client
-- Author(s): OrMisicL
=============================================================*/
#include "Main.h"
// Patterns
#define C_CPopulation__CreatePed "\x48\x8B\xC4\x48\x8... |
75e8c59d8b6fbe47e7374502fb95b4c3e277143d | 82fe3e1ba42c5dbf587cd4a83c16dd6d65995576 | TrecApps/AnaGame | /AnaGame_Builder/AnaGame_Builder.cpp | C++ | cpp | 4,074 | no_license | // Anagame_Builder.cpp : Defines the entry point for the application.
//
#include "framework.h"
#include "Anagame_Builder.h"
#include <DirectoryInterface.h>
#include <TInstance.h>
#include "MainLayoutHandler.h"
#define MAX_LOADSTRING 100
// Global Variables:
HINSTANCE hInst; // curren... |
58bd4f5f99ef2e6fb42a024db784767e95f89261 | ae74457007a393a2aae45af79c13fa57bd185ded | fawkesrobotics/fawkes | /src/libs/utils/misc/string_conversions.cpp | C++ | cpp | 7,469 | no_license |
/***************************************************************************
* string_conversions.cpp - string conversions
*
* Created: Thu Oct 12 12:05:42 2006
* Copyright 2006 Tim Niemueller [www.niemueller.de]
*
****************************************************************************/
/* This progr... |
d91d8a15ac1310d1daa1a866b680b83e709e52e4 | a1dba9222909cef7cb1c2e95d052be0127109fde | chenyzcs/HuaweiCodeCraft | /Out_Degree_teest/main.cpp | C++ | cpp | 3,740 | no_license | #include <iostream>
#include <ctime>
#include "variable_declaration.h"
#include "io_c_ver.h"
using namespace std;
int server_Num;
std::vector<std::vector<netNode_index>> netNode_MGraph_BandWidth_Left_vec;
std::vector<consumeNode_index> consumeNodeList_vec;
int main()
{
const char * filename_c = "F:\\Huawei\\case... |
780c634f13a2488841af84ba022536714e403920 | 5b6897ec9f8332d9d9cb51606480382ed67c0c97 | bravesoftdz/MyVCL-7 | /DevExpress VCL/ExpressQuantumTreeList 4/Demos/CBuilder/EditorsMaskDemo/EditorsMaskDemo.cpp | C++ | cpp | 1,400 | no_license | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
//---------------------------------------------------------------------------
USERES("EditorsMaskDemo.res");
USEFORM("EditorsMaskDemoMain.cpp", EditorsMaskDemoMainForm);
USEFORM("EditorsMaskDemoData.cpp", Edi... |
e91d0c59ee63703e224764724997f075f68691fc | 38a1464ffcc1100d881636824d372683c36fe543 | burhanuddinvasi/tensorflow | /tensorflow/compiler/mlir/tensorflow/transforms/shape_inference.cc | C++ | cc | 30,681 | permissive | /* Copyright 2019 The TensorFlow 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 a... |
4e9e993e1f4cb84d76fcbd91333563bb2c385715 | 93178f61283bcc829568a250f82d536df01a954f | MichalNowicki/photobundle | /apps/test_kitti_stereo.cc | C++ | cc | 2,750 | permissive | #include "dataset.h"
#include "stereo_algorithm.h"
#include "calibration.h"
#include "utils.h"
#include "imgproc.h"
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/highgui/highgui.hpp>
//#include <opencv2/contrib/contrib.hpp>
#include <fstream>
#include <Eigen/LU>
void colorizeDisparity(const cv::Mat& src, ... |
c77884a206c820e78912fade574bb4514eddc34d | c1264891f67c5e1ef641a31e7ff8ad6dbc794845 | Kode/Krom | /deps/v8/src/builtins/builtins-date.cc | C++ | cc | 39,298 | permissive | // Copyright 2016 the V8 project 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 "src/builtins/builtins-utils-inl.h"
#include "src/builtins/builtins.h"
#include "src/codegen/code-factory.h"
#include "src/date/date.h"
#includ... |
73aef9346129cc656d40892f4f77b732a0b5d431 | 864b743543e43696df2887a1d31f66ee359390b1 | masterhong1634/2weekTeamPortpolio | /return S_OK TeamPortpolio/MinionMulligan.cpp | C++ | cpp | 12,941 | no_license | #include "stdafx.h"
#include "MinionMulligan.h"
MinionMulligan::MinionMulligan()
{
}
MinionMulligan::~MinionMulligan()
{
}
HRESULT MinionMulligan::Init(POINT position, int EnemyNumber)
{
//구조체 정보 기입
EnemyInfo MinionMulligan;
MinionMulligan.enemyNumber = EnemyNumber;
MinionMulligan.enemyRect = RectMakeCenter(posi... |
2da34a72cddd1c9205e1829f0d1b1c48869c9742 | cfd720ebbe24b6190dbfc52fadcc16a48bde7370 | Manar-21/C-OOP | /ConsoleApplication28/Source.cpp | C++ | cpp | 9,175 | no_license | #include <iostream>
#include <string>
#include <iomanip>
#include <fstream> // write & read files
#include <sstream> // convert number of string to integer
using namespace std;
class Admin {
protected:
string username;
string password;
public:
int Choice;
void admin_login();
void admin_view();
};
... |
e5b3d99cdd6d43db334c8aced2c0862654d42d6c | ecdfccd0e2f7d1cc4474735722da36ebc675cbb7 | l-cadamuro/TauTagAndProbe | /TauTagAndProbe/test/fitter/src/TurnonFit.cpp | C++ | cpp | 8,396 | no_license | /**
* @file TurnonFit.cpp
* @brief
*
*
* @author Jean-Baptiste Sauvan <sauvan@llr.in2p3.fr>
*
* @date 05/10/2014
*
* @internal
* Created : 05/10/2014
* Last update : 05/10/2014 21:03:01
* by : JB Sauvan
*
* =======================================================================... |
4d9bd4854fc3a659d870cfed4134e673e533d35b | 4eb0e93a8bab301cfd7731f872fc989f2a9dbc9b | Zhatabsaifi/DS-and-Algorithms | /Binary Search/Number of rotations in a rotated sorted array.cpp | C++ | cpp | 647 | no_license | /*
Ques :-Number of rotations in a rotated sorted array...(elemnts are unique)
Method 1:- Time -O(n)
Theory:- Just finding the minimum element..
Method 2:- Time - O(log2n)
*/
void work()
{
int n;
cin>>n;
ll arr1[n];
for(int i=0;i<n;++i)
{
cin>>arr1[i];
}
int start=0,end=n-1,index=1;
while(star... |
b8155cab33f8202fbad085f966ae581700f785aa | 8a1dc8d02fb8dfdc955d6ad07fe7518beeb60865 | chavangorakh1999/LinkedListUsingCPP | /ValidPalindrome2/ValidPalindrome2/main.cpp | C++ | cpp | 950 | no_license | //
// main.cpp
// ValidPalindrome2
//
// Created by Gorakh Chavan on 10/04/20.
// Copyright © 2020 Gorakh Chavan. All rights reserved.
//
#include <iostream>
#include<string.h>
using namespace std;
class Solution {
public:
bool isPalindrome(string s) {
if(s.size()==0) return true;
in... |
d0de2968254a1a9971f67085aecd58fb7e3ab77c | 66b720ac0ad36b84938dd41b04717490fc6446b4 | niuxu18/logTracker-old | /second/download/curl/gumtree/curl_old_log_6325.cpp | C++ | cpp | 496 | no_license | fputs(
" port again.\n"
"\n"
" Passive mode means that curl will try the EPSV command first and\n"
" then PASV, unless --disable-epsv is used.\n"
"\n"
" --ftp-alternative-to-user <command>\n"
" (FTP) If authenticating with the USER and PASS commands fails,\n"
... |
8c0b91e1e19f44be42910c8b93c0cb1d48c138c6 | 6c5bad55e57c21d904468645f87d51c744e811ec | apple/swift-libcxx | /test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/param_ctor_iterator.pass.cpp | C++ | cpp | 3,082 | permissive | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
dcd12943c805bb08270c087eaf5865e0a2e619df | 6225d1768559f473129d37c255104e3030315d15 | wangfeng0301/Cpp_DataStructure_VS2010 | /DataStructure/src/tree.cpp | C++ | cpp | 3,125 | no_license | #include <stdio.h>
#include <stdlib.h>
#include "tree.h"
/*创建链式栈*/
static void CreatLinkStack(BinaryTreeStack_t *s)
{
s->top = NULL;//初始化栈顶为空
s->size = 0;//初始化栈大小为0
}
/*压栈*/
static void LSpush(BinaryTreeStack_t *s,BinaryTreeNode_t node)
{
BinaryTreeLinkList_t *linklist_node = (BinaryTreeLinkList_t*)malloc(sizeof(Bi... |
b89622ae1eb96ddb6bd3fedc072c9a709a0b4327 | 1e3d9f56cfa713a5a919ac0104baffc602481d2c | jer22/OI | /hdu/bestcoder19/1003/1003.cpp | C++ | cpp | 571 | no_license | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n, m, q;
int arr[1010][1010];
int sum[1010][1010];
int main() {
freopen("1003.in", "r", stdin);
while (~scanf("%d %d %d", &n, &m, &q)) {
memset(arr, 0, sizeof(arr));
memset(sum, 0, sizeof(sum));
char c = getchar()... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.