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 |
|---|---|---|---|---|---|---|---|---|
da54f77d5b9bd7462fdcdf4466a318f16290b6c5 | 8cde5cadf95e561dd6c779d7ef78509767096960 | PayvandH/Tonb | /Common/Foam/include/base/nonuniformTransformCyclicPolyPatch.hxx | C++ | hxx | 4,991 | no_license | #pragma once
#ifndef _nonuniformTransformCyclicPolyPatch_Header
#define _nonuniformTransformCyclicPolyPatch_Header
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration ... |
7d74be6e31fe6d8d4bf904a882bfea05f19087b3 | d3b932767b1377660acbaa24335faa97536554e6 | HHAJ98/COMP-B12 | /ClassWork/CareerPathwayPlan/CareerPathwayPlan.cpp | C++ | cpp | 742 | no_license | /*
Author: Ferraro, AJ
Assignment: Programming Assignment #01
Course: COMP B12
Instructor: Richard Miles
Date submitted: 2020/01/22
*/
#include <iostream>
using namespace std;
int main() {
cout << "Name:\n\tAJ Ferraro"<<endl;
cout << "Major:\n\tComputer Science"<<endl;
cout << "Ideal Job:\n\tSoftware dee... |
b53ac73c3fab2097752704f67965b1af3fcc18ad | 8035a81aead31330c2373098c83a8c4843d3dba4 | conset/ticket-system | /.localhistory/F/school/year4/courses/DBpractice/ticket system/ticket system/ticket system/1601885269$CTicketBiz.cpp | C++ | cpp | 875 | no_license | #include "CTicketBiz.h"
#include <stdlib.h>
CTicketBiz::CTicketBiz(int *pTicket, int nTotalNum)
{
m_pTicket = pTicket; //Point to the array that saves the ticket information
m_nTotalNum = nTotalNum; //Total ticket number
m_nSoldNum = 0; //Sold ticket number
m_nBalanceNum = nTotalNum; //Remaining ticket n... |
4d3d66740a53a65b4a7306479d438e6191d635d4 | 7e059956536f3ead554a174a31ed046fbefe733b | MasterScott/RED4ext.SDK | /include/RED4ext/Handle.hpp | C++ | hpp | 6,688 | permissive | #pragma once
#include <cstdint>
#include <type_traits>
#include <memory>
#include <tuple>
#include <Windows.h>
#include <RED4ext/Addresses.hpp>
#include <RED4ext/REDfunc.hpp>
namespace RED4ext
{
template<typename T>
class WeakHandle;
struct RefCnt
{
volatile uint32_t strongRefs;
volatile uint32_t weakRefs;... |
2b87eb863730f418c2d652fcc3c7ddf541daa8ae | c30da9a3dfefecda911fb07f411c489ee28e5a3f | Sekva/AED2 | /GRAFOS/PRIM/src/vertice.hpp | C++ | hpp | 524 | no_license | #ifndef VERTICE_HPP
#define VERTICE_HPP
class Vertice {
private:
int marcado;
Vertice** vizinhos;
int n_vizinhos;
int quantidadeVizinhos;
//atrubutos pra PRIM e DIJKSTRA
int custo;
Vertice *pai;
int distancia;
public:
int chave;
Vertice(int nVizinhos, int chave);
void add_vizinho(Vertice *... |
529530e43c924b14aa704f46d0f4332bf1346feb | c6f3d002046a1af2d3ceb6c80f380f0b53aff9e1 | tsutaj/cpp_library | /graph/graph_021_centroid.cpp | C++ | cpp | 4,259 | no_license | // 木の重心列挙 O(N)
// 重心を一つ求める O(N) (列挙よりも高速)
// 重心分解する
#include <cstdio>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;
using Graph = vector< vector<int> >;
const long long int MOD = 1000000007;
// 木の重心を列挙する
// 重心 v → v を根とした時に、 v の子を根とする部分木のサイズが全て N/2 以下である
// DFS をすることで容易に判定可能 O(N)
v... |
f5258e500b7f188578478c6dc74407ac5960e6ee | 569ba7c69fe10ad55890be52b5c4a2f3d6ab21e5 | Bazzadwarf/Graphics-II | /GraphicsRenderer/GraphicsRenderer/Framework.cpp | C++ | cpp | 527 | no_license | #include "Framework.h"
#include "Graphics.h"
int WINAPI WinMain(HINSTANCE hInstance,
HINSTANCE hPrevInstance,
LPSTR lpCmdLine,
int nCmdShow)
{
Graphics dxWnd = Graphics(hInstance, hPrevInstance, lpCmdLine, nCmdShow);
dxWnd.InitialiseDirectX();
dxWnd.Run();
return 1;
}
Framework::Framework(HINSTANCE & hInstance... |
43d126af233b106ff3837ed56321eb2de3088d86 | 74c9f12948a8e64ec89107dd24e83d3e49bfe3cc | locke12456/DDS-Sample | /lib/include/dcps/C++/isocpp/dds/topic/detail/find.hpp | C++ | hpp | 981 | no_license | /*
* OpenSplice DDS
*
* This software and documentation are Copyright 2006 to 2015 PrismTech
* Limited and its licensees. All rights reserved. See file:
*
* $OSPL_HOME/LICENSE
*
* for full copyright notice and license terms.
*
*/
/**
* @file
*/
#ifndef OSPL_DDS_TOP... |
da82c486334017888f4e0653850f56bb94747ba6 | ce7e44d3f60088b0ac905442db830b24d531e078 | Johannyjm/c-pro | /AtCoder/othercontests/old/cakesAndDonuts.cpp | C++ | cpp | 319 | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool flg = false;
for(int c = 0; c <= N / 4; ++c){
for(int d = 0; d <= N / 7; ++ d){
if(c * 4 + d * 7 == N) flg = true;
}
}
if(flg) cout << "Yes" << endl;
else cout << "No" << endl;
} |
75c73e3d1d90640f462548164b23f9d7b2be009e | f99d7a4599680ca65594c6073d6fbb4763a88b86 | Moong0122/problem-solving | /baekjoon/1916(최소비용 구하기).cpp | C++ | cpp | 1,438 | no_license | #include<iostream>
#include<queue>
#include<vector>
#define MAX 1001
#define INF 987654321
using namespace std;
struct ci{
int go;
int value;
};
struct cmp{
bool operator()(ci t1, ci t2){
return t1.value > t2.value;
}
};
vector<pair<int, int>> city[MAX];
bool check_vist[MAX];
int cost[MAX];
int... |
f277db283519120a88c8234e85116a2c0b9f4043 | c00f5fe258d75c32441ad1db805a307cee24e2d8 | mkerost/NppFTP | /src/FileObject.cpp | C++ | cpp | 5,140 | no_license | /*
NppFTP: FTP/SFTP functionality for Notepad++
Copyright (C) 2010 Harry (harrybharry@users.sourceforge.net)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version ... |
36c820ab9e0e67ef70da6717c057712fd7739190 | f7ce71426386970112a317c6835a70a950a66007 | nabeelsiddiqui314/VoxelCraft | /VoxelCraft/src/OGL/Core/Model.cpp | C++ | cpp | 1,650 | no_license | #include "Model.h"
#include <GL/glew.h>
Model::Model()
: m_vboCount(0),
m_ibo(0) {}
void Model::addMesh(const Mesh& mesh) {
cleanUp();
generateVAO();
bindVao();
addVBO(3, mesh.vertices);
addVBO(2, mesh.textureCoords);
addVBO(1, mesh.naturalLight);
addVBO(1, mesh.skyExposure);
addIBO(mesh.indices);
}
v... |
fae393575e16871104b563b0e8552d1ce075129f | d4491e004a0cd5351eb09e9fbc44cef3e96c89d6 | pierce-m/p4c | /frontends/p4/evaluator/substituteParameters.cpp | C++ | cpp | 1,932 | permissive | /*
Copyright 2013-present Barefoot Networks, 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 to in ... |
06888bd383e3a548f4170613c476f9cc2872e301 | 3e1d77b717ea58fe6e002dbc968724a431e54d3f | phenixwutao/DemoProjects | /linux_Programming/AlgorQuestions/1_Roman_numbers.cpp | C++ | cpp | 4,195 | no_license | #include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
int RomanToInt(string roman) {
int number = 0;
char prev = '\0';
for (auto letter : roman) {
if (letter == 'I') {
number++;
prev = 'I';
} else if (letter == 'V') {
... |
9d915082660e5fa0dcb2f0ad2c40506c0f542824 | df37c30c8d7a1bc62aceed341ae97f3c31a1f132 | Thompson-NO3/chromium | /content/browser/gpu/gpu_ipc_browsertests.cc | C++ | cc | 12,935 | permissive | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/command_line.h"
#include "base/run_loop.h"
#include "base/task/post_task.h"
#include "build/build_config.h"
#include "components/viz/common... |
944e510fc7c37898bd9fa86f3ce5385b548068e9 | 1e430c5514b1ae07d77c8aa0e78d9b630c80005f | kaitoops/pyeos | /programs/cleos/main.cpp | C++ | cpp | 55,769 | permissive | /**
* @file
* @copyright defined in eos/LICENSE.txt
* @defgroup eosclienttool EOSIO Command Line Client Reference
* @brief Tool for sending transactions and querying state from @ref nodeos
* @ingroup eosclienttool
*/
/**
@defgroup eosclienttool
@section intro Introduction to cleos
`cleos` is a comma... |
f218af7ae8a3e884946614ab655793d521cbaf6c | 080bdeadb991d8dd18791fe6b4f7e551026b7a22 | kunal121/C-And-Cpp-Questions | /Mohit Bansal/C++_Programs/pointer_data_function.cpp | C++ | cpp | 349 | no_license | #include<iostream>
using namespace std;
class test
{
public:
int x;
void dis()
{
cout<<x;
}
};
/*int main()
{
test t;
test *p;
p=&t;
int test::*dp=&test::x;
t.*dp=20;
t.dis();
p->*dp=50;
p->dis();
}
*/
int main()
{
test t;
void (test::*fp)()=&test::dis;
... |
b7aa3bedf86f28a70502c3557119588bdc645a7b | 1843b9b6a1dc05668eeb81ce3b13fb0e241c192c | mbrenesn/MHPC-ICTP-SISSA-Proj | /src/parallel-petsc-slepc/comm_full/main.cc | C++ | cc | 6,086 | no_license | #include <iostream>
#include "basis.h"
#include "hamiltonian.h"
#include "sparse_hamiltonian.h"
#include <petsctime.h>
int main(int argc, char **argv)
{
//PetscLogDouble mem = 0.0;
unsigned int l = 26;
unsigned int n = 13;
double V = 0.2;
double t = -1.0;
Basis basis(l,n);
// Sparse hamiltonian testi... |
9768044ded074a21eb221a31a1d8e0877d3858e4 | f5fc24ee901e3ccca932489a29c382f6268c8210 | CHIPO-Project/OmotenashiCoin | /src/qt/test/test_main.cpp | C++ | cpp | 1,299 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2017-2018 The PIVX developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-lic... |
ef12bdf12e8fb40f1eb74c7a1b21cc1d4d7ec5fb | 67e97e9d7bd9f6df1e473f69489c98a13f3a4e3d | dhanainme/triton-inference-server | /src/servers/http_server.cc | C++ | cc | 85,888 | permissive | // Copyright (c) 2019-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 ... |
62a629d98bc868c45859ac5077060bac1ce076ac | 632cba43c36474184f1fcb82c921a7f0320ffa57 | wzppengpeng/leetcode_solution | /string/824.cpp | C++ | cpp | 2,253 | no_license | /**
* A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.
We would like to convert the sentence to "Goat Latin" (a made-up language similar to Pig Latin.)
The rules of Goat Latin are as follows:
If a word begins with a vowel (a, e, i, o, or u), a... |
cc8dc63e9bb1cee2af95dc62339f25b84dee5ad3 | b8ce880f13df07becdcce05820f357e4a53cc7de | 2997ms/Competitive-programming-problems | /POJ/1328/10890269_PE.cpp | C++ | cpp | 1,129 | no_license | #include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
struct ss
{
double x,y;
}a[1005];
int cmp(ss x,ss y)
{
if(x.x==y.x)
return x.y<y.y;
else return x.x<y.x;
}
int main()
{
int island,count,result=0,flag=0,R,island_x[1005],island_y[1005];
double radar;
cin>>island>>R;
wh... |
0e74188732d5cd48734ab5421ab157440eba1831 | b4d2eed7af578a0dab294ad76b405636f1914912 | hmailserver/hmailserver | /hmailserver/source/Server/COM/InterfaceRuleCriteria.cpp | C++ | cpp | 5,078 | no_license | // Copyright (c) 2010 Martin Knafve / hMailServer.com.
// http://www.hmailserver.com
#include "stdafx.h"
#include "InterfaceRuleCriteria.h"
#include "../Common/BO/RuleCriteria.h"
#include "../Common/BO/RuleCriterias.h"
#include "../Common/Persistence/PersistentRuleCriteria.h"
#include "COMError.h"
STDMETHODIMP In... |
8ab25b1b1def31975d5a5dd33b5fb22a0cfec3a4 | f8bc69d722d759a6b0eb5c0193057b24636d99f1 | anshumang/ucx | /bindings/java/src/main/native/ucp_constants.cc | C++ | cc | 1,127 | permissive | /*
* Copyright (C) Mellanox Technologies Ltd. 2019. ALL RIGHTS RESERVED.
* See file LICENSE for terms.
*/
#include "org_ucx_jucx_ucp_UcpConstants.h"
#include <ucp/api/ucp.h>
#define JUCX_DEFINE_CONSTANT(_name) do { \
jfieldID field = env->GetStaticFieldID(cls, #_name, "J"); \
env->SetStaticLongField(cls,... |
e683cce0d3890ab52cc0ada0a43c86867ab9a05e | c5fbd98e0dc4de954f64d616b289897a8e574d48 | hqh41/IVA | /IVA/build-Histograms-Desktop_Qt_5_7_0_GCC_64bit-Debug/moc_QcvHistograms.cpp | C++ | cpp | 13,979 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'QcvHistograms.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.7.0)
**
** WARNING! All changes made in this file will be lost!
*******************************************************... |
c96d3f82c369908764529c02d1fc6da5da743a14 | fbd541d67254125280d36a274177024a10cd87db | bincker/dalvik | /vm/offload/branchBak/MethodParser.cpp | C++ | cpp | 95,399 | permissive |
#include "Dalvik.h"
#include "CustomizedClass.h"
#include "libdex/DexCatch.h"
int MaxBranchDepth = 10;
unsigned int MaxSubCount = 15;
extern std::vector<DvmDex*> loadedDex;
extern ClassObject* javaLangObject;
extern std::vector<ClassObject*>* exemptClzs;
extern std::vector<ClassObject*>* exemptIfs;
std::vector<Objec... |
cdea8a2b911800711bdfc7990a79bf98c9b6f399 | 05597428225f519f50787a57758471edd0d65bb5 | xobe01/Reference_Projects | /Torpedo/staticText.cpp | C++ | cpp | 566 | no_license | #include "staticText.hpp"
#include "widget.hpp"
#include <string>
using namespace genv;
using namespace std;
staticText::staticText(int x_, int y_, int side_,int frame_, string wText_) : widget(x_,y_,side_,frame_), wText(wText_){}
void staticText::draw()
{
gout<<move_to(x,y)<<color(255,255,255)<<text(wText);
}
bo... |
c440eab5ead19b914cfcedc1b664a21a8a523753 | bc44611470dacccd2dcb1410075d380c2d44218f | tingyingwu2010/Operation-Research | /final.cpp | C++ | cpp | 1,146 | no_license | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define bM 1000000.0
int main()
{
int n;
cout << "Enter the number of rows and columns, i.e, the number of workers and tasks : ";
cin >> n;
int **a1 = new int *[10];
for (int i = 0; i < 10; i++)
{
a1[i] = new int[10];
... |
b0d5ec4956d76ebfdc4def4b77aa39de8b28fd6d | 92d5c046b49b9b8b0b93d46b6c246a0d9b5b0357 | clahul-9/lab-env | /projects/Mesh_resources/code/MeshResource.cpp | C++ | cpp | 1,000 | permissive | #include "MeshResource.h"
#include "GL/glew.h"
MeshResource::MeshResource(){}
int MeshResource::vertexBuffer(vertex v[], int size) {
unsigned int vbo;
glGenBuffers(0, &vbo);
glBindBuffer(GL_ARRAY_BUFFER, vbo);
unsigned int buffersize = sizeof(float)*7 * size;
glBufferData(GL_ARRAY_BUFFER, buffersize, (float*)... |
2c663a8f358b5ad88e0d10142e8e287de22a48ae | 5e33d169e46deaea1c4d0ad923b3c696fbc5db26 | artas360/pythran | /pythran/pythonic/include/numpy/tri.hpp | C++ | hpp | 448 | permissive | #ifndef PYTHONIC_INCLUDE_NUMPY_TRI_HPP
#define PYTHONIC_INCLUDE_NUMPY_TRI_HPP
#include "pythonic/utils/proxy.hpp"
#include "pythonic/types/numpy_type.hpp"
#include "pythonic/types/ndarray.hpp"
namespace pythonic
{
namespace numpy
{
template <class dtype = double>
types::ndarray<typename types::numpy_type... |
9a1400809258f281198c7e92d10a45d89114c8d0 | b9ea0f96543f46d5a1a444f9b1ea85594b828e91 | ShihabShafkat/c- | /prims.cpp | C++ | cpp | 1,388 | no_license | #include<bits/stdc++.h>
using namespace std;
struct nodes{
int number;
int weight = INT_MAX;
int parent = -1;
bool operator < (const nodes &a)const{
return weight > a.weight;
}
};
int connection[100][100];
int main(){
int vertex, edge, cost = 0, x, y, z;
cout<<"Vertex: "... |
c4e3818a8a70f6abaa289915bf61e1fa1ebe6a1c | 18cbcfdc9603869c1dcae77ceea9b3985eb55d8c | SHOAIBAHMED12842/INTENSIVE-C-PROGRAMMING-UNIT | /LOOPS/hollow mirrored inverted right triangle.cpp | C++ | cpp | 815 | no_license | #include <stdio.h>
int main()
{
int i, j, rows;
/* Input rows to print from user */
printf("Enter number of rows : ");
scanf("%d", &rows);
for(i=1; i<=rows; i++)
{
/* Print leading spaces */
for(j=1; j<i; j++)
{
printf(" ");
}
... |
9f912f053db2506ae33949fc4f75cb5462943bd7 | 1f08982a958b7fbc0e020cb8e11f7359207a3db9 | tyler124/thunderborg_driver_cpp | /main.cpp | C++ | cpp | 746 | no_license | #include <iostream>
#include "ThunderborgDriver.hpp"
#include "MotorController.hpp"
#include "chrono"
#include "thread"
int main()
{
ThunderborgDriver thunderborgDriver;
thunderborgDriver.initialize();
MotorController motorController(thunderborgDriver);
char letter;
while (letter != 'q')
{
... |
fb91a25ca72fd787697c94f6007fad0f88dbe556 | a75681b1303121d3d918aae9d0f6af4917034c4a | Try/OpenGothic | /game/dmusic/hydra.cpp | C++ | cpp | 11,451 | permissive | #include "hydra.h"
#include "dlscollection.h"
#define TSF_IMPLEMENTATION
// #define TSF_STATIC
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wconversion"
#include "tsf.h"
#pragma GCC diagnostic pop
#else
#include "tsf.h"
#endif
using namespace Dx8;
enum {
kTerminatorSampleLength=46... |
e50e09d35aabe6fc8cc670a2cd9e0c90716547e6 | e9d5957c0d8aecd5246f41469f5bf82998a7ebfc | algo-data-platform/PredictorService | /thirdparty/proxygen/proxygen/lib/http/codec/HTTP2Framer.cpp | C++ | cpp | 28,810 | permissive | /*
* Copyright (c) 2015-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
*/
#inc... |
d834b09346fe3136aec5d452750ded661a8a8d01 | e5e299b7b5f4be2338615ab0d3a801dadd1a6607 | Lightnet/cmakesdl2window | /SDL2Window.cpp | C++ | cpp | 3,216 | no_license | #include "SDL.h"
#include <SDL_ttf.h>
// https://stackoverflow.com/questions/22886500/how-to-render-text-in-sdl2
int main(int argc, char *argv[])
{
SDL_Init(SDL_INIT_VIDEO);
const int WIDTH = 640, HEIGHT = 480;
SDL_Window *window = SDL_CreateWindow(
"SDL2Test",
SDL_WINDOWPOS_UNDEFINED,
SDL_WINDOWPOS_... |
e90a250651b4f6dd1bf1ae4b11bfcd068d9203f1 | 1fb9aa58117161446e690790954dfee2f83e7414 | jagsader13/csc245 | /Prac/Prog4/LinkedList.cpp | C++ | cpp | 3,861 | no_license | using namespace std;
/**
* Construct the list
*/
template <class Object>
List<Object>::List( )
{
header = new ListNode<Object>;
}
/**
* Copy constructor
*/
template <class Object>
List<Object>::List... |
f493b15b8e16f72b585c19105568a91cbb26e3c9 | 434f9f7c444b84c85af191db72c59e79f3e476e4 | sysfce2/SFML_Hexagon-Engine_ege | /ege/scene/TilemapObject.cpp | C++ | cpp | 1,566 | permissive | /*
*
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*
* ,---- ,---- ,----
* | | |
* |---- | --, |----
* | | | |
* '---- '---' '----
*
* Framework Library for Hexagon
*
* Copyright (c) Sppmacd 2020 - 2021
*
* Permission is ... |
a4ab16462f95c9ec71ab03097af1a919f4cb9df4 | 14f70dd2396d9f353f7d3d8f4eae5de9829b3c40 | laanak08/cpplox | /project/src/ast_printer.hpp | C++ | hpp | 640 | permissive | #pragma once
// Related header
// C standard headers
// C++ standard headers
#include <string>
// Third-party headers
// This project's headers
#include "expression_visitor.hpp"
namespace motts { namespace lox {
class Ast_printer : public Expr_visitor {
public:
void visit(const Binary_expr*) o... |
ee752a40c2419ce0752d33a2ec4c9d1a219a3e63 | 3bf4761589392fb765f9152ad7b243fcc8af40f8 | phong2018/Cplusplus | /002.DAY_QUANG_US/017.FOCUS/MAIN.CPP | C++ | cpp | 1,732 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i+... |
2403c9f422f0142d12512555edeb56ef65402f60 | 47cef21376851266ea384f83a2a3bd0aeb224111 | wyjstar/LimeSuite | /src/utilityTools/RxTest.cpp | C++ | cpp | 23,735 | permissive | #include "LMS7002M.h"
#include "IConnection.h"
#include "ConnectionRegistry.h"
#include <iostream>
#include <iomanip>
#include "ErrorReporting.h"
#include "pllTest.h"
#include <getopt.h>
#include <string>
#include <algorithm>
#include <cctype>
#include <fstream>
#include <chrono>
#include <assert.h>
#include <thread>
#... |
1180d0295bc6cba30d370857d04c00ff192861f4 | 42aa9473a5c125626a9cce24bc47495ed88fd5b3 | OpenEngineDK/extensions-LevelSet | /LevelSet/SDF.cpp | C++ | cpp | 8,174 | no_license | #include "SDF.h"
#include <Logging/Logger.h>
#include <LevelSet/CPUStrategy.h>
#include <Utils/Timer.h>
namespace OpenEngine {
namespace LevelSet {
using namespace OpenEngine::Utils;
void Compare( Tex<Vector<2,float> > &g, Vector<2,float> &p, unsigned int x, unsigned int y, int offsetx, int offsety ) {
Vector<2,flo... |
6d00912d0b354784eca381b82ecc9a17d2d0c77a | f6c604126fe4598cd38288804a50c4a72f56f507 | plncoin/plncoin-old-dont-work | /src/rpcrawtransaction.cpp | C++ | cpp | 21,116 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <boost/assign/list_of.hpp>
#include "base58.h"
#include "bitcoinrpc.h"
#inclu... |
1b7c4468e0a2dfe137e06a7ed791604aae31d4fc | ec099a3b556bdb681fa1a562300ae3d0f734157c | serpi90/RedesIV2014 | /Ejercicio8/E8V0/iEmbotelladora.cpp | C++ | cpp | 973 | no_license | #include "iEmbotelladora.h"
#include "Helper.h"
#include <sstream>
iEmbotelladora::iEmbotelladora(long numero)
{
std::stringstream ss;
this->numero = numero;
this->id = M_EMBOTELLADORA + numero;
ss << "iEmbotelladora " << this->numero << " (" << this->id << ")";
this->owner = ss.str();
in = new... |
591b66f8d66dd97dd05a7b6dbd7f67ed96bcb5e6 | cf6af578cf285faceb4cd5e01e1c0f565b007190 | attainer/SimpleParallel | /SimpleParallel/Src/Partitioner/StaticPartitioner.cpp | C++ | cpp | 1,240 | permissive | #include "Partitioner/StaticPartitioner.h"
#include "Scheduler/Scheduler.h"
#include <assert.h>
namespace SimpleParallel
{
StaticPartitioner::StaticPartitioner()
{
}
StaticPartitioner::~StaticPartitioner()
{
}
StaticPartitioner* StaticPartitioner::get()
{
static StaticPartitioner partitioner;
return &pa... |
04465a9c3c6f761528331a66fe1955290fd714bb | 6c18c1bef51f709ce680e0e988437a5ac2cb4bb2 | ChenLu1211/Electronic-trading-system | /RandH/RandH/Product.cpp | C++ | cpp | 1,900 | no_license | #include "product.h"
#include "seller.h"
long int Product::counter = 1000;
Product::Product(const string& productName, double price, Product::eProductsCategory pc)
{
_price = price;
_theSeller = nullptr;
setName(productName);
setCategory(pc);
_serialNo = ++counter;
}
//--------------------------... |
5343ac7b068c6b59ca2200d8becf334b2f9256b6 | 48228137c4b727b1be65e243a77feeb7bf6a39c8 | tomscut/fastpr | /Coordinator.hh | C++ | hh | 2,182 | no_license | #ifndef _COORDINATOR_HH_
#define _COORDINATOR_HH_
#include "include.hh"
#include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <set>
#include <thread>
#include <unordered_map>
#include <sstream>
#include <string>
#include <assert.h>
#include <arpa/inet.h>
#include <math.h>
#include <net... |
d000fc2d2bb64f6a365444cf344ad064a1aa8700 | 00c2403ec4a54c1ecbe2cb29245282b174c9ad96 | AnnaMyak/pasys | /sequentiel _ hough.cpp | C++ | cpp | 3,042 | no_license | #include<iostream>
#include<cmath>
#include<opencv2/imgproc/imgproc.hpp>
#include<opencv2/highgui/highgui.hpp>
#include "opencv2/imgcodecs.hpp"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sys/stat.h>
#include <iostream>
#include <vector>
#include <fstream>
#include <sstream>
#include <opencv2/h... |
2cd5f89a74d63223a261188159bb869cae846ddb | 4e68be90fe8b57bc2936da30dabaaca97499de0e | gp-b2g/hardware_qcom_display | /liboverlay/badger/src/overlayRes.cpp | C++ | cpp | 2,109 | no_license | /*
* Copyright (c) 2011, Code Aurora Forum. 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... |
36c1c39d31c68bcdad054c28e4b41819c1aac74f | 0f991710ba54f0cdbafa4a83d140657cd30dc537 | NoGameNoLife00/tink | /service/service_harbor.cpp | C++ | cpp | 18,808 | no_license | #include <string_view>
#include <sstream>
#include "net/harbor.h"
#include "net/server.h"
#include "base/base_module.h"
#include "error_code.h"
#include "harbor_message.h"
namespace tink::Service {
class ServiceHarbor : public BaseModule {
public:
static constexpr int STATUS_WAIT = 0;
static co... |
4740404f6446ea6debdf3531a4004d461e0b9e2d | 83735018ec70c20d879d7b382ddf12e5c84312dc | capeanalytics/aws-sdk-cpp | /aws-cpp-sdk-s3/source/model/Delete.cpp | C++ | cpp | 2,314 | permissive | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... |
0612798dcebf52e7c8614c0a4121ee44b71cf686 | 38ee3357648376b766ff8eb9696ff265a98bc6af | Mike-Devel/stacktrace | /include/boost/stacktrace/safe_dump_to.hpp | C++ | hpp | 9,094 | permissive | // Copyright Antony Polukhin, 2016-2018.
//
// 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)
#ifndef BOOST_STACKTRACE_SAFE_DUMP_TO_HPP
#define BOOST_STACKTRACE_SAFE_DUMP_TO_HPP
#include <boost/config.hpp>
#ifdef... |
0517181eda60cabb35a74b77dbdbfe0032ff6112 | 9e972a0d8103d9adb1e0c5afe53e34549c9a1180 | myousefi2016/PyChaste | /dynamic/wrappers/cell_based/CellLabel.pypp.cpp | C++ | cpp | 2,631 | no_license | // This file has been generated by Py++.
/*
Copyright (c) 2005-2016, University of Oxford.
All rights reserved.
University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.
This file is part of Chaste.
Redist... |
4cd3c917f81b299db4a03a809e1bcf1a6143823d | d225651262cd532d378e0eaac5483cdc1cd55246 | sunny-lan/cpp-contest | /959B.cpp | C++ | cpp | 700 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAXN 100000
string w[MAXN];
int c[MAXN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k, m;
cin >> n >> k >> m;
for(int i = 0; i < n; i++)
cin >> w[i];
for(int i = 0; i < n; i++)
cin >> c[i];
unordered_map<string, int... |
3f6b99605bac4462cfaf29673442e6faa209b272 | 1998bb725c549e2b9f8730579ad32ba6a03f7031 | amine-abdeljaoued/PoXemon | /campusmap/fights/Images/Animation_Earth/Super_Rock_1.cpp | C++ | cpp | 14,798 | no_license | #include <SFML/Graphics.hpp>
#include <iostream>
#include <SFML/Window.hpp>
#include <string>
#include <SFML/Window.hpp>
#include <SFML/Graphics.hpp>
#include <iostream>
#include <SFML/Window.hpp>
#include <string>
void main(int argc, char** argv[]) {
sf::RenderWindow window(sf::VideoMode(1400, 700), "My window");
... |
1806759ffb87fd59beb706c4f88fcda7da912dba | bfd1779d1d15257e15f4bb3baeb0ea200a0fac73 | jacmoe/dsa-hl-svn | /rl/trunk/engine/rules/src/StepRecognitionMovement.cpp | C++ | cpp | 9,952 | permissive | /* This source file is part of Rastullahs Lockenpracht.
* Copyright (C) 2003-2008 Team Pantheon. http://www.team-pantheon.de
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the Clarified Artistic License.
*
* This program is distributed in the hope that it will ... |
ac0488756cdf3b13fab9892d0156812acb30d677 | ae48e848ac05a5e0efca4e0466f0f2fee3f80ef9 | Takiwa-i/Atcoder | /ABC/151/C.cpp | C++ | cpp | 570 | no_license | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
int main(void)
{
int n, m;
int p;
int suc = 0;
int pen = 0;
std::string s;
std::cin >> n >> m;
std::vector<int> WA(n, 0);
std::vector<int> AC(n, 0);
for (int i = 0; i < m; i++)
{
std::cin >> p;
std::cin >> s;
if (s == "AC" &&... |
3ca02780cb1505321e1f831a0689a3c5a33a71f6 | dfa2fd53224dd572d8623e733575386d8469d4c0 | longmiaohao/Asus-Fx60vm-clover | /__MACOSX/CLOVER/kexts/10.13/Lilu.kext/Contents/Resources/Headers/kern_api.hpp | C++ | hpp | 6,819 | no_license | //
// kern_api.hpp
// Lilu
//
// Copyright © 2016-2017 vit9696. All rights reserved.
//
#ifndef kern_api_h
#define kern_api_h
#include <Headers/kern_config.hpp>
#include <Headers/kern_patcher.hpp>
#include <Headers/kern_user.hpp>
#include <Headers/kern_util.hpp>
#include <stdint.h>
#include <sys/types.h>
#include... |
fc12b182b65019c78d72745dada9bd45bb28788c | 91adbf29185609eec75de44c5fd47a64d45d41be | ddhruvkr/Codes | /C++/josephusuniversal.cpp | C++ | cpp | 309 | no_license | # include <cstdio>
# include <conio.h>
using namespace std;
int josephus(int n, int k)
{
int r = 0;
int i = 2;
while (i <= n) {
r = (r + k) % i;
k++;
printf("%d ",r);
i+= 1;
}
printf("\n");
return r+1;
}
int main()
{
printf("%d\n",josephus(6,1));
getch();
return 0;
}
|
ead8b5b3cce86639874f290472b20e8d88ebccec | 61767a5da71d98a45e46e09573a59ac06c15ddef | Saitouyukihiro/3DGame_Progress | /program/エフェクト/Model.cpp | C++ | cpp | 14,345 | no_license | //ーーーーーーーーーーーーーーーーーーーーーーーーー
//モデル(プレイヤー)の処理(Model.cpp)
//Author：佐藤秀亮
//ーーーーーーーーーーーーーーーーーーーーーーーーー
//インクルードファイル
#include "main.h"
#include "input.h"
#include "Model.h"
#include "Shadow.h"
#include "camera.h"
#include "Billboard.h"
#include "Bullet.h"
#include "Object.h"
#include "Effect.h"
#include "Enemy... |
c3ba6d341daf4c5ee81bc75d42191bc1306affdb | c325eb54333c5af70a7fe5f746cc9d3a99880e44 | AlonSh/seminar-in-defensive-programming | /seminar-program/cpp-client/src/client.cpp | C++ | cpp | 2,441 | no_license | //
// Created by Alon Shenkler on 10/13/18.
//
#include <string>
#include <Poco/Net/HTTPRequest.h>
#include <Poco/Net/HTTPResponse.h>
#include <Poco/Net/HTTPSClientSession.h>
#include <Poco/Net/SSLManager.h>
#include <Poco/Net/Context.h>
#include <Poco/JSON/Object.h>
#include <Poco/JSON/Parser.h>
#include <Poco/URI.h>... |
eaa718de76c6c9199b0e004d223497852cf77ae5 | 70ddf77eea335fbc6eb46ab148e9e22638455fae | dawithw/cookbook | /Preparation.cpp | C++ | cpp | 6,152 | permissive | #include "COP3503su14_Proj3_Preparation_WoldegiorigsD.h"
// ----------------------- STEP ----------------------- //
// Constructor: Default
Step::Step()
{
equipment_added = false;
}
// This function adds a word to the step.
void Step::add(std::string word)
{
if (equipment_added)
step_after += word;... |
e88346e327a014dcb34487fd84cfdbceefb3a439 | 4b1369b88556c970e1bb9a6c34f7594f83ef4deb | av4625/cpp-design-patterns | /factory/bombed_maze_game.hpp | C++ | hpp | 574 | no_license | #ifndef FACTORY_BOMBED_MAZE_GAME_HPP
#define FACTORY_BOMBED_MAZE_GAME_HPP
#include <maze_game.hpp>
class bombed_maze_game : public maze_game
{
public:
// Factory methods
virtual std::shared_ptr<room> make_room(int room_num) const
{
// This function would make a bombed room not a room
retur... |
6895b8b59bff1f96491f0525e12ea7de13ad6e17 | 6d2440ceca35e296c8a07eeaee3ab45a02aa6deb | jjzhang166/BOSS_ExternalLibs | /geant4/G4EvaporationGEMFactory.hh | C++ | hh | 2,488 | no_license | //
// ********************************************************************
// * License and Disclaimer *
// * *
// * The Geant4 software is copyright of the Copyright Holders of *
// * the Geant4 Collaboration... |
06e464a1c124bd3273b833b18bd3170d78565073 | 9e6326b431a9f2330e93148c43a8db0da709feea | weijietong/ClickHouse | /src/Interpreters/parseColumnsListForTableFunction.cpp | C++ | cpp | 4,925 | permissive | #include <Parsers/ASTExpressionList.h>
#include <Parsers/ParserCreateQuery.h>
#include <Parsers/parseQuery.h>
#include <Interpreters/InterpreterCreateQuery.h>
#include <Interpreters/Context.h>
#include <Interpreters/parseColumnsListForTableFunction.h>
#include <DataTypes/DataTypeLowCardinality.h>
#include <DataTypes/Da... |
1c3932e5cee264035f4eb6b86f3ceda490546ea9 | b6980ddce87564e1c906ee96b24078debb6d0321 | George100Neres/Logica-de-Programacao | /Case-Break/teste.cpp | C++ | cpp | 304 | no_license |
#include<stdio.h>
int main() {
char personagem [100];
char retorno ;
printf("Escolha qual dos personagens Do Valorant vc gosta Mais");
scanf("%s",personagem);
retorno= 'A' ;
if (retorno == 'C'){
printf("Vc e Baiano");
}
else if(retorno == 'R')
printf("Voce e Raze");
}
|
d387cd844b4da7d4634e45bc8e8ded8ea2d787bb | a36fe8d127887c0d81e59617be122138b44d7d51 | SahajV/computervision-2019 | /lab3/ac_lab2.cpp | C++ | cpp | 8,377 | no_license | //Aadith Charugundla
//Computer Vision Period 3 Lab 1
#include <iostream> //input output stream
#include <fstream> //filestream
#include <cstdlib> //C Standard Genral Library
#include <cmath>
#include <time.h>
#include <algorithm>
#include <bits/stdc++.h>
#define R 800 //rows and columns
#define C 800
#define N 20
... |
645dcaa4b806dce78ede34b490094aa586a98234 | 985368c13d062d3d48bdaa21289efcc3a2220d5b | KiiSparrow/LeetCode | /LeetCode/LC188 Best Time to Buy and Sell Stock IV.cpp | C++ | cpp | 800 | no_license | #include "LeetCode.h"
using namespace std;
static const auto ioSyncOff = []()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
return 0;
}();
class Solution
{
public:
int maxProfit(int k, vector<int>& prices)
{
if (k == 0)
return 0;
if (k >= 2 * prices.size())
{
int ans = 0;
for (int ... |
49dca3ef0c2cd08dc00b0daee370f05ae5a878cc | d0dbfc5eb124e34ebce280805035d2a3f12544b1 | remi205/nacelle-2016-ascii | /Src/over-hal/gpio_access.cpp | C++ | cpp | 2,165 | no_license | #include "gpio_access.h"
GPIO_TypeDef * GpioTable[] = {GPIOA, GPIOB, GPIOC , GPIOD, 0 ,GPIOF};
static GPIO_TypeDef * gpio_getport( unsigned int gpio_number)
{
return GpioTable[gpio_number / 16];
}
static unsigned short gpio_getbit( unsigned int gpio_number)
{
return 1<< gpio_number % 16;
}
void ... |
6fecb42f0eef78419ce7f9514878bf1265c66343 | 557587a1a23af1d1630aa2bd0aeb9ec7c1f48c8f | hipros/BOJ | /9465 스티커/9465.cpp | C++ | cpp | 878 | no_license | #include<iostream>
#include<vector>
using namespace std;
int main()
{
int T;
cin >> T;
for (int k = 0; k < T; k++) {
int N;
cin >> N;
vector<vector<unsigned long> > table(2, vector<unsigned long>(N, 0));
vector<vector<unsigned long> > dy(2, vector<unsigned long>(N, 0));
for (int i = 0; i < ... |
6a3044375f2f73f26a7e740813bbc122fb2553f1 | 31a190a7b2961ad2a9d4513587923b4498917217 | juliannehong/algorithm-and-datastructure | /array-and-string/rotateArray.cpp | C++ | cpp | 1,153 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void rotate(vector<int>& nums, int k) {
vector<int> temp;
if (nums.size() < k)
k = k - nums.size();
for (int i = nums.size()-k; i < nums.size(); ++i)
temp.push_back(nums[i]);
for (int i = 0; i<nums.size()-k; ++i)
temp.... |
617456c622d7a612505b580019c382a19db9f7d9 | 9048e7d59ee9c614e7a4e636c445c970b96df1e1 | koosaga/olympiad | /JOI/open17_bulldozer.cpp | C++ | cpp | 2,050 | permissive | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
struct sweep{
int dx, dy, idx1, idx2;
int mode(){
return pi(dx, dy) < pi(0, 0);
}
bool operator<(const sweep &s)const{
lint k = 1ll * dx * s.dy - 1ll * dy * s.dx;
if(k != 0) return k > 0;
return pi(idx1, idx2) ... |
c5fe86e7a9aa8ca3ce7ff6c92bc81517af8a0d2f | 18e34fbad1a35a286bc5313e121d1f19b781cf5b | tsp1998/CPP | /cpp/Hybride.cpp | C++ | cpp | 1,083 | no_license | #include <iostream>
using namespace std;
class eshopping
{
public:
char name[10];
void get()
{
cout << "\n Enter name of thing=";
cin >> name;
}
void display()
{
cout << "\n things=" << name;
}
};
class amezone : public eshopping
{
public:
int size;
void getamezone()
{
cout << "\n... |
73a3f967506c99345b8ecfccdd95bba9ea3deb4f | cc7f3d10385ab4c818c993c78144ebc69fc3f528 | cies96035/CPP_programs | /UVA/已通過/uva11946.cpp | C++ | cpp | 405 | no_license | #include<iostream>
using namespace std;
int main()
{
int T;
char alpha[10]={'O','I','Z','E','A','S','G','T','B','P'};
bool end=0;
cin>>T;
char k;
cin.get();
while(T)
{
cin.get(k);
if(k>='0'&&k<='9')
cout<<alpha[k-'0'];
else
{
if(!(k=='\n'&&T==1&&end))
cout<<k;
if(k=='\n')
{
if(!end)... |
86b84e65d3f49329d54d1644f52ab0cf4834796b | d8ff3a9b168d300d1ed2cd714df6c55cc667e0d5 | KqSMea8/sstd_library | /sstd_boost/sstd/boost/geometry/index/distance_predicates.hpp | C++ | hpp | 8,389 | permissive | // Boost.Geometry Index
//
// Spatial index distance predicates, calculators and checkers used in nearest neighbor query
//
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
//
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt... |
2c68efa503798f06ea64d16bf0383596cce176f0 | 7342f4ac2ed4895f41690c5dcf763cc3c900e886 | ArpitaChatterjee/tensorflow-1 | /tensorflow/core/data/dataset_utils.cc | C++ | cc | 34,307 | permissive | /* Copyright 2017 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... |
b0287f2248e2b52e213cce809be82389bc84e38f | eef74be67bea0ce6bd17d9e0a049bbbfad9ea013 | simonpintarelli/2dBoltzmann | /src/spectral/basis/spectral_basis_factory_base.hpp | C++ | hpp | 585 | no_license | #pragma once
#include "spectral/basis/spectral_elem.hpp"
#include "spectral/basis/spectral_basis.hpp"
#include "traits/type_traits.hpp"
namespace boltzmann {
template <typename AngularBasisFunction, typename RadialBasisFunction>
struct SpectralBasisFactoryBase
{
typedef AngularBasisFunction fa_type;
typedef Radi... |
e7193368f068507bc3664cf4eea054b0b0bc3810 | 052b1067ed2ded5e933881aca335b222d1bea1a6 | pennomi/panda3d | /dtool/src/cppparser/cppInstanceIdentifier.cxx | C++ | cxx | 8,224 | 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 cppInstanceIdentifier.c... |
48d7eaea8204618030ad7063dd427b7a19d69926 | 628525656d37cd95021fe3fde9246fe120f2bd53 | LiuYongQiang6/ZLMediaKit | /tests/test_player.cpp | C++ | cpp | 3,865 | permissive | /*
* MIT License
*
* Copyright (c) 2016-2019 xiongziliang <771730766@qq.com>
*
* This file is part of ZLMediaKit(https://github.com/xiongziliang/ZLMediaKit).
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), ... |
84c83e74a7dc8ea0cf0dc85fad7424b0cd630666 | b38fe2747737bf80bcd73c5a0d51374401c3c7dd | QPC-database/aws-sdk-cpp | /aws-cpp-sdk-waf/source/model/UpdateByteMatchSetResult.cpp | C++ | cpp | 976 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/waf/model/UpdateByteMatchSetResult.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <aws/core/AmazonWebServiceResult.h>
#include <aws/core/utils/StringUtils.h>
#include <aws/c... |
59e4e45692de6e3bb916e632dc52e6d2e47e76cf | baa5e8eab75f8e64182fef93008d870f61f9014d | Exstream-OpenSource/Chromium | /net/quic/chromium/crypto/proof_verifier_chromium.cc | C++ | cc | 22,293 | permissive | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/quic/chromium/crypto/proof_verifier_chromium.h"
#include <utility>
#include "base/bind.h"
#include "base/bind_helpers.h"
#include "base/ca... |
7a1b29273cc51a0bbe3ae3feacd2cc9b7cf5f7d8 | c3542f3535dcdb49a379a2a4bf954a2e064ffce2 | litecoinpos/litecoin-pos | /src/qt/transactionrecord.cpp | C++ | cpp | 8,552 | permissive | // Copyright (c) 2011-2019 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <qt/transactionrecord.h>
#include <chain.h>
#include <interfaces/wallet.h>
#include <key_io.h>
#include <wallet/ism... |
832ef3fee1e9ef7bbc5f3705876c25b1d9ae91f1 | 90a7b9e2b732aef92dc0bcbbe7aa94e521d602b4 | jankb/TestProjects | /CPP/Pipeline/PipelineApp/Pipeline.cpp | C++ | cpp | 2,301 | no_license | // Pipeline.cpp : Defines the entry point for the console application.
//
//#include "stdafx.h"
#include <stdio.h>
#include <iostream>
#include "Pipe.h"
#include "Messages.h"
template <typename someType>
char* appendToChar(char* target, someType t)
{
size_t t_length = sizeof t;
memcpy(target, &t, t_l... |
53964c7be356e76b3f8bb13929d06350544a3ad0 | 4681af970ac622538a6864c6a2feb6091cef79cf | bittotemdev/BittoTem | /src/qt/signverifymessagedialog.cpp | C++ | cpp | 8,782 | permissive | #include "signverifymessagedialog.h"
#include "ui_signverifymessagedialog.h"
#include "addressbookpage.h"
#include "base58.h"
#include "guiutil.h"
#include "init.h"
#include "main.h"
#include "optionsmodel.h"
#include "walletmodel.h"
#include "wallet.h"
#include <string>
#include <vector>
#include <QClipboard>
Sign... |
f77f1489ef8048f60c6ab9359ec42bfc2a755d5d | 0ec8725facb20779567a13cfd2d5c4b6df7194f1 | mapengfei-nwpu/DG-program | /nektar/nektar++-5.0.0/solvers/IncNavierStokesSolver/EquationSystems/VelocityCorrectionSchemeWeakPressure.cpp | C++ | cpp | 5,492 | permissive | ///////////////////////////////////////////////////////////////////////////////
//
// File VelocityCorrectionSchemeWeakPressure.cpp
//
// For more information, please see: http://www.nektar.info
//
// The MIT License
//
// Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
// Department of Aero... |
255d08eb7f5a0231dca6c23b6e41dcb147f6e844 | f419429b7846a83c35f2952882bf1e593facbfbc | lixiangnlp/mosesdecoder | /moses/TranslationModel/RuleTable/PhraseDictionaryOnDisk.cpp | C++ | cpp | 6,228 | no_license | // vim:tabstop=2
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2010 Hieu Hoang
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 th... |
09a03edfa0ec18be472afd9e7def80884eed1ae8 | d6ef43de3cbd68ac5b57e0a47379666e8cbc0777 | xzrunner/shadergraph-old | /source/shader/SubjectMVP2.cpp | C++ | cpp | 1,066 | permissive | #include "shaderlab/SubjectMVP2.h"
#include "shaderlab/ObserverMVP.h"
#include <stddef.h>
namespace sl
{
SubjectMVP2::SubjectMVP2()
: m_x(0)
, m_y(0)
, m_sx(0)
, m_sy(0)
, m_width(0)
, m_height(0)
{
}
void SubjectMVP2::NotifyModelview(float x, float y, float sx, float sy)
{
if (m_x == x && m_y == y && m_sx =... |
ae20dda02726ab3e9f57e8e4bbc060e258ae7d36 | 8b0e7c4d162077544f95c9f748e35b567d0ffba9 | aashan007/KaranProjects | /Numbers/5.fineNextPrime.cpp | C++ | cpp | 732 | no_license | #include<bits/stdc++.h>
using namespace std;
/*
Have the program find prime numbers until the user chooses to stop asking for the next one.
*/
int findPrime(int n){
if(n<2){
n=2;
}
while(n){
int flag=true;
if(n==2){
return 2;
}
for(int i=2;i*i<=n;i++){
... |
bde96b8709af61ce765b0711108bfb6f994d002a | 08f6921c22893528c59bb8ad6fa9dd9df47102b5 | lingmar/CT-Gecode | /src/compact-table.hpp | C++ | hpp | 211 | no_license | #ifndef __COMPACT_TABLE__
#define __COMPACT_TABLE__
#include <gecode/int.hh>
using namespace Gecode;
using namespace Gecode::Int;
void extensional2(Home home, const IntVarArgs& x, const TupleSet& t);
#endif
|
994294a71d4a0a439439d2bf4c9e845a9bfd69e7 | 7ede202ea9c709705ac4617d82d6719342315a0e | usseif97/Problem-Solving | /LeetCodeProblems/src/Greedy/SplitStringInBalancedStrings.cpp | C++ | cpp | 632 | no_license | #include "SplitStringInBalancedStrings.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
SplitStringInBalancedStrings::SplitStringInBalancedStrings() {
// TODO Auto-generated constructor stub
}
SplitStringInBalancedStrings::~SplitStringInBalancedStrings() {
... |
e70bd05e11b8c59bf612fced17e64d5e7e3bef02 | d14da4c3153d576c56b9e97a90a57ed79dcad061 | llechner/cmssw | /HLTrigger/Egamma/src/HLTGenericFilter.cc | C++ | cc | 11,302 | permissive | /** \class HLTGenericFilter
*
*
* \author Roberto Covarelli (CERN)
*
*/
#include "HLTrigger/Egamma/interface/HLTGenericFilter.h"
#include "DataFormats/Common/interface/Handle.h"
#include "FWCore/Framework/interface/MakerMacros.h"
#include "FWCore/ParameterSet/interface/ConfigurationDescriptions.h"
#include "FW... |
71daf424b6be796314447afd3427683fe4c0acb0 | 05f2ed016615f900fd0037faaaec0aca419c61a8 | LUUUAN/EntityMatching_SIGMOD_2020_Contest | /c++ version/main.cpp | C++ | cpp | 2,001 | no_license | #include "resolve_others.h"
#include "reverse_index.h"
#include "intersection.h"
#include "index_brand.h"
#include "index_model.h"
#include "split_brand.h"
#include "merge_same.h"
#include "dataset.h"
#include "filters.h"
#include <iostream>
#include <fstream>
#include "util.h"
#include <ctime>
using namespace std;
v... |
cca241aeb0f29950bec58cee044c271155c65ab5 | 1b2ad4424aa957f3a108cb70b4ae93e3b8210f92 | sluckywhh/ChargeClientActiveX_Signed | /ChargeClientActiveX/UK_Et199Class.cpp | C++ | cpp | 31,494 | no_license | // UK_Et199Class.cpp : 实现文件
//
#include "stdafx.h"
//#include "ChangeAdminActiveX.h"
#include "UK_Et199Class.h"
#undef ERROR
#include <glog/logging.h>
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
#define countof(a) (sizeof(a)/ sizeof(CK_ATTRIBUTE))
CK_BBOOL bTrue = TRUE;
CK_BBOOL bFalse = FALSE;... |
7109b1d6a550891f9bcb56e3d118d1729f324429 | 80638e0a8a72ea92ad0df3773b641de1099f2992 | txdy077345/CTK | /Libs/XNAT/Core/ctkXnatResourceCatalogXmlParser.cpp | C++ | cpp | 2,250 | permissive | /*=============================================================================
Library: XNAT/Core
Copyright (c) German Cancer Research Center,
Division of Medical and Biological Informatics
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance wit... |
e7c09b0f27e8c49bfda989fee3e0456cfbddbf65 | 139f7c7c40740166381c8b158fe3ef23a2da734b | PrasadShirude/C-Programs | /Program131.cpp | C++ | cpp | 757 | no_license | //Accept number of bits u want to read from the file
#include<stdlib.h>
#include<stdlib.h>
#include<fcntl.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
class FileX
{
public:
int fd;
FileX(char Name[]) // FileX(char * Name)
{
fd = open(Name,O_RDONLY);
if(fd == -1)
{
cout... |
68660b0b3b1c4d772a3d07f5bf1c090596a9f0d7 | fd309d935cba1149b42920b6307a6d1c62dfb13c | kali-y23/snake | /app/src/StateMachines/GameState.cpp | C++ | cpp | 6,214 | permissive | #include "GameState.h"
#include "Framework.h"
#include "../snake.h"
using namespace std::chrono;
States GameState::Tick() {
uint64_t now = std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::system_clock::now().time_since_epoch()).count();
//draw field
drawRect(m_s->m_playfield_w, m_s->m_p... |
0cf19659b57bd0054f3c49f796bbe8d785dea576 | 522405aaa3bce11f31752745f6dad8465a70e147 | ngthvan1612/Codeforces | /680B.cpp | C++ | cpp | 448 | no_license | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int res = 0;
for (int i = 0; k - i >= 1 || i + k <= n; ++i) {
if (k - i >= 1 && i + k <= n && a[i + k] && a[k - i]) res += (i == 0 ? 1 : 2);
if (k - i < 1 ... |
530cb896b252efe4fb6b868b7a9b0aeb69ac739e | b51cf35653ca1561ffa90ffb09468445663b62d1 | alam0/CPP | /lab3/maincomp.cpp | C++ | cpp | 241 | no_license | //maincomp.cpp
//Author: Aron Lam
#include <iostream>
#include <string>
#include <math.h>
#include "BankAcctComp.h"
//#include "BoatLoanComp.h"
#include "CreditCardComp.h"
int main(){
CreditCardComp card;
card.print();
return(0);
}
|
1e374f8c745350453b492c3f6efc4963fa6dd766 | f831cb2347552ddb6039c23670a7b7a33b9e66f7 | subhendu-poddar/competitive-programming | /kick20G1.cpp | C++ | cpp | 1,740 | no_license | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define pb push_back
#define FOR(i,a,n) for(ll i=a;i<n;i++)
#define For(i,a,n) for(ll i=a;i<=n;i++)
#define mod 1000000007
#define INF 1000000000000
//----------------------------------------... |
3ddfaa61ed9bef46da770e9686c17752a3590b31 | d52fdd80e6fd18f1252fb84f51f6ae12e41dc999 | usgs-coupled/phreeqci | /srcdbpg.cpp | C++ | cpp | 2,146 | no_license | // Machine generated IDispatch wrapper class(es) created by Microsoft Visual C++
// NOTE: Do not modify the contents of this file. If this class is regenerated by
// Microsoft Visual C++, your modifications will be overwritten.
#include "stdafx.h"
#include "srcdbpg.h"
/////////////////////////////////////////////... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.