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 |
|---|---|---|---|---|---|---|---|---|
eabadf4523e207c9c1c81a19003ba263a8872014 | fc658a1f83000624752fcaa015d25917d3ce5b66 | svn2github/ngene | /trunk/Dependencies/Xerces/include/xercesc/util/Platforms/OS400/OS400PlatformUtils.hpp | C++ | hpp | 1,695 | no_license | #if (__OS400_TGTVRM__>=510) /* @01a */
#pragma datamodel(P128) /* @01a */
#endif /* @01a */
/*
* Copyright 1999-2001,2004 The Apache Software Foundation.
*
* Licensed under the Apache License, ... |
e1737e846abf92c3015f2c58d1af6bfff2b5ce23 | 734788fffe2f8427a3d9e8eecaea5b710c25a59d | SerPan23/CPP_STR_MIDDLE | /zamena.cpp | C++ | cpp | 749 | no_license | #include "strmiddle.h"
string zamena(string str)
{
string news;
int ch = 0, pos = 0;
for(int i = 0; str[i] != '\0'; i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
for(int j = i; (str[j] >= '0' && str[j] <= '9'); j++)
{
//cout << str[j] << " " << int(s... |
78028c46b848633160b0becaab4236b27509b81a | c987ba91a5ff3058f1511c61535d3844f1f228bd | wbd0502/graduation-project | /source/Qt/RoadExtraction/pathManager.cpp | C++ | cpp | 2,298 | no_license | #include "pathManager.h"
PathManager::PathManager()
{
}
PathManager::~PathManager()
{
}
void PathManager::setInputPath(QString path)
{
this->inputPath = path;
}
void PathManager::setWorkDir(QString path)
{
this->workDir = path;
}
void PathManager::setOutputDir(QString path)
{
this->outputDir = path;
}
... |
0743ca855b2a17c38a1ffe5a9068bfbc210b8cb2 | 7d55d15f89f4782742539a30b7f49ed8ced0823d | msimpsonbbx/test_fast | /Hardware/krnl_cornertracker.build/link/vivado/vpl/prj/prj.srcs/sources_1/bd/zcu104_base/ip/zcu104_base_auto_us_df_10/sim/zcu104_base_auto_us_df_10_sc.cpp | C++ | cpp | 4,027 | no_license | // (c) Copyright 1995-2021 Xilinx, Inc. All rights reserved.
//
// This file contains confidential and proprietary information
// of Xilinx, Inc. and is protected under U.S. and
// international copyright and other intellectual property
// laws.
//
// DISCLAIMER
// This disclaimer is not a license and does not grant ... |
4f8256fdc2b3beaff70ea057ea4a042cedef2f75 | eb2383f64f80bd05bc377e49f1ce36f21cb29c96 | DDWC1603/lab-exercise-chapter-6-NazurahKamal | /String-Exercise-2.cpp | C++ | cpp | 300 | no_license | //append char1 with char2 with the right string function.
//and display both char1 and char2
#include <iostream>
#include<cstring>
using namespace std;
int main(){
char char1[11], char2[21];
strcpy(char1,"haillo");
strcpy(char2," there");
cout<<char1<<endl;
cout<<char2<<endl;
return 0;
}
|
4aa9654bbf1096f2fe6b3d576527a9d2c7ede4f8 | c159f0774fafc7eac6c6fd704cb9c31e6cf59da4 | zjj6029/chromium | /content/browser/service_worker/service_worker_context_wrapper.cc | C++ | cc | 76,133 | 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 "content/browser/service_worker/service_worker_context_wrapper.h"
#include <map>
#include <set>
#include <string>
#include <utility>
#include <v... |
fff10f2bfc52297f081adcdf72d3c9de6091d002 | 020710ae8f19c2ad445a316b3a561795c628f023 | uel-dataexchange/Opencascade_uel | /inc/gp_VectorWithNullMagnitude.hxx | C++ | hxx | 1,266 | no_license | // This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _gp_VectorWithNullMagnitude_HeaderFile... |
73d6657c0530b7f9d921b3b4b3c3bff42b4bf231 | ce8ffd5d53bef572fc29f37c97869b42ca4df0ac | matejzavrsnik/mzlib | /include/abstract/symbol_sequences_in_pattern.cpp | C++ | cpp | 2,099 | no_license | //
// Copyright (c) 2017 Matej Zavrsnik
//
// Web: matejzavrsnik.com
// Mail: matejzavrsnik@gmail.com
//
#include "gtest/gtest.h"
#include "symbol_sequences_in_pattern.h"
TEST(first_symbol_sequence_in_pattern, produces_correct_sequence)
{
std::vector<int> number = {4,5,6,7};
std::vector<char> sequence = mzlib... |
1bc67d6f817538a4c84efb5a13520dae1f6dd0ec | 60439cbcde902418dfd9fe41cdaac395d7096274 | dinhthuy1602/SPOJ-Solutions | /Solutions/MAY99_4-8533597.cpp | C++ | cpp | 709 | no_license | #include<stdio.h>
#define MOD 10000007
long long int tab[101][101];
long long int nCr( int n, int k )
{
if(n<0 || k<0)
return 0;
if (tab[n][k] != 0)
return tab[n][k];
if (k == 0 || k == n)
tab[n][k] = 1;
else
tab[n][k] = (nCr(n-1,k-1)%MOD + nCr (n-1,k)%MOD)%MOD;
... |
0f23cc75604e2707d383c616f71070a40a0acadd | e8c22b9236e107888bd3d23fac6bf6beea5bf71c | imsong52/Q.solution | /leetcode/237.delete-node-in-a-linked-list.cpp | C++ | cpp | 901 | no_license | /*
* [237] Delete Node in a Linked List
*
* https://leetcode.com/problems/delete-node-in-a-linked-list
*
* Easy (45.68%)
* Total Accepted: 135938
* Total Submissions: 297627
* Testcase Example: '[0,1]\nnode at index 0 (node.val = 0)'
*
*
* Write a function to delete a node (except the tail) in a singly ... |
01a7697be26665e46b714927697b8c70f1da69f1 | ea91299ea11b2f9efe2db74485068c1ecaa6d669 | S4ltF1sh/SPOJ | /PTIT016D.cpp | C++ | cpp | 639 | no_license | //PTIT016D - ACM PTIT 2016 D - Biểu thức
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
bool cmp(long long x, long long y)
{
return x > y;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
i... |
4bf97fdd3e2def766d34ca8a917fa8efc251b3e0 | d0989a4342ef3d09c4cf7a6e6a132b32d4e08c54 | alinas/Halide | /test/correctness/pseudostack_shares_slots.cpp | C++ | cpp | 3,864 | permissive | #include "Halide.h"
using namespace Halide;
const int tolerance = 3 * sizeof(int);
std::vector<int> mallocs;
void *my_malloc(JITUserContext *user_context, size_t x) {
mallocs.push_back((int)x);
void *orig = malloc(x + 32);
void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5);
((void **)ptr)[-1] = or... |
768e152596f11b89391c5ba90ac53f724ffdd03e | bf019c7d169dbd873e296fef92be906e43c5d21f | yielding/code | /cpp.time/chrono/tp_to_ymd2.cpp | C++ | cpp | 1,068 | no_license | #include "date.h"
#include <iostream>
// Reduce verbosity but let you know what is in what namespace
namespace C = std::chrono;
namespace D = date;
using namespace std;
int main()
{
auto tp = C::system_clock::now(); // tp is a C::system_clock::time_point
{
// Need to reach into namespace date for this strea... |
b5d3446ca63b55f0256a93a0b373fd477803da65 | f9868a9ec6efbf867ff8fda3e35a1b4407fd79d0 | kylienic/CTP-250 | /Lab 1/LAB 1 SUBMISSION/myArray/Client.cpp | C++ | cpp | 1,615 | no_license | /**
* @file Client.cpp
* @author Kylie Nicholson
* This program tests the myArray class.
*/
#include "myArray.h"
#include <iostream>
using namespace std;
int main()
{
myArray test;
int max = 0;
int min = 0;
float avg = 0;
int userInput = 0;
cout << "Enter a Value to add to the array. Press 999... |
dc18f8c16a4265637da16faf70f3faf7aefa9103 | b7eb1fe54c3dc5f5cdc8b0eba6fba0480ce5d0b1 | travisdesell/tao | /synchronous_algorithms/line_search.hxx | C++ | hxx | 3,863 | no_license | /*
* Copyright 2008, 2009 Travis Desell, Dave Przybylo, Nathan Cole,
* Boleslaw Szymanski, Heidi Newberg, Carlos Varela, Malik Magdon-Ismail
* and Rensselaer Polytechnic Institute.
*
* This file is part of Milkway@Home.
*
* Milkyway@Home is free software: you can redistribute it and/or modify
* it under the ter... |
ded0aab0c865012dc4d7b50fe0c36e0a477f6eff | cca554913f03f2fc1dd70568947cdce9ecf6db1b | macieks/uberengine | /Src/Engine/Private/GraphicsExt/gxAnimationInstance.cpp | C++ | cpp | 5,301 | no_license | #include "GraphicsExt/gxSkeleton.h"
#include "GraphicsExt/gxAnimationInstance_Private.h"
#include "GraphicsExt/gxModel.h"
#include "GraphicsExt/gxModel_Private.h"
#include "GraphicsExt/gxAnimation_Private.h"
#include "GraphicsExt/gxModelInstance_Private.h"
gxAnimationConfig gxAnimationConfig::Default;
gxAnimationInst... |
74ad9a0e0f8a12278d47985061f9b43496607b47 | 869cfeb8c89357a0aa969b8031c665e5d066c2b5 | chyla/OutputMatchTestingTool | /src/RunProcess.cpp | C++ | cpp | 7,689 | permissive | /*
* Copyright (c) 2019-2023, Adam Chyła <adam@chyla.org>.
* All rights reserved.
*
* Distributed under the terms of the BSD 3-Clause License.
*/
#include "headers/RunProcess.hpp"
#include "headers/system/Unix.hpp"
#include "headers/exception/SutExecutionException.hpp"
#include "headers/exception/SignalReceivedEx... |
a11a6bc27aa1bc2e1e3d4123f210b9e983dbf9d9 | aae3c4dfce61a71670ae3a7497320dca207e1252 | ChilleFlex/UVA_solves | /10099.cpp | C++ | cpp | 1,274 | no_license | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int n,m;
int par[N];
struct edge
{
int u,v,w;
bool operator<(const edge &p)const
{
return w>p.w;
}
};
vector<edge>vec;
void makeset(int n)
{
int i;
rep(i,n)
par[i]=i;
vec.clear();
... |
552606a0a51da49dcac280ef3e22bb7fcaa025a3 | da973fb147c5bc41e08fd264633a5c5c29f05320 | trieck/pixievm | /pxmon/Code.cpp | C++ | cpp | 12,706 | no_license | /////////////////////////////////////////////////////////////////////////////
//
// CODE.CPP : Code generation
//
// Copyright (c) 2006-2019, Thomas A. Rieck, All Rights Reserved
//
#include "common.h"
#include "SymbolTable.h"
#include "code.h"
#include "memory.h"
#include "PixieVM.h"
extern word address... |
f9db7468a514339cb47227c8ab32f1945e4f2217 | 03ff664c32bd765f1dcbe480203a52e8630e7f6c | xrlu0929/PKU-introToAlgorithmAndC | /elephantDrink/elephantDrink/main.cpp | C++ | cpp | 632 | no_license | //
// main.cpp
// elephantDrink
// 一只大象口渴了，要喝20升水才能解渴，但现在只有一个深h厘米，底面半径为r厘米的小圆桶(h和r都是整数)。问大象至少要喝多少桶水才会解渴。
// Created by Xinrui Lu on 9/4/17.
// Copyright © 2017 Xinrui Lu. All rights reserved.
//
#include <iostream>
#include <math.h>
using namespace std;
double ceil(double arg);
int main() {
int target = 20 *... |
453361d3d449355fd159ff3bc587fce1cccbcb4d | fad5fe64ac46ac1b8a4e0c3b468982cc92ad5be1 | SelyanKab/chromium | /chrome/browser/extensions/api/page_capture/page_capture_apitest.cc | C++ | cc | 6,311 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <atomic>
#include "base/base_switches.h"
#include "base/command_line.h"
#include "base/threading/thread_restrictions.h"
#include "build/buil... |
27279659acefe830c83edca9ad821563436bf3ff | 9ea005b9a8aeee31407fdb5f84309faeb4bfe75d | ECS-251-W2020/chromium | /chrome/browser/history/history_tab_helper_unittest.cc | C++ | cc | 3,954 | 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 "chrome/browser/history/history_tab_helper.h"
#include "base/run_loop.h"
#include "base/strings/stringprintf.h"
#include "base/strings/utf_strin... |
0e06414535b3ac9f865dd1c254764b582ec32493 | 3c5f64280b7077a777ff0e79ce5d5f4f8fb7d809 | mahg/ogs | /ProcessLib/RichardsFlow/RichardsFlowMaterialProperties.cpp | C++ | cpp | 5,379 | permissive | /**
* \copyright
* Copyright (c) 2012-2017, OpenGeoSys Community (http://www.opengeosys.org)
* Distributed under a Modified BSD License.
* See accompanying file LICENSE.txt or
* http://www.opengeosys.org/project/license
*
*/
#include "RichardsFlowMaterialProperties.h"
#include <lo... |
75cee64c9fa64bd976926f3fde3d8251bb5c3395 | 853881d0c3bbc6055efdedcc3ccd8dc857b3b4b3 | jjin1115/codepro | /test/2020-1-memory.cpp | C++ | cpp | 7,749 | no_license | #include <cstdio>
#include <cstring>
#include <locale>
#include <vector>
#include "lib/MemoryAllocator.h"
// 테스트 대상은 아래 주석과 같이 구현되어 있다.
// 필요한 경우 아래 주석의 내용을 참고하여 테스트 케이스 입력과 테스트 코드를 작성하시오.
// NOTE: 테스트 대상 코드는 빌드에 이미 포함되어 있으니 아래 주석을 해제하여 사용하지 마시오.
/**
* 상수 정의
*
#define MAX_REQ_LIMIT (50)
#define MEMORY_SIZE (20)
*/... |
cc2dbbb6316153a0ab2258ac1ff426c95edf56b9 | 7d0b4eceb005eb2143e512820436bf281f30b3ed | NandyFarhanF/UTS-Dasar-Pemrograman | /Nandy Farhan Fahrizal/BAB 3/Bab 3 operator aritmetika 1.cpp | C++ | cpp | 333 | no_license | #include <iostream>
using namespace std;
int main()
{
cout << "2 + 3 = " << 2 + 3 << endl << endl;
cout << "10 - 5 = " << 10 - 5 << endl << endl;
cout << " 4 x 3 = " << 4 * 3 << endl << endl;
cout << "4/2 = " << 4 / 2 << endl << endl;
cout << "10 % 3 = " << 10 % 3 << endl << endl;
r... |
cab115213c6405de9708d80a61892894532b6f16 | 173c22cd7b87ec61fcf439b0f2b6b5683b0ce82d | tomwhy/Rockstar | /Rockstar/Mysterious.cpp | C++ | cpp | 449 | no_license | #include "Mysterious.h"
#include "InterpeterExceptions.h"
Mysterious::Mysterious() : ISimpleVariable("Mysterious")
{
}
std::string Mysterious::toString()
{
return "mysterious";
}
bool Mysterious::canBeIndex()
{
return false;
}
bool Mysterious::toBool()
{
return false;
}
bool Mysterious::equal(std::shared_ptr<IVar... |
03c01a19a04e3a7ed02dcad4b6ebd2b40984e6e4 | 39169eb0c56eb3bb552b9bd53b34c7c678bef876 | limemicro/lms6suite | /src/CommonUtilities.cpp | C++ | cpp | 1,763 | no_license | /**
@file CommonUtilities.cpp
@author Lime Microsystems (www.limemicro.com)
@brief Common utility functions used by logic and GUI
*/
#include "CommonUtilities.h"
#include <sstream>
#include <iomanip>
#ifndef __unix__
#include <windows.h>
#else
#include <unistd.h>
#include <sys/time.h>
#endif // LINUX
... |
bead399f7a0b74f0125d9437aa0055561c2d601d | 9a63398bde8cde4b0bde564df0ef69485d8845ab | pizzamig/killer | /cell.cpp | C++ | cpp | 2,844 | no_license | #include "cell.h"
#include <cassert>
#include <iostream>
#include "constraint.h"
using namespace std;
Coordinate::Coordinate(uint8_t X, uint8_t Y) : m_X( X ), m_Y( Y )
{
assert( m_X < 9 );
assert( m_Y < 9 );
}
Coordinate::Dial_e Coordinate::getDial() const
{
if( m_X < 3 &&
m_Y < 3 )
return Q11;
if( m... |
f31b77e875d97178aca50bbaf94ccacde692255a | 268655ab8a5760e1f2c81b4af50ce38a4c1a2f36 | xygroup/clang | /tools/libclang/CXString.cpp | C++ | cpp | 3,778 | permissive | //===- CXString.cpp - Routines for manipulating CXStrings -----------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
271d32c7b17e4bc01862cc74e1684ad9419b801a | f2713c3e574b8bf8996efd9b20d46b0eb779e1ea | biyasto/Recreated-SuperMarioBros3 | /RectCollision.cpp | C++ | cpp | 428 | no_license | #include "RectCollision.h"
CRectCollision::CRectCollision(float x, float y, float width, float height) {
this->x = x;
this->y = y;
this->width = width;
this->height = height;
}
void CRectCollision::GetBoundingBox(float& left, float& top, float& right, float& bottom)
{
left = x - width / 2;
top = y - height / 2;... |
db2c818871d7a2ccc373325940a4096d5dfb45f0 | c27597aa2b4c294190df42f011ea1d1547834d8d | sdustlug/OpenJudge | /QuestionAns/lpy_now/2207.cc | C++ | cc | 1,837 | no_license | #include<map>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<iomanip>
#include<cstring>
#include<iterator>
#include<iostream>
#include<algorithm>
#define R register
#define LL long long
#define pi 3.141
#define mod 10000
#define INF 140000000... |
82620a9693096fba08ef2096e1b2edaf6fa63b66 | 3433a146e6c75b5170a2a99b4866c87fe54d3035 | underscoreanuj/Codes | /LeetCode/1-100/96_unique_binary_search_trees.cpp | C++ | cpp | 3,756 | no_license | // catalan number O(n)
class Solution
{
public:
size_t ncr(int n, int r)
{
if (r > n - r)
r = n - r;
size_t res = 1;
for (int i = 0; i < r; ++i)
{
res *= (n - i);
res /= (i + 1);
}
return res;
}
... |
ad55391f8d46e324847720202a841dbb13ff098c | 41ae6d811822af4e7471cd199479aef2e7865515 | loujc/shufflenetv2_hls | /shufflenetv2_final_solution/acceleartor_hls_final_solution/optimize_conv1/syn/systemc/shuffle_48_l_p.cpp | C++ | cpp | 33,257 | no_license | // ==============================================================
// RTL generated by Vivado(TM) HLS - High-Level Synthesis from C, C++ and SystemC
// Version: 2017.2
// Copyright (C) 1986-2017 Xilinx, Inc. All Rights Reserved.
//
// ===========================================================
#include "shuffle_48_l_p... |
690d1f7fe73dd305bf6bc3c25772fa9372d72578 | 70909c61fa6058d827141c98e0138321e644a09e | HeyRoo/WebServer | /code/http/httprequest.cpp | C++ | cpp | 5,972 | permissive | /*
* @Author : mark
* @Date : 2020-06-26
* @copyleft Apache 2.0
*/
#include "httprequest.h"
using namespace std;
const unordered_set<string> HttpRequest::DEFAULT_HTML{
"/index", "/register", "/login",
"/welcome", "/video", "/picture", };
const unordered_map<string, int> Htt... |
524b709d21a826e39888846f2b0f25c8b6b484d5 | 4610b17ae9f726bad96c476fd2360056966fa535 | jhnaldo/problem-solving | /koistudy/prob044B.cpp | C++ | cpp | 242 | no_license | #include <stdio.h>
#define BOUND 1000000007;
int main(){
long long n, k;
long long result;
scanf("%lld %lld", &n, &k);
result = 1;
while (k--) result = (result * n) % BOUND;
printf("%lld\n", result);
return 0;
}
|
808e38d154a5c29f90be91368faac9a6fc702618 | 6203fe9c727845ece8ec2223b7e0fc36b351dcb8 | EricKTCheung/dmlite | /python/inodewrapper.cpp | C++ | cpp | 5,325 | permissive | /*
* inodewrapper.cpp
*
* Wrapper classes for Python bindings for inode.h from
* the c++ dmlite library via Boost:Python.
* This file is included by inode.cpp.
*/
// some helper functions to make the stat struct more accessible
bool StatIsDir(struct stat &self)
{
return S_ISDIR(self.st_mo... |
9b27c374862b8c3b036271a42dab51361650abcf | 72e65f27451b362cb361114023947d21230c392a | Jackie-Tang1/Robot-Navigation-in-Confined-Areas- | /pro2_pro.cpp | C++ | cpp | 44,361 | no_license | #include"systemc.h"
SC_MODULE(timer){
sc_out<int> t;
sc_in<bool> clock;
int t1 = 0;
void prc_timer(){
t.write(t1);
t1 = t1 + 1;
}
SC_CTOR(timer){
SC_METHOD(prc_timer);
sensitive << clock.pos();
}
};
SC_MODULE(update1){
sc_in<sc_uint<4> > status_r1;
sc_in<sc_uint<4> > status_r2;
... |
4fbab230ae9d600a90a6c3be7bc39f5fd71bb9b7 | 868b377ced86a30cdb4584beadf7cd303d47aecd | kow/hifi | /assignment-client/src/octree/OctreeSendThread.cpp | C++ | cpp | 25,819 | permissive | //
// OctreeSendThread.cpp
// assignment-client/src/octree
//
// Created by Brad Hefta-Gaub on 8/21/13.
// Copyright 2013 High Fidelity, Inc.
//
// Distributed under the Apache License, Version 2.0.
// See the accompanying file LICENSE or http://www.apache.org/licenses/LICENSE-2.0.html
//
#include <chrono>
#incl... |
6ba70eb4a4fda72c867ee61fd23797cea217cf5b | 7ecf17287a494b42ee2999868e3ac415c7d5caa4 | dcboy/BPI-A83T-Android7 | /android/frameworks/base/media/jni/android_media_MediaPlayer.cpp | C++ | cpp | 46,129 | permissive | /*
**
** Copyright 2007, The Android Open Source Project
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
**
** Unless required by appl... |
6a28657ce6e70019c1b3ea71a6e9ed223f92ae17 | 5d251b1b2111003ede395a186f820af3b92cdc26 | lilhuang/cvmfs | /cvmfs/receiver/payload_processor.cc | C++ | cc | 4,853 | no_license | /**
* This file is part of the CernVM File System.
*/
#include "payload_processor.h"
#include <fcntl.h>
#include <unistd.h>
#include <vector>
#include "logging.h"
#include "util/posix.h"
#include "util/string.h"
namespace receiver {
PayloadProcessor::PayloadProcessor()
: pending_files_(), current_repo_(), nu... |
6b350e8941ee470428562d94c0d3514b156cb2a7 | 489d39261cbef0edaa326c2277365e86158af785 | quekaihua/StudyTest | /新标准C++程序设计教程/8自定义数据类型/8.2.1.cpp | C++ | cpp | 275 | no_license | #include <iostream>
#include <cstring>
using namespace std;
union UTest{
int a;
short b;
char s[16];
char c;
};
int main(){
UTest u;
cout << sizeof(u) << endl;
memset(&u,0,sizeof(u));
u.a = 0x61626364;
cout << hex << u.a << "," << u.b << "," << u.c << "," << u.s;
}
|
6cd0cc5d49248d91b051847195e640e7eb13b332 | 4587fe21581db5aeafd392ed779c2bb0801fc55b | barskey/Testing_Ground | /Source/Testing_Ground/Weapons/BallProjectile.cpp | C++ | cpp | 1,743 | no_license | // Copyright 1998-2016 Epic Games, Inc. All Rights Reserved.
#include "Testing_Ground.h"
#include "BallProjectile.h"
#include "GameFramework/ProjectileMovementComponent.h"
ABallProjectile::ABallProjectile()
{
// Use a sphere as a simple collision representation
CollisionComp = CreateDefaultSubobject<USphereCompone... |
a760a321f106b7361b82713e38dce5f18c76946f | 6530022be89025619f844612556dfe9e70bb3017 | mzubairsaleem/v8 | /src/builtins/builtins-typed-array-gen.cc | C++ | cc | 81,768 | permissive | // Copyright 2017 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-typed-array-gen.h"
#include "src/builtins/builtins-constructor-gen.h"
#include "src/builtins/builtins-iterator-gen.h"
#... |
91ccc608bce38bac12e4a282ce5c779ee84974b8 | 78a50c8d28a07339aabeaa66ae4f22a47a82ccf3 | luctsix/pratice-code | /Qt/build-01Dialog-Desktop_Qt_5_12_2_MinGW_64_bit-Debug/debug/moc_widget.cpp | C++ | cpp | 3,545 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'widget.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.12.2)
**
** WARNING! All changes made in this file will be lost!
*************************************************************... |
681d4d5fc18a16142db431fcb7fcc46a766a17b4 | e7dfef762dbe58f9ff5c51e3965f9c756a95a616 | leydermejia/Taller2 | /Ejercicio4-f.cpp | C++ | cpp | 1,659 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <string.h>
#include <math.h>
/*Comentario
Defina una estructura que sirva para representar una persona la estructura debe
contener dos campos: el nombre de la persona y un valor de tipo logico que indica si
la persona tiene algun tipo de disca... |
89960a2daae3487b9050f2580f427921289b4c96 | 1291bae3953bc2ce323fc01136712365c82020c1 | Petit-Pas/EpitechBachelor | /bachelor/year2/PSU/PSU_zappy_2017/src/clients/graphical/include/Player.hpp | C++ | hpp | 4,949 | no_license | /*
** EPITECH PROJECT, 2018
** zappy
** File description:
** Internal functions
*/
#ifndef ZAPPY_PLAYER_HPP
# define ZAPPY_PLAYER_HPP
#include <SFML/Graphics.hpp>
#include "Resources.hpp"
struct SkinInfo {
sf::Vector2i pos;
sf::Vector2i size;
};
struct PlayerSkin {
std::vector<SkinInfo> idle;
std::vector<SkinIn... |
21975cf7bc376a8a6e83ea80e23c56602d6cafdf | 6975fab0a72f4698ca8b01ce1b931949c7a1e369 | qiubix/BlackBolt | /CharUtil.cpp | C++ | cpp | 345 | no_license | #include "CharUtil.h"
#include <string>
namespace charutil {
char lower(char letter) {
return std::tolower(static_cast<unsigned char>(letter));
}
char upper(char letter) {
return std::toupper(static_cast<unsigned char>(letter));
}
bool isVowel(char letter) {
return std::string("aeiouy").find(lower(letter)) !=... |
869b4c45cadcdf171a6f53a366b99f839c4abf22 | 991e309adf8e2a829d8e45343e0d90dbd63892a8 | robertorossin/Pp5 | /NtuProd2017V04_r/src/PDAnalysis/Ntu/src/PDGenHandler.cc | C++ | cc | 27,590 | no_license | #include "PDAnalysis/Ntu/interface/PDGenHandler.h"
#include <iostream>
#include <sstream>
#include <stdio.h>
const std::vector<int>* PDGenHandler::ids = 0;
const std::vector<int>* PDGenHandler::mothers = 0;
std::map< int,std::vector<int> > PDGenHandler::daughters;
std::vector<int>* PDGenHandler::TypeSelect::genId;
... |
85ce842149012065e67488336fa34dee0f5d2e50 | 9f425e845671381ebf98599901ad33456d80909c | joaopedroxavier/Competitive-Programming | /google-code-jam/google-code-jam-2017-1A/B.cpp | C++ | cpp | 1,181 | no_license | //
//
//
//
//
#include <bits/stdc++.h>
using namespace std;
#define topper top //WE ARE TOPPER
#define mp make_pair
#define pb push_back
#define db(x) cerr << #x << " == " << x << endl;
#define _ << " " <<
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vec... |
67e32d1abc34fc5c2b829aa4b3d8aa2c5f617764 | c3c8f090b16ef796644d7bb46e53baee0ad8bee9 | AlephAlpha/golly | /gollybase/superalgo.cpp | C++ | cpp | 83,025 | no_license | // This file is part of Golly.
// See docs/License.html for the copyright notice.
#include "superalgo.h"
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#if defined(WIN32) || defined(WIN64)
#define strncasecmp _strnicmp
#define firstbitset(x,y) unsigned long _r ; _BitScanReverse(&_r, y) ; x = (state) _r
#e... |
1bfb44e6006fbc4020fcfecf7a3fcd0122dee6a2 | ee86c61f478d05d8bd94282c5712093559fcd5cf | tonylibing/EasyQuote | /th3party/logging/easylogging++.cxx | C++ | cxx | 121,638 | no_license | //
// Bismillah ar-Rahmaan ar-Raheem
//
// Easylogging++ v9.96.7
// Cross-platform logging library for C++ applications
//
// Copyright (c) 2012-2018 Zuhd Web Services
// Copyright (c) 2012-2018 @abumusamq
//
// This library is released under the MIT Licence.
// https://github.com/zuhd-org/easyloggingpp/blob/mas... |
81dd30e4dcafab5452da49e42c9dc0620bff1063 | dca2876ffe5ddf572b5911a32effd3bf6342f136 | ianfort/150proj4 | /Machine.cpp | C++ | cpp | 25,526 | permissive | #include "Machine.h"
#include <unistd.h>
#include <signal.h>
#include <time.h>
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/msg.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <sys/mman.h>
#include <fcntl.h>
#include <errno.h>
#include <poll.h>
#include <string.h>
#include <stdlib.h>
#include <stdi... |
a40b180f6f098ebe441d948144179cac0bc859bf | 499655cb1453d41c6c115c6d6c8cb8a08d91e429 | Dishu5588/liverpool | /n number of fibonacci series.cpp | C++ | cpp | 358 | no_license | #include<stdio.h>
int fibo (int);
int main()
{
int n,i;
printf("\n enter the value of n:");
scanf("%d",&n);
printf("\n enter %d number of fibonacci series:",n);
for(i=1;i<=n;i++)
{
printf(" %d",fibo(i));
}
return 0;
}
int fibo (int n)
{
if(n==1)
return 0;
else if(n==2)
return 1;
else
... |
a794e0fad19a828bc81b5c553cd52040f5fe9129 | dea0b8148d2bbc711433028c255265d270b36f16 | rustyford/2012-avc.mega | /AvcPid.cpp | C++ | cpp | 941 | no_license | #include "AvcPid.h"
// time is in seconds, speed in meters / second
int AvcPid::compute (float error, float timeDelta, float speed) {
float a = speed * sin(alpha);
float optimumError = 5.0;
float minimumKd = optimumError / a;
float kd = max(minimumKd, error / a);
float derivative = (error - previousError) / ... |
b5619c5569fab45256d145c87da45cf7924fc98d | 8bfe8aca7182accc58727be5439844378464e015 | dafral/-Physics--Pinball | /Pinball/ModuleSceneIntro.cpp | C++ | cpp | 8,256 | no_license | #include "Globals.h"
#include "Application.h"
#include "ModuleRender.h"
#include "ModuleSceneIntro.h"
#include "ModuleInput.h"
#include "ModuleTextures.h"
#include "ModuleAudio.h"
#include "ModulePhysics.h"
#include "ModuleWindow.h"
#include <cstdlib>
ModuleSceneIntro::ModuleSceneIntro(Application* app, bool start_ena... |
edbaf24d0e9164eeb8cb106eaff06e0d66cc463e | 3c2a32f510e281cbefbd477b7f77665292f8a453 | sam09/opencv | /modules/gapi/src/backends/fluid/gfluidbackend.cpp | C++ | cpp | 43,161 | permissive | // This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
//
// Copyright (C) 2018 Intel Corporation
#include "precomp.hpp"
#include <functional>
#include <iostream>
#include <ioman... |
bcfc8b81b2a27655873059e1f673e4f66336eac2 | b78ebbba34554147f4395f3b926e67e82fc88918 | willemneal/Graph-coloring | /src/objects/graph_color.cpp | C++ | cpp | 6,248 | no_license | /* ============================================================
*
* This file is developed as part of the Dev-wars contest in Instruo 2014
* held by Indian Institute of Engineering Science and Technology Shibpur.
*
* Date : 2014-23-04
* Description : Implements the Welsh Powell algorithm for vertex colorin... |
596a65b518d6fb2f9957e8d2e250dec7572689ea | 7fa93d082ffc236b210c5fa70d38a450aa0dcd2c | JacobianDet/CompeteUp | /ABC143/B.cpp | C++ | cpp | 1,426 | no_license | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF (1LL<<57)
#define MV 200001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define whoami(x) cerr<<#x<<" "<<x<<"\n";
#define mp make_pair
#define ins insert
#define sz siz... |
6e24050f7d27a539fd41da6470153450732f10f0 | 20e11a75e1ce020f408e862fda63ec7470ccd0b5 | alinas/Halide | /test/correctness/extract_concat_bits.cpp | C++ | cpp | 5,062 | permissive | #include "Halide.h"
using namespace Halide;
class CountOps : public Internal::IRMutator {
Expr visit(const Internal::Reinterpret *op) override {
std::cerr << Expr(op) << " " << op->type.lanes() << " " << op->value.type().lanes() << "\n";
if (op->type.lanes() != op->value.type().lanes()) {
... |
eb4ef387c4a59a284bd8952ab3c049cb970b7bbe | 98d47a1a3f02f2b6f2818c702e402128d6b39292 | chrisfromwork/BabylonNative | /Polyfills/Canvas/Source/Canvas.cpp | C++ | cpp | 4,848 | permissive | #include <bgfx/bgfx.h>
#include <map>
#include "Canvas.h"
#include "Image.h"
#include "Context.h"
#include <functional>
#include <sstream>
#include <assert.h>
#include <NativeEngine.h>
namespace Babylon::Polyfills::Internal
{
static constexpr auto JS_CONSTRUCTOR_NAME = "NativeCanvas";
void NativeCanvas::Creat... |
505f89f8054e10ddcb1b5f0f553d8f423c061c22 | cef08cf9c2c1919d4a4f53410701dca859215dd0 | ericniebler/range-v3 | /include/range/v3/iterator/basic_iterator.hpp | C++ | hpp | 40,633 | permissive | /// \file
// Range v3 library
//
// Copyright Eric Niebler 2014-present
// Copyright Casey Carter 2016
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home... |
4025b1df2ce4d8b6842caeffffe8fef78ff360fd | a269d8d162a2d900c3099aebd2cf11dcd6b47299 | SaschaMester/delicium | /chrome/browser/supervised_user/supervised_user_whitelist_service_unittest.cc | C++ | cc | 10,261 | permissive | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <map>
#include <set>
#include <string>
#include "base/bind.h"
#include "base/callback.h"
#include "base/memory/scoped_ptr.h"
#include "base/mess... |
672530c89a2f33561d47de9e1490759563d96cb4 | 56919c4cceddbeebfa761666c720bfbe3dbe3eda | Zaggg/DirectX12-Practice | /D3D12Render/D3D12Render/D3D12Render.cpp | C++ | cpp | 823 | no_license | // D3D12Render.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 ... |
1ab04b21a923458e3405af53b856944103fee7e5 | 9a1874cb1660a2146951d93efe8c6596643daaed | pudelkoM/sfc | /src/sfc.cpp | C++ | cpp | 626 | no_license | #include <array>
#include <iostream>
#include <tuple>
#include <hydrogen.h>
#include "sfc.h"
int main(int argc, char *argv[]) {
if (hydro_init() != 0) {
std::cerr << "Failed to init hydro library" << std::endl;
return EXIT_FAILURE;
}
struct args t;
int err;
std::tie(t, err) = pa... |
38563c7ca9314bf8d6f93b3e13ff7143a5a748f6 | c566e5013fed0f723b163ddd59184ad29255f221 | dongfanggugu/ElevatorMan_IOS | /chorstar/chorstar/data/KnowledgeInfo.hpp | C++ | hpp | 717 | no_license | //
// KnowledgeInfo.hpp
// chorstar
//
// Created by 长浩 张 on 16/4/5.
// Copyright © 2016年 长浩 张. All rights reserved.
//
#ifndef KnowledgeInfo_hpp
#define KnowledgeInfo_hpp
#include "../PrefixHeader.h"
#include <stdio.h>
#include <string>
class CKnowledgeInfo
{
public:
CKnowledgeInfo(std::string knId, std::st... |
c71ae90e4bde4dab55336c48029a5f381ceb38d8 | 55578c387c864d68de86f34d611bb494ec0985ab | stuartcampbell/playpen | /scg/cmpgeom/vertex.cpp | C++ | cpp | 652 | no_license | #include "vertex.hpp"
Vertex::Vertex(double x, double y) : Point(x,y)
{
}
Vertex::Vertex(Point &p) : Point(p)
{
}
Vertex *Vertex::cw(void)
{
return static_cast<Vertex *>(_next);
}
Vertex *Vertex::ccw(void)
{
return static_cast<Vertex *>(_prev);
}
Vertex *Vertex::neighbor(eRotDir rotation)
{
return ((rotation... |
0b8e6f097ae8f227bed33b9b585520c6a6614105 | 2d019c633656688051fb71fc1b9bc4fb19202a6f | retrodump/wme | /src/armed/Navigator.cpp | C++ | cpp | 1,050 | permissive | // This file is part of Wintermute Engine
// For conditions of distribution and use, see copyright notice in license.txt
#include "StdAfx.h"
#include "Navigator.h"
namespace Armed
{
//////////////////////////////////////////////////////////////////////////
Navigator::Navigator(QWidget* parent) : QWidge... |
1c6c012d89af16c33b4f32d8cdbd3ef260058fe2 | 640fb7780f287e5378cb7f30dd3d5346ea22a41a | brian8181/regx | /src/create_remap.cpp | C++ | cpp | 9,074 | no_license | #include <iostream>
#include <string>
#include <regex>
#include <map>
#include <fstream>
#include <unistd.h>
using namespace std;
// shell color constants
const string FMT_FG_GREEN = "\e[32m";
const string FMT_UNDERLINE = "\e[4m";
const string FMT_BOLD = "\e[1m";
const string FMT_RESET = "\e[0m";
// regx ... |
ecf509f9dd5e1494b41cf6b08d39217700272c80 | 8688ccadee4ee1d97b1a57bfc9df370bf947308b | Adanos020/PAhAom-Old | /src/program/game/entity/npc/state/NPCMoving.cpp | C++ | cpp | 2,003 | no_license | /**
* @file src/program/game/entity/npc/state/NPCMoving.cpp
* @author Adam 'Adanos' Gąsior
* Used library: SFML
*/
#include <cmath>
#include "../NPCMoving.hpp"
namespace rr
{
NPCState*
NPCMoving::update(sf::Time& delta, NPC* npc)
{
sf::Vector2f offset = npc->m_body.getPosition() - (sf::Vecto... |
35a2aa0a8c85955a34d568c4e883507fecceaa38 | f6a6264f0687fd042c21a1ede5be427db98480f0 | yumoh/catboost_iter | /catboost/app/mode_roc.cpp | C++ | cpp | 3,271 | permissive | #include "modes.h"
#include <catboost/libs/algo/roc_curve.h>
#include <catboost/libs/data_util/line_data_reader.h>
#include <catboost/libs/helpers/exception.h>
#include <catboost/libs/target/binarize_target.h>
#include <library/getopt/small/last_getopt.h>
#include <util/generic/hash.h>
#include <util/generic/utility... |
f63e8d249610939563b6cf875995871a38a8b65a | 63b2fb3bc1bb91a36b08359eeaaa43609c8c0765 | deokhk/Algorithm | /백준/프린터큐.cpp | C++ | cpp | 827 | no_license | #include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
struct dt
{
int pos;
int importance;
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
for(int tn=0; tn<t; tn++)
{
int N,M;
cin>>N>>M;
deque<dt> print;
for(int i=0; i<N; i++)
{
int tmp;
cin>>t... |
307d1882a3d861f6650b68fa3e12b821622412c2 | 328442fbe39dfaca05e1c49756b2801a56aea346 | The-Mad-Pirate/pik | /epf_target.cc | C++ | cc | 52,197 | permissive | // Copyright 2018 Google Inc. All Rights Reserved.
//
// Use of this source code is governed by an MIT-style
// license that can be found in the LICENSE file or at
// https://opensource.org/licenses/MIT.
// Empty if not included by foreach_target.
#ifdef SIMD_ATTR_IMPL
#ifndef EPF_NEW_SIGMA
#define EPF_NEW_SIGMA 0
#e... |
8bc3b12067b9d29213b6f2bc2d0203a2448ac5d9 | f0f5db44393cbbbdfdd41fdc8ddfdfba2d757b36 | BEN2suzuka/proconlib | /AOJ_DPL/dpl_1f.cpp | C++ | cpp | 698 | no_license | // DPL 1_F
// C++14
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, W; cin >> N >> W;
vector<int> v(N), w(N);
for (int i = 0; i < N; i++) cin >> v.at(i) >> w.at(i);
const int INF = 1000000007;
vector<vector<int>> dp(N+1, vector<int>(N*100+1, INF));
dp.at(0).at(0) = 0;
for (int i = 0; i ... |
ff34408113c2f131ae00382d5b05f0cd944503d2 | 3b2f9b673817b05ecf59715f0ee21f3009b76379 | minblock/freecoin | /src/rpc/server.cpp | C++ | cpp | 20,123 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-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 <rpc/server.h>
#include <fs.h>
#include <key_io.h>
#include <random.h>
#incl... |
9159f64f9aa5ddcb28b15a1d34285c907c879010 | 129f2683e023c3a97147e0049608f4abf3d678bd | tbeu/Blat | /full/source/filetype.hpp | C++ | hpp | 427 | permissive | /*
filetype.hpp
*/
#ifndef __FILETYPE_HPP__
#define __FILETYPE_HPP__ 1
#include "declarations.h"
#include <tchar.h>
#include <windows.h>
#include "blat.h"
#include "common_data.h"
extern LPTSTR getShortFileName (LPTSTR fileName);
extern void getContentType (COMMON_DATA & CommonData, Buf & sDe... |
4d17dffeab448702ec9ddd8ad2f120243b25378f | d5f73cc869f36d5eee030fa804e6ca67b97425cf | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-connect/source/model/AgentContactReference.cpp | C++ | cpp | 3,744 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/connect/model/AgentContactReference.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{... |
890b607beb14fa844607cef5754c9fbfd309aee9 | ebdb5c60db6e3d0225b1608bcab0c59adcbc80bc | snyh/dui | /Source/WebCore/svg/SVGFEFuncAElement.cpp | C++ | cpp | 1,467 | no_license | /*
* Copyright (C) 2004, 2005 Nikolas Zimmermann <zimmermann@kde.org>
* Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; eit... |
6849a11946c4f730be90734157cac13e374960ff | b5a204f99c7b2bdd395200338a8205db7e166829 | albarral/tron3 | /tron3_codes/src/tron3/codes/features/LocationCodes.cpp | C++ | cpp | 793 | no_license | /***************************************************************************
* Copyright (C) 2018 by Migtron Robotics *
* albarral@migtron.com *
***************************************************************************/
#include "tron3/codes/features/LocationCodes.h"
namespace tron3
{
LocationCodes::Loca... |
a6911f6cec33ed83e23bb49415183413bde42994 | d60ad59e0adc194ca7e9a0e6ab3427601d960471 | LLNL/fudge | /Merced/Src/param_base.cpp | C++ | cpp | 11,138 | permissive | /*
* ******** merced: calculate the transfer matrix *********
* $Revision: 1 $
* $Date: 2006-02-01 19:06:56 -0800 (Wed, 01 Feb 2006) $
* $Author: hedstrom $
* $Id: param_base.cpp 1 2006-02-02 03:06:56Z hedstrom $
* ******** merced: calculate the transfer matrix *********
*
* # <<BEGIN-copyright>>
* # <<END-cop... |
7c2b5dd3438e7aca8ad510221598e7c2dde8726f | f32bcb91c18376ab84643919246aae99ebab6726 | amine-bouassida/mongo-cxx-driver | /src/mongocxx/test/spec/crud.cpp | C++ | cpp | 7,067 | permissive | // Copyright 2016 MongoDB 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 wri... |
76d8f76fdb4666cb858f61073e6418b99f29783c | 9fd3462023baf4547314db71e83fcf74612a200b | PietroGhg/tesi-ghiglio-llvm | /llvm/lib/Transforms/Utils/LoopSimplify.cpp | C++ | cpp | 36,921 | permissive | //===- LoopSimplify.cpp - Loop Canonicalization Pass ----------------------===//
//
// 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
//
//===---------------------------... |
4017aa70c73247c02b4c38851f93986abfbd180f | 0982986d38224c37351fbe377530f58494477465 | GonzaloMartinezRomero/JSS-metaheuristics-solutions | /AGGE.cpp | C++ | cpp | 12,744 | no_license | /*
* File: AGGE.cpp
* Author: Drebin
*
* Created on 12 de noviembre de 2015, 18:34
*/
#include "AGGE.h"
AGGE::AGGE(int _tamPoblacion,int _numMaquinas,int _numTrabajos) {
this->tamPoblacion=_tamPoblacion;
this->hijos.resize(tamPoblacion);
this->numMaquinas=_numMaquinas;
this->numTrabajos=_numT... |
2d825f09e7fa8939991a36db6231d89ef9234018 | 1325cabf1687cd949f82ba0455179341fa110f1c | joseflorenciocn/OOP244 | /w4/at_home/Passenger.cpp | C++ | cpp | 2,787 | no_license | // TODO: add your headers here
#include <iostream>
#include "Passenger.h"
#include <cstring>
#include <iomanip>
using namespace std;
// TODO: continue your namespace here
namespace sict
{
// TODO: implement the default constructor here
Passenger::Passenger()
{
setEmpty();
}
Passenger::~Pas... |
fb6248be34cb082b0e230939e112dae3f6991a7b | 8aa6ae9b3b1410db451f96466f4dd0b2ac41606f | RickyJun/live_plugin | /back/RtmpLivePushSDK/boost/boost/spirit/home/karma/auxiliary/lazy.hpp | C++ | hpp | 9,458 | permissive | // Copyright (c) 2001-2011 Hartmut Kaiser
// Copyright (c) 2001-2011 Joel de Guzman
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#if !defined(BOOST_SPIRIT_KARMA_LAZY_MARCH_27_2007_1231PM)
#define BOOST_... |
cd5efb1cb2485e6d13dc8dd446d66820d90be80d | 07aa9b36558d3d12322ecd8687409e911b03edae | palmd/DopeCoinV3 | /src/main.cpp | C++ | cpp | 159,301 | permissive | // Copyright (c) 2009-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 "alert.h"
#include "checkpoints.h"
#include "db.h"
#include "net.h"
#incl... |
7f43a80ebc9797699bbd2ad94425b2f4aed739aa | 5e0064c5be0999d0d8dd8b5d54055a0ac135288d | TencentCloud/tencentcloud-sdk-cpp | /iai/src/v20180301/model/GetGroupInfoResponse.cpp | C++ | cpp | 8,703 | permissive | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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
... |
377e78266eacf0467e6369d648bd20890af970bd | 5528d0d1ec0a7d55133c327feef39e3f1d7e8834 | nimia/flying_dutchman | /ba.cpp | C++ | cpp | 4,780 | no_license | /*
Copyright (C) 2003, Guillaume-Latapy - LIAFA (University of Paris 7)
Disclaimer: this code is provided 'as-is', without any express or
implied warranty. In no event will the authors be held liable for
any damages arising from the use of this software.
Permission is granted to anyone to use this code for ... |
086e9867e8f0bd8476fda1314dd1cefa4659f6dd | 502cf99dbb15e1ac6e641cd50be3158cdd09f609 | developmentseed/osrm-backend | /src/partitioner/dinic_max_flow.cpp | C++ | cpp | 12,170 | permissive | #include "partitioner/dinic_max_flow.hpp"
#include "util/integer_range.hpp"
#include <algorithm>
#include <limits>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
namespace osrm
{
namespace partitioner
{
namespace
{
const auto constexpr INVALID_LEVEL = std::numeric_limits<DinicMaxFlow::Level>::m... |
ad2362c166ea8dac2af62c6c485e08ee1d1397c1 | af247616859112cf5959582c8567703beeb30163 | Ph0en1xGSeek/ACM | /NowCoder/瞌睡.cpp | C++ | cpp | 690 | no_license | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> arr(n);
vector<int> wake(n);
for(int i = 0; i < n; ++i) {
scanf("%d", &arr[i]);
}
for(int i = 0; i < n; ++i) {
scanf("%d", ... |
6b3f20d38b68331962219aea3390a9048e37aa4d | 4e8054dd9d88f8563d8b0733348efba29efafac0 | dahahua/pap_wclinet | /client/Client/CEGUI/CEGUI/src/elements/CEGUIScrollablePane.cpp | C++ | cpp | 18,595 | no_license | /************************************************************************
filename: CEGUIScrollablePane.cpp
created: 1/3/2005
author: Paul D Turner
*************************************************************************/
/*************************************************************************
Crazy E... |
7ac6125f43376600d47c5f3f9aa9b4b55403cf7e | d863b14f52a84892aff4b4ae020f3414621c7b20 | koikeatusi/kazimookimasita | /Project1/Project1/問3.cpp | C++ | cpp | 468 | no_license | #include<stdio.h>
#include<conio.h>
int main(void)
{
//ÅåHP2500@HP1200
//³¢¾¢HP100*15 100%=15 50=7.5
//»ÝÌÌ
double FHp = 2500;
double HP = 1200;
float a = 15.0;
float b = 0;
int c = 0;
printf("%lf\n", HP / FHp * 100);
b = HP / FHp;
c = a*b;
for (int j = 0; j < c; j++)
{
... |
a214434a6e1c1ee6fab21cb484ccb7acc6a6dfeb | 214509df102a44eb4912b429effbf8f38a0d03ed | GreenApple-jsy/Algorithm | /하샤드 수.cpp | C++ | cpp | 252 | no_license | #include <string>
#include <vector>
using namespace std;
bool solution(int x) {
int sum = 0;
int t = x;
while (t >= 10) {
sum += t % 10; //각 자리수 더하기
t /= 10;
}
sum += t;
if (x % sum == 0)
return true;
else
return false;
}
|
0b8e406708892e6c31e2d07910c0bb7c2f99ff55 | ed852038602b35b6334ef461e5eb13c3d56b1efd | rosoareslv/SED99 | /c++/rdkit/2018/8/AtomPairs.cpp | C++ | cpp | 22,275 | no_license | // $Id$
//
// Copyright (C) 2007-2013 Greg Landrum
//
// @@ All Rights Reserved @@
// This file is part of the RDKit.
// The contents are covered by the terms of the BSD license
// which is included in the file license.txt, found at the root
// of the RDKit source tree.
//
#include <GraphMol/RDKitBase.h>
#inclu... |
aed32cc8bafe04ffc5b62902c8cf93d85e8c94ed | cc499ac1befdd7f611ba5d3aa4a1ca2cb55a5613 | yao23/DataStructure_Algorithm | /queue.cpp | C++ | cpp | 1,555 | no_license | #include <iostream>
using namespace std;
#define MAX 5 // MAXIMUM CONTENTS IN QUEUE
class queue
{
private:
int t[MAX];
int al; // Addition End
int dl; // Deletion End
public:
queue() {
dl = -1;
al = -1;
}
void del() {
int tmp;
if( dl == -1 )
cout << "Q... |
b946d3f2f37b5277c53ba9b409bac8eed6cca84c | aa64edbcb3be4ec5164dda31fda65a32fe0c36c7 | zhamppx97/dogecash | /src/qt/dogecash/proposaldialog.cpp | C++ | cpp | 13,274 | permissive | // Copyright (c) 2017-2018 The Bulwark Developers
// Copyright (c) 2019 The Phore Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H)
#include <config/dogecash-config.h>
#endif
#include <fs... |
e52830a2fc59d319159563df61ae915dd1f70442 | 7fa2f055aeacfd9787861e35e4f281b48125694a | wovo/hwlib | /library/core/hwlib-adc.hpp | C++ | hpp | 2,028 | permissive | // ==========================================================================
//
// File : hwlib-adc.hpp
// Part of : C++ hwlib library for close-to-the-hardware OO programming
// Copyright : wouter@voti.nl 2017-2019
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICEN... |
8b1c5fb0ecd42f65756f8519db3b6d814f8ddc7a | 1ab573a13fb12976375a6e2825e78f105f011157 | marcush1022/PracticeCplus | /运算符重载练习(String).cpp | C++ | cpp | 1,813 | no_license | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
using namespace std;
class String
{
char *mdata;
public:
String();
~String();
String(const char *data);
String(const String &other);
String operator+(const String &other);
String &operator=(const St... |
d4c9622773d3cf6cb1e16752814f8b2b6a904367 | d08b28b23fc7290d1b98227caae409acccca857d | lrhel/Waybar | /include/modules/mpd.hpp | C++ | hpp | 2,205 | permissive | #pragma once
#include <fmt/format.h>
#include <mpd/client.h>
#include <condition_variable>
#include <thread>
#include "ALabel.hpp"
namespace waybar::modules {
class MPD : public ALabel {
public:
MPD(const std::string&, const Json::Value&);
auto update() -> void;
private:
std::thread periodic_updater();
st... |
2a9c52b6086906b3e21de4ef3e33067b2c26de4f | 20b0ad0e7d4cbfd94c30175dfc9afcf9819124ac | bota999/Lab5 | /ggx.cpp | C++ | cpp | 261 | no_license | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
for (int i=1000; i>=0; --i){
if (a*i*i*i+b*i*i+c*i+d==0){
cout << i << endl;
}
}
return 0;
} |
6a5ce8844dabcc8e5593074405e7dc41188a9161 | 03a227f32e05c2a898c703d4a7e5f08a1bfd5f48 | HandsomeYingyan/v831-softwinner | /eyesee-mpp/middleware/v459/media/librender/CedarXNativeRenderer.cpp | C++ | cpp | 9,673 | no_license | /*
* Copyright (C) 2009 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.