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 108 | 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 67k ⌀ | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7b47036661d4b580854a359716405bc723c25137 | 810 | cpp | C++ | hackerrank/c++/stl/vector_erase.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | 1 | 2020-07-16T01:46:38.000Z | 2020-07-16T01:46:38.000Z | hackerrank/c++/stl/vector_erase.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | null | null | null | hackerrank/c++/stl/vector_erase.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | 1 | 2020-05-27T14:30:43.000Z | 2020-05-27T14:30:43.000Z | #include <iostream>
#include <vector>
using namespace std;
inline
void use_io_optimizations()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int main()
{
use_io_optimizations();
unsigned int length;
cin >> length;
vector<unsigned int> sequence(length);
for (auto& element : seq... | 17.608696 | 63 | 0.569136 | Rkhoiwal |
0da2fba5c2f892c74d3f8f0f7cea5fa22c42a8a3 | 2,703 | cpp | C++ | Chapter_4_Graph/SSSP/kattis_emptyingbaltic.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | 2 | 2021-12-29T04:12:59.000Z | 2022-03-30T09:32:19.000Z | Chapter_4_Graph/SSSP/kattis_emptyingbaltic.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | null | null | null | Chapter_4_Graph/SSSP/kattis_emptyingbaltic.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | 1 | 2022-03-01T06:12:46.000Z | 2022-03-01T06:12:46.000Z | /* kattis - emptyingbaltic
Observation 1:
When considering how much water will eventually be drained from a cell r,c, we realise it is actually
drained until the level of the minimum max height along all paths from r,c to the drain. This is
actually similar to the SSSP principle but instead of minimising d... | 34.653846 | 120 | 0.572327 | BrandonTang89 |
0da5bf18e4e0ca7b2684740e13a4964a656c8332 | 370 | cpp | C++ | 09-Inheritance/06-Gen_Spec.cpp | PronomitaDey/Cpp_Tutorial | a64a10a27d018bf9edf5280505201a1fbfd359ed | [
"MIT"
] | null | null | null | 09-Inheritance/06-Gen_Spec.cpp | PronomitaDey/Cpp_Tutorial | a64a10a27d018bf9edf5280505201a1fbfd359ed | [
"MIT"
] | 1 | 2021-10-01T13:35:44.000Z | 2021-10-02T03:54:29.000Z | 09-Inheritance/06-Gen_Spec.cpp | PronomitaDey/Cpp_Tutorial | a64a10a27d018bf9edf5280505201a1fbfd359ed | [
"MIT"
] | 3 | 2021-10-01T14:07:09.000Z | 2021-10-01T18:24:31.000Z | #include <iostream>
using namespace std;
// Generalization
/*
Shape is not something real whereas Rectangle,
Square and all are so Shape is just a Generalization
of those This is also called as
Polymorphism
*/
// Specialization
/*
Cuboid is an extension of Rectangle So this method is
calle... | 16.818182 | 57 | 0.694595 | PronomitaDey |
0da642165d7437a4d49fd5224549f9f7b091fadc | 2,196 | cpp | C++ | Jimmy_Core/source/Sys_Init.cpp | nozsavsev/jimmy | 0be7a153e9c1a2f14710d072fd172ee1b3402742 | [
"Apache-2.0"
] | 1 | 2021-05-17T23:03:14.000Z | 2021-05-17T23:03:14.000Z | Jimmy_Core/source/Sys_Init.cpp | nozsavsev/jimmy | 0be7a153e9c1a2f14710d072fd172ee1b3402742 | [
"Apache-2.0"
] | null | null | null | Jimmy_Core/source/Sys_Init.cpp | nozsavsev/jimmy | 0be7a153e9c1a2f14710d072fd172ee1b3402742 | [
"Apache-2.0"
] | null | null | null | /*Copyright 2020 Nozdrachev Ilia
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, softwar... | 32.776119 | 174 | 0.651639 | nozsavsev |
0da6a82aa2a526dede29cb766c8cc4d129cc92c6 | 2,513 | cpp | C++ | CameraCtrl.cpp | neil3d/ShadowMappingD3D | fa5c856ae8fb7ee0afa22e70e84c1dd34fbce52f | [
"MIT"
] | 1 | 2019-11-29T01:19:31.000Z | 2019-11-29T01:19:31.000Z | CameraCtrl.cpp | neil3d/ShadowMappingD3D | fa5c856ae8fb7ee0afa22e70e84c1dd34fbce52f | [
"MIT"
] | null | null | null | CameraCtrl.cpp | neil3d/ShadowMappingD3D | fa5c856ae8fb7ee0afa22e70e84c1dd34fbce52f | [
"MIT"
] | null | null | null | #include ".\cameractrl.h"
#include "SGITrackBall.h"
CameraCtrl g_camera;
inline D3DXVECTOR3 operator * (const D3DXVECTOR3& v,const D3DXMATRIX& m)
{
return D3DXVECTOR3(v.x*m._11+v.y*m._21+v.z*m._31+m._41,
v.x*m._12+v.y*m._22+v.z*m._32+m._42,
v.x*m._13+v.y*m._23+v.z*m._33+m._43);
}
CameraCtrl::CameraCtrl(void)
{
... | 18.477941 | 93 | 0.68842 | neil3d |
0daa96caab68a09d8f1da30958d5760679e5f0e3 | 1,938 | cpp | C++ | graph-source-code/174-D/1509433.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/174-D/1509433.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/174-D/1509433.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | //Language: GNU C++
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include... | 19.188119 | 91 | 0.557276 | AmrARaouf |
0daba5852d634fb454ef7bfa9bfe9b59927befc4 | 867 | cpp | C++ | src/main.cpp | RomainAmuat/apt_project | 520281a09756816f6297e3f35b42bce2ab12973b | [
"MIT"
] | null | null | null | src/main.cpp | RomainAmuat/apt_project | 520281a09756816f6297e3f35b42bce2ab12973b | [
"MIT"
] | null | null | null | src/main.cpp | RomainAmuat/apt_project | 520281a09756816f6297e3f35b42bce2ab12973b | [
"MIT"
] | null | null | null | #include <pistache/http.h>
#include <pistache/description.h>
#include <pistache/endpoint.h>
#include <pistache/serializer/rapidjson.h>
#include "view/ServiceManager.h"
#include "model/MySQLLink.h"
using namespace std;
using namespace Pistache;
int main(int argc, char *argv[]) {
std::string url;
if (argc >... | 19.704545 | 84 | 0.594002 | RomainAmuat |
0dabefa1becca43221ab84ce7c3307441bbbeb58 | 6,550 | cpp | C++ | src/vm/appdomainstack.cpp | CyberSys/coreclr-mono | 83b2cb83b32faa45b4f790237b5c5e259692294a | [
"MIT"
] | 10 | 2015-11-03T16:35:25.000Z | 2021-07-31T16:36:29.000Z | src/vm/appdomainstack.cpp | CyberSys/coreclr-mono | 83b2cb83b32faa45b4f790237b5c5e259692294a | [
"MIT"
] | 1 | 2019-03-05T18:50:09.000Z | 2019-03-05T18:50:09.000Z | src/vm/appdomainstack.cpp | CyberSys/coreclr-mono | 83b2cb83b32faa45b4f790237b5c5e259692294a | [
"MIT"
] | 4 | 2015-10-28T12:26:26.000Z | 2021-09-04T11:36:04.000Z | //
// Copyright (c) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
//
//
//
#include "common.h"
#include "appdomainstack.h"
#include "appdomainstack.inl"
#include "security.h"
#include "securitypolicy.h"
#include "appdomain.in... | 33.248731 | 128 | 0.671145 | CyberSys |
0daec77a627b03e2bc4ead844c9bc8c9c0e152ff | 1,535 | cpp | C++ | FindMissingNumber.cpp | Cuncis/codeWith-hacktoberfest | 9cd5059e4d90b42fa9e12ba5ec8bf3f49c9e6c63 | [
"MIT"
] | null | null | null | FindMissingNumber.cpp | Cuncis/codeWith-hacktoberfest | 9cd5059e4d90b42fa9e12ba5ec8bf3f49c9e6c63 | [
"MIT"
] | null | null | null | FindMissingNumber.cpp | Cuncis/codeWith-hacktoberfest | 9cd5059e4d90b42fa9e12ba5ec8bf3f49c9e6c63 | [
"MIT"
] | null | null | null | /* Problem-Task : Create a function that takes an array of numbers between 1 and 10
(excluding one number) and returns the missing number.
* Problem Link : https://edabit.com/challenge/7YaJhC4terApw5DFa
*/
//C++ Program to find the Missing Number
/*The logic we are using is:
Sum of n integer elements is: n... | 18.058824 | 88 | 0.614332 | Cuncis |
0dafd3e5017fc24e0fc51d2e5dc1f14112a97272 | 3,108 | cpp | C++ | sp800-22/runs_test.cpp | ilwoong/randomness_library | 6d00cd4810b2dc793c1f057b3a40cab30dbd0ac8 | [
"MIT"
] | null | null | null | sp800-22/runs_test.cpp | ilwoong/randomness_library | 6d00cd4810b2dc793c1f057b3a40cab30dbd0ac8 | [
"MIT"
] | null | null | null | sp800-22/runs_test.cpp | ilwoong/randomness_library | 6d00cd4810b2dc793c1f057b3a40cab30dbd0ac8 | [
"MIT"
] | 1 | 2020-06-27T08:08:18.000Z | 2020-06-27T08:08:18.000Z | /**
* The MIT License
*
* Copyright (c) 2020 Ilwoong Jeong (https://github.com/ilwoong)
*
* 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 ... | 31.393939 | 85 | 0.642535 | ilwoong |
0db0ca1c31bf042834d85629285d51b66d9a2362 | 352 | hpp | C++ | include/cuda_dl.hpp | jetd1/kuafu | 819d338682f3e889710731cf7ca16f790b54568f | [
"MIT"
] | 17 | 2021-09-03T03:06:48.000Z | 2022-03-27T04:02:14.000Z | include/cuda_dl.hpp | jetd1/kuafu | 819d338682f3e889710731cf7ca16f790b54568f | [
"MIT"
] | null | null | null | include/cuda_dl.hpp | jetd1/kuafu | 819d338682f3e889710731cf7ca16f790b54568f | [
"MIT"
] | null | null | null | //
// Created by jet on 9/17/21.
//
#pragma once
#include <cuda.h>
namespace kuafu {
void kfCuDlOpen();
void kfCuDlClose();
CUresult kfCuInit(unsigned int Flags);
CUresult kfCuStreamCreate(CUstream* phStream, unsigned int Flags);
CUresult kfCuCtxCreate(CUcontext* pctx, unsigned int flags, CUdevice dev);
CUresult kf... | 18.526316 | 74 | 0.758523 | jetd1 |
0db79073d01f6a5e7dc7459f93003d3937f68c78 | 3,819 | cpp | C++ | Lab4/src/CircleHough.cpp | DavidePistilli173/Computer-Vision | 4066a99f6f6fdc941829d3cd3015565ec0046a2f | [
"Apache-2.0"
] | null | null | null | Lab4/src/CircleHough.cpp | DavidePistilli173/Computer-Vision | 4066a99f6f6fdc941829d3cd3015565ec0046a2f | [
"Apache-2.0"
] | null | null | null | Lab4/src/CircleHough.cpp | DavidePistilli173/Computer-Vision | 4066a99f6f6fdc941829d3cd3015565ec0046a2f | [
"Apache-2.0"
] | null | null | null | #include "CircleHough.hpp"
#include <opencv2/imgproc.hpp>
using namespace lab4;
CircleHough::CircleHough(const cv::Mat& img, std::string_view winName) :
ImgProcessor(img, winName, CV_8UC3)
{
bool success{ true };
/* Add trackbars for parameters of type double. */
for (int i = 0; i < static_cast<int>... | 32.092437 | 112 | 0.59911 | DavidePistilli173 |
0dbf9b4c39ae19b637977f9af9789b6e31d8d519 | 29,310 | cpp | C++ | sketchup_converter/main.cpp | jhhsia/sketchup_converter | 7d8daffd61c8d8f6c214640672e38c7817e37788 | [
"MIT"
] | 1 | 2020-09-27T10:55:07.000Z | 2020-09-27T10:55:07.000Z | sketchup_converter/main.cpp | jhhsia/sketchup_converter | 7d8daffd61c8d8f6c214640672e38c7817e37788 | [
"MIT"
] | null | null | null | sketchup_converter/main.cpp | jhhsia/sketchup_converter | 7d8daffd61c8d8f6c214640672e38c7817e37788 | [
"MIT"
] | null | null | null | //
// main.cpp
// sketchup_converter
//
// Created by jahsia on 10/26/18.
// Copyright © 2018 trisetra. All rights reserved.
//
#include <iostream>
#include <SketchUpAPI/common.h>
#include <SketchUpAPI/geometry.h>
#include <SketchUpAPI/geometry/vector3d.h>
#include <SketchUpAPI/initialize.h>
#include <SketchUpAPI... | 38.872679 | 162 | 0.608393 | jhhsia |
0dbff02f2d2ddc13d3713e7691ed49c0ee996e42 | 1,028 | cpp | C++ | Luogu/P3805/manacher.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | 2 | 2018-02-14T01:59:31.000Z | 2018-03-28T03:30:45.000Z | Luogu/P3805/manacher.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | null | null | null | Luogu/P3805/manacher.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | 2 | 2017-12-30T02:46:35.000Z | 2018-03-28T03:30:49.000Z | #include <bits/stdc++.h>
using namespace std;
#define SIZE 11000010
int radius[SIZE << 1];
string man;
void init(const string & str) {
memset(radius, 0, sizeof(radius));
man.clear();
man.push_back('#');
for (auto ch : str) {
man.push_back(ch);
man.push_back('#');
}
}
void manache... | 21.87234 | 95 | 0.488327 | codgician |
0dc05ff01b6e68b3e8529d0234a5cd5841eee709 | 6,156 | cc | C++ | src/App.cc | ElChapos/BlockWorld | 9fcd224682ef52a1ca82d7f4ff6c1b39afe97b94 | [
"BSD-2-Clause"
] | 1 | 2016-05-24T17:25:51.000Z | 2016-05-24T17:25:51.000Z | src/App.cc | ElChapos/BlockWorld | 9fcd224682ef52a1ca82d7f4ff6c1b39afe97b94 | [
"BSD-2-Clause"
] | null | null | null | src/App.cc | ElChapos/BlockWorld | 9fcd224682ef52a1ca82d7f4ff6c1b39afe97b94 | [
"BSD-2-Clause"
] | null | null | null | #define GLEW_STATIC // Easier debugging
#define RUN_GRAPHICS_DISPLAY 0x00;
#include <GL/glew.h>
#ifdef __APPLE__
#include <OpenGL/gl.h>
#else
#include <GL/gl.h>
#endif
#include <SDL2/SDL.h>
#include <iostream>
#include <memory>
#include <boost/program_options.hpp>
#include "common.h"
#include "App.h"
#include "GameWo... | 24.722892 | 103 | 0.647336 | ElChapos |
0dc233941ea24ea4d103cddb6fb8270bc31dbbe1 | 3,192 | cpp | C++ | gcommon/source/gsoundmanager.cpp | DavidCoenFish/ancient-code-0 | 243fb47b9302a77f9b9392b6e3f90bba2ef3c228 | [
"Unlicense"
] | null | null | null | gcommon/source/gsoundmanager.cpp | DavidCoenFish/ancient-code-0 | 243fb47b9302a77f9b9392b6e3f90bba2ef3c228 | [
"Unlicense"
] | null | null | null | gcommon/source/gsoundmanager.cpp | DavidCoenFish/ancient-code-0 | 243fb47b9302a77f9b9392b6e3f90bba2ef3c228 | [
"Unlicense"
] | null | null | null | //
// GSoundManager.cpp
//
// Created by David Coen on 2011 03 11
// Copyright 2010 Pleasure seeking morons. All rights reserved.
//
#include "GSoundManager.h"
#include "GBuffer.h"
#include "GSoundBuffer.h"
#include "GSoundContext.h"
#include "GSoundLoad.h"
#include "GSoundManagerLoad.h"
#include "GSoundUtility.h"... | 19.228916 | 98 | 0.740602 | DavidCoenFish |
0dc5ef8e54d12820990e9e15b07f85e89723a40d | 900 | cpp | C++ | src/util/function.cpp | keszocze/abo | 2d59ac20832b308ef5f90744fc98752797a4f4ba | [
"MIT"
] | null | null | null | src/util/function.cpp | keszocze/abo | 2d59ac20832b308ef5f90744fc98752797a4f4ba | [
"MIT"
] | null | null | null | src/util/function.cpp | keszocze/abo | 2d59ac20832b308ef5f90744fc98752797a4f4ba | [
"MIT"
] | 1 | 2020-03-11T14:50:31.000Z | 2020-03-11T14:50:31.000Z | #include "function.hpp"
#include <algorithm>
#include <cassert>
namespace abo::util {
Function::Function(const Cudd &mgr, const std::vector<BDD> &value, NumberRepresentation representation) :
mgr(mgr),
value(value),
representation(representation)
{
assert(value.size() > 0);
}
BDD& Function::operator[... | 18.75 | 105 | 0.626667 | keszocze |
0dc64440407d2d613efff0eb8498a34a4459d305 | 1,122 | cpp | C++ | data_structures/trie/CPP/trie_bits.cpp | CarbonDDR/al-go-rithms | 8e65affbe812931b7dde0e2933eb06c0f44b4130 | [
"CC0-1.0"
] | 1,253 | 2017-06-06T07:19:25.000Z | 2022-03-30T17:07:58.000Z | data_structures/trie/CPP/trie_bits.cpp | rishabh99-rc/al-go-rithms | 4df20d7ef7598fda4bc89101f9a99aac94cdd794 | [
"CC0-1.0"
] | 554 | 2017-09-29T18:56:01.000Z | 2022-02-21T15:48:13.000Z | data_structures/trie/CPP/trie_bits.cpp | rishabh99-rc/al-go-rithms | 4df20d7ef7598fda4bc89101f9a99aac94cdd794 | [
"CC0-1.0"
] | 2,226 | 2017-09-29T19:59:59.000Z | 2022-03-25T08:59:55.000Z | class trie {
struct node {
int words;
int prefix;
struct node *edge[2];
};
public:
struct node *root;
trie() {
root = newnode();
root -> words = 0;
root -> prefix = 0;
root -> edge[0] = root -> edge[1] = NULL;
}
struct node * newnode() {
... | 23.375 | 68 | 0.399287 | CarbonDDR |
0dc78a607390e1fcc4c43afa5600113d3d44d7c2 | 22,062 | hpp | C++ | src/algorithms/bfs.hpp | KIwabuchi/gbtl | 62c6b1e3262f3623359e793edb5ec4fa7bb471f0 | [
"Unlicense"
] | 112 | 2016-04-26T05:54:30.000Z | 2022-03-27T05:56:16.000Z | src/algorithms/bfs.hpp | KIwabuchi/gbtl | 62c6b1e3262f3623359e793edb5ec4fa7bb471f0 | [
"Unlicense"
] | 21 | 2016-03-22T19:06:46.000Z | 2021-10-07T15:40:18.000Z | src/algorithms/bfs.hpp | KIwabuchi/gbtl | 62c6b1e3262f3623359e793edb5ec4fa7bb471f0 | [
"Unlicense"
] | 22 | 2016-04-26T05:54:35.000Z | 2021-12-21T03:33:20.000Z | /*
* GraphBLAS Template Library (GBTL), Version 3.0
*
* Copyright 2020 Carnegie Mellon University, Battelle Memorial Institute, and
* Authors.
*
* THIS MATERIAL WAS PREPARED AS AN ACCOUNT OF WORK SPONSORED BY AN AGENCY OF
* THE UNITED STATES GOVERNMENT. NEITHER THE UNITED STATES GOVERNMENT NOR THE
* UNITED STA... | 40.780037 | 82 | 0.493382 | KIwabuchi |
0dcb057950b893631379a1046ec6e5980495ccf5 | 1,175 | hpp | C++ | include/fcppt/container/is_raw_vector.hpp | vinzenz/fcppt | 3f8cc5babdee178a9bbd06ca3ce7ad405d19aa6a | [
"BSL-1.0"
] | null | null | null | include/fcppt/container/is_raw_vector.hpp | vinzenz/fcppt | 3f8cc5babdee178a9bbd06ca3ce7ad405d19aa6a | [
"BSL-1.0"
] | null | null | null | include/fcppt/container/is_raw_vector.hpp | vinzenz/fcppt | 3f8cc5babdee178a9bbd06ca3ce7ad405d19aa6a | [
"BSL-1.0"
] | null | null | null | // Copyright Carl Philipp Reh 2009 - 2016.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef FCPPT_CONTAINER_IS_RAW_VECTOR_HPP_INCLUDED
#define FCPPT_CONTAINER_IS_RAW_VECTOR_HPP_INCLU... | 18.951613 | 76 | 0.765106 | vinzenz |
0dcfca94ba8ea1a603a51334ea8cc925cdc8cc88 | 26,336 | cpp | C++ | Engine/Src/SFEngine/Graphics/Vulkan/SFVulkanLibrary.cpp | blue3k/StormForge | 1557e699a673ae9adcc8f987868139f601ec0887 | [
"Apache-2.0"
] | 1 | 2020-06-20T07:35:25.000Z | 2020-06-20T07:35:25.000Z | Engine/Src/SFEngine/Graphics/Vulkan/SFVulkanLibrary.cpp | blue3k/StormForge | 1557e699a673ae9adcc8f987868139f601ec0887 | [
"Apache-2.0"
] | null | null | null | Engine/Src/SFEngine/Graphics/Vulkan/SFVulkanLibrary.cpp | blue3k/StormForge | 1557e699a673ae9adcc8f987868139f601ec0887 | [
"Apache-2.0"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////
//
// CopyRight (c) 2017 Kyungkun Ko
//
// Author : KyungKun Ko
//
// Description : Vulkan library
//
////////////////////////////////////////////////////////////////////////////////
#include "SFEnginePCH.h"
#include "SFVul... | 57.881319 | 131 | 0.851306 | blue3k |
0dd1418522f97a08080e378c45d316b27f9933c8 | 2,610 | cpp | C++ | src/qt/orphandownloader.cpp | Mart1250/biblepay | d53d04f74242596b104d360187268a50b845b82e | [
"MIT"
] | null | null | null | src/qt/orphandownloader.cpp | Mart1250/biblepay | d53d04f74242596b104d360187268a50b845b82e | [
"MIT"
] | null | null | null | src/qt/orphandownloader.cpp | Mart1250/biblepay | d53d04f74242596b104d360187268a50b845b82e | [
"MIT"
] | null | null | null | #include "orphandownloader.h"
#include <univalue.h>
#include "rpcipfs.h"
#include "guiutil.h"
#include "rpcpog.h"
#include "timedata.h"
#include <QUrl>
#include <boost/algorithm/string/case_conv.hpp>
#include <QDir>
#include <QTimer>
#include <QString>
OrphanDownloader::OrphanDownloader(QString xURL, QString xDestN... | 23.097345 | 136 | 0.67931 | Mart1250 |
0dd1f5ec98aef716956bd127f9d70e50b8adfc43 | 1,254 | hpp | C++ | ufora/core/UnitTest.hpp | ufora/ufora | 04db96ab049b8499d6d6526445f4f9857f1b6c7e | [
"Apache-2.0",
"CC0-1.0",
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 571 | 2015-11-05T20:07:07.000Z | 2022-01-24T22:31:09.000Z | ufora/core/UnitTest.hpp | timgates42/ufora | 04db96ab049b8499d6d6526445f4f9857f1b6c7e | [
"Apache-2.0",
"CC0-1.0",
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 218 | 2015-11-05T20:37:55.000Z | 2021-05-30T03:53:50.000Z | ufora/core/UnitTest.hpp | timgates42/ufora | 04db96ab049b8499d6d6526445f4f9857f1b6c7e | [
"Apache-2.0",
"CC0-1.0",
"MIT",
"BSL-1.0",
"BSD-3-Clause"
] | 40 | 2015-11-07T21:42:19.000Z | 2021-05-23T03:48:19.000Z | /***************************************************************************
Copyright 2015 Ufora Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licen... | 35.828571 | 77 | 0.555821 | ufora |
0dd7bc5f047c985bf90a901d7f732c8482e23cff | 1,204 | cpp | C++ | pc_code/Serial/SerialTestMFC/AboutDlg.cpp | johnenrickplenos/water_level_monitoring | 3e0628daea5eb1caba1fb69efdd2691590ce6c32 | [
"MIT"
] | null | null | null | pc_code/Serial/SerialTestMFC/AboutDlg.cpp | johnenrickplenos/water_level_monitoring | 3e0628daea5eb1caba1fb69efdd2691590ce6c32 | [
"MIT"
] | null | null | null | pc_code/Serial/SerialTestMFC/AboutDlg.cpp | johnenrickplenos/water_level_monitoring | 3e0628daea5eb1caba1fb69efdd2691590ce6c32 | [
"MIT"
] | null | null | null | #include "StdAfx.h"
#include "SerialTestMFC.h"
#include "AboutDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CAboutDlg
BEGIN_MESSAGE_MAP(CAboutDlg, CDialog)
//{{AFX_MSG_MAP(CAbou... | 21.122807 | 77 | 0.63206 | johnenrickplenos |
0dd8861e56ff759a80a345bc27736ff4ef253114 | 2,796 | hpp | C++ | include/musycl/midi/midi_out.hpp | keryell/muSYCL | 130e4b29c3a4daf4c908b08263b53910acb13787 | [
"Apache-2.0"
] | 16 | 2021-05-07T11:33:59.000Z | 2022-03-05T02:36:06.000Z | include/musycl/midi/midi_out.hpp | keryell/muSYCL | 130e4b29c3a4daf4c908b08263b53910acb13787 | [
"Apache-2.0"
] | null | null | null | include/musycl/midi/midi_out.hpp | keryell/muSYCL | 130e4b29c3a4daf4c908b08263b53910acb13787 | [
"Apache-2.0"
] | null | null | null | #ifndef MUSYCL_MIDI_MIDI_OUT_HPP
#define MUSYCL_MIDI_MIDI_OUT_HPP
/** \file SYCL abstraction for a MIDI output pipe
Based on RtMidi library.
*/
#include <cstdlib>
#include <functional>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include "rtmidi/RtMidi.h"
#include "musycl/midi.hpp... | 27.145631 | 79 | 0.628755 | keryell |
0ddb16c6f91457457938bd229b881a1937481b02 | 4,044 | cc | C++ | src/Test/mutant_test_2.cc | hgl71964/PET | 4cedb25c5dce0c49eebb693125235fc4ad1e26f8 | [
"Apache-2.0"
] | 69 | 2021-06-01T03:19:12.000Z | 2022-03-26T00:14:20.000Z | src/Test/mutant_test_2.cc | hgl71964/PET | 4cedb25c5dce0c49eebb693125235fc4ad1e26f8 | [
"Apache-2.0"
] | null | null | null | src/Test/mutant_test_2.cc | hgl71964/PET | 4cedb25c5dce0c49eebb693125235fc4ad1e26f8 | [
"Apache-2.0"
] | 4 | 2021-07-10T07:21:11.000Z | 2022-02-06T18:56:56.000Z | #include "generator.h"
#include "graph.h"
#include "operator.h"
#include "search_engine.h"
#include "tensor.h"
#include <cstdlib>
#include <iostream>
const int n = 16, c = 16, h = 14, w = 14;
const int f = 32, r = 3, s = 3;
int main() {
auto i0 = new tpm::Tensor({n, c, h, w});
auto i1 = new tpm::Tensor({n, c,... | 27.889655 | 74 | 0.426558 | hgl71964 |
0ddfb804bf0e44a86e59569681b9e4f64d988f9e | 13,615 | cpp | C++ | ObjGroupTree.cpp | joeriedel/Tread3.0A2 | 337c4aa74d554e21b50d6bd4406ce0f67aa39144 | [
"MIT"
] | 1 | 2020-07-19T10:19:18.000Z | 2020-07-19T10:19:18.000Z | ObjGroupTree.cpp | joeriedel/Tread3.0A2 | 337c4aa74d554e21b50d6bd4406ce0f67aa39144 | [
"MIT"
] | null | null | null | ObjGroupTree.cpp | joeriedel/Tread3.0A2 | 337c4aa74d554e21b50d6bd4406ce0f67aa39144 | [
"MIT"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
// ObjGroupTree.cpp
///////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2008, Joe Riedel
// All rights reserved.
//
// Redistribution and use in source and binary forms,
// with or without modif... | 22.541391 | 107 | 0.644142 | joeriedel |
0ddff55376d488420ae6b66a411a78d0e238d768 | 3,969 | cxx | C++ | private/inet/mshtml/src/site/base/wfromd.cxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 11 | 2017-09-02T11:27:08.000Z | 2022-01-02T15:25:24.000Z | private/inet/mshtml/src/site/base/wfromd.cxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | null | null | null | private/inet/mshtml/src/site/base/wfromd.cxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 14 | 2019-01-16T01:01:23.000Z | 2022-02-20T15:54:27.000Z | //+---------------------------------------------------------------------------
//
// Microsoft Forms
// Copyright (C) Microsoft Corporation, 1992 - 1996.
//
// File: wfromd.cxx
//
// Contents: Contains coordinate conversion functions.
//
// Classes: CDoc (partial)
//
//-----------------------... | 28.35 | 79 | 0.525321 | King0987654 |
0de65532cb5c29f81f26e0e4af0b35029675c23d | 605 | cpp | C++ | qmessagebox/mainwindow.cpp | orthoWitch/gosha-dudar-qt | 6ec073a2bd1e6bd13f9084d84b6340d60753b978 | [
"Apache-2.0"
] | null | null | null | qmessagebox/mainwindow.cpp | orthoWitch/gosha-dudar-qt | 6ec073a2bd1e6bd13f9084d84b6340d60753b978 | [
"Apache-2.0"
] | null | null | null | qmessagebox/mainwindow.cpp | orthoWitch/gosha-dudar-qt | 6ec073a2bd1e6bd13f9084d84b6340d60753b978 | [
"Apache-2.0"
] | null | null | null | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QMessageBox>
#include <QDebug>
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(this);
}
MainWindow::~MainWindow()
{
delete ui;
}
void MainWindow::on_pushButton_clicked()
{
QMessageBox:... | 20.862069 | 103 | 0.636364 | orthoWitch |
0de69b676def4b06bd314dfdd1dbf06961d598ea | 1,987 | inl | C++ | include/Nazara/Renderer/ShaderBuilder.inl | AntoineJT/NazaraEngine | e0b05a7e7a2779e20a593b4083b4a881cc57ce14 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | include/Nazara/Renderer/ShaderBuilder.inl | AntoineJT/NazaraEngine | e0b05a7e7a2779e20a593b4083b4a881cc57ce14 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | include/Nazara/Renderer/ShaderBuilder.inl | AntoineJT/NazaraEngine | e0b05a7e7a2779e20a593b4083b4a881cc57ce14 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | // Copyright (C) 2016 Jérôme Leclercq
// This file is part of the "Nazara Engine - Renderer module"
// For conditions of distribution and use, see copyright notice in Config.hpp
#include <Nazara/Renderer/ShaderBuilder.hpp>
#include <Nazara/Renderer/Debug.hpp>
namespace Nz { namespace ShaderBuilder
{
template<typenam... | 33.116667 | 150 | 0.739809 | AntoineJT |
0df0d2d980557624e8cef36ad62f2c6d03e28351 | 2,939 | cpp | C++ | SyscallDumper/main.cpp | Nerlant/SyscallDumper | 89c3e8e20119cf0c8c339f7620375e2fbd478927 | [
"MIT"
] | 20 | 2019-12-24T05:17:35.000Z | 2021-08-07T05:29:13.000Z | SyscallDumper/main.cpp | Nerlant/SyscallDumper | 89c3e8e20119cf0c8c339f7620375e2fbd478927 | [
"MIT"
] | null | null | null | SyscallDumper/main.cpp | Nerlant/SyscallDumper | 89c3e8e20119cf0c8c339f7620375e2fbd478927 | [
"MIT"
] | 7 | 2019-12-24T05:41:11.000Z | 2020-05-10T22:14:21.000Z |
#include <Windows.h>
#include <fstream>
#include <memory>
#include <cstdint>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <string>
template<class T = void*>
T RvaToVa(PIMAGE_NT_HEADERS nt_headers, char* image_base, uintptr_t rva)
{
auto getEnclosingSectionHeader = [&]() -> PIMAGE_SECTION_HEADER
{... | 31.265957 | 157 | 0.71555 | Nerlant |
0df9f590fbd72930ba5426cc87c399f81bd1378b | 12,959 | cpp | C++ | CHE/io/HByteConvert.cpp | CUITCHE/CHE.Network.cpp | 9f102b5a3ff585c6756e63574b461d71a767decc | [
"MIT"
] | null | null | null | CHE/io/HByteConvert.cpp | CUITCHE/CHE.Network.cpp | 9f102b5a3ff585c6756e63574b461d71a767decc | [
"MIT"
] | null | null | null | CHE/io/HByteConvert.cpp | CUITCHE/CHE.Network.cpp | 9f102b5a3ff585c6756e63574b461d71a767decc | [
"MIT"
] | null | null | null | #include "HByteConvert.h"
#include <stdio.h>
#include <stdlib.h>
#include <locale.h>
#include <cassert>
CHE_NAMESPACE_BEGIN
DATATYPESET HByteConvert::_convertDataTypeCollection;
string HByteConvert::ws2s(const wstring &ws)
{
string curLocale = setlocale(LC_ALL, NULL); // curLocale = "C";
setlocale(LC_ALL, "c... | 24.590133 | 78 | 0.665869 | CUITCHE |
df0438c6e92f5a896f8a86d411d0dd99d5462aff | 910 | hpp | C++ | shared_model/backend/plain/domain.hpp | akshatkarani/iroha | 5acef9dd74720c6185360d951e9b11be4ef73260 | [
"Apache-2.0"
] | 1,467 | 2016-10-25T12:27:19.000Z | 2022-03-28T04:32:05.000Z | shared_model/backend/plain/domain.hpp | akshatkarani/iroha | 5acef9dd74720c6185360d951e9b11be4ef73260 | [
"Apache-2.0"
] | 2,366 | 2016-10-25T10:07:57.000Z | 2022-03-31T22:03:24.000Z | shared_model/backend/plain/domain.hpp | akshatkarani/iroha | 5acef9dd74720c6185360d951e9b11be4ef73260 | [
"Apache-2.0"
] | 662 | 2016-10-26T04:41:22.000Z | 2022-03-31T04:15:02.000Z | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#ifndef IROHA_SHARED_MODEL_PLAIN_DOMAIN_HPP
#define IROHA_SHARED_MODEL_PLAIN_DOMAIN_HPP
#include "interfaces/common_objects/domain.hpp"
#include "interfaces/common_objects/types.hpp"
namespace shared_model {
names... | 27.575758 | 71 | 0.737363 | akshatkarani |
df0572c7a7727ed9b03a627e2cd179d045a053cd | 6,414 | cpp | C++ | Oblig2/PhysicsEngine.cpp | RyanTorant/simple-physx | a065a9c734c134074c63c80a9109a398b22d040c | [
"Unlicense"
] | 1 | 2019-12-09T16:03:55.000Z | 2019-12-09T16:03:55.000Z | Oblig2/PhysicsEngine.cpp | RyanTorant/simple-physx | a065a9c734c134074c63c80a9109a398b22d040c | [
"Unlicense"
] | null | null | null | Oblig2/PhysicsEngine.cpp | RyanTorant/simple-physx | a065a9c734c134074c63c80a9109a398b22d040c | [
"Unlicense"
] | null | null | null | #include "PhysicsEngine.h"
#include <chrono>
PhysicsEngine::ErrorLogger PhysicsEngine::ErrorCallback;
PxDefaultAllocator PhysicsEngine::Allocator;
PhysicsEngine::~PhysicsEngine()
{
if (GlobalScene)
GlobalScene->release();
if (Dispatcher)
Dispatcher->release();
if (Physics)
Physics->release();
if (PVD)
{
... | 27.886957 | 157 | 0.741347 | RyanTorant |
df062277220920056aca384d72091bc21acee2b1 | 14,766 | cpp | C++ | flow/MkCert.cpp | sfc-gh-bvr/foundationdb | 7594f5c0f92d2582dae717ce0244c11642b27dd4 | [
"Apache-2.0"
] | null | null | null | flow/MkCert.cpp | sfc-gh-bvr/foundationdb | 7594f5c0f92d2582dae717ce0244c11642b27dd4 | [
"Apache-2.0"
] | null | null | null | flow/MkCert.cpp | sfc-gh-bvr/foundationdb | 7594f5c0f92d2582dae717ce0244c11642b27dd4 | [
"Apache-2.0"
] | null | null | null | /*
* MkCert.cpp
*
* This source file is part of the FoundationDB open source project
*
* Copyright 2013-2022 Apple Inc. and the FoundationDB project authors
*
* 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 ... | 37.382278 | 120 | 0.697684 | sfc-gh-bvr |
df06417639a31e1dfee729a0b26871250a217391 | 856 | cc | C++ | type_traits/remove_cvref.cc | pycpp/stl-test | cbae1e77a16c102715c1c0c64ba3f929f78aadef | [
"MIT"
] | null | null | null | type_traits/remove_cvref.cc | pycpp/stl-test | cbae1e77a16c102715c1c0c64ba3f929f78aadef | [
"MIT"
] | null | null | null | type_traits/remove_cvref.cc | pycpp/stl-test | cbae1e77a16c102715c1c0c64ba3f929f78aadef | [
"MIT"
] | null | null | null | // :copyright: (c) 2017-2018 Alex Huszagh.
// :license: MIT, see LICENSE.md for more details.
/*
* \addtogroup Tests
* \brief `remove_cvref` unittests.
*/
#include <pycpp/stl/type_traits/remove_cvref.h>
#include <gtest/gtest.h>
PYCPP_USING_NAMESPACE
// TESTS
// -----
TEST(remove_cvref, remove_cvref)
{
st... | 32.923077 | 85 | 0.690421 | pycpp |
df0964fdde61703a0a7213b88824e398666942fb | 899 | cpp | C++ | leet_code/binary_tree/rightView.cpp | sahilduhan/codeforces | a8042d52c12806e026fd7027e35e97ed8b4eeed6 | [
"MIT"
] | null | null | null | leet_code/binary_tree/rightView.cpp | sahilduhan/codeforces | a8042d52c12806e026fd7027e35e97ed8b4eeed6 | [
"MIT"
] | null | null | null | leet_code/binary_tree/rightView.cpp | sahilduhan/codeforces | a8042d52c12806e026fd7027e35e97ed8b4eeed6 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
struct TreeNode
{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(): val(0), left(nullptr), right(nullptr) {}
TreeNode(int x): val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode* left, TreeNode* right): val(x), left(left), right(rig... | 25.685714 | 89 | 0.498331 | sahilduhan |
df09a90d5ebc6d66d817f8134c6ca75c28082158 | 828 | cpp | C++ | Siv3D/src/ThirdParty/lunasvg/svgpathelement.cpp | nokotan/siv6 | 7df183550a6c0160ba918d6ad24c3ae48231e26b | [
"MIT"
] | 1 | 2020-05-16T14:13:04.000Z | 2020-05-16T14:13:04.000Z | Siv3D/src/ThirdParty/lunasvg/svgpathelement.cpp | nokotan/siv6 | 7df183550a6c0160ba918d6ad24c3ae48231e26b | [
"MIT"
] | null | null | null | Siv3D/src/ThirdParty/lunasvg/svgpathelement.cpp | nokotan/siv6 | 7df183550a6c0160ba918d6ad24c3ae48231e26b | [
"MIT"
] | null | null | null | #include "svgpathelement.h"
namespace lunasvg {
SVGPathElement::SVGPathElement(SVGDocument *document) :
SVGGeometryElement(ElementIdPath, document),
m_d(DOMPropertyIdD)
{
addToPropertyMap(m_d);
}
Path SVGPathElement::makePath(const RenderState&) const
{
return m_d.property()->value();
}
Rect SVGPath... | 19.714286 | 66 | 0.704106 | nokotan |
df0cc0584c20635ed0c1bf551cb33223da674d80 | 30 | cpp | C++ | benchmarks/include/mpl11.min.erb.cpp | ldionne/benchcc | 87cd508b47b39c9da5fb2152ec3f07de62297771 | [
"BSL-1.0"
] | 1 | 2017-10-12T11:54:43.000Z | 2017-10-12T11:54:43.000Z | benchmarks/include/mpl11.min.erb.cpp | ldionne/benchcc | 87cd508b47b39c9da5fb2152ec3f07de62297771 | [
"BSL-1.0"
] | null | null | null | benchmarks/include/mpl11.min.erb.cpp | ldionne/benchcc | 87cd508b47b39c9da5fb2152ec3f07de62297771 | [
"BSL-1.0"
] | null | null | null | #include <boost/mpl11.min.hpp> | 30 | 30 | 0.766667 | ldionne |
df10176a1456f058a91b8d2845d7763e2770a302 | 140 | cpp | C++ | Lab0/Module1.cpp | Eistern/17206-Zulin-Labs | d07f2c942c4ac4522c9eada0fc30eb4a332a3f9f | [
"MIT"
] | null | null | null | Lab0/Module1.cpp | Eistern/17206-Zulin-Labs | d07f2c942c4ac4522c9eada0fc30eb4a332a3f9f | [
"MIT"
] | null | null | null | Lab0/Module1.cpp | Eistern/17206-Zulin-Labs | d07f2c942c4ac4522c9eada0fc30eb4a332a3f9f | [
"MIT"
] | null | null | null | #include "Module1.h"
namespace Module1
{
std::string getMyName()
{
std::string name = "John";
return name;
}
}
| 12.727273 | 34 | 0.542857 | Eistern |
df11c53fdd1dc265f1bd7528a8245261b1dbc2a1 | 8,640 | cpp | C++ | src/backtester/TickGenerator.cpp | paps/Open-Trading | b62f85f391be9975a161713f87aeff0cae0a1e37 | [
"BSD-2-Clause"
] | 23 | 2015-07-24T15:45:36.000Z | 2021-11-23T15:35:33.000Z | src/backtester/TickGenerator.cpp | paps/Open-Trading | b62f85f391be9975a161713f87aeff0cae0a1e37 | [
"BSD-2-Clause"
] | null | null | null | src/backtester/TickGenerator.cpp | paps/Open-Trading | b62f85f391be9975a161713f87aeff0cae0a1e37 | [
"BSD-2-Clause"
] | 21 | 2015-07-12T16:42:01.000Z | 2020-08-23T22:56:50.000Z | // The Open Trading Project - open-trading.org
//
// Copyright (c) 2011 Martin Tapia - martin.tapia@open-trading.org
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributio... | 40 | 156 | 0.544792 | paps |
df1411ccbf54ff4c863292ddc46e2123e034a1cd | 1,114 | cc | C++ | src/114_flatten-binary-tree-to-linked-list.cc | q191201771/yoko_leetcode | a29b163169f409856e9c9808890bcb25ca976f78 | [
"MIT"
] | 2 | 2018-07-28T06:11:30.000Z | 2019-01-15T15:16:54.000Z | src/114_flatten-binary-tree-to-linked-list.cc | q191201771/yoko_leetcode | a29b163169f409856e9c9808890bcb25ca976f78 | [
"MIT"
] | null | null | null | src/114_flatten-binary-tree-to-linked-list.cc | q191201771/yoko_leetcode | a29b163169f409856e9c9808890bcb25ca976f78 | [
"MIT"
] | null | null | null | // Given a binary tree, flatten it to a linked list in-place.
//
// For example, given the following tree:
//
// 1
// / \
// 2 5
// / \ \
// 3 4 6
// The flattened tree should look like:
//
// 1
// \
// 2
// \
// 3
// \
// 4
// \
// 5
// \
// 6
... | 19.206897 | 78 | 0.493716 | q191201771 |
df16cfbc43d6c923158fd70b144f1c999c74c0d9 | 4,039 | cpp | C++ | Gems/Atom/Tools/AtomToolsFramework/Code/Tests/AtomToolsFrameworkTest.cpp | TheKeaver/o3de | 3791149c6bb18d007ee375f592bdd031871f793d | [
"Apache-2.0",
"MIT"
] | 1 | 2021-08-11T02:20:46.000Z | 2021-08-11T02:20:46.000Z | Gems/Atom/Tools/AtomToolsFramework/Code/Tests/AtomToolsFrameworkTest.cpp | RoddieKieley/o3de | e804fd2a4241b039a42d9fa54eaae17dc94a7a92 | [
"Apache-2.0",
"MIT"
] | null | null | null | Gems/Atom/Tools/AtomToolsFramework/Code/Tests/AtomToolsFrameworkTest.cpp | RoddieKieley/o3de | e804fd2a4241b039a42d9fa54eaae17dc94a7a92 | [
"Apache-2.0",
"MIT"
] | null | null | null | /*
* Copyright (c) Contributors to the Open 3D Engine Project.
* For complete copyright and license terms please see the LICENSE at the root of this distribution.
*
* SPDX-License-Identifier: Apache-2.0 OR MIT
*
*/
#include <AzTest/AzTest.h>
#include <Atom/Utils/TestUtils/AssetSystemStub.h>
#include <AtomToolsFr... | 51.782051 | 220 | 0.694726 | TheKeaver |
df17e6d56363be3e65b1829713daf59c85f5d89c | 729 | cpp | C++ | LeetCode/687.Longest_Univalue_Path.cpp | w181496/OJ | 67d1d32770376865eba8a9dd1767e97dae68989a | [
"MIT"
] | 9 | 2017-10-08T16:22:03.000Z | 2021-08-20T09:32:17.000Z | LeetCode/687.Longest_Univalue_Path.cpp | w181496/OJ | 67d1d32770376865eba8a9dd1767e97dae68989a | [
"MIT"
] | null | null | null | LeetCode/687.Longest_Univalue_Path.cpp | w181496/OJ | 67d1d32770376865eba8a9dd1767e97dae68989a | [
"MIT"
] | 2 | 2018-01-15T16:35:44.000Z | 2019-03-21T18:30:04.000Z | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int longestUnivaluePath(TreeNode* root) {
int ans = 0;
find(root, ans);
... | 25.137931 | 63 | 0.492455 | w181496 |
df1fd94d698e594f2648c6836684b55cfa8e3785 | 3,506 | cc | C++ | src/app/main.cc | JeanTracker/qt-qml-project-template-with-ci | 022992af4bd4e4df006a3125fe124a56a25c23a5 | [
"BSD-2-Clause"
] | null | null | null | src/app/main.cc | JeanTracker/qt-qml-project-template-with-ci | 022992af4bd4e4df006a3125fe124a56a25c23a5 | [
"BSD-2-Clause"
] | null | null | null | src/app/main.cc | JeanTracker/qt-qml-project-template-with-ci | 022992af4bd4e4df006a3125fe124a56a25c23a5 | [
"BSD-2-Clause"
] | null | null | null | //
// Copyright (c) 2020, 219 Design, LLC
// See LICENSE.txt
//
// https://www.219design.com
// Software | Electrical | Mechanical | Product Design
//
#include <QGuiApplication>
#include <QQmlApplicationEngine>
#include <QQuickStyle>
#include "autogenerated/version.h" // USE THIS INCLUDE SPARINGLY. IT CAN TRIGGER REB... | 43.283951 | 115 | 0.67741 | JeanTracker |
b3001cd9dca2fec92853765f70b6a3c3d674c66e | 3,538 | cpp | C++ | modules/io/bitcount_benchmark.cpp | spiralgenetics/biograph | 33c78278ce673e885f38435384f9578bfbf9cdb8 | [
"BSD-2-Clause"
] | 16 | 2021-07-14T23:32:31.000Z | 2022-03-24T16:25:15.000Z | modules/io/bitcount_benchmark.cpp | spiralgenetics/biograph | 33c78278ce673e885f38435384f9578bfbf9cdb8 | [
"BSD-2-Clause"
] | 9 | 2021-07-20T20:39:47.000Z | 2021-09-16T20:57:59.000Z | modules/io/bitcount_benchmark.cpp | spiralgenetics/biograph | 33c78278ce673e885f38435384f9578bfbf9cdb8 | [
"BSD-2-Clause"
] | 9 | 2021-07-15T19:38:35.000Z | 2022-01-31T19:24:56.000Z | #include "modules/io/bitcount.h"
#include "benchmark/benchmark.h"
#include <iomanip>
#include <iostream>
#include <random>
namespace {
const size_t nbits = 16ULL * 1024 * 1024 * 1024;
size_t bufsize = 0;
char* bcbuf = nullptr;
std::unique_ptr<bitcount> bc;
size_t seed = time(0);
std::mt19937_64 random_source(seed... | 23.905405 | 78 | 0.652063 | spiralgenetics |
b300462d0cc129dc0951fdd26952b5ad963cc218 | 712 | cpp | C++ | UVa 13038 - Directed Forest/sample/13038 - Directed Forest.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2020-11-24T03:17:21.000Z | 2020-11-24T03:17:21.000Z | UVa 13038 - Directed Forest/sample/13038 - Directed Forest.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | null | null | null | UVa 13038 - Directed Forest/sample/13038 - Directed Forest.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2021-04-11T16:22:31.000Z | 2021-04-11T16:22:31.000Z | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 131072;
vector<int> g[MAXN];
int indeg[MAXN];
int dfs(int u) {
int ret = 1;
for (auto &v : g[u])
ret = max(ret, dfs(v)+1);
return ret;
}
int solve(int root, int N) {
return dfs(root);
}
int main() {
int testcase, cases = 0;
int N, M, u, v;
scanf("... | 18.25641 | 40 | 0.505618 | tadvi |
b3018ed8c9a08a6736a0df27939557770c4f67bb | 1,161 | cc | C++ | samples/06-looping/do_while_loop/main.cc | brockus/the_cpp_tutorial | 87d73fa7111dd6fe22299b01edc5663bfd192782 | [
"Apache-2.0"
] | null | null | null | samples/06-looping/do_while_loop/main.cc | brockus/the_cpp_tutorial | 87d73fa7111dd6fe22299b01edc5663bfd192782 | [
"Apache-2.0"
] | null | null | null | samples/06-looping/do_while_loop/main.cc | brockus/the_cpp_tutorial | 87d73fa7111dd6fe22299b01edc5663bfd192782 | [
"Apache-2.0"
] | null | null | null | //
// author: Michael Brockus
// gmail : <michaelbrockus@gmail.com>
//
#include <iostream>
#include <cstdlib>
int main()
{
//
// To run a block of code repeatedly in a predetermined
// time, you use the for loop statement. In cases you
// want to run a block of code repeatedly based on a
// given c... | 27.642857 | 68 | 0.63652 | brockus |
b305adef83ef8dcb74344a6b7039844e1bc9def9 | 1,778 | cpp | C++ | CastleDoctrine/gameSource/FastBoxBlurFilter.cpp | PhilipLudington/CastleDoctrine | 443f2b6b0215a6d71515c8887c99b4322965622e | [
"Unlicense"
] | 1 | 2020-01-16T00:07:11.000Z | 2020-01-16T00:07:11.000Z | CastleDoctrine/gameSource/FastBoxBlurFilter.cpp | PhilipLudington/CastleDoctrine | 443f2b6b0215a6d71515c8887c99b4322965622e | [
"Unlicense"
] | null | null | null | CastleDoctrine/gameSource/FastBoxBlurFilter.cpp | PhilipLudington/CastleDoctrine | 443f2b6b0215a6d71515c8887c99b4322965622e | [
"Unlicense"
] | 2 | 2019-09-17T12:08:20.000Z | 2020-09-26T00:54:48.000Z | #include "FastBoxBlurFilter.h"
#include <string.h>
FastBoxBlurFilter::FastBoxBlurFilter() {
}
void FastBoxBlurFilter::applySubRegion( unsigned char *inChannel,
int *inTouchPixelIndices,
int inNumTouchPixels,
... | 24.694444 | 72 | 0.568616 | PhilipLudington |
b30a3afe090e14054c69844fa0888371e872001c | 844 | cpp | C++ | Dynamic Programming/0-1 Knapsack/(6)CountOfSubsetDiff.cpp | jaydulera/data-structure-and-algorithms | abc2d67871add6f314888a72215ff3a2da2dc6e1 | [
"Apache-2.0"
] | 53 | 2020-09-26T19:44:33.000Z | 2021-09-30T20:38:52.000Z | Dynamic Programming/0-1 Knapsack/(6)CountOfSubsetDiff.cpp | jaydulera/data-structure-and-algorithms | abc2d67871add6f314888a72215ff3a2da2dc6e1 | [
"Apache-2.0"
] | 197 | 2020-08-25T18:13:56.000Z | 2021-06-19T07:26:19.000Z | Dynamic Programming/0-1 Knapsack/(6)CountOfSubsetDiff.cpp | jaydulera/data-structure-and-algorithms | abc2d67871add6f314888a72215ff3a2da2dc6e1 | [
"Apache-2.0"
] | 204 | 2020-08-24T09:21:02.000Z | 2022-02-13T06:13:42.000Z | #include<bits/stdc++.h>
using namespace std;
int t[100][100];
// LeetCode Target sum ques
int CountSubsetGivenSum(int *wt, int Sum, int n) {
for (int i = 0; i <= Sum; i++) t[0][i] = 0;
for (int i = 0; i <= n; i++) t[i][0] = 1; //empty set
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= Sum; j++) {
if ... | 18.347826 | 69 | 0.50237 | jaydulera |
b30d10103431820beadc98732b0b43a20758dbbd | 3,475 | cpp | C++ | Source/Common/Src/Memory/RangeAllocator.cpp | vasumahesh1/azura | 80aa23e2fb498e6288484bc49b0d5b8889db6ebb | [
"MIT"
] | 12 | 2019-01-08T23:10:37.000Z | 2021-06-04T09:48:42.000Z | Source/Common/Src/Memory/RangeAllocator.cpp | vasumahesh1/azura | 80aa23e2fb498e6288484bc49b0d5b8889db6ebb | [
"MIT"
] | 38 | 2017-04-05T00:27:24.000Z | 2018-12-25T08:34:04.000Z | Source/Common/Src/Memory/RangeAllocator.cpp | vasumahesh1/azura | 80aa23e2fb498e6288484bc49b0d5b8889db6ebb | [
"MIT"
] | 4 | 2019-03-27T10:07:32.000Z | 2021-07-15T03:22:27.000Z | #include "Memory/RangeAllocator.h"
#include "Memory/MemoryBuffer.h"
namespace Azura {
namespace Memory {
namespace {
/**
* \brief Finds the next largest Aligned multiple according to the input size
* \param size Size of Bytes to Allocate
* \param alignment Alignment of the data to allocate
* \return Ne... | 30.752212 | 109 | 0.688058 | vasumahesh1 |
b30da676a7caee2ef266513e36e81e6522c5994f | 3,909 | hpp | C++ | pybnesian/learning/scores/scores.hpp | vishalbelsare/PyBNesian | 0190cd4cf6d133746741e2750004ccf0a9061fbd | [
"MIT"
] | 8 | 2021-06-22T19:21:12.000Z | 2022-03-26T13:08:05.000Z | pybnesian/learning/scores/scores.hpp | vishalbelsare/PyBNesian | 0190cd4cf6d133746741e2750004ccf0a9061fbd | [
"MIT"
] | null | null | null | pybnesian/learning/scores/scores.hpp | vishalbelsare/PyBNesian | 0190cd4cf6d133746741e2750004ccf0a9061fbd | [
"MIT"
] | 3 | 2021-08-20T13:44:46.000Z | 2022-03-27T02:57:02.000Z | #ifndef PYBNESIAN_LEARNING_SCORES_SCORES_HPP
#define PYBNESIAN_LEARNING_SCORES_SCORES_HPP
#include <models/GaussianNetwork.hpp>
#include <models/SemiparametricBN.hpp>
#include <dataset/dynamic_dataset.hpp>
using dataset::DynamicDataFrame, dataset::DynamicAdaptator;
using models::BayesianNetworkBase, models::GaussianN... | 36.877358 | 120 | 0.658736 | vishalbelsare |
b30ed7b2523b1e1d820217fed82ab8f66189698e | 363 | cpp | C++ | 09_lambda/09_07_generic_lambda_capture_expressions/09_07_00_generic_lambda_capture_expressions.cpp | pAbogn/cpp_courses | 6ffa7da5cc440af3327139a38cfdefcfaae1ebed | [
"MIT"
] | 13 | 2020-09-01T14:57:21.000Z | 2021-11-24T06:00:26.000Z | 09_lambda/09_07_generic_lambda_capture_expressions/09_07_00_generic_lambda_capture_expressions.cpp | pAbogn/cpp_courses | 6ffa7da5cc440af3327139a38cfdefcfaae1ebed | [
"MIT"
] | 5 | 2020-06-11T14:13:00.000Z | 2021-07-14T05:27:53.000Z | 09_lambda/09_07_generic_lambda_capture_expressions/09_07_00_generic_lambda_capture_expressions.cpp | pAbogn/cpp_courses | 6ffa7da5cc440af3327139a38cfdefcfaae1ebed | [
"MIT"
] | 10 | 2021-03-22T07:54:36.000Z | 2021-09-15T04:03:32.000Z | // Generic lambda
// Capture expressions
#include <iostream>
#include <vector>
class move_only
{
public:
move_only() = default;
move_only(move_only&& other) = default;
};
int main() {
[](auto x){};
move_only mo;
[mo](){}(); // how to fix
int a{};
int b{};
// capture sum
// type... | 12.964286 | 43 | 0.564738 | pAbogn |
b30ffaede353aba08afbb5b713d9f296fd70fce9 | 2,175 | cxx | C++ | smtk/attribute/ComponentItemDefinition.cxx | jcfr/SMTK | 0069ea37f8f71a440b8f10a157b84a56ca004551 | [
"BSD-3-Clause-Clear"
] | 40 | 2015-02-21T19:55:54.000Z | 2022-01-06T13:13:05.000Z | smtk/attribute/ComponentItemDefinition.cxx | jcfr/SMTK | 0069ea37f8f71a440b8f10a157b84a56ca004551 | [
"BSD-3-Clause-Clear"
] | 127 | 2015-01-15T20:55:45.000Z | 2021-08-19T17:34:15.000Z | smtk/attribute/ComponentItemDefinition.cxx | jcfr/SMTK | 0069ea37f8f71a440b8f10a157b84a56ca004551 | [
"BSD-3-Clause-Clear"
] | 27 | 2015-03-04T14:17:51.000Z | 2021-12-23T01:05:42.000Z | //=========================================================================
// Copyright (c) Kitware, Inc.
// All rights reserved.
// See LICENSE.txt for details.
//
// This software is distributed WITHOUT ANY WARRANTY; without even
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
// PURPOSE... | 29.794521 | 98 | 0.711724 | jcfr |
b310c32bc0bc1ed676d6841e2f40f15979ad8fc3 | 1,180 | cpp | C++ | src/main.cpp | int08h/SumoJam-Line-Sensors-Example | b5c5cfd15e7deb5446b3097f9dee31c796685c65 | [
"Unlicense"
] | null | null | null | src/main.cpp | int08h/SumoJam-Line-Sensors-Example | b5c5cfd15e7deb5446b3097f9dee31c796685c65 | [
"Unlicense"
] | null | null | null | src/main.cpp | int08h/SumoJam-Line-Sensors-Example | b5c5cfd15e7deb5446b3097f9dee31c796685c65 | [
"Unlicense"
] | null | null | null | //
// Example how to read the Zumo32U4 line sensors
//
#include <Zumo32U4.h>
namespace {
// Delay between loop()s in milliseconds
constexpr unsigned long DELAY_MS = 100;
// Line sensors interface
Zumo32U4LineSensors lineSensors = Zumo32U4LineSensors{};
// Enable the LCD Screen
Zumo32U4LCD lcd = Zumo32U4... | 21.454545 | 61 | 0.668644 | int08h |
b314b54045963787d616d62b053d379759f5fb49 | 283 | hpp | C++ | src/tests/functional/plugin/shared/include/single_layer_tests/einsum.hpp | wood-ghost/openvino | 0babf20bd2f4cd3f0be3c025d91ea55526b36fb2 | [
"Apache-2.0"
] | 1,127 | 2018-10-15T14:36:58.000Z | 2020-04-20T09:29:44.000Z | src/tests/functional/plugin/shared/include/single_layer_tests/einsum.hpp | wood-ghost/openvino | 0babf20bd2f4cd3f0be3c025d91ea55526b36fb2 | [
"Apache-2.0"
] | 439 | 2018-10-20T04:40:35.000Z | 2020-04-19T05:56:25.000Z | src/tests/functional/plugin/shared/include/single_layer_tests/einsum.hpp | tuxedcat/openvino | 5939cb1b363ebb56b73c2ad95d8899961a084677 | [
"Apache-2.0"
] | 414 | 2018-10-17T05:53:46.000Z | 2020-04-16T17:29:53.000Z | // Copyright (C) 2022 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include "shared_test_classes/single_layer/einsum.hpp"
namespace LayerTestsDefinitions {
TEST_P(EinsumLayerTest, CompareWithRefs) {
Run();
}
} // namespace LayerTestsDefinitions
| 17.6875 | 54 | 0.759717 | wood-ghost |
b31636287ed68f8f3b2037eb8d1dfc484fece7b2 | 869 | cpp | C++ | Leetcode/Day023/string_to_int_atoi.cpp | SujalAhrodia/Practice_2020 | 59b371ada245ed8253d12327f18deee3e47f31d6 | [
"MIT"
] | null | null | null | Leetcode/Day023/string_to_int_atoi.cpp | SujalAhrodia/Practice_2020 | 59b371ada245ed8253d12327f18deee3e47f31d6 | [
"MIT"
] | null | null | null | Leetcode/Day023/string_to_int_atoi.cpp | SujalAhrodia/Practice_2020 | 59b371ada245ed8253d12327f18deee3e47f31d6 | [
"MIT"
] | null | null | null | /*
Imp to remember: erasing string mechanism | isdigit() | str.erase()
*/
class Solution {
public:
int myAtoi(string str)
{
long long int ans=0;
string temp=str;
bool pos=true;
while(temp[0]==' ')
temp.erase(temp.begin());
if(temp[0]=='-'... | 18.891304 | 67 | 0.352129 | SujalAhrodia |
b3169991554b43dcb993a85a054ccb07c974c53c | 8,881 | cpp | C++ | src/state/StateVector.cpp | neophack/steam | 28f0637e3ae4ff2c21ad12b2331c535e9873c997 | [
"BSD-3-Clause"
] | null | null | null | src/state/StateVector.cpp | neophack/steam | 28f0637e3ae4ff2c21ad12b2331c535e9873c997 | [
"BSD-3-Clause"
] | null | null | null | src/state/StateVector.cpp | neophack/steam | 28f0637e3ae4ff2c21ad12b2331c535e9873c997 | [
"BSD-3-Clause"
] | null | null | null | //////////////////////////////////////////////////////////////////////////////////////////////
/// \file StateVector.cpp
///
/// \author Sean Anderson, ASRL
//////////////////////////////////////////////////////////////////////////////////////////////
#include <steam/state/StateVector.hpp>
#include <steam/blockmat/Blo... | 41.306977 | 131 | 0.515145 | neophack |
b317e81ff1a1e7f9dc81cff75135cbb04210ca85 | 1,074 | cc | C++ | bin/zxdb/client/thread_impl_test_support.cc | PowerOlive/garnet | 16b5b38b765195699f41ccb6684cc58dd3512793 | [
"BSD-3-Clause"
] | null | null | null | bin/zxdb/client/thread_impl_test_support.cc | PowerOlive/garnet | 16b5b38b765195699f41ccb6684cc58dd3512793 | [
"BSD-3-Clause"
] | null | null | null | bin/zxdb/client/thread_impl_test_support.cc | PowerOlive/garnet | 16b5b38b765195699f41ccb6684cc58dd3512793 | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2018 The Fuchsia 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 "garnet/bin/zxdb/client/thread_impl_test_support.h"
#include "garnet/bin/zxdb/client/thread.h"
#include "garnet/bin/zxdb/common/err.h"
namespace... | 29.833333 | 76 | 0.759777 | PowerOlive |
b319184ac9b6fc21959e9ad978f1b468791faacd | 1,431 | cpp | C++ | leetcode/problems/hard/115-distinct-subsequences.cpp | wingkwong/competitive-programming | e8bf7aa32e87b3a020b63acac20e740728764649 | [
"MIT"
] | 18 | 2020-08-27T05:27:50.000Z | 2022-03-08T02:56:48.000Z | leetcode/problems/hard/115-distinct-subsequences.cpp | wingkwong/competitive-programming | e8bf7aa32e87b3a020b63acac20e740728764649 | [
"MIT"
] | null | null | null | leetcode/problems/hard/115-distinct-subsequences.cpp | wingkwong/competitive-programming | e8bf7aa32e87b3a020b63acac20e740728764649 | [
"MIT"
] | 1 | 2020-10-13T05:23:58.000Z | 2020-10-13T05:23:58.000Z | /*
Distinct Subsequences
https://leetcode.com/problems/distinct-subsequences/
Given two strings s and t, return the number of distinct subsequences of s which equals t.
A string's subsequence is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remain... | 24.672414 | 246 | 0.594689 | wingkwong |
b31a116dfe80be72926d7f7dfe00938e3c20b5db | 21,701 | hpp | C++ | Project/include/lak/transform.hpp | LAK132/OpenGL-Trash | 9ddedf65792de78f642f47ad032b5027e4c390c1 | [
"MIT"
] | null | null | null | Project/include/lak/transform.hpp | LAK132/OpenGL-Trash | 9ddedf65792de78f642f47ad032b5027e4c390c1 | [
"MIT"
] | null | null | null | Project/include/lak/transform.hpp | LAK132/OpenGL-Trash | 9ddedf65792de78f642f47ad032b5027e4c390c1 | [
"MIT"
] | null | null | null | /*
MIT License
Copyright (c) 2018 Lucas Kleiss (LAK132)
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, p... | 33.592879 | 170 | 0.516059 | LAK132 |
b31e07989aeebeb61c6c758cbd2368a8c67891dc | 8,707 | cpp | C++ | ze_imu/src/imu_buffer.cpp | rockenbf/ze_oss | ee04158e2d51acb07a267196f618e9afbc3ffd83 | [
"BSD-3-Clause"
] | 30 | 2016-09-27T07:41:28.000Z | 2021-12-03T20:44:28.000Z | ze_imu/src/imu_buffer.cpp | rockenbf/ze_oss | ee04158e2d51acb07a267196f618e9afbc3ffd83 | [
"BSD-3-Clause"
] | 1 | 2018-12-18T15:53:06.000Z | 2018-12-21T03:10:06.000Z | ze_imu/src/imu_buffer.cpp | rockenbf/ze_oss | ee04158e2d51acb07a267196f618e9afbc3ffd83 | [
"BSD-3-Clause"
] | 12 | 2016-11-05T07:51:29.000Z | 2020-07-13T02:26:08.000Z | // Copyright (c) 2015-2016, ETH Zurich, Wyss Zurich, Zurich Eye
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
// * Redistributions of source code must retain the above copyright
// ... | 37.856522 | 90 | 0.733892 | rockenbf |
b31e1924b3771d8de37591c535cf466976b452ee | 5,623 | cc | C++ | pmlc/dialect/stdx/transforms/split_closure.cc | IsolatedMy/plaidml | 34538a9224e770fd79151105399d8d7ea08678c0 | [
"Apache-2.0"
] | null | null | null | pmlc/dialect/stdx/transforms/split_closure.cc | IsolatedMy/plaidml | 34538a9224e770fd79151105399d8d7ea08678c0 | [
"Apache-2.0"
] | null | null | null | pmlc/dialect/stdx/transforms/split_closure.cc | IsolatedMy/plaidml | 34538a9224e770fd79151105399d8d7ea08678c0 | [
"Apache-2.0"
] | null | null | null | // Copyright 2021 Intel Corporation
#include "mlir/Dialect/MemRef/IR/MemRef.h"
#include "mlir/Dialect/StandardOps/IR/Ops.h"
#include "mlir/IR/ImplicitLocOpBuilder.h"
#include "mlir/IR/Matchers.h"
#include "mlir/Transforms/RegionUtils.h"
#include "pmlc/dialect/stdx/transforms/pass_detail.h"
#include "pmlc/dialect/stdx... | 34.709877 | 79 | 0.667971 | IsolatedMy |
b31f20b37b5ecdb9921dbc8412cce7adb328b677 | 3,034 | hpp | C++ | core/injector/block_producing_node_injector.hpp | FlorianFranzen/kagome | 27ee11c78767e72f0ecd2c515c77bebc2ff5758d | [
"Apache-2.0"
] | null | null | null | core/injector/block_producing_node_injector.hpp | FlorianFranzen/kagome | 27ee11c78767e72f0ecd2c515c77bebc2ff5758d | [
"Apache-2.0"
] | null | null | null | core/injector/block_producing_node_injector.hpp | FlorianFranzen/kagome | 27ee11c78767e72f0ecd2c515c77bebc2ff5758d | [
"Apache-2.0"
] | null | null | null | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#ifndef KAGOME_CORE_INJECTOR_BLOCK_PRODUCING_NODE_INJECTOR_HPP
#define KAGOME_CORE_INJECTOR_BLOCK_PRODUCING_NODE_INJECTOR_HPP
#include "application/app_config.hpp"
#include "application/impl/local_key_storage.hpp"
#in... | 41 | 108 | 0.649637 | FlorianFranzen |
b320f1f2824b2938836eba833807f18832e371eb | 5,423 | cpp | C++ | src/CourseContentsList.cpp | Midiman/stepmania | a55d5d614c4caa8b035b9b7cdca94017baba026b | [
"MIT"
] | 1 | 2019-02-13T07:01:27.000Z | 2019-02-13T07:01:27.000Z | src/CourseContentsList.cpp | Tatsh/stepmania | bff04ba72e9d578e922fd830819515559b535c45 | [
"MIT"
] | null | null | null | src/CourseContentsList.cpp | Tatsh/stepmania | bff04ba72e9d578e922fd830819515559b535c45 | [
"MIT"
] | null | null | null | #include "global.h"
#include "CourseContentsList.h"
#include "GameConstantsAndTypes.h"
#include "RageLog.h"
#include "Course.h"
#include "Trail.h"
#include "GameState.h"
#include "XmlFile.h"
#include "ActorUtil.h"
#include "RageUtil.h"
#include "Steps.h"
REGISTER_ACTOR_CLASS( CourseContentsList );
CourseContentsList:... | 28.244792 | 124 | 0.698506 | Midiman |
b32301da1cb7c2a96f6380fd55244a4d53b7a467 | 1,156 | cpp | C++ | IocpServer/IocpHandler.cpp | askldjd/iocp-server | ac6b4c5b6980fcd3a20664ec1e8dcc024a481c5e | [
"BSL-1.0"
] | 32 | 2016-05-14T18:51:51.000Z | 2022-03-23T14:14:15.000Z | IocpServer/IocpHandler.cpp | askldjd/iocp-server | ac6b4c5b6980fcd3a20664ec1e8dcc024a481c5e | [
"BSL-1.0"
] | 1 | 2021-12-07T09:07:44.000Z | 2021-12-09T21:07:09.000Z | IocpServer/IocpHandler.cpp | askldjd/iocp-server | ac6b4c5b6980fcd3a20664ec1e8dcc024a481c5e | [
"BSL-1.0"
] | 22 | 2015-12-01T12:25:19.000Z | 2022-03-23T14:14:11.000Z | //! Copyright Alan Ning 2010
//! 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)
#include "StdAfx.h"
#include "IocpHandler.h"
#include "IocpServer.h"
namespace iocp {
void CIocpHandler::OnNewConnec... | 17.784615 | 91 | 0.668685 | askldjd |
b3273e345a61d0540a01c6c887b6cd82cb5c672a | 1,818 | cpp | C++ | llvm/lib/Object/TapiUniversal.cpp | medismailben/llvm-project | e334a839032fe500c3bba22bf976ab7af13ce1c1 | [
"Apache-2.0"
] | 4,812 | 2015-01-02T19:38:10.000Z | 2022-03-27T12:42:24.000Z | llvm/lib/Object/TapiUniversal.cpp | medismailben/llvm-project | e334a839032fe500c3bba22bf976ab7af13ce1c1 | [
"Apache-2.0"
] | 71 | 2016-07-26T15:16:53.000Z | 2022-03-31T14:39:47.000Z | llvm/lib/Object/TapiUniversal.cpp | medismailben/llvm-project | e334a839032fe500c3bba22bf976ab7af13ce1c1 | [
"Apache-2.0"
] | 2,543 | 2015-01-01T11:18:36.000Z | 2022-03-22T21:32:36.000Z | //===- TapiUniversal.cpp --------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... | 33.054545 | 80 | 0.610011 | medismailben |
b3277c54f2f9682638c1eabd079b04dc002fd030 | 6,462 | cpp | C++ | software/protoDUNE/protoDUNE/DataDpmSystem.cpp | slaclab/proto-dune | e487ee6d40359b40776098410d7fd302b9631448 | [
"BSD-3-Clause-LBNL"
] | null | null | null | software/protoDUNE/protoDUNE/DataDpmSystem.cpp | slaclab/proto-dune | e487ee6d40359b40776098410d7fd302b9631448 | [
"BSD-3-Clause-LBNL"
] | 2 | 2017-05-11T04:22:27.000Z | 2018-09-18T16:10:29.000Z | software/protoDUNE/protoDUNE/DataDpmSystem.cpp | slaclab/proto-dune | e487ee6d40359b40776098410d7fd302b9631448 | [
"BSD-3-Clause-LBNL"
] | 2 | 2017-04-03T21:59:53.000Z | 2020-12-13T00:14:20.000Z | //-----------------------------------------------------------------------------
// File : DataDpmSystem.h
// Author : Ryan Herbst <rherbst@slac.stanford.edu>
// Created : 06/19/2014
// Project : LBNE DAQ
//-----------------------------------------------------------------------------
// Desc... | 28.59292 | 95 | 0.562674 | slaclab |
b32cbaa75e3a7496f340f5d835fafde175b5877c | 1,233 | cpp | C++ | DSA/Graphs/Topological_Sort.cpp | ShrishtiAgarwal/DSA | 8086cc31bef3aefc06a8ea5c7c36fa4aabe7c1df | [
"MIT"
] | null | null | null | DSA/Graphs/Topological_Sort.cpp | ShrishtiAgarwal/DSA | 8086cc31bef3aefc06a8ea5c7c36fa4aabe7c1df | [
"MIT"
] | null | null | null | DSA/Graphs/Topological_Sort.cpp | ShrishtiAgarwal/DSA | 8086cc31bef3aefc06a8ea5c7c36fa4aabe7c1df | [
"MIT"
] | null | null | null | /*
Topological sort using bfs
*/
class Solution {
public:
vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
int in_degree[numCourses];
for(int i=0;i<numCourses;i++)
in_degree[i]=0;
vector<int>q[numCourses];
vector<int>t;
for(int i=0;i<... | 22.418182 | 79 | 0.394972 | ShrishtiAgarwal |
b333b03b2917ac62ad74a0bfaa214bb113a85ef3 | 430 | cc | C++ | P10-FundamentalAlgorithms&AdvancedExercises/P98179.cc | srmeeseeks/PRO1-jutge-FIB | 3af3d28c77ff14a5dbff20b1b5ddc4178462d8a1 | [
"MIT"
] | null | null | null | P10-FundamentalAlgorithms&AdvancedExercises/P98179.cc | srmeeseeks/PRO1-jutge-FIB | 3af3d28c77ff14a5dbff20b1b5ddc4178462d8a1 | [
"MIT"
] | null | null | null | P10-FundamentalAlgorithms&AdvancedExercises/P98179.cc | srmeeseeks/PRO1-jutge-FIB | 3af3d28c77ff14a5dbff20b1b5ddc4178462d8a1 | [
"MIT"
] | null | null | null | //Inserció en taula ordenada
#include <iostream>
#include <vector>
using namespace std;
void insereix(vector<double>& v) {
int tam = v.size();
for (int i = 1; i < tam; ++i) {
double x = v[i];
int j = i;
while (j > 0 && x < v[j - 1]) {
... | 22.631579 | 47 | 0.351163 | srmeeseeks |
b3342d81ae0cdb7f677a1ecf5c5ca693c503cd90 | 1,224 | cpp | C++ | tests/categorytest.cpp | jgcoded/UVA-Arena-Qt | 084cb5031e5faa8a9bfe5256959584a9cb0cf82b | [
"MIT"
] | 1 | 2020-03-02T09:25:44.000Z | 2020-03-02T09:25:44.000Z | tests/categorytest.cpp | jgcoded/UVA-Arena-Qt | 084cb5031e5faa8a9bfe5256959584a9cb0cf82b | [
"MIT"
] | null | null | null | tests/categorytest.cpp | jgcoded/UVA-Arena-Qt | 084cb5031e5faa8a9bfe5256959584a9cb0cf82b | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <iostream>
#include <memory>
#include <QList>
#include <QNetworkAccessManager>
#include <QApplication>
#include <QFrame>
#include <QPushButton>
#include <QVBoxLayout>
#include <QFile>
#include "mainwindow.h"
#include "uhunt/uhunt.h"
#include "uhunt/category.h"
using namespace std;
using ... | 23.538462 | 110 | 0.640523 | jgcoded |
b33652c79834a08b143fc9f3818d8e09301810fe | 9,746 | hpp | C++ | src/flow/mergeable_flow.hpp | DARMA-tasking/darma-simple-backend | 3ea4fa297756eddb906f5918fef083e64f1f69e7 | [
"BSD-Source-Code"
] | 1 | 2018-05-29T13:04:16.000Z | 2018-05-29T13:04:16.000Z | src/flow/mergeable_flow.hpp | DARMA-tasking/darma-simple-backend | 3ea4fa297756eddb906f5918fef083e64f1f69e7 | [
"BSD-Source-Code"
] | null | null | null | src/flow/mergeable_flow.hpp | DARMA-tasking/darma-simple-backend | 3ea4fa297756eddb906f5918fef083e64f1f69e7 | [
"BSD-Source-Code"
] | null | null | null | /*
//@HEADER
// ************************************************************************
//
// mergeable_flow.hpp
// DARMA
// Copyright (C) 2017 Sandia Corporation
//
// Under the terms of Contract DE-NA-0003525 with NTESS, LLC,
// the U.S. Government retains ce... | 38.521739 | 105 | 0.647548 | DARMA-tasking |
b33907f967ff49758d5a1f84e421620393fb82e4 | 66,803 | hpp | C++ | include/SSDK/Archive/Json/json.hpp | djc80s/c-cpp_study | 3ea8289c358a2b732524ab391aa87c4a8fc0b6a7 | [
"BSD-2-Clause"
] | null | null | null | include/SSDK/Archive/Json/json.hpp | djc80s/c-cpp_study | 3ea8289c358a2b732524ab391aa87c4a8fc0b6a7 | [
"BSD-2-Clause"
] | null | null | null | include/SSDK/Archive/Json/json.hpp | djc80s/c-cpp_study | 3ea8289c358a2b732524ab391aa87c4a8fc0b6a7 | [
"BSD-2-Clause"
] | null | null | null | #ifndef JSONHELPER_H
#define JSONHELPER_H
#include <string>
#include <type_traits>
#include <map>
#include <iostream>
#include <fstream>
#include <memory>
#include <stdio.h>
#include <math.h>
#include <boost/variant/variant.hpp>
#include <boost/variant.hpp>
#include <rapidjson/writer.h>
#include <rapidjson/stringbuf... | 38.74884 | 229 | 0.416613 | djc80s |
b339e1d03d64d14f58233230589a3734d14290da | 4,504 | cc | C++ | chrome/browser/prefs/session_startup_pref.cc | Gitman1989/chromium | 2b1cceae1075ef012fb225deec8b4c8bbe4bc897 | [
"BSD-3-Clause"
] | 2 | 2017-09-02T19:08:28.000Z | 2021-11-15T15:15:14.000Z | chrome/browser/prefs/session_startup_pref.cc | Gitman1989/chromium | 2b1cceae1075ef012fb225deec8b4c8bbe4bc897 | [
"BSD-3-Clause"
] | null | null | null | chrome/browser/prefs/session_startup_pref.cc | Gitman1989/chromium | 2b1cceae1075ef012fb225deec8b4c8bbe4bc897 | [
"BSD-3-Clause"
] | 1 | 2020-04-13T05:45:10.000Z | 2020-04-13T05:45:10.000Z | // Copyright (c) 2010 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/prefs/session_startup_pref.h"
#include <string>
#include "base/string_piece.h"
#include "base/utf_string_conversions.h"
#in... | 32.402878 | 79 | 0.720249 | Gitman1989 |
b33bba60bd697a1fff48ac10a5d457938b0056fb | 870 | cpp | C++ | modes/ModeMessage.cpp | bl4ckic3/fsfw | c76fc8c703e19d917c45a25710b4642e5923c68a | [
"Apache-2.0"
] | null | null | null | modes/ModeMessage.cpp | bl4ckic3/fsfw | c76fc8c703e19d917c45a25710b4642e5923c68a | [
"Apache-2.0"
] | null | null | null | modes/ModeMessage.cpp | bl4ckic3/fsfw | c76fc8c703e19d917c45a25710b4642e5923c68a | [
"Apache-2.0"
] | null | null | null | #include "ModeMessage.h"
Mode_t ModeMessage::getMode(const CommandMessage* message) {
return message->getParameter();
}
Submode_t ModeMessage::getSubmode(const CommandMessage* message) {
return message->getParameter2();
}
void ModeMessage::setModeMessage(CommandMessage* message,
Command_t command, Mode_t m... | 27.1875 | 82 | 0.774713 | bl4ckic3 |
b33c17115f15fc746cc25d602d3a1c792163ca63 | 7,315 | cc | C++ | tddd38-cpp/exams/ten-210114/message.cc | AxelGard/university-projects | 0c9a6e785f1918c6ed0fd365b2d419c9f52edb50 | [
"MIT"
] | null | null | null | tddd38-cpp/exams/ten-210114/message.cc | AxelGard/university-projects | 0c9a6e785f1918c6ed0fd365b2d419c9f52edb50 | [
"MIT"
] | null | null | null | tddd38-cpp/exams/ten-210114/message.cc | AxelGard/university-projects | 0c9a6e785f1918c6ed0fd365b2d419c9f52edb50 | [
"MIT"
] | null | null | null | // Suggestions and hints:
// - Read the 'main' function to understand how the code is used.
// - Don't worry too much about rewriting everything. Find a few
// places where you can demonstrate your knowledge and only change
// those places.
// - The wishlists are just hints/suggestions. You don't have to
// fo... | 25.224138 | 110 | 0.577717 | AxelGard |
b33e057cacd37ac8f7bc73917ca18819cb249b07 | 1,795 | cpp | C++ | Problem Sets/Problem Set 4/Problem 6.54/main.cpp | joseramosp/Learning-C- | 7003ff56745f7b8ebe21211ca692670bb4728bfe | [
"MIT"
] | 1 | 2020-10-11T00:09:48.000Z | 2020-10-11T00:09:48.000Z | Problem Sets/Problem Set 4/Problem 6.54/main.cpp | joseramosp/Learning-Cpp | 7003ff56745f7b8ebe21211ca692670bb4728bfe | [
"MIT"
] | null | null | null | Problem Sets/Problem Set 4/Problem 6.54/main.cpp | joseramosp/Learning-Cpp | 7003ff56745f7b8ebe21211ca692670bb4728bfe | [
"MIT"
] | null | null | null | //
// Created by Jose Ramos on 2/20/20.
//
// 6.54 (C++11 Random Numbers: Modified Craps Game) Modify the program of Fig. 6.9 to use the new C++11 random-
// number generation features shown in Section 6.9.
#include <iostream>
#include <random>
using namespace std;
unsigned int rollDice();
int main() {
//defa... | 23.618421 | 111 | 0.547632 | joseramosp |
b33ea83d066a38090cfc443fe727b5b3e5879ecc | 9,226 | cpp | C++ | historyView.cpp | neelsoumya/cycells | a3a6e632addf0a91c75c0a579ad0d41ad9d7a089 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | null | null | null | historyView.cpp | neelsoumya/cycells | a3a6e632addf0a91c75c0a579ad0d41ad9d7a089 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | null | null | null | historyView.cpp | neelsoumya/cycells | a3a6e632addf0a91c75c0a579ad0d41ad9d7a089 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 3 | 2018-06-20T21:55:11.000Z | 2020-10-21T19:04:54.000Z | /************************************************************************
* *
* Copyright (C) 2007 Christina Warrender and Drew Levin *
* *
* This file is part of ... | 39.939394 | 82 | 0.423911 | neelsoumya |
b33f308ad5284b295bc1aa8c12a524b657fb5637 | 531 | hpp | C++ | libraries/plugins/chain/include/steem/plugins/chain/abstract_block_producer.hpp | reactivespace/Steemit-Fork-2.0 | 1bf860963f5715309bda6f77e362e09e9d3ccf8a | [
"MIT"
] | null | null | null | libraries/plugins/chain/include/steem/plugins/chain/abstract_block_producer.hpp | reactivespace/Steemit-Fork-2.0 | 1bf860963f5715309bda6f77e362e09e9d3ccf8a | [
"MIT"
] | null | null | null | libraries/plugins/chain/include/steem/plugins/chain/abstract_block_producer.hpp | reactivespace/Steemit-Fork-2.0 | 1bf860963f5715309bda6f77e362e09e9d3ccf8a | [
"MIT"
] | null | null | null | #pragma once
#include <fc/time.hpp>
#include <clout/chain/database.hpp>
namespace clout { namespace plugins { namespace chain {
class abstract_block_producer {
public:
virtual ~abstract_block_producer() = default;
virtual clout::chain::signed_block generate_block(
fc::time_point_sec when,
cons... | 25.285714 | 64 | 0.721281 | reactivespace |
b3406b533c5cc030f01da5fc7a49f8ad453a7bb6 | 4,815 | hpp | C++ | sandbox/core/system.hpp | KabelitzJ/sandbox | fe870387e634e101a63398409966c61088e1384b | [
"MIT"
] | null | null | null | sandbox/core/system.hpp | KabelitzJ/sandbox | fe870387e634e101a63398409966c61088e1384b | [
"MIT"
] | null | null | null | sandbox/core/system.hpp | KabelitzJ/sandbox | fe870387e634e101a63398409966c61088e1384b | [
"MIT"
] | null | null | null | #ifndef SBX_ECS_SYSTEM_HPP_
#define SBX_ECS_SYSTEM_HPP_
#include <type_traits>
#include <utility>
#include <iostream>
#include <memory>
#include <string>
#include <types/primitives.hpp>
#include <types/transform.hpp>
#include "resource_cache.hpp"
#include "scene.hpp"
#include "event_queue.hpp"
#include "input.hpp"
#... | 26.75 | 100 | 0.71298 | KabelitzJ |
b3474ba95efadd131a0fca3e23e2f99058671c84 | 22,454 | cpp | C++ | qikkDB_test/DispatcherTestsRegression.cpp | veselyja/qikkdb-community | 680f62632ba85e468beee672624b80a61ed40f55 | [
"Apache-2.0"
] | 15 | 2020-06-30T13:43:42.000Z | 2022-02-02T12:52:33.000Z | qikkDB_test/DispatcherTestsRegression.cpp | veselyja/qikkdb-community | 680f62632ba85e468beee672624b80a61ed40f55 | [
"Apache-2.0"
] | 1 | 2020-11-28T22:29:35.000Z | 2020-12-22T10:28:25.000Z | qikkDB_test/DispatcherTestsRegression.cpp | qikkDB/qikkdb | 4ee657c7d2bfccd460d2f0d2c84a0bbe72d9a80a | [
"Apache-2.0"
] | 1 | 2020-06-30T12:41:37.000Z | 2020-06-30T12:41:37.000Z | #include <cmath>
#include "gtest/gtest.h"
#include "../qikkDB/DatabaseGenerator.h"
#include "../qikkDB/ColumnBase.h"
#include "../qikkDB/BlockBase.h"
#include "../qikkDB/PointFactory.h"
#include "../qikkDB/ComplexPolygonFactory.h"
#include "../qikkDB/Database.h"
#include "../qikkDB/Table.h"
#include "../qikkDB/QueryEn... | 40.457658 | 111 | 0.659927 | veselyja |
b34a02e8f2302d1c41d7c7187ef2a1028b702a9d | 2,314 | cpp | C++ | lib-rdmnet/example/dummy_device.cpp | vanvught/rpidmx512 | b56bb2db406247b4fd4c56aa372952939f4a3290 | [
"MIT"
] | 328 | 2015-02-26T09:54:16.000Z | 2022-03-31T11:04:00.000Z | lib-rdmnet/example/dummy_device.cpp | vanvught/rpidmx512 | b56bb2db406247b4fd4c56aa372952939f4a3290 | [
"MIT"
] | 195 | 2016-07-13T10:43:37.000Z | 2022-03-20T19:14:55.000Z | lib-rdmnet/example/dummy_device.cpp | vanvught/rpidmx512 | b56bb2db406247b4fd4c56aa372952939f4a3290 | [
"MIT"
] | 113 | 2015-06-08T04:54:23.000Z | 2022-02-15T09:06:10.000Z | /**
* @file dummy_device.cpp
*
*/
/* Copyright (C) 2019-2021 by Arjan van Vught mailto:info@orangepi-dmx.nl
*
* 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, inclu... | 25.152174 | 81 | 0.730337 | vanvught |
b34a5a6353725e2d7b35c78dd8471fecee5c3bb4 | 363 | cc | C++ | jax/training/21-03/21-03-22-night/a.cc | JaxVanYang/acm | ee41f1cbf692b7b1463a9467401bb6e7d38aecce | [
"MIT"
] | 2 | 2022-01-01T16:55:02.000Z | 2022-03-16T14:47:29.000Z | jax/training/21-03/21-03-22-night/a.cc | JaxVanYang/acm | ee41f1cbf692b7b1463a9467401bb6e7d38aecce | [
"MIT"
] | null | null | null | jax/training/21-03/21-03-22-night/a.cc | JaxVanYang/acm | ee41f1cbf692b7b1463a9467401bb6e7d38aecce | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
const int maxn = 1005;
int arr[maxn];
int main() {
int n, a, b, c, t;
scanf("%d%d%d%d%d", &n, &a, &b, &c, &t);
for (int i = 0; i < n; ++i) scanf("%d", arr + i);
int ans = n * a;
int k = c - b;
if (k > 0) {
for (int i = 0; i < n; ++i) ans += (t - ... | 22.6875 | 60 | 0.432507 | JaxVanYang |
b34b3c8a71724c473ca5e182ca4726b0963d46bf | 822 | cc | C++ | libDatabase/variant.cc | marcbejerano/cpp-tools | 9ef62064a5b826b8722ff96e423ffff2d85f49f1 | [
"BSD-3-Clause"
] | null | null | null | libDatabase/variant.cc | marcbejerano/cpp-tools | 9ef62064a5b826b8722ff96e423ffff2d85f49f1 | [
"BSD-3-Clause"
] | null | null | null | libDatabase/variant.cc | marcbejerano/cpp-tools | 9ef62064a5b826b8722ff96e423ffff2d85f49f1 | [
"BSD-3-Clause"
] | null | null | null | #include "variant.h"
#include <iostream>
#include <string>
const std::string Variant::toString() const
{
std::string result = "";
switch (type) {
case CHAR: result += data.c; break;
case SHORT: result = std::to_string(data.sh); break;
case INT: result = std::to_string(data.i); break;... | 29.357143 | 80 | 0.536496 | marcbejerano |
b3575470bab04331f6592ea84dfbad7c51468d31 | 973 | cpp | C++ | contracts/libc++/upstream/test/std/numerics/complex.number/complex.value.ops/conj.pass.cpp | cubetrain/CubeTrain | b930a3e88e941225c2c54219267f743c790e388f | [
"MIT"
] | null | null | null | contracts/libc++/upstream/test/std/numerics/complex.number/complex.value.ops/conj.pass.cpp | cubetrain/CubeTrain | b930a3e88e941225c2c54219267f743c790e388f | [
"MIT"
] | null | null | null | contracts/libc++/upstream/test/std/numerics/complex.number/complex.value.ops/conj.pass.cpp | cubetrain/CubeTrain | b930a3e88e941225c2c54219267f743c790e388f | [
"MIT"
] | null | null | null | //===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===---------------------------------... | 23.166667 | 81 | 0.461459 | cubetrain |
b357869e3e23b1f62d8e822acd60b6e6e79393fa | 76,249 | hpp | C++ | tm_kit/infra/RealTimeApp_TimeChecker_Piece.hpp | cd606/tm_infra | 27f93cc3cf4344a962aa5faeb4105be8458d34f0 | [
"Apache-2.0"
] | 1 | 2020-05-22T08:47:05.000Z | 2020-05-22T08:47:05.000Z | tm_kit/infra/RealTimeApp_TimeChecker_Piece.hpp | cd606/tm_infra | 27f93cc3cf4344a962aa5faeb4105be8458d34f0 | [
"Apache-2.0"
] | null | null | null | tm_kit/infra/RealTimeApp_TimeChecker_Piece.hpp | cd606/tm_infra | 27f93cc3cf4344a962aa5faeb4105be8458d34f0 | [
"Apache-2.0"
] | null | null | null | template <class A0, class A1>
class TimeChecker<false, std::variant<A0,A1>> {
private:
std::bitset<2> finalMask_;
std::optional<typename StateT::TimePointType> tp0_;
VersionChecker<A0> versionChecker0_;
std::optional<typename StateT::TimePointType> tp1_;
VersionChecker<A1> versionChecker1_;
public:
... | 36.996118 | 430 | 0.520322 | cd606 |
b35bd95e3401934078a1539df76ca686a32eff47 | 271 | cpp | C++ | atcoder/abc195/A/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 8 | 2020-12-23T07:54:53.000Z | 2021-11-23T02:46:35.000Z | atcoder/abc195/A/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 1 | 2020-11-07T13:22:29.000Z | 2020-12-20T12:54:00.000Z | atcoder/abc195/A/main.cpp | xirc/cp-algorithm | 89c67cff2f00459c5bb020ab44bff5ae419a1728 | [
"Apache-2.0"
] | 1 | 2021-01-16T03:40:10.000Z | 2021-01-16T03:40:10.000Z | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ff = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int M, H;
cin >> M >> H;
cout << (H % M == 0 ? "Yes" : "No") << endl;
return 0;
} | 16.9375 | 48 | 0.542435 | xirc |
b35f99f968ed1708af0d2fa82b8de89ce4d61017 | 7,696 | cpp | C++ | flatland_server/src/yaml_preprocessor.cpp | eborghi10/flatland | 5bcd91630b2e8c682084519162828b5b7855e710 | [
"BSD-3-Clause"
] | 59 | 2017-09-22T22:19:39.000Z | 2022-03-03T03:48:22.000Z | flatland_server/src/yaml_preprocessor.cpp | eborghi10/flatland | 5bcd91630b2e8c682084519162828b5b7855e710 | [
"BSD-3-Clause"
] | 34 | 2017-08-19T03:06:07.000Z | 2021-09-29T16:15:41.000Z | flatland_server/src/yaml_preprocessor.cpp | eborghi10/flatland | 5bcd91630b2e8c682084519162828b5b7855e710 | [
"BSD-3-Clause"
] | 38 | 2017-09-25T11:46:42.000Z | 2022-03-01T17:20:20.000Z | /*
* ______ __ __ __
* /\ _ \ __ /\ \/\ \ /\ \__
* \ \ \L\ \ __ __ /\_\ \_\ \ \ \____ ___\ \ ,_\ ____
* \ \ __ \/\ \/\ \\/\ \ /'_` \ \ '__`\ / __`\ \ \/ /',__\
* \ \ \/\ \ \ \_/ |\ \ \/\ \L\ \ \ \L\ \/\ \L\ \ \ \_/\__, `\
* \ \_\ \_\ \_... | 35.465438 | 80 | 0.602521 | eborghi10 |
b3609fd8fd48b8b18034c9e7ab7fc55a02ec86dd | 27,197 | cpp | C++ | ConceptEngine/ConceptEngine/ConceptEngineRenderer/Editor/Editor.cpp | Ludaxord/ConceptEngine | 16775bc9b518d4fd4c8bd32bb5f297223dfacbae | [
"MIT"
] | 4 | 2021-01-10T00:46:21.000Z | 2022-02-25T18:43:26.000Z | ConceptEngine/ConceptEngine/ConceptEngineRenderer/Editor/Editor.cpp | Ludaxord/ConceptEngine | 16775bc9b518d4fd4c8bd32bb5f297223dfacbae | [
"MIT"
] | null | null | null | ConceptEngine/ConceptEngine/ConceptEngineRenderer/Editor/Editor.cpp | Ludaxord/ConceptEngine | 16775bc9b518d4fd4c8bd32bb5f297223dfacbae | [
"MIT"
] | null | null | null | #include "Editor.h"
#include "../Rendering/DebugUI.h"
#include "../Rendering/CERenderer.h"
#include "../Core/Engine/Engine.h"
#include "../Core/Engine/EngineLoop.h"
#include "../Core/Engine/EngineGlobals.h"
#include "../Scene/CEScene.h"
#include "../Scene/Lights/DirectionalLight.h"
#include "../Scene/Lights/PointLig... | 33.743176 | 146 | 0.475825 | Ludaxord |
b3612b67874f5d112db450aa7efd49bf06b6016d | 1,841 | cpp | C++ | computer-networks/udp-agenda/server1.cpp | hsnavarro/CompIME | b4f285826d001b6f818d94636a6294782f1cedf2 | [
"MIT"
] | null | null | null | computer-networks/udp-agenda/server1.cpp | hsnavarro/CompIME | b4f285826d001b6f818d94636a6294782f1cedf2 | [
"MIT"
] | null | null | null | computer-networks/udp-agenda/server1.cpp | hsnavarro/CompIME | b4f285826d001b6f818d94636a6294782f1cedf2 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netinet/in.h>
using namespace std;
#define PORT 8080
#define MAX_SIZE 100
int sockfd;
char msg[MAX_SIZE];
string ok = "Server 1 updated successfully";
struct sockaddr_in servaddr, cliad... | 23.602564 | 99 | 0.593156 | hsnavarro |
b362223baab6702fb85b62fe0b80ec50b4d3fef0 | 4,681 | cpp | C++ | UVa 10007 count the trees/sample/sol.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2020-11-24T03:17:21.000Z | 2020-11-24T03:17:21.000Z | UVa 10007 count the trees/sample/sol.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | null | null | null | UVa 10007 count the trees/sample/sol.cpp | tadvi/uva | 0ac0cbdf593879b4fb02a3efc09adbb031cb47d5 | [
"MIT"
] | 1 | 2021-04-11T16:22:31.000Z | 2021-04-11T16:22:31.000Z | #include<stdio.h>
#include<iostream>
#define MAXDIGITS 793
using namespace std;
#define PLUS 1
#define MINUS -1
typedef struct
{
char digits[MAXDIGITS];
int signbit;
int lastdigit;
} bignum;
bignum catalans[301];
bignum factorials[301];
void print_bignum(bignum *);
void subtract_bignum(bignum *, bignum *, b... | 23.405 | 73 | 0.521043 | tadvi |
b367ee59d5f312c4f9bd67540c9725b2c2e5b863 | 796 | cc | C++ | src/Parser/AST/TFPDefStatementNode.cc | stenbror/PythonCoreNative | 9b5b1e55acf7d6adc7d8202e951872b2b9f71167 | [
"BSL-1.0"
] | null | null | null | src/Parser/AST/TFPDefStatementNode.cc | stenbror/PythonCoreNative | 9b5b1e55acf7d6adc7d8202e951872b2b9f71167 | [
"BSL-1.0"
] | null | null | null | src/Parser/AST/TFPDefStatementNode.cc | stenbror/PythonCoreNative | 9b5b1e55acf7d6adc7d8202e951872b2b9f71167 | [
"BSL-1.0"
] | 1 | 2021-05-24T11:18:32.000Z | 2021-05-24T11:18:32.000Z |
#include <ast/TFPDefStatementNode.h>
using namespace PythonCoreNative::RunTime::Parser::AST;
using namespace PythonCoreNative::RunTime::Parser;
TFPDefStatementNode::TFPDefStatementNode(
unsigned int start, unsigned int end,
std::shared_ptr<Token> op1,
... | 24.121212 | 66 | 0.616834 | stenbror |
b36b61be7f7d0726d37bfa4c1b71f12462e923f7 | 24,490 | cpp | C++ | MultiSource/Benchmarks/7zip/CPP/7zip/Archive/Zip/ZipIn.cpp | Nuullll/llvm-test-suite | afbdd0a9ee7770e074708b68b34a6a5312bb0b36 | [
"Apache-2.0"
] | 70 | 2019-01-15T03:03:55.000Z | 2022-03-28T02:16:13.000Z | MultiSource/Benchmarks/7zip/CPP/7zip/Archive/Zip/ZipIn.cpp | Nuullll/llvm-test-suite | afbdd0a9ee7770e074708b68b34a6a5312bb0b36 | [
"Apache-2.0"
] | 519 | 2020-09-15T07:40:51.000Z | 2022-03-31T20:51:15.000Z | MultiSource/Benchmarks/7zip/CPP/7zip/Archive/Zip/ZipIn.cpp | Nuullll/llvm-test-suite | afbdd0a9ee7770e074708b68b34a6a5312bb0b36 | [
"Apache-2.0"
] | 117 | 2020-06-24T13:11:04.000Z | 2022-03-23T15:44:23.000Z | // Archive/ZipIn.cpp
#include "StdAfx.h"
#include "../../../../C/CpuArch.h"
#include "Common/DynamicBuffer.h"
#include "../../Common/LimitedStreams.h"
#include "../../Common/StreamUtils.h"
#include "ZipIn.h"
#define Get16(p) GetUi16(p)
#define Get32(p) GetUi32(p)
#define Get64(p) GetUi64(p)
namespace NArchive {
... | 27.393736 | 126 | 0.657289 | Nuullll |
b36d7f29d09c25d1d5b251965bd303b59242ab32 | 971 | cc | C++ | RAVL2/3D/Mesh/Tri.cc | isuhao/ravl2 | 317e0ae1cb51e320b877c3bad6a362447b5e52ec | [
"BSD-Source-Code"
] | null | null | null | RAVL2/3D/Mesh/Tri.cc | isuhao/ravl2 | 317e0ae1cb51e320b877c3bad6a362447b5e52ec | [
"BSD-Source-Code"
] | null | null | null | RAVL2/3D/Mesh/Tri.cc | isuhao/ravl2 | 317e0ae1cb51e320b877c3bad6a362447b5e52ec | [
"BSD-Source-Code"
] | null | null | null | // This file is part of RAVL, Recognition And Vision Library
// Copyright (C) 2002, University of Surrey
// This code may be redistributed under the terms of the GNU Lesser
// General Public License (LGPL). See the lgpl.licence file for details or
// see http://www.gnu.org/copyleft/lesser.html
// file-header-ends-here... | 28.558824 | 93 | 0.610711 | isuhao |
b3710a42b03d33f32ae14ddb7236e8ec1853db92 | 893 | cpp | C++ | C++/sentence-similarity-iii.cpp | Priyansh2/LeetCode-Solutions | d613da1881ec2416ccbe15f20b8000e36ddf1291 | [
"MIT"
] | 3,269 | 2018-10-12T01:29:40.000Z | 2022-03-31T17:58:41.000Z | C++/sentence-similarity-iii.cpp | Priyansh2/LeetCode-Solutions | d613da1881ec2416ccbe15f20b8000e36ddf1291 | [
"MIT"
] | 53 | 2018-12-16T22:54:20.000Z | 2022-02-25T08:31:20.000Z | C++/sentence-similarity-iii.cpp | Priyansh2/LeetCode-Solutions | d613da1881ec2416ccbe15f20b8000e36ddf1291 | [
"MIT"
] | 1,236 | 2018-10-12T02:51:40.000Z | 2022-03-30T13:30:37.000Z | // Time: O(n)
// Space: O(1)
class Solution {
public:
bool areSentencesSimilar(string sentence1, string sentence2) {
if (size(sentence1) > size(sentence2)) {
swap(sentence1, sentence2);
}
int count = 0;
for (int step = 0; step < 2; ++step) {
for (int i = 0; ... | 33.074074 | 106 | 0.410974 | Priyansh2 |
b3722316be7a68ed15c4e0fc6f2c0b18809bd1c6 | 9,135 | cpp | C++ | foedus_code/foedus-core/src/foedus/memory/shared_memory.cpp | sam1016yu/cicada-exp-sigmod2017 | 64e582370076b2923d37b279d1c32730babc15f8 | [
"Apache-2.0"
] | null | null | null | foedus_code/foedus-core/src/foedus/memory/shared_memory.cpp | sam1016yu/cicada-exp-sigmod2017 | 64e582370076b2923d37b279d1c32730babc15f8 | [
"Apache-2.0"
] | null | null | null | foedus_code/foedus-core/src/foedus/memory/shared_memory.cpp | sam1016yu/cicada-exp-sigmod2017 | 64e582370076b2923d37b279d1c32730babc15f8 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) 2014-2015, Hewlett-Packard Development Company, LP.
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
* any later versi... | 34.866412 | 120 | 0.673454 | sam1016yu |
b37c72cbae3ff5e65c7d2ebd2b7416791da0980a | 3,606 | cpp | C++ | test/src/gpu.cpp | BeatWolf/etl | 32e8153b38e0029176ca4fe2395b7fa6babe3189 | [
"MIT"
] | 1 | 2020-02-19T13:13:10.000Z | 2020-02-19T13:13:10.000Z | test/src/gpu.cpp | BeatWolf/etl | 32e8153b38e0029176ca4fe2395b7fa6babe3189 | [
"MIT"
] | null | null | null | test/src/gpu.cpp | BeatWolf/etl | 32e8153b38e0029176ca4fe2395b7fa6babe3189 | [
"MIT"
] | null | null | null | //=======================================================================
// Copyright (c) 2014-2018 Baptiste Wicht
// Distributed under the terms of the MIT License.
// (See accompanying file LICENSE or copy at
// http://opensource.org/licenses/MIT)
//==================================================================... | 24.530612 | 73 | 0.574321 | BeatWolf |
b37d2c02d5c873483dba449319dee844fcc4e7aa | 13,774 | cpp | C++ | src/ops/cdl/CDLOpCPU.cpp | omi-lab/lib_opencolorio | a2457657353b5081ca24b5b9b11dd708451c05ba | [
"BSD-3-Clause"
] | null | null | null | src/ops/cdl/CDLOpCPU.cpp | omi-lab/lib_opencolorio | a2457657353b5081ca24b5b9b11dd708451c05ba | [
"BSD-3-Clause"
] | null | null | null | src/ops/cdl/CDLOpCPU.cpp | omi-lab/lib_opencolorio | a2457657353b5081ca24b5b9b11dd708451c05ba | [
"BSD-3-Clause"
] | 1 | 2022-01-27T17:21:42.000Z | 2022-01-27T17:21:42.000Z | // SPDX-License-Identifier: BSD-3-Clause
// Copyright Contributors to the OpenColorIO Project.
#include <algorithm>
#include <cmath>
#include <string.h>
#include <OpenColorIO/OpenColorIO.h>
#include "BitDepthUtils.h"
#include "CDLOpCPU.h"
#include "SSE.h"
namespace OCIO_NAMESPACE
{
const float RcpMinValue = 1e-2f... | 26.95499 | 99 | 0.644112 | omi-lab |
b37f0a67ab52fe8338755ea118678316d8f9b45d | 3,336 | hpp | C++ | templates/BalancedBinarySearchTree.SizeBalancedTree.hpp | BoleynSu/CP-CompetitiveProgramming | cc256bf402360fe0f689fdcdc4e898473a9594dd | [
"MIT"
] | 6 | 2019-03-23T21:06:25.000Z | 2021-06-27T05:22:41.000Z | templates/BalancedBinarySearchTree.SizeBalancedTree.hpp | BoleynSu/CP-CompetitiveProgramming | cc256bf402360fe0f689fdcdc4e898473a9594dd | [
"MIT"
] | 1 | 2020-10-11T08:14:00.000Z | 2020-10-11T08:14:00.000Z | templates/BalancedBinarySearchTree.SizeBalancedTree.hpp | BoleynSu/CP-CompetitiveProgramming | cc256bf402360fe0f689fdcdc4e898473a9594dd | [
"MIT"
] | 3 | 2019-03-23T21:06:31.000Z | 2021-10-24T01:44:01.000Z | /*
* Package: StandardCodeLibrary.BalancedBinarySearchTree.SizeBalancedTree
* Usage:
* MAXNODE:SizeBalancedTree最多有多少个节点,null会占用一个节点
* */
#include <Core>
namespace StandardCodeLibrary
{
namespace BinarySearchTree
{
namespace SizeBalancedTree
{
typedef int type;
const int MAXNODE=1;
typedef struct s... | 21.384615 | 105 | 0.588429 | BoleynSu |
b37f4194f86a4b5ae4b7849eef545edec2373158 | 1,057 | hpp | C++ | src/HF_state.hpp | simondlevy/HackflightCPP | 1f6fdd0c0ac2797d9663eb2b57410bb45c43c77e | [
"MIT"
] | null | null | null | src/HF_state.hpp | simondlevy/HackflightCPP | 1f6fdd0c0ac2797d9663eb2b57410bb45c43c77e | [
"MIT"
] | null | null | null | src/HF_state.hpp | simondlevy/HackflightCPP | 1f6fdd0c0ac2797d9663eb2b57410bb45c43c77e | [
"MIT"
] | 1 | 2021-12-27T23:07:06.000Z | 2021-12-27T23:07:06.000Z | /*
Datatype declarations for vehicle state
Copyright (c) 2018 Simon D. Levy
MIT License
*/
#pragma once
#include "HF_filters.hpp"
namespace hf {
class State {
friend class HackflightPure;
friend class HackflightFull;
private:
static const... | 20.326923 | 83 | 0.492904 | simondlevy |