hexsha stringlengths 40 40 | size int64 7 1.05M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 269 | max_stars_repo_name stringlengths 5 109 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count int64 1 191k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 4 269 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 9 | max_issues_count int64 1 48.5k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 4 269 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 9 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 7 1.05M | avg_line_length float64 1.21 330k | max_line_length int64 6 990k | alphanum_fraction float64 0.01 0.99 | author_id stringlengths 2 40 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22fb42e4395d1899c6f13e1a521e64d43fce7dbb | 948 | cpp | C++ | leetcode/30days-challenge/202005/day6.cpp | wingkwong/competitive-programming | e8bf7aa32e87b3a020b63acac20e740728764649 | [
"MIT"
] | 18 | 2020-08-27T05:27:50.000Z | 2022-03-08T02:56:48.000Z | leetcode/30days-challenge/202005/day6.cpp | wingkwong/competitive-programming | e8bf7aa32e87b3a020b63acac20e740728764649 | [
"MIT"
] | null | null | null | leetcode/30days-challenge/202005/day6.cpp | wingkwong/competitive-programming | e8bf7aa32e87b3a020b63acac20e740728764649 | [
"MIT"
] | 1 | 2020-10-13T05:23:58.000Z | 2020-10-13T05:23:58.000Z | /*
Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element always exist in the array.
Example 1:
Input: [3,2,3]
Output: 3
Example 2:
Input: [2,2,1,1,1,2,2]
Out... | 22.571429 | 126 | 0.602321 | wingkwong |
22fe4e63aab41b87c5c16e21a6ef7009503d8d8e | 4,397 | hpp | C++ | include/Org/BouncyCastle/Utilities/Collections/CollectionUtilities.hpp | RedBrumbler/BeatSaber-Quest-Codegen | 73dda50b5a3e51f10d86b766dcaa24b0c6226e25 | [
"Unlicense"
] | null | null | null | include/Org/BouncyCastle/Utilities/Collections/CollectionUtilities.hpp | RedBrumbler/BeatSaber-Quest-Codegen | 73dda50b5a3e51f10d86b766dcaa24b0c6226e25 | [
"Unlicense"
] | null | null | null | include/Org/BouncyCastle/Utilities/Collections/CollectionUtilities.hpp | RedBrumbler/BeatSaber-Quest-Codegen | 73dda50b5a3e51f10d86b766dcaa24b0c6226e25 | [
"Unlicense"
] | null | null | null | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
#include "beatsaber-hook/shared/utils/typedefs-... | 57.103896 | 225 | 0.741869 | RedBrumbler |
fe005a8a1a7ea30ed3eaea187461564f79d85fb3 | 2,574 | cpp | C++ | library/Components/Objects/Watchdog/test/test/watch_clock_test.cpp | NGliese/Embedded | 589f55858b1f8b994347df3c0a2b2fcd4f9bd14e | [
"MIT"
] | null | null | null | library/Components/Objects/Watchdog/test/test/watch_clock_test.cpp | NGliese/Embedded | 589f55858b1f8b994347df3c0a2b2fcd4f9bd14e | [
"MIT"
] | null | null | null | library/Components/Objects/Watchdog/test/test/watch_clock_test.cpp | NGliese/Embedded | 589f55858b1f8b994347df3c0a2b2fcd4f9bd14e | [
"MIT"
] | null | null | null | /*
* TEMPLATE.cpp
*
* Created on: Jul 7, 2020
* Author: espenv
*/
#include "../../include/Watch_Clock.hpp"
#include <iostream>
#include "CppUTest/TestHarness.h"
extern uint32_t fake_start_time;
extern uint32_t fake_end_time;
TEST_GROUP(WCH_CLK_GRP)
{
Watch_Clock m_clock;
void setup()
{
fake_start_ti... | 19.353383 | 61 | 0.710956 | NGliese |
fe045dda45f8756f4cb025d3ef15dbcfc0d8038d | 9,178 | cpp | C++ | src/CRootElement.cpp | Thomas-Astade/doxyqml | 03e607b133cc75f9a0b3fe757b87067c8072fe57 | [
"BSD-2-Clause"
] | 1 | 2021-05-07T09:46:25.000Z | 2021-05-07T09:46:25.000Z | src/CRootElement.cpp | Thomas-Astade/doxyqml | 03e607b133cc75f9a0b3fe757b87067c8072fe57 | [
"BSD-2-Clause"
] | null | null | null | src/CRootElement.cpp | Thomas-Astade/doxyqml | 03e607b133cc75f9a0b3fe757b87067c8072fe57 | [
"BSD-2-Clause"
] | null | null | null | /*
Copyright 2018 Thomas Spitzer <doxyqml@astade.de>
All rights reserved.
This software is a fork of the doxyqml tool written in python, by Aurélien Gâteau
(https://github.com/agateau/doxyqml)
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following co... | 34.503759 | 168 | 0.691545 | Thomas-Astade |
fe072362b759c566017cc8909121584ddeb1f9e9 | 10,482 | cpp | C++ | fsed/commands.cpp | chwash/wwiv | 0d67acdede788f8a4fd2b442e92caeb411552359 | [
"Apache-2.0"
] | null | null | null | fsed/commands.cpp | chwash/wwiv | 0d67acdede788f8a4fd2b442e92caeb411552359 | [
"Apache-2.0"
] | null | null | null | fsed/commands.cpp | chwash/wwiv | 0d67acdede788f8a4fd2b442e92caeb411552359 | [
"Apache-2.0"
] | null | null | null | /**************************************************************************/
/* */
/* WWIV Version 5.x */
/* Copyright (C)2020-2022, WWIV Software Services */
/* ... | 40.785992 | 100 | 0.59626 | chwash |
fe0fabed245ab016dd2577c4d729f2395e69d24d | 2,180 | cpp | C++ | oop/lab_4/lab_4/Source.cpp | vimikeva/s | 59a4697ef1c054049643b754a82b1823bf32c2ae | [
"MIT"
] | null | null | null | oop/lab_4/lab_4/Source.cpp | vimikeva/s | 59a4697ef1c054049643b754a82b1823bf32c2ae | [
"MIT"
] | null | null | null | oop/lab_4/lab_4/Source.cpp | vimikeva/s | 59a4697ef1c054049643b754a82b1823bf32c2ae | [
"MIT"
] | null | null | null | #include "List.h"
#include "File.h"
int main() {
List<CFile> Base;
List<CFile> Trash;
List<CFile>::iterator it;
int i;
bool flag = true;
string choice_temp, ch_number;
string str, str_temp;
Base.load("base.csv");
while (true) {
// print Base
cout << "Base:\n";
if (Base.empty()) cout ... | 22.244898 | 125 | 0.480275 | vimikeva |
fe12d71d65eb5baacec88c2daa8948bae243632f | 4,051 | hpp | C++ | include/xul/io/memory_input_stream.hpp | hindsights/xul | 666ce90742a9919d538ad5c8aad618737171e93b | [
"MIT"
] | 2 | 2018-03-16T07:06:48.000Z | 2018-04-02T03:02:14.000Z | include/xul/io/memory_input_stream.hpp | hindsights/xul | 666ce90742a9919d538ad5c8aad618737171e93b | [
"MIT"
] | null | null | null | include/xul/io/memory_input_stream.hpp | hindsights/xul | 666ce90742a9919d538ad5c8aad618737171e93b | [
"MIT"
] | 1 | 2019-08-12T05:15:29.000Z | 2019-08-12T05:15:29.000Z | #pragma once
#include <xul/io/input_stream.hpp>
#include <xul/macro/memory.hpp>
#include <boost/noncopyable.hpp>
#include <vector>
#include <string>
#include <assert.h>
#include <stdint.h>
#include <string.h>
namespace xul {
class memory_input_stream : public input_stream, private boost::noncopyable
{
public:
... | 22.016304 | 88 | 0.545544 | hindsights |
fe15c1d5bf5940e93ac42f700009f48878de15bd | 741 | cpp | C++ | UVA12283.cpp | MaSteve/UVA-problems | 3a240fcca02e24a9c850b7e86062f8581df6f95f | [
"MIT"
] | 17 | 2015-12-08T18:50:03.000Z | 2022-03-16T01:23:20.000Z | UVA12283.cpp | MaSteve/UVA-problems | 3a240fcca02e24a9c850b7e86062f8581df6f95f | [
"MIT"
] | null | null | null | UVA12283.cpp | MaSteve/UVA-problems | 3a240fcca02e24a9c850b7e86062f8581df6f95f | [
"MIT"
] | 6 | 2017-04-04T18:16:23.000Z | 2020-06-28T11:07:22.000Z | #include <iostream>
#include <algorithm>
using namespace std;
int N, M;
int dp[101][101], costumes[100];
int proc(int i, int j) {
if (j < i) return 0;
if (dp[i][j] == -1) {
int val = 1 + proc(i, j-1);
for (int k = i; k < j; k++) {
if (costumes[k] == costumes[j]) val = min(val, proc... | 22.454545 | 88 | 0.407557 | MaSteve |
fe25b30603dde09a4d4babd8120ff7bb9bdcc0cf | 2,462 | hpp | C++ | src/org/apache/poi/poifs/crypt/DataSpaceMapUtils_DataSpaceMapEntry.hpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | src/org/apache/poi/poifs/crypt/DataSpaceMapUtils_DataSpaceMapEntry.hpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | src/org/apache/poi/poifs/crypt/DataSpaceMapUtils_DataSpaceMapEntry.hpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | // Generated from /POI/java/org/apache/poi/poifs/crypt/DataSpaceMapUtils.java
#pragma once
#include <fwd-POI.hpp>
#include <java/io/fwd-POI.hpp>
#include <java/lang/fwd-POI.hpp>
#include <org/apache/poi/poifs/crypt/fwd-POI.hpp>
#include <org/apache/poi/util/fwd-POI.hpp>
#include <java/lang/Object.hpp>
#include <org/a... | 35.171429 | 164 | 0.748172 | pebble2015 |
fe2641137c8c61d4854422caf2bbc4967925aef3 | 475 | cpp | C++ | Kattis/bossbattle.cpp | YourName0729/competitive-programming | 437ef18a46074f520e0bfa0bdd718bb6b1c92800 | [
"MIT"
] | 3 | 2021-02-19T17:01:11.000Z | 2021-03-11T16:50:19.000Z | Kattis/bossbattle.cpp | YourName0729/competitive-programming | 437ef18a46074f520e0bfa0bdd718bb6b1c92800 | [
"MIT"
] | null | null | null | Kattis/bossbattle.cpp | YourName0729/competitive-programming | 437ef18a46074f520e0bfa0bdd718bb6b1c92800 | [
"MIT"
] | null | null | null | //
// https://open.kattis.com/problems/bossbattle
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define forcase int __t;cin >> __t;while (__t--)
#define For(i, n) for(int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int main() {
fast;
int n;
... | 16.37931 | 64 | 0.52 | YourName0729 |
fe2b478f6304a9a2553227e667ca46bb2047fc65 | 314 | hpp | C++ | compat/win32-com.hpp | sheepsskullcity/opentrack | 2742eebed2dd5db4dbf187504c95eca70aa624f2 | [
"ISC"
] | 1 | 2021-06-14T09:00:47.000Z | 2021-06-14T09:00:47.000Z | compat/win32-com.hpp | sheepsskullcity/opentrack | 2742eebed2dd5db4dbf187504c95eca70aa624f2 | [
"ISC"
] | null | null | null | compat/win32-com.hpp | sheepsskullcity/opentrack | 2742eebed2dd5db4dbf187504c95eca70aa624f2 | [
"ISC"
] | null | null | null | #pragma once
#ifdef _WIN32
#include "export.hpp"
#include <objbase.h>
#include <ole2.h>
enum com_type : int
{
com_multithreaded = COINIT_MULTITHREADED,
com_apartment = COINIT_APARTMENTTHREADED,
com_invalid = 0,
};
bool OPENTRACK_COMPAT_EXPORT init_com_threading(com_type t = com_invalid);
#endif
| 15.7 | 74 | 0.748408 | sheepsskullcity |
fe2e686485412773739a1a9b8135fa81700b54f2 | 553 | cpp | C++ | FARIDA.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2019-05-23T20:03:40.000Z | 2019-05-23T20:03:40.000Z | FARIDA.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | null | null | null | FARIDA.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2021-08-28T16:48:42.000Z | 2021-08-28T16:48:42.000Z | #include<cstdio>
#include<iostream>
using namespace std;
long long recur(long long *A,int n,long long *B)
{
if(n<0)
return 0;
long long a;
long long b;
if(B[n]==-1)
{
a=recur(A,n-2,B);
b=recur(A,n-1,B);
B[n]=max(A[n]+a,b);
}
return B[n];
}
int main()
{
int n,t;
long long ans;
scanf("%d",&t);
for(int i=... | 13.487805 | 48 | 0.555154 | Akki5 |
fe2fae4b491029420f29c8381624c6934fc5fe5a | 2,486 | hpp | C++ | Packt_CreatingGamesWithAI/PackmanLikeGame/PLG_GameObjects/PLG_CharacterControllers/AI/PLG_EnemyAi.hpp | mcihanozer/Hands-On-Game-AI-Development | 36453b678cfeb644aeeccf4e77069fa6531684d2 | [
"MIT"
] | 6 | 2018-12-04T04:39:42.000Z | 2022-03-01T09:36:39.000Z | Packt_CreatingGamesWithAI/PackmanLikeGame/PLG_GameObjects/PLG_CharacterControllers/AI/PLG_EnemyAi.hpp | mcihanozer/Hands-On-Game-AI-Development | 36453b678cfeb644aeeccf4e77069fa6531684d2 | [
"MIT"
] | 1 | 2019-07-25T19:52:35.000Z | 2019-07-25T19:52:35.000Z | Packt_CreatingGamesWithAI/PackmanLikeGame/PLG_GameObjects/PLG_CharacterControllers/AI/PLG_EnemyAi.hpp | PacktPublishing/Hands-On-Game-AI-Development | 27328e4658bfd1606abe51cc14a8adbe8c752d76 | [
"MIT"
] | 4 | 2018-11-08T09:29:02.000Z | 2020-05-09T21:21:28.000Z | //
// PLG_EnemyAi.hpp
// Packt_CreatingGamesWithAI
//
// Created by Cihan Ozer on 01/10/2018.
// Copyright © 2018 Cihan Ozer. All rights reserved.
//
#ifndef PLG_EnemyAi_hpp
#define PLG_EnemyAi_hpp
#include "GameCharacterController.hpp"
#include "PLG_EnemyCharacter.hpp"
#include "StateMachine.hpp"
#include "PLG_... | 25.111111 | 78 | 0.704747 | mcihanozer |
fe36fa995108a1b9fafc38d4adf187001545cd26 | 504 | cpp | C++ | Classes/Scenes/TemplateScene/TemplateScene.cpp | friedcroco070801/bloodypenguins | 35f62812ca3e5a15de64bd2808eabbdc82fd848b | [
"MIT"
] | null | null | null | Classes/Scenes/TemplateScene/TemplateScene.cpp | friedcroco070801/bloodypenguins | 35f62812ca3e5a15de64bd2808eabbdc82fd848b | [
"MIT"
] | null | null | null | Classes/Scenes/TemplateScene/TemplateScene.cpp | friedcroco070801/bloodypenguins | 35f62812ca3e5a15de64bd2808eabbdc82fd848b | [
"MIT"
] | 1 | 2022-02-06T21:44:31.000Z | 2022-02-06T21:44:31.000Z | #include "TemplateScene.h"
#include "TemplateSceneDefinitions.h"
#include "Components/TemplateComponent/TemplateComponent.h"
USING_NS_CC;
Scene* TemplateScene::createScene()
{
return TemplateScene::create();
}
// on "init" you need to initialize your instance
bool TemplateScene::init()
{
// Super init
if... | 22.909091 | 65 | 0.698413 | friedcroco070801 |
fe3a4c5044c427e2754110f9733ad9b824fd5944 | 3,395 | hpp | C++ | include/rt/buffer/MutableBuffer.hpp | errata-c/rt-core | b87e5f117cf251e1e785bab2ef999726f3fd0a2d | [
"MIT"
] | null | null | null | include/rt/buffer/MutableBuffer.hpp | errata-c/rt-core | b87e5f117cf251e1e785bab2ef999726f3fd0a2d | [
"MIT"
] | null | null | null | include/rt/buffer/MutableBuffer.hpp | errata-c/rt-core | b87e5f117cf251e1e785bab2ef999726f3fd0a2d | [
"MIT"
] | null | null | null | #pragma once
#include "BufferBase.hpp"
namespace rt {
class MutableBuffer : public Buffer {
public:
MutableBuffer(MutableType nType)
: type(nType)
{}
~MutableBuffer() = default;
MutableBuffer(const MutableBuffer&) = delete;
MutableBuffer& operator=(const MutableBuffer&) = delete;
void initArray(siz... | 27.16 | 120 | 0.681001 | errata-c |
fe429b5d40203a14fcca972472f60379d6b1d790 | 37,416 | cpp | C++ | minetest-ego/src/script/common/c_content.cpp | medialab-prado/Interactivos-15-Ego | 4c7e184b9495d07fc1008573ef1b752d20ebc1ab | [
"MIT"
] | null | null | null | minetest-ego/src/script/common/c_content.cpp | medialab-prado/Interactivos-15-Ego | 4c7e184b9495d07fc1008573ef1b752d20ebc1ab | [
"MIT"
] | null | null | null | minetest-ego/src/script/common/c_content.cpp | medialab-prado/Interactivos-15-Ego | 4c7e184b9495d07fc1008573ef1b752d20ebc1ab | [
"MIT"
] | null | null | null | /*
Minetest
Copyright (C) 2013 celeron55, Perttu Ahola <celeron55@gmail.com>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later ve... | 30.174194 | 107 | 0.63553 | medialab-prado |
1cfbf808127079cad7ab19833f7f2fe258eaa430 | 14,753 | cpp | C++ | src/FeatureDataSource.cpp | MetaboliteCartography/OptimusViewer | 5b22cc1039c6e3a80bf576a2e8edebecad0d8c96 | [
"Apache-2.0"
] | 2 | 2017-05-14T12:16:07.000Z | 2022-03-01T21:08:17.000Z | src/FeatureDataSource.cpp | MetaboliteCartography/OptimusViewer | 5b22cc1039c6e3a80bf576a2e8edebecad0d8c96 | [
"Apache-2.0"
] | 1 | 2016-05-31T07:35:47.000Z | 2016-11-28T09:24:59.000Z | src/FeatureDataSource.cpp | MetaboliteCartography/OptimusViewer | 5b22cc1039c6e3a80bf576a2e8edebecad0d8c96 | [
"Apache-2.0"
] | 2 | 2017-05-14T12:16:45.000Z | 2020-08-31T13:12:03.000Z | #include <math.h>
#include <QApplication>
#include <QDataStream>
#include <QFileDialog>
#include <QMessageBox>
#include <QSqlQuery>
#include <QVariant>
#include "FeatureDataSource.h"
const int QUERY_PARAMS_LIMIT = 999;
namespace ov {
FeatureDataSource::FeatureDataSource()
{
db = QSqlDatabase::addDatabase("QSQL... | 34.877069 | 194 | 0.676879 | MetaboliteCartography |
1cfce57705d55ed234c4fd015209de1bb4ec867b | 3,154 | cpp | C++ | DataStructure/LeftistTree.cpp | AstatineAi/OI-Template | 0c0e7109357dccb0fbddaae5d496a1743e9b9244 | [
"MIT"
] | 5 | 2021-12-30T10:17:36.000Z | 2022-01-23T11:09:54.000Z | DataStructure/LeftistTree.cpp | AstatineAi/OI-Template | 0c0e7109357dccb0fbddaae5d496a1743e9b9244 | [
"MIT"
] | 1 | 2021-12-30T11:26:15.000Z | 2021-12-30T14:27:31.000Z | DataStructure/LeftistTree.cpp | AstatineAi/OI-Template | 0c0e7109357dccb0fbddaae5d496a1743e9b9244 | [
"MIT"
] | null | null | null | /*
Luogu P3377 Leftist Tree
Author : AstatineAi
*/
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <climits>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <utility>
#define space putC(' ')
#define enter putC('\n')
#define El_Pu... | 20.348387 | 58 | 0.533608 | AstatineAi |
1cff823fd520d7b05e998986d0b22506142e38d5 | 680 | hpp | C++ | library/ATF/_AFX_OLE_STATE.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/_AFX_OLE_STATE.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/_AFX_OLE_STATE.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <CNoTrackObject.hpp>
#include <COleDataSource.hpp>
#include <CView.hpp>
#include <HINSTANCE__.hpp>
START_ATF_NAMESPACE
#pragma pack(push, 8)
struct _A... | 26.153846 | 108 | 0.704412 | lemkova |
e80293eee156ce4e673ffd6afbc1dda9c2dfeb10 | 1,753 | hpp | C++ | src/algorithms/data_structures/sll/remove_duplicates_linked_list.hpp | iamantony/CppNotes | 2707db6560ad80b0e5e286a04b2d46e5c0280b3f | [
"MIT"
] | 2 | 2020-07-31T14:13:56.000Z | 2021-02-03T09:51:43.000Z | src/algorithms/data_structures/sll/remove_duplicates_linked_list.hpp | iamantony/CppNotes | 2707db6560ad80b0e5e286a04b2d46e5c0280b3f | [
"MIT"
] | 28 | 2015-09-22T07:38:21.000Z | 2018-10-02T11:00:58.000Z | src/algorithms/data_structures/sll/remove_duplicates_linked_list.hpp | iamantony/CppNotes | 2707db6560ad80b0e5e286a04b2d46e5c0280b3f | [
"MIT"
] | 2 | 2018-10-11T14:10:50.000Z | 2021-02-27T08:53:50.000Z | #ifndef REMOVE_DUPLICATES_LINKED_LIST_HPP_
#define REMOVE_DUPLICATES_LINKED_LIST_HPP_
// Write code to remove duplicates from an unsorted linked list.
// How would you solve this problem if a temporary buffer is not allowed?
#include <unordered_set>
#include "types/ds/singly_linked_list_nodes.hpp"
template<typename... | 22.766234 | 73 | 0.543639 | iamantony |
e8029d3c25c870678b9157483b91848da56764fe | 1,129 | cpp | C++ | Ejercicios/Ejercicio52-Tarea9/jugarDados.cpp | ElmerMenjivar1999/cpp | 10080c5d8bfca0952bf0fa2cf3d328f19105df42 | [
"MIT"
] | null | null | null | Ejercicios/Ejercicio52-Tarea9/jugarDados.cpp | ElmerMenjivar1999/cpp | 10080c5d8bfca0952bf0fa2cf3d328f19105df42 | [
"MIT"
] | null | null | null | Ejercicios/Ejercicio52-Tarea9/jugarDados.cpp | ElmerMenjivar1999/cpp | 10080c5d8bfca0952bf0fa2cf3d328f19105df42 | [
"MIT"
] | null | null | null | #include <iostream>
#include <stdlib.h>
#include <time.h>
using namespace std;
int main(int argc, char const *argv[])
{
int dado1 = 0;
int dado2 = 0;
string tirarDado1 = "";
string tirarDado2 = "";
srand(time(NULL));
cout << "Bienvenido a Juego de Dados !" << endl;
cout << "Quiere tira... | 21.711538 | 81 | 0.524358 | ElmerMenjivar1999 |
e80707d0ff3303cae52d57ec21619a3d16988871 | 7,192 | cpp | C++ | OpenGLSamples/FrameWork/GLFrameBuffer.cpp | PeymanTahghighi/OpenGLSamples | ec81e5311ddf19ee15a3721512296be612ebd515 | [
"MIT"
] | null | null | null | OpenGLSamples/FrameWork/GLFrameBuffer.cpp | PeymanTahghighi/OpenGLSamples | ec81e5311ddf19ee15a3721512296be612ebd515 | [
"MIT"
] | null | null | null | OpenGLSamples/FrameWork/GLFrameBuffer.cpp | PeymanTahghighi/OpenGLSamples | ec81e5311ddf19ee15a3721512296be612ebd515 | [
"MIT"
] | null | null | null | //==========================================================================================
//==========================================================================================
#include<cassert>
#include"GLTexture.h"
#include "GLFrameBuffer.h"
//=================================================================... | 42.05848 | 107 | 0.534344 | PeymanTahghighi |
e80eb1360e26eef7b14740e38bfa780f45a85449 | 359 | cpp | C++ | leetcode/cpp/1021-Remove-Outermost-Parentheses.cpp | liu-chunhou/OnlineJudge | b79c8e05acf05411d8cf172214aa42e49cc20867 | [
"MIT"
] | null | null | null | leetcode/cpp/1021-Remove-Outermost-Parentheses.cpp | liu-chunhou/OnlineJudge | b79c8e05acf05411d8cf172214aa42e49cc20867 | [
"MIT"
] | null | null | null | leetcode/cpp/1021-Remove-Outermost-Parentheses.cpp | liu-chunhou/OnlineJudge | b79c8e05acf05411d8cf172214aa42e49cc20867 | [
"MIT"
] | null | null | null | #include <string>
using namespace std;
class Solution {
public:
string removeOuterParentheses(string S) {
if(S.size()==0)return S;
string res;
int d = 1;
for(int i=1;i<S.size();++i){
d += S[i]=='('?1:-1;
if(d!=0)res.push_back(S[i]);
else{++i;d=1;}... | 21.117647 | 45 | 0.465181 | liu-chunhou |
e80f3ccaaaabd7835763bab34d2dc46bf7921d29 | 1,549 | cpp | C++ | hackerrank.com/waiter/main.cpp | bepec/challenge | cf2d4fcf11a9a1724b6f620fdda86afbb1ba9ddc | [
"MIT"
] | null | null | null | hackerrank.com/waiter/main.cpp | bepec/challenge | cf2d4fcf11a9a1724b6f620fdda86afbb1ba9ddc | [
"MIT"
] | null | null | null | hackerrank.com/waiter/main.cpp | bepec/challenge | cf2d4fcf11a9a1724b6f620fdda86afbb1ba9ddc | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
#define COUT if(1)cout<<
#define FOR(i,n) for(int i=0;i<n;i++)
template<class T, int S>
struct Stack {
T data[S];
int size;
Stack(): size(0) {}
inline void push(T v) { data[size++] = v; }
inline T pop() { return data[--size]; }
inline T& peek() { return... | 23.469697 | 92 | 0.489348 | bepec |
e80fe2ead6b928e6ee7d498363714caf28ff0fab | 4,860 | cpp | C++ | VC2010Samples/MFC/controls/localize/localppg.cpp | alonmm/VCSamples | 6aff0b4902f5027164d593540fcaa6601a0407c3 | [
"MIT"
] | 300 | 2019-05-09T05:32:33.000Z | 2022-03-31T20:23:24.000Z | VC2010Samples/MFC/controls/localize/localppg.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 9 | 2016-09-19T18:44:26.000Z | 2018-10-26T10:20:05.000Z | VC2010Samples/MFC/controls/localize/localppg.cpp | JaydenChou/VCSamples | 9e1d4475555b76a17a3568369867f1d7b6cc6126 | [
"MIT"
] | 633 | 2019-05-08T07:34:12.000Z | 2022-03-30T04:38:28.000Z | // localppg.cpp : Implementation of the CLocalizePropPage property page class.
//
// This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// This source code is only intended as a supplement to the
// Microsoft Foundation Classes Reference and ... | 25.714286 | 80 | 0.643416 | alonmm |
e8105d8b4f7f903a4ed83a9c6a531b86169b8a1a | 4,479 | cpp | C++ | Chapter08/problem_69/main.cpp | showa-yojyo/The-Modern-Cpp-Challenge | 807b6be8faebe5bdd3ce138ab83648a3864aeab3 | [
"MIT"
] | null | null | null | Chapter08/problem_69/main.cpp | showa-yojyo/The-Modern-Cpp-Challenge | 807b6be8faebe5bdd3ce138ab83648a3864aeab3 | [
"MIT"
] | null | null | null | Chapter08/problem_69/main.cpp | showa-yojyo/The-Modern-Cpp-Challenge | 807b6be8faebe5bdd3ce138ab83648a3864aeab3 | [
"MIT"
] | null | null | null | // #69 社会保障番号の生成
// Template Method パターン
#include <iostream>
#include <string>
#include <sstream>
#include <string_view>
#include <random>
#include <array>
#include <map>
#include <memory>
#include <algorithm>
#include <numeric>
// 新式 enum
enum class sex_type {female, male};
// 抽象基底クラス
class social_number_generator
{... | 25.448864 | 86 | 0.643894 | showa-yojyo |
e8174cdeb7881e7d035ac83f01eda17e384844d0 | 6,194 | cpp | C++ | openstudiocore/src/model/test/ElectricLoadCenterInverterPVWatts_GTest.cpp | hellok-coder/OS-Testing | e9e18ad9e99f709a3f992601ed8d2e0662175af4 | [
"blessing"
] | 1 | 2019-11-12T02:07:03.000Z | 2019-11-12T02:07:03.000Z | openstudiocore/src/model/test/ElectricLoadCenterInverterPVWatts_GTest.cpp | hellok-coder/OS-Testing | e9e18ad9e99f709a3f992601ed8d2e0662175af4 | [
"blessing"
] | 1 | 2019-02-04T23:30:45.000Z | 2019-02-04T23:30:45.000Z | openstudiocore/src/model/test/ElectricLoadCenterInverterPVWatts_GTest.cpp | hellok-coder/OS-Testing | e9e18ad9e99f709a3f992601ed8d2e0662175af4 | [
"blessing"
] | null | null | null | /***********************************************************************************************************************
* OpenStudio(R), Copyright (c) 2008-2019, Alliance for Sustainable Energy, LLC, and other contributors. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without m... | 41.293333 | 125 | 0.754117 | hellok-coder |
e818bed68f142bbf9c6ff41ca95a9fa3aa0a0c9b | 1,724 | hpp | C++ | extlibs/SSVUtilsJson/extlibs/SSVUtils/include/SSVUtils/Tests/TestsPath.hpp | questor/git-ws | 4c6db1dd6586be21baf74d97e3caf1006a239aec | [
"AFL-3.0"
] | null | null | null | extlibs/SSVUtilsJson/extlibs/SSVUtils/include/SSVUtils/Tests/TestsPath.hpp | questor/git-ws | 4c6db1dd6586be21baf74d97e3caf1006a239aec | [
"AFL-3.0"
] | null | null | null | extlibs/SSVUtilsJson/extlibs/SSVUtils/include/SSVUtils/Tests/TestsPath.hpp | questor/git-ws | 4c6db1dd6586be21baf74d97e3caf1006a239aec | [
"AFL-3.0"
] | null | null | null | // Copyright (c) 2013-2014 Vittorio Romeo
// License: Academic Free License ("AFL") v. 3.0
// AFL License page: http://opensource.org/licenses/AFL-3.0
#ifndef SSVU_TESTS_TESTSPATH
#define SSVU_TESTS_TESTSPATH
SSVUT_TEST(PathTests)
{
using namespace std;
using namespace ssvu;
using namespace ssvu::FileSystem;
Pat... | 32.528302 | 64 | 0.664153 | questor |
e81f06d2034782bfd417b7ff5e318d20dcd8f585 | 6,757 | cpp | C++ | plugins/COMCORE/pubsubpluginKAFKA/src/pubsubpluginKAFKA_CKafkaPubSubClientConfig.cpp | alexakuzin/GUCEF-1 | 436035c4266c5d90cd8716c1d0fad519c7059e34 | [
"Apache-2.0"
] | 5 | 2016-04-18T23:12:51.000Z | 2022-03-06T05:12:07.000Z | plugins/COMCORE/pubsubpluginKAFKA/src/pubsubpluginKAFKA_CKafkaPubSubClientConfig.cpp | alexakuzin/GUCEF-1 | 436035c4266c5d90cd8716c1d0fad519c7059e34 | [
"Apache-2.0"
] | 2 | 2015-10-09T19:13:25.000Z | 2018-12-25T17:16:54.000Z | plugins/COMCORE/pubsubpluginKAFKA/src/pubsubpluginKAFKA_CKafkaPubSubClientConfig.cpp | alexakuzin/GUCEF-1 | 436035c4266c5d90cd8716c1d0fad519c7059e34 | [
"Apache-2.0"
] | 15 | 2015-02-23T16:35:28.000Z | 2022-03-25T13:40:33.000Z | /*
* pubsubpluginKAFKA: Generic GUCEF COMCORE plugin for providing pubsub via Kafka
*
* Copyright (C) 1998 - 2020. Dinand Vanvelzen
*
* 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 Li... | 37.538889 | 111 | 0.451236 | alexakuzin |
e820c099ca50748ecee7341ffd48f940be1c5a7c | 11,380 | cpp | C++ | kernel/devices/PciBridge.cpp | dreamos82/northport | 2be1521b66164caeffe82948151b3cfe9c2b3c59 | [
"MIT"
] | 2 | 2022-03-25T20:44:01.000Z | 2022-03-28T20:43:54.000Z | kernel/devices/PciBridge.cpp | dreamos82/northport | 2be1521b66164caeffe82948151b3cfe9c2b3c59 | [
"MIT"
] | null | null | null | kernel/devices/PciBridge.cpp | dreamos82/northport | 2be1521b66164caeffe82948151b3cfe9c2b3c59 | [
"MIT"
] | null | null | null | #include <devices/PciBridge.h>
#include <acpi/AcpiTables.h>
#include <drivers/DriverManager.h>
#include <Platform.h>
#include <Memory.h>
#include <Cpu.h>
#include <Log.h>
namespace Kernel::Devices
{
uint32_t PciAddress::ReadReg(size_t index)
{
if (addr >> 32 != 0xFFFF'FFFF)
return sl::MemRe... | 35.673981 | 275 | 0.544728 | dreamos82 |
e820e2371b3fbb7d98cbd6c3c0ca1a86185c8e13 | 1,760 | cpp | C++ | tests/unit/set2/set_delodd.cpp | simple555a/libcds | d05a0909402369d4a79eb82aed1742a7b227548b | [
"BSD-2-Clause"
] | null | null | null | tests/unit/set2/set_delodd.cpp | simple555a/libcds | d05a0909402369d4a79eb82aed1742a7b227548b | [
"BSD-2-Clause"
] | null | null | null | tests/unit/set2/set_delodd.cpp | simple555a/libcds | d05a0909402369d4a79eb82aed1742a7b227548b | [
"BSD-2-Clause"
] | 1 | 2020-02-01T15:18:59.000Z | 2020-02-01T15:18:59.000Z | //$$CDS-header$$
#include "set2/set_delodd.h"
namespace set2 {
CPPUNIT_TEST_SUITE_REGISTRATION( Set_DelOdd );
void Set_DelOdd::setUpParams( const CppUnitMini::TestCfg& cfg )
{
c_nSetSize = cfg.getSizeT("MapSize", c_nSetSize );
c_nInsThreadCount = cfg.getSizeT("InsThreadCount", c_nInsThrea... | 40.930233 | 106 | 0.6875 | simple555a |
e8216f3220396ea8bda5adbfa5ec8ff08d2f73f2 | 5,108 | cpp | C++ | stdlib/process/daemon.cpp | colding/MercuryFIX | 435b77e546d7764dc8c40bc41900e5bf852fa72d | [
"BSD-3-Clause"
] | 1 | 2017-10-06T16:56:58.000Z | 2017-10-06T16:56:58.000Z | stdlib/process/daemon.cpp | colding/MercuryFIX | 435b77e546d7764dc8c40bc41900e5bf852fa72d | [
"BSD-3-Clause"
] | null | null | null | stdlib/process/daemon.cpp | colding/MercuryFIX | 435b77e546d7764dc8c40bc41900e5bf852fa72d | [
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (C) 2013, Jules Colding <jcolding@gmail.com>.
*
* All Rights Reserved.
*/
/*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* (1) Redistributions of source code must retain the abo... | 29.188571 | 96 | 0.561276 | colding |
e822ec1bbe5b9dcd06d68fb228116735de43118d | 401 | cpp | C++ | cpp/test/array/removeDuplicates_t.cpp | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | 1 | 2019-10-17T08:34:55.000Z | 2019-10-17T08:34:55.000Z | cpp/test/array/removeDuplicates_t.cpp | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | 1 | 2020-05-24T08:32:13.000Z | 2020-05-24T08:32:13.000Z | cpp/test/array/removeDuplicates_t.cpp | dacozai/algorithm-diary | 8ed5e119e4450e92e63276047ef19bbf422c2770 | [
"MIT"
] | null | null | null | #include <vector>
#include <iostream>
#include "test.h"
/** Testcases for Question number 53
* removeDuplicates
*/
void Test_removeDuplicates() {
/* LeetCode Test */
std::vector<int> vec {1,1,2};
assert(removeDuplicates(vec) == 2);
/* Test no element */
vec.clear();
assert(removeDuplicates(vec) == 0);
... | 19.095238 | 37 | 0.640898 | dacozai |
e831a06998f9f899ba9628818662c7b6317fac61 | 1,227 | cxx | C++ | code/demo-client/main.cxx | TankleL/lotus | b74efe190b378a67caeee5f22649e95c20fa63e5 | [
"MIT"
] | null | null | null | code/demo-client/main.cxx | TankleL/lotus | b74efe190b378a67caeee5f22649e95c20fa63e5 | [
"MIT"
] | null | null | null | code/demo-client/main.cxx | TankleL/lotus | b74efe190b378a67caeee5f22649e95c20fa63e5 | [
"MIT"
] | null | null | null | #include <iostream>
#include <lotus.hxx>
constexpr int MAX_REPEATING = 10;
const std::string MSG_HELLO("Hello, lotus!");
int main(int argc, char** argv)
{
using namespace lotus::core;
auto loop = std::unique_ptr<STALoop>(STALoop::create());
auto conn = connection::TCPClientSideConnection(loop.get());
... | 28.534884 | 92 | 0.488998 | TankleL |
e832ef7eb5387f3c304713ec0f032eec1869ffbc | 24,046 | cpp | C++ | Frustum.cpp | havokentity/Reaction-Engine-Renderer | cb0452d81da6a6baf8a681141fcc8e1ba0e04b14 | [
"MIT"
] | 2 | 2020-03-09T18:48:54.000Z | 2020-05-14T03:58:45.000Z | Frustum.cpp | havokentity/Reaction-Engine-Renderer | cb0452d81da6a6baf8a681141fcc8e1ba0e04b14 | [
"MIT"
] | null | null | null | Frustum.cpp | havokentity/Reaction-Engine-Renderer | cb0452d81da6a6baf8a681141fcc8e1ba0e04b14 | [
"MIT"
] | null | null | null | /*
classes contained are:
class Frustum
*/
/*
Refer graphics gems I
*/
#include "Frustum.h"
namespace DifferentialArts
{
void NormalizePlane(float frustum[6][4], int side)
{
/*
float magnitude = (float)sqrtf( frustum[side][A] * frustum[side][A] +
frustum[side][B] * frustum[side][B] +
... | 34.849275 | 173 | 0.628712 | havokentity |
e833a98485c6b8b4cfebb02d579baf94163245e9 | 7,923 | cpp | C++ | src/engine/main.cpp | edrickhong/Cu | d96521f6c8c76d12c2a52c43bfd91dd3771b19a9 | [
"MIT"
] | 4 | 2018-03-18T18:18:03.000Z | 2019-01-17T17:34:11.000Z | src/engine/main.cpp | edrickhong/Cu | d96521f6c8c76d12c2a52c43bfd91dd3771b19a9 | [
"MIT"
] | 33 | 2018-02-17T02:58:50.000Z | 2019-05-24T11:48:06.000Z | src/engine/main.cpp | edrickhong/Cu | d96521f6c8c76d12c2a52c43bfd91dd3771b19a9 | [
"MIT"
] | null | null | null | #include "main.h"
_compile_kill(sizeof(SkelUBO) > _kilobytes(64));
_compile_kill(sizeof(LightUBO) > _kilobytes(64));
_compile_kill(sizeof(PushConst) > 128);
_compile_kill(VK_INDEX_TYPE_UINT16 != 0);
_compile_kill(VK_INDEX_TYPE_UINT32 != 1);
REFDOC(Settings,ParseSettings,{
\documentclass[12pt]{}
\begin{document}
... | 20.525907 | 80 | 0.710463 | edrickhong |
e83bff88594de312bff55b1fa5dda3f7eef186de | 18,301 | hpp | C++ | net/dhcp_client.hpp | hirakuni45/RX | 3fb91bfc8d5282cde7aa00b8bd37f4aad32582d0 | [
"BSD-3-Clause"
] | 56 | 2015-06-04T14:15:38.000Z | 2022-03-01T22:58:49.000Z | net/dhcp_client.hpp | duybang140494/RX | 7fed06a9d8295f4504e8a08fa589d4a52792095f | [
"BSD-3-Clause"
] | 30 | 2019-07-27T11:03:14.000Z | 2021-12-14T09:59:57.000Z | net/dhcp_client.hpp | duybang140494/RX | 7fed06a9d8295f4504e8a08fa589d4a52792095f | [
"BSD-3-Clause"
] | 15 | 2017-06-24T11:33:39.000Z | 2021-12-07T07:26:58.000Z | #pragma once
//=====================================================================//
/*! @file
@brief DHCP クライアント・テンプレート・クラス @n
Copyright 2017 Kunihito Hiramatsu
@author 平松邦仁 (hira@rvf-rc45.net)
*/
//=====================================================================//
#include <cstdint>
#include <cst... | 29.806189 | 97 | 0.558822 | hirakuni45 |
e84356fe2b2df43b8755b6eedcb27317540d96cd | 5,703 | hpp | C++ | include/unifex/win32/detail/ntapi.hpp | Chlorie/libunifex | 9869196338016939265964b82c7244915de6a12f | [
"Apache-2.0"
] | 1 | 2021-11-23T11:30:39.000Z | 2021-11-23T11:30:39.000Z | include/unifex/win32/detail/ntapi.hpp | Chlorie/libunifex | 9869196338016939265964b82c7244915de6a12f | [
"Apache-2.0"
] | null | null | null | include/unifex/win32/detail/ntapi.hpp | Chlorie/libunifex | 9869196338016939265964b82c7244915de6a12f | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* 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 applicab... | 28.658291 | 84 | 0.729967 | Chlorie |
e847e991d56b154caafaa6306e48d935e478a22a | 4,269 | cpp | C++ | src/betting_tree_builder.cpp | bluedevils23/slumbot2019 | a1b65b84c89ab2eff9e2e0c16cedcfcbd479dffd | [
"MIT"
] | 80 | 2019-03-28T02:57:51.000Z | 2022-03-17T05:41:48.000Z | src/betting_tree_builder.cpp | bluedevils23/slumbot2019 | a1b65b84c89ab2eff9e2e0c16cedcfcbd479dffd | [
"MIT"
] | 19 | 2019-06-11T08:01:06.000Z | 2022-01-28T23:13:49.000Z | src/betting_tree_builder.cpp | bluedevils23/slumbot2019 | a1b65b84c89ab2eff9e2e0c16cedcfcbd479dffd | [
"MIT"
] | 28 | 2019-07-18T01:36:35.000Z | 2021-12-26T14:37:10.000Z | #include <stdio.h>
#include <stdlib.h>
#include <memory>
#include <unordered_map>
#include <vector>
#include "betting_abstraction.h"
#include "betting_tree.h"
#include "betting_tree_builder.h"
#include "files.h"
#include "game.h"
#include "io.h"
using std::shared_ptr;
using std::unordered_map;
using std::vector;
vo... | 30.492857 | 89 | 0.685641 | bluedevils23 |
e849c2b8e551dbea32b883fa5daeec2575667cac | 6,839 | cpp | C++ | copasi/UI/CColorScale.cpp | tobiaselsaesser/COPASI | 7e61c1b1667b0f4acf8f3865fe557603f221c472 | [
"Artistic-2.0"
] | null | null | null | copasi/UI/CColorScale.cpp | tobiaselsaesser/COPASI | 7e61c1b1667b0f4acf8f3865fe557603f221c472 | [
"Artistic-2.0"
] | null | null | null | copasi/UI/CColorScale.cpp | tobiaselsaesser/COPASI | 7e61c1b1667b0f4acf8f3865fe557603f221c472 | [
"Artistic-2.0"
] | null | null | null | // Copyright (C) 2017 by Pedro Mendes, Virginia Tech Intellectual
// Properties, Inc., University of Heidelberg, and University of
// of Connecticut School of Medicine.
// All rights reserved.
// Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual
// Properties, Inc., University of Heidelberg, and Th... | 18.634877 | 83 | 0.585027 | tobiaselsaesser |
e84d83c2fcc7fe4fe4ad8e28b308df06fa4f5241 | 2,727 | cc | C++ | flare/fiber/shared_mutex_test.cc | AriCheng/flare | b2c84588fe4ac52f0875791d22284d7e063fd057 | [
"CC-BY-3.0",
"BSD-2-Clause",
"BSD-3-Clause"
] | 868 | 2021-05-28T04:00:22.000Z | 2022-03-31T08:57:14.000Z | flare/fiber/shared_mutex_test.cc | AriCheng/flare | b2c84588fe4ac52f0875791d22284d7e063fd057 | [
"CC-BY-3.0",
"BSD-2-Clause",
"BSD-3-Clause"
] | 33 | 2021-05-28T08:44:47.000Z | 2021-09-26T13:09:21.000Z | flare/fiber/shared_mutex_test.cc | AriCheng/flare | b2c84588fe4ac52f0875791d22284d7e063fd057 | [
"CC-BY-3.0",
"BSD-2-Clause",
"BSD-3-Clause"
] | 122 | 2021-05-28T08:22:23.000Z | 2022-03-29T09:52:09.000Z | // Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this
// file except in compliance with the License. You may obtain a copy of the
// License at
//
// https://opensource.org/licenses/BSD-3-Clause
//
// Unless req... | 27.545455 | 80 | 0.581591 | AriCheng |
e85490a4fbdcf1233af16b13e01db5a0fb3d2937 | 2,077 | hpp | C++ | src/Control/Walker/Options/Normalization.hpp | franjgonzalez/Quinoa | 411eb8815e92618c563881b784e287e2dd916f89 | [
"RSA-MD"
] | null | null | null | src/Control/Walker/Options/Normalization.hpp | franjgonzalez/Quinoa | 411eb8815e92618c563881b784e287e2dd916f89 | [
"RSA-MD"
] | null | null | null | src/Control/Walker/Options/Normalization.hpp | franjgonzalez/Quinoa | 411eb8815e92618c563881b784e287e2dd916f89 | [
"RSA-MD"
] | null | null | null | // *****************************************************************************
/*!
\file src/Control/Walker/Options/Normalization.hpp
\copyright 2012-2015 J. Bakosi,
2016-2018 Los Alamos National Security, LLC.,
2019 Triad National Security, LLC.
All rights reserved. Se... | 33.5 | 80 | 0.577756 | franjgonzalez |
e855040f8ea4a534bc1b30dbbbe2632b9e86655f | 3,192 | cpp | C++ | master/core/third/cxxtools/src/http/mapper.cpp | importlib/klib | a59837857689d0e60d3df6d2ebd12c3160efa794 | [
"MIT"
] | 4 | 2017-12-04T08:22:48.000Z | 2019-10-26T21:44:59.000Z | master/core/third/cxxtools/src/http/mapper.cpp | isuhao/klib | a59837857689d0e60d3df6d2ebd12c3160efa794 | [
"MIT"
] | null | null | null | master/core/third/cxxtools/src/http/mapper.cpp | isuhao/klib | a59837857689d0e60d3df6d2ebd12c3160efa794 | [
"MIT"
] | 4 | 2017-12-04T08:22:49.000Z | 2018-12-27T03:20:31.000Z | /*
* Copyright (C) 2011 Tommi Maekitalo
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* As a sp... | 29.831776 | 111 | 0.668233 | importlib |
e856d80f9013ce2dae64c8a367ee3e9bb37632bc | 1,970 | cpp | C++ | Source/UTF8Decoder.cpp | Vallest/Eclog-CPP | 111da890e50a74f8d941b513e449d1801a8c3e1a | [
"MIT"
] | 6 | 2021-05-25T14:21:08.000Z | 2022-02-23T02:35:04.000Z | Source/UTF8Decoder.cpp | Vallest/Eclog-CPP | 111da890e50a74f8d941b513e449d1801a8c3e1a | [
"MIT"
] | null | null | null | Source/UTF8Decoder.cpp | Vallest/Eclog-CPP | 111da890e50a74f8d941b513e449d1801a8c3e1a | [
"MIT"
] | null | null | null | // Eclog-CPP
// Copyright (c) Vallest Systems LLC. All Rights Reserved.
// Released under the MIT license.
#include <Eclog/Detail/UTF8Decoder.h>
#include <Eclog/Detail/Utility.h>
#include <string.h> // memmove, memset
namespace vallest {
namespace eclog {
namespace detail {
int UTF8Decoder::decode(ErrorCode* ec)
... | 18.584906 | 80 | 0.501523 | Vallest |
e85a1c2397d3a326b194b95ecc2019a4690e093b | 46 | hpp | C++ | src/boost_mpi_collectives_scatterv.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 10 | 2018-03-17T00:58:42.000Z | 2021-07-06T02:48:49.000Z | src/boost_mpi_collectives_scatterv.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 2 | 2021-03-26T15:17:35.000Z | 2021-05-20T23:55:08.000Z | src/boost_mpi_collectives_scatterv.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 4 | 2019-05-28T21:06:37.000Z | 2021-07-06T03:06:52.000Z | #include <boost/mpi/collectives/scatterv.hpp>
| 23 | 45 | 0.804348 | miathedev |
e85e2aa0fe7bf161f7f5b75183a88b434162ec4f | 2,822 | cpp | C++ | Stats.cpp | aepasto/densest-subgraph | 9a9eab4d6c19ecd1b8ca9b9a283905efa4d99f6a | [
"Apache-2.0"
] | 3 | 2016-12-19T12:30:03.000Z | 2017-09-13T14:19:36.000Z | Stats.cpp | aepasto/densest-subgraph | 9a9eab4d6c19ecd1b8ca9b9a283905efa4d99f6a | [
"Apache-2.0"
] | null | null | null | Stats.cpp | aepasto/densest-subgraph | 9a9eab4d6c19ecd1b8ca9b9a283905efa4d99f6a | [
"Apache-2.0"
] | 1 | 2021-01-25T12:23:55.000Z | 2021-01-25T12:23:55.000Z | /*
* Stats.cpp
*
* Created on: Nov 2, 2014
* Author: aepasto
*/
/*
* GraphScheduler.cpp
*
* Created on: Oct 22, 2014
* Author: aepasto
*/
#include "Stats.h"
#include <cstring>
#include <ctime>
#include <cassert>
#include <chrono>
#include <iostream>
using namespace std;
Stats::~Stats() {
}
v... | 23.714286 | 75 | 0.669029 | aepasto |
e860fc9e10b6490394675bf8973441b15bde3d9e | 243 | cpp | C++ | 06-Functions/09-Global_Local.cpp | PronomitaDey/Cpp_Tutorial | a64a10a27d018bf9edf5280505201a1fbfd359ed | [
"MIT"
] | null | null | null | 06-Functions/09-Global_Local.cpp | PronomitaDey/Cpp_Tutorial | a64a10a27d018bf9edf5280505201a1fbfd359ed | [
"MIT"
] | 1 | 2021-10-01T13:35:44.000Z | 2021-10-02T03:54:29.000Z | 06-Functions/09-Global_Local.cpp | PronomitaDey/Cpp_Tutorial | a64a10a27d018bf9edf5280505201a1fbfd359ed | [
"MIT"
] | 3 | 2021-10-01T14:07:09.000Z | 2021-10-01T18:24:31.000Z | #include <iostream>
using namespace std;
// Global variable accessible everywhere
int g;
void fun()
{
int a = 5;
g = 15;
g += a;
cout << g << endl;
}
int main()
{
fun();
g += 1;
cout << g << endl;
return 0;
} | 11.571429 | 40 | 0.510288 | PronomitaDey |
e86ac825226be80e209506e2ab6a8f3567547e09 | 5,339 | cpp | C++ | GladiatorGame/Source/GladiatorGame/DwarfPlayerCharacter.cpp | litelawliet/UnrealGames | f11d769f09fa31ded2e14a9dd0a7cb9ade6ec89f | [
"MIT"
] | null | null | null | GladiatorGame/Source/GladiatorGame/DwarfPlayerCharacter.cpp | litelawliet/UnrealGames | f11d769f09fa31ded2e14a9dd0a7cb9ade6ec89f | [
"MIT"
] | null | null | null | GladiatorGame/Source/GladiatorGame/DwarfPlayerCharacter.cpp | litelawliet/UnrealGames | f11d769f09fa31ded2e14a9dd0a7cb9ade6ec89f | [
"MIT"
] | 1 | 2021-11-28T11:15:03.000Z | 2021-11-28T11:15:03.000Z | // Fill out your copyright notice in the Description page of Project Settings.
#include "DwarfPlayerCharacter.h"
#include "GameFramework/Controller.h"
#include "GameFramework/CharacterMovementComponent.h"
#include "Components/InputComponent.h"
#include "Engine/World.h"
#include "TimerManager.h"
ADwarfPlayerCharacter... | 27.663212 | 134 | 0.771867 | litelawliet |
e86d86984be2a970846d00213eac589b80ea185a | 138 | hpp | C++ | include/Vector2Int.hpp | DGrant230/Fundamentals-of-Graphics | 4cfcad2e3dbe6eab90efd113ff2ce5e077052c37 | [
"MIT"
] | null | null | null | include/Vector2Int.hpp | DGrant230/Fundamentals-of-Graphics | 4cfcad2e3dbe6eab90efd113ff2ce5e077052c37 | [
"MIT"
] | null | null | null | include/Vector2Int.hpp | DGrant230/Fundamentals-of-Graphics | 4cfcad2e3dbe6eab90efd113ff2ce5e077052c37 | [
"MIT"
] | null | null | null | #pragma once
namespace fog {
class Vector2Int {
public:
int x;
int y;
public:
Vector2Int();
Vector2Int( int x, int y );
};
} | 10.615385 | 29 | 0.615942 | DGrant230 |
e872f9c9423407c4167d64bbaa24c7b2bb35d7db | 3,533 | cc | C++ | PWGLF/NUCLEX/Nuclei/NucleiPbPb/macros_pp13TeV/JoinSystematics.cc | eciesla/AliPhysics | a9a6dc33c8793ea999348c57cebbce445797e8e4 | [
"BSD-3-Clause"
] | 1 | 2021-06-11T20:36:16.000Z | 2021-06-11T20:36:16.000Z | PWGLF/NUCLEX/Nuclei/NucleiPbPb/macros_pp13TeV/JoinSystematics.cc | eciesla/AliPhysics | a9a6dc33c8793ea999348c57cebbce445797e8e4 | [
"BSD-3-Clause"
] | 1 | 2017-03-14T15:11:43.000Z | 2017-03-14T15:53:09.000Z | PWGLF/NUCLEX/Nuclei/NucleiPbPb/macros_pp13TeV/JoinSystematics.cc | eciesla/AliPhysics | a9a6dc33c8793ea999348c57cebbce445797e8e4 | [
"BSD-3-Clause"
] | 1 | 2018-09-22T01:09:25.000Z | 2018-09-22T01:09:25.000Z | #include "src/Common.h"
#include "src/Utils.h"
using namespace utils;
#include "src/Plotting.h"
#include "TFile.h"
#include "TCanvas.h"
#include "TH1F.h"
#include "TStyle.h"
#include "TDirectory.h"
#include "TLegend.h"
void JoinSystematics(){
TFile TOF_systematics_file(kSystematicsOutput.data());
TFile TPC_system... | 45.294872 | 237 | 0.641947 | eciesla |
e876d6df6cd7cb0644fe4fc4a7eb1ed7ab60b90c | 816 | cpp | C++ | Utility/lib/src/utility/custom_operators.cpp | tdenis8/S3DR | fb8f4c0c98b5571abb12a51e03229978115b099b | [
"MIT"
] | 1 | 2019-07-10T04:25:45.000Z | 2019-07-10T04:25:45.000Z | Utility/lib/src/utility/custom_operators.cpp | tdenis8/S3DR | fb8f4c0c98b5571abb12a51e03229978115b099b | [
"MIT"
] | null | null | null | Utility/lib/src/utility/custom_operators.cpp | tdenis8/S3DR | fb8f4c0c98b5571abb12a51e03229978115b099b | [
"MIT"
] | null | null | null | #include "custom_operators.hpp"
#include <iomanip>
#define WIDTH 13
std::ostream &operator <<(std::ostream &output, const glm::vec3 & vector)
{
output<<std::setiosflags(std::ios::left);
for(int i=0; i<3; i++){
output<<std::setw(WIDTH)<<vector[i];
}
return output;
}
std::ostream &operator <<(... | 22.054054 | 73 | 0.573529 | tdenis8 |
e878a12c81c58a6df1519063896f6e40507aa0cb | 1,787 | cpp | C++ | matrix/matrix_testing.cpp | boris-szl/matrix-repo | c67414744e251c667cd6f9783336c595900d6521 | [
"MIT"
] | null | null | null | matrix/matrix_testing.cpp | boris-szl/matrix-repo | c67414744e251c667cd6f9783336c595900d6521 | [
"MIT"
] | null | null | null | matrix/matrix_testing.cpp | boris-szl/matrix-repo | c67414744e251c667cd6f9783336c595900d6521 | [
"MIT"
] | null | null | null |
#include <cassert>
#include <iostream>
#include "matrix.hpp"
using std::cin;
using std::cout;
using std::endl;
void aufgabe_11_1() {
cout << "Matrix A:" << endl;
Matrix A(4);
Matrix B = A; // Copy constructor
B.set(1, 2, 3.0);
assert(B.get(1, 2) == 3.0);
assert(A.get(1, 2) == 0.0);
Matr... | 17.349515 | 73 | 0.495243 | boris-szl |
e878a47451c97602ef853d34a9e362fb744f3353 | 62,339 | cpp | C++ | Source/Engine/World/Private/Terrain.cpp | CodeLikeCXK/AngieEngine | 26f3cfdb1fdef6378ee75b000b8fe966bebb3a6e | [
"MIT"
] | 24 | 2019-07-15T22:48:44.000Z | 2021-11-02T04:42:48.000Z | Source/Engine/World/Private/Terrain.cpp | CodeLikeCXK/AngieEngine | 26f3cfdb1fdef6378ee75b000b8fe966bebb3a6e | [
"MIT"
] | 1 | 2021-11-02T09:41:31.000Z | 2021-11-05T18:35:14.000Z | Source/Engine/World/Private/Terrain.cpp | CodeLikeCXK/AngieEngine | 26f3cfdb1fdef6378ee75b000b8fe966bebb3a6e | [
"MIT"
] | 3 | 2020-02-03T08:34:50.000Z | 2021-07-28T05:19:22.000Z | /*
Angie Engine Source Code
MIT License
Copyright (C) 2017-2021 Alexander Samusev.
This file is part of the Angie Engine Source Code.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without re... | 33.123804 | 188 | 0.587337 | CodeLikeCXK |
e879066eac117033fb686dac98eb699a6bb570a6 | 7,724 | hpp | C++ | redblackpy/core/tree/tree.hpp | IntuitionEngineeringTeam/RedBlackPy | 99630408153bea7494415c402eb2d9881f3168ee | [
"Apache-2.0"
] | 12 | 2018-08-24T20:46:38.000Z | 2022-01-20T16:25:23.000Z | redblackpy/core/tree/tree.hpp | IntuitionEngineeringTeam/RedBlackPy | 99630408153bea7494415c402eb2d9881f3168ee | [
"Apache-2.0"
] | 1 | 2019-04-02T04:19:58.000Z | 2019-04-02T04:19:58.000Z | redblackpy/core/tree/tree.hpp | IntuitionEngineeringTeam/RedBlackPy | 99630408153bea7494415c402eb2d9881f3168ee | [
"Apache-2.0"
] | 3 | 2018-07-05T22:47:27.000Z | 2019-05-25T06:40:40.000Z | //
// Created by Soldoskikh Kirill.
// Copyright © 2018 Intuition. All rights reserved.
//
#ifndef __TC // header guards
#define __TC
#include <memory>
#include <list>
#include <iterator>
#include <utility>
#include "../exceptions/qs_exceptions.hpp"
/*
This file contains definition of red-back tree template class... | 34.636771 | 94 | 0.536251 | IntuitionEngineeringTeam |
e880e956b7e217a1cc47d8f086105e92eead210c | 13,617 | cpp | C++ | wallet/test/transaction_tests.cpp | tahussle/bebbang | 93be7665680d454f2f5a8c1124b1f1fa83f95960 | [
"MIT"
] | null | null | null | wallet/test/transaction_tests.cpp | tahussle/bebbang | 93be7665680d454f2f5a8c1124b1f1fa83f95960 | [
"MIT"
] | null | null | null | wallet/test/transaction_tests.cpp | tahussle/bebbang | 93be7665680d454f2f5a8c1124b1f1fa83f95960 | [
"MIT"
] | null | null | null | #include "googletest/googletest/include/gtest/gtest.h"
#include "json/json_spirit_writer_template.h"
#include <map>
#include <string>
#include "NetworkForks.h"
#include "main.h"
#include "wallet.h"
using namespace std;
using namespace json_spirit;
// In script_tests.cpp
extern Array read_json(const std::string& fi... | 38.905714 | 105 | 0.604685 | tahussle |
e8825a349d2fe83c1ba01d3488f90bf7f12b6091 | 1,343 | cpp | C++ | src/3words.cpp | baseoursteps/faang | 8508b3bd66a607fa4ff5a71efd9e2a25a2a263d5 | [
"MIT"
] | 1 | 2021-07-13T19:47:57.000Z | 2021-07-13T19:47:57.000Z | src/3words.cpp | baseoursteps/faang | 8508b3bd66a607fa4ff5a71efd9e2a25a2a263d5 | [
"MIT"
] | 1 | 2021-05-07T15:02:27.000Z | 2021-05-09T08:44:05.000Z | src/3words.cpp | baseoursteps/faang | 8508b3bd66a607fa4ff5a71efd9e2a25a2a263d5 | [
"MIT"
] | 1 | 2021-05-07T13:18:01.000Z | 2021-05-07T13:18:01.000Z | #include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
int
main()
{
using namespace std;
string par, word;
{
ifstream in("./paragraph");
if (!in.is_open()) {
std::cerr << "paragraph file ... | 18.915493 | 75 | 0.443783 | baseoursteps |
e8845592b20dc776ace4c3571af4f1885df97d73 | 9,228 | cpp | C++ | plugin/maya/write/export.cpp | hamedsabri/M3MF | de81cbe8e3d10f29c71936e08721629ca068d0ce | [
"BSD-2-Clause"
] | null | null | null | plugin/maya/write/export.cpp | hamedsabri/M3MF | de81cbe8e3d10f29c71936e08721629ca068d0ce | [
"BSD-2-Clause"
] | null | null | null | plugin/maya/write/export.cpp | hamedsabri/M3MF | de81cbe8e3d10f29c71936e08721629ca068d0ce | [
"BSD-2-Clause"
] | null | null | null | // Copyright (C) 2021 Hamed Sabri
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this
// list of conditions ... | 34.177778 | 185 | 0.628088 | hamedsabri |
e885db4876ea718f35aa47dba4868eff0122a671 | 318 | cpp | C++ | src/gamestate.cpp | davidpox/SpaceInvaders-OpenGL | afa4ab662341db419110b2828c6817479f901f9f | [
"MIT"
] | null | null | null | src/gamestate.cpp | davidpox/SpaceInvaders-OpenGL | afa4ab662341db419110b2828c6817479f901f9f | [
"MIT"
] | null | null | null | src/gamestate.cpp | davidpox/SpaceInvaders-OpenGL | afa4ab662341db419110b2828c6817479f901f9f | [
"MIT"
] | null | null | null | #include "gamestate.h"
gamestate::gamestate()
{
alienMoveTimer = 0;
alienMoveCounter = 0;
isGameRunning = false;
isMovingLeft = false;
playerscore = 0;
playerlives = 3;
gameover = false;
alienShootTimer = 0;
barricadeTimer = 0;
alienMoveSpeed = 1.0f;
alienAnimTimer = 0;
}
gamestate::~gamestate()
{
}
| 12.72 | 23 | 0.691824 | davidpox |
e88bf43a4ee6e4874c749151b53a844eef1eb595 | 665 | cpp | C++ | color4f.cpp | Playermet/gbmath | 026db04d1f86982957e9c819175145f9cdd5370a | [
"MIT"
] | 1 | 2020-09-15T03:57:14.000Z | 2020-09-15T03:57:14.000Z | color4f.cpp | Playermet/gbmath | 026db04d1f86982957e9c819175145f9cdd5370a | [
"MIT"
] | null | null | null | color4f.cpp | Playermet/gbmath | 026db04d1f86982957e9c819175145f9cdd5370a | [
"MIT"
] | 1 | 2020-03-31T07:33:05.000Z | 2020-03-31T07:33:05.000Z |
#include "_gbmath.h"
#ifdef _MSC_VER
#pragma warning(push)
#pragma warning(disable : 4244)
#endif
namespace gbmath
{
void color4f::operator = (const color4_32 val)
{
a = (float) (val >> 24) / 255.0f;
r = (float)( (val << 8 ) >> 24 ) / 255.0f;
g = (float)( (val << 16) ... | 14.456522 | 48 | 0.523308 | Playermet |
e89249d1eccc1f7a9a8cb0f53208e3c12ea96402 | 1,294 | cpp | C++ | lower_bound.cpp | eryalee/offer | 935878a2c0996aadd9373abe0b2b269872a79fb9 | [
"Apache-2.0"
] | null | null | null | lower_bound.cpp | eryalee/offer | 935878a2c0996aadd9373abe0b2b269872a79fb9 | [
"Apache-2.0"
] | null | null | null | lower_bound.cpp | eryalee/offer | 935878a2c0996aadd9373abe0b2b269872a79fb9 | [
"Apache-2.0"
] | null | null | null |
#include <stdio.h>
int lower_bound(int A[], int length, int target) {
if (NULL == A || length <= 0) {
printf("are u return?\n");
return -1;
}
int left = 0;
int right = length - 1;
while (left < right) {
int mid = left + (right - left)/2;
if (A[mid] < target) {
... | 30.809524 | 69 | 0.512365 | eryalee |
e895a6128029bd3c1f2326fe4c362b2b12e3c705 | 9,466 | cpp | C++ | SPHINXsys/src/for_3D_build/particle_generator/particle_generator_network.cpp | Irvise/SPHinXsys | dfa67ec02bbc85824e2d6adf6d0395bb887e2bdb | [
"Apache-2.0"
] | 3 | 2020-11-30T15:24:54.000Z | 2021-04-11T09:16:09.000Z | SPHINXsys/src/for_3D_build/particle_generator/particle_generator_network.cpp | Bo-Zhang1995/SPHinXsys | ee03f41711cc8ee7dcf75cdff6afa0859b0a0e89 | [
"Apache-2.0"
] | null | null | null | SPHINXsys/src/for_3D_build/particle_generator/particle_generator_network.cpp | Bo-Zhang1995/SPHinXsys | ee03f41711cc8ee7dcf75cdff6afa0859b0a0e89 | [
"Apache-2.0"
] | null | null | null | /**
* @file particle_generator_network.cpp
* @author Chi ZHang and Xiangyu Hu
*/
#include "particle_generator_network.h"
#include "mesh_cell_linked_list.h"
#include "level_set.h"
#include "base_body.h"
#include "base_particles.h"
#include "in_output.h"
//============================================================... | 41.517544 | 126 | 0.635643 | Irvise |
e8960ddea13c54004b8b6fe8790b2035dd247201 | 602 | hpp | C++ | GrpcMultiAccept.hpp | skudryas/grpc_restr | 8e57181b0a219421b37164c53f9297a331de4fbc | [
"Apache-2.0"
] | null | null | null | GrpcMultiAccept.hpp | skudryas/grpc_restr | 8e57181b0a219421b37164c53f9297a331de4fbc | [
"Apache-2.0"
] | null | null | null | GrpcMultiAccept.hpp | skudryas/grpc_restr | 8e57181b0a219421b37164c53f9297a331de4fbc | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "GrpcServ.hpp"
class GrpcMultiAccept: public GrpcServ::GrpcAccept {
public:
GrpcMultiAccept(int thread_count);
virtual void onAccept(TcpAccept *acc, int fd,
struct sockaddr *localAddr, struct sockaddr *remoteAddr) override;
virtual void onError(TcpAccept *acc, TcpAcceptDlgt... | 26.173913 | 88 | 0.674419 | skudryas |
e8980618119ac8f0d486f0bc6b1616c883b18fa7 | 3,282 | cpp | C++ | Source/Console/ConsoleHistory.cpp | gunstarpl/Game-Engine-12-2013 | bfc53f5c998311c17e97c1b4d65792d615c51d36 | [
"MIT",
"Unlicense"
] | 6 | 2017-12-31T17:28:40.000Z | 2021-12-04T06:11:34.000Z | Source/Console/ConsoleHistory.cpp | gunstarpl/Game-Engine-12-2013 | bfc53f5c998311c17e97c1b4d65792d615c51d36 | [
"MIT",
"Unlicense"
] | null | null | null | Source/Console/ConsoleHistory.cpp | gunstarpl/Game-Engine-12-2013 | bfc53f5c998311c17e97c1b4d65792d615c51d36 | [
"MIT",
"Unlicense"
] | null | null | null | #include "Precompiled.hpp"
#include "ConsoleHistory.hpp"
namespace
{
// Log error messages.
#define LogInitializeError() "Failed to initialize a console history! "
}
ConsoleHistory::ConsoleHistory() :
m_outputCapacity(0),
m_inputCapacity(0),
m_initialized(false)
{
}
ConsoleHistory::~ConsoleHistor... | 20.259259 | 93 | 0.623705 | gunstarpl |
e899960cb989239469c1fef841261dc35d472c94 | 387 | cpp | C++ | 2020 Leetcode Challenges/12 December Leetcode Challenge 2020/10 validMountainArray.cpp | FazeelUsmani/Leetcode | aff4c119178f132c28a39506ffaa75606e0a861b | [
"MIT"
] | 7 | 2020-12-01T14:27:57.000Z | 2022-02-12T09:17:22.000Z | 2020 Leetcode Challenges/12 December Leetcode Challenge 2020/10 validMountainArray.cpp | FazeelUsmani/Leetcode | aff4c119178f132c28a39506ffaa75606e0a861b | [
"MIT"
] | 4 | 2020-11-12T17:49:22.000Z | 2021-09-06T07:46:37.000Z | 2020 Leetcode Challenges/12 December Leetcode Challenge 2020/10 validMountainArray.cpp | FazeelUsmani/Leetcode | aff4c119178f132c28a39506ffaa75606e0a861b | [
"MIT"
] | 6 | 2021-05-21T03:49:22.000Z | 2022-01-20T20:36:53.000Z | class Solution {
public:
bool validMountainArray(vector<int>& A) {
int N = A.size();
int i = 0;
while ( (i+1 < N) && (A[i] < A[i+1]) )
i++;
if ((i == 0) || (i == N-1))
return false;
while ( (i+1 < N) && (A[i] > A[i+... | 19.35 | 47 | 0.310078 | FazeelUsmani |
e8a1768a1695b0d0a3be6eb28bdbe7ec40d26853 | 2,210 | cpp | C++ | Source/DedicatedServerTest/Private/MyGameSession.cpp | dorgonman/DedicatedServerTest | 8bfe6e8357929fbd68be52e11ba27f78492931c8 | [
"BSL-1.0"
] | 1 | 2019-03-31T22:54:37.000Z | 2019-03-31T22:54:37.000Z | Source/DedicatedServerTest/Private/MyGameSession.cpp | dorgonman/DedicatedServerTest | 8bfe6e8357929fbd68be52e11ba27f78492931c8 | [
"BSL-1.0"
] | null | null | null | Source/DedicatedServerTest/Private/MyGameSession.cpp | dorgonman/DedicatedServerTest | 8bfe6e8357929fbd68be52e11ba27f78492931c8 | [
"BSL-1.0"
] | 1 | 2021-10-21T04:37:37.000Z | 2021-10-21T04:37:37.000Z | // Fill out your copyright notice in the Description page of Project Settings.
#include "MyGameSession.h"
#include "DedicatedServerTest.h"
//https://forums.unrealengine.com/showthread.php?97479-Dedicated-server-with-Steam-is-a-joke
//open steam.ServerSteamID(long number):PORT
//https://wiki.unrealengine.com/How_To_U... | 31.571429 | 107 | 0.770588 | dorgonman |
e8a2ab42883773ce3faec5d2c9b8067b9eeb48f6 | 2,274 | cpp | C++ | src/libs/gapi/SwapChain.cpp | JKot-Coder/OpenDemo | 8b9554914f5bab08df47e032486ca668a560c97c | [
"BSD-3-Clause"
] | null | null | null | src/libs/gapi/SwapChain.cpp | JKot-Coder/OpenDemo | 8b9554914f5bab08df47e032486ca668a560c97c | [
"BSD-3-Clause"
] | null | null | null | src/libs/gapi/SwapChain.cpp | JKot-Coder/OpenDemo | 8b9554914f5bab08df47e032486ca668a560c97c | [
"BSD-3-Clause"
] | null | null | null | #include "SwapChain.hpp"
#include "gapi/GpuResource.hpp"
#include "gapi/Texture.hpp"
#include "render/DeviceContext.hpp"
namespace RR
{
namespace GAPI
{
SwapChain::SwapChain(const SwapChainDescription& description, const U8String& name)
: Resource(Object::Type::SwapChain, name),
... | 37.9 | 236 | 0.638522 | JKot-Coder |
e8a792928e98981cc99a7ef506f4de337351dec8 | 5,877 | cpp | C++ | src/preferences/appearance/FakeScrollBar.cpp | axeld/haiku | e3becd53eef5c093ee8c8f32bab51d40b0f2b8d4 | [
"MIT"
] | 4 | 2017-06-17T22:03:56.000Z | 2019-01-25T10:51:55.000Z | src/preferences/appearance/FakeScrollBar.cpp | axeld/haiku | e3becd53eef5c093ee8c8f32bab51d40b0f2b8d4 | [
"MIT"
] | null | null | null | src/preferences/appearance/FakeScrollBar.cpp | axeld/haiku | e3becd53eef5c093ee8c8f32bab51d40b0f2b8d4 | [
"MIT"
] | 3 | 2018-12-17T13:07:38.000Z | 2021-09-08T13:07:31.000Z | /*
* Copyright 2010-2012 Haiku, Inc. All rights reserved.
* Distributed under the terms of the MIT license.
*
* Authors:
* DarkWyrm <bpmagic@columbus.rr.com>
* John Scipione <jscipione@gmail.com>
*/
#include "FakeScrollBar.h"
#include <Box.h>
#include <ControlLook.h>
#include <Message.h>
#include <ScrollB... | 20.840426 | 73 | 0.704952 | axeld |
e8a91fb8c417376de5f4e1e9621fab465e8031f3 | 350 | cpp | C++ | src/parser/parser_put_back.cpp | nanolith/homesim | 693cd77c9ecd0fb8bbaf1848609a63eb56fa4b86 | [
"MIT"
] | null | null | null | src/parser/parser_put_back.cpp | nanolith/homesim | 693cd77c9ecd0fb8bbaf1848609a63eb56fa4b86 | [
"MIT"
] | null | null | null | src/parser/parser_put_back.cpp | nanolith/homesim | 693cd77c9ecd0fb8bbaf1848609a63eb56fa4b86 | [
"MIT"
] | null | null | null | /**
* \file parser/parser_put_back.cpp
*
* \brief Put back a token pair into the lookahead.
*
* \copyright Copyright 2020 Justin Handville. All rights reserved.
*/
#include <homesim/parser.h>
#include <sstream>
using namespace homesim;
using namespace std;
void
homesim::parser::put_back(const token_pair& t)
{
... | 18.421053 | 67 | 0.725714 | nanolith |
e8ae846c1cfb01e1c53839a43754fb59a8ec5401 | 2,569 | cpp | C++ | src/library/tactic/revert_tactic.cpp | javra/lean | cc70845332e63a1f1be21dc1f96d17269fc85909 | [
"Apache-2.0"
] | 130 | 2016-12-02T22:46:10.000Z | 2022-03-22T01:09:48.000Z | src/library/tactic/revert_tactic.cpp | soonhokong/lean | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | [
"Apache-2.0"
] | 8 | 2017-05-03T01:21:08.000Z | 2020-02-25T11:38:05.000Z | src/library/tactic/revert_tactic.cpp | soonhokong/lean | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | [
"Apache-2.0"
] | 28 | 2016-12-02T22:46:20.000Z | 2022-03-18T21:28:20.000Z | /*
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
*/
#include "util/fresh_name.h"
#include "kernel/abstract.h"
#include "library/constants.h"
#include "library/locals.h"
#include "library/tactic/tactic.h"
#inc... | 40.140625 | 132 | 0.589334 | javra |
e8ba62264fb83d8bb13437afd0c45cc6b64a6c1c | 945 | cpp | C++ | Nyx/mesh.cpp | rickmarson/phoenix | ecd551c18748db2ad4ab6f4725ea8d955e49063c | [
"MIT"
] | null | null | null | Nyx/mesh.cpp | rickmarson/phoenix | ecd551c18748db2ad4ab6f4725ea8d955e49063c | [
"MIT"
] | null | null | null | Nyx/mesh.cpp | rickmarson/phoenix | ecd551c18748db2ad4ab6f4725ea8d955e49063c | [
"MIT"
] | null | null | null | /*
Mesh
*/
#include "mesh.h"
namespace NYX {
Mesh::Mesh(Model* parent) :
mParent(parent),
mPolyCount(0),
mPolygonType(IRenderer::E_TRIANGLE)
{
}
Mesh::~Mesh()
{
mParent = NULL;
}
void Mesh::Initialize(uint startIndex, uint count, Material* mat, IRenderer:... | 16.293103 | 125 | 0.630688 | rickmarson |
e8c1a8e95206d815f1c7e2ca72f5ca3c7c37c343 | 4,215 | hpp | C++ | thirdparty/include/ubench/ubench.hpp | ortfero/pulse | 08cd78c20f16101b553e4e15f1a04011bb32722c | [
"MIT"
] | null | null | null | thirdparty/include/ubench/ubench.hpp | ortfero/pulse | 08cd78c20f16101b553e4e15f1a04011bb32722c | [
"MIT"
] | null | null | null | thirdparty/include/ubench/ubench.hpp | ortfero/pulse | 08cd78c20f16101b553e4e15f1a04011bb32722c | [
"MIT"
] | null | null | null | /* This file is part of ubench library
* Copyright 2020 Andrei Ilin <ortfero@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitati... | 27.37013 | 99 | 0.679004 | ortfero |
e8c2fba5cfbb440cd3879a5633e31ab49bf734a3 | 1,590 | cpp | C++ | online judge solution of segment tree/lightOJ_1080.cpp | shiningflash/Advance-Data-Structure | 87f1813c5bcfb2ad77b8f1f2d8f0259d3f87371a | [
"MIT"
] | 3 | 2020-11-09T18:36:48.000Z | 2020-12-31T03:51:08.000Z | online judge solution of segment tree/lightOJ_1080.cpp | shiningflash/data-structure | 87f1813c5bcfb2ad77b8f1f2d8f0259d3f87371a | [
"MIT"
] | null | null | null | online judge solution of segment tree/lightOJ_1080.cpp | shiningflash/data-structure | 87f1813c5bcfb2ad77b8f1f2d8f0259d3f87371a | [
"MIT"
] | 3 | 2020-10-11T19:13:56.000Z | 2021-06-20T19:01:04.000Z | /*
Binary Simulation LightOJ - 1080
Amirul Islam, Feb 18, 2019
*/
#include <bits/stdc++.h>
using namespace std;
const int le = 1e6;
int tree[3*le];
void update(int node, int b, int e, int i, int j) {
if (i > e || j < b) return;
if (i <= b && j >= e) {
tree[node]++;
return;
}
... | 25.238095 | 65 | 0.428302 | shiningflash |
e8c6df36bd4766836658b09a1393a0c3410e2681 | 3,286 | hh | C++ | src/UpperBoundProg.hh | MikolasJanota/minibones | 5413f7a10e410fd88cbac53fb79c8df40cbde650 | [
"MIT"
] | 2 | 2019-06-03T08:19:50.000Z | 2019-09-20T03:10:23.000Z | src/UpperBoundProg.hh | MikolasJanota/minibones | 5413f7a10e410fd88cbac53fb79c8df40cbde650 | [
"MIT"
] | null | null | null | src/UpperBoundProg.hh | MikolasJanota/minibones | 5413f7a10e410fd88cbac53fb79c8df40cbde650 | [
"MIT"
] | null | null | null | /*
* File: UpperBoundProg.hh
* Author: mikolas
* Created on: Thu Feb 23 14:04:54 WET 2012
* Copyright (C) 2012, Mikolas Janota
*/
#ifndef UPPERBOUNDPROG_HH_24653
#define UPPERBOUNDPROG_HH_24653
#include <vector>
#include <functional>
#include "minisat/core/Solver.h"
#include "auxiliary.hh"
#include "Lifter.hh"
... | 39.590361 | 129 | 0.65003 | MikolasJanota |
e8cf3e6a76de5f12d18712e9cfc5943104af298d | 976 | hpp | C++ | include/array_view2d_output.hpp | martinmoene/array_view2d | 9ee4cf0eecc4d0e98a6ac3da68d6e4e9e03c71aa | [
"BSL-1.0"
] | 6 | 2016-11-22T12:43:04.000Z | 2022-01-17T03:42:04.000Z | include/array_view2d_output.hpp | martinmoene/array_view2d | 9ee4cf0eecc4d0e98a6ac3da68d6e4e9e03c71aa | [
"BSL-1.0"
] | null | null | null | include/array_view2d_output.hpp | martinmoene/array_view2d | 9ee4cf0eecc4d0e98a6ac3da68d6e4e9e03c71aa | [
"BSL-1.0"
] | 1 | 2022-01-17T03:42:09.000Z | 2022-01-17T03:42:09.000Z | // Copyright 2015 by Martin Moene
//
// 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)
//
// array_view2d is inspired on https://github.com/rhysd/array_view by Linda_pp.
#ifndef NONSTD_ARRAY_VIEW2D_OUTPUT_HPP_INCLUDE... | 24.4 | 79 | 0.620902 | martinmoene |
e8cf766b685374d4cdde735d2653bf6f38202045 | 694 | cpp | C++ | PrEngineSwitch/Game_Engine/src/Sprite.cpp | aprithul/Prengine | 7aff20bb73ab21e9e11dda1985e6b22992479f0d | [
"BSD-3-Clause"
] | 1 | 2019-10-08T05:20:30.000Z | 2019-10-08T05:20:30.000Z | PrEngineSwitch/Game_Engine/src/Sprite.cpp | aprithul/PrEngine | 7aff20bb73ab21e9e11dda1985e6b22992479f0d | [
"BSD-3-Clause"
] | null | null | null | PrEngineSwitch/Game_Engine/src/Sprite.cpp | aprithul/PrEngine | 7aff20bb73ab21e9e11dda1985e6b22992479f0d | [
"BSD-3-Clause"
] | null | null | null | #include "Sprite.hpp"
#include "EntityManagementSystemModule.hpp"
#include "RendererOpenGL2D.hpp"
namespace PrEngine
{
Sprite::Sprite():Component(COMP_SPRITE)
{
order = 0;
}
Sprite::Sprite(Int_32 order):Component(COMP_SPRITE)
{
this->order = order;
}
void Sprite::start()
{
}
Sprite::~Sprite()... | 16.52381 | 76 | 0.662824 | aprithul |
e8d1fadc6d038e92b86cc62168b1afd9475362c1 | 10,784 | cpp | C++ | Questless/Questless/src/ui/world_widget.cpp | jonathansharman/questless | bb9ffb2d21cbfde2a71edfecfcbf466479bbbe7d | [
"MIT"
] | 2 | 2020-07-14T12:50:06.000Z | 2020-11-04T02:25:09.000Z | Questless/Questless/src/ui/world_widget.cpp | jonathansharman/questless | bb9ffb2d21cbfde2a71edfecfcbf466479bbbe7d | [
"MIT"
] | null | null | null | Questless/Questless/src/ui/world_widget.cpp | jonathansharman/questless | bb9ffb2d21cbfde2a71edfecfcbf466479bbbe7d | [
"MIT"
] | null | null | null | //! @file
//! @copyright See <a href="LICENSE.txt">LICENSE.txt</a>.
#include "world_widget.hpp"
#include "animation/particles/arrow_particle.hpp"
#include "animation/particles/blood_particle.hpp"
#include "animation/particles/green_magic_particle.hpp"
#include "animation/particles/text_particle.hpp"
#include "animati... | 35.473684 | 115 | 0.691116 | jonathansharman |
e8d540d5f7a4c3d7dcfe043921266db53b8582fc | 11,580 | cpp | C++ | src-2007/haptics/svr_in_haptics.cpp | KyleGospo/City-17-Episode-One-Source | 2bc0bb56a2e0a63d963755e2831c15f2970c38e7 | [
"Unlicense"
] | 30 | 2016-04-23T04:55:52.000Z | 2021-05-19T10:26:27.000Z | src-2007/haptics/svr_in_haptics.cpp | KyleGospo/City-17-Episode-One-Source | 2bc0bb56a2e0a63d963755e2831c15f2970c38e7 | [
"Unlicense"
] | 1 | 2017-12-26T21:49:18.000Z | 2020-06-11T04:03:44.000Z | src-2007/haptics/svr_in_haptics.cpp | KyleGospo/City-17-Episode-One-Source | 2bc0bb56a2e0a63d963755e2831c15f2970c38e7 | [
"Unlicense"
] | 15 | 2016-04-26T13:16:38.000Z | 2022-03-08T06:13:14.000Z | #include "cbase.h"
#include "convar.h"
#include "player.h"
#include "svr_in_haptics.h"
#include "utlvector.h"
// Recoil
ConVar hap_var_recoil_value("hap_var_recoil_value", "0", FCVAR_REPLICATED );
ConVar hap_var_recoil_strength("hap_var_recoil_strength", "0", FCVAR_REPLICATED );
ConVar hap_var_recoil_pitch("hap_var_r... | 33.760933 | 107 | 0.761313 | KyleGospo |
e8d72835b0690b6d5d2c13639bed87647fff1b23 | 675 | cpp | C++ | Beginner Challenges/Enormous Input Test.cpp | Akashverma247/Coding_Library | 09c28a71c7ba5b2f192bb8ef26b2d0a41905f011 | [
"MIT"
] | null | null | null | Beginner Challenges/Enormous Input Test.cpp | Akashverma247/Coding_Library | 09c28a71c7ba5b2f192bb8ef26b2d0a41905f011 | [
"MIT"
] | null | null | null | Beginner Challenges/Enormous Input Test.cpp | Akashverma247/Coding_Library | 09c28a71c7ba5b2f192bb8ef26b2d0a41905f011 | [
"MIT"
] | null | null | null | /*
The purpose of this problem is to verify whether the method you are using to read input data is sufficiently fast to handle problems branded with the enormous Input/Output warning. You are expected to be able to process at least 2.5MB of input data per second at runtime.
*/
#include <stdio.h>
int main()
{
... | 25 | 271 | 0.552593 | Akashverma247 |
e8d91f31b0db5fe27ecb7dfb52a6aee4a29fd509 | 1,826 | hpp | C++ | src/parser_nodes/rounding_parser_node.hpp | lowlander/nederrock | aa23f79de3adf0510419208938bf4dcdbe786c9f | [
"MIT"
] | null | null | null | src/parser_nodes/rounding_parser_node.hpp | lowlander/nederrock | aa23f79de3adf0510419208938bf4dcdbe786c9f | [
"MIT"
] | null | null | null | src/parser_nodes/rounding_parser_node.hpp | lowlander/nederrock | aa23f79de3adf0510419208938bf4dcdbe786c9f | [
"MIT"
] | null | null | null | //
// Copyright (c) 2020 Erwin Rol <erwin@erwinrol.com>
//
// SPDX-License-Identifier: MIT
//
#ifndef NEDERROCK_SRC_ROUNDING_PARSER_NODE_HPP
#define NEDERROCK_SRC_ROUNDING_PARSER_NODE_HPP
#include "rounding_parser_node_pre.hpp"
#include "floor_parser_node_pre.hpp"
#include "ceil_parser_node_pre.hpp"
#include "math_ro... | 28.53125 | 70 | 0.785323 | lowlander |
e8e27a87ab53140ad5eb8371b84439d1a2f4725e | 621 | hpp | C++ | library/ATF/__event_receiverAttribute.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/__event_receiverAttribute.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/__event_receiverAttribute.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
START_ATF_NAMESPACE
namespace vc_attributes
{
#pragma pack(push, 4)
template<>
struct event_receiverAttribute
{
temp... | 23 | 108 | 0.541063 | lemkova |
e8ef3147410e7cb68f4ab1c08ca32732f0e0274d | 1,573 | cpp | C++ | Redshift/Source/World.cpp | allogic/Redshift | 4606267b53e3d094ba588acb9ceaa97e3289632b | [
"MIT"
] | null | null | null | Redshift/Source/World.cpp | allogic/Redshift | 4606267b53e3d094ba588acb9ceaa97e3289632b | [
"MIT"
] | null | null | null | Redshift/Source/World.cpp | allogic/Redshift | 4606267b53e3d094ba588acb9ceaa97e3289632b | [
"MIT"
] | null | null | null | #include <Globals/World.h>
#include <Module.h>
World::World()
: mGlfwContext{ glfwGetCurrentContext() }
, mGladContext{ gladGetGLContext() }
, mImGuiContext{ ImGui::GetCurrentContext() }
{
// Setup gravity
mDynamicsWorld.setGravity(btVector3(0, -5, 0));
}
bool World::CreateModule(World& world, std::filesy... | 30.843137 | 172 | 0.685315 | allogic |
e8f0ad600c810006f07c9182129dea63f266093f | 3,320 | cpp | C++ | aws-cpp-sdk-customer-profiles/source/model/ConnectorOperator.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2022-02-10T08:06:54.000Z | 2022-02-10T08:06:54.000Z | aws-cpp-sdk-customer-profiles/source/model/ConnectorOperator.cpp | perfectrecall/aws-sdk-cpp | fb8cbebf2fd62720b65aeff841ad2950e73d8ebd | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-customer-profiles/source/model/ConnectorOperator.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-12-30T04:25:33.000Z | 2021-12-30T04:25:33.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/customer-profiles/model/ConnectorOperator.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace... | 26.56 | 127 | 0.772289 | perfectrecall |
e8f0d431ced30baaefc0fb6bcc4b89d0bf1a9c80 | 19,927 | hpp | C++ | ivarp/include/ivarp/prover/constraint_propagation.hpp | phillip-keldenich/squares-in-disk | 501ebeb00b909b9264a9611fd63e082026cdd262 | [
"MIT"
] | null | null | null | ivarp/include/ivarp/prover/constraint_propagation.hpp | phillip-keldenich/squares-in-disk | 501ebeb00b909b9264a9611fd63e082026cdd262 | [
"MIT"
] | null | null | null | ivarp/include/ivarp/prover/constraint_propagation.hpp | phillip-keldenich/squares-in-disk | 501ebeb00b909b9264a9611fd63e082026cdd262 | [
"MIT"
] | null | null | null | // The code is open source under the MIT license.
// Copyright 2019-2020, Phillip Keldenich, TU Braunschweig, Algorithms Group
// https://ibr.cs.tu-bs.de/alg
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to de... | 55.199446 | 121 | 0.611382 | phillip-keldenich |
e8f9a31258157ae4d875a48fc4b5f9744255eac3 | 3,766 | hpp | C++ | Graphics/install-sh/include/sh/ShStatement.hpp | Solidstatewater/Anubis-Engine | d2720167c0d5306d4d12a027dc31686b5cbb0f18 | [
"BSD-2-Clause"
] | 2 | 2017-10-29T06:43:05.000Z | 2020-03-27T10:27:07.000Z | Graphics/install-sh/include/sh/ShStatement.hpp | Solidstatewater/Anubis-Engine | d2720167c0d5306d4d12a027dc31686b5cbb0f18 | [
"BSD-2-Clause"
] | null | null | null | Graphics/install-sh/include/sh/ShStatement.hpp | Solidstatewater/Anubis-Engine | d2720167c0d5306d4d12a027dc31686b5cbb0f18 | [
"BSD-2-Clause"
] | 5 | 2016-02-06T11:01:51.000Z | 2019-03-18T13:56:00.000Z | // Sh: A GPU metaprogramming language.
//
// Copyright (c) 2003 University of Waterloo Computer Graphics Laboratory
// Project administrator: Michael D. McCool
// Authors: Zheng Qin, Stefanus Du Toit, Kevin Moule, Tiberiu S. Popa,
// Michael D. McCool
//
// This software is provided 'as-is', without any expre... | 27.289855 | 98 | 0.689326 | Solidstatewater |
e8fe14186c728a052587a5d8aa4433fae9e78a61 | 557 | cpp | C++ | discrete-math/term-1/combinatorics/09.cpp | Lascor22/ITMO-university | a252773ea1dea6179ba37403f38656be499640fc | [
"MIT"
] | null | null | null | discrete-math/term-1/combinatorics/09.cpp | Lascor22/ITMO-university | a252773ea1dea6179ba37403f38656be499640fc | [
"MIT"
] | null | null | null | discrete-math/term-1/combinatorics/09.cpp | Lascor22/ITMO-university | a252773ea1dea6179ba37403f38656be499640fc | [
"MIT"
] | 4 | 2021-02-19T01:08:57.000Z | 2021-11-21T14:41:53.000Z | #include <iostream>
using namespace std;
int n;
void gen(int countOpen, int countClose, string ans) {
if (countOpen + countClose == 2 * n) {
cout << ans << "\n";
return;
}
if (countOpen < n) {
gen(countOpen + 1, countClose, ans + '(');
}
if (countOpen > countClose) {
... | 19.892857 | 53 | 0.526032 | Lascor22 |
33015cbac949f2f4a3cdb19fa45ccf35bd86571b | 105,370 | cc | C++ | source/auto_generated/gpu_perf_api_counter_generator/public_counter_definitions_gl_gfx8.cc | AdamJMiles/gpu_performance_api | 7bd0c8b484b2a658610581e2e48b615606130fdc | [
"MIT"
] | 61 | 2020-03-17T12:30:11.000Z | 2022-03-01T18:59:11.000Z | source/auto_generated/gpu_perf_api_counter_generator/public_counter_definitions_gl_gfx8.cc | AdamJMiles/gpu_performance_api | 7bd0c8b484b2a658610581e2e48b615606130fdc | [
"MIT"
] | 12 | 2020-03-24T15:46:54.000Z | 2022-01-08T02:03:31.000Z | source/auto_generated/gpu_perf_api_counter_generator/public_counter_definitions_gl_gfx8.cc | AdamJMiles/gpu_performance_api | 7bd0c8b484b2a658610581e2e48b615606130fdc | [
"MIT"
] | 19 | 2020-03-16T17:32:09.000Z | 2022-03-29T23:35:31.000Z | //==============================================================================
// Copyright (c) 2010-2021 Advanced Micro Devices, Inc. All rights reserved.
/// @author AMD Developer Tools Team
/// @file
/// @brief Public Counter Definitions for GL GFX8.
//==============================================================... | 55.780836 | 1,606 | 0.713913 | AdamJMiles |
330488c19473d4d2c330646a7541c3f7c68b7740 | 1,936 | hpp | C++ | libs/ledger/tests/unit/mock_trust_system.hpp | chr15murray/ledger | 85be05221f19598de8c6c58652139a1f2d9e362f | [
"Apache-2.0"
] | 96 | 2018-08-23T16:49:05.000Z | 2021-11-25T00:47:16.000Z | libs/ledger/tests/unit/mock_trust_system.hpp | chr15murray/ledger | 85be05221f19598de8c6c58652139a1f2d9e362f | [
"Apache-2.0"
] | 1,011 | 2018-08-17T12:25:21.000Z | 2021-11-18T09:30:19.000Z | libs/ledger/tests/unit/mock_trust_system.hpp | chr15murray/ledger | 85be05221f19598de8c6c58652139a1f2d9e362f | [
"Apache-2.0"
] | 65 | 2018-08-20T20:05:40.000Z | 2022-02-26T23:54:35.000Z | #pragma once
//------------------------------------------------------------------------------
//
// Copyright 2018-2020 Fetch.AI Limited
//
// 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 Licen... | 42.086957 | 96 | 0.690599 | chr15murray |
330ab75fbc6c6888e7c41dac35fbdf0cad9d495d | 3,083 | cpp | C++ | baseoperations/geometry/coord2pixel.cpp | ridoo/IlwisCore | 9d9837507d804a4643545a03fd40d9b4d0eaee45 | [
"Apache-2.0"
] | null | null | null | baseoperations/geometry/coord2pixel.cpp | ridoo/IlwisCore | 9d9837507d804a4643545a03fd40d9b4d0eaee45 | [
"Apache-2.0"
] | null | null | null | baseoperations/geometry/coord2pixel.cpp | ridoo/IlwisCore | 9d9837507d804a4643545a03fd40d9b4d0eaee45 | [
"Apache-2.0"
] | null | null | null | #include <functional>
#include <future>
#include "kernel.h"
#include "raster.h"
#include "symboltable.h"
#include "ilwisoperation.h"
#include "coord2pixel.h"
using namespace Ilwis;
REGISTER_OPERATION(Coord2Pixel)
Coord2Pixel::Coord2Pixel()
{
}
Coord2Pixel::Coord2Pixel(quint64 metaid, const Ilwis::OperationExpressio... | 33.879121 | 160 | 0.683101 | ridoo |
3312c5e21419936939d25bbbecf7650fd99b2c0b | 28,001 | cpp | C++ | modules/sqlite/Parameter.cpp | dracc/VCMP-SqMod | d3e6adea147f5b2cae5119ddd6028833aa625c09 | [
"MIT"
] | null | null | null | modules/sqlite/Parameter.cpp | dracc/VCMP-SqMod | d3e6adea147f5b2cae5119ddd6028833aa625c09 | [
"MIT"
] | null | null | null | modules/sqlite/Parameter.cpp | dracc/VCMP-SqMod | d3e6adea147f5b2cae5119ddd6028833aa625c09 | [
"MIT"
] | null | null | null | // ------------------------------------------------------------------------------------------------
#include "Parameter.hpp"
// ------------------------------------------------------------------------------------------------
#include <ctime>
#include <cerrno>
#include <cstdlib>
#include <cstring>
// -----------------... | 35.898718 | 129 | 0.528838 | dracc |
3315c4bd18dcab33d3e442a87a2fb3620bcc5d77 | 791 | cpp | C++ | AddTwoNumbers.cpp | vibiu/SwordOfOffer | 6daa7d108a4f043353d372e835a1f8923c933dcc | [
"BSD-3-Clause"
] | 1 | 2020-05-14T13:59:11.000Z | 2020-05-14T13:59:11.000Z | AddTwoNumbers.cpp | vibiu/SwordOfOffer | 6daa7d108a4f043353d372e835a1f8923c933dcc | [
"BSD-3-Clause"
] | null | null | null | AddTwoNumbers.cpp | vibiu/SwordOfOffer | 6daa7d108a4f043353d372e835a1f8923c933dcc | [
"BSD-3-Clause"
] | null | null | null | #include "AddTwoNumbers.h"
#include <cstdio>
int Add(int num1, int num2)
{
int sum, carry;
do
{
sum = num1 ^ num2;
carry = (num1 & num2) << 1;
num1 = sum;
num2 = carry;
} while (num2 != 0);
return num1;
}
void AddTwoNumbersTest(int num1, int num2, int expected)
{
... | 20.282051 | 62 | 0.566372 | vibiu |
3317b58c97791945068d1c54406c96e128e1687d | 370 | cpp | C++ | src/classwork/01_assign/main.cpp | acc-cosc-1337-fall-2020/acc-cosc-1337-fall-2020-Sidrah99 | bf4db3de490c74bb7d55ba518322ed6594559c5a | [
"MIT"
] | null | null | null | src/classwork/01_assign/main.cpp | acc-cosc-1337-fall-2020/acc-cosc-1337-fall-2020-Sidrah99 | bf4db3de490c74bb7d55ba518322ed6594559c5a | [
"MIT"
] | null | null | null | src/classwork/01_assign/main.cpp | acc-cosc-1337-fall-2020/acc-cosc-1337-fall-2020-Sidrah99 | bf4db3de490c74bb7d55ba518322ed6594559c5a | [
"MIT"
] | null | null | null | //Write the include statement for types.h here
#include <iostream>
#include "types.h"
//Write include for capturing input from keyboard and displaying output to screen
int main()
{
int num, result;
std::cin >> num;
result = multiply_numbers(num);
std::cout << result;
int num1 = 4;
result = multiply_numbers(nu... | 17.619048 | 81 | 0.686486 | acc-cosc-1337-fall-2020 |
3319bc4b83f19d372615e8e60c76ac0d68c02a78 | 75 | cpp | C++ | test/run_tests.cpp | spajus/sdl2-snake | d0f2fd1410796243f3269a854fe7bccbab3f2f46 | [
"MIT"
] | 8 | 2016-01-18T11:08:28.000Z | 2021-06-06T18:43:32.000Z | test/run_tests.cpp | spajus/sdl2-snake | d0f2fd1410796243f3269a854fe7bccbab3f2f46 | [
"MIT"
] | null | null | null | test/run_tests.cpp | spajus/sdl2-snake | d0f2fd1410796243f3269a854fe7bccbab3f2f46 | [
"MIT"
] | 3 | 2017-04-18T12:15:31.000Z | 2022-02-19T10:38:56.000Z | #include <gtest/gtest.h>
#include <gmock/gmock.h>
#include "main_test.hpp"
| 18.75 | 24 | 0.733333 | spajus |
331ab430d8ba2e11feed19d243db91937b27e36d | 10,346 | hpp | C++ | native/keyswitching/aes_he.hpp | Ifoufou/SEAL | 31d66985c3b6730276d4c1695875c349b492b4ab | [
"MIT"
] | null | null | null | native/keyswitching/aes_he.hpp | Ifoufou/SEAL | 31d66985c3b6730276d4c1695875c349b492b4ab | [
"MIT"
] | null | null | null | native/keyswitching/aes_he.hpp | Ifoufou/SEAL | 31d66985c3b6730276d4c1695875c349b492b4ab | [
"MIT"
] | null | null | null | #include <future>
#include "encryptionlayer.hpp"
#include "GF256.hpp"
#include "sbox.hpp"
#include "omp.h"
// Enumerations of the differents AES Mode (128, 192 and 256)
enum AES_Mode : size_t {
AES_128 = 128,
AES_192 = 192,
AES_256 = 256
};
extern std::array<uint8_t, 255> round_const;
// Homomorphic Eva... | 40.893281 | 99 | 0.629422 | Ifoufou |
331c03bf64975b114edc6a77b72949967bd9d552 | 977 | cpp | C++ | 128.cpp | adlternative/algorithm-Brush | 0ad801ae519a0d1258faac364a8802e435397899 | [
"Apache-2.0"
] | null | null | null | 128.cpp | adlternative/algorithm-Brush | 0ad801ae519a0d1258faac364a8802e435397899 | [
"Apache-2.0"
] | null | null | null | 128.cpp | adlternative/algorithm-Brush | 0ad801ae519a0d1258faac364a8802e435397899 | [
"Apache-2.0"
] | null | null | null | #include "disjointSet.hpp"
#include <bits/stdc++.h>
#include <errno.h>
#include <fcntl.h>
#include <sys/types.h>
#include <unistd.h>
using namespace kv_version;
using namespace std;
class Solution {
public:
int longestConsecutive(vector<int> &nums) {
int len = nums.size();
if (!len)
return 0;
set<... | 22.72093 | 49 | 0.552712 | adlternative |
331c2efcf09f5485f96ee982e1c620af29e56ef7 | 8,083 | hpp | C++ | libs/fnd/ranges/include/bksge/fnd/ranges/views/reverse_view.hpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 4 | 2018-06-10T13:35:32.000Z | 2021-06-03T14:27:41.000Z | libs/fnd/ranges/include/bksge/fnd/ranges/views/reverse_view.hpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 566 | 2017-01-31T05:36:09.000Z | 2022-02-09T05:04:37.000Z | libs/fnd/ranges/include/bksge/fnd/ranges/views/reverse_view.hpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 1 | 2018-07-05T04:40:53.000Z | 2018-07-05T04:40:53.000Z | /**
* @file reverse_view.hpp
*
* @brief reverse_view の定義
*
* @author myoukaku
*/
#ifndef BKSGE_FND_RANGES_VIEWS_REVERSE_VIEW_HPP
#define BKSGE_FND_RANGES_VIEWS_REVERSE_VIEW_HPP
#include <bksge/fnd/ranges/config.hpp>
#if defined(BKSGE_USE_STD_RANGES)
namespace bksge {
namespace ranges {
usi... | 28.461268 | 82 | 0.726958 | myoukaku |
331e977527992f947365039336e21d0d67e4a8e0 | 6,499 | cpp | C++ | Source/Engine/src/audio/codec/dumbogg.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | null | null | null | Source/Engine/src/audio/codec/dumbogg.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | null | null | null | Source/Engine/src/audio/codec/dumbogg.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | 1 | 2021-10-30T20:43:01.000Z | 2021-10-30T20:43:01.000Z | /*
* TODO This file needs to be rewritten and integrated better
* _______ ____ __ ___ ___
* \ _ \ \ / \ / \ \ / / ' ' '
* | | \ \ | | || | \/ | . .
* | | | | | | || ||\ /| |
* | | | | | | ... | 24.711027 | 116 | 0.57732 | DatZach |
331eaa2d2f06f562fa97af5b0896d9895b3e4f4c | 689 | cpp | C++ | Classes/pages/LittleTouchPage.cpp | elloop/Playing-With-Cocos3D | fdef1605557d6c789c911d76f89372e83b50b018 | [
"MIT"
] | 1 | 2015-12-14T15:20:46.000Z | 2015-12-14T15:20:46.000Z | Classes/pages/LittleTouchPage.cpp | elloop/Playing-With-Cocos3D | fdef1605557d6c789c911d76f89372e83b50b018 | [
"MIT"
] | null | null | null | Classes/pages/LittleTouchPage.cpp | elloop/Playing-With-Cocos3D | fdef1605557d6c789c911d76f89372e83b50b018 | [
"MIT"
] | null | null | null | #include "pages/LittleTouchPage.h"
void TouchableLayer::loadUI()
{
}
void TouchableLayer::unloadUI()
{
}
void TouchableLayer::onEnterState()
{
}
void TouchableLayer::onExecuteState()
{
}
void TouchableLayer::onExitState()
{
}
bool TouchableLayer::onTouchBegan(cocos2d::Touch *pTouch, cocos2d::Event *pEvent)
... | 11.87931 | 85 | 0.731495 | elloop |
332a07383a3cc45485bebce98e3a2f220d726e9d | 1,823 | cpp | C++ | Motorola/iDEN/Src/iDENLibrary/DirectReplyParser.cpp | erithion/old_junk | b2dcaa23320824f8b2c17571f27826869ccd0d4b | [
"MIT"
] | 1 | 2021-06-26T17:08:24.000Z | 2021-06-26T17:08:24.000Z | Motorola/iDEN/Src/iDENLibrary/DirectReplyParser.cpp | erithion/old_junk | b2dcaa23320824f8b2c17571f27826869ccd0d4b | [
"MIT"
] | null | null | null | Motorola/iDEN/Src/iDENLibrary/DirectReplyParser.cpp | erithion/old_junk | b2dcaa23320824f8b2c17571f27826869ccd0d4b | [
"MIT"
] | null | null | null |
#include "DirectReplyParser.h"
#include <algorithm>
#include <exception>
using namespace Protocol::Direct;
ReplyParser::ReplyParser()
{
}
uchar_vt ReplyParser::Parse(const uchar_vt& buffer)
{
const unsigned char ProtocolId = 0x10;
const unsigned char GenReq = 0x02;
const unsigned ch... | 23.675325 | 65 | 0.50576 | erithion |
06a258b7a13f4b9020f23bc36c8cddb2ba25d2d2 | 5,299 | cpp | C++ | LiberoEngine/src/Libero/Components/MeshRenderComponent.cpp | Kair0z/LiberoEngine3D | 84c5f75251f19330da9a490587bbf0911bdb681a | [
"MIT"
] | null | null | null | LiberoEngine/src/Libero/Components/MeshRenderComponent.cpp | Kair0z/LiberoEngine3D | 84c5f75251f19330da9a490587bbf0911bdb681a | [
"MIT"
] | null | null | null | LiberoEngine/src/Libero/Components/MeshRenderComponent.cpp | Kair0z/LiberoEngine3D | 84c5f75251f19330da9a490587bbf0911bdb681a | [
"MIT"
] | null | null | null | #include "Liber_pch.h"
#include "MeshRenderComponent.h"
#include "Libero/Graphics/GraphicsMaster.h"
#include "Libero/Graphics/CameraMaster.h"
#include "Libero/Components/CameraComponent.h"
#include "Libero/Components/TransformComponent.h"
#include "Libero/Content/ContentMaster.h"
#include "Libero/Components/MeshFilterC... | 30.988304 | 113 | 0.738253 | Kair0z |
06a38ee08eb70dea273947d31d83bb38cdf55feb | 752 | cpp | C++ | gEarth.Pack/oepLayer.cpp | songgod/gEarth | e4ea0fa15a40f08481c7ea7e42e6f4ace8659984 | [
"MIT"
] | 5 | 2021-06-16T06:24:29.000Z | 2022-03-10T03:41:44.000Z | gEarth.Pack/oepLayer.cpp | songgod/gEarth | e4ea0fa15a40f08481c7ea7e42e6f4ace8659984 | [
"MIT"
] | 1 | 2020-10-14T14:20:58.000Z | 2020-10-14T14:20:58.000Z | gEarth.Pack/oepLayer.cpp | songgod/gEarth | e4ea0fa15a40f08481c7ea7e42e6f4ace8659984 | [
"MIT"
] | 2 | 2021-06-16T06:24:32.000Z | 2021-08-02T09:05:42.000Z | #include "stdafx.h"
#include "oepLayer.h"
#include "oepLayerFactory.h"
using namespace gEarthPack;
oepLayer::oepLayer()
{
}
String^ oepLayer::StatusString::get()
{
osgEarth::Layer* plyr = as<osgEarth::Layer>();
if (!plyr)
return "";
return Str2Cli(plyr->getStatus().toString());
}
bool oepLayer::IsOK::get()
{... | 17.090909 | 48 | 0.658245 | songgod |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.