blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 986
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 23
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 145
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 122
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ffdf5c631296bafb3c52141acf90273505d77966 | ba8603ae6f0df3480c85c51f3717dfdda0435ea2 | /Source/VehicleCombatGameCPP/Base/Base_TimerItem.h | 54587a31b18395360a066c929d4973460ea9d3de | [] | no_license | Needix/VehicularCombatGame_CPP | 909abba06e1908761ab2d870164511a8e9befcfc | 2c6d9ca5812b1329b2d7be83e9cd6796a2b09bb0 | refs/heads/master | 2020-03-18T02:33:18.395607 | 2018-06-10T19:53:59 | 2018-06-10T19:53:59 | 134,196,255 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 581 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "Engine/Texture2D.h"
#include "Base/Base_Item.h"
#include "Base_TimerItem.generated.h"
/**
* A item which gets enabled after a click and stays active for a certain amount of time
*/
UCLAS... | [
"needcoding@gmail.com"
] | needcoding@gmail.com |
e7cbfb502b4aca4306369cb6654f6e275b149345 | b61f44a0d3bb70ff42b1627f2fd064d0ceb20561 | /src/version.h | f74fe6e4460bae3987d0b40cec0bae580bb40f9b | [
"MIT"
] | permissive | xrobau/stablecoin | 1e1dd664ff59f0f78816a8804ab59f74c16fc819 | 664c5d22f7abf4a6621c36d3961e4e0d9ae20131 | refs/heads/master | 2021-01-15T23:27:59.504027 | 2013-06-23T21:13:53 | 2013-06-23T21:13:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,667 | h | // Copyright (c) 2012 The Bitcoin developers
// Copyright (c) 2012 Litecoin Developers
// Copyright (c) 2013 StableCoin Developers
// Copyright (c) 2013 StableCoin Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#i... | [
"stablecoin@live.com"
] | stablecoin@live.com |
9dd991c87db2d51b0b34183098531e736ce22d4c | 0e76671d6bff742b45b10eeadf373d72414c05c1 | /benchmarks/bm1_put_get.cpp | eb57731bdcaaa7fc7ccc835d7607659018afaceb | [] | no_license | victorj44/851_project | 35e6f3916d1756b7d01fc2dd1141928099037946 | d4f671310f75fef4988e483a89a0d6cd32e669ae | refs/heads/master | 2021-01-19T05:53:24.000214 | 2012-05-18T01:48:02 | 2012-05-18T01:48:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,248 | cpp | /* **************************************
* benchmark 1 - pure reads
* 10^6 elements in hash maps
* 10^8 gets per hash map
* - C++11 unordered_map
* - Boost hash_map
* - gcc/ext hash_map
* - linear hashing w/ tabulation
* - linear hashing w/ mult.hash.
* - quadr hashing w/ tabulation
* - quadr hashing w/ mult... | [
"sanja89@gmail.com"
] | sanja89@gmail.com |
ff6b90234be409103027b8cd595bbd7970ae4676 | 4476dd05f9be3b80d95037d49f6b52c1569ab27b | /060/square.cc | 8ebd3d04e57f4fcc33a7290e575c559344fc11e8 | [] | no_license | haampie/project-euler | 481e55815c42a0252cac5fddb18da78757a45665 | 000dc0a4b58a001b9538b7782fcf5098d509d76e | refs/heads/master | 2021-01-04T02:31:55.545112 | 2018-11-09T18:57:15 | 2018-11-09T18:57:15 | 71,645,124 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,109 | cc | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
// 10^k p1 + p2 mod 30 = 10*(p1 mod 30) + (p2 mod 30) mod 30
// 10^k p2 + p1 mod 30 = 10*(p2 mod 30) + (p1 mod 30) mod 30
// Idea: take two potential primes p1 & p2, not divisable
// by 2, 3 and 5, and see whether 10^k p1 + p2 and vice versa... | [
"harmenstoppels@gmail.com"
] | harmenstoppels@gmail.com |
03d814bb5bc849b8cedc6cade8f69f01639cabcc | 64c27514d5d29150121ca2b97b43b042f706cd5f | /Contest/BKDN_Stack_Queue/DS3_3/main.cpp | e396ac1af771cc7d65b5ce0ca6957a62c8e9e98e | [] | no_license | tienit150198/ACM | f4fdb8eaeccd3db02624c593e56f0fa5d233bee1 | a17c9ae1402376167dec5dd49a8aa508ad824285 | refs/heads/master | 2020-06-12T09:50:50.137304 | 2019-06-28T13:27:48 | 2019-06-28T13:27:48 | 194,261,865 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 644 | cpp | #include <bits/stdc++.h>
#define ll long long int
#define Max 1000007
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
ll n, num = 1;
stack<ll> s;
int main() {
fast
// freopen("input.in", "r", stdin);
cin >> n;
while(n--){
ll q, x;
cin >> q;
... | [
"tienit150198@gmail.com"
] | tienit150198@gmail.com |
8ec980de3e1d4023f6eb2388d9c7df3f56dc189a | 1865967c509eecfe1de951fcffd956af8ac7ca9e | /GeeksForGeeks_TopicWise/Queues/Queue Using Two Stacks.cpp | 0160202b590c649c20b8d7d0b4b6574d144c4b34 | [] | no_license | avinashmallik62/SDE_PROBLEMS | ba11441725278184dad9cc32229741cb13dffe06 | 40ad7fac9325b1710d4a9dd03e55fff3e9d427a2 | refs/heads/main | 2022-12-20T17:15:04.041098 | 2020-10-06T18:44:50 | 2020-10-06T18:44:50 | 300,574,941 | 2 | 8 | null | 2020-10-07T10:42:41 | 2020-10-02T10:09:19 | C++ | UTF-8 | C++ | false | false | 1,264 | cpp | #include<bits/stdc++.h>
using namespace std;
class StackQueue{
private:
stack<int> s1;
stack<int> s2;
public:
void push(int B);
int pop();
};
int main()
{
int T;
cin>>T;
while(T--)
{
StackQueue *sq = new StackQueue();
int Q;
cin>>Q;
while(Q--){
... | [
"silentknight5245@gmail.com"
] | silentknight5245@gmail.com |
9369547c90c1976cddf490793ba2d595396931f3 | 9618aeab5df07ffd1d4f204c8cc3af1a2345d420 | /ui/ozone/platform/wayland/wayland_buffer_manager_unittest.cc | 6c262a840f83569cc20523909e0817c7d11d2cfe | [
"BSD-3-Clause"
] | permissive | dmt3o/chromium | 3709c0c73e37aec82dc44d2bbe234d1f1829c32f | d368d5937f235033bd495a57005587ab275536b4 | refs/heads/master | 2022-12-19T04:43:33.801508 | 2020-10-02T02:56:57 | 2020-10-02T02:56:57 | 279,344,900 | 0 | 0 | BSD-3-Clause | 2020-10-02T02:50:00 | 2020-07-13T15:43:43 | null | UTF-8 | C++ | false | false | 49,260 | cc | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/ozone/platform/wayland/gpu/wayland_buffer_manager_gpu.h"
#include "ui/ozone/platform/wayland/host/wayland_buffer_manager_host.h"
#include <d... | [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
83909c587b927194e8fb9da5b6256da4c599fefb | cd10a6c464d7017b864da05ce0e8ed2a484c5b09 | /src/chain.h | c42874d90749c07564f04acb35eeec172e160da0 | [
"MIT"
] | permissive | mirzaei-ce/core-filbit | 63b4482f30d7212c73480c1206464201422f2e79 | 415073034f471c38a60223af52b8da76c302ae1c | refs/heads/master | 2021-08-14T19:07:34.947832 | 2017-11-16T14:54:42 | 2017-11-16T14:54:42 | 110,984,372 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,528 | h | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef FILBIT_CHAIN_H
#define FILBIT_CHAIN_H
#include "arith_uint256.h"
#includ... | [
"mirzaei@ce.sharif.edu"
] | mirzaei@ce.sharif.edu |
b3f748f44300de582a845bbe33b93afae2018eb8 | 322586fd62facf9563df4e2ba99d2cc10ee74c6b | /160/src_2_4.cpp | 4ee0d4b4f946d6baced34eedab3ec66b1005e734 | [] | no_license | WavesUR/leetcode-study | 82fe60ccb65b243a82731951257ad36186bd5784 | 0564b36237dbb50087bc7dd51932df1f5eb37e83 | refs/heads/master | 2021-01-13T12:19:03.696019 | 2018-12-03T05:19:12 | 2018-12-03T05:19:12 | 77,957,433 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,687 | cpp | #include <iostream>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cctype>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode *getInte... | [
"waves.ur.ee@gmail.com"
] | waves.ur.ee@gmail.com |
f2dff4da3e67705842ace22702a008ba27b12e23 | 53fb17dd707829a99cfdb1df690a2d7daaf6f998 | /Point.cpp | 2f365f68a99c41a7aeb9d493b5a41a41224d675c | [] | no_license | leefige/Metro-helper | ea30d78548ec059183d92ecd1080f0e835050ac6 | 589ae22e6dfbbaf7dc81623b46142673b34c686b | refs/heads/master | 2020-12-31T07:43:44.807563 | 2017-06-08T17:42:38 | 2017-06-08T17:42:38 | 86,557,416 | 2 | 0 | null | 2017-05-22T12:24:19 | 2017-03-29T08:31:28 | C++ | UTF-8 | C++ | false | false | 722 | cpp | //
// Created by 乔逸凡 on 2017/3/31.
//
#include "Point.h"
#include <cmath>
Point Point::operator - (const Point &b) {
Point c;
c.x = x - b.x;
c.y = y - b.y;
return c;
}
Point Point::operator + (const Point &b) {
Point c;
c.x = x + b.x;
c.y = y + b.y;
return c;
}
double Point::len() {
... | [
"LegaDyan@gmail.com"
] | LegaDyan@gmail.com |
79b3757c47828a19145c371cb8702dd9d66f3ebf | 3ae80dbc18ed3e89bedf846d098b2a98d8e4b776 | /src/Media/Decoder/G711muLawDecoder.cpp | fa3a5952764f9e575fe39f46420a8b9b8d391b2a | [] | no_license | sswroom/SClass | deee467349ca249a7401f5d3c177cdf763a253ca | 9a403ec67c6c4dfd2402f19d44c6573e25d4b347 | refs/heads/main | 2023-09-01T07:24:58.907606 | 2023-08-31T11:24:34 | 2023-08-31T11:24:34 | 329,970,172 | 10 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 4,977 | cpp | #include "Stdafx.h"
#include "MyMemory.h"
#include "Media/Decoder/G711muLawDecoder.h"
Media::Decoder::G711muLawDecoder::G711muLawDecoder(Media::IAudioSource *sourceAudio)
{
Media::AudioFormat fmt;
this->sourceAudio = 0;
this->readBuff = 0;
this->readBuffSize = 0;
this->align = 0;
sourceAudio->GetForma... | [
"sswroom@yahoo.com"
] | sswroom@yahoo.com |
da6b44fa0e4323198587b9730831710220b30505 | 0467000a05e2838d70319011c7e27cc355a9577a | /rmSquarterNumber.cpp | 23242c41c97feaf57b89d863fd9fd059817ff622 | [] | no_license | Newstar1994/algorithm | 5d747bc3f127399f1b5caf92c897b0cfe93ba5fb | 0c8ca4eee52951787d1f41cda765a3cc31e5ee86 | refs/heads/master | 2020-03-28T20:29:14.871356 | 2018-09-26T05:19:25 | 2018-09-26T05:19:25 | 149,075,098 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 741 | cpp | #include <stdio.h>
#include <math.h>
#include <iostream>
/*
for i to n, remove the complete squarter number and sort the left number using
index for 1 to n - m; where m is the numbers of complete squarter number before;
loop the above opeater and find the laste one left number.
*/
using namespace std;
int find_x(int n)... | [
"xiegx@xiegengxindeMacBook-Air.local"
] | xiegx@xiegengxindeMacBook-Air.local |
cf20979c8524ed59e22dace89a5a319d7df20b11 | 9aa5f7142ab1cb6bec933610eee14eaa9247ac1e | /src/chainparams.h | dfea881844c43f55cf2bccf2f37d52c1c3e08c33 | [
"MIT"
] | permissive | deyoonoo/deyoonoo | 09327ce4c2d09b5b2c2695563272be6df0c2a100 | c4e83850a73b5e1ffc3ec8de463e690a3b5c71f3 | refs/heads/master | 2020-09-26T07:55:32.671735 | 2019-12-06T02:49:37 | 2019-12-06T02:49:37 | 226,208,496 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,125 | h | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2018 The PIVX developers
// Copyright (c) 2019 The CryptoDev developers
// Copyright (c) 2019 The deyoonoo developers
// Distributed under the MIT software l... | [
"debian@guest.guest"
] | debian@guest.guest |
ed2879e4a615271683a41e2b0551ffd479bf2dac | bda7d1bfc800e1bcf6a6e60ae3338b0d4f984881 | /src/CULT/ChromaticPoint.cpp | 0f181b0223db903205d1141ac3637d3ebb025114 | [] | no_license | sylla-linoha/CULT | c0bb7f14d54cdba70ff310ff4a67d4402a0f86b5 | ea5d453cd82b6361a1b735128b6a69b705316267 | refs/heads/master | 2022-10-06T06:28:21.591192 | 2012-01-30T10:26:57 | 2012-01-30T10:26:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 438 | cpp | #include <iostream>
#include <cstdlib>
#include "ChromaticPoint.h"
using namespace cv;
using namespace std;
ChromaticPoint::ChromaticPoint(Point _pt, double _dist)
:leftPt(_pt), dist(_dist){}
Point ChromaticPoint::getPt()
{
return leftPt;
}
void ChromaticPoint::setPt(Point pt)
{
leftPt = pt;
}
d... | [
"admin@cybunk.com"
] | admin@cybunk.com |
004548f47c60f9aa7f183ea06962a9973b29e916 | 703d887e869b7d510eec309d7bfb0acc2da59c10 | /damBreakmodified/0.95/nut | bc7bf5dab4db54e0c752b56a9d66d4f7d53ebbec | [] | no_license | luiscascelli/OpenFoam | a063df7af02b89abdc36268aaa21f5b012963b74 | 9ff3218c8ba584fe15017c766aed9afccf5ddd00 | refs/heads/master | 2023-08-01T00:12:25.059964 | 2021-09-14T19:37:54 | 2021-09-14T19:37:54 | 406,498,391 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 70,002 | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 8
\\/ M anipulation |
\*-------... | [
"luis.cascelli@gmail.com"
] | luis.cascelli@gmail.com | |
81590f2b6b334eb7e5228c5bc0bb137803f90efc | 5c2720f0eea3c45e8619385f087d91fff23f2675 | /1080.cpp | 6e3eb5190868e97577d50222ccff6a0ea7bb1d75 | [] | no_license | Whituru/BAEKJOON_OnlineJudge | 2f3eaebe489e2009d6b655b78266e42144270ae9 | 8c67e1945b83680cf3f861de2fef6b9f7fe7ea1b | refs/heads/main | 2023-06-11T19:54:52.164278 | 2021-07-02T11:49:23 | 2021-07-02T11:49:23 | 372,219,023 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 992 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <array>
using namespace std;
int arr[50][50];
int cnt = 0;
void flip(int x, int y){
if(arr[x][y] == 1){
//다르니까 뒤집자.
cnt++;
for(int i=x; i<x+3; i++){
for(int j=y; j<y+3; j++){
if(arr[i][j] == 1){
arr[... | [
"hentsru5619@gmail.com"
] | hentsru5619@gmail.com |
87c7c4960103b97688394d1e6460ceabc7d6e1cb | 2f78e134c5b55c816fa8ee939f54bde4918696a5 | /code/ai/ainavgraphmanager.h | c23dbf1db80d5812405643e013a044e711d823db | [] | no_license | narayanr7/HeavenlySword | b53afa6a7a6c344e9a139279fbbd74bfbe70350c | a255b26020933e2336f024558fefcdddb48038b2 | refs/heads/master | 2022-08-23T01:32:46.029376 | 2020-05-26T04:45:56 | 2020-05-26T04:45:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,736 | h | /***************************************************************************************************
*
* CLASS CAINavGraphManager
*
* DESCRIPTION
*
* NOTES
*
***************************************************************************************************/
#ifndef _AINAVGRAPHMANAGER_H
#define _AINAVGRAPHMANAG... | [
"hopefullyidontgetbanned735@gmail.com"
] | hopefullyidontgetbanned735@gmail.com |
d0757d209a50f96f6fbfc9ce5b62dc7c9d0a5375 | e05ee73f59fa33c462743b30cbc5d35263383e89 | /sparse/src/zpcg.cpp | e5940d4165ef5f319001672c144bd8d996ebfea5 | [] | no_license | bhrnjica/magma | 33c9e8a89f9bc2352f70867a48ec2dab7f94a984 | 88c8ca1a668055859a1cb9a31a204b702b688df5 | refs/heads/master | 2021-10-09T18:49:50.396412 | 2019-01-02T13:51:33 | 2019-01-02T13:51:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,548 | cpp | /*
-- MAGMA (version 2.4.0) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
@date June 2018
@author Hartwig Anzt
@precisions normal z -> s d c
*/
#include "magmasparse_internal.h"
#define RTOLERANCE lapackf77_dlamch( "E" )
#d... | [
"sinkingsugar@gmail.com"
] | sinkingsugar@gmail.com |
f6d628e48bb09288efdc289dcbb7cb9ff9cd6b23 | fd6fa97508400a0fb24f374e2b356dbd3b9a5f98 | /src/aggregatefunctminexpression.cpp | ad8cf923c0d5e539bc06c02cd8c52c65bbdc164e | [
"BSD-3-Clause"
] | permissive | zacharywhitley/gcx-engine | d0a715480a9b85af7a740281f8ae1933fab9dff8 | 4e8a2a6c2d55cae29698a3e67daee1215676bb93 | refs/heads/master | 2020-05-29T10:33:12.251064 | 2019-05-28T20:41:56 | 2019-05-28T20:41:56 | 189,096,646 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,730 | cpp |
/*
| Author: Michael Schmidt;
| Gunnar Jehl
|
| ************************* SOFTWARE LICENSE AGREEMENT ***********************
| This source code is published under the BSD License.
|
| See file 'LICENSE.txt' that comes with this distribution or
| http://dbis.informatik.uni-freiburg.de/index.php?project... | [
"mschmidt00@ad718d26-2018-4b5f-a52a-3114c437cfa5"
] | mschmidt00@ad718d26-2018-4b5f-a52a-3114c437cfa5 |
f39d3dddc2402f9e1889a16c13732387d7d80cb2 | bf1fb2462ee6d990e3fe60c82cd284b4c253e6ce | /hogarPersonas.cpp | 33fd052f933124e295999af1a8785bad217d4e6c | [] | no_license | Ejercicios-Desarrollo/D.Software1-Ejercicios-Modulo-1 | ef4c5792ce871c7dfcb4a82e0512c17a248dc269 | 521f6e07e996f890d31c137e53e6db7aba6edc07 | refs/heads/master | 2022-03-08T15:47:06.408675 | 2019-08-15T00:53:21 | 2019-08-15T00:53:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,646 | cpp | // hogarPersonas.cpp : Este archivo contiene la función "main". La ejecución del programa comienza y termina ahí.
//
/*Modelar un hogar, que tenga distintas partes de la casa, viven 4 personas inicialmente, con nombre, apellido, edad
saber donde duerme cada una de las personas, la habitación tiene coordenada y quier... | [
"noreply@github.com"
] | Ejercicios-Desarrollo.noreply@github.com |
64cfe73beac670b7dafe208c1ea1000f0e1665a0 | 41c4c7421bf346e246e550334ee0cc19f8f17485 | /DesignMode/Subtraction.cpp | 90bbe91e2049457696f1d31a1345f3484415813b | [] | no_license | xingyuan1hao/DesignPattern | 31e89ede424269f64f256b130db9086266acf030 | add44c2b82fe3d4e69c02b2592685aeff4173a7e | refs/heads/master | 2020-04-05T03:59:58.567733 | 2018-12-05T10:50:35 | 2018-12-05T10:50:35 | 156,534,374 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 183 | cpp | #include "StdAfx.h"
#include "Subtraction.h"
Subtraction::Subtraction(void)
{
}
Subtraction::~Subtraction(void)
{
}
double Subtraction::getResult()
{
return numberA - numberB;
} | [
"ahhlin@163.com"
] | ahhlin@163.com |
59868dcfca6f01a1e754f3fd4b0c0e763035643c | 89292be10b520779772588bbd90184e4f6d00748 | /net/spdy/hpack_huffman_table.cc | 5372b97704f66ad9f4a32ed07cf455aaee3c055a | [
"BSD-3-Clause"
] | permissive | anirudhSK/chromium | 2cd85630932a05fa065a5d9a1703de33e9b5c483 | a8f23c87e656ab9ba49de9ccccbc53f614cdcb41 | refs/heads/master | 2016-09-11T03:25:35.744751 | 2014-03-14T15:59:45 | 2014-03-14T15:59:45 | 10,112,188 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 10,522 | cc | // 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 "net/spdy/hpack_huffman_table.h"
#include <algorithm>
#include <cmath>
#include "base/logging.h"
#include "net/spdy/hpack_input_stream.h"
#incl... | [
"jgraettinger@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98"
] | jgraettinger@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98 |
7f26331951e96d29f955822193e70de9dead3d5b | 7300301d5d42b0ac5de65dbb6b59ab1a954af41b | /csacademy/practice/attack-and-speed.cpp | d4a3f3d13015af4b8c637185074c29757042c4e0 | [] | no_license | carnivorous-hotdog/cp | c46bf7824895d302c518b0e1289e7e65458caa5e | 41c7eee3770b5efc8bcb7213780499754959ec81 | refs/heads/master | 2022-08-21T19:32:37.964118 | 2020-05-24T12:29:03 | 2020-05-24T12:29:03 | 241,745,227 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,348 | cpp | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vii vector<int, int>
#define ll long long
#define pb push_back
#define mp make_pair
#define endl '\n'
#define idk ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <type... | [
"makkoncept.cp@gmail.com"
] | makkoncept.cp@gmail.com |
62c6899681b30ebe0929095ce51d2968d22c87c9 | dac5254630fefae851da7c843dcab7f6a6af9703 | /Win32/Sources/Application/Preferences_Dialog/CPreferencesDialog.cp | 8ce48085066fc45ffc06931894ead572e40d7a48 | [
"Apache-2.0"
] | permissive | gpreviato/Mulberry-Mail | dd4e3618468fff36361bd2aeb0a725593faa0f8d | ce5c56ca7044e5ea290af8d3d2124c1d06f36f3a | refs/heads/master | 2021-01-20T03:31:39.515653 | 2017-09-21T13:09:55 | 2017-09-21T13:09:55 | 18,178,314 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 43,052 | cp | /*
Copyright (c) 2007-2009 Cyrus Daboo. 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
Unle... | [
"svnusers@a91246af-f21b-0410-bd1c-c3c7fc455132"
] | svnusers@a91246af-f21b-0410-bd1c-c3c7fc455132 |
e3ed932c7623fc6b749ea994630bafa3623c5997 | 2a7e77565c33e6b5d92ce6702b4a5fd96f80d7d0 | /fuzzedpackages/PReMiuM/src/include/PReMiuMModel.h | 99d7c61fa5e0aed206a4e733fff65c5dd8ef16bf | [] | no_license | akhikolla/testpackages | 62ccaeed866e2194652b65e7360987b3b20df7e7 | 01259c3543febc89955ea5b79f3a08d3afe57e95 | refs/heads/master | 2023-02-18T03:50:28.288006 | 2021-01-18T13:23:32 | 2021-01-18T13:23:32 | 329,981,898 | 7 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 126,437 | h | /// \file PReMiuMModel.h
/// \author David Hastie
/// \brief Header file for model specification for PReMiuMpp
/// \note (C) Copyright David Hastie and Silvia Liverani, 2012.
/// PReMiuM++ is free software; you can redistribute it and/or modify it under the
/// terms of the GNU Lesser General Public License as publis... | [
"akhilakollasrinu424jf@gmail.com"
] | akhilakollasrinu424jf@gmail.com |
02fba24eeac0425f22f66fb4a7960086bbd617b3 | 9a66d8339de7cf8debcd79b2d6bc4b669245087e | /王玥蕴/第3次作业-2017310340-王玥蕴-金实/6-22.cpp | 1792a369ceb8f91ef8ebb3a12712b9b262c70224 | [] | no_license | jinrongsyb17/homework-space | 391183e268f1a09e586a18e4cbe2735b59173074 | f0c8fe0c17c6fb08c55d967899d9b26a1782b0e3 | refs/heads/master | 2020-03-28T14:40:12.876141 | 2019-01-02T04:57:27 | 2019-01-02T04:57:27 | 148,510,153 | 9 | 18 | null | 2018-09-18T11:05:38 | 2018-09-12T16:33:38 | C++ | GB18030 | C++ | false | false | 448 | cpp | #include<iostream>
#include<string>
using namespace std;
string reverse(string&s) {
if (s.length() > 1) {
string sub = s.substr(1, s.length() - 2);
return s.substr(s.length() - 1, 1) + reverse(sub) + s.substr(0, 1);
}
else
return s;
}
int main() {
string s;
cout << "输入一个字符串：";
cin >> s;
cout... | [
"noreply@github.com"
] | jinrongsyb17.noreply@github.com |
257461c6936fe93e3da5cb7aa82879e3c96a512b | 83f9051a64a747b28bdbd3cb60f711dd8dc0cfbe | /poro/source/poro/desktop/platform_desktop.cpp | d7f90abdd6e147edec791870ba11d7c566d9b5aa | [
"Zlib"
] | permissive | gummikana/qr_test | 0311608fe82acd7d4879a44f4111e30bc8840d0f | 9143353e59238a7767b02d18c446f2e47172a6b5 | refs/heads/master | 2021-01-20T08:49:01.625142 | 2015-09-08T15:15:36 | 2015-09-08T15:15:36 | 39,264,257 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,160 | cpp | /***************************************************************************
*
* Copyright (c) 2010 - 2012 Petri Purho, Dennis Belfrage
*
* This software 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 soft... | [
"petri.purho@gmail.com"
] | petri.purho@gmail.com |
f910257047c69527dd5c4fc4ee8aa57b54ae1bc0 | ced23fd21573b7be8689005cdd56ed829c336bd3 | /extlibs/sqrat/include/sqrat/sqratVM.h | 48a909300135453b047fa0d2c1518345d12a5291 | [] | no_license | zackthehuman/asobiba | 847db04f1f758902cc7c915cd5857972947cf376 | 541457d657016e7bb4396f16cd19350faa8af581 | refs/heads/master | 2021-01-10T19:41:22.961116 | 2013-09-25T04:10:10 | 2013-09-25T04:10:10 | 9,310,171 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,145 | h | // wrapper for the Squirrel VM under Sqrat
//
// Copyright (c) 2011 Alston Chen
//
// This software 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 sof... | [
"zack@zackthehuman.com"
] | zack@zackthehuman.com |
a1388963371dbcca4e63814d13565708a69d2553 | a74146b9020fe1a5fe5ba4c29064206aabdcb0f0 | /term2/task3/salesman/graph.cpp | 7fc6ce322303ca07b0902a33457fe9eb8486c2aa | [] | no_license | sungulnara2000/term2 | 246383387e9cf6b6fe01bf53e94f58779d3e4470 | 60905e81edfbe07a46870fb7d301082711e2efef | refs/heads/master | 2022-01-05T15:43:04.738202 | 2019-05-18T12:00:45 | 2019-05-18T12:00:45 | 172,383,024 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,565 | cpp | //
// Created by gulnara on 25.04.19.
//
#include "graph.h"
using std::numeric_limits;
MatrixGraph::MatrixGraph(int vertexCount) : verticesCount(vertexCount),
weightMatrix(vertexCount, vector<float>(vertexCount, std::numeric_limits<int>::max())) {
for (int i = 0; i < weigh... | [
"sungulnara2000@mail.ru"
] | sungulnara2000@mail.ru |
38ed8a0d3b624dd7afd6b9d9ca7856827fbdd8b9 | a31a8fbea9538fbd7650e253faf295fcc22cb303 | /Week_4/files_and_streams/rw_file/main.cpp | 4d4c4ea5df083616253742f7041d8995883d4b01 | [] | no_license | GAlekseyV/White-belt | a6a8b0f7f5397ba5d448059b3fa189dfea170b36 | 8bc25ae648841979c5e8d4bd00337e13952cbfd1 | refs/heads/master | 2022-05-14T06:57:22.867182 | 2022-04-10T11:32:20 | 2022-04-10T11:32:20 | 220,627,795 | 1 | 0 | null | 2022-04-10T08:56:04 | 2019-11-09T10:45:05 | C++ | UTF-8 | C++ | false | false | 619 | cpp | /*
* Cчитайте все содержимое файла input.txt, но на этот раз выведите его в файл output.txt.
* Точно так же гарантируется, что содержимое файла input.txt заканчивается переводом строки.
*/
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main() {
string line;
ifstream input(... | [
"galekseyv@gmail.com"
] | galekseyv@gmail.com |
acb435a027d37ea0c4bbfd41bf044801457598cd | ea34252a9daa13d015d68494a6a5d18cd60263ec | /include/ircd/m/event/fetch.h | 34ee93ec4c0bc3916794fbcc35ac29ddffd8f07e | [
"BSD-3-Clause",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | TurBoss/construct | 711cec9bf6dcebbf51f5dda2697d46b558ed87fd | beda5abc2ab884562253324eeeeca7f8789c1891 | refs/heads/master | 2020-04-12T05:50:51.098932 | 2018-12-17T20:47:39 | 2018-12-17T21:18:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,848 | h | // Matrix Construct
//
// Copyright (C) Matrix Construct Developers, Authors & Contributors
// Copyright (C) 2016-2018 Jason Volk <jason@zemos.net>
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice... | [
"jason@zemos.net"
] | jason@zemos.net |
7ad47c0326234e0c8be60a0e0aca88207774e194 | c5aa6545861110fb22033df79c73fe5c72a9ff7d | /cuentaPersonas_Listo_para_autocontenido/cuentaPersonas_Listo_para_autocontenido.ino | e72197307ac285cab4592e009acfbdae4083835c | [] | no_license | fnahuelp/cuentaPersonas-AutoContenido-Joaquin- | 4295efe1e26d508a615ff8027caaee4852ee1fa0 | 6d5968d21dc1b5a111c929a43edd1871935a7460 | refs/heads/master | 2022-08-02T07:56:39.403537 | 2020-05-22T19:20:57 | 2020-05-22T19:20:57 | 266,216,981 | 0 | 0 | null | 2020-05-22T22:09:51 | 2020-05-22T22:09:51 | null | UTF-8 | C++ | false | false | 8,703 | ino | #include <ESP8266WiFi.h>
#include <InfluxDb.h>
#include <DNSServer.h>
#include <ESP8266WebServer.h>
#include <WiFiManager.h>
#include <EEPROM.h>
#define INTDELAY 30
#define RDELAY 100
#define APNAME "Configurar_Sensores"
#define APPASS "ESP2866"
#define DISPOSITIVO "d1" //Nombre del dispositivo
#define SENSOR_OBS... | [
"joaquin.kpo.99@gmail.com"
] | joaquin.kpo.99@gmail.com |
dcdcf09c821a7bb93281dc5814eff676ae2a3ec8 | 043226adf84531a160bb816f0926382f3e3f4a5c | /Lesson3/S00_enumclass.cc | d3c6d153a484433491a0ebd52d399f69f737a64a | [] | no_license | Akhil-Dalwadi/CPP | 14ddba738bc39e771523a5d498be712d034db592 | 1f8030a39b6e7d9ed3038aee91d16be33c1af971 | refs/heads/master | 2022-02-16T10:56:40.302269 | 2018-10-19T16:40:23 | 2018-10-19T16:40:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 939 | cc | // enum class: scoped enum
// static_cast may be used to obtain the numeric value of the enumerator
// Khuyến khích sử dụng enum class thay cho enum
void Print_color(int color);
enum Web_color { red = 0xFF0000, green = 0x00FF00, blue = 0x0000FF };
enum Product_info { Red = 0, Purple = 1, Blue = 2 };
Web_color webby ... | [
"nguyen_bn@hotmail.com"
] | nguyen_bn@hotmail.com |
b748af415cb3db3f0295401182355814e8537237 | 8cedb5e222372768ffc1c354b5a0414e0e0ffd41 | /Implementation Files/Aarow.cpp | 971992585e681ba5e4ecc4a4c0e652ca91678a61 | [] | no_license | TuckerDane/2016_OSU_ComputerScience_II_Final_Project | f323bbc04dd0d70e75d17ffc1919a9bd462af99d | 2225b0496ed3d4a41ff020a33c337f85bee2416e | refs/heads/master | 2021-09-21T21:50:43.409056 | 2018-08-31T22:52:54 | 2018-08-31T22:52:54 | 101,434,320 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,523 | cpp | /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// Name: Tucker Dane Walker
//
// Date: 09 December 2016
//
// Description: The Aarow Class
//
////////////////////////////////////////////////////////////////////////////////... | [
"noreply@github.com"
] | TuckerDane.noreply@github.com |
d31ecefcc8989797e2adc8d1256562a281df4c03 | 99ba2f9970f6045f5c5ab3a9499e404fb4010192 | /并查集.cpp | 6118c3c07d4520100e975aa4fdeb5a90e91cc363 | [] | no_license | YichuanSun/template | f745eec87b15b260236b8222a37d8589fbe31b40 | 5b23bb494f0877a8f6d7b494a26a4eaf602b3953 | refs/heads/master | 2020-03-28T07:16:47.025613 | 2019-07-30T10:33:01 | 2019-07-30T10:33:01 | 147,891,695 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,682 | cpp | //并查集，直接用日本人书上的代码也行
//设数组parent存放集合,parent[i]=j意为i的根节点为j
//规定根节点处的元素值为负，它的相反数为该集合节点个数
#include <bits/stdc++.h>
#define MAX_E 1005
#define N 1005
using namespace std;
int parent[N];
void UFset(); //并查集初始化函数
int Find(int x); //查找函数
void Union(int R1,int R2); //将R1和R2所在集合合并
bool same(int a,int b); ... | [
"30886176+YichuanSun@users.noreply.github.com"
] | 30886176+YichuanSun@users.noreply.github.com |
a0a139167cdc9b1b906be0198d575701a6a57237 | 1f3dd4320acfafb283266491edfb6d571b6f0e50 | /src/rpc/RpcContentWrapper.h | b8f0a206e9c3676168b322c88fcb4d9fb24cc482 | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | erikmuttersbach/libhdfs3 | d193c6b787b33f2339a8ff73ab4356ef835ca5d3 | 9a60d79812d6dee72455f61bff57a93c3c7d56f5 | refs/heads/apache-rpc-9 | 2020-12-25T22:58:48.860681 | 2019-11-05T00:53:35 | 2019-11-05T00:53:35 | 27,222,933 | 42 | 25 | Apache-2.0 | 2019-11-05T00:53:36 | 2014-11-27T11:42:59 | C++ | UTF-8 | C++ | false | false | 1,807 | h | /********************************************************************
* Copyright (c) 2013 - 2014, Pivotal Inc.
* All rights reserved.
*
* Author: Zhanwei Wang
********************************************************************/
/********************************************************************
* 2014 -
* op... | [
"zwang@gopivotal.com"
] | zwang@gopivotal.com |
b29464a65c5569abd93a2d6a7a898c64ebbe812c | 59b3f266dc5d06b7d70b84a005fe993c84d23592 | /Ch 11.4/main.cpp | f7da4d615d2e89d644d6d4445b70ae953ae9cb7e | [] | no_license | ChrisAlexman27/Assignments | b77597ed6adbd64693f159dbeec7d1bd0502862e | 9250d9c34ad2504a8b085dd8998789ffd6155b88 | refs/heads/master | 2021-07-16T18:39:09.905111 | 2017-10-21T07:11:18 | 2017-10-21T07:11:18 | 107,757,294 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,094 | cpp | //Christopher Alexman CSC 17A Chapter 11, P. 652, #04
//
/*******************************************************************************
*
* STORE WEATHER DATA INTO AN STRUCTURE
* _____________________________________________________________________________
* This function uses a structure to store weath... | [
"noreply@github.com"
] | ChrisAlexman27.noreply@github.com |
e90a27aee4335180a62ebd20ac373c6d6a092f5f | 0b79cf40da1c8ef55fabc70e0e2534d7dfe21a1a | /Src/mainwindow.h | a0bccb84aee50637091e24955cafd10f4ab81199 | [] | no_license | DaLinYYY/MyQtWork | c141db0cbb8b0c77bc8e0b6c703fe1edf6a3a8d4 | 60f8ba1f4149d5b91edca6ee8d889cab02c657c3 | refs/heads/master | 2022-12-26T07:10:23.712309 | 2020-09-25T08:18:24 | 2020-09-25T08:18:24 | 297,289,295 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,802 | h | #ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include "mytimer.h"
#include "chartview.h"
#include <QMainWindow>
#include "recvthread.h"
#include <QTimer>
#include <QtSerialPort/QSerialPort>
#include <QtSerialPort/QSerialPortInfo>
#include <QtCharts/QChart>
#include <QtCharts/QDateTimeAxis>
#include <QtCharts/QChartView>... | [
"dalinyy@163.com"
] | dalinyy@163.com |
62a0d0bc860c815de91a8d642f7aeb2a77e0a551 | 820489b64b7c787643a1e803db968c9b0a7b2e8f | /EstructuraDeDatos/Actividad04-PilaYCola/model/dto/Pila.h | f97f2d061f5849a7b14c8050981be959e6f482ae | [] | no_license | Norzuiso/University | 2ad452cd4fd85ee8062b56fe6bb7f0da8fa10427 | 3616aa385c9534e736cb5c3633983346adb3fb09 | refs/heads/main | 2023-08-01T06:04:34.047520 | 2021-09-17T02:45:09 | 2021-09-17T02:45:09 | 360,977,796 | 0 | 0 | null | 2021-05-22T21:29:06 | 2021-04-23T18:48:57 | C | UTF-8 | C++ | false | false | 1,122 | h | //
// Created by josue on 9/5/2021.
//
#ifndef ACTIVIDAD04_PILAYCOLA_PILA_H
#define ACTIVIDAD04_PILAYCOLA_PILA_H
#include "../../logic/utils/Utils.h"
template<class T, int size = 1024>
class Pila {
private:
T data[size];
int top;
private:
Pila();
bool isEmpty();
bool isFull();
void push(T ... | [
"josueaguilarjnai@gmail.com"
] | josueaguilarjnai@gmail.com |
ad15bb99845600e0f1a99531aaf530f03d7107a0 | 49874e38e315b06cc6880bacb5d0fef20380629e | /src/qt/splashscreen.cpp | 0b45263d327884035ea99c8889ebb68c72ab5c89 | [
"MIT"
] | permissive | viduedo/danscoin | 91b38e0cfaa282a9a2ce1d7250d3a2f7a6c690ae | 1860cf5586851ff6a676e7dacf60396bf2e04da1 | refs/heads/master | 2020-03-11T12:55:35.193088 | 2018-04-18T22:29:46 | 2018-04-18T22:29:46 | 129,997,720 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,254 | cpp | // Copyright (c) 2011-2013 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 "splashscreen.h"
#include "clientversion.h"
#include "util.h"
#include <QPainter>
#undef loop /* ugh, remove this wh... | [
"daniel.viduedo@gmail.com"
] | daniel.viduedo@gmail.com |
a2e7a7c812c6a24d453dee4b6166facd7558c9c9 | 783279f7d64424fd4535a819cc19be335a3ce196 | /codeforces/735Div2/D.cpp | 297552134d313de281f2b9f7537b39323b056120 | [] | no_license | rish-singhal/CompetitiveProgramming | 2bfa88e086c084c9d68624f176ee3cbcb20b8577 | 5ed290ea7e28b81e38679f8c0e99c9c3f80da231 | refs/heads/master | 2023-07-02T18:59:11.817298 | 2021-08-10T04:15:52 | 2021-08-10T04:15:52 | 248,025,974 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 922 | cpp | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<vi> vii;
#define fi first
#define se second
#define pb push_back
#define forn(i,n) for(int i=0;i<(n);i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forr(i,n) for(int i=n;i>=0;i--)
#define all(x) x.begin(), x.... | [
"zzxy334@gmail.com"
] | zzxy334@gmail.com |
1b6ef365058920a28a30b50b749ddfcef3447da3 | 8c3c4f9fbd5682097c1e8b8f2bff77dabd3745de | /2131Z - CtrlZV4 - PROS/include/Custom/Intake.hpp | 3661bcebacd2a66d02ff2310c351bfc71605e6d6 | [] | no_license | Go-Line-Track-Yourself/Z-Team-Repository | d010cf347eff1696ff2d11ffabb91aeb0b18ef80 | 5a0532df7d14a887435308f01f880f0ef41ce36b | refs/heads/master | 2020-04-01T03:13:54.965322 | 2019-04-22T15:14:42 | 2019-04-22T15:14:42 | 152,814,629 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 569 | hpp | #ifndef INTAKE_HPP
#define INTAKE_HPP
namespace Intake{
bool AutoIntakeEnabled;
bool AutoIntakeTaskEnabled;
bool AutoIntakeOff;
bool AutoFlip;
bool IntakeEnabledBtnPressed;
bool IntakeEnabledInverted;
//SetMotors
void SetIntakerPower(int power);
void SetTFeederPower(int power);
... | [
"legocreator75@gmail.com"
] | legocreator75@gmail.com |
02435f651927b469e0b26a884897909186dc5257 | a03a00fec769762293702a70ede77393230857e0 | /120-Stacks of Flapjacks/120.cpp | 00c71d081e018ec4f2f5b5e5223647818d1e4a2f | [] | no_license | chiaminchuang/UVA | 75eb1f44ae463e6755405161f5eac19e6ea0e9f9 | 574dc1970fbcc7b3f893ad9fd48bb0abe8bb34fd | refs/heads/master | 2021-09-05T13:16:32.286561 | 2018-01-28T02:06:29 | 2018-01-28T02:06:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 863 | cpp | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;
void flip(vector<int>&, int, int);
int main(){
string str;
while (getline(cin, str))
{
stringstream ss(str);
vector<int> stack;
int jack, i = 0;
while (ss >> jack)
... | [
"noreply@github.com"
] | chiaminchuang.noreply@github.com |
8f726411c9d2d908f741b4a319192de3d433c347 | c21c8cba94f4f73aa23de98e555ef77bcab494f0 | /HackerEarth/pair count.cpp | bd534025e1c6f439317d2102d10355254fa6ae34 | [] | no_license | hoatd/Ds-Algos- | fc3ed0c8c1b285fb558f53eeeaea2632e0ed03ae | 1e74995433685f32ce75a036cd82460605024c49 | refs/heads/master | 2023-03-19T05:48:42.595330 | 2019-04-29T06:20:43 | 2019-04-29T06:20:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,451 | cpp | #include<bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define max3(a,b,c) max(a, max(b,c))
#define max4(a,b,c,d) max(a, max(b, max(c,d)))
#define pb push_back
#define si(x) scanf("%d",&x)
#define slli(x) scanf("%lld",&x)
#define pi(x) printf("%d",x)
#define sp()... | [
"noreply@github.com"
] | hoatd.noreply@github.com |
cba4e74bba00d0093c2fab1f92fd0d5a56dd2a55 | b9023bd137b0cba5895717ab79ee53d40b813c0c | /BarRevenueSimulation/main.cpp | e103802556a80600f6073b21ae38f27fcdf1bdbf | [] | no_license | dinobertoli/CSCI61-Data-Structrures-and-Algorithms | 64fdeec3ec3ffac3dcd918ed4f70220dd1797456 | 13fdfe1994b05748914b55032206e64167388bd3 | refs/heads/master | 2021-06-21T21:27:22.825243 | 2021-02-07T06:41:55 | 2021-02-07T06:41:55 | 181,377,414 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 856 | cpp | #include <iostream>
#include "arriveEvent.h"
/*
*Discrete Event-Driven Simulation
*Project 2
*Dino Bertoli
*6/1/19
*
*simulates profit of softwareGurusBar with given input for seats
*
*/
int main( ) {
srand(time(0));
ofstream file;
file.open ("output.txt");
// load priority queue with initial arrive Ev... | [
"noreply@github.com"
] | dinobertoli.noreply@github.com |
5b9f6c039910b0d31fbce605f81d81c360d3e417 | a9d2c5b679a7f565e2de9105c610c26d54073d56 | /ResourceAssignment.h | 727528e0a02365df59e2af778103df11d272c274 | [] | no_license | mt1ger/SimEON | e9fa8a3c656e5f968eb074090b4ea33cb9d06840 | 93b24438c07b23d378d9b6f0c22a6550ff070439 | refs/heads/master | 2021-09-05T20:16:11.458277 | 2018-01-30T20:43:55 | 2018-01-30T20:43:55 | 108,190,901 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 772 | h | #ifndef _RESOURCEASSIGNMENT_H
#define _RESOURCEASSIGNMENT_H
#include "Event.h"
#include "EventQueue.h"
#include "RoutingTable.h"
class ResourceAssignment {
public:
ResourceAssignment (Network * net, EventQueue * eq) {network = net; eventQueue = eq;}
~ResourceAssignment () {}
vector< vector<int> > SourceAvail... | [
"Yue_Wang@student.uml.edu"
] | Yue_Wang@student.uml.edu |
28d0745995f9c717cd61561d9f10f76ecd467ff2 | fdfb3b2257a91fc0c142189c568f1181b6baff82 | /ethercat_generic_plugins/ethercat_generic_cia402_drive/test/test_generic_ec_cia402_drive.hpp | ad123ff9866253d9c564ab8adec45e2b41902fe2 | [
"Apache-2.0"
] | permissive | ICube-Robotics/ethercat_driver_ros2 | 0ca3362b5d63a56df430d752b79913da3ac7b559 | 3ccdb0dd7aa747fb0173390769876bbb4b9587ee | refs/heads/main | 2023-08-10T12:13:48.823357 | 2023-07-28T07:41:39 | 2023-07-28T07:41:39 | 491,930,126 | 86 | 22 | Apache-2.0 | 2023-07-25T12:56:05 | 2022-05-13T14:30:53 | C++ | UTF-8 | C++ | false | false | 1,803 | hpp | // Copyright 2023 ICUBE Laboratory, University of Strasbourg
//
// 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 ... | [
"noreply@github.com"
] | ICube-Robotics.noreply@github.com |
45599517c4f36f474c198f8033ffc2715ae493ee | ddec21c31c705046a27b1fa155eee83ac7f198a6 | /project-assignment-1/code-problem/3.Labyrinth-CPP/Labyrinth-CPP/Cursor.cpp | 9178ce939411173e0baf5fb127a739390e5cf2de | [
"MIT",
"CC-BY-3.0"
] | permissive | Lilleengen/INF3121-Project-assignments-spring-2016 | 7381865b545d01df6c3920743c2717b905471633 | bd44bf16c4e321fc379fc77ea14e7677b4b171f2 | refs/heads/master | 2021-01-01T04:55:32.384373 | 2016-05-11T09:59:19 | 2016-05-11T09:59:19 | 58,267,817 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 990 | cpp | #include "Cursor.h"
#include <iostream>
Cursor::Cursor( const Position & position )
: position( position ),
movements( 0 ) {
}
bool Cursor::move( const Direction & direction, Playfield & playfield ) {
this->movements ++;
Position newPosition( this->position );
switch ( direction ) {
case ... | [
"mail@ithenrik.com"
] | mail@ithenrik.com |
500e3ea3f9e78d440d2430c49c613b59aff2e159 | 1c7cb3154854a0d5f628c4285aa209affd8d2fc9 | /chaos-ns-3/ns-3.27/src/core/model/simulator.cc | d2e08d0ec1a0b095a1cef98ec49772affa2ab05f | [
"GPL-2.0-only",
"LicenseRef-scancode-free-unknown",
"MIT"
] | permissive | ErikNatanael/royal-chaos | fac8e5891044490cd2e61b7367f284d99951d0d1 | a8e763d3720cc3e158e98143cabce8106d8de2aa | refs/heads/master | 2022-07-16T12:21:31.494237 | 2020-05-12T12:50:08 | 2020-05-12T12:50:08 | 263,333,134 | 0 | 0 | MIT | 2020-05-12T12:42:08 | 2020-05-12T12:42:08 | null | UTF-8 | C++ | false | false | 10,249 | cc | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2005,2006 INRIA
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* This program is distri... | [
"zhanglong3030@qq.com"
] | zhanglong3030@qq.com |
ef606ea70c3c0d729a30369eca3f053f3e401b31 | 07cdc852789922612460a6145144955b6d76c504 | /MapEditCreate.h | fecbcb1841e975e127fc1b5c1f1d769cd814c9c3 | [] | no_license | WooLyung/Lightcuit | 9379b8d2c3f412c0e71e853b6cf5116b53f5e704 | 37455456318d8dfaf350a2bb5fe61a87f3315b78 | refs/heads/master | 2020-08-29T00:08:57.369134 | 2019-12-24T01:11:33 | 2019-12-24T01:11:33 | 217,859,728 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | h | #pragma once
#include "Object.h"
#include "Transform.h"
#include "SpriteRenderer.h"
#include "CommandList.h"
#include "MapEditorScene.h"
class MapEditorScene;
class MapEditCreate :
public Object
{
private:
enum StageState {
appear, wait, disappear, wait2
};
Transform* transform;
SpriteRenderer* spriteRenderer... | [
"vlfkdydtk@naver.com"
] | vlfkdydtk@naver.com |
60f3d216d3e1b79ca0dc173b142ec927e8f88062 | 4434910c965bf51c945e95f590422198d24d303a | /Linked List/109. convert-sorted-list-to-binary-search-tree.cpp | 0a28dfd073e9e39426860803758104f46259ccad | [] | no_license | utkarsh914/LeetCode | 7ca325e130a0b420603e7899562f7a463a765748 | 93d4c2a62e553f13ecc6f3506e91a597bf901ceb | refs/heads/main | 2023-08-14T20:30:49.174023 | 2021-09-17T13:12:23 | 2021-09-17T13:12:23 | 338,639,989 | 6 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,845 | cpp | // https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), nex... | [
"utiwari914@gmail.com"
] | utiwari914@gmail.com |
b13217d5331c7f7c9bdee0768201eab4ca3080a3 | a2d7e5f99f68ff2a845850fbb2a4982459d28022 | /arena2d-sim/engine/zLogfile.hpp | 6955f66a9a7ae62fa1271cd4aea4b6be4f3ccb9a | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | linhdoan8/arena2D | c10bcd9154530717eb2526bd8f085b3b2c66fb4e | 290ec59bb1962c9caac99ead76c57607ed8cfdc4 | refs/heads/master | 2022-12-03T08:18:55.448239 | 2020-08-17T07:38:40 | 2020-08-17T07:38:40 | 289,931,780 | 1 | 0 | MIT | 2020-08-24T13:11:32 | 2020-08-24T13:11:31 | null | UTF-8 | C++ | false | false | 1,952 | hpp | //Created on: 16th Jan 2017
//Author: Cornelius Marx
#ifndef ZER0_LOGFILE_H
#define ZER0_LOGFILE_H
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include "zSingleton.hpp"
#define Z_LOG zLogfile::get()
// makro for logging something (info, error, warning)
#define INFO_F(X, ...) zLogfile::get()->printfMo... | [
"marxc9@outlook.de"
] | marxc9@outlook.de |
e40ecf36000d24f43bddb96e42f4d89e51f6361b | 2c8c9841bbd2917cbd0f89c51edbb4400f1430e4 | /BearGame/base/Clock.h | 9165f5bd07de9b5108409a41ef286877fb6a21ce | [] | no_license | IBM9100/BearGame | 1df62db066c3e5f812f261a71cc201e07ac769d6 | 41370e8dc63e6f5479ae4931057ec45e7fce255d | refs/heads/master | 2022-12-14T05:33:12.212964 | 2020-09-05T05:53:52 | 2020-09-05T05:53:52 | 291,615,600 | 0 | 0 | null | 2020-09-03T13:13:48 | 2020-08-31T04:37:40 | C | UTF-8 | C++ | false | false | 356 | h | #ifndef BEARGAME_BASE_CLOCK_H
#define BEARGAME_BASE_CLOCK_H
#include <cstdint>
#include <sys/time.h>
#include "base/Singleton.h"
namespace BearGame {
class Clock : public Singleton<Clock> {
public:
void Update();
int64_t Now();
struct timeval NowTv();
public:
int64_t Tick() { return m_tick; }
privat... | [
"yu2erer@gmail.com"
] | yu2erer@gmail.com |
3634584dee2c8a8170cc9eab568248857461284b | 15247681c3cd7969ecea2349ba18667df9c9fbee | /epoch1/cuda/ee_mumu/src/read_slha.cc | 281062f9afab2f81e0401e57e05b9b9c1fea28fe | [] | no_license | TaranSinghania/madgraph4gpu-1 | 4f181eb75a3e0e342e4860400edb12ce044fa64b | 6baa276dc2c974f207f67cbaa93b9ee49acc9c36 | refs/heads/master | 2023-02-15T04:35:02.978445 | 2020-12-16T17:32:24 | 2020-12-17T09:34:46 | 289,874,630 | 1 | 0 | null | 2020-08-24T08:44:40 | 2020-08-24T08:44:40 | null | UTF-8 | C++ | false | false | 4,023 | cc | #include <algorithm>
#include <iostream>
#include <fstream>
#include "read_slha.h"
void SLHABlock::set_entry(std::vector<int> indices, double value)
{
if (_entries.size() == 0)
_indices = indices.size();
else if(indices.size() != _indices)
throw "Wrong number of indices in set_entry";
_entries[indic... | [
"andrea.valassi@cern.ch"
] | andrea.valassi@cern.ch |
8f79eec53847ab94774624be2553f2f8ca2c59ec | 19194c2f2c07ab3537f994acfbf6b34ea9b55ae7 | /android-28/android/app/backup/BackupManager.def.hpp | 64c8d8178f35a9435e07e0a05a13f1fbd3e027b7 | [
"GPL-3.0-only"
] | permissive | YJBeetle/QtAndroidAPI | e372609e9db0f96602da31b8417c9f5972315cae | ace3f0ea2678967393b5eb8e4edba7fa2ca6a50c | refs/heads/Qt6 | 2023-08-05T03:14:11.842336 | 2023-07-24T08:35:31 | 2023-07-24T08:35:31 | 249,539,770 | 19 | 4 | Apache-2.0 | 2022-03-14T12:15:32 | 2020-03-23T20:42:54 | C++ | UTF-8 | C++ | false | false | 765 | hpp | #pragma once
#include "../../../JObject.hpp"
namespace android::app::backup
{
class RestoreObserver;
}
namespace android::content
{
class Context;
}
class JString;
namespace android::app::backup
{
class BackupManager : public JObject
{
public:
// Fields
// QJniObject forward
template<typename ...Ts> ex... | [
"yjbeetle@gmail.com"
] | yjbeetle@gmail.com |
15b6f7be15a60fbac5bb6f08ae1c549312c2dd04 | 4fb009d90ec61501c8b4c15a9ca7f480045f7c94 | /Pacman/Pacman/packman.cpp | cc923e46067b087516dc558ef8c3e483f9262a04 | [] | no_license | Bariskas/ProjectDeveloping | 250fcc4c9b22734ee2461e8b1679de354e3c83ba | 6f41e73c2996ff0e19732ea7f383a5ff441d9ba6 | refs/heads/master | 2021-05-04T06:15:14.616975 | 2016-11-26T01:13:20 | 2016-11-26T01:13:20 | 71,046,244 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,936 | cpp | #include "Packman.h"
void initializePackman(Packman& packman)
{
packman.direction = Direction::NONE;
packman.shape.setRadius(20);
packman.shape.setFillColor(sf::Color::Green);
packman.shape.setPosition(100, 0);
}
bool handlePackmanKeyPress(const sf::Event::KeyEvent &event, Packman &packman)
{
bool handled = true... | [
"Bariskas@gmail.com"
] | Bariskas@gmail.com |
5ea688b363508a32eb6ddf6c5d78428365e52661 | da13b72e19a2fa45808e5e49442fba1b66396ebe | /Template/数学/多项式.cpp | fc0b4fc0720f6979d12bb47e57eaca547ece3ec5 | [] | no_license | WangJunqiao/Algorithm | 82c0a1c1d76ded16d1f8d53e0fce39861ad87227 | f35e67f5bb5801d6c59c6286fa57ba6a11a9f42d | refs/heads/master | 2021-01-17T11:04:00.913369 | 2016-03-04T14:35:21 | 2016-03-04T14:35:21 | 18,668,251 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,558 | cpp | //多项式展开,用于母函数展开****
template<typename T> //系数的数据类型T
struct Polynomial {
map <int, T> mp; //x的幂, 系数
//**************************
Polynomial() {
mp.clear();
}
void add(T c, int p) { //加 c * x^p
mp[p] += c;
}
void get_c(int p) {
return mp[p];
}
void zero() { ... | [
"774367334@qq.com"
] | 774367334@qq.com |
56127c819ef7e7a7b4f3b98a477b0892e8df47a0 | fefbffe56cc5dd6d9256337d44d65386ceae4292 | /include/xthreejs/math/xsphere_autogen.hpp | b07a5ec7c62e1a2cca4a4cc30ae2362e3036fd78 | [] | no_license | yssource/xthreejs | e405a706a0e35131e679af9fbeb2e18e403e2b24 | cd8ab8929b0019f495d9f1566461306e9e3d8310 | refs/heads/master | 2020-05-18T10:07:08.534561 | 2018-06-20T05:49:35 | 2018-06-20T05:49:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,665 | hpp | #ifndef XTHREE_SPHERE_HPP
#define XTHREE_SPHERE_HPP
#include "xtl/xoptional.hpp"
#include "xwidgets/xeither.hpp"
#include "xwidgets/xwidget.hpp"
#include "../base/xenums.hpp"
#include "../base/xthree_types.hpp"
#include "../base/xthree.hpp"
#include "../base/xrender.hpp"
namespace xthree
{
//
// sphere decla... | [
"loic.gouarin@gmail.com"
] | loic.gouarin@gmail.com |
6947e0c27458b9cceee2cd52238cf9b106610100 | 70927ebfa40ae0b6ce5d19cb5256cfb880de4f07 | /Pods/geos/Sources/geos/src/planargraph/DirectedEdgeStar.cpp | 5342bd5091e864dc1b3b0f77ed4f1d595e54b704 | [
"LGPL-2.0-or-later",
"LGPL-2.1-only",
"GPL-2.0-only",
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | baato/BaatoSwift | 44af06fe3a1af26fe8540376cdc82a93e498fdbc | 87cb476affbdf24f4b902bb498970051d0382a9c | refs/heads/master | 2023-03-28T07:50:10.326223 | 2020-12-09T09:58:48 | 2020-12-09T09:58:48 | 294,601,067 | 0 | 0 | MIT | 2020-12-08T08:09:04 | 2020-09-11T05:17:37 | Swift | UTF-8 | C++ | false | false | 3,886 | cpp | /**********************************************************************
*
* GEOS - Geometry Engine Open Source
* http://geos.osgeo.org
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
* Copyright (C) 2005 Refractions Research Inc.
*
* This is free software; you can redistribute and/or modify it under
* the ter... | [
"bhawak.pokhrel@gmail.com"
] | bhawak.pokhrel@gmail.com |
56c51bd8e7bcf241f3cb53f74d1cca05e7fdb015 | 673cda4a27c99b1f036d456a7db43bd18219f4af | /src/change_detector2.cpp | d05e7761d39f137219c6d5124a761bed43f81e9d | [] | no_license | HiroIshida/image_collision_detection | 4f2b50e41e39ba897e16b9da22506acb9847c0c2 | 7efd691cdb579360826f2f03d026802eee236915 | refs/heads/master | 2020-07-03T21:13:19.944878 | 2019-08-29T13:54:00 | 2019-08-29T13:54:00 | 202,051,256 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,543 | cpp | #include <ros/ros.h>
#include "std_msgs/String.h"
#include "sensor_msgs/Image.h"
#include "std_msgs/Int64.h"
#include "std_msgs/Float64.h"
#include "std_srvs/Empty.h"
#include <sstream>
#include <string>
#include <cv_bridge/cv_bridge.h>
#include <sensor_msgs/image_encodings.h>
#include "image_dif.hpp"
#include <boost/f... | [
"spitfire.docomo@gmail.com"
] | spitfire.docomo@gmail.com |
ca506cb0fa0875067afd93fa6e97656d7ac2b58d | c8d3a372f9cd46732caa5ef983f12d3b9b667961 | /componente/componente.cpp | b7b6dde36fc45fa1b036c5b25d9d3f4dbd3f9ef4 | [] | no_license | Momofil31/ASD_2019-2020 | 7db1329a42dcf0dc895fc18c46bb5f1cafbdfee5 | c0a62336ab01a1cb92681c1d444a32c65d69525b | refs/heads/master | 2020-09-13T22:02:40.897397 | 2020-03-27T20:34:37 | 2020-03-27T20:34:37 | 222,916,168 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,294 | cpp | #include <algorithm>
#include <fstream>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
struct nodo {
vector<int> vic;
};
int N, M;
vector<int> componentiFortConnesse(vector<nodo> &);
void compConnDFS(vector<nodo> &, int, int, vector<int> &);
vector<int> componentiConnesse(vector<nod... | [
"filippomomesso@gmail.com"
] | filippomomesso@gmail.com |
00e82709d6ca894b59342d7a83f85d5832e5324a | dfd0425f038466d200fc32e8ae0f4a72a32ab0bc | /engine/render/include/render/render_passes/particle_system_render_pass.h | ab5625ca821792ac1c04aa61e44a81402aea818b | [] | no_license | suVrik/KWA | 4a0e51e1ffa99650a8a09630e44a54ea8067b8da | 416d39a5a2355a59f115d44b3ed4032798edc197 | refs/heads/master | 2023-08-11T15:07:24.438061 | 2021-09-10T20:31:40 | 2021-09-20T05:23:34 | 375,077,587 | 6 | 0 | null | 2021-09-20T05:27:44 | 2021-06-08T16:34:40 | C++ | UTF-8 | C++ | false | false | 1,139 | h | #pragma once
#include "render/render_passes/base_render_pass.h"
namespace kw {
class CameraManager;
class Scene;
struct ParticleSystemRenderPassDescriptor {
Scene* scene;
CameraManager* camera_manager;
MemoryResource* transient_memory_resource;
};
class ParticleSystemRenderPass : public BaseRenderPass ... | [
"suvri4@gmail.com"
] | suvri4@gmail.com |
75ff98f1bf4442c5e4c6dadfdca38afd7aede2d3 | b0e6305c81cf3e799a4ce56f02ef69b616d38647 | /Source/ThirdParty/tracy/client/TracyCallstack.hpp | 6a8539258f3c17337ce5441db850ed8a28604789 | [
"BSD-3-Clause",
"MIT",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-warranty-disclaimer",
"Zlib",
"LicenseRef-scancode-khronos",
"BSL-1.0",
"BSD-2-Clause"
] | permissive | JSandusky/rbfx | 9331074ea11b2fad48bd68e23416f70dbcd0fb3d | 36fcc929f19dccddda666c5a378105a1229e31fe | refs/heads/master | 2022-11-26T15:38:55.475680 | 2020-01-25T14:04:34 | 2020-01-25T14:04:54 | 236,247,918 | 0 | 1 | MIT | 2020-01-26T00:14:37 | 2020-01-26T00:14:37 | null | UTF-8 | C++ | false | false | 2,424 | hpp | #ifndef __TRACYCALLSTACK_HPP__
#define __TRACYCALLSTACK_HPP__
#include "TracyCallstack.h"
#if TRACY_HAS_CALLSTACK == 1
extern "C"
{
typedef unsigned long (__stdcall *t_RtlWalkFrameChain)( void**, unsigned long, unsigned long );
extern t_RtlWalkFrameChain RtlWalkFrameChain;
}
#elif TRACY_HAS_CALLSTACK == 2 || ... | [
"rokups@zoho.com"
] | rokups@zoho.com |
fe4abc66681ff440c3ec372867f5a8a25c56e489 | bc2043edf8c4a3c1b2c33826eea4f13e90051ba5 | /src/BulletPool.cpp | 8aae297c4b2a4945f04faa9d8f0df31301e69480 | [] | no_license | RuiGeng101277255/GAME2005_Assignment3 | 9b536d41a1225137476f0fc8c80a3546b10517bc | 49f57de65e9d8e3b1ee8c631042c21c9f1a0fb3b | refs/heads/main | 2023-01-15T22:30:28.397965 | 2020-11-27T18:39:34 | 2020-11-27T18:39:34 | 314,070,225 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,834 | cpp | #include "BulletPool.h"
#include <iostream>
#include "Util.h"
#include "CollisionManager.h"
BulletPool::BulletPool()
{
for (int i = 0; i < PoolSize; i++)
{
bullet[i] = new Bullet();
}
}
BulletPool::~BulletPool() = default;
void BulletPool::draw()
{
for (int a = 0; a < PoolSize; a++)
{
bullet[a]->draw();
}
... | [
"ruichen.gengli@georgebrown.ca"
] | ruichen.gengli@georgebrown.ca |
8770020a2e4f4bdf50f643e32a38036762f341fa | 49b86bb41a4b65f4b63e9b9b79327fb635103065 | /src/DAGraphB.h | 7283881c0db20887ba5d5ad15e06d95014c0719e | [
"MIT"
] | permissive | georgedeath/TAsK | f5f15f90e08ee9b51e4da60002e81a70f0518ec4 | 14c4abb3b3f9918accd59e9987e9403bd8a0470c | refs/heads/master | 2020-09-20T06:50:10.886648 | 2020-08-06T10:30:37 | 2020-08-06T10:30:37 | 224,403,889 | 0 | 0 | MIT | 2019-11-27T10:22:22 | 2019-11-27T10:22:21 | null | UTF-8 | C++ | false | false | 1,412 | h | #ifndef DAGRAPH_B
#define DAGRAPH_B
#include "DAGraph.h"
class Path;
/** \brief This class implements origin-based algorithm B.
\details For details see \cite Dial_2006.
*/
class DAGraphB : public DAGraph {
public:
/**
@param useMultiStep true if multiple Newton steps must be applied, false otherwise.
... | [
"peredereeva@gmail.com"
] | peredereeva@gmail.com |
bd34beaf8488bbac4d65902bed87b14be39267b0 | 211dc4d24f6c06cb1d3b67f9106517d6ab1a2159 | /ABC/089/March.cpp | 6c7ef6dcf34c123621ad6e72a7f87b966842648c | [] | no_license | oonota/atcoder | afe565f89fa646a1d0d4c30aeff51a9cf8150343 | e7a6e0220583ad91e3fbb40257eb94d9f2b85565 | refs/heads/master | 2021-04-15T03:41:17.775133 | 2018-12-21T12:24:03 | 2018-12-21T12:24:03 | 126,293,973 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 806 | cpp | #include<bits/stdc++.h>
#define print(x) std::cout << x << std::endl
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
//container util
#define SORT(c) sort((c).begin(),(c).end())
//repetition
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main(){
string s;... | [
"taotaotao0310@gmail.com"
] | taotaotao0310@gmail.com |
6e04e4417a67aba05efcbd444c4d832e0f150c73 | 52f64708ba7560f5d16eef95b057a993ab73c787 | /Codeforces/1000/F.cpp | 5499d2d40cf6580f6e20f0395fe3ba2c221cbf5c | [] | no_license | ckpiyanon/submission | 1c5709755afeba8b5087fa29b12f9c2c931c4b68 | 7b3f546e3c1e10787a24f567c9f2ec1366bbaf5a | refs/heads/master | 2022-10-28T18:42:34.937505 | 2020-06-15T22:00:19 | 2020-06-15T22:00:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,370 | cpp | #include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 1<<19, INF = 1e9;
int n, m, A[N], ans[N];
pii pos[N], t[N<<1];
vector<pii> que[N];
void update(int x, int v, int v2, int p = 1, int l = 1, int r = n) {
if(l == r) {
t[p] = pii(v, v2);
... | [
"30414878+win11905@users.noreply.github.com"
] | 30414878+win11905@users.noreply.github.com |
ae8ee015c23144389b48d394fe828ff5f088e262 | 6d401de5ec5e1c326ae7d27c12dbaf6c9ef54d50 | /source/152.cpp | 843aaad2c4e6eb95dd498a30990cff139f36b9b3 | [] | no_license | wangtss/leetcodePractice | 8a0f038937b5cda2ca3aaf97d7eae0f60e28287f | e0e7d8bba24d344fdd4a313b142140dd30f07fe9 | refs/heads/master | 2021-09-06T01:16:58.867438 | 2018-02-01T08:11:08 | 2018-02-01T08:11:08 | 104,712,341 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 536 | cpp | int maxProduct(vector<int>& nums) {
if (nums.empty()) return 0;
int len = nums.size(), global;
vector<int> local_min(len, 0), local_max(len, 0);
local_min[0] = local_max[0] = global = nums[0];
for (int index = 1; index < len; ++index) {
local_max[index] = max(max(local_max[index - 1] * nums[index], nums[index]),... | [
"wangtstim@gmail.com"
] | wangtstim@gmail.com |
833946bc0a2c0e86582793016ec940845092269b | a2e1afcba56037065070eb9e0fa44996f85083ee | /inc/zprimecrosssection.h | 50571ef3ed707061372a62e5b767e1740c08c223 | [] | no_license | markrosslonergan/forlorn-extremity | 42accbeb3b06cd1838dbf366a47df7f1fd26c06d | d2f4e1c847e595a6f04d55086e9abadc6359b6b4 | refs/heads/master | 2021-01-20T18:14:52.218668 | 2017-09-26T14:49:09 | 2017-09-26T14:49:09 | 90,910,257 | 0 | 1 | null | 2017-08-28T18:32:36 | 2017-05-10T21:33:05 | Jupyter Notebook | UTF-8 | C++ | false | false | 26,377 | h | #include <gsl/gsl_integration.h>
#include <algorithm>
#include <math.h>
#include <gsl/gsl_rng.h>
#include <string>
#include <sstream>
#include <iomanip>
#define FLUX_CUTOFF 10.0
#define POSNU 0
#define POSNUBAR 1
#define NEGNU 2
#define NEGNUBAR 3
#define MP 0.13957018
#define MMu 0.1056583715
#define Me 0.000510... | [
"mark.ross-lonergan@durham.ac.uk"
] | mark.ross-lonergan@durham.ac.uk |
6976cdac16325fcdc6ac5c7b5c03a65cfc532b13 | 17b22f7e6b831cfc2e27b37181ed4d8aae693a61 | /Frameworks/XEScene.framework/Headers/XSkin.h | 5d257da67a8d4dcf8b8cc53a4152c1aee58a5ba1 | [] | no_license | cosmos33/MMXEScene | af3409c0d21bd2d56b5845b705564151d612d436 | 067373218035cead3b761831189c97ca2a024447 | refs/heads/master | 2020-05-07T13:00:45.392787 | 2019-06-16T13:41:32 | 2019-06-16T13:41:32 | 180,528,299 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,194 | h | /******************************************************************************
@File XSkin.h
@Version 1.0
@Created 2017, 4, 14
@Description
@HISTORY:
******************************************************************************/
#ifndef _X_SKIN_H_
#define _X_SKIN_H_
#include "XMemBase.h"
#i... | [
"sun.fei@immomo.com"
] | sun.fei@immomo.com |
e94a2bfe0233b9ad839ba6675b81e3f8deddf75a | f9fe33be8d046538593398282231b379449213f5 | /Solutions/3.10/List.h | e967515566ab60bff8f48d51b31fa6ce9ac1af7f | [] | no_license | liuxinbo1984/cplus-in-action | d777a09523439d66fd2cd941694370724b77b163 | 1087742fdf6528bc7e810db351492034b24c4dbb | refs/heads/master | 2021-04-23T21:20:55.827607 | 2020-03-25T16:32:10 | 2020-03-25T16:32:10 | 250,007,524 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 511 | h | #if !defined (LIST_H)
#define LIST_H
// (c) Bartosz Milewski 2000
class Link
{
public:
Link (Link* pNext, int id)
: _pNext (pNext), _id (id) {}
Link * Next () const { return _pNext; }
int Id () const { return _id; }
private:
int _id;
Link * _pNext;
};
class List
{
public:
List ()... | [
"liuxinbo.1984@163.com"
] | liuxinbo.1984@163.com |
6a881bfab647dc854fe8e44950c601c253ca05e3 | 73787a734b04586db054d9a71d3870bb6ac6e49a | /第四章/4.4-贪心/D-Repair the Wall/2021.3.6.cpp | 0bdc449a0c33f0f199ebd902a4e722338d50364d | [] | no_license | nanashi100/Codeup_Coding | 4d83950ce5c284e20c8ec9f2b4584b9bf409f713 | 5bee75db7b1dea3a8531579b310cc5bb55b80c6e | refs/heads/main | 2023-03-27T16:58:36.690377 | 2021-03-27T02:05:10 | 2021-03-27T02:05:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 630 | cpp | #include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
bool cmp(int a, int b){
return a > b;
}
int main(){
int L, N;
while ( scanf("%d %d", &L, &N) != EOF )
{
int block;
vector<int> blocks;
for (int i = 0; i < N; i++)
{
scanf("%d", &block);
blocks.push_bac... | [
"chenjian19990211@163.com"
] | chenjian19990211@163.com |
2421df18dac183de71f78381c2b9f9ce124fc017 | 5926ff763a5055c535462b5a3479946ce77aa0a9 | /Answersheet/356PoorTradeAdvisor.cpp | a8011fa9730ec5f72cc741413315b96a9f9f14b5 | [] | no_license | wuzijian4/CS3391_Answer | 765886b237415ae1c6abe22ea0ee83ac50f4c649 | 8ccb57501e00ed7e55da21f4fb6dc2083eb47069 | refs/heads/master | 2022-08-03T08:47:03.012167 | 2020-05-28T05:50:04 | 2020-05-28T05:50:04 | 267,270,885 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,499 | cpp | #include <iostream>
#include <stdlib.h>
#include <memory.h>
using namespace std;
int n, m;
int parent[510];
struct edge
{
int from;
int to;
int ppa;
};
int cmp(const void* a, const void* b) {
edge* x = (edge*)a;
edge* y = (edge*)b;
return y->ppa - x->ppa;
//decresing order
}
int find... | [
"noreply@github.com"
] | wuzijian4.noreply@github.com |
e53b0504a788bbd5192ab4caa1b503a379ef7f41 | 04251e142abab46720229970dab4f7060456d361 | /lib/rosetta/source/src/protocols/rbsegment_relax/OptimizeThreading.cc | d609a0d539c8c4a1dec37d8b3986a5205a356f63 | [] | no_license | sailfish009/binding_affinity_calculator | 216257449a627d196709f9743ca58d8764043f12 | 7af9ce221519e373aa823dadc2005de7a377670d | refs/heads/master | 2022-12-29T11:15:45.164881 | 2020-10-22T09:35:32 | 2020-10-22T09:35:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,640 | cc | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... | [
"lzhangbk@connect.ust.hk"
] | lzhangbk@connect.ust.hk |
003971c94184f6469a5f61c505c692db20ef2862 | d582847aa1b4d7529ca57a9b9d27019ae50e89f2 | /Bases/Seno con taylor.cpp | 3805f49daab1b4c7b721363d07abaf9966d6b3c9 | [] | no_license | srdelsalto/Proyecto-Final-2 | 2f9f4f19d1a9d86d137affc5be923ebd446f465d | 43767e9f4584ad73fd72337460f3bfd9784f5436 | refs/heads/master | 2021-09-04T18:00:07.404966 | 2018-01-20T22:19:39 | 2018-01-20T22:19:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,201 | cpp | #include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <math.h>
double factorial (int a)
{
int i;
double fac;
fac=1;
for (i=a;i>0;i--)
{
fac=fac*i;
}
return fac;
//dentro de la funcion no llamar a nada igual que la funcion
}
double potencia (double base, double ex... | [
"32906638+Santy5442@users.noreply.github.com"
] | 32906638+Santy5442@users.noreply.github.com |
9f8491572e176380ed9ccba60cdff905bdd42f5c | a2ad0bfa5bcd3fce61a4055b1ef98926225747b1 | /ElementsOfProgrammingInterview/chapter12_Search/cyclicallySortedArr.cc | e808617f7f98610d4541450e26626874a8d6357e | [] | no_license | ldcm3/Tech-Interview-Studies | 7e077a3006eaaf443c4f3d94c50321792ec96171 | ba64fad928c3baef56a43ecc3ec85706db9d8aba | refs/heads/master | 2021-01-13T02:51:40.204583 | 2017-07-06T12:36:41 | 2017-07-06T12:36:41 | 77,131,514 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 669 | cc | /*
Find the position of the smallest element in a cyclically sorted array,
assuming all elements are distinct.
{378,478,550,631,103,203,220,234,279,368}
should return 4
*/
#include<iostream>
#include<vector>
using namespace std;
int findCilPos(const vector<int>& A)
{
int left = 0;
... | [
"lucasdacruzmendes@hotmail.com"
] | lucasdacruzmendes@hotmail.com |
fb8a61b7333739a903fece57f75b4746228a890f | 66b8c3a5ec8696dcefd796a188c94a2ede7e290e | /Bitcoin.ino | 9e858f3ff30e80d1da6f293eb4f8828bd1287d0f | [] | no_license | AndresJ551/Arduino-Bitcoin-Display | e011c3a05d090505647abe26e2ecd4f0ba8dac44 | 2546aff581c0ceda56fc22eed05b54f18b25de71 | refs/heads/master | 2020-05-25T19:50:17.438905 | 2017-03-14T14:58:39 | 2017-03-14T14:58:39 | 84,961,291 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,572 | ino | /* SevSeg Counter Example
Copyright 2016 Dean Reading
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | [
"AndresJ551@gmail.com"
] | AndresJ551@gmail.com |
c3f4300fc233d72827052381b03e4f7218f6e644 | fbe68d84e97262d6d26dd65c704a7b50af2b3943 | /third_party/retdec-3.2/include/retdec/fileformat/types/resource_table/resource.h | 0bcf83fa30c6cc110c8994f1e5b70eb629a5c249 | [
"MIT",
"GPL-1.0-or-later",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"OpenSSL",
"WTFPL",
"LGPL-2.1-only",
"LicenseRef-scancode-openssl",
"LicenseRef-scancode-ssleay-windows",
"LGPL-2.0-or-later",
"JSON",
"Zlib",
"NCSA",
"LicenseRef-scancode-proprietary-license",
"G... | permissive | thalium/icebox | c4e6573f2b4f0973b6c7bb0bf068fe9e795fdcfb | 6f78952d58da52ea4f0e55b2ab297f28e80c1160 | refs/heads/master | 2022-08-14T00:19:36.984579 | 2022-02-22T13:10:31 | 2022-02-22T13:10:31 | 190,019,914 | 585 | 109 | MIT | 2022-01-13T20:58:15 | 2019-06-03T14:18:12 | C++ | UTF-8 | C++ | false | false | 3,503 | h | /**
* @file include/retdec/fileformat/types/resource_table/resource.h
* @brief Class for one resource.
* @copyright (c) 2017 Avast Software, licensed under the MIT license
*/
#ifndef RETDEC_FILEFORMAT_TYPES_RESOURCE_TABLE_RESOURCE_H
#define RETDEC_FILEFORMAT_TYPES_RESOURCE_TABLE_RESOURCE_H
#include <string>
#incl... | [
"benoit.amiaux@gmail.com"
] | benoit.amiaux@gmail.com |
84c92d4e181f3c857efbd6a82241bac9b46723bd | 9c88295f001a92201ff9db33b253b6ea5300c41d | /src/Rational.cpp | b6a88da9ab54c2cb179d2b3c073a1520c292049e | [] | no_license | ANAbdrahmanov/Dyab-lib | a20b7cc3e4c587f7867a2e38e98f9bebac5704ff | 2aa0cb4942331d5427e37330e364d050889e2e47 | refs/heads/master | 2020-04-03T03:02:47.819722 | 2019-11-25T14:31:47 | 2019-11-25T14:31:47 | 154,975,112 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,137 | cpp | #include <iostream>
#include "Rational.h"
int Euclid(int A, int B){
while (B) {
A %= B;
swap (A, B);
}
return A;
}
Rational operator/(int a, Rational b){
return Rational(a*b.getZNT(), b.getCHS());
}
Rational operator*(int a, Rational b){
return Rational(a*b.getCHS(), b.getZNT());
}
Rational operator+(int a... | [
"big.daddy5674@gmail.com"
] | big.daddy5674@gmail.com |
ce0ec2b4ce2d8f8773f2292c3893eed312295645 | a2bdc65e6f303b81a1beecfeb346cb862c8a8534 | /main.cpp | ab59e9d711fd0754e795c74d494d90980aa3e3ca | [] | no_license | zoz25/calculatriceHP | aca7a79cec78fc22cf11b091c8114a4bc330e72b | cb6c6e5452c585e5f6e59847e4cde6ca9463a798 | refs/heads/master | 2020-06-16T14:35:02.309158 | 2016-12-14T15:13:15 | 2016-12-14T15:13:15 | 75,015,473 | 0 | 0 | null | null | null | null | ISO-8859-2 | C++ | false | false | 414 | cpp | #include "calculatrice.h"
int main(int argc, char** argv)
{
Calculatrice calcul = new Calculatrice();
Calculatrice.ajouterOperande(10);
Calculatrice.ajouterOperande(117);
Calculatrice.ajouterOperande(32.4);
Calculatrice.ajouterOperation("+");
//va faire 32.4+117 et va supprimer les deux opérandes de la pile ... | [
"elkhabirayoub@gmail.com"
] | elkhabirayoub@gmail.com |
90cf3a23bf79a809c01f6379d5dfdd9360a64ae1 | e9da7781e7859e2e20f8fa980a945f67960a228a | /CIS170_IntroToC++/Week1/Week1LAB1B/Week1LAB1B/main.cpp | 47460ee5ceabc06ea48a93cc88b5898ca62bb126 | [] | no_license | reneet327/C_class_samples | 8fd41c12679c6192581cf194807f8666bf95f066 | 4171385c21fdc3b5d7bd33734c12207f6076255d | refs/heads/master | 2021-08-31T15:24:39.397235 | 2017-12-21T21:49:07 | 2017-12-21T21:49:07 | 115,050,108 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 782 | cpp | // ---------------------------------------------------------------
// Programming Assignment: LAB1B
// Developer: Renee Thomas
// Date Written: 1/9/14
// Purpose: Ticket Calculation Program
// ---------------------------------------------------------------
// add libraries
#include <iostream>
using namespace ... | [
"reneet327@gmail.com"
] | reneet327@gmail.com |
5727750047332f12794c3dbf11a55c3f37457c4d | 0e41db6f4da32470aa80c55191b5cbe517ab1dc5 | /11712406-project3/source/type.cpp | 1f62784f1cffa6bbfc148eb4a5da007f956ff223 | [] | no_license | wudiiv11/CS323-SPLCompiler | 7f965f3271d899bca6a33db7d8cd7f3ebf842e7b | 259691a22dabc9235bc11b9b48285a8d3774702d | refs/heads/master | 2023-01-30T00:18:52.344373 | 2020-12-15T15:41:31 | 2020-12-15T15:41:31 | 302,395,342 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,882 | cpp | #include "../include/type.h"
Type::Type() {}
Type::Type(string* primitive) {
category = T_PRIMITIVE;
this->primitive = primitive;
}
Type::Type(Array* array) {
category = T_ARRAY;
this->array = array;
}
Type::Type(Struct* structure) {
category = T_STRUCTURE;
this->structure = structure;
}
... | [
"xingxing6124@gmail.com"
] | xingxing6124@gmail.com |
8743df230eb8ce9a787443b456f43f84ba003c85 | 4ec6bc3779261b73164a73c361de26cb0a724676 | /include/NumCpp/Linalg/svd.hpp | 182c1b0fd6897f3f2be38100b794880a144ef345 | [
"MIT"
] | permissive | kontramind/NumCpp | 3efc6673e0cc69b3fcb93f8b7c801abc6d9419cf | eba08fc5b97b338bc1ca9d1f9e2d3d76c2431cd1 | refs/heads/master | 2020-12-26T19:32:05.328636 | 2020-04-12T11:26:35 | 2020-04-12T11:26:35 | 237,615,461 | 0 | 0 | MIT | 2020-02-01T12:59:35 | 2020-02-01T12:59:35 | null | UTF-8 | C++ | false | false | 2,588 | hpp | /// @file
/// @author David Pilger <dpilger26@gmail.com>
/// [GitHub Repository](https://github.com/dpilger26/NumCpp)
/// @version 1.3
///
/// @section License
/// Copyright 2020 David Pilger
///
/// Permission is hereby granted, free of charge, to any person obtaining a copy of this
/// software and associate... | [
"dpilger26@gmail.com"
] | dpilger26@gmail.com |
12f33a063b280a93331c4f8c13aedd21b1ea72f3 | f3af5c4cbf6b24cec4142d8cfa7c452ddbccb0de | /CS482/Application.h | 8d504a25e0d352d5eadd5a0ba1fa1327b0afdb10 | [] | no_license | Suckzoo/CS482 | 5d2c08d6e27884bd971ea1f051fe90c5de3ad6f1 | 2e1d417080babdb4257ab6e91e80c42c2cabe8df | refs/heads/master | 2021-01-22T02:59:16.763409 | 2014-10-07T05:15:14 | 2014-10-07T05:15:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 694 | h | #pragma once
#include "Window.h"
#include "Renderer.h"
#include <GL/glfw3.h>
#include "World.h"
#include "Program.h"
//#include "ViewRenderer.h"
//#include "SimulationRenderer.h"
class Application
{
protected:
int m_fCursorx, m_fCursory;
std::list<Room*> m_pWorld;
std::shared_ptr<Window> m_pWindow;
std::map<std:... | [
"seokju.hong@kaist.ac.kr"
] | seokju.hong@kaist.ac.kr |
9008e1c91ab84c87caea7f8131c99e2b105c1bb7 | 4b43259b236d6d8596c3af5886e9b09502b97f3f | /manasaAndStones.cpp | ca90bb06a81d408c3d21f87c4f9d5b27cc2d7636 | [] | no_license | karanbhatia116/Solutions-to-Coding-Problems | 0ed8bf58db1df08d8ba3f68d431ad4a584782ccf | 68c150fed3e62d7ea9bf5c3c666e5e5ded72caa1 | refs/heads/master | 2021-07-03T22:40:27.373938 | 2020-10-30T06:12:15 | 2020-10-30T06:12:15 | 194,615,610 | 1 | 2 | null | 2020-10-30T06:12:16 | 2019-07-01T06:47:50 | C++ | UTF-8 | C++ | false | false | 575 | cpp | #include<iostream>
using namespace std;
int* SumAndAppend(int a[],int x,int o,int b,int n,int y)
{
if(y<=n)
{
int i,j;
for(j=x;j<y+1;j++)
{
for(i=x-y;i<x;i++)
{
a[j] = a[i] + o;
a[j+1] = a[i] + b;
}
}
x = x + y + 1;
y++;... | [
"noreply@github.com"
] | karanbhatia116.noreply@github.com |
9b964d9601193a21399a74dbbfa436a8a93ebf04 | 2fb7188adb6f52023485d8a775e4ecbf96331b81 | /AutoEncoder/DrawTracker.cxx | 60a838e28b5395926ac80d52b8611770558a893d | [] | no_license | amassiro/dEdxCalibration | f5c580247041b4477a118772bbda9b924ae1103a | 837eb440711983ddd0a283ec0cf3582c4a454d24 | refs/heads/master | 2020-03-24T03:31:45.099672 | 2019-11-08T13:09:40 | 2019-11-08T13:09:40 | 142,422,991 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,272 | cxx |
TH1F * ConvertOverflow(TH1F *h) {
// This function paint the histogram h with an extra bin for overflows
UInt_t nx = h->GetNbinsX()+1;
Double_t *xbins= new Double_t[nx+1];
for (UInt_t i=0;i<nx;i++)
xbins[i]=h->GetBinLowEdge(i+1);
xbins[nx]=xbins[nx-1]+h->GetBinWidth(nx);
char *tempName= new char[strle... | [
"massironi.andrea@gmail.com"
] | massironi.andrea@gmail.com |
2223f3131b46e5c573e3d7843c2498fac7767ed6 | 3e691e8defd8b2a15ccac8006b1ab996e0e8b232 | /Contrib/STLib/packages/numerical/random/poisson/PoissonGeneratorInversionRatioOfUniformsWinrand.h | b4e323549b71250bfbdbc5c6f2ff437fe8b07ada | [] | no_license | cpbotha/vtktudoss | 16063bcd5d61bbbc81efbd2205f07ed0c3161eb1 | d519f47c1c6e98501c5829b0c7d08355143ccb57 | refs/heads/master | 2021-09-03T21:57:39.924068 | 2017-11-14T11:17:50 | 2017-11-14T11:17:50 | 103,945,005 | 1 | 0 | null | 2017-11-14T11:17:51 | 2017-09-18T13:49:18 | C++ | UTF-8 | C++ | false | false | 4,830 | h | // -*- C++ -*-
/*!
\file numerical/random/poisson/PoissonGeneratorInversionRatioOfUniformsWinrand.h
\brief Poisson deviates using WinRand implementation of inversion/ratio of uniforms.
*/
#if !defined(__numerical_PoissonGeneratorInversionRatioOfUniformsWinrand_h__)
#define __numerical_PoissonGeneratorInversionRa... | [
"cpbotha@vxlabs.com"
] | cpbotha@vxlabs.com |
8c3c93a3cea52cd5ae24b25bcee07171816f6824 | 77f78708f87096ee87d9b8a18ce0ff76bec84712 | /Cpp_Version/RayTracingInOneWeekend/RayTracingInOneWeekend/hitable_list.h | 46711012f6c28eaffc5bda86299ca4a9b3d6f4ab | [] | no_license | Arctic-0/RayTracingInOneWeekend | 32fc309e7c50c2d3efa927431d8a780d67e42bd0 | 7b94a6d29d75c3254336c1425699f1c028d37a1e | refs/heads/master | 2023-07-16T08:53:56.027341 | 2021-09-03T15:24:30 | 2021-09-03T15:24:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 703 | h | #pragma once
#ifndef HITABLELISTH
#define HITABLELISTH
#include "hitable.h"
class hitable_list : public hitable {
public:
hitable_list() {}
hitable_list(hitable **l, int n) { list = l; list_size = n; }
virtual bool hit(const ray& r, float tmin, float tmax, hit_record& rec) const;
hitable **list;
int list_size;
}... | [
"406943342@qq.com"
] | 406943342@qq.com |
5cdb6ad93389b2bcabb308651cb13a28356765ec | 3c6727a2ec316c0c9bd0f9368171f4f37af3c4e7 | /half_bridge/dc_motor_shield/DC-Motor-Control-TLE94112EL/src/TLE94112.cpp | a42b00b51300b9aec45e8218cd024d1871ebc769 | [
"BSD-3-Clause"
] | permissive | ventilator/arduino | d0ad705553adfaf5f1b05463d6e137b416675a28 | cbd6fedd2e86c6ce4ecdd19b9db6d70dd9bd14da | refs/heads/master | 2021-01-10T02:11:13.732168 | 2018-07-05T13:49:48 | 2018-07-05T13:49:48 | 49,771,373 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,679 | cpp | /*
* Arduino library to control Infineon's DC Motor Control Shield with TLE94112
*
* The shield contains twelve independent halfbridges,
* so it can drive up to 6 indipendent (+5 cascaded) bidirectional DC motor(s).
* Each halfbridge provides a high-Voltage (nominal 5.5-18 V) tristate output,
* which is also ... | [
"gruenewald.clemens@gmail.com"
] | gruenewald.clemens@gmail.com |
88ce2d81a56f43a5f2f048202284b0a079546863 | a8461f71fa5dea2da62570c375a743d51fb10c64 | /AF_2.0/lattice.cpp | d4d672f48cb48ac8a0e810230c8b13e6930c722a | [] | no_license | JoshFreemont/AF | 25528c3025031fadc243009b6277b9d84d0d784e | 0f33cabb264373a8e9b05df880b0b50c8d372c2c | refs/heads/master | 2020-12-24T13:35:51.677932 | 2014-09-13T12:48:57 | 2014-09-13T12:48:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,312 | cpp | //
// lattice.cpp
// AF_2.0
//
// Created by josh freemont on 29/08/2014.
// Copyright (c) 2014 com.example. All rights reserved.
//
#include "lattice.h"
#include <ctime>
//Constructor
//Initialises SinoAtrial Period, Grid Size. Reserve capacity for coordinate data.
//Set lattice1D new pointer to instances of cel... | [
"giosh@hotmail.co.uk"
] | giosh@hotmail.co.uk |
b4d4d60e856f94fe581fd70a64dad7144f5c2190 | 8ec4ef59d30685452f569aa7932b7bea7792d7fa | /Source/ShooterMulti/Public/MenuInterface.h | 715bff12b6b292b907a363a07941f9b386fafe2f | [] | no_license | DavidKirkpatrick95/UE4-Multiplayer-Shooter | a575b11b10c6ac0cfa66d261411e43a245c6247c | 9f8546c25f497442241994f65e9b3bc202f43397 | refs/heads/master | 2023-03-02T23:55:52.968758 | 2020-11-29T19:24:43 | 2020-11-29T19:24:43 | 308,693,016 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 714 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "UObject/Interface.h"
#include "MenuInterface.generated.h"
// This class does not need to be modified.
UINTERFACE(MinimalAPI)
class UMenuInterface : public UInterface
{
GENERATED_BODY()
};
... | [
"david.kirkpatrick83@gmail.com"
] | david.kirkpatrick83@gmail.com |
cd635e4d625bb3686f72b20d8bdda13b29db5b44 | 4d1d1c1b84cb9f02fb8677f9fb2dae9244ff82e6 | /add_on/scripthandle/scripthandle.cpp | c636637305904324d7f8d3bab4d93e5239d32d8e | [] | no_license | simongeilfus/angelscriptsdk | c6ea619750695bf9c99bb0072fed63d11a458d35 | c892cabbd10a809d064d8601490495518c0cbf6d | refs/heads/master | 2020-12-31T02:43:08.010577 | 2014-12-14T02:01:40 | 2014-12-14T02:01:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,279 | cpp | #include "scripthandle.h"
#include <new>
#include <assert.h>
#include <string.h>
BEGIN_AS_NAMESPACE
static void Construct(CScriptHandle *self) { new(self) CScriptHandle(); }
static void Construct(CScriptHandle *self, const CScriptHandle &o) { new(self) CScriptHandle(o); }
// This one is not static because it needs to... | [
"angelcode@404ce1b2-830e-0410-a2e2-b09542c77caf"
] | angelcode@404ce1b2-830e-0410-a2e2-b09542c77caf |
25c591326571d617020ac864b6257e808e561e93 | 519a52653ba485b4ec3e8044e39014ece7822d5c | /oop/04-inheritance/01.cpp | d666d8ec83e24076c0821e9897536036b7c64dc2 | [] | no_license | ACMatUC/cpp-language-review | 3713c05f0ee68211e7e366e35e773086c33fde47 | 0c2f93da187c011c7b54c9296adab5c66a72775e | refs/heads/master | 2021-01-19T06:23:51.977128 | 2017-02-22T22:54:27 | 2017-02-22T22:54:27 | 79,752,524 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,193 | cpp | #include <iostream>
#include <string>
using namespace std;
class Person {
private:
string name, address, ssn;
public:
Person(string inName, string inAddress, string inSSN) : name(inName), address(inAddress), ssn(inSSN) {
/* More logic here if necessary */
}
string getName() {
return this->name;
... | [
"domfarolino@gmail.com"
] | domfarolino@gmail.com |
803d2173c032835f8071f8e9b2dd51f8d71dd353 | 3e5ae9b260b16fcc86bb0669c1bd4e56912b5433 | /VCB600ENU1/MSDN_VCB/SAMPLES/VC98/SDK/NETDS/ADSI/SAMPPROV/CENUMSCH.CPP | ca418eb86dad4b519cced8fa637ecf128245266f | [] | no_license | briancpark/deitel-cpp | e8612c7011c9d9d748290419ae2708d2f3f11543 | 90cdae5661718e65ab945bcf45fe6adff30c1e10 | refs/heads/main | 2023-06-14T14:07:05.497253 | 2021-07-05T01:46:04 | 2021-07-05T01:46:04 | 382,984,213 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,843 | cpp | /*++
Copyright (c) 1996 Microsoft Corporation
Module Name:
CEnumSch.cpp
Abstract:
Sample Provider Enum Schema functionality
Author:
Environment:
User mode
Revision History :
--*/
#include "adssmp.h"
#pragma hdrstop
//+-------------------------------------------------------... | [
"briancpark@berkeley.edu"
] | briancpark@berkeley.edu |
44808233301cd22e3ddf1d95bd01fea0c89a64e8 | b1fca7a6b38cfdabe16eb9280bd13338035c0352 | /test/constructor/pre_error.cpp | 4bbbac10494f783fb2c8e7577bd13a7c6611c04e | [
"BSL-1.0"
] | permissive | danieljames/contract | 14f6d8d74fd77f4474488e74b19984d4ff42c5ac | 2a7205e98a1acbcc583b105036b68bf1d1c70953 | refs/heads/master | 2021-09-03T19:26:00.170791 | 2017-09-20T04:26:06 | 2017-09-20T04:26:06 | 104,771,261 | 0 | 0 | null | 2017-09-25T15:56:56 | 2017-09-25T15:56:56 | null | UTF-8 | C++ | false | false | 644 | cpp |
// Copyright (C) 2008-2017 Lorenzo Caminiti
// Distributed under the Boost Software License, Version 1.0 (see accompanying
// file LICENSE_1_0.txt or a copy at http://www.boost.org/LICENSE_1_0.txt).
// See: http://www.boost.org/doc/libs/release/libs/contract/doc/html/index.html
// Test constructor cannot use `.precon... | [
"lorcaminiti@gmail.com"
] | lorcaminiti@gmail.com |
3e88292de4dc1afcbeb6393b39a41361f1ece4c6 | becd5ee93440020322e3ad99926cebc0e71d786d | /src/common/expression/RelationalExpression.cpp | 4b60d0d2434be7a38351b3d8c6d328a4ea391320 | [
"Apache-2.0"
] | permissive | heyanlong/nebula | aa94f589a2d77d0cb6e40dcced1f5ee0a8e6a79c | 07ccfde198c978b8c86b7091773e3238bfcdf454 | refs/heads/master | 2023-09-04T13:49:18.522506 | 2021-11-03T15:16:03 | 2021-11-03T15:16:03 | 424,433,008 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,286 | cpp | /* Copyright (c) 2020 vesoft inc. All rights reserved.
*
* This source code is licensed under Apache 2.0 License.
*/
#include "common/expression/RelationalExpression.h"
#include "common/datatypes/List.h"
#include "common/datatypes/Map.h"
#include "common/datatypes/Set.h"
#include "common/expression/ExprVisitor.h"
... | [
"noreply@github.com"
] | heyanlong.noreply@github.com |
04c017e2c2b8048b5e1e6868359bd025f8f6a184 | cd8d38b5db8430b66b6aa8e917b2f2869c526d68 | /Onyx/lib/fakes.cpp | 8abc6978f0ab41a75b25374d840941c5821b163d | [] | no_license | jwatte/robotcode | 48005310a8672287b4c70dee1339272e9d55a710 | a95c78dfa63cb5b231a832c52e5aaea83c2d9a61 | refs/heads/master | 2016-09-06T12:24:06.913757 | 2013-08-18T03:12:23 | 2013-08-18T03:12:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,376 | cpp |
#include "fakes.h"
#include <iostream>
#include <stdexcept>
Fakenet::Fakenet() {
stepCnt_ = 0;
wasLocked_ = false;
wasUnlocked_ = false;
locked_ = false;
timeout_ = 0;
}
void Fakenet::step() {
++stepCnt_;
}
bool Fakenet::receive(size_t &size, void const *&packet) {
if (!toReceive_.size(... | [
"jwatte@gmail.com"
] | jwatte@gmail.com |
a541d352747efc5639b0d568fd71febeb12872e6 | 26b78f3fd4668de73bfa289163fe6522f67f6f60 | /dg/src/analysis/ReachingDefinitions/Srg/MarkerSRGBuilderFS.h | 4d5f6e48738b49ed6c7c484b92ce0c1a014de968 | [
"MIT"
] | permissive | zytMatrix/binFICS | 8aa522d1454f38c27f90288929c5c3ecc799952e | cd630a3d95f8b4eaba2563c78a75fe051db9fed6 | refs/heads/master | 2023-06-03T09:16:08.037042 | 2021-06-22T09:20:14 | 2021-06-22T09:20:14 | 371,326,263 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,757 | h | #ifndef _DG_MARKERSRGBUILDERFS_H
#define _DG_MARKERSRGBUILDERFS_H
#include <memory>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include "analysis/BFS.h"
#include "analysis/ReachingDefinitions/Srg/SparseRDGraphBuilder.h"
#include "analysis/ReachingDefinitions/Srg/IntervalMap.h"
... | [
"919902609@qq.com"
] | 919902609@qq.com |
5eee5d77b8728c72746b4e45bd6ccd834cf43cf5 | 45b4fdd740f367b4cbce2071b565f3640cc99d9c | /OFTest1/src/game/leveldesc/level.cpp | ffeeca10de422d28b2f6054dd5235843c85ca57e | [] | no_license | paarm/of_playground | 7bd928de0a3f3b0235f83f5f187abba96486e137 | 272f0c6db4ae4cd30e8ae05eb71e6f924c35a38c | refs/heads/master | 2021-01-19T10:17:53.373873 | 2017-04-10T19:46:02 | 2017-04-10T19:46:02 | 87,850,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,979 | cpp | #include "level.h"
void Level::clearLevel() {
mLevelName="";
mObjectDescMap.clear();
mLayerList.clear();
mTextureManager.reset();
mLevelObjectNameNbPool=0;
}
void Level::setLevelName(const string &rLevelName) {
mLevelName=rLevelName;
}
string& Level::getLevelName() {
return mLevelName;
}
ObjectDesc& Level::g... | [
"martin.paar@gmail.com"
] | martin.paar@gmail.com |
07fcfe267a1db18ba13bfe44a7e7ebce60e44277 | 1f45bf1127ff868bf4d22753a65047d874c2ffb1 | /src/thirdPartyLibs/apache-log4cxx-win32-0.10.0/apache-log4cxx-0.10.0/src/main/cpp/outputstreamwriter.cpp | 8440c44a252c7c25d613a2be7410aea15e5b6d2c | [
"Apache-2.0"
] | permissive | smartdevice475/sdl_core_v3.6_wince | 50207a89fa2bfe0487409e4ad3babae52e477b54 | 5fff3bd40f83517f89428895b3dbe069b0f2f262 | refs/heads/master | 2021-01-18T09:34:08.202701 | 2016-08-10T01:57:23 | 2016-08-10T01:57:23 | 55,580,033 | 2 | 0 | null | 2016-04-06T06:05:08 | 2016-04-06T06:05:08 | null | UTF-8 | C++ | false | false | 2,467 | cpp | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... | [
"luwanjia@beyondsoft.com"
] | luwanjia@beyondsoft.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.