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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
771cb7ed394aef806a1b409d25de91bbf71888f1 | 172 | hpp | C++ | include/Utilities/UI.hpp | InDieTasten/IDT.EXP | 6d6229d5638297ba061b188edbbe394df33d70b0 | [
"MIT"
] | null | null | null | include/Utilities/UI.hpp | InDieTasten/IDT.EXP | 6d6229d5638297ba061b188edbbe394df33d70b0 | [
"MIT"
] | 56 | 2017-03-30T14:45:29.000Z | 2017-03-30T14:46:29.000Z | include/Utilities/UI.hpp | InDieTasten-Legacy/--EXP-old- | 6d6229d5638297ba061b188edbbe394df33d70b0 | [
"MIT"
] | 1 | 2015-05-08T19:23:51.000Z | 2015-05-08T19:23:51.000Z | #ifndef _UI_hpp_
#define _UI_hpp_
#include <SFML\Graphics.hpp>
namespace utils {
bool hovering(sf::FloatRect object, sf::Vector2i mouse);
}
#endif // !_UI_hpp_ | 17.2 | 58 | 0.703488 | InDieTasten |
771cbe14a7cc436cd9c202012543597380b21f4a | 1,726 | cpp | C++ | query_strategies/merge_sum.cpp | shalijiang/efficient-nonmyopic-active-search | 6ac08c088dd903ef8a39381380f533889537b9ba | [
"MIT"
] | 8 | 2019-04-17T05:06:44.000Z | 2021-02-04T16:57:55.000Z | query_strategies/merge_sum.cpp | shalijiang/efficient-nonmyopic-active-search | 6ac08c088dd903ef8a39381380f533889537b9ba | [
"MIT"
] | null | null | null | query_strategies/merge_sum.cpp | shalijiang/efficient-nonmyopic-active-search | 6ac08c088dd903ef8a39381380f533889537b9ba | [
"MIT"
] | 3 | 2019-11-06T21:08:59.000Z | 2020-06-18T15:20:17.000Z | #include "mex.h"
#define P_ARG prhs[0]
#define Q_ARG prhs[1]
#define TOP_IND_ARG prhs[2]
#define REM_GOAL prhs[3]
#define SUM_ARG plhs[0]
#define ALL_ARG plhs[1]
#define P_IND ((int)(top_ind[j]) - 1)
void mexFunction(int nlhs, mxArray *plhs[],
int nrhs, const mxArray *prhs[]) {
... | 18.76087 | 54 | 0.511008 | shalijiang |
77211d2d41ef39815b3fe06b57875a717a82d084 | 19,140 | cpp | C++ | nvgpu/OffsetOps.cpp | uasys/ACF-Coalescing-LLVM | db811bda15bb7c4a951644130ab55f5cb5848351 | [
"MIT"
] | 1 | 2020-06-23T00:18:56.000Z | 2020-06-23T00:18:56.000Z | nvgpu/OffsetOps.cpp | uasys/ACF-Coalescing-LLVM | db811bda15bb7c4a951644130ab55f5cb5848351 | [
"MIT"
] | null | null | null | nvgpu/OffsetOps.cpp | uasys/ACF-Coalescing-LLVM | db811bda15bb7c4a951644130ab55f5cb5848351 | [
"MIT"
] | null | null | null | #include "ThreadDepAnalysis.h"
#include "OffsetOps.h"
using namespace llvm;
using namespace std;
namespace gpucheck {
OffsetValPtr negateCondition(OffsetValPtr& cond) {
assert(isa<BinOpOffsetVal>(cond.get()));
auto b=dyn_cast<BinOpOffsetVal>(cond.get());
OffsetValPtr lhs = b->lhs;
OffsetValPtr rhs ... | 38.05169 | 119 | 0.621891 | uasys |
7723eae9b2045d7dbcf632fd16493296ef52a85e | 1,395 | cpp | C++ | p/1k/1598/main.cpp | josedelinux/luogu | f9ce86b8623224512aa3f9e1eecc45d3c89c74e4 | [
"MIT"
] | null | null | null | p/1k/1598/main.cpp | josedelinux/luogu | f9ce86b8623224512aa3f9e1eecc45d3c89c74e4 | [
"MIT"
] | null | null | null | p/1k/1598/main.cpp | josedelinux/luogu | f9ce86b8623224512aa3f9e1eecc45d3c89c74e4 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define REDIn
#define DEBUGn
#ifdef DEBUG
#define REDI
#endif
#define MAXROW 400
using namespace std;
map<char, int> m;
char histogram[MAXROW + 1][26]; // extra 1 for '\0'
int main() {
#ifdef REDI
freopen("input.txt", "r", stdin);
#endif
int cnt = 0;
char ch;
while (cin >> ch) {... | 18.116883 | 68 | 0.467384 | josedelinux |
77256b1fcab4cbb4f543c7d51afab7e4f336272f | 28,945 | hpp | C++ | include/xtensor-fftw/common.hpp | michaelbacci/xtensor-fftw | 0c463ab759d7664a9b25c4382987138151ad74c3 | [
"BSD-3-Clause"
] | 13 | 2019-12-13T08:38:55.000Z | 2021-06-18T09:01:23.000Z | include/xtensor-fftw/common.hpp | michaelbacci/xtensor-fftw | 0c463ab759d7664a9b25c4382987138151ad74c3 | [
"BSD-3-Clause"
] | 13 | 2019-11-07T12:15:38.000Z | 2022-02-23T14:33:00.000Z | include/xtensor-fftw/common.hpp | michaelbacci/xtensor-fftw | 0c463ab759d7664a9b25c4382987138151ad74c3 | [
"BSD-3-Clause"
] | 5 | 2019-11-07T11:57:36.000Z | 2021-05-15T22:38:37.000Z | /*
* xtensor-fftw
* Copyright (c) 2017, Patrick Bos
*
* Distributed under the terms of the BSD 3-Clause License.
*
* The full license is in the file LICENSE, distributed with this software.
*
* common.hpp:
* Defines the commons datas and functions to wrap original FFTW library.
*
*/
#ifndef XTENSOR_FFTW_CO... | 55.663462 | 259 | 0.680774 | michaelbacci |
7726cf47ac4643f66269b2619e187315a66aa689 | 1,237 | cpp | C++ | Genres.cpp | Saki-EU/FilmRegistry | b2a543280b3c63d32abecbb82becb6c6d2c32c20 | [
"MIT"
] | null | null | null | Genres.cpp | Saki-EU/FilmRegistry | b2a543280b3c63d32abecbb82becb6c6d2c32c20 | [
"MIT"
] | null | null | null | Genres.cpp | Saki-EU/FilmRegistry | b2a543280b3c63d32abecbb82becb6c6d2c32c20 | [
"MIT"
] | null | null | null | #include "Genres.h"
using namespace std;
void Family::print() {
cout << "Title: " << getTitle() << endl;
cout << "Length: " << getLength() << " min" << endl;
cout << "Release: " << getYear() << endl;
cout << "Age limit: " << agel << endl << endl;
}
void Family::print2file() {
fstream fp;
fp.o... | 30.170732 | 61 | 0.518189 | Saki-EU |
77287d0087ccb1084c8c55c60899596cbf8beb31 | 2,537 | cpp | C++ | sdl2/AdventureInSDL2/TtfScene.cpp | pdpdds/SDLGameProgramming | 3af68e2133296f3e7bc3d7454d9301141bca2d5a | [
"BSD-2-Clause"
] | null | null | null | sdl2/AdventureInSDL2/TtfScene.cpp | pdpdds/SDLGameProgramming | 3af68e2133296f3e7bc3d7454d9301141bca2d5a | [
"BSD-2-Clause"
] | null | null | null | sdl2/AdventureInSDL2/TtfScene.cpp | pdpdds/SDLGameProgramming | 3af68e2133296f3e7bc3d7454d9301141bca2d5a | [
"BSD-2-Clause"
] | null | null | null |
/* TtfScene.cpp
*
* Copyright (C) 2013 Michael Imamura
*
* 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 applica... | 20.459677 | 80 | 0.714229 | pdpdds |
772bb0aef80fd8f0e86d570c82da8e9e0c2b3faf | 18,869 | cpp | C++ | Game/OGRE/OgreMain/src/OgrePlatformInformation.cpp | hackerlank/SourceCode | b702c9e0a9ca5d86933f3c827abb02a18ffc9a59 | [
"MIT"
] | 4 | 2021-07-31T13:56:01.000Z | 2021-11-13T02:55:10.000Z | Game/OGRE/OgreMain/src/OgrePlatformInformation.cpp | shacojx/SourceCodeGameTLBB | e3cea615b06761c2098a05427a5f41c236b71bf7 | [
"MIT"
] | null | null | null | Game/OGRE/OgreMain/src/OgrePlatformInformation.cpp | shacojx/SourceCodeGameTLBB | e3cea615b06761c2098a05427a5f41c236b71bf7 | [
"MIT"
] | 7 | 2021-08-31T14:34:23.000Z | 2022-01-19T08:25:58.000Z | /*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2006 Torus Knot Software Ltd
Also see acknowledgements in Readme.html
This program is fre... | 36.009542 | 135 | 0.54041 | hackerlank |
772bcd697a2f6bb367a02e27dbe0d8ccbb6fec92 | 219 | cpp | C++ | Beginner/Chef and Remissness (REMISS)/remiss.cpp | anishsingh42/CodeChef | 50f5c0438516210895e513bc4ee959b9d99ef647 | [
"Apache-2.0"
] | 127 | 2020-10-13T18:04:35.000Z | 2022-02-17T10:56:27.000Z | Beginner/Chef and Remissness (REMISS)/remiss.cpp | anishsingh42/CodeChef | 50f5c0438516210895e513bc4ee959b9d99ef647 | [
"Apache-2.0"
] | 132 | 2020-10-13T18:06:53.000Z | 2021-10-17T18:44:26.000Z | Beginner/Chef and Remissness (REMISS)/remiss.cpp | anishsingh42/CodeChef | 50f5c0438516210895e513bc4ee959b9d99ef647 | [
"Apache-2.0"
] | 364 | 2020-10-13T18:04:52.000Z | 2022-03-04T14:34:53.000Z | #include <iostream>
using namespace std;
int main()
{
int t,a,b;
cin>>t;
while(t--)
{
cin>>a>>b;
if(a>b)
cout<<a<<" "<<(a+b)<<endl;
else
cout<<b<<" "<<(a+b)<<endl;
}
} | 14.6 | 33 | 0.410959 | anishsingh42 |
772c70dac7e6e86d7befbe91721a05deb8773517 | 1,627 | hpp | C++ | src/ppmdu/pmd2/level_data.hpp | SkyTemple/ppmdu | 9731ea103affd66f2e8c1202c9acb2ebfd4c9924 | [
"CC0-1.0"
] | 37 | 2015-10-30T21:56:26.000Z | 2021-11-30T15:33:26.000Z | src/ppmdu/pmd2/level_data.hpp | SkyTemple/ppmdu | 9731ea103affd66f2e8c1202c9acb2ebfd4c9924 | [
"CC0-1.0"
] | 27 | 2015-01-06T05:45:55.000Z | 2020-01-29T21:40:22.000Z | src/ppmdu/pmd2/level_data.hpp | SkyTemple/ppmdu | 9731ea103affd66f2e8c1202c9acb2ebfd4c9924 | [
"CC0-1.0"
] | 8 | 2016-02-07T23:31:03.000Z | 2020-07-12T08:51:41.000Z | #ifndef LEVEL_DATA_HPP
#define LEVEL_DATA_HPP
/*
level_data.hpp
2016/11/11
psycommando@gmail.com
Description: Utilities for exporting and importing level data to and from folders containing XML.
*/
#include <ppmdu/pmd2/pmd2.hpp>
#include <ppmdu/pmd2/pmd2_configloader.hpp>
#include <ppmdu/containers/level_tileset.hpp>
#... | 25.421875 | 122 | 0.656423 | SkyTemple |
772f738d8f31ec1f0c3bd550d48e39dd436fbbb4 | 7,077 | cpp | C++ | Testing/Operations/mafASCIIImporterUtilityTest.cpp | FusionBox2/MAF2 | b576955f4f6b954467021f12baedfebcaf79a382 | [
"Apache-2.0"
] | 1 | 2018-01-23T09:13:40.000Z | 2018-01-23T09:13:40.000Z | Testing/Operations/mafASCIIImporterUtilityTest.cpp | gradicosmo/MAF2 | 86ddf1f52a2de4479c09fd3f43dc321ff412af42 | [
"Apache-2.0"
] | null | null | null | Testing/Operations/mafASCIIImporterUtilityTest.cpp | gradicosmo/MAF2 | 86ddf1f52a2de4479c09fd3f43dc321ff412af42 | [
"Apache-2.0"
] | 3 | 2020-09-24T16:04:53.000Z | 2020-09-24T16:50:30.000Z | /*=========================================================================
Program: MAF2
Module: mafASCIIImporterUtilityTest
Authors: Alberto Losi
Copyright (c) B3C
All rights reserved. See Copyright.txt or
http://www.scsitaly.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY;... | 29.4875 | 87 | 0.521125 | FusionBox2 |
7733435e7143ebda874971007f51e93d338fdac9 | 1,235 | cpp | C++ | p1807_1.cpp | Alex-Amber/LuoguAlgorithmProblems | ae8abdb6110badc9faf03af1af42ea562ca1170c | [
"MIT"
] | null | null | null | p1807_1.cpp | Alex-Amber/LuoguAlgorithmProblems | ae8abdb6110badc9faf03af1af42ea562ca1170c | [
"MIT"
] | null | null | null | p1807_1.cpp | Alex-Amber/LuoguAlgorithmProblems | ae8abdb6110badc9faf03af1af42ea562ca1170c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int>>> adj_list;
vector<int> ind, dists;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M, u, v, w;
cin >> N >> M;
adj_list.assign(N, vector<pair<int, int>>());
ind.assign(N, 0);
dists.assign(N, INT_MIN);
... | 23.75 | 66 | 0.425911 | Alex-Amber |
77361c500e55c8d5444907c6cb026fbaa6548d79 | 731 | cpp | C++ | codeforces/a.cpp | Shisir/Online-Judge | e58c32eeb7ca18a19cc2a83ef016f9c3b124370a | [
"MIT"
] | null | null | null | codeforces/a.cpp | Shisir/Online-Judge | e58c32eeb7ca18a19cc2a83ef016f9c3b124370a | [
"MIT"
] | null | null | null | codeforces/a.cpp | Shisir/Online-Judge | e58c32eeb7ca18a19cc2a83ef016f9c3b124370a | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int c[10005], a[10005], n;
int main() {
long long res = 0LL;
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int i = 1; i <= n; i++) {
if(a[i] == 1) {
int c = 0;
res = 1LL;
int pos;
for(int... | 19.756757 | 50 | 0.302326 | Shisir |
774250248eeab8ddf549e55bb77e82c4fb54447b | 1,171 | cpp | C++ | CharChange.cpp | briangreenery/useless-text-editor | 3e0bf11a9f833b88a0a69f2e6f564743b2f9e5b3 | [
"Unlicense"
] | 4 | 2018-05-17T11:17:26.000Z | 2021-12-01T00:48:43.000Z | CharChange.cpp | briangreenery/useless-text-editor | 3e0bf11a9f833b88a0a69f2e6f564743b2f9e5b3 | [
"Unlicense"
] | null | null | null | CharChange.cpp | briangreenery/useless-text-editor | 3e0bf11a9f833b88a0a69f2e6f564743b2f9e5b3 | [
"Unlicense"
] | 1 | 2021-05-31T19:08:00.000Z | 2021-05-31T19:08:00.000Z | // CharChange.cpp
#include "CharChange.h"
#include <algorithm>
CharChange::CharChange()
: m_start( 0 )
, m_end( 0 )
, m_delta( 0 )
{
}
CharChange::CharChange( size_t start, size_t count, Type type )
{
if ( type == kInsertion )
{
m_start = start;
m_end = start;
m_delta = static_cast<int32_t>( ... | 19.847458 | 73 | 0.590948 | briangreenery |
7748882f0590b9f2fd1b6e995f06f6b5951591d4 | 2,211 | cpp | C++ | ceppengine/src/ceppengine/modules/windows/windowsinputmodule.cpp | Winded/ceppengine | 52a9c1723dc45aba4d85d50e4c919ec8016c8d94 | [
"MIT"
] | 2 | 2017-11-13T11:29:03.000Z | 2017-11-13T12:09:12.000Z | ceppengine/src/ceppengine/modules/windows/windowsinputmodule.cpp | Winded/ceppengine | 52a9c1723dc45aba4d85d50e4c919ec8016c8d94 | [
"MIT"
] | null | null | null | ceppengine/src/ceppengine/modules/windows/windowsinputmodule.cpp | Winded/ceppengine | 52a9c1723dc45aba4d85d50e4c919ec8016c8d94 | [
"MIT"
] | null | null | null | #include "windowsinputmodule.h"
namespace cepp {
WindowsInputModule::WindowsInputModule() : mMouseScrollDelta(0)
{
mLastMousePos.x = 0;
mLastMousePos.y = 0;
for(int i = 0; i < 255; i++) {
mKeysPressed[i] = false;
mKeysDown[i] = false;
mKeysReleased[i] = false;
}
for(int i ... | 20.1 | 67 | 0.683401 | Winded |
7748e2a4123bb3f4c95c0fea82b540dff0b2e7a3 | 554 | cpp | C++ | samples/snippets/cpp/VS_Snippets_CLR/Cryptography.KeyNumber/cpp/sample.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 | [
"CC-BY-4.0",
"MIT"
] | 421 | 2018-04-01T01:57:50.000Z | 2022-03-28T15:24:42.000Z | samples/snippets/cpp/VS_Snippets_CLR/Cryptography.KeyNumber/cpp/sample.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 | [
"CC-BY-4.0",
"MIT"
] | 5,797 | 2018-04-02T21:12:23.000Z | 2022-03-31T23:54:38.000Z | samples/snippets/cpp/VS_Snippets_CLR/Cryptography.KeyNumber/cpp/sample.cpp | hamarb123/dotnet-api-docs | 6aeb55784944a2f1f5e773b657791cbd73a92dd4 | [
"CC-BY-4.0",
"MIT"
] | 1,482 | 2018-03-31T11:26:20.000Z | 2022-03-30T22:36:45.000Z | using namespace System;
using namespace System::IO;
using namespace System::Text;
using namespace System::Security::Cryptography;
int main()
{
//<SNIPPET1>
// Create a new CspParameters object.
CspParameters^ cspParams = gcnew CspParameters();
// Specify an exchange key.
cspParams->Key... | 26.380952 | 82 | 0.698556 | hamarb123 |
774bf088889c0f77b1479435b754b9e7ab8a73c4 | 16,784 | cpp | C++ | Arc/src/Arc/Scene/SceneSerializer.cpp | MohitSethi99/AGE | 4291ebeaa4af5b60518bc55eae079fd2cfe55d8f | [
"Apache-2.0"
] | null | null | null | Arc/src/Arc/Scene/SceneSerializer.cpp | MohitSethi99/AGE | 4291ebeaa4af5b60518bc55eae079fd2cfe55d8f | [
"Apache-2.0"
] | null | null | null | Arc/src/Arc/Scene/SceneSerializer.cpp | MohitSethi99/AGE | 4291ebeaa4af5b60518bc55eae079fd2cfe55d8f | [
"Apache-2.0"
] | null | null | null | #include "arcpch.h"
#include "Arc/Scene/SceneSerializer.h"
#include "Arc/Scene/Entity.h"
#include "Arc/Scene/Components.h"
#include <fstream>
#include <yaml-cpp/yaml.h>
namespace YAML {
template<>
struct convert<glm::vec2>
{
static Node encode(const glm::vec2& rhs)
{
Node node;
node.push_back(rhs.x);
... | 35.260504 | 139 | 0.65908 | MohitSethi99 |
775475451762e77a368dc35dfeb76a93b9951879 | 189,863 | cpp | C++ | src/sweepc/source/swp_PAH_primary.cpp | sm453/MOpS | f1a706c6552bbdf3ceab504121a02391a1b51ede | [
"MIT"
] | 3 | 2020-09-08T14:06:33.000Z | 2020-12-04T07:52:19.000Z | src/sweepc/source/swp_PAH_primary.cpp | sm453/MOpS | f1a706c6552bbdf3ceab504121a02391a1b51ede | [
"MIT"
] | null | null | null | src/sweepc/source/swp_PAH_primary.cpp | sm453/MOpS | f1a706c6552bbdf3ceab504121a02391a1b51ede | [
"MIT"
] | 3 | 2021-11-15T05:18:26.000Z | 2022-03-01T13:51:20.000Z | /*!
* \file swp_PAH_primary.cpp
* \author Markus Sander
*
* \brief Particle Model that stores the individual PAHs of a soot particle
*/
/*
Author(s): Markus Sander (ms785)
Project: sweepc (population balance solver)
Sourceforge: http://sourceforge.net/projects/mopssuite
Copyright (C) 200... | 32.96805 | 224 | 0.659849 | sm453 |
775579cc60d5bcf6d59a66ae0b2f08e0fc41bab1 | 10,710 | cpp | C++ | modules/basegl/src/rendering/splitterrenderer.cpp | alexanderbock/inviwo | 5a23de833ba3f7bd56d71154e75df3bfc6ee6a7c | [
"BSD-2-Clause"
] | 349 | 2015-01-30T09:21:52.000Z | 2022-03-25T03:10:02.000Z | modules/basegl/src/rendering/splitterrenderer.cpp | alexanderbock/inviwo | 5a23de833ba3f7bd56d71154e75df3bfc6ee6a7c | [
"BSD-2-Clause"
] | 641 | 2015-09-23T08:54:06.000Z | 2022-03-23T09:50:55.000Z | modules/basegl/src/rendering/splitterrenderer.cpp | alexanderbock/inviwo | 5a23de833ba3f7bd56d71154e75df3bfc6ee6a7c | [
"BSD-2-Clause"
] | 124 | 2015-02-27T23:45:02.000Z | 2022-02-21T09:37:14.000Z | /*********************************************************************************
*
* Inviwo - Interactive Visualization Workshop
*
* Copyright (c) 2021 Inviwo Foundation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that th... | 40.568182 | 100 | 0.617927 | alexanderbock |
77559aa1eeaa54a2a2480508e7b9c022f6cf6d6a | 56,169 | cc | C++ | test/test_strtod.cc | forksnd/Drachennest | e6714a39ad331b4489d0b6aaf3968635bff4eb5e | [
"BSL-1.0"
] | 51 | 2019-08-24T19:25:46.000Z | 2022-02-28T23:36:04.000Z | test/test_strtod.cc | forksnd/Drachennest | e6714a39ad331b4489d0b6aaf3968635bff4eb5e | [
"BSL-1.0"
] | 5 | 2020-07-24T07:41:46.000Z | 2021-12-24T20:28:46.000Z | test/test_strtod.cc | forksnd/Drachennest | e6714a39ad331b4489d0b6aaf3968635bff4eb5e | [
"BSL-1.0"
] | 3 | 2020-05-31T11:35:42.000Z | 2021-12-08T01:27:59.000Z | #include "catch.hpp"
#include "ryu_32.h"
#include "ryu_64.h"
#include "double-conversion/double-conversion.h"
#include <cfloat>
#include <cmath>
#include <cstring>
#include <limits>
#define TEST_LONG_INPUT() 0
//==================================================================================================
// S... | 50.016919 | 128 | 0.701668 | forksnd |
7758f5f9df6dcc434e75689fad8fb78118aa9d64 | 2,572 | cc | C++ | ppapi/tests/test_file_system.cc | meego-tablet-ux/meego-app-browser | 0f4ef17bd4b399c9c990a2f6ca939099495c2b9c | [
"BSD-3-Clause"
] | 1 | 2015-10-12T09:14:22.000Z | 2015-10-12T09:14:22.000Z | ppapi/tests/test_file_system.cc | meego-tablet-ux/meego-app-browser | 0f4ef17bd4b399c9c990a2f6ca939099495c2b9c | [
"BSD-3-Clause"
] | null | null | null | ppapi/tests/test_file_system.cc | meego-tablet-ux/meego-app-browser | 0f4ef17bd4b399c9c990a2f6ca939099495c2b9c | [
"BSD-3-Clause"
] | 1 | 2020-11-04T07:22:28.000Z | 2020-11-04T07:22:28.000Z | // Copyright (c) 2011 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 "ppapi/tests/test_file_system.h"
#include <string.h>
#include "ppapi/c/pp_errors.h"
#include "ppapi/cpp/dev/file_system_dev.h"
#include "pp... | 32.15 | 79 | 0.730171 | meego-tablet-ux |
775d46e07c109be26bf81f1dfbb3b3d5529d49fc | 398 | cpp | C++ | 06_files_and_io/dll_path_example/main.cpp | Man-Ji/cmake_examples | ba715bdbb6e0e0eb97e37a09f351d9cae1b8da01 | [
"MIT"
] | 1 | 2022-02-27T17:38:31.000Z | 2022-02-27T17:38:31.000Z | 06_files_and_io/dll_path_example/main.cpp | Man-Ji/cmake_examples | ba715bdbb6e0e0eb97e37a09f351d9cae1b8da01 | [
"MIT"
] | null | null | null | 06_files_and_io/dll_path_example/main.cpp | Man-Ji/cmake_examples | ba715bdbb6e0e0eb97e37a09f351d9cae1b8da01 | [
"MIT"
] | null | null | null | #include <GL/freeglut.h>
void display() {
glClear(GL_COLOR_BUFFER_BIT);
glBegin(GL_POLYGON);
glVertex2f(-0.5, -0.5);
glVertex2f(-0.5, 0.5);
glVertex2f(0.5, 0.5);
glVertex2f(0.5, -0.5);
glEnd();
glFlush();
}
int main(int argc, char* argv[]) {
glutInit(&argc, argv);
glutCreateWindo... | 22.111111 | 34 | 0.605528 | Man-Ji |
7760b2b67ebac92d345c3ceb38a0807d21f042be | 1,843 | cpp | C++ | canny_transform/src/CannyTransform.cpp | facontidavide/Exercise_2 | b56e432badb2494433c9f3d735483cdc0c99c046 | [
"MIT"
] | null | null | null | canny_transform/src/CannyTransform.cpp | facontidavide/Exercise_2 | b56e432badb2494433c9f3d735483cdc0c99c046 | [
"MIT"
] | null | null | null | canny_transform/src/CannyTransform.cpp | facontidavide/Exercise_2 | b56e432badb2494433c9f3d735483cdc0c99c046 | [
"MIT"
] | null | null | null | #include <canny_transform/CannyTransform.hpp>
const char* WINDOW_NAME = "EdgeDetection";
//#define DEBUG_WINDOW
ImageCannyConverter::ImageCannyConverter(ros::NodeHandle& nodehanle)
: nh_(nodehanle), it_(nodehanle), low_threshold_(30)
{
// Subscribe to input video feed and publish output video feed
i... | 26.710145 | 93 | 0.705914 | facontidavide |
77621a30b0735cc6d42bb088cb375d2be833f111 | 3,513 | cpp | C++ | clang-tidy/fpga/SingleWorkItemBarrierCheck.cpp | vtsynergy/FLOCL | c248645c9da358bdc0fde8593ed3384dea6d5131 | [
"Apache-2.0"
] | null | null | null | clang-tidy/fpga/SingleWorkItemBarrierCheck.cpp | vtsynergy/FLOCL | c248645c9da358bdc0fde8593ed3384dea6d5131 | [
"Apache-2.0"
] | null | null | null | clang-tidy/fpga/SingleWorkItemBarrierCheck.cpp | vtsynergy/FLOCL | c248645c9da358bdc0fde8593ed3384dea6d5131 | [
"Apache-2.0"
] | null | null | null | //===--- SingleWorkItemBarrierCheck.cpp - clang-tidy-----------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | 36.59375 | 80 | 0.648733 | vtsynergy |
77629daf528a8be25ea3c4cbca692556cabf4d38 | 8,241 | cpp | C++ | algo/src/algo_sort.cpp | alex011235/algo | ce36c2673e037a12278117cb036550bee82ecadf | [
"MIT"
] | 2 | 2015-08-16T23:45:23.000Z | 2015-10-13T08:12:00.000Z | algo/src/algo_sort.cpp | alex011235/algorithm | ce36c2673e037a12278117cb036550bee82ecadf | [
"MIT"
] | 1 | 2021-03-21T16:33:53.000Z | 2021-03-21T16:33:53.000Z | algo/src/algo_sort.cpp | alex011235/algo | ce36c2673e037a12278117cb036550bee82ecadf | [
"MIT"
] | null | null | null | ///
/// \brief Source file for sort algorithms.
/// \author alex011235
/// \link <a href=https://github.com/alex011235/algo>Algo, Github</a>
///
#include "algo_sort.hpp"
#include <algorithm>
#include <cmath>
#include <list>
namespace algo::sort {
/////////////////////////////////////////////
/// Bubble-sort
////////... | 23.545714 | 94 | 0.55685 | alex011235 |
77664a641fb849526e079eba88c558d70f86b4fd | 241 | cpp | C++ | inclusion exclusion principle/01_divisible_by_A_or_B.cpp | omkarugale7/cpp | 21717ce36a4f0d88e850e8b7205470f812ca1d58 | [
"MIT"
] | 1 | 2022-02-23T17:27:42.000Z | 2022-02-23T17:27:42.000Z | inclusion exclusion principle/01_divisible_by_A_or_B.cpp | omkarugale7/cpp | 21717ce36a4f0d88e850e8b7205470f812ca1d58 | [
"MIT"
] | null | null | null | inclusion exclusion principle/01_divisible_by_A_or_B.cpp | omkarugale7/cpp | 21717ce36a4f0d88e850e8b7205470f812ca1d58 | [
"MIT"
] | null | null | null | //divisible by A or B under n
#include <iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int an = c / a;
int bn = c / b;
int ex = c / (a * b);
cout << an + bn - ex << endl;
return 0;
} | 17.214286 | 33 | 0.477178 | omkarugale7 |
7766d4ddc6c915502d33a650fce99d55ca91d458 | 162,699 | cpp | C++ | VirtualBox-5.0.0/src/VBox/Frontends/VirtualBox/src/settings/machine/UIMachineSettingsStorage.cpp | egraba/vbox_openbsd | 6cb82f2eed1fa697d088cecc91722b55b19713c2 | [
"MIT"
] | 1 | 2015-04-30T14:18:45.000Z | 2015-04-30T14:18:45.000Z | VirtualBox-5.0.0/src/VBox/Frontends/VirtualBox/src/settings/machine/UIMachineSettingsStorage.cpp | egraba/vbox_openbsd | 6cb82f2eed1fa697d088cecc91722b55b19713c2 | [
"MIT"
] | null | null | null | VirtualBox-5.0.0/src/VBox/Frontends/VirtualBox/src/settings/machine/UIMachineSettingsStorage.cpp | egraba/vbox_openbsd | 6cb82f2eed1fa697d088cecc91722b55b19713c2 | [
"MIT"
] | null | null | null | /* $Id: UIMachineSettingsStorage.cpp $ */
/** @file
* VBox Qt GUI - UIMachineSettingsStorage class implementation.
*/
/*
* Copyright (C) 2006-2012 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you ca... | 40.583437 | 158 | 0.633538 | egraba |
776e0cc3896268c22e56f0a80e187d4dad3130fe | 12,123 | hpp | C++ | include/simple_web_game_server/matchmaking_server.hpp | permutationlock/catacrawl | 433c4fa2c48f959691ab8573fdab4c2190bb9422 | [
"MIT"
] | 6 | 2021-04-28T21:25:06.000Z | 2022-01-23T21:57:28.000Z | include/simple_web_game_server/matchmaking_server.hpp | permutationlock/catacrawl | 433c4fa2c48f959691ab8573fdab4c2190bb9422 | [
"MIT"
] | null | null | null | include/simple_web_game_server/matchmaking_server.hpp | permutationlock/catacrawl | 433c4fa2c48f959691ab8573fdab4c2190bb9422 | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2020 Daniel Aven Bross
*
* 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, ... | 33.581717 | 81 | 0.633837 | permutationlock |
7771bc3611e6081547990679a733433e30bd211a | 1,539 | hpp | C++ | src/targets/gpu/device/include/migraphx/gpu/device/tensor_view.hpp | raramakr/AMDMIGraphX | 83e7425367f6ce850ec28fe716fe7c23ce34c79f | [
"MIT"
] | 72 | 2018-12-06T18:31:17.000Z | 2022-03-30T15:01:02.000Z | src/targets/gpu/device/include/migraphx/gpu/device/tensor_view.hpp | raramakr/AMDMIGraphX | 83e7425367f6ce850ec28fe716fe7c23ce34c79f | [
"MIT"
] | 1,006 | 2018-11-30T16:32:33.000Z | 2022-03-31T22:43:39.000Z | src/targets/gpu/device/include/migraphx/gpu/device/tensor_view.hpp | raramakr/AMDMIGraphX | 83e7425367f6ce850ec28fe716fe7c23ce34c79f | [
"MIT"
] | 36 | 2019-05-07T10:41:46.000Z | 2022-03-28T15:59:56.000Z |
#ifndef MIGRAPHX_GUARD_RTGLIB_DEVICE_TENSOR_VIEW_HPP
#define MIGRAPHX_GUARD_RTGLIB_DEVICE_TENSOR_VIEW_HPP
#include <migraphx/gpu/device/shape.hpp>
namespace migraphx {
inline namespace MIGRAPHX_INLINE_NS {
namespace gpu {
namespace device {
template <class T, index_int N>
struct hip_tensor_view
{
using value_ty... | 25.65 | 81 | 0.689409 | raramakr |
a55f659302864c4985ea2c298e859d8bc713e99a | 5,289 | hpp | C++ | gvsoc/gvsoc/engine/include/vp/power/power_table.hpp | 00-01/gap_sdk | 25444d752b26ccf0b848301c381692d77172852c | [
"Apache-2.0"
] | null | null | null | gvsoc/gvsoc/engine/include/vp/power/power_table.hpp | 00-01/gap_sdk | 25444d752b26ccf0b848301c381692d77172852c | [
"Apache-2.0"
] | null | null | null | gvsoc/gvsoc/engine/include/vp/power/power_table.hpp | 00-01/gap_sdk | 25444d752b26ccf0b848301c381692d77172852c | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2020 GreenWaves Technologies, SAS, ETH Zurich and
* University of Bologna
*
* 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.apac... | 35.979592 | 118 | 0.575534 | 00-01 |
a55f792c1b054c7c725b55b4586a5fb760ccda42 | 5,492 | cpp | C++ | test/test_vmath_types_vector3.cpp | dbacchet/vmath | 6b49d572f9a711ab8f719428ddd94e82f3b7dfb8 | [
"MIT"
] | 1 | 2021-02-10T17:40:44.000Z | 2021-02-10T17:40:44.000Z | test/test_vmath_types_vector3.cpp | dbacchet/vmath | 6b49d572f9a711ab8f719428ddd94e82f3b7dfb8 | [
"MIT"
] | 1 | 2020-03-28T20:19:35.000Z | 2020-03-28T20:19:35.000Z | test/test_vmath_types_vector3.cpp | dbacchet/vmath | 6b49d572f9a711ab8f719428ddd94e82f3b7dfb8 | [
"MIT"
] | null | null | null | #include "vmath_types.h"
#include <gtest/gtest.h>
#include <cmath>
#include <vector>
#include <numeric>
// /////// //
// Vector3 //
// /////// //
TEST(Vector3, constructors) {
// default constructor
math::Vector3d v1;
ASSERT_DOUBLE_EQ(v1.x, 0.0);
ASSERT_DOUBLE_EQ(v1.y, 0.0);
ASSERT_DOUBLE_EQ(v1... | 27.188119 | 56 | 0.580481 | dbacchet |
a560221f08be3e4d705def136f142a91880c4547 | 4,904 | cpp | C++ | 3rdParty/B-Human/Streaming/InStreams.cpp | HULKs/CompiledNN | 4f0a347a0f0f717eba2cc3efa81669106660f35c | [
"MIT"
] | 21 | 2019-06-18T16:45:08.000Z | 2021-08-22T23:56:29.000Z | 3rdParty/B-Human/Streaming/InStreams.cpp | HULKs/CompiledNN | 4f0a347a0f0f717eba2cc3efa81669106660f35c | [
"MIT"
] | 20 | 2019-09-23T15:04:49.000Z | 2021-12-16T09:43:07.000Z | 3rdParty/B-Human/Streaming/InStreams.cpp | HULKs/CompiledNN | 4f0a347a0f0f717eba2cc3efa81669106660f35c | [
"MIT"
] | 10 | 2019-07-08T05:38:53.000Z | 2021-12-19T18:06:05.000Z | /**
* @file InStreams.cpp
*
* Implementation of in stream classes.
*
* @author Thomas Röfer
* @author Martin Lötzsch
*/
#include "InStreams.h"
#include "Platform/BHAssert.h"
#include <cstring>
#include <cstdlib>
#include <cstdio>
void StreamReader::skipData(size_t size, PhysicalInStream& stream)
{
// defaul... | 20.348548 | 101 | 0.607259 | HULKs |
a5669b1fab7a6f7f6021df4c199a894a73432e0d | 759 | cpp | C++ | 05-unit-testing/boost/unit_tests.cpp | yangxl-2014-fe/cmake-examples | 0675e0fcb7a4f70dc7ae179fcda520b42e83dd7d | [
"MIT"
] | 8,249 | 2015-12-01T20:22:26.000Z | 2022-03-31T09:32:28.000Z | 05-unit-testing/boost/unit_tests.cpp | Star2510965709/cmake-examples | 2b27fc75c40447c8cf9b371cc21224dd96d6ce45 | [
"MIT"
] | 43 | 2015-12-01T15:17:40.000Z | 2022-03-18T11:40:54.000Z | 05-unit-testing/boost/unit_tests.cpp | Star2510965709/cmake-examples | 2b27fc75c40447c8cf9b371cc21224dd96d6ce45 | [
"MIT"
] | 2,016 | 2016-11-15T16:27:47.000Z | 2022-03-31T07:11:43.000Z | #include <string>
#include "Reverse.h"
#include "Palindrome.h"
#define BOOST_TEST_MODULE VsidCommonTest
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_SUITE( reverse_tests )
BOOST_AUTO_TEST_CASE( simple )
{
std::string toRev = "Hello";
Reverse rev;
std::string res = rev.reverse(toRev);
BOOST_C... | 16.148936 | 55 | 0.710145 | yangxl-2014-fe |
a569f1b2d7918a58878fb57ea66dbf515b550877 | 8,159 | cc | C++ | HealpixBaseExtended.cc | bjbuckman/galprop_bb_ | 076b168f7475b3ba9fb198b6ec2df7be66b1763c | [
"MIT"
] | null | null | null | HealpixBaseExtended.cc | bjbuckman/galprop_bb_ | 076b168f7475b3ba9fb198b6ec2df7be66b1763c | [
"MIT"
] | null | null | null | HealpixBaseExtended.cc | bjbuckman/galprop_bb_ | 076b168f7475b3ba9fb198b6ec2df7be66b1763c | [
"MIT"
] | null | null | null | #include "HealpixBaseExtended.h"
#include "config.h"
#ifdef HAVE_LSCONSTANTS_H
#include "lsconstants.h"
#endif
#include <vector>
#include <iterator>
#include <algorithm>
#include <set>
#include <cmath>
// this is in HEALPIX V3.11, not in V2.20a. But not needed. AWS20131202
/*
int Healpix_Base::ring_above (double z) ... | 45.837079 | 132 | 0.596887 | bjbuckman |
a56a80c3c402d2a1f5b98d5d0a6e296c8eee17bd | 8,367 | cpp | C++ | core/src/index/knowhere/knowhere/index/vector_index/fpga/Apu.cpp | owlwang/milvus | b73abf22b4c85fde2beb98229dac36bba793652e | [
"Apache-2.0"
] | null | null | null | core/src/index/knowhere/knowhere/index/vector_index/fpga/Apu.cpp | owlwang/milvus | b73abf22b4c85fde2beb98229dac36bba793652e | [
"Apache-2.0"
] | null | null | null | core/src/index/knowhere/knowhere/index/vector_index/fpga/Apu.cpp | owlwang/milvus | b73abf22b4c85fde2beb98229dac36bba793652e | [
"Apache-2.0"
] | null | null | null | // Copyright (C) 2019-2020 Zilliz. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable l... | 33.60241 | 119 | 0.628541 | owlwang |
a56afe707632f49f877910d723b126e89bfb9c35 | 769 | cpp | C++ | LeetCode/GenerateParentheses/generateparentheses.cpp | sharmakarish/CPP-Questions-and-Solutions | a2cbcb7b7de4df2849af352af763a0904f834e56 | [
"MIT"
] | 42 | 2021-09-26T18:02:52.000Z | 2022-03-15T01:52:15.000Z | LeetCode/GenerateParentheses/generateparentheses.cpp | sharmakarish/CPP-Questions-and-Solutions | a2cbcb7b7de4df2849af352af763a0904f834e56 | [
"MIT"
] | 404 | 2021-09-24T19:55:10.000Z | 2021-11-03T05:47:47.000Z | LeetCode/GenerateParentheses/generateparentheses.cpp | sharmakarish/CPP-Questions-and-Solutions | a2cbcb7b7de4df2849af352af763a0904f834e56 | [
"MIT"
] | 140 | 2021-09-22T20:50:04.000Z | 2022-01-22T16:59:09.000Z | #include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
// Member function will return the anwser of string datatype
vector<string> result;
vector<string> generateParenthesis(int n) {
helper("", n, 0, 0);
// Returning the finial answer
return result;
}
... | 24.03125 | 77 | 0.555267 | sharmakarish |
a56c01b623c8fe6c153ce8e35d93f59e2cb9e6a3 | 2,262 | hpp | C++ | LevelBattle.hpp | PraiseHelix/Pocket-Animals | fe129e76128b8a986ae59b714b81fc72fde574de | [
"MIT"
] | null | null | null | LevelBattle.hpp | PraiseHelix/Pocket-Animals | fe129e76128b8a986ae59b714b81fc72fde574de | [
"MIT"
] | 5 | 2019-02-01T13:48:16.000Z | 2019-02-03T14:02:39.000Z | LevelBattle.hpp | PraiseHelix/PocketAnimals | fe129e76128b8a986ae59b714b81fc72fde574de | [
"MIT"
] | null | null | null | #pragma once
#include "..\SGPE\Level.hpp"
#include "..\SGPE\GameObject.hpp"
#include "GraphicsSFML.hpp"
#include "..\BattleSystem\TimeManager.hpp"
#include "..\BattleSystem\BattleGraphics.hpp"
#include "..\BattleSystem\BattleSystem.hpp"
#include "..\BattleSystem\InterLevelData.hpp"
#include "..\BattleSystem\BattlePlay... | 22.39604 | 72 | 0.730327 | PraiseHelix |
a56dc3f480d91c6f962c2bb814db0b4b6b8f6659 | 5,205 | cxx | C++ | src/test/test_healpix.cxx | fermi-lat/healpix | 965e5f075dc9f45ed1d69037e4c3986727a3a01e | [
"BSD-3-Clause"
] | null | null | null | src/test/test_healpix.cxx | fermi-lat/healpix | 965e5f075dc9f45ed1d69037e4c3986727a3a01e | [
"BSD-3-Clause"
] | 1 | 2019-02-07T22:30:39.000Z | 2019-03-15T18:21:55.000Z | src/test/test_healpix.cxx | fermi-lat/healpix | 965e5f075dc9f45ed1d69037e4c3986727a3a01e | [
"BSD-3-Clause"
] | null | null | null | /** @file test_healpix.cxx
@brief Test program for various healpix routines
@author M. Roth, T. Burnett
$Header: /nfs/slac/g/glast/ground/cvs/users/echarles/healpix_changes/healpix/src/test/test_healpix.cxx,v 1.4 2015/03/05 19:58:41 echarles Exp $
*/
#include "healpix/Map.h"
// EAC, the error handling has changed
#i... | 32.943038 | 143 | 0.517963 | fermi-lat |
a56e5ae4a07ea758d45934bcc0962785127ba722 | 1,031 | cpp | C++ | tute02.cpp | SLIIT-FacultyOfComputing/tutorial-02b-IT21161360 | 60ce7414f7b72c0ea3831e90e8e18de8d9bd87cd | [
"MIT"
] | null | null | null | tute02.cpp | SLIIT-FacultyOfComputing/tutorial-02b-IT21161360 | 60ce7414f7b72c0ea3831e90e8e18de8d9bd87cd | [
"MIT"
] | null | null | null | tute02.cpp | SLIIT-FacultyOfComputing/tutorial-02b-IT21161360 | 60ce7414f7b72c0ea3831e90e8e18de8d9bd87cd | [
"MIT"
] | null | null | null | /*Exercise 2 - Selection
Convert the C program given below which calculates an employee's salary to a C++ program.
Input Type, Salary, otHours
Type = 1
OtRate = 1000
Type = 2
OtRate = 1500
Type = 3
OtRate = 1700
Please Note that the input command in C++ is std::cin. This is a representation of the Keyboard.*/
#incl... | 15.621212 | 98 | 0.682832 | SLIIT-FacultyOfComputing |
a56f546156502e3d4565f9dad7525b8121804816 | 446 | cpp | C++ | CodeForces/112A.cpp | tapaswenipathak/Competitive-Programming | 97bba0f2ccdf587df93244a027050489f0905480 | [
"MIT"
] | 2 | 2019-04-20T18:03:20.000Z | 2019-08-17T21:20:47.000Z | CodeForces/112A.cpp | tapaswenipathak/Competitive-Programming | 97bba0f2ccdf587df93244a027050489f0905480 | [
"MIT"
] | null | null | null | CodeForces/112A.cpp | tapaswenipathak/Competitive-Programming | 97bba0f2ccdf587df93244a027050489f0905480 | [
"MIT"
] | 1 | 2019-04-20T18:03:26.000Z | 2019-04-20T18:03:26.000Z | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main()
{
char s1[205], s2[205];
cin >> s1 >> s2;
for( int i = 0; s1[i]; ++i ){
s1[i] = tolower(s1[i]);
}
for( int i = 0; s2[i]; ++i ){
s2[i] = tolower(s2[i]);
}
if( strcmp(s1, s2) == 0 ){
printf( "0" );
... | 15.37931 | 33 | 0.457399 | tapaswenipathak |
a56ff9cdb67053a31224c5b50e32f13e028d4557 | 8,533 | hpp | C++ | include/cppgit2/checkout.hpp | jhasse/cppgit2 | 7c069680bcfa70686053bc1f573524813c1f206f | [
"MIT"
] | 84 | 2020-03-22T14:03:37.000Z | 2022-01-04T05:51:55.000Z | include/cppgit2/checkout.hpp | jhasse/cppgit2 | 7c069680bcfa70686053bc1f573524813c1f206f | [
"MIT"
] | 7 | 2020-03-27T21:36:13.000Z | 2020-12-05T23:41:25.000Z | include/cppgit2/checkout.hpp | jhasse/cppgit2 | 7c069680bcfa70686053bc1f573524813c1f206f | [
"MIT"
] | 18 | 2020-04-25T09:55:17.000Z | 2022-03-06T23:20:43.000Z | #pragma once
#include <cppgit2/bitmask_operators.hpp>
#include <cppgit2/git_exception.hpp>
#include <cppgit2/index.hpp>
#include <cppgit2/libgit2_api.hpp>
#include <cppgit2/strarray.hpp>
#include <cppgit2/tree.hpp>
#include <git2.h>
#include <string>
#include <vector>
namespace cppgit2 {
class checkout : public libgi... | 32.945946 | 80 | 0.666237 | jhasse |
a5727aefdb51e3fbbfef6e804339b75c777a0700 | 2,929 | cpp | C++ | SystemManager.cpp | dsedb/space_deadbeef2 | 74664f836a21b6ffa6a3944b4d41a8e39c7e5a67 | [
"MIT"
] | 1 | 2019-04-24T11:01:38.000Z | 2019-04-24T11:01:38.000Z | SystemManager.cpp | dsedb/space_deadbeef2 | 74664f836a21b6ffa6a3944b4d41a8e39c7e5a67 | [
"MIT"
] | null | null | null | SystemManager.cpp | dsedb/space_deadbeef2 | 74664f836a21b6ffa6a3944b4d41a8e39c7e5a67 | [
"MIT"
] | null | null | null | /* -*- mode:C++; coding:utf-8-with-signature -*-
*
* SystemManager.cpp - Project PetitShooter
*
* Copyright (c) 2017 Yuji YASUHARA
*
* 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 w... | 27.895238 | 89 | 0.754524 | dsedb |
a574cd3ed77604d5fabc0b9ea72bb01e07fb4e86 | 727 | cpp | C++ | archsim/src/blockjit/block-compiler/lowering/x86/LowerRet.cpp | Linestro/Gensim_Y | 031b74234a92622cf2d2d2ebc2d5ba03ca28ecf8 | [
"MIT"
] | 10 | 2020-07-14T22:09:30.000Z | 2022-01-11T09:57:52.000Z | archsim/src/blockjit/block-compiler/lowering/x86/LowerRet.cpp | Linestro/Gensim_Y | 031b74234a92622cf2d2d2ebc2d5ba03ca28ecf8 | [
"MIT"
] | 6 | 2020-07-09T12:01:57.000Z | 2021-04-27T10:23:58.000Z | archsim/src/blockjit/block-compiler/lowering/x86/LowerRet.cpp | Linestro/Gensim_Y | 031b74234a92622cf2d2d2ebc2d5ba03ca28ecf8 | [
"MIT"
] | 10 | 2020-07-29T17:05:26.000Z | 2021-12-04T14:57:15.000Z | /* This file is Copyright University of Edinburgh 2018. For license details, see LICENSE. */
/*
* LowerRet.cpp
*
* Created on: 16 Nov 2015
* Author: harry
*/
#include "blockjit/block-compiler/lowering/x86/X86LoweringContext.h"
#include "blockjit/block-compiler/lowering/x86/X86Lowerers.h"
#include "blockjit... | 25.068966 | 92 | 0.748281 | Linestro |
a574d35e51bce2a6f25705ea3d59646bfe900a3e | 681 | cpp | C++ | src/MazeFactoryEasy.cpp | anqin-gh/minimaze | cfa3df279c75d5fe95a2e69af4569a3981a6f274 | [
"MIT"
] | null | null | null | src/MazeFactoryEasy.cpp | anqin-gh/minimaze | cfa3df279c75d5fe95a2e69af4569a3981a6f274 | [
"MIT"
] | null | null | null | src/MazeFactoryEasy.cpp | anqin-gh/minimaze | cfa3df279c75d5fe95a2e69af4569a3981a6f274 | [
"MIT"
] | null | null | null | #include <new>
#include <EnemyLR.h>
#include <Goal.h>
#include <MazeFactoryEasy.h>
#include <Player.h>
#include <WallNormal.h>
namespace minimaze {
Player* MazeFactoryEasy::create_player(int8_t x, int8_t y) const {
Player* p = new Player();
p->set_location(x, y);
return p;
}
Enemy* MazeFactoryEasy::create_enemy(... | 18.916667 | 66 | 0.688693 | anqin-gh |
a5757f9c7e62686478c045fe0c6f963ef1f00f2d | 153 | hpp | C++ | include/nekoman.hpp | bonohub13/nekoman_speak | f60caa24ee2db88128263c92133a2e93dc9f51f6 | [
"MIT"
] | null | null | null | include/nekoman.hpp | bonohub13/nekoman_speak | f60caa24ee2db88128263c92133a2e93dc9f51f6 | [
"MIT"
] | null | null | null | include/nekoman.hpp | bonohub13/nekoman_speak | f60caa24ee2db88128263c92133a2e93dc9f51f6 | [
"MIT"
] | null | null | null | #pragma once
#include <iostream>
#include <string>
#include <array>
namespace nekoman
{
using namespace std;
array<string, 9> get_nekoman();
} | 12.75 | 35 | 0.69281 | bonohub13 |
a578a5f9d0075ccc6e134af7cf427730de82326f | 404 | hpp | C++ | Messy_Test-master/demo/DesignPatternsTest/Context_2.hpp | shenjl/Cplusplus | 345c2f582bf160d663c8accfafbcabc2ff011e57 | [
"MIT"
] | 1 | 2019-11-10T08:23:00.000Z | 2019-11-10T08:23:00.000Z | Messy_Test-master/demo/DesignPatternsTest/Context_2.hpp | selonsy/Cplusplus | 345c2f582bf160d663c8accfafbcabc2ff011e57 | [
"MIT"
] | null | null | null | Messy_Test-master/demo/DesignPatternsTest/Context_2.hpp | selonsy/Cplusplus | 345c2f582bf160d663c8accfafbcabc2ff011e57 | [
"MIT"
] | null | null | null | #ifndef FBC_MESSY_TEST_CONTEXT2_HPP_
#define FBC_MESSY_TEST_CONTEXT2_HPP_
class Strategy_4;
/*
这个类是Strategy模式的关键，也是Strategy模式和Template模式的根本区别所在。
Strategy通过"组合"(委托)方式实现算法(实现)的异构，而Template模式则采取的是继承的方式。
这两个模式的区别也是继承和组合两种实现接口重用的方式的区别
*/
class Context_4
{
public:
Context_4(Strategy_4* stg);
~Context_4();
void DoAction(... | 18.363636 | 54 | 0.819307 | shenjl |
a57f9a60c6fc57db552efc524eb477aba20a792d | 89,972 | cpp | C++ | private/shell/shell32/browse.cpp | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 11 | 2017-09-02T11:27:08.000Z | 2022-01-02T15:25:24.000Z | private/shell/shell32/browse.cpp | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | null | null | null | private/shell/shell32/browse.cpp | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 14 | 2019-01-16T01:01:23.000Z | 2022-02-20T15:54:27.000Z | #include "shellprv.h"
extern "C" {
#include "ids.h"
};
#include "findhlp.h"
#include "shitemid.h"
#include "docfind.h"
#include <inetreg.h>
#include <help.h>
class CSHBrowseForFolder;
#define RECTWIDTH(_rc) ((_rc).right - (_rc).left)
#define RECTHEIGHT(_rc) ((_rc).bottom - (_rc).top)
... | 32.752821 | 192 | 0.572089 | King0987654 |
a5869e4ebe83dda4b34381154263277f82c30e23 | 1,919 | cpp | C++ | cpp/110.balanced-binary-tree.cpp | vermouth1992/Leetcode | 0d7dda52b12f9e01d88fc279243742cd8b4bcfd1 | [
"MIT"
] | null | null | null | cpp/110.balanced-binary-tree.cpp | vermouth1992/Leetcode | 0d7dda52b12f9e01d88fc279243742cd8b4bcfd1 | [
"MIT"
] | null | null | null | cpp/110.balanced-binary-tree.cpp | vermouth1992/Leetcode | 0d7dda52b12f9e01d88fc279243742cd8b4bcfd1 | [
"MIT"
] | null | null | null | /*
* @lc app=leetcode id=110 lang=cpp
*
* [110] Balanced Binary Tree
*
* https://leetcode.com/problems/balanced-binary-tree/description/
*
* algorithms
* Easy (45.02%)
* Total Accepted: 603.8K
* Total Submissions: 1.3M
* Testcase Example: '[3,9,20,null,null,15,7]'
*
* Given a binary tree, determine if ... | 21.087912 | 93 | 0.565399 | vermouth1992 |
a586e7e4e33ef63dde7cca454d0084b2f8b816a7 | 1,614 | cpp | C++ | cpp-projects/tiny-apps/fuzzy-c-means/main.cpp | juxiangwu/image-processing | c644ef3386973b2b983c6b6b08f15dc8d52cd39f | [
"Apache-2.0"
] | 13 | 2018-09-07T02:29:07.000Z | 2021-06-18T08:40:09.000Z | cpp-projects/tiny-apps/fuzzy-c-means/main.cpp | juxiangwu/image-processing | c644ef3386973b2b983c6b6b08f15dc8d52cd39f | [
"Apache-2.0"
] | null | null | null | cpp-projects/tiny-apps/fuzzy-c-means/main.cpp | juxiangwu/image-processing | c644ef3386973b2b983c6b6b08f15dc8d52cd39f | [
"Apache-2.0"
] | 4 | 2019-06-20T00:09:39.000Z | 2021-07-15T10:14:36.000Z |
#include "fuzzy_clustering.hpp"
#include <opencv/cxcore.h>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <time.h>
#include <sstream>
//#include <glog/logging.h>
#include <opencv2/core/core.hpp>
int main (int argc, char **argv) {
// google::InitGoogleLogging (argv[0]);
// goo... | 23.391304 | 86 | 0.614002 | juxiangwu |
a58886fc5d1553c994b7a6bdc2e62d18c227431d | 6,513 | cpp | C++ | ModuleBanker.cpp | mindcrunch4u/Kernel-Simulator | bc3ffc603a9d2099ae2b3c7879f7e35f7ed5cbd5 | [
"MIT"
] | null | null | null | ModuleBanker.cpp | mindcrunch4u/Kernel-Simulator | bc3ffc603a9d2099ae2b3c7879f7e35f7ed5cbd5 | [
"MIT"
] | null | null | null | ModuleBanker.cpp | mindcrunch4u/Kernel-Simulator | bc3ffc603a9d2099ae2b3c7879f7e35f7ed5cbd5 | [
"MIT"
] | null | null | null | #include <iomanip>
#include <sstream>
#include "ModuleBanker.h"
#include "SystemStatus.h"
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define FALSE 0
#define TRUE 1
int ModuleBanker::findIndexById(int id){
for(int index=0; index<SystemStatus::Max.size(); index++){
if( SystemStatus... | 24.393258 | 147 | 0.644096 | mindcrunch4u |
a58906577ba41ea1c9d0c26f3d26af8963f21b8e | 1,811 | cpp | C++ | PSME/agent/network/src/api/netlink/lag_message.cpp | opencomputeproject/HWMgmt-DeviceMgr-PSME | 2a00188aab6f4bef3776987f0842ef8a8ea972ac | [
"Apache-2.0"
] | 5 | 2021-10-07T15:36:37.000Z | 2022-03-01T07:21:49.000Z | PSME/agent/network/src/api/netlink/lag_message.cpp | opencomputeproject/DM-Redfish-PSME | 912f7b6abf5b5c2aae33c75497de4753281c6a51 | [
"Apache-2.0"
] | null | null | null | PSME/agent/network/src/api/netlink/lag_message.cpp | opencomputeproject/DM-Redfish-PSME | 912f7b6abf5b5c2aae33c75497de4753281c6a51 | [
"Apache-2.0"
] | 1 | 2021-03-24T19:37:58.000Z | 2021-03-24T19:37:58.000Z | /*!
* @section LICENSE
*
* @copyright
* Copyright (c) 2015-2017 Intel Corporation
*
* @copyright
* 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
*
* @copyright
* http://www.apach... | 27.439394 | 75 | 0.693539 | opencomputeproject |
a590f320b058460b91c122deb556efa6fdd8d783 | 1,155 | cc | C++ | src/DeletableDc.cc | itsuart/win-cpp-wrappers | a5c85c96cde46a043a2a2d90fe6671e21e8b6253 | [
"Unlicense"
] | 1 | 2019-01-11T18:39:14.000Z | 2019-01-11T18:39:14.000Z | src/DeletableDc.cc | itsuart/win-cpp-wrappers | a5c85c96cde46a043a2a2d90fe6671e21e8b6253 | [
"Unlicense"
] | null | null | null | src/DeletableDc.cc | itsuart/win-cpp-wrappers | a5c85c96cde46a043a2a2d90fe6671e21e8b6253 | [
"Unlicense"
] | null | null | null | #pragma comment(lib, "gdi32.lib")
#include "DeletableDc.h"
#include <utility>
namespace helpers {
void swap(DeletableDc& lhs, DeletableDc& rhs) noexcept {
std::swap(lhs.m_hdc, rhs.m_hdc);
}
DeletableDc::DeletableDc(HDC hdc) noexcept
: m_hdc(hdc)
{}
DeletableDc::~DeletableDc() noexc... | 19.913793 | 69 | 0.554978 | itsuart |
a5935f8a0d4c0faaa058063f6bef00f397bca125 | 1,679 | cc | C++ | leetcode/18/main.cc | jinzhao1994/ACM | 5846032df31ab000deb57d8cbb8cb4c27c0e955b | [
"WTFPL"
] | 2 | 2015-07-22T01:26:47.000Z | 2015-08-30T11:33:19.000Z | leetcode/18/main.cc | jinzhao1994/ACM | 5846032df31ab000deb57d8cbb8cb4c27c0e955b | [
"WTFPL"
] | null | null | null | leetcode/18/main.cc | jinzhao1994/ACM | 5846032df31ab000deb57d8cbb8cb4c27c0e955b | [
"WTFPL"
] | null | null | null | /*
Given an array nums of n integers and an integer target,
are there elements a, b, c, and d in nums such that a + b + c + d = target?
Find all unique quadruplets in the array which gives the sum of target.
Note:
The solution set must not contain duplicate quadruplets.
Example:
Given array nums = [1, 0, -1, 0, -2... | 29.982143 | 79 | 0.437761 | jinzhao1994 |
a5954714668085262a28553ec5328e9ea7afa6f7 | 2,977 | cpp | C++ | sources/Device/src/Hardware/Memory/ExtRAM.cpp | Sasha7b9/S8-57M | 53b6e4ebf83140bcde9dda9eb35c43fe0f0bc97e | [
"MIT"
] | null | null | null | sources/Device/src/Hardware/Memory/ExtRAM.cpp | Sasha7b9/S8-57M | 53b6e4ebf83140bcde9dda9eb35c43fe0f0bc97e | [
"MIT"
] | null | null | null | sources/Device/src/Hardware/Memory/ExtRAM.cpp | Sasha7b9/S8-57M | 53b6e4ebf83140bcde9dda9eb35c43fe0f0bc97e | [
"MIT"
] | null | null | null | #include "defines.h"
#include "Hardware/Timer.h"
#include "Hardware/HAL/HAL.h"
#include "Hardware/HAL/HAL_PIO.h"
#include "Hardware/Memory/ExtRAM.h"
#include <cstdlib>
#include <cstring>
#define SIZE_RAM (512 * 1024)
#ifdef GUI
static uint8 ram[SIZE_RAM];
#endif
uint8 *ExtRAM::Begin()
{
#ifdef GUI
return ram;... | 16.631285 | 69 | 0.554249 | Sasha7b9 |
a59a6aef12e8498cd2b3406c88c0a3dd900365eb | 890 | cpp | C++ | src/LagrangianState.cpp | adegenna/HardSphereDynamics | 0df9aefffbbc5c9c7b96fd689ccc4deb0f3e1507 | [
"0BSD"
] | 1 | 2021-09-22T11:22:00.000Z | 2021-09-22T11:22:00.000Z | src/LagrangianState.cpp | adegenna/HardSphereDynamics | 0df9aefffbbc5c9c7b96fd689ccc4deb0f3e1507 | [
"0BSD"
] | null | null | null | src/LagrangianState.cpp | adegenna/HardSphereDynamics | 0df9aefffbbc5c9c7b96fd689ccc4deb0f3e1507 | [
"0BSD"
] | null | null | null | #include "LagrangianState.h"
#include "Inputfile.hpp"
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <istream>
#include <random>
#include <cmath>
#include <iostream>
#include <iterator>
#include <omp.h>
#include <sys/time.h>
using namespace std;
using namespace Eigen;
Lagrangia... | 21.707317 | 78 | 0.722472 | adegenna |
a59c0db9a6ec04ab5cdccb3c63dc3597e7d6046a | 5,726 | cpp | C++ | src-ui/Reader.cpp | ZhaohengLi/library-management | ffdd50e367f50354e07f5cd7aff9c826aac837b0 | [
"Apache-2.0"
] | 2 | 2021-09-06T17:13:19.000Z | 2022-03-02T06:47:31.000Z | src-ui/Reader.cpp | ZhaohengLi/library-management | ffdd50e367f50354e07f5cd7aff9c826aac837b0 | [
"Apache-2.0"
] | null | null | null | src-ui/Reader.cpp | ZhaohengLi/library-management | ffdd50e367f50354e07f5cd7aff9c826aac837b0 | [
"Apache-2.0"
] | null | null | null | #include "Reader.h"
#include "History.h"
#include <bits/stdc++.h>
#include <QObject>
#include <QDebug>
#define BR BaseReader
#define RL ReaderList
#define BH BaseHistory
using namespace std;
//Reader.cpp
//BaseReader:
bool BR::match(const string &s) const {
return rid==s||rname==s;
}
bool BR::Qmatchrid(const strin... | 22.280156 | 111 | 0.628013 | ZhaohengLi |
a5a2c388af876c7a6f194e5c1d7d9e7410419a75 | 4,548 | cpp | C++ | super-mario-dx10/05-SceneManager/main.cpp | HoangTuan0611/Game | 64bbf4396ff38d17d3516c1eae687033f954d769 | [
"MIT"
] | null | null | null | super-mario-dx10/05-SceneManager/main.cpp | HoangTuan0611/Game | 64bbf4396ff38d17d3516c1eae687033f954d769 | [
"MIT"
] | null | null | null | super-mario-dx10/05-SceneManager/main.cpp | HoangTuan0611/Game | 64bbf4396ff38d17d3516c1eae687033f954d769 | [
"MIT"
] | null | null | null | /* =============================================================
INTRODUCTION TO GAME PROGRAMMING SE102
SAMPLE 05 - SCENE MANAGER
This sample illustrates how to:
1/ Read scene (textures, sprites, animations and objects) from files
2/ Handle multiple scenes in game
Key classes/functions:
CScene
CPlayScen... | 21.760766 | 113 | 0.69723 | HoangTuan0611 |
a5a332f16de31f2a10f2003d1391d287a1e3a341 | 1,147 | cpp | C++ | src/homework/04_iteration/main.cpp | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-ryan-f1 | d11ef12dda2bf441ad4fde38e7da5a0957a81bd6 | [
"MIT"
] | null | null | null | src/homework/04_iteration/main.cpp | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-ryan-f1 | d11ef12dda2bf441ad4fde38e7da5a0957a81bd6 | [
"MIT"
] | null | null | null | src/homework/04_iteration/main.cpp | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-ryan-f1 | d11ef12dda2bf441ad4fde38e7da5a0957a81bd6 | [
"MIT"
] | null | null | null | //write include statements
#include "dna.h"
#include<iostream>
//write using statements
using std::cout; using std::cin; using std::string;
/*
Write code that prompts user to enter 1 for Get GC Content,
or 2 for Get DNA Complement. The program will prompt user for a
DNA string and call either get gc content or get ... | 23.895833 | 103 | 0.665214 | acc-cosc-1337-spring-2021 |
a5a3c9cae05f8d8603b37bb290de0dae8cf56730 | 10,815 | cpp | C++ | qws/src/gui/QTableWidgetItem.cpp | keera-studios/hsQt | 8aa71a585cbec40005354d0ee43bce9794a55a9a | [
"BSD-2-Clause"
] | 42 | 2015-02-16T19:29:16.000Z | 2021-07-25T11:09:03.000Z | qws/src/gui/QTableWidgetItem.cpp | keera-studios/hsQt | 8aa71a585cbec40005354d0ee43bce9794a55a9a | [
"BSD-2-Clause"
] | 1 | 2017-11-23T12:49:25.000Z | 2017-11-23T12:49:25.000Z | qws/src/gui/QTableWidgetItem.cpp | keera-studios/hsQt | 8aa71a585cbec40005354d0ee43bce9794a55a9a | [
"BSD-2-Clause"
] | 5 | 2015-10-15T21:25:30.000Z | 2017-11-22T13:18:24.000Z | /////////////////////////////////////////////////////////////////////////////
//
// File : QTableWidgetItem.cpp
// Copyright : (c) David Harley 2010
// Project : qtHaskell
// Version : 1.1.4
// Modified : 2010-09-02 17:02:00
//
// Warning : this file is machine gene... | 33.586957 | 133 | 0.713731 | keera-studios |
a5a55785d16c0776771febb562ea2df534e17a29 | 1,573 | cpp | C++ | src/propertybrowser/propertymanager/charpropertymanager.cpp | bitdewy/Ya | 9e075712b311a2403b4cc0ef5be24b05f523be3e | [
"BSD-3-Clause"
] | null | null | null | src/propertybrowser/propertymanager/charpropertymanager.cpp | bitdewy/Ya | 9e075712b311a2403b4cc0ef5be24b05f523be3e | [
"BSD-3-Clause"
] | null | null | null | src/propertybrowser/propertymanager/charpropertymanager.cpp | bitdewy/Ya | 9e075712b311a2403b4cc0ef5be24b05f523be3e | [
"BSD-3-Clause"
] | null | null | null | /****************************************************************************
**
** BSD 3-Clause License
**
** Copyright (c) 2017, bitdewy
** All rights reserved.
**
****************************************************************************/
#include "charpropertymanager.h"
#include "private/charpropertyma... | 26.661017 | 83 | 0.623013 | bitdewy |
a5a9c867cf4eda233717bc988bf4a5fd7b8a4292 | 561 | cpp | C++ | temp/c.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | 4 | 2020-10-05T19:24:10.000Z | 2021-07-15T00:45:43.000Z | temp/c.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | null | null | null | temp/c.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | null | null | null | #include <cpplib/stdinc.hpp>
int32_t main(){
desync();
int n, m, h;
cin >> n >> m >> h;
n--;
int sum = 0, hx;
for(int i=1; i<=m; ++i){
int x;
cin >> x;
if(i != h)
sum += x;
else
hx = x-1;
}
if(sum+hx< n)
cout << -1 << endl;... | 18.7 | 43 | 0.354724 | tysm |
a5aa23843fee02aae0544ba7b1a526be89c1cecd | 270 | cpp | C++ | tests/codegen/if_variable.cpp | xuchunmei000/bpftrace | 44c6cbd4f8d40c64a74b4a3ffad22532c5c05385 | [
"Apache-2.0"
] | 5,119 | 2018-10-08T15:19:24.000Z | 2022-03-31T15:03:48.000Z | tests/codegen/if_variable.cpp | xuchunmei000/bpftrace | 44c6cbd4f8d40c64a74b4a3ffad22532c5c05385 | [
"Apache-2.0"
] | 1,568 | 2018-10-08T19:14:25.000Z | 2022-03-31T01:44:41.000Z | tests/codegen/if_variable.cpp | xuchunmei000/bpftrace | 44c6cbd4f8d40c64a74b4a3ffad22532c5c05385 | [
"Apache-2.0"
] | 838 | 2018-10-08T20:16:47.000Z | 2022-03-31T06:15:58.000Z | #include "common.h"
namespace bpftrace {
namespace test {
namespace codegen {
TEST(codegen, if_variable)
{
test("kprobe:f { if (pid > 10000) { $s = 10 } printf(\"s = %d\", $s); }",
NAME);
}
} // namespace codegen
} // namespace test
} // namespace bpftrace
| 15.882353 | 75 | 0.611111 | xuchunmei000 |
a5aa33d3951374a6818c8cf07d6ab2da282b8942 | 992 | cpp | C++ | Algorithms/Warmup/time-conversion.cpp | vishu006/Hackerrank | 927bc370b668aa568d17ee96ac2a3728568d437e | [
"CC-BY-4.0"
] | 1 | 2017-08-12T19:18:12.000Z | 2017-08-12T19:18:12.000Z | Algorithms/Warmup/time-conversion.cpp | vishu006/Hackerrank | 927bc370b668aa568d17ee96ac2a3728568d437e | [
"CC-BY-4.0"
] | null | null | null | Algorithms/Warmup/time-conversion.cpp | vishu006/Hackerrank | 927bc370b668aa568d17ee96ac2a3728568d437e | [
"CC-BY-4.0"
] | null | null | null | // Author : Rajanikant Tenguria
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string x;
cin>>x;
if (x[8]=='A'){
int y=int(x[0])-48;
int a=int(x[1])-48;
int b=10*y+a;
if(b>11){
cou... | 19.84 | 80 | 0.365927 | vishu006 |
a5add4ca0e653a8ee608e04897de74ebb669a221 | 85,693 | cc | C++ | wrappers/7.0.0/vtkInformationWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | [
"BSD-3-Clause"
] | 6 | 2016-02-03T12:48:36.000Z | 2020-09-16T15:07:51.000Z | wrappers/7.0.0/vtkInformationWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | [
"BSD-3-Clause"
] | 4 | 2016-02-13T01:30:43.000Z | 2020-03-30T16:59:32.000Z | wrappers/7.0.0/vtkInformationWrap.cc | axkibe/node-vtk | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | [
"BSD-3-Clause"
] | null | null | null | /* this file has been autogenerated by vtkNodeJsWrap */
/* editing this might proof futile */
#define VTK_WRAPPING_CXX
#define VTK_STREAMS_FWD_ONLY
#include <nan.h>
#include "vtkObjectWrap.h"
#include "vtkInformationWrap.h"
#include "vtkInformationKeyWrap.h"
#include "vtkInformationDataObjectKeyWrap.h"
#include "vtkI... | 33.486909 | 133 | 0.673906 | axkibe |
a5ae6638be528e85f34b267112c39cd0ebbff566 | 234 | cpp | C++ | Leetcode/1837.cpp | prameetu/CP_codes | 41f8cfc188d2e08a8091bc5134247d05ba8a78f5 | [
"MIT"
] | null | null | null | Leetcode/1837.cpp | prameetu/CP_codes | 41f8cfc188d2e08a8091bc5134247d05ba8a78f5 | [
"MIT"
] | null | null | null | Leetcode/1837.cpp | prameetu/CP_codes | 41f8cfc188d2e08a8091bc5134247d05ba8a78f5 | [
"MIT"
] | null | null | null | //leetcode - 1837
// Sum of Digits in Base K
#include<bits/stdc++.h>
using namespace std;
int sumBase(int n, int k)
{
int ans(0);
while(n)
{
ans += n%k;
n = n/k;
}
return ans;
}
| 13 | 27 | 0.474359 | prameetu |
a5b13cebf439ced814ae995b2e3dd0b7a874fd47 | 934 | cpp | C++ | Sources/Visualizer/Private/BinaryMask.cpp | PierreEVEN/ImageVisualizer | 37735ef55ee6213a090da46708ec3329c3e28656 | [
"MIT"
] | null | null | null | Sources/Visualizer/Private/BinaryMask.cpp | PierreEVEN/ImageVisualizer | 37735ef55ee6213a090da46708ec3329c3e28656 | [
"MIT"
] | null | null | null | Sources/Visualizer/Private/BinaryMask.cpp | PierreEVEN/ImageVisualizer | 37735ef55ee6213a090da46708ec3329c3e28656 | [
"MIT"
] | null | null | null |
#include "BinaryMask.h"
#include <fstream>
#include <iostream>
#include <string>
Binarymask::Binarymask(const std::filesystem::path& SourceFile)
{
std::ifstream Input(SourceFile);
if (!Input) return;
int XPos = 0;
int YPos = 0;
int CenterX = 0;
int CenterY = 0;
char CurrentChar;
std::cout << "import ma... | 14.825397 | 72 | 0.572805 | PierreEVEN |
a5b2b548a83801ae31d9f88a3effd20f13e606b5 | 4,033 | cpp | C++ | backtracking/setCover.cpp | SiverPineValley/algo | 29c75c6b226fdb15a3b6695e763ee49d4871094e | [
"Apache-2.0"
] | null | null | null | backtracking/setCover.cpp | SiverPineValley/algo | 29c75c6b226fdb15a3b6695e763ee49d4871094e | [
"Apache-2.0"
] | null | null | null | backtracking/setCover.cpp | SiverPineValley/algo | 29c75c6b226fdb15a3b6695e763ee49d4871094e | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <set>
#include <functional>
#include <stack>
#include <cstring>
using namespace std;
// Array에서 사용할 Swap
#define SWAP(x, y, temp) ( temp=x, x=y, y=temp )
/*
각 Subset들의 개수를 세는 함수
*/
void calSets( vector<set<int>... | 19.113744 | 83 | 0.547979 | SiverPineValley |
a5b3faeb8428232eda5bba0024247d8a7bb14053 | 3,269 | cpp | C++ | src/main/screens/notification_list.cpp | LeonMatthes/WatchyOS | d6a62695c8c7ca7fa26c13f4505b7f06b13e2fb9 | [
"MIT"
] | 2 | 2022-01-22T07:30:28.000Z | 2022-01-27T14:03:35.000Z | src/main/screens/notification_list.cpp | LeonMatthes/WatchyOS | d6a62695c8c7ca7fa26c13f4505b7f06b13e2fb9 | [
"MIT"
] | 2 | 2022-02-02T14:22:44.000Z | 2022-02-02T14:59:51.000Z | src/main/screens/notification_list.cpp | LeonMatthes/WatchyOS | d6a62695c8c7ca7fa26c13f4505b7f06b13e2fb9 | [
"MIT"
] | 1 | 2022-02-02T20:52:20.000Z | 2022-02-02T20:52:20.000Z | #include "notification_list.h"
#include "screens.h"
#include <cstddef>
#include <sstream>
#include <esp_attr.h>
#include <e_ink.h>
using namespace e_ink;
#include <event_queue.h>
#include <notifications.h>
#include <res/fonts/Inconsolata_Bold10pt7b.h>
#include <res/fonts/Inconsolata_Bold7pt7b.h>
#include <res/font... | 25.146154 | 96 | 0.667177 | LeonMatthes |
a5b5806e67fbf11e74102992d8975b4e2c15d3a4 | 796 | hh | C++ | DezynePatterns/cyclic-io-pattern/src/cpp_impl/InputCpp.hh | dezyne/DezyneCommunity | 08b33e13cbd36c1db5cbe94de0f51c207289eb4a | [
"MIT"
] | 5 | 2017-11-07T09:09:28.000Z | 2021-12-15T05:34:46.000Z | DezynePatterns/cyclic-io-pattern/src/cpp_impl/InputCpp.hh | dezyne/DezyneCommunity | 08b33e13cbd36c1db5cbe94de0f51c207289eb4a | [
"MIT"
] | 2 | 2019-05-22T10:12:23.000Z | 2019-07-15T14:25:34.000Z | DezynePatterns/cyclic-io-pattern/src/cpp_impl/InputCpp.hh | dezyne/DezyneCommunity | 08b33e13cbd36c1db5cbe94de0f51c207289eb4a | [
"MIT"
] | 5 | 2017-12-04T13:02:07.000Z | 2021-12-15T05:33:53.000Z |
#pragma once
#include "InputCpp.hh"
class InputCpp : public skel::InputCpp
{
public:
explicit InputCpp(const dzn::locator& dzn_locator) :
skel::InputCpp(dzn_locator),
_channel(nullptr),
state(IInput::eState::idle)
{
_previous = _channel;
}
void setChannel(bool* channel) { _channel = channel;... | 15.607843 | 56 | 0.614322 | dezyne |
a5b891640f10810d11aa1364ebadbf5c01bf8b31 | 737 | cpp | C++ | nodemanager/data/NodeInfo.cpp | Azure/hpcpack-linux-agent | 36029057fd5d0d033c38f41c9b08dc2bb88f33a9 | [
"MIT"
] | 2 | 2019-04-26T03:03:07.000Z | 2021-07-31T07:12:49.000Z | nodemanager/data/NodeInfo.cpp | coolmay/whpc-linux-communicator | 36029057fd5d0d033c38f41c9b08dc2bb88f33a9 | [
"MIT"
] | 2 | 2015-09-24T10:03:07.000Z | 2018-08-03T08:27:56.000Z | nodemanager/data/NodeInfo.cpp | coolmay/whpc-linux-communicator | 36029057fd5d0d033c38f41c9b08dc2bb88f33a9 | [
"MIT"
] | 5 | 2015-06-02T07:59:31.000Z | 2018-08-03T03:53:39.000Z | #include "NodeInfo.h"
#include "../utils/System.h"
using namespace web;
using namespace hpc::data;
using namespace hpc::utils;
NodeInfo::NodeInfo()
{
this->Name = System::GetNodeName();
}
json::value NodeInfo::ToJson()
{
json::value j;
j["Availability"] = json::value::number((int)this->Availability);
... | 24.566667 | 128 | 0.640434 | Azure |
a5c57a0d26939ba5a514f84d34d793836cee3472 | 11,365 | cpp | C++ | gerenciador.cpp | Mauriverti/trabalho3 | b41493c938f7e0f08eb467c1bba474e88c1a8a3c | [
"MIT"
] | null | null | null | gerenciador.cpp | Mauriverti/trabalho3 | b41493c938f7e0f08eb467c1bba474e88c1a8a3c | [
"MIT"
] | null | null | null | gerenciador.cpp | Mauriverti/trabalho3 | b41493c938f7e0f08eb467c1bba474e88c1a8a3c | [
"MIT"
] | null | null | null | #include "gerenciador.h"
Gerenciador::Gerenciador() {
}
string Gerenciador::getNomeDisco() {
return this->nomeDisco.toStdString();
}
void Gerenciador::setNomeDisco(string nome) {
this->nomeDisco = QString::fromStdString(nome);
}
void Gerenciador::abrirDisco(QString nome) {
QByteArray b... | 34.755352 | 108 | 0.519754 | Mauriverti |
a5c7d0857637e8ef2fbc3dacb801320c48feae30 | 9,454 | hxx | C++ | opencascade/SelectMgr_TriangularFrustum.hxx | mgreminger/OCP | 92eacb99497cd52b419c8a4a8ab0abab2330ed42 | [
"Apache-2.0"
] | null | null | null | opencascade/SelectMgr_TriangularFrustum.hxx | mgreminger/OCP | 92eacb99497cd52b419c8a4a8ab0abab2330ed42 | [
"Apache-2.0"
] | null | null | null | opencascade/SelectMgr_TriangularFrustum.hxx | mgreminger/OCP | 92eacb99497cd52b419c8a4a8ab0abab2330ed42 | [
"Apache-2.0"
] | null | null | null | // Created on: 2014-05-22
// Created by: Varvara POSKONINA
// Copyright (c) 2005-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.... | 55.940828 | 155 | 0.628094 | mgreminger |
a5ca0fc2533e9031bfb9a0e419e2f0b0de107748 | 4,326 | hpp | C++ | mangrove_master/include/Inference/CheckTernaryMonotony.hpp | mangrove-univr/Mangrove | 3d95096c7adfad5eb27625b020c222487e91ab4e | [
"MIT"
] | 1 | 2019-12-28T09:30:24.000Z | 2019-12-28T09:30:24.000Z | mangrove_master/include/Inference/CheckTernaryMonotony.hpp | mangrove-univr/Mangrove | 3d95096c7adfad5eb27625b020c222487e91ab4e | [
"MIT"
] | 1 | 2020-08-25T10:57:11.000Z | 2020-08-25T10:57:11.000Z | mangrove_master/include/Inference/CheckTernaryMonotony.hpp | mangrove-univr/Mangrove | 3d95096c7adfad5eb27625b020c222487e91ab4e | [
"MIT"
] | null | null | null | #pragma once
#include "Inference/ResultCollector.hpp"
#include <chrono>
#include <random>
#include <iostream>
namespace mangrove {
template <int F_INDEX>
struct TEST_TERNARY_INVARIANT {
inline static void ApplyT (numeric_t x1, numeric_t x2_1, numeric_t x2_2,
int *mo... | 42.831683 | 102 | 0.51988 | mangrove-univr |
a5ca6458b7df4f92efe78782e21f9387e51529c8 | 756 | hpp | C++ | src/worley.hpp | krig/simplex | 4c763cf0738671ff325937e1098622a983c49b24 | [
"MIT"
] | null | null | null | src/worley.hpp | krig/simplex | 4c763cf0738671ff325937e1098622a983c49b24 | [
"MIT"
] | null | null | null | src/worley.hpp | krig/simplex | 4c763cf0738671ff325937e1098622a983c49b24 | [
"MIT"
] | null | null | null | #pragma once
void worley_noise_impl(const glm::dvec3 &p, double density, int num,
double *dist, glm::dvec3 *vec);
/* Return the distance from the point p to the nth closest randomly
distributed point defined by the noise function. Density sets how
densely the noise points are in three-sp... | 34.363636 | 84 | 0.681217 | krig |
a5cbc07651414d46650a0d1ad917251552259810 | 984 | hpp | C++ | src/ui/camera_frame.hpp | Yanick-Salzmann/grower-controller-rpi | 30f279e960a3cc8125f112c76ee943b1fa766191 | [
"MIT"
] | null | null | null | src/ui/camera_frame.hpp | Yanick-Salzmann/grower-controller-rpi | 30f279e960a3cc8125f112c76ee943b1fa766191 | [
"MIT"
] | null | null | null | src/ui/camera_frame.hpp | Yanick-Salzmann/grower-controller-rpi | 30f279e960a3cc8125f112c76ee943b1fa766191 | [
"MIT"
] | null | null | null | #ifndef GROWER_CONTROLLER_RPI_CAMERA_FRAME_HPP
#define GROWER_CONTROLLER_RPI_CAMERA_FRAME_HPP
#include <mutex>
#include <vector>
#include "gl/texture.hpp"
#include "gl/mesh.hpp"
#include "ui/elements/element.hpp"
namespace grower::ui {
class camera_frame : public elements::element {
static gl::mesh_ptr _m... | 24 | 102 | 0.664634 | Yanick-Salzmann |
a5cd308b5b67dd34784988aad2a49d19e3ee9bda | 3,086 | cpp | C++ | tests/unit/sdf/actions/delayfile.cpp | qedalab/vcd_assert | 40da307e60600fc4a814d4bba4679001f49f4375 | [
"BSD-2-Clause"
] | 1 | 2019-04-30T17:56:23.000Z | 2019-04-30T17:56:23.000Z | tests/unit/sdf/actions/delayfile.cpp | qedalab/vcd_assert | 40da307e60600fc4a814d4bba4679001f49f4375 | [
"BSD-2-Clause"
] | null | null | null | tests/unit/sdf/actions/delayfile.cpp | qedalab/vcd_assert | 40da307e60600fc4a814d4bba4679001f49f4375 | [
"BSD-2-Clause"
] | 4 | 2018-08-01T08:32:00.000Z | 2019-12-18T06:34:33.000Z | #include "../types/delayfile.hpp"
#include <parse/test/parse.hpp>
using namespace Parse::Test;
#include <sdf/grammar/delayfile.hpp>
#include <sdf/actions/delayfile.hpp>
#include <sdf/types/delayfile.hpp>
#include <sdf/serialize/delayfile.hpp>
// using namespace SDF;
// using namespace SDF::Test;
// constexpr auto p... | 30.254902 | 77 | 0.681141 | qedalab |
a5ce785045b6cc7415884e3c722a14f962db9b86 | 25,799 | cpp | C++ | lib/Runtimes/Tracer/Tracer.cpp | seec-team/seec | 4b92456011e86b70f9d88833a95c1f655a21cf1a | [
"MIT"
] | 7 | 2018-06-25T12:06:13.000Z | 2022-01-18T09:20:13.000Z | lib/Runtimes/Tracer/Tracer.cpp | seec-team/seec | 4b92456011e86b70f9d88833a95c1f655a21cf1a | [
"MIT"
] | 20 | 2016-12-01T23:46:12.000Z | 2019-08-11T02:41:04.000Z | lib/Runtimes/Tracer/Tracer.cpp | seec-team/seec | 4b92456011e86b70f9d88833a95c1f655a21cf1a | [
"MIT"
] | 1 | 2020-10-19T03:20:05.000Z | 2020-10-19T03:20:05.000Z | //===- lib/Runtimes/Tracer/Tracer.cpp -------------------------------------===//
//
// SeeC
//
// This file is distributed under The MIT License (MIT). See LICENSE.TXT for
// details.
//
//===----------------------------------------------------------------------===//
///
/// \file
///... | 32.615676 | 80 | 0.656111 | seec-team |
a5d00e0de34eb91df41e4eff8d6d2902ae15fd93 | 1,336 | cpp | C++ | Contests/Codeforces/CF912/d.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | 4 | 2017-10-31T14:25:18.000Z | 2018-06-10T16:10:17.000Z | Contests/Codeforces/CF912/d.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | null | null | null | Contests/Codeforces/CF912/d.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
#define mem(Arr,x) memset(Arr,x,sizeof(Arr))
#define ld long double
const int maxN=10001;
const int F1[5]={0,0,0,1,-1};
const int F2[5]={0,1,-1,0,0};
const int inf=214748364... | 18.054054 | 100 | 0.545659 | SYCstudio |
a5d0e7b600424ca694873f487010cad7eca3bff2 | 3,768 | hpp | C++ | src/backends/opengl/OpenglBuffer.hpp | AntonHakansson/KvantEngine | f101fc771a8e9eca8ced59a084b9be0169e95649 | [
"MIT"
] | null | null | null | src/backends/opengl/OpenglBuffer.hpp | AntonHakansson/KvantEngine | f101fc771a8e9eca8ced59a084b9be0169e95649 | [
"MIT"
] | 2 | 2017-04-05T01:50:13.000Z | 2017-08-10T00:58:26.000Z | src/backends/opengl/OpenglBuffer.hpp | AntonHakansson/KvantEngine | f101fc771a8e9eca8ced59a084b9be0169e95649 | [
"MIT"
] | null | null | null | #ifndef OPENGL_BUFFER_HPP_INCLUDED
#define OPENGL_BUFFER_HPP_INCLUDED
#include <vector>
#include "core/Context.hpp"
#include "core/Loader.hpp"
#include "utils/Checks.hpp"
namespace Kvant::graphics::opengl {
template <typename B> struct OpenglColorBuffer {
static int counter;
GLuint tex;
GLuint unit;
unsigne... | 30.144 | 80 | 0.711518 | AntonHakansson |
a5d1b7f8b22b03346f2eff9c0066307a8b7a5dfe | 702 | cpp | C++ | storage/src/tests/storageutil/palettetest.cpp | bowlofstew/vespa | 5212c7a5568769eadb5c5d99b6a503a70c82af48 | [
"Apache-2.0"
] | null | null | null | storage/src/tests/storageutil/palettetest.cpp | bowlofstew/vespa | 5212c7a5568769eadb5c5d99b6a503a70c82af48 | [
"Apache-2.0"
] | 1 | 2021-01-21T01:37:37.000Z | 2021-01-21T01:37:37.000Z | storage/src/tests/storageutil/palettetest.cpp | bowlofstew/vespa | 5212c7a5568769eadb5c5d99b6a503a70c82af48 | [
"Apache-2.0"
] | null | null | null | // Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/storage/storageutil/palette.h>
#include <vespa/vdstestlib/cppunit/macros.h>
namespace storage {
struct PaletteTest : public CppUnit::TestFixture {
void testNormalUsage();
CP... | 23.4 | 118 | 0.717949 | bowlofstew |
a5d40c64c9e77d24d58e51f957a1fe981eaac386 | 978 | cpp | C++ | Day9_MaximumWidthOfBinaryTree.cpp | SuYuxi/July-LeetCoding-Challenge | 8a1b3893d4a5869bac483eefe97650e754e7298b | [
"MIT"
] | null | null | null | Day9_MaximumWidthOfBinaryTree.cpp | SuYuxi/July-LeetCoding-Challenge | 8a1b3893d4a5869bac483eefe97650e754e7298b | [
"MIT"
] | null | null | null | Day9_MaximumWidthOfBinaryTree.cpp | SuYuxi/July-LeetCoding-Challenge | 8a1b3893d4a5869bac483eefe97650e754e7298b | [
"MIT"
] | null | null | null | /**
* Definition for a binary tree node.
* 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), l... | 30.5625 | 93 | 0.576687 | SuYuxi |
a5d9e0b684c88126bee2455d0224bfe6cadeea05 | 3,107 | cpp | C++ | anno/LabelDefinition.cpp | urobots-io/anno | 8e240185e6fc0908687b15a39c892814a6bddee6 | [
"MIT"
] | 9 | 2020-07-17T05:28:52.000Z | 2022-03-03T18:26:12.000Z | anno/LabelDefinition.cpp | urobots-io/anno | 8e240185e6fc0908687b15a39c892814a6bddee6 | [
"MIT"
] | null | null | null | anno/LabelDefinition.cpp | urobots-io/anno | 8e240185e6fc0908687b15a39c892814a6bddee6 | [
"MIT"
] | null | null | null | // This is an open source non-commercial project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++, C#, and Java: http://www.viva64.com
//
// Anno Labeling Tool
// 2020-2021 (c) urobots GmbH, https://urobots.io
#include "LabelDefinition.h"
#include "FileModel.h"
#include "PropertyDatabas... | 29.311321 | 164 | 0.668491 | urobots-io |
77742221c12a44dfbdabf7dbbc6da59a504f6775 | 6,125 | cc | C++ | components/federated_learning/floc_blocklist_service_unittest.cc | mghgroup/Glide-Browser | 6a4c1eaa6632ec55014fee87781c6bbbb92a2af5 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | components/federated_learning/floc_blocklist_service_unittest.cc | mghgroup/Glide-Browser | 6a4c1eaa6632ec55014fee87781c6bbbb92a2af5 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | components/federated_learning/floc_blocklist_service_unittest.cc | mghgroup/Glide-Browser | 6a4c1eaa6632ec55014fee87781c6bbbb92a2af5 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 2 | 2021-01-05T23:43:46.000Z | 2021-01-07T23:36:34.000Z | // Copyright 2020 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 "components/federated_learning/floc_blocklist_service.h"
#include <string>
#include <vector>
#include "base/files/file_util.h"
#include "base/f... | 34.410112 | 80 | 0.758531 | mghgroup |
7774424b3dae089ee08c67ae44dfe55abf728814 | 8,539 | cc | C++ | fib.cc | yhirose/fiblang | af5b9dec8831e85119b214249942217e13877397 | [
"MIT"
] | null | null | null | fib.cc | yhirose/fiblang | af5b9dec8831e85119b214249942217e13877397 | [
"MIT"
] | null | null | null | fib.cc | yhirose/fiblang | af5b9dec8831e85119b214249942217e13877397 | [
"MIT"
] | null | null | null | //
// FibLang
// A Programming Language just for writing Fibonacci number program. :)
//
// Copyright (c) 2021 Yuji Hirose. All rights reserved. MIT License
// MIT License
//
#include <fstream>
#include <variant>
#include "peglib.h"
using namespace std;
using namespace peg;
using namespace peg::udl;
//---------... | 26.936909 | 79 | 0.494437 | yhirose |
77759896e92425900c15df9621f476c1f3859cfb | 10,769 | hpp | C++ | include/util/sorted.hpp | sourcechris/util | 79f190df7b42130e28dfd8ac830241144c1b5fe7 | [
"MIT"
] | null | null | null | include/util/sorted.hpp | sourcechris/util | 79f190df7b42130e28dfd8ac830241144c1b5fe7 | [
"MIT"
] | null | null | null | include/util/sorted.hpp | sourcechris/util | 79f190df7b42130e28dfd8ac830241144c1b5fe7 | [
"MIT"
] | 1 | 2021-06-07T20:41:23.000Z | 2021-06-07T20:41:23.000Z | // SPDX-FileCopyrightText: 2021 Christian Göhring <mostsig@gmail.com>
// SPDX-License-Identifier: MIT
#ifndef THAT_THIS_UTIL_SORTED_HEADER_IS_ALREADY_INCLUDED
#define THAT_THIS_UTIL_SORTED_HEADER_IS_ALREADY_INCLUDED
#include <algorithm>
#include <array>
#include <forward_list>
#include <functional>
#include <list>
#i... | 33.548287 | 99 | 0.694865 | sourcechris |
77769a710f836504bd6def77d5b409fba8c7f64e | 3,628 | cc | C++ | src/DataOutput/RestartableObject.cc | jmikeowen/Spheral | 3e1082a7aefd6b328bd3ae24ca1a477108cfc3c4 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 22 | 2018-07-31T21:38:22.000Z | 2020-06-29T08:58:33.000Z | src/DataOutput/RestartableObject.cc | markguozhiming/spheral | bbb982102e61edb8a1d00cf780bfa571835e1b61 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 41 | 2020-09-28T23:14:27.000Z | 2022-03-28T17:01:33.000Z | src/DataOutput/RestartableObject.cc | markguozhiming/spheral | bbb982102e61edb8a1d00cf780bfa571835e1b61 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 7 | 2019-12-01T07:00:06.000Z | 2020-09-15T21:12:39.000Z | //---------------------------------Spheral++----------------------------------//
// RestartableObject
// This is an object that handles registering it's descendents with the
// RestartRegistrar. The idea here is you just inherit from this bad boy,
// and blamo you're restartable.
// This is intended solely for use m... | 37.402062 | 113 | 0.54548 | jmikeowen |
77779a2674b18d0efd2901918439a4b0c7221463 | 992 | cpp | C++ | BZOJ/3111/std.cpp | sjj118/OI-Code | 964ea6e799d14010f305c7e4aee269d860a781f7 | [
"MIT"
] | null | null | null | BZOJ/3111/std.cpp | sjj118/OI-Code | 964ea6e799d14010f305c7e4aee269d860a781f7 | [
"MIT"
] | null | null | null | BZOJ/3111/std.cpp | sjj118/OI-Code | 964ea6e799d14010f305c7e4aee269d860a781f7 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define inf 1000000000
const int maxn=120;
int n,m,k,ans,a[maxn][maxn],f[maxn][25][maxn],g[maxn][25][maxn][2],s[maxn][maxn];
int main(){
scanf("%d%d%d",&n,&m,&k);
k=k*2+1;
for (int i=1;i<=n;i++)
fo... | 26.105263 | 81 | 0.454637 | sjj118 |
777b20bc2482491ae54df64a129fc4a47f3bb1ed | 2,017 | cpp | C++ | 300-400/314.cpp | Thomaw/Project-Euler | bcad5d8a1fd3ebaa06fa52d92d286607e9372a8d | [
"MIT"
] | null | null | null | 300-400/314.cpp | Thomaw/Project-Euler | bcad5d8a1fd3ebaa06fa52d92d286607e9372a8d | [
"MIT"
] | null | null | null | 300-400/314.cpp | Thomaw/Project-Euler | bcad5d8a1fd3ebaa06fa52d92d286607e9372a8d | [
"MIT"
] | null | null | null |
#include <iostream>
#include <vector>
#include <cmath>
#include <limits>
using std::vector;
int main (int argc, char * const argv[])
{
const int maxR = 250;
/*
Assume that the best shape has 8-way symmetry.
smallestPerimeter[r][A] is the smallest length of a sequence of line
... | 33.616667 | 94 | 0.500248 | Thomaw |
777f0c84ed9b688e6f9a2134a0f4c50c334b8220 | 1,016 | hpp | C++ | program/kmeans.hpp | yk-tanigawa/201503_clustering | 43a11e707c08f1576e5765824c74330b6730e7e9 | [
"MIT"
] | null | null | null | program/kmeans.hpp | yk-tanigawa/201503_clustering | 43a11e707c08f1576e5765824c74330b6730e7e9 | [
"MIT"
] | 2 | 2015-02-26T16:52:41.000Z | 2015-02-26T16:53:14.000Z | program/kmeans.hpp | yk-tanigawa/201503_clustering | 43a11e707c08f1576e5765824c74330b6730e7e9 | [
"MIT"
] | null | null | null | #ifndef _UBLAS_
#define _UBLAS_
#include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/vector.hpp>
#include <boost/numeric/ublas/matrix_proxy.hpp>
#include <boost/numeric/ublas/io.hpp>
#endif
#ifndef _KMEANS_
#define _KMEANS_
using namespace boost::numeric::ublas;
using namespace boost::numeric;
d... | 22.577778 | 71 | 0.644685 | yk-tanigawa |
777f9906eb214b6b704e9155b88c1faa227fe0b3 | 6,493 | cpp | C++ | Code/IntroGame/DemoScreens/DemoScreenParticleActors.cpp | EvGamer/midspace | c16f39d7e59ff4bf51dff9de1a135ddf321e2f32 | [
"BSD-3-Clause"
] | 171 | 2015-01-08T10:35:56.000Z | 2021-07-03T12:35:10.000Z | Code/IntroGame/DemoScreens/DemoScreenParticleActors.cpp | EvGamer/midspace | c16f39d7e59ff4bf51dff9de1a135ddf321e2f32 | [
"BSD-3-Clause"
] | 11 | 2015-01-30T05:30:54.000Z | 2017-04-08T23:34:33.000Z | Code/IntroGame/DemoScreens/DemoScreenParticleActors.cpp | EvGamer/midspace | c16f39d7e59ff4bf51dff9de1a135ddf321e2f32 | [
"BSD-3-Clause"
] | 59 | 2015-02-01T03:43:00.000Z | 2020-12-01T02:08:57.000Z | //////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2008-2014, Shane Liesegang
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redist... | 40.836478 | 98 | 0.703527 | EvGamer |
7783b630dbb68c531fc4febda0b67d0ef4e4fa65 | 23 | cpp | C++ | src/boardgame/move_list.cpp | edersasch/boardgames | 48c24e6796d46e106723551688d2bb1c7d6aac36 | [
"MIT"
] | 4 | 2019-04-17T09:19:31.000Z | 2020-12-30T04:11:08.000Z | src/boardgame/move_list.cpp | edersasch/boardgames | 48c24e6796d46e106723551688d2bb1c7d6aac36 | [
"MIT"
] | 1 | 2019-04-16T20:04:01.000Z | 2019-04-16T20:04:01.000Z | src/boardgame/move_list.cpp | edersasch/boardgames | 48c24e6796d46e106723551688d2bb1c7d6aac36 | [
"MIT"
] | 1 | 2019-04-15T09:21:01.000Z | 2019-04-15T09:21:01.000Z | #include "move_list.h"
| 11.5 | 22 | 0.73913 | edersasch |
77848e1270c78f4820e603c71016029de5f4304e | 1,544 | hpp | C++ | Sockets/Base/MSSocket.hpp | MihaelShevchuk/MSSocketLibrary | 6ec75fea90221026a5a5ec302b56b93b83bfbf01 | [
"BSD-2-Clause"
] | null | null | null | Sockets/Base/MSSocket.hpp | MihaelShevchuk/MSSocketLibrary | 6ec75fea90221026a5a5ec302b56b93b83bfbf01 | [
"BSD-2-Clause"
] | null | null | null | Sockets/Base/MSSocket.hpp | MihaelShevchuk/MSSocketLibrary | 6ec75fea90221026a5a5ec302b56b93b83bfbf01 | [
"BSD-2-Clause"
] | null | null | null | //
// MSSocket.hpp
// MSSocketLibrary
//
// Created by Mihail Shevchuk on 15.01.18.
// Copyright © 2018 Mihail Shevchuk. All rights reserved.
//
#ifndef MSSocket_hpp
#define MSSocket_hpp
#include "MSErrorManager.hpp"
class MSSocket {
public:
MSSocket(MSEventType type, pChar ip, uint32_t port, uint32_t sizeBu... | 24.125 | 77 | 0.696891 | MihaelShevchuk |
7784b18f9934a659e614743e3a40f4325807d468 | 1,250 | cc | C++ | src/twpipe/ensemble.cc | hjian42/twpipe | d18e4a507f110a0d006aebc2f46553bd28c81db7 | [
"MIT"
] | 31 | 2018-04-13T14:52:24.000Z | 2021-08-02T07:13:07.000Z | src/twpipe/ensemble.cc | hjian42/twpipe | d18e4a507f110a0d006aebc2f46553bd28c81db7 | [
"MIT"
] | 8 | 2018-07-05T01:58:20.000Z | 2019-08-09T06:07:27.000Z | src/twpipe/ensemble.cc | hjian42/twpipe | d18e4a507f110a0d006aebc2f46553bd28c81db7 | [
"MIT"
] | 6 | 2018-07-04T17:57:29.000Z | 2022-01-15T17:47:50.000Z | #include "ensemble.h"
#include "json.hpp"
#include <iostream>
#include <fstream>
namespace twpipe {
const char* EnsembleInstance::id_name = "id";
const char* EnsembleInstance::category_name = "category";
const char* EnsembleInstance::prob_name = "prob";
EnsembleInstance::EnsembleInstance(unsigned id,
... | 34.722222 | 124 | 0.6384 | hjian42 |
7784b763cf5db5a1ebcc8957d9d00f72138df15b | 4,546 | cpp | C++ | inetsrv/msmq/src/setup/msmqocm/devdrvr.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | inetsrv/msmq/src/setup/msmqocm/devdrvr.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | inetsrv/msmq/src/setup/msmqocm/devdrvr.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /*++
Copyright (c) 1997 Microsoft Corporation
Module Name:
devdrvr.cpp
Abstract:
Code to install Falcon device driver.
Author:
Revision History:
Shai Kariv (ShaiK) 10-Dec-97 Modified for NT 5.0 OCM Setup
--*/
#include "msmqocm.h"
extern "C"{
#include <wsasetup.h>
}
... | 23.926316 | 108 | 0.439287 | npocmaka |
77859fe085a63f10c2f76cd33b11a2609e04f5af | 429 | hh | C++ | succosim/include/Analysis.hh | mattiasoldani/succosim_22_desy_preshower | d326bee8875c8f85b3730e20e9257b722a8f5313 | [
"MIT"
] | null | null | null | succosim/include/Analysis.hh | mattiasoldani/succosim_22_desy_preshower | d326bee8875c8f85b3730e20e9257b722a8f5313 | [
"MIT"
] | null | null | null | succosim/include/Analysis.hh | mattiasoldani/succosim_22_desy_preshower | d326bee8875c8f85b3730e20e9257b722a8f5313 | [
"MIT"
] | null | null | null | #ifndef ANALYSIS_HH
#define ANALYSIS_HH
using namespace std;
// header for all the analysis & data output stuff
// vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
// select the output data file format here by including the proper header (only 1 at a time)
// note: CSV format does not support custom file path & na... | 26.8125 | 92 | 0.67366 | mattiasoldani |
7787f43ff6163a0a9e65ed62ef42ee749fa5a99b | 50,404 | cpp | C++ | vm/external_libs/llvm/lib/Target/ARM/ARMRegisterInfo.cpp | marnen/rubinius | 05b3f9789d01bada0604a7f09921c956bc9487e7 | [
"BSD-3-Clause"
] | 1 | 2016-05-08T16:58:14.000Z | 2016-05-08T16:58:14.000Z | vm/external_libs/llvm/lib/Target/ARM/ARMRegisterInfo.cpp | taf2/rubinius | 493bfa2351fc509ca33d3bb03991c2e9c2b6dafa | [
"BSD-3-Clause"
] | null | null | null | vm/external_libs/llvm/lib/Target/ARM/ARMRegisterInfo.cpp | taf2/rubinius | 493bfa2351fc509ca33d3bb03991c2e9c2b6dafa | [
"BSD-3-Clause"
] | null | null | null | //===- ARMRegisterInfo.cpp - ARM Register Information -----------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | 36.314121 | 84 | 0.613463 | marnen |
778c9991b88b26122c747161b71c96da7a7db76c | 6,326 | cpp | C++ | cpp/opengl-cube/main.cpp | YodaEmbedding/experiments | 567c6a1c18fac2d951fe2af54aaa4917b7d529d2 | [
"MIT"
] | null | null | null | cpp/opengl-cube/main.cpp | YodaEmbedding/experiments | 567c6a1c18fac2d951fe2af54aaa4917b7d529d2 | [
"MIT"
] | null | null | null | cpp/opengl-cube/main.cpp | YodaEmbedding/experiments | 567c6a1c18fac2d951fe2af54aaa4917b7d529d2 | [
"MIT"
] | null | null | null | #include <cstdlib>
#include <GL/glew.h>
#if __has_include(<GL/freeglut.h>)
#include <GL/freeglut.h>
// #include <GL/freeglut_ext.h>
#else
#include <GL/glut.h>
#endif
#include <glm/glm.hpp>
#include <glm/gtc/matrix_transform.hpp>
#include "shader.h"
const int numCubeVertices = 12 * 3;
// clang-format off
const GLflo... | 27.150215 | 79 | 0.545843 | YodaEmbedding |
779074fbbffbc7357b8cd6be45810012719a662a | 1,861 | cpp | C++ | source/Ch05/Sajat/sajat_drill5.cpp | BuganBarna/UDProg-Introduction | 506c61e41e8651371b02299602b521e4c3e267eb | [
"CC0-1.0"
] | null | null | null | source/Ch05/Sajat/sajat_drill5.cpp | BuganBarna/UDProg-Introduction | 506c61e41e8651371b02299602b521e4c3e267eb | [
"CC0-1.0"
] | null | null | null | source/Ch05/Sajat/sajat_drill5.cpp | BuganBarna/UDProg-Introduction | 506c61e41e8651371b02299602b521e4c3e267eb | [
"CC0-1.0"
] | null | null | null | #include "std_lib_facilities.h"
int main()
try{
//cout << " Success!\n ";
//cout << " Success!\n";
//cout << " Success " << "!\n ";
//cout << "success" << '\n';
//int res = 7; vector<int> v(10); v[5] = res; cout << " Success!\n " ;
//vector<int> v(10); v[5] = 7; if (v[5]==7) cout << " Success!\n " ;
//bool cond... | 42.295455 | 80 | 0.484686 | BuganBarna |
7791671bd3577ac27dbf86e718c0abcd5fc52105 | 9,945 | cpp | C++ | src/database.cpp | ZyperPL/TVCTL | a0ebd73fc1307c59a4846be3a12d1b30f031e185 | [
"MIT"
] | null | null | null | src/database.cpp | ZyperPL/TVCTL | a0ebd73fc1307c59a4846be3a12d1b30f031e185 | [
"MIT"
] | null | null | null | src/database.cpp | ZyperPL/TVCTL | a0ebd73fc1307c59a4846be3a12d1b30f031e185 | [
"MIT"
] | null | null | null | #include "database.h"
Database::Database()
{
}
Database::~Database()
{
for (size_t i = 0; i < this->list.size(); i++)
{
delete (this->list.at(i));
}
}
bool Database::addSeries(std::string data)
{
rapidxml::xml_document<> doc;
doc.parse<0>((char *)data.c_str());
rapidxml::xml_node<> *node = doc.firs... | 28.826087 | 221 | 0.533937 | ZyperPL |
7791cb2049c025493a73c5008186d04d3cc81230 | 3,939 | cpp | C++ | 1066.campus-bikes-ii.cpp | bsmsnd/LeetCode-CharlieChen | db72f0a3463c9e723aac800cdbe38218b36aa639 | [
"MIT"
] | null | null | null | 1066.campus-bikes-ii.cpp | bsmsnd/LeetCode-CharlieChen | db72f0a3463c9e723aac800cdbe38218b36aa639 | [
"MIT"
] | null | null | null | 1066.campus-bikes-ii.cpp | bsmsnd/LeetCode-CharlieChen | db72f0a3463c9e723aac800cdbe38218b36aa639 | [
"MIT"
] | null | null | null | /*
* @lc app=leetcode id=1066 lang=cpp
*
* [1066] Campus Bikes II
*/
// @lc code=start
// class Solution {
// public:
// int dist[12][12];
// int dp[1024][1024];
// // int N, M;
// int assignBikes(vector<vector<int>>& workers, vector<vector<int>>& bikes) {
// const int N = workers.size(); ... | 37.514286 | 179 | 0.370145 | bsmsnd |