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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d609367837cf3353590aa149bec33ad2091ee04c | 386 | cpp | C++ | Chapter13/drills/Drill_01.cpp | JohnWoods11/learning_c- | 094509a4e96518e1aa12205615ca50849932f9fa | [
"Apache-2.0"
] | null | null | null | Chapter13/drills/Drill_01.cpp | JohnWoods11/learning_c- | 094509a4e96518e1aa12205615ca50849932f9fa | [
"Apache-2.0"
] | null | null | null | Chapter13/drills/Drill_01.cpp | JohnWoods11/learning_c- | 094509a4e96518e1aa12205615ca50849932f9fa | [
"Apache-2.0"
] | null | null | null | #include "GUI/Graph.h"
#include "GUI/Simple_window.h"
#include "GUI/std_lib_facilities.h"
#include <iostream>
void drill_1()
{
const Point py(50,50);
Simple_window win(py, 1000, 800, "Drill 1");
win.wait_for_button();
}
int main()
{
try
{
drill_1();
}
catch (...)
{
... | 14.296296 | 48 | 0.544041 | JohnWoods11 |
d61643ba5639fa71ed176aef294c2198c0a17df3 | 1,207 | cpp | C++ | special/2/2.cpp | 249606097/Cpp-Experiment | 6d97388664f125853193e9d00a1f9ee53ffde21c | [
"MIT"
] | null | null | null | special/2/2.cpp | 249606097/Cpp-Experiment | 6d97388664f125853193e9d00a1f9ee53ffde21c | [
"MIT"
] | null | null | null | special/2/2.cpp | 249606097/Cpp-Experiment | 6d97388664f125853193e9d00a1f9ee53ffde21c | [
"MIT"
] | null | null | null | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <cmath>
#include <ctime>
using namespace std;
bool in_circle(double x, double y);
int main()
{
double e = 0.01;
int n = 1000;
double pi = 100.0;
double residual = 100.0;
int count = 0;
while (residual > e)... | 21.175439 | 83 | 0.451533 | 249606097 |
d61ba495fd2b7c347312e10be17db6a4d5d4f7ad | 3,409 | cpp | C++ | src/system.cpp | MisaghM/Doodle-Jump | 850e529547e83e7a3a0607fea635517bf2e3bcc4 | [
"MIT"
] | 2 | 2021-09-02T20:05:34.000Z | 2021-11-05T19:38:15.000Z | src/system.cpp | MisaghM/Doodle-Jump | 850e529547e83e7a3a0607fea635517bf2e3bcc4 | [
"MIT"
] | null | null | null | src/system.cpp | MisaghM/Doodle-Jump | 850e529547e83e7a3a0607fea635517bf2e3bcc4 | [
"MIT"
] | null | null | null | #include "system.hpp"
#include "enemies/enemy_normal.hpp"
#include "items/spring.hpp"
#include "platforms/platform_breakable.hpp"
#include "platforms/platform_movable.hpp"
#include "platforms/platform_normal.hpp"
#include "spritesheet.hpp"
System::System(Window* win_)
: win_(win_),
menuScene_(&inputMan_),
... | 30.4375 | 146 | 0.581989 | MisaghM |
d62204e616f8edb2f0032058d3f6ad907800fbb3 | 1,091 | cc | C++ | test/test_flann.cc | mozuysal/virg-workspace | ff0df41ceb288609c5279a85d9d04dbbc178d33e | [
"BSD-3-Clause"
] | null | null | null | test/test_flann.cc | mozuysal/virg-workspace | ff0df41ceb288609c5279a85d9d04dbbc178d33e | [
"BSD-3-Clause"
] | 3 | 2017-02-07T11:26:33.000Z | 2017-02-07T12:43:41.000Z | test/test_flann.cc | mozuysal/virg-workspace | ff0df41ceb288609c5279a85d9d04dbbc178d33e | [
"BSD-3-Clause"
] | null | null | null | #include "gtest/gtest.h"
#include "flann/flann.hpp"
using flann::Matrix;
using flann::Index;
using flann::LinearIndexParams;
using flann::L2;
using flann::SearchParams;
TEST(flann, linear_index) {
int nn = 2;
float data[4] = { 0.0f, 0.0f,
1.0, 0.5};
Matrix<float> da... | 27.275 | 70 | 0.578368 | mozuysal |
d628062af287155a56565c17c207e7965ee5875c | 1,315 | cpp | C++ | COURSE_WHITE/WEEK_2/CONTAINER/Middle_temperature/main.cpp | diekaltesonne/c-plus-plus-modern-development | d569bd20465e76aab97111bcd316cd02ebca41dd | [
"MIT"
] | null | null | null | COURSE_WHITE/WEEK_2/CONTAINER/Middle_temperature/main.cpp | diekaltesonne/c-plus-plus-modern-development | d569bd20465e76aab97111bcd316cd02ebca41dd | [
"MIT"
] | null | null | null | COURSE_WHITE/WEEK_2/CONTAINER/Middle_temperature/main.cpp | diekaltesonne/c-plus-plus-modern-development | d569bd20465e76aab97111bcd316cd02ebca41dd | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
/*
* Даны значения температуры, наблюдавшиеся в течение N подряд идущих дней.
* Найдите номера дней (в нумерации с нуля) со значением температуры выше среднего арифметического за все N дней.
* Гарантируется, что среднее арифметическое значений температуры яв... | 30.581395 | 144 | 0.669202 | diekaltesonne |
d62869904cc8110964fdb3a0ea0fd9355c5e0066 | 44,630 | cc | C++ | tacacsAuthProxy/src/proxy_server.cc | gkumar78/tacacs_auth_proxy | bffdfde75e67e075e47f345580bd6adbea8930d5 | [
"Apache-2.0"
] | null | null | null | tacacsAuthProxy/src/proxy_server.cc | gkumar78/tacacs_auth_proxy | bffdfde75e67e075e47f345580bd6adbea8930d5 | [
"Apache-2.0"
] | null | null | null | tacacsAuthProxy/src/proxy_server.cc | gkumar78/tacacs_auth_proxy | bffdfde75e67e075e47f345580bd6adbea8930d5 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2018-present Open Networking Foundation
* 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 ... | 39.741763 | 171 | 0.588438 | gkumar78 |
d62dd8cb0d504f37e451cdaf048bda0c3a22a3cc | 6,116 | cpp | C++ | src/jet/grid_forward_euler_diffusion_solver3.cpp | PavelBlend/fluid-engine-dev | 45b4bdbdb4c6d8c0beebc682180469198203b0ef | [
"MIT"
] | 1,355 | 2016-05-08T07:29:22.000Z | 2022-03-30T13:59:35.000Z | src/jet/grid_forward_euler_diffusion_solver3.cpp | Taiyuan-Zhang/fluid-engine-dev | 45b4bdbdb4c6d8c0beebc682180469198203b0ef | [
"MIT"
] | 208 | 2016-05-25T19:47:27.000Z | 2022-01-17T04:18:29.000Z | src/jet/grid_forward_euler_diffusion_solver3.cpp | Taiyuan-Zhang/fluid-engine-dev | 45b4bdbdb4c6d8c0beebc682180469198203b0ef | [
"MIT"
] | 218 | 2016-08-23T16:51:10.000Z | 2022-03-31T03:55:48.000Z | // Copyright (c) 2018 Doyub Kim
//
// I am making my contributions/submissions to this project solely in my
// personal capacity and am not conveying any rights to any intellectual
// property of any third parties.
#include <pch.h>
#include <jet/fdm_utils.h>
#include <jet/grid_forward_euler_diffusion_solver3.h>
#inclu... | 31.045685 | 72 | 0.552158 | PavelBlend |
d6320ffbbb1fd3681cb234be4d0f345d770834d1 | 3,724 | cpp | C++ | vnext/Microsoft.ReactNative/ReactNativeHost.cpp | tom-un/react-native-windows | c09b55cce76604fe0b379b10206a974915dafc25 | [
"MIT"
] | 2 | 2021-09-05T18:12:44.000Z | 2021-09-06T02:08:25.000Z | vnext/Microsoft.ReactNative/ReactNativeHost.cpp | zchronoz/react-native-windows | 111b727c50b4349b60ffe98f7ff70d487624add3 | [
"MIT"
] | 2 | 2021-05-09T03:34:28.000Z | 2021-09-02T14:49:43.000Z | vnext/Microsoft.ReactNative/ReactNativeHost.cpp | t0rr3sp3dr0/react-native-windows | 5ed2c5626fb2d126022ba215a71a1cb92f7337b3 | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
#include "pch.h"
#include "ReactNativeHost.h"
#include "ReactNativeHost.g.cpp"
#include "ReactInstanceManager.h"
#include "ReactInstanceManagerBuilder.h"
#include "ReactInstanceSettings.h"
#include "ReactRootView... | 30.276423 | 106 | 0.747046 | tom-un |
d63398010a208af19e5347957d12dcf82055b812 | 698 | cpp | C++ | Utils/StringUtils.cpp | paulross80/myoga-utils | ecdff503690bb0b3a521e7af66bb84dfbd899799 | [
"MIT"
] | null | null | null | Utils/StringUtils.cpp | paulross80/myoga-utils | ecdff503690bb0b3a521e7af66bb84dfbd899799 | [
"MIT"
] | null | null | null | Utils/StringUtils.cpp | paulross80/myoga-utils | ecdff503690bb0b3a521e7af66bb84dfbd899799 | [
"MIT"
] | null | null | null | #include <stdexcept>
#include <algorithm>
#include <cctype>
#include "StringUtils.hpp"
namespace myoga
{
// String to lowercase
auto lowercase(std::string_view str) -> std::string
{
std::string ret(str);
for (std::size_t i = 0U; i < ret.length(); i++)
ret[i] = charToLower(ret[i]);
return ret;
}... | 19.388889 | 93 | 0.617479 | paulross80 |
d634459a8057739295b11d8375cfb44714bf6d9b | 4,816 | cpp | C++ | motif4struct_bin.cpp | devuci/bct-cpp | bbb33f476bffbb5669e051841f00c3241f4d6f69 | [
"MIT"
] | null | null | null | motif4struct_bin.cpp | devuci/bct-cpp | bbb33f476bffbb5669e051841f00c3241f4d6f69 | [
"MIT"
] | null | null | null | motif4struct_bin.cpp | devuci/bct-cpp | bbb33f476bffbb5669e051841f00c3241f4d6f69 | [
"MIT"
] | null | null | null | #include "bct.h"
/*
* Counts occurrences of four-node structural motifs in a binary graph.
*/
VECTOR_T* BCT_NAMESPACE::motif4struct_bin(const MATRIX_T* A, MATRIX_T** F) {
if (safe_mode) check_status(A, SQUARE | BINARY, "motif4struct_bin");
// load motif34lib M4n ID4
VECTOR_T* ID4;
MATRIX_T* M4 = motif4generate... | 27.83815 | 145 | 0.508721 | devuci |
d64117aa915e6ae0b088b4a29488fb5f0d38fad0 | 285 | cpp | C++ | Primer/Trials/check.cpp | siddheshpai/hello-world | 291456962d46c6ce857d75be86bc23634625925f | [
"Apache-2.0"
] | null | null | null | Primer/Trials/check.cpp | siddheshpai/hello-world | 291456962d46c6ce857d75be86bc23634625925f | [
"Apache-2.0"
] | null | null | null | Primer/Trials/check.cpp | siddheshpai/hello-world | 291456962d46c6ce857d75be86bc23634625925f | [
"Apache-2.0"
] | 1 | 2020-05-30T04:30:16.000Z | 2020-05-30T04:30:16.000Z | #include <iostream>
int main()
{
int n = 5;
void *p = &n;
int *pi = static_cast<int*>(p);
++*pi;
std::cout << *pi << std::endl;
//Checking ref to const
std::string const &s = "9-99-999-9999";
std::cout << s << std::endl;
return 0;
}
| 15.833333 | 43 | 0.477193 | siddheshpai |
d64493de84c9e0f4f5f00dcbf845a5fd22bea3d7 | 1,798 | cxx | C++ | dicom2rawiv/zipextract/gdcm-2.6.3/Testing/Source/Common/Cxx/TestDirectory.cxx | chipbuster/skull-atlas | 7f3ee009e1d5f65f101fe853a2cf6e12662970ee | [
"BSD-3-Clause"
] | 47 | 2020-03-30T14:36:46.000Z | 2022-03-06T07:44:54.000Z | dicom2rawiv/zipextract/gdcm-2.6.3/Testing/Source/Common/Cxx/TestDirectory.cxx | chipbuster/skull-atlas | 7f3ee009e1d5f65f101fe853a2cf6e12662970ee | [
"BSD-3-Clause"
] | null | null | null | dicom2rawiv/zipextract/gdcm-2.6.3/Testing/Source/Common/Cxx/TestDirectory.cxx | chipbuster/skull-atlas | 7f3ee009e1d5f65f101fe853a2cf6e12662970ee | [
"BSD-3-Clause"
] | 8 | 2020-04-01T01:22:45.000Z | 2022-01-02T13:06:09.000Z | /*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html for details.
This software is distributed WITHOUT A... | 24.972222 | 98 | 0.565628 | chipbuster |
d6460c3cda3662f4730f91a14731321247e446ed | 258 | cpp | C++ | PETCS/Intermediate/aplusb.cpp | dl4us/Competitive-Programming-1 | d42fab3bd68168adbe4b5f594f19ee5dfcd1389b | [
"MIT"
] | null | null | null | PETCS/Intermediate/aplusb.cpp | dl4us/Competitive-Programming-1 | d42fab3bd68168adbe4b5f594f19ee5dfcd1389b | [
"MIT"
] | null | null | null | PETCS/Intermediate/aplusb.cpp | dl4us/Competitive-Programming-1 | d42fab3bd68168adbe4b5f594f19ee5dfcd1389b | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
cin.sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> N;
int a, b;
for(int i = 0; i < N; i++) {
cin >> a >> b;
cout << a+b << "\n";
}
return 0;
}
| 17.2 | 32 | 0.453488 | dl4us |
d6468e7220e5b770459d2c4cff62b1dff129a89a | 9,676 | cpp | C++ | Widgets/Datalog/dialogplotchannelchoose.cpp | cyferc/Empro-Datalog-Viewer | 8d66cefe64aa254c283e72034f9ea452938ad212 | [
"MIT"
] | 6 | 2017-03-29T14:44:06.000Z | 2021-08-17T06:11:09.000Z | Widgets/Datalog/dialogplotchannelchoose.cpp | cyferc/Empro-Datalog-Viewer | 8d66cefe64aa254c283e72034f9ea452938ad212 | [
"MIT"
] | 1 | 2018-11-24T11:12:08.000Z | 2018-11-24T11:12:08.000Z | Widgets/Datalog/dialogplotchannelchoose.cpp | cyferc/Empro-Datalog-Viewer | 8d66cefe64aa254c283e72034f9ea452938ad212 | [
"MIT"
] | 3 | 2018-01-20T21:53:03.000Z | 2020-09-23T19:02:42.000Z | #include "dialogplotchannelchoose.h"
#include "ui_dialogplotchannelchoose.h"
#include <QGridLayout>
#include <QCheckBox>
#include <QDebug>
#include "plotdatalog.h"
DialogPlotChannelChoose::DialogPlotChannelChoose(std::vector<PointList *> vecOfPointLists, QSplitter *pSplitterPlots, QWidget *pParent) :
QDialog(pPare... | 33.597222 | 148 | 0.632906 | cyferc |
d6477a936a53840c19a74bddb1f90eb57f8b9541 | 9,898 | cpp | C++ | test/hotspot/gtest/metaspace/test_chunkManager_stress.cpp | 1690296356/jdk | eaf668d1510c28d51e26c397b582b66ebdf7e263 | [
"Apache-2.0"
] | null | null | null | test/hotspot/gtest/metaspace/test_chunkManager_stress.cpp | 1690296356/jdk | eaf668d1510c28d51e26c397b582b66ebdf7e263 | [
"Apache-2.0"
] | null | null | null | test/hotspot/gtest/metaspace/test_chunkManager_stress.cpp | 1690296356/jdk | eaf668d1510c28d51e26c397b582b66ebdf7e263 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2020 SAP SE. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License... | 33.666667 | 99 | 0.703071 | 1690296356 |
d64e446dff7144ca8d332cb99165bcb8e195f0bd | 707 | cpp | C++ | src/axl_fsm/axl_fsm_StdRegexNameMgr.cpp | wandns/axl | 5686b94b18033df13a9e1656e1aaaf086c442a21 | [
"MIT"
] | null | null | null | src/axl_fsm/axl_fsm_StdRegexNameMgr.cpp | wandns/axl | 5686b94b18033df13a9e1656e1aaaf086c442a21 | [
"MIT"
] | null | null | null | src/axl_fsm/axl_fsm_StdRegexNameMgr.cpp | wandns/axl | 5686b94b18033df13a9e1656e1aaaf086c442a21 | [
"MIT"
] | null | null | null | //..............................................................................
//
// This file is part of the AXL library.
//
// AXL is distributed under the MIT license.
// For details see accompanying license.txt file,
// the public copy of which is also available at:
// http://tibbo.com/downloads/archive/axl/... | 29.458333 | 80 | 0.381895 | wandns |
d64e7ea4e4dabafa189a4fea5e17aaaaaa8ecd54 | 4,641 | hpp | C++ | ext/tatara/array/integer/int_array.hpp | S-H-GAMELINKS/tatara | b849be7c7a9d097b2c0bd0b5df5bbb21ec96d3c0 | [
"MIT"
] | 6 | 2019-08-16T11:35:43.000Z | 2019-11-16T07:57:06.000Z | ext/tatara/array/integer/int_array.hpp | S-H-GAMELINKS/tatara | b849be7c7a9d097b2c0bd0b5df5bbb21ec96d3c0 | [
"MIT"
] | 378 | 2019-08-15T07:55:18.000Z | 2020-02-16T12:22:34.000Z | ext/tatara/array/integer/int_array.hpp | S-H-GAMELINKS/tatara | b849be7c7a9d097b2c0bd0b5df5bbb21ec96d3c0 | [
"MIT"
] | 1 | 2019-09-02T15:32:58.000Z | 2019-09-02T15:32:58.000Z | #ifndef INT_ARRAY_HPP_
#define INT_ARRAY_HPP_
#include <ruby.h>
#include <vector>
#include <algorithm>
#include <iterator>
#include <iostream>
static VALUE int_array_init(VALUE self) {
return self;
}
static VALUE int_array_first(VALUE self) {
return rb_ary_entry(self, 0);
}
static VALUE int_array_last(VALUE... | 27.3 | 93 | 0.664081 | S-H-GAMELINKS |
d65105f7124e34e006397ffc4eb686cf9b87ab8c | 627 | hpp | C++ | src/include/helper.hpp | allen880117/Simulated-Quantum-Annealing | 84ce0a475a9f132502c4bb4e9b4ca5824cdb7630 | [
"MIT"
] | 2 | 2021-09-08T08:01:27.000Z | 2021-11-21T00:08:56.000Z | src/include/helper.hpp | allen880117/Simulated-Quantum-Annealing | 84ce0a475a9f132502c4bb4e9b4ca5824cdb7630 | [
"MIT"
] | null | null | null | src/include/helper.hpp | allen880117/Simulated-Quantum-Annealing | 84ce0a475a9f132502c4bb4e9b4ca5824cdb7630 | [
"MIT"
] | null | null | null | #ifndef _HELPER_HPP_
#define _HELPER_HPP_
#include "sqa.hpp"
/* Progress Bar */
#define PBSTR "||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||"
#define PBWIDTH 60
/* Print the progress bar */
void printProgress(double percentage);
/* Generate Random Initial State */
void generateRandomState(spin_t trot... | 27.26087 | 76 | 0.590112 | allen880117 |
d651893644eb14548298ed0bad64c2821f706b20 | 3,457 | cpp | C++ | RandPass.cpp | abdulrahmanabdulazeez/RandPass | e7b11c2f577d3ca460358bfa826e7939825cccc4 | [
"MIT"
] | 2 | 2021-09-13T15:34:30.000Z | 2021-09-30T22:16:44.000Z | RandPass.cpp | abdulrahmanabdulazeez/RandPass | e7b11c2f577d3ca460358bfa826e7939825cccc4 | [
"MIT"
] | null | null | null | RandPass.cpp | abdulrahmanabdulazeez/RandPass | e7b11c2f577d3ca460358bfa826e7939825cccc4 | [
"MIT"
] | null | null | null | //Do not copy:
//More Advanced Version:
//Random Password Generator:
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;
void help();
void PASSINTRO(){
cout << "------------------------------------------------------------\n\n";
cout << " RANDOM PASSWORD GENERATOR\n";
cout << ... | 24.174825 | 105 | 0.596182 | abdulrahmanabdulazeez |
d6618d5c25345e95ecb195b5f0d64cc65ad2cd5f | 275 | cpp | C++ | 2021.10.03-homework-3/Project3/Source.cpp | st095227/homework_2021-2022 | 7b3abd8848ead7456972c5d2f0f4404532e299bc | [
"Apache-2.0"
] | null | null | null | 2021.10.03-homework-3/Project3/Source.cpp | st095227/homework_2021-2022 | 7b3abd8848ead7456972c5d2f0f4404532e299bc | [
"Apache-2.0"
] | null | null | null | 2021.10.03-homework-3/Project3/Source.cpp | st095227/homework_2021-2022 | 7b3abd8848ead7456972c5d2f0f4404532e299bc | [
"Apache-2.0"
] | null | null | null | #include <iostream>
using namespace std;
int main(int argv, char* argc[])
{
int n = 0;
cin >> n;
int i = 0;
int b = 0;
while (n != 0)
{
++i;
for (int j = 0; j < i && n>0; ++j)
{
++b;
cout << b << ' ';
--n;
}
cout << endl;
}
return EXIT_SUCCESS;
} | 11.956522 | 36 | 0.461818 | st095227 |
d666f64f883dacdd4b5404cdaeb89b92e1ea7a87 | 3,030 | cpp | C++ | portable-executable/portable-executable-library2/tests/test_resource_message_table/main.cpp | psneo/Pesidious | c36647d1b3ba86a9a4e6e1a0bda2a371d8875781 | [
"MIT"
] | 83 | 2020-09-14T16:51:42.000Z | 2022-03-31T23:23:02.000Z | portable-executable/portable-executable-library2/tests/test_resource_message_table/main.cpp | bedangSen/Pesidious-1 | 3348a8977951074eef41dbd8460934ef7a9093fd | [
"MIT"
] | 9 | 2020-11-13T19:08:15.000Z | 2022-03-12T00:50:20.000Z | portable-executable/portable-executable-library2/tests/test_resource_message_table/main.cpp | bedangSen/Pesidious-1 | 3348a8977951074eef41dbd8460934ef7a9093fd | [
"MIT"
] | 30 | 2020-09-13T15:05:22.000Z | 2022-03-28T05:51:05.000Z | #include <iostream>
#include <fstream>
#include <pe_bliss.h>
#include <pe_bliss_resources.h>
#include "test.h"
#ifdef PE_BLISS_WINDOWS
#include "lib.h"
#endif
using namespace pe_bliss;
int main(int argc, char* argv[])
{
PE_TEST_START
std::auto_ptr<std::ifstream> pe_file;
if(!open_pe_file(argc, ... | 48.095238 | 152 | 0.744884 | psneo |
d66735c18595db157d264abb51aafadb8eb3a8f3 | 2,361 | cpp | C++ | plugins/community/repos/BaconMusic/src/SampleDelay.cpp | guillaume-plantevin/VeeSeeVSTRack | 76fafc8e721613669d6f5ae82a0f58ce923a91e1 | [
"Zlib",
"BSD-3-Clause"
] | 233 | 2018-07-02T16:49:36.000Z | 2022-02-27T21:45:39.000Z | plugins/community/repos/BaconMusic/src/SampleDelay.cpp | guillaume-plantevin/VeeSeeVSTRack | 76fafc8e721613669d6f5ae82a0f58ce923a91e1 | [
"Zlib",
"BSD-3-Clause"
] | 24 | 2018-07-09T11:32:15.000Z | 2022-01-07T01:45:43.000Z | plugins/community/repos/BaconMusic/src/SampleDelay.cpp | guillaume-plantevin/VeeSeeVSTRack | 76fafc8e721613669d6f5ae82a0f58ce923a91e1 | [
"Zlib",
"BSD-3-Clause"
] | 24 | 2018-07-14T21:55:30.000Z | 2021-05-04T04:20:34.000Z |
#include "BaconPlugs.hpp"
#include "SampleDelay.hpp"
namespace rack_plugin_BaconMusic {
struct SampleDelayWidget : ModuleWidget {
typedef SampleDelay< Module > SD;
SampleDelayWidget( SD *module);
};
SampleDelayWidget::SampleDelayWidget( SD *module ) : ModuleWidget( module )
{
box.size = Vec( SCREW_WIDTH * 5, ... | 38.704918 | 143 | 0.565862 | guillaume-plantevin |
d66c414f4a81ebcad706510e5398609143c5fec0 | 355 | cpp | C++ | src/ai/context/RedLine.cpp | elikos/elikos_decisionmaking | d48379643e69ad5fa5dfb2fc79034ca259cf0012 | [
"MIT"
] | 1 | 2019-02-24T08:29:06.000Z | 2019-02-24T08:29:06.000Z | src/ai/context/RedLine.cpp | elikos/elikos_decisionmaking | d48379643e69ad5fa5dfb2fc79034ca259cf0012 | [
"MIT"
] | null | null | null | src/ai/context/RedLine.cpp | elikos/elikos_decisionmaking | d48379643e69ad5fa5dfb2fc79034ca259cf0012 | [
"MIT"
] | 1 | 2019-02-12T23:06:13.000Z | 2019-02-12T23:06:13.000Z | //
// Created by olivier on 01/07/16.
//
#include "TargetRobot.h"
#include "RedLine.h"
namespace ai
{
RedLine::RedLine(tf::Point& cornerA, tf::Point& cornerB)
: AbstractLine(cornerA, cornerB)
{
}
RedLine::~RedLine()
{
}
bool RedLine::isGoodLineIntersection(const TargetRobot& target)
{
// TODO: check t... | 12.678571 | 63 | 0.667606 | elikos |
698fc27608fd90d3e1f3a9d36213e8ef85c75628 | 1,507 | cpp | C++ | app/UseSelectionDialog.cpp | Toysoft/ciderpress | 640959dad551ba75a48bd3c49629579730ead351 | [
"BSD-3-Clause"
] | 84 | 2015-01-01T00:27:18.000Z | 2022-03-28T22:55:56.000Z | app/UseSelectionDialog.cpp | Toysoft/ciderpress | 640959dad551ba75a48bd3c49629579730ead351 | [
"BSD-3-Clause"
] | 49 | 2015-01-11T19:58:57.000Z | 2022-01-08T00:27:12.000Z | app/UseSelectionDialog.cpp | Toysoft/ciderpress | 640959dad551ba75a48bd3c49629579730ead351 | [
"BSD-3-Clause"
] | 19 | 2015-06-06T15:23:18.000Z | 2022-01-12T23:26:43.000Z | /*
* CiderPress
* Copyright (C) 2007 by faddenSoft, LLC. All Rights Reserved.
* See the file LICENSE for distribution terms.
*/
#include "stdafx.h"
#include "UseSelectionDialog.h"
BEGIN_MESSAGE_MAP(UseSelectionDialog, CDialog)
ON_WM_HELPINFO()
//ON_COMMAND(IDHELP, OnHelp)
END_MESSAGE_MAP()
... | 24.704918 | 64 | 0.640345 | Toysoft |
6992ef5cb96dee2ed33ecffa86cf2fea2bbada98 | 1,054 | cpp | C++ | drake/util/closestExpmapmex.cpp | ericmanzi/double_pendulum_lqr | 76bba3091295abb7d412c4a3156258918f280c96 | [
"BSD-3-Clause"
] | 4 | 2018-04-16T09:54:52.000Z | 2021-03-29T21:59:27.000Z | drake/util/closestExpmapmex.cpp | ericmanzi/double_pendulum_lqr | 76bba3091295abb7d412c4a3156258918f280c96 | [
"BSD-3-Clause"
] | null | null | null | drake/util/closestExpmapmex.cpp | ericmanzi/double_pendulum_lqr | 76bba3091295abb7d412c4a3156258918f280c96 | [
"BSD-3-Clause"
] | 1 | 2017-08-24T20:32:03.000Z | 2017-08-24T20:32:03.000Z | #include "mex.h"
#include "drakeMexUtil.h"
#include "drakeGradientUtil.h"
#include "drakeGeometryUtil.h"
using namespace std;
using namespace Eigen;
void mexFunction(int nlhs, mxArray* plhs[], int nrhs, const mxArray* prhs[])
{
if (nrhs != 2) {
mexErrMsgIdAndTxt("Drake:closestExpmapmex:InvalidInputs","Usage is ... | 30.114286 | 104 | 0.680266 | ericmanzi |
69936abdf09f2bb3af3d7e3ffd4be62b0809830e | 1,283 | cpp | C++ | ReactionPlus/Exec/InputDevice.cpp | stricq/AmigaSynergy | fd81da853b3c5a50a2bb5c160c5f7320daaa7571 | [
"MIT"
] | 1 | 2022-03-05T11:30:18.000Z | 2022-03-05T11:30:18.000Z | ReactionPlus/Exec/InputDevice.cpp | stricq/AmigaSynergy | fd81da853b3c5a50a2bb5c160c5f7320daaa7571 | [
"MIT"
] | null | null | null | ReactionPlus/Exec/InputDevice.cpp | stricq/AmigaSynergy | fd81da853b3c5a50a2bb5c160c5f7320daaa7571 | [
"MIT"
] | 1 | 2022-03-06T11:22:44.000Z | 2022-03-06T11:22:44.000Z | #include "InputDevice.hpp"
#include <proto/exec.h>
namespace RAPlus {
namespace Exec {
InputDevice::InputDevice() {
stdRequest = new StandardIORequest();
inputBit = stdRequest->getSignal();
inputStat = IExec->OpenDevice("input.device",0,stdRequest->getIORequest(),0);
if (inputStat... | 18.328571 | 83 | 0.64926 | stricq |
6996320db8fe0598e39bb64e6787114c0b66766d | 1,275 | hpp | C++ | vcl/math/interpolation/interpolation.hpp | PPonc/inf443-vcl | 4d7bb0130c4bc44e089059464223eca318fdbd00 | [
"MIT"
] | null | null | null | vcl/math/interpolation/interpolation.hpp | PPonc/inf443-vcl | 4d7bb0130c4bc44e089059464223eca318fdbd00 | [
"MIT"
] | null | null | null | vcl/math/interpolation/interpolation.hpp | PPonc/inf443-vcl | 4d7bb0130c4bc44e089059464223eca318fdbd00 | [
"MIT"
] | null | null | null | #pragma once
#include "../../containers/containers.hpp"
namespace vcl
{
/** Interpolate value(x,y) using bilinear interpolation
* - value: grid_2D - coordinates assumed to be its indices
* - (x,y): coordinates assumed to be \in [0,value.dimension.x-1] X [0,value.dimension.y]
*/
template ... | 28.333333 | 93 | 0.561569 | PPonc |
6997e7c2e38f14160b33edd8880fd941a466dad3 | 2,799 | cpp | C++ | libraries/palindrome/palindrome.cpp | AndreTeixeira1998/Arduino | 16918bada3cf9dfee0f6baa72ee1de87602b84ca | [
"MIT"
] | 1,253 | 2015-01-03T17:07:53.000Z | 2022-03-22T11:46:42.000Z | libraries/palindrome/palindrome.cpp | AndreTeixeira1998/Arduino | 16918bada3cf9dfee0f6baa72ee1de87602b84ca | [
"MIT"
] | 134 | 2015-01-21T20:33:13.000Z | 2022-01-05T08:59:33.000Z | libraries/palindrome/palindrome.cpp | AndreTeixeira1998/Arduino | 16918bada3cf9dfee0f6baa72ee1de87602b84ca | [
"MIT"
] | 3,705 | 2015-01-02T17:03:16.000Z | 2022-03-31T13:20:30.000Z | //
// FILE: palindrome.cpp
// AUTHOR: Rob Tillaart
// VERSION: 0.1.1
// PURPOSE: Arduino library to do palindrome experiments.
// URL: https://github.com/RobTillaart/palindrome
//
// HISTORY:
// 0.1.0 2021-12-02 initial version
// 0.1.1 2021-12-03 add palindromeCount(), palindromePercentage()
#include... | 18.175325 | 82 | 0.548053 | AndreTeixeira1998 |
699a62f6968b573dd616ee87b0562dfe71ffd169 | 413 | cpp | C++ | AIBattleground/Src/AISystemBase.cpp | CerberusDev/AIBattleground | 78cb72aeb9f33ff630a01df26c3056b7b7027c69 | [
"MIT"
] | null | null | null | AIBattleground/Src/AISystemBase.cpp | CerberusDev/AIBattleground | 78cb72aeb9f33ff630a01df26c3056b7b7027c69 | [
"MIT"
] | null | null | null | AIBattleground/Src/AISystemBase.cpp | CerberusDev/AIBattleground | 78cb72aeb9f33ff630a01df26c3056b7b7027c69 | [
"MIT"
] | null | null | null | // ----------------------------------------------------------------------------
// ------------- AI Battleground, Copyright(C) Maciej Pryc, 2016 --------------
// ----------------------------------------------------------------------------
#include "AISystemBase.h"
AISystemBase::AISystemBase(class Blackboard* a... | 24.294118 | 80 | 0.380145 | CerberusDev |
699bc77460deebc1e54bc9ee3786f9836cedec3b | 1,959 | cc | C++ | src/abc154/e.cc | nryotaro/at_c | 8d7d3aecb4e3c768aefdf0ceaeefb269ca9ab34c | [
"MIT"
] | null | null | null | src/abc154/e.cc | nryotaro/at_c | 8d7d3aecb4e3c768aefdf0ceaeefb269ca9ab34c | [
"MIT"
] | null | null | null | src/abc154/e.cc | nryotaro/at_c | 8d7d3aecb4e3c768aefdf0ceaeefb269ca9ab34c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[101][2][5];
ll solve(string s, ll k) {
int n = s.size();
ll c = s[0] - '0';
dp[1][1][0] = 1ll;
dp[1][1][1] = c - 1ll;
dp[1][0][1] = 1ll;
for(int i = 1; i < n; i++) {
c = s[i] - '0';
for(int j = 0; j <= ... | 23.60241 | 79 | 0.28586 | nryotaro |
69a07f728b17bc1b66924920a2d4d4642b548472 | 5,304 | cpp | C++ | nau/src/nau/render/materialSortRenderQueue.cpp | Khirion/nau | 47a2ad8e0355a264cd507da5e7bba1bf7abbff95 | [
"MIT"
] | 29 | 2015-09-16T22:28:30.000Z | 2022-03-11T02:57:36.000Z | nau/src/nau/render/materialSortRenderQueue.cpp | Khirion/nau | 47a2ad8e0355a264cd507da5e7bba1bf7abbff95 | [
"MIT"
] | 1 | 2017-03-29T13:32:58.000Z | 2017-03-31T13:56:03.000Z | nau/src/nau/render/materialSortRenderQueue.cpp | Khirion/nau | 47a2ad8e0355a264cd507da5e7bba1bf7abbff95 | [
"MIT"
] | 10 | 2015-10-15T14:20:15.000Z | 2022-02-17T10:37:29.000Z | #include "nau/render/materialSortRenderQueue.h"
#include "nau.h"
#include "nau/render/iRenderable.h"
#include "nau/geometry/boundingBox.h"
#include "nau/debug/profile.h"
using namespace nau::render;
using namespace nau::scene;
using namespace nau::material;
using namespace nau::math;
using namespace nau;
typedef st... | 31.384615 | 158 | 0.697775 | Khirion |
69a195aec5b82d7c089d79f41e41520f1653bee4 | 430 | cpp | C++ | Classes/Retan_class/main.cpp | Bernardo1411/Programacao_Avancada | 5005b60155648872ca9d4f374b3d9ea035aa33a3 | [
"MIT"
] | null | null | null | Classes/Retan_class/main.cpp | Bernardo1411/Programacao_Avancada | 5005b60155648872ca9d4f374b3d9ea035aa33a3 | [
"MIT"
] | null | null | null | Classes/Retan_class/main.cpp | Bernardo1411/Programacao_Avancada | 5005b60155648872ca9d4f374b3d9ea035aa33a3 | [
"MIT"
] | null | null | null | #include <iostream>
#include "ponto.h"
using namespace std;
int main()
{
ponto p1(2,3), p2(5,6);
cout << p1;
cout << p2;
cout << "distancia P1 e P2: " << p1.dist(p2) << endl;
cout << "area P1 e P2: " << p1.area(p2) << endl;
ponto p3 = p1;
cout << p3;
cout << "distancia P3 e P2: " ... | 15.925926 | 57 | 0.5 | Bernardo1411 |
69a390cc0c446131353ccbc58108b6fc8dd3316a | 26,342 | cpp | C++ | Testbed/Framework/Main.cpp | louis-langholtz/Box2D | 7c74792bf177cf36640d735de2bba0225bf7f852 | [
"Zlib"
] | 32 | 2016-10-20T05:55:04.000Z | 2021-11-25T16:34:41.000Z | Testbed/Framework/Main.cpp | louis-langholtz/Box2D | 7c74792bf177cf36640d735de2bba0225bf7f852 | [
"Zlib"
] | 50 | 2017-01-07T21:40:16.000Z | 2018-01-31T10:04:05.000Z | Testbed/Framework/Main.cpp | louis-langholtz/Box2D | 7c74792bf177cf36640d735de2bba0225bf7f852 | [
"Zlib"
] | 7 | 2017-02-09T10:02:02.000Z | 2020-07-23T22:49:04.000Z | /*
* Original work Copyright (c) 2006-2013 Erin Catto http://www.box2d.org
* Modified work Copyright (c) 2017 Louis Langholtz https://github.com/louis-langholtz/Box2D
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* ar... | 31.100354 | 101 | 0.558879 | louis-langholtz |
69a86172d7133a45894a91551431a5804b3d5263 | 17,851 | cpp | C++ | src/predefined/FaceDetector.cpp | djinn-technologies/depthai-unity | 4064a0f3ea374e30203ee9a0a2c42f1e59791519 | [
"MIT"
] | null | null | null | src/predefined/FaceDetector.cpp | djinn-technologies/depthai-unity | 4064a0f3ea374e30203ee9a0a2c42f1e59791519 | [
"MIT"
] | null | null | null | src/predefined/FaceDetector.cpp | djinn-technologies/depthai-unity | 4064a0f3ea374e30203ee9a0a2c42f1e59791519 | [
"MIT"
] | null | null | null | /**
* This file contains face detector pipeline and interface for Unity scene called "Face Detector"
* Main goal is to perform face detection + depth
*/
#pragma GCC diagnostic ignored "-Wreturn-type-c-linkage"
#pragma GCC diagnostic ignored "-Wdouble-promotion"
#if _MSC_VER // this is defined when compiling with Visu... | 42.808153 | 327 | 0.563554 | djinn-technologies |
69a9b34733d8e2c7b1fb7c8680cde5cc71073bb5 | 37,002 | cpp | C++ | packages/monte_carlo/active_region/core/test/tstIndependentPhaseSpaceDimensionDistribution.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 10 | 2019-11-14T19:58:30.000Z | 2021-04-04T17:44:09.000Z | packages/monte_carlo/active_region/core/test/tstIndependentPhaseSpaceDimensionDistribution.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 43 | 2020-03-03T19:59:20.000Z | 2021-09-08T03:36:08.000Z | packages/monte_carlo/active_region/core/test/tstIndependentPhaseSpaceDimensionDistribution.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 6 | 2020-02-12T17:37:07.000Z | 2020-09-08T18:59:51.000Z | //---------------------------------------------------------------------------//
//!
//! \file tstIndependentPhaseSpaceDimensionDistribution.cpp
//! \author Alex Robinson
//! \brief Independent phase space dimension distribution unit tests
//!
//------------------------------------------------------------------------... | 45.345588 | 174 | 0.690125 | bam241 |
69af7ff8dd01d5795b5aad136359bafcaa259e47 | 2,604 | cc | C++ | projects/src/filesystem.cc | oliverlee/phobos | eba4adcca8f9f6afb060904b056596f383b52d8d | [
"BSD-2-Clause"
] | 2 | 2016-12-14T01:21:34.000Z | 2018-09-04T10:43:10.000Z | projects/src/filesystem.cc | oliverlee/phobos | eba4adcca8f9f6afb060904b056596f383b52d8d | [
"BSD-2-Clause"
] | 182 | 2016-04-25T13:36:52.000Z | 2020-07-20T10:24:18.000Z | projects/src/filesystem.cc | oliverlee/phobos | eba4adcca8f9f6afb060904b056596f383b52d8d | [
"BSD-2-Clause"
] | 6 | 2016-04-25T13:20:53.000Z | 2021-02-18T18:25:32.000Z | #include "filesystem.h"
#include "hal.h"
namespace {
FATFS SDC_FS;
bool fs_ready = false;
const unsigned int sdc_polling_interval = 10;
const unsigned int sdc_polling_delay = 10;
virtual_timer_t card_monitor_timer;
unsigned int debounce_counter;
/* SD card event sources */
event_sou... | 26.571429 | 104 | 0.605991 | oliverlee |
69b9905adc72eba720b32122f1980ce4698e364f | 10,627 | cpp | C++ | src/extern/inventor/lib/database/src/so/nodes/nurbs/libnurbs/mesher.cpp | OpenXIP/xip-libraries | 9f0fef66038b20ff0c81c089d7dd0038e3126e40 | [
"Apache-2.0"
] | 2 | 2020-05-21T07:06:07.000Z | 2021-06-28T02:14:34.000Z | src/extern/inventor/lib/database/src/so/nodes/nurbs/libnurbs/mesher.cpp | OpenXIP/xip-libraries | 9f0fef66038b20ff0c81c089d7dd0038e3126e40 | [
"Apache-2.0"
] | null | null | null | src/extern/inventor/lib/database/src/so/nodes/nurbs/libnurbs/mesher.cpp | OpenXIP/xip-libraries | 9f0fef66038b20ff0c81c089d7dd0038e3126e40 | [
"Apache-2.0"
] | 6 | 2016-03-21T19:53:18.000Z | 2021-06-08T18:06:03.000Z | /*
*
* Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your opti... | 21.732106 | 77 | 0.56347 | OpenXIP |
69baeb7d6ebe81751f6ae3ba6556c8840ebc1edb | 533 | cpp | C++ | cpp/11973.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 9 | 2021-01-15T13:36:39.000Z | 2022-02-23T03:44:46.000Z | cpp/11973.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 1 | 2021-07-31T17:11:26.000Z | 2021-08-02T01:01:03.000Z | cpp/11973.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;
int n, k, v[50'000];
inline bool Check(const int mid) {
int cnt = 0;
for (int i = 0; i < n;) {
const int j = i;
while (i < n && v[i] - v[j] <= mid << 1) i++;
cnt++;
}
return cnt <= k;
}
int main() {
fastio;
cin >>... | 17.766667 | 47 | 0.497186 | jinhan814 |
69c1c472367f84931449ade7a28833db0e376d5c | 890 | cpp | C++ | sealtk/core/TrackUtils.cpp | BetsyMcPhail/seal-tk | 49eccad75e501450fbb63524062706968f5f3bef | [
"BSD-3-Clause"
] | null | null | null | sealtk/core/TrackUtils.cpp | BetsyMcPhail/seal-tk | 49eccad75e501450fbb63524062706968f5f3bef | [
"BSD-3-Clause"
] | null | null | null | sealtk/core/TrackUtils.cpp | BetsyMcPhail/seal-tk | 49eccad75e501450fbb63524062706968f5f3bef | [
"BSD-3-Clause"
] | null | null | null | /* This file is part of SEAL-TK, and is distributed under the OSI-approved BSD
* 3-Clause License. See top-level LICENSE file or
* https://github.com/Kitware/seal-tk/blob/master/LICENSE for details. */
#include <sealtk/core/TrackUtils.hpp>
#include <vital/range/indirect.h>
#include <qtStlUtil.h>
#include <QVarian... | 21.190476 | 79 | 0.641573 | BetsyMcPhail |
69c266b24d7f83d369054b9fdb7489b66410c97b | 2,524 | cpp | C++ | two-pointers/3-I.cpp | forestLoop/Learning-ITMO-Academy-Pilot-Course | b70ea387cb6a7c26871d99ecf7109fd8f0237c3e | [
"MIT"
] | 6 | 2021-07-04T08:47:48.000Z | 2022-01-12T09:34:20.000Z | two-pointers/3-I.cpp | forestLoop/Learning-ITMO-Academy-Pilot-Course | b70ea387cb6a7c26871d99ecf7109fd8f0237c3e | [
"MIT"
] | null | null | null | two-pointers/3-I.cpp | forestLoop/Learning-ITMO-Academy-Pilot-Course | b70ea387cb6a7c26871d99ecf7109fd8f0237c3e | [
"MIT"
] | 2 | 2021-11-24T12:18:58.000Z | 2022-02-06T00:18:51.000Z | // I. Segment with the Required Subset
// https://codeforces.com/edu/course/2/lesson/9/3/practice/contest/307094/problem/I
#include <bitset>
#include <iostream>
#include <stack>
#include <vector>
constexpr int MAX_SUM = 1000;
constexpr int BITSET_SIZE = MAX_SUM + 1;
class KnapsackStack {
public:
KnapsackStack... | 24.504854 | 83 | 0.554279 | forestLoop |
69c44787494404b19eca8b6232646ae83313c677 | 4,925 | cpp | C++ | Retired_Proj/4_Unmap/unmap.cpp | billkarsh/Alignment_Projects | f2ce48477da866b09a13fd33f1a53a8af644b35b | [
"BSD-3-Clause"
] | 11 | 2015-07-24T14:41:25.000Z | 2022-03-19T13:27:51.000Z | Retired_Proj/4_Unmap/unmap.cpp | billkarsh/Alignment_Projects | f2ce48477da866b09a13fd33f1a53a8af644b35b | [
"BSD-3-Clause"
] | 1 | 2016-05-14T22:26:25.000Z | 2016-05-14T22:26:25.000Z | Retired_Proj/4_Unmap/unmap.cpp | billkarsh/Alignment_Projects | f2ce48477da866b09a13fd33f1a53a8af644b35b | [
"BSD-3-Clause"
] | 18 | 2015-03-10T18:45:58.000Z | 2021-08-16T13:56:48.000Z |
#include "File.h"
#include "ImageIO.h"
#include "TAffine.h"
#include <string.h>
// structure for unmapping a global image
struct orig_image {
public:
char *fname;
int w,h;
int xmin, ymin, xmax, ymax; // bounding box in global image of all point that map to this
orig_image(){fname = NULL; xmin =... | 30.974843 | 116 | 0.503959 | billkarsh |
69c599470a13c2e342ab128a7a880c640282ced4 | 4,489 | cpp | C++ | demos/dox/index/mummy.cpp | h-2/SeqAnHTS | a1923897fe1bd359136cfd09f0d4c245978c0fce | [
"BSD-3-Clause"
] | 409 | 2015-01-12T22:02:01.000Z | 2022-03-29T06:17:05.000Z | demos/dox/index/mummy.cpp | h-2/SeqAnHTS | a1923897fe1bd359136cfd09f0d4c245978c0fce | [
"BSD-3-Clause"
] | 1,269 | 2015-01-02T22:42:25.000Z | 2022-03-08T13:31:46.000Z | demos/dox/index/mummy.cpp | h-2/SeqAnHTS | a1923897fe1bd359136cfd09f0d4c245978c0fce | [
"BSD-3-Clause"
] | 193 | 2015-01-14T16:21:27.000Z | 2022-03-19T22:47:02.000Z | #include <iostream>
#include <fstream>
#include <seqan/index.h>
#include <seqan/seq_io.h>
using namespace seqan;
template <typename TIndex>
void findMUMs(TIndex & esa, unsigned minLen)
{
typename Iterator<TIndex, Mums>::Type it(esa, minLen); // set minimum MUM length
String<typename SAValue<TIndex>::Type> o... | 29.339869 | 101 | 0.456672 | h-2 |
69ca23742bc0f6e2b542a9f6253860cb03a2ef3f | 59,067 | cc | C++ | src/table_file.cc | LaudateCorpus1/Jungle-2 | 20b80ddaa2cd2e382e3ffd9e79e7d623e29a7f7c | [
"Apache-2.0"
] | 157 | 2019-12-27T18:12:19.000Z | 2022-03-27T13:34:52.000Z | src/table_file.cc | LaudateCorpus1/Jungle-2 | 20b80ddaa2cd2e382e3ffd9e79e7d623e29a7f7c | [
"Apache-2.0"
] | 11 | 2020-01-02T18:30:33.000Z | 2021-09-28T03:10:09.000Z | src/table_file.cc | LaudateCorpus1/Jungle-2 | 20b80ddaa2cd2e382e3ffd9e79e7d623e29a7f7c | [
"Apache-2.0"
] | 32 | 2019-12-28T18:17:27.000Z | 2021-12-24T02:05:10.000Z | /************************************************************************
Copyright 2017-2019 eBay 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
https://www.apache.org/licenses/LICENSE-2... | 31.773534 | 88 | 0.5884 | LaudateCorpus1 |
69cd59d6cc01fd94fd58d9248686ed83ccedd3b1 | 134,375 | inl | C++ | src/fonts/stb_font_arial_50_latin1.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | 3 | 2018-03-13T12:51:57.000Z | 2021-10-11T11:32:17.000Z | src/fonts/stb_font_arial_50_latin1.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | null | null | null | src/fonts/stb_font_arial_50_latin1.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | null | null | null | // Font generated by stb_font_inl_generator.c (4/1 bpp)
//
// Following instructions show how to use the only included font, whatever it is, in
// a generic way so you can replace it with any other font by changing the include.
// To use multiple fonts, replace STB_SOMEFONT_* below with STB_FONT_arial_50_latin1_*,
... | 69.768951 | 115 | 0.816283 | stetre |
69cf159f7d5b64cc24ca1479796d1679dc4f0c94 | 6,136 | cpp | C++ | Plugins/uPacketDivision/uPacketDivision/Assembler.cpp | hecomi/uPacketDivision | 264a9dbe77a03f8534c2e087d7b33143478c6822 | [
"MIT"
] | 4 | 2021-11-28T23:54:15.000Z | 2022-02-20T10:50:28.000Z | Plugins/uPacketDivision/uPacketDivision/Assembler.cpp | hecomi/uPacketDivision | 264a9dbe77a03f8534c2e087d7b33143478c6822 | [
"MIT"
] | null | null | null | Plugins/uPacketDivision/uPacketDivision/Assembler.cpp | hecomi/uPacketDivision | 264a9dbe77a03f8534c2e087d7b33143478c6822 | [
"MIT"
] | null | null | null | #include <chrono>
#include <algorithm>
#include "Assembler.h"
#include "Log.h"
namespace uPacketDivision
{
void Frame::AddChunkData(const void *pData, uint32_t)
{
const auto &header = *reinterpret_cast<const PacketHeader*>(pData);
if (header.version != GetPacketHeaderVersion())
{
... | 23.330798 | 103 | 0.564211 | hecomi |
69d86305d9ebc709378d6fa463a2778b4555147f | 671 | hpp | C++ | incs/Borders.hpp | paribro/hydrodynamic-simulator | 63f16099a4b60bd6240d2c7a6950009637197382 | [
"MIT"
] | 2 | 2020-08-12T11:41:04.000Z | 2021-02-20T20:02:44.000Z | incs/Borders.hpp | prdbrg/hydrodynamic-simulator | 63f16099a4b60bd6240d2c7a6950009637197382 | [
"MIT"
] | null | null | null | incs/Borders.hpp | prdbrg/hydrodynamic-simulator | 63f16099a4b60bd6240d2c7a6950009637197382 | [
"MIT"
] | null | null | null | #ifndef BORDERS_CLASS_HPP
# define BORDERS_CLASS_HPP
# include <glm/glm.hpp>
# include <Define.hpp>
# include <AModule.hpp>
class Borders: public AModule
{
public:
Borders(Model & model);
~Borders(void);
private:
Borders(void);
Borders(Borders const & model);
Borders & operator=(Borders const & rhs);
... | 20.96875 | 56 | 0.700447 | paribro |
69d8aab470b3a352c977d76a1eaee5315661a965 | 2,141 | cpp | C++ | Code/Client/ClientUI/Source/ZlibUtil.cpp | MarvinGeng/TinyIM | 01c1c2e257e85caf8afa5ac5ecc4d5295fb0d710 | [
"MIT"
] | null | null | null | Code/Client/ClientUI/Source/ZlibUtil.cpp | MarvinGeng/TinyIM | 01c1c2e257e85caf8afa5ac5ecc4d5295fb0d710 | [
"MIT"
] | null | null | null | Code/Client/ClientUI/Source/ZlibUtil.cpp | MarvinGeng/TinyIM | 01c1c2e257e85caf8afa5ac5ecc4d5295fb0d710 | [
"MIT"
] | 1 | 2022-01-15T03:18:26.000Z | 2022-01-15T03:18:26.000Z | /*
* 压缩工具类，ZlibUtil.cpp
* zhangyl 2018.03.09
*/
#include "stdafx.h"
#include "../zlib1.2.11/zlib.h"
#include <string.h>
#include "ZlibUtil.h"
//最大支持压缩10M
#define MAX_COMPRESS_BUF_SIZE 10*1024*1024
bool ZlibUtil::CompressBuf(const char* pSrcBuf, size_t nSrcBufLength, char* pDestBuf, size_t& nDestBufLength)
{
... | 25.795181 | 122 | 0.657637 | MarvinGeng |
69d8c36761d3a233b51e22bbde23d7dd80b3438d | 1,690 | cc | C++ | benchmarks/svf/svf.cc | wolvre/maple | c856c70e224a1354f40bbc16b43ff31b96141f75 | [
"Apache-2.0"
] | 5 | 2015-07-20T09:42:22.000Z | 2021-08-30T06:24:17.000Z | benchmarks/svf/svf.cc | wolvre/maple | c856c70e224a1354f40bbc16b43ff31b96141f75 | [
"Apache-2.0"
] | null | null | null | benchmarks/svf/svf.cc | wolvre/maple | c856c70e224a1354f40bbc16b43ff31b96141f75 | [
"Apache-2.0"
] | 2 | 2017-05-23T11:57:07.000Z | 2017-06-30T11:30:44.000Z | #include <pthread.h>
#include <iostream>
#include <stdlib.h>
#include <assert.h>
#include "sync01.h"
#include "sync02.h"
#include "stateful001.h"
#include "stateful002.h"
int inputX = 0;
int inputY = 0;
int data1 = -1, data2 = -1, data3 = -1, data4 = -1;
pthread_mutex_t m;
void add1()
{
data1++;
sync01();... | 14.322034 | 51 | 0.457396 | wolvre |
69d9f8142a17782cacd9ada58f37b6100053badf | 1,730 | hh | C++ | src/interface/MiniMap.hh | zermingore/warevolved | efd0c506658ce6e4ecb6c7eb5bb7d620bc05fd52 | [
"MIT"
] | 1 | 2019-09-23T18:16:27.000Z | 2019-09-23T18:16:27.000Z | src/interface/MiniMap.hh | zermingore/warevolved | efd0c506658ce6e4ecb6c7eb5bb7d620bc05fd52 | [
"MIT"
] | 2 | 2018-11-12T18:48:03.000Z | 2018-11-15T21:10:02.000Z | src/interface/MiniMap.hh | zermingore/warevolved | efd0c506658ce6e4ecb6c7eb5bb7d620bc05fd52 | [
"MIT"
] | null | null | null | /**
* \file
* \date August 22, 2017
* \author Zermingore
* \namespace interface
* \brief Side panel's MiniMap class declaration
*/
#ifndef INTERFACE_MINIMAP_HH_
# define INTERFACE_MINIMAP_HH_
# include <memory>
# include <vector>
# include <utility>
# include <graphics/graphic_types.hh>
# include <interface/I... | 20.116279 | 79 | 0.678613 | zermingore |
69db2db1e436f63c84fa746623f66d4ebd6aa610 | 3,004 | cpp | C++ | engine/src/app/Window.cpp | Dino97/Kinemo | 4aeee2c960961f2e5d453734b9fb1a8e7c717cdf | [
"MIT"
] | 2 | 2019-10-14T02:19:55.000Z | 2019-10-15T01:24:53.000Z | engine/src/app/Window.cpp | Dino97/Kinemo | 4aeee2c960961f2e5d453734b9fb1a8e7c717cdf | [
"MIT"
] | null | null | null | engine/src/app/Window.cpp | Dino97/Kinemo | 4aeee2c960961f2e5d453734b9fb1a8e7c717cdf | [
"MIT"
] | null | null | null | #include "Window.h"
#include "glad/glad.h"
#include "GLFW/glfw3.h"
#include <iostream>
namespace Kinemo
{
void OpenGLDebugCallback(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar* message, const void* userParam);
Window::Window(const WindowProperties& properties)
{
gl... | 23.84127 | 151 | 0.704394 | Dino97 |
69dcb8ac6bb044141d4a7ebe874e5ff1b71122c7 | 3,070 | cpp | C++ | push-3.1.0/test/test_name.cpp | emilydolson/eco-ea-mancala | f9c42611547205c97524830ea3ad33e675aaadbd | [
"MIT"
] | null | null | null | push-3.1.0/test/test_name.cpp | emilydolson/eco-ea-mancala | f9c42611547205c97524830ea3ad33e675aaadbd | [
"MIT"
] | null | null | null | push-3.1.0/test/test_name.cpp | emilydolson/eco-ea-mancala | f9c42611547205c97524830ea3ad33e675aaadbd | [
"MIT"
] | null | null | null |
/***************************************************************************
* Copyright (C) 2004 by Maarten Keijzer *
* mkeijzer@xs4all.nl *
* *
* This p... | 26.016949 | 100 | 0.461889 | emilydolson |
69e19dddbc67b1ad175a8e49a731c6b4c6bf12d0 | 6,839 | hpp | C++ | posu/units/system/si/electric_current.hpp | zhu48/posu | 4872bd7572485c1c352aaf5db7a99d578a682113 | [
"MIT"
] | null | null | null | posu/units/system/si/electric_current.hpp | zhu48/posu | 4872bd7572485c1c352aaf5db7a99d578a682113 | [
"MIT"
] | 33 | 2020-12-14T02:50:22.000Z | 2022-03-08T03:20:15.000Z | posu/units/system/si/electric_current.hpp | zhu48/posu | 4872bd7572485c1c352aaf5db7a99d578a682113 | [
"MIT"
] | null | null | null | #ifndef POSU_UNITS_SI_ELECTRIC_CURRENT_HPP
#define POSU_UNITS_SI_ELECTRIC_CURRENT_HPP
#include "posu/units/base_unit.hpp"
#include "posu/units/system/electric_current.hpp"
namespace posu::units::si {
struct electric_current : public posu::units::electric_current {
using type = electric_current;
... | 47.165517 | 97 | 0.639421 | zhu48 |
69e2b63845fe337ad0c8eb2d1646301809720d44 | 496 | cpp | C++ | source/code/scratch/old_repos/Jstd/Jstd/project/src/jstd-tool/jstd-tool/database_dumper.cpp | luxe/CodeLang-compiler | 78837d90bdd09c4b5aabbf0586a5d8f8f0c1e76a | [
"MIT"
] | 33 | 2019-05-30T07:43:32.000Z | 2021-12-30T13:12:32.000Z | source/code/scratch/old_repos/Jstd/Jstd/project/src/jstd-tool/jstd-tool/database_dumper.cpp | luxe/CodeLang-compiler | 78837d90bdd09c4b5aabbf0586a5d8f8f0c1e76a | [
"MIT"
] | 371 | 2019-05-16T15:23:50.000Z | 2021-09-04T15:45:27.000Z | source/code/scratch/old_repos/Jstd/Jstd/project/src/jstd-tool/jstd-tool/database_dumper.cpp | UniLang/compiler | c338ee92994600af801033a37dfb2f1a0c9ca897 | [
"MIT"
] | 6 | 2019-08-22T17:37:36.000Z | 2020-11-07T07:15:32.000Z | #include "database_dumper.hpp"
#include "utilities.hpp"
#include "global.hpp"
#include <cstdlib>
#include <fstream>
void Database_Dumper::Dump_Database_If_Needed(Program_Options const& program_options, std::time_t const& last_run_time) {
if (program_options.Database()){
Perform_Timed_Database_Dumping(program_optio... | 24.8 | 127 | 0.802419 | luxe |
69e2c03aba56f1945d3b65501dd6a53b7fa545cf | 2,771 | hpp | C++ | modules/core/reduction/include/nt2/core/functions/scalar/inner_fold.hpp | pbrunet/nt2 | 2aeca0f6a315725b335efd5d9dc95d72e10a7fb7 | [
"BSL-1.0"
] | 2 | 2016-09-14T00:23:53.000Z | 2018-01-14T12:51:18.000Z | modules/core/reduction/include/nt2/core/functions/scalar/inner_fold.hpp | pbrunet/nt2 | 2aeca0f6a315725b335efd5d9dc95d72e10a7fb7 | [
"BSL-1.0"
] | null | null | null | modules/core/reduction/include/nt2/core/functions/scalar/inner_fold.hpp | pbrunet/nt2 | 2aeca0f6a315725b335efd5d9dc95d72e10a7fb7 | [
"BSL-1.0"
] | null | null | null | //==============================================================================
// Copyright 2003 - 2011 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2011 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// ... | 37.445946 | 116 | 0.510646 | pbrunet |
69e7b9f35f2749d9ec18ec50f7ad54aa4218466f | 421 | cc | C++ | confonnx/server/enclave/props.cc | kapilvgit/onnx-server-openenclave | 974e747c9ba08d6a4fc5cc9943acc1b937a933df | [
"MIT"
] | null | null | null | confonnx/server/enclave/props.cc | kapilvgit/onnx-server-openenclave | 974e747c9ba08d6a4fc5cc9943acc1b937a933df | [
"MIT"
] | null | null | null | confonnx/server/enclave/props.cc | kapilvgit/onnx-server-openenclave | 974e747c9ba08d6a4fc5cc9943acc1b937a933df | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
#include <openenclave/enclave.h>
// Default parameters, can be overridden during signing.
OE_SET_ENCLAVE_SGX(
1, /* ProductID */
1, /* SecurityVersion */
true, /* AllowDebug */
60... | 30.071429 | 60 | 0.603325 | kapilvgit |
69edef0a4d42fd8bcf2bb492b6894147cd714fd4 | 2,676 | cpp | C++ | main.cpp | finn-harman/Enigma | db9438a7efd24b3d47ed6bf0dfaa8fbb13f7872a | [
"MIT"
] | null | null | null | main.cpp | finn-harman/Enigma | db9438a7efd24b3d47ed6bf0dfaa8fbb13f7872a | [
"MIT"
] | null | null | null | main.cpp | finn-harman/Enigma | db9438a7efd24b3d47ed6bf0dfaa8fbb13f7872a | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
#include "errors.h"
#include "plugboard.h"
#include "rotor.h"
#include "reflector.h"
#include "enigma.h"
using namespace std;
int const alphabet_size = 26;
void organise_inputs(int argc, char** argv);
int main(int argc, char** argv)
{
int input, pb_output0, rf_output, rot_o... | 22.677966 | 125 | 0.631913 | finn-harman |
69eeca25028549bfb8a4c1f3122fdd82dded221b | 709 | cpp | C++ | src/utils/common/physdll.cpp | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | 6 | 2022-01-23T09:40:33.000Z | 2022-03-20T20:53:25.000Z | src/utils/common/physdll.cpp | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | null | null | null | src/utils/common/physdll.cpp | cstom4994/SourceEngineRebuild | edfd7f8ce8af13e9d23586318350319a2e193c08 | [
"MIT"
] | 1 | 2022-02-06T21:05:23.000Z | 2022-02-06T21:05:23.000Z | //========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $NoKeywords: $
//
//=============================================================================//
#include <stdio.h>
#include "physdll.h"
#include "filesystem_tools.h"
static CSysModule *pPhysicsModule = NULL;
Create... | 24.448276 | 81 | 0.57969 | cstom4994 |
69f3b7b6da6023a0b52386197d29b1e5bcd2c290 | 509 | cpp | C++ | WeeklyHomework/0310_Above_Average.cpp | Ping6666/Algorithm-Project | cdf0b56cd277badcdd964982f5c033fd4888274a | [
"MIT"
] | 1 | 2021-04-12T05:08:07.000Z | 2021-04-12T05:08:07.000Z | WeeklyHomework/0310_Above_Average.cpp | Ping6666/Algorithm-Projects | cdf0b56cd277badcdd964982f5c033fd4888274a | [
"MIT"
] | null | null | null | WeeklyHomework/0310_Above_Average.cpp | Ping6666/Algorithm-Projects | cdf0b56cd277badcdd964982f5c033fd4888274a | [
"MIT"
] | null | null | null | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int N,score[100][100],sum[100],ans[100];
cin>>N;
for(int i=0;i<N;i++)
{
cin>>score[i][0];
sum[i]=0;
ans[i]=0;
for(int j=0;j<score[i][0];j++)
{
cin>>score[i][j+1];
sum[i]+=score[i][j+1];
}
for(int j=0;j<sc... | 16.966667 | 70 | 0.485265 | Ping6666 |
69f43de5ad9383ee1aba2396742ee1fc7628b0e5 | 2,067 | cpp | C++ | jogo/src/utils/classes/menu.cpp | Hyodar/jogo-tecprog | 3a8cdf2cae583ad88a9377d0fbf796ba45d9d408 | [
"MIT"
] | null | null | null | jogo/src/utils/classes/menu.cpp | Hyodar/jogo-tecprog | 3a8cdf2cae583ad88a9377d0fbf796ba45d9d408 | [
"MIT"
] | null | null | null | jogo/src/utils/classes/menu.cpp | Hyodar/jogo-tecprog | 3a8cdf2cae583ad88a9377d0fbf796ba45d9d408 | [
"MIT"
] | null | null | null |
// Libraries
// ---------------------------------------------------------------------------
// Class header
// ---------------------
#include "menu.hpp"
// Internal libraries
// ---------------------
#include "graphics_manager.hpp"
using namespace bardadv::core;
using namespace bardadv::menus;
// Methods
// ----... | 24.607143 | 84 | 0.426222 | Hyodar |
69f9c008f5133233c43e173c9ac827b31ad70ca4 | 4,489 | cxx | C++ | test/itkHDF5UltrasoundImageIOTest.cxx | tbirdso/ITKUltrasound | fb5915978de73a71b0fc43b9ce1c9d32dfa19783 | [
"Apache-2.0"
] | 38 | 2015-01-20T14:16:22.000Z | 2022-03-16T09:23:09.000Z | test/itkHDF5UltrasoundImageIOTest.cxx | thewtex/ITKUltrasound | 9ab459466ffe155840fdf3de30aafb3660dba800 | [
"Apache-2.0"
] | 83 | 2015-08-05T14:09:42.000Z | 2022-03-30T20:28:03.000Z | test/itkHDF5UltrasoundImageIOTest.cxx | thewtex/ITKUltrasound | 9ab459466ffe155840fdf3de30aafb3660dba800 | [
"Apache-2.0"
] | 29 | 2015-03-27T23:23:20.000Z | 2022-01-04T22:44:57.000Z | /*=========================================================================
*
* Copyright NumFOCUS
*
* 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.or... | 41.564815 | 120 | 0.689686 | tbirdso |
69fde02f06219de5181fed4b4211e703e0b110ab | 1,281 | cpp | C++ | algorithmic-toolbox/week5_dynamic_programming1/2_primitive_calculator/primitive_calculator.cpp | hsgrewal/algorithms | b7532cc14221490128bb6aa12b06d20656855b8d | [
"MIT"
] | null | null | null | algorithmic-toolbox/week5_dynamic_programming1/2_primitive_calculator/primitive_calculator.cpp | hsgrewal/algorithms | b7532cc14221490128bb6aa12b06d20656855b8d | [
"MIT"
] | null | null | null | algorithmic-toolbox/week5_dynamic_programming1/2_primitive_calculator/primitive_calculator.cpp | hsgrewal/algorithms | b7532cc14221490128bb6aa12b06d20656855b8d | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
using std::vector;
vector<int> optimal_sequence(int n) {
std::vector<int> sequence;
vector<int> array(n + 1);
int a1, m2, m3;
for (int i = 2; i <= n; ++i) {
a1 = m2 = m3 = std::numeric_limits<int>::max();
if (... | 26.142857 | 71 | 0.442623 | hsgrewal |
0e0151bb98ff6cfa3a739a80ed8b0665eeaa33e4 | 309 | hpp | C++ | epoch/ayla/include/ayla/serialization/cylinder_serializer.hpp | oprogramadorreal/vize | 042c16f96d8790303563be6787200558e1ec00b2 | [
"MIT"
] | 47 | 2020-03-30T14:36:46.000Z | 2022-03-06T07:44:54.000Z | epoch/ayla/include/ayla/serialization/cylinder_serializer.hpp | oprogramadorreal/vize | 042c16f96d8790303563be6787200558e1ec00b2 | [
"MIT"
] | null | null | null | epoch/ayla/include/ayla/serialization/cylinder_serializer.hpp | oprogramadorreal/vize | 042c16f96d8790303563be6787200558e1ec00b2 | [
"MIT"
] | 8 | 2020-04-01T01:22:45.000Z | 2022-01-02T13:06:09.000Z | #ifndef AYLA_CYLINDER_SERIALIZER_HPP
#define AYLA_CYLINDER_SERIALIZER_HPP
namespace ayla {
class Cylinder;
}
namespace boost {
namespace serialization {
template <class Archive>
void serialize(Archive& ar, ayla::Cylinder& cylinder, const unsigned int version);
}
}
#endif // AYLA_CYLINDER_SERIALIZER_HPP | 18.176471 | 82 | 0.802589 | oprogramadorreal |
0e032a6fdb93400c1863fd8f936662b9b3d24266 | 2,893 | cpp | C++ | tests/util_scoped_timer.cpp | extcpp/base | 26b1384cbbd5cb3171e4cd22c8eb5f09ec0c5732 | [
"MIT"
] | null | null | null | tests/util_scoped_timer.cpp | extcpp/base | 26b1384cbbd5cb3171e4cd22c8eb5f09ec0c5732 | [
"MIT"
] | 22 | 2019-10-15T20:47:02.000Z | 2020-01-26T20:26:19.000Z | tests/util_scoped_timer.cpp | extcpp/base | 26b1384cbbd5cb3171e4cd22c8eb5f09ec0c5732 | [
"MIT"
] | 1 | 2020-09-24T08:53:15.000Z | 2020-09-24T08:53:15.000Z | // Copyright - 2020 - Jan Christoph Uhde <Jan@UhdeJC.com>
// Please see LICENSE.md for license or visit https://github.com/extcpp/basics
#include <ext/macros/compiler.hpp>
#include <ext/util/scoped_timer.hpp>
#include <gtest/gtest.h>
#include <iostream>
#include <thread>
using namespace ext::util;
constexpr auto ms =... | 25.830357 | 118 | 0.622883 | extcpp |
0e0a5d6325e483fccf2b291a21ec1f3da9682996 | 2,042 | cpp | C++ | src/ParamGen.cpp | Jesusausage/ZKP_Voting | c98658ac533522a146b0be5a976cb215f130a4ec | [
"MIT"
] | 1 | 2019-07-04T18:54:07.000Z | 2019-07-04T18:54:07.000Z | src/ParamGen.cpp | Jesusausage/ZKP_Voting | c98658ac533522a146b0be5a976cb215f130a4ec | [
"MIT"
] | null | null | null | src/ParamGen.cpp | Jesusausage/ZKP_Voting | c98658ac533522a146b0be5a976cb215f130a4ec | [
"MIT"
] | 1 | 2019-09-10T00:15:30.000Z | 2019-09-10T00:15:30.000Z | #include "ParamGen.hpp"
void generateParams()
{
auto ecg = GenerateECGroup();
auto base = GenerateECBase();
std::ofstream token_out(TOKEN_FILE);
std::ofstream id_out(ID_FILE);
CryptoPP::Integer token_keys[10][5];
CryptoPP::ECPPoint tokens[10][5];
CryptoPP::ECPPoint token_sums[5];
C... | 29.171429 | 86 | 0.582272 | Jesusausage |
0e0bb2f4f3904d3a93316a4ef605060e6fc4bfc1 | 3,860 | cpp | C++ | SampleFoundation/Triangulation/Triangulation.cpp | wjezxujian/WildMagic4 | 249a17f8c447cf57c6283408e01009039810206a | [
"BSL-1.0"
] | 3 | 2021-08-02T04:03:03.000Z | 2022-01-04T07:31:20.000Z | SampleFoundation/Triangulation/Triangulation.cpp | wjezxujian/WildMagic4 | 249a17f8c447cf57c6283408e01009039810206a | [
"BSL-1.0"
] | null | null | null | SampleFoundation/Triangulation/Triangulation.cpp | wjezxujian/WildMagic4 | 249a17f8c447cf57c6283408e01009039810206a | [
"BSL-1.0"
] | 5 | 2019-10-13T02:44:19.000Z | 2021-08-02T04:03:10.000Z | // Geometric Tools, Inc.
// http://www.geometrictools.com
// Copyright (c) 1998-2006. All Rights Reserved
//
// The Wild Magic Version 4 Restricted Libraries source code is supplied
// under the terms of the license agreement
// http://www.geometrictools.com/License/Wm4RestrictedLicense.pdf
// and may not be copie... | 30.634921 | 78 | 0.525907 | wjezxujian |
0e0c6135bb6004a72f5cf58ea0ed1409e1f9f9be | 3,634 | cpp | C++ | src/elements/cube.cpp | jamillosantos/imu-mock | 3d314e8ef37263d72fda412d6d40e522005405f8 | [
"MIT"
] | 1 | 2018-01-21T05:38:04.000Z | 2018-01-21T05:38:04.000Z | src/elements/cube.cpp | mote-robotics/imu-mock | 3d314e8ef37263d72fda412d6d40e522005405f8 | [
"MIT"
] | null | null | null | src/elements/cube.cpp | mote-robotics/imu-mock | 3d314e8ef37263d72fda412d6d40e522005405f8 | [
"MIT"
] | null | null | null | /**
* @author J. Santos <jamillo@gmail.com>
* @date October 06, 2016
*/
#include "cube.h"
draw::Colour elements::Cube::lineColour(1.0f, 1.0f, 1.0f, 0.6f);
elements::CubeColours::CubeColours() :
_top(draw::Colour::RED), _bottom(draw::Colour::ORANGE), _left(draw::Colour::YELLOW),
_right(draw::Colour::WHITE), _fro... | 22.294479 | 85 | 0.61585 | jamillosantos |
0e0db1fd0bd8ee19cec18d6339686fa9b66a0ebc | 1,052 | cpp | C++ | aws-cpp-sdk-servicecatalog/source/model/DescribePortfolioShareStatusRequest.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2022-02-12T08:09:30.000Z | 2022-02-12T08:09:30.000Z | aws-cpp-sdk-servicecatalog/source/model/DescribePortfolioShareStatusRequest.cpp | Neusoft-Technology-Solutions/aws-sdk-cpp | 88c041828b0dbee18a297c3cfe98c5ecd0706d0b | [
"Apache-2.0"
] | 1 | 2021-10-14T16:57:00.000Z | 2021-10-18T10:47:24.000Z | aws-cpp-sdk-servicecatalog/source/model/DescribePortfolioShareStatusRequest.cpp | ravindra-wagh/aws-sdk-cpp | 7d5ff01b3c3b872f31ca98fb4ce868cd01e97696 | [
"Apache-2.0"
] | 1 | 2021-11-09T11:58:03.000Z | 2021-11-09T11:58:03.000Z | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/servicecatalog/model/DescribePortfolioShareStatusRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::ServiceCatalog::Model;
using namespa... | 23.909091 | 121 | 0.789924 | Neusoft-Technology-Solutions |
97b98fef6f27bb72b87edcde7566c85b1db11509 | 5,127 | cc | C++ | chromeos/dbus/upstart_client.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chromeos/dbus/upstart_client.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | chromeos/dbus/upstart_client.cc | metux/chromium-deb | 3c08e9b89a1b6f95f103a61ff4f528dbcd57fc42 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | // Copyright 2016 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 "chromeos/dbus/upstart_client.h"
#include "base/bind.h"
#include "base/memory/weak_ptr.h"
#include "dbus/bus.h"
#include "dbus/message.h"
#inclu... | 36.621429 | 78 | 0.704115 | metux |
97bb897a388326c6e4f0d84a8a136f3b232f9348 | 10,399 | cpp | C++ | light_caster/main.cpp | raylib-extras/examples-cpp | 1cac8ea52805c03d4fd29e924c854400f8ba72ef | [
"Zlib"
] | 10 | 2021-11-18T06:19:32.000Z | 2022-03-08T04:44:19.000Z | light_caster/main.cpp | raylib-extras/examples-cpp | 1cac8ea52805c03d4fd29e924c854400f8ba72ef | [
"Zlib"
] | 1 | 2022-01-02T05:27:00.000Z | 2022-03-24T04:42:40.000Z | light_caster/main.cpp | raylib-extras/examples-cpp | 1cac8ea52805c03d4fd29e924c854400f8ba72ef | [
"Zlib"
] | null | null | null | #include "raylib.h"
#include "raymath.h"
#include "rlgl.h"
// constants from OpenGL
#define GL_SRC_ALPHA 0x0302
#define GL_MIN 0x8007
#define GL_MAX 0x8008
#include <vector>
// Draw a gradient-filled circle
// NOTE: Gradient goes from inner radius (color1) to border (color2)
void DrawLightGradient(int centerX, int ... | 24.64218 | 167 | 0.683623 | raylib-extras |
97bc92512489c19bd54536f23f947fe46fb8292e | 591 | cpp | C++ | src/J/J102.cpp | wlhcode/lscct | 7fd112a9d1851ddcf41886d3084381a52e84a3ce | [
"MIT"
] | null | null | null | src/J/J102.cpp | wlhcode/lscct | 7fd112a9d1851ddcf41886d3084381a52e84a3ce | [
"MIT"
] | null | null | null | src/J/J102.cpp | wlhcode/lscct | 7fd112a9d1851ddcf41886d3084381a52e84a3ce | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int r[200005][4];
int main(){
int x,y,n,a=0,q=0;
bool small=0;
cin>>y>>x>>n;
for(int i=1;i<=n;i++){
cin>>r[i][0]>>r[i][1]>>r[i][2];
if(r[i][0]>=y&&q==0) q=i-1;
if(r[i][0]<y) small=1;
}
if(q==0&&small) q=n;
if(!small) q=0;
while(q>0){
y=r[q][0];
bool gone=0;... | 16.885714 | 59 | 0.431472 | wlhcode |
97c34395c7e4e97ef721670fb96a4cc1f4e2fcac | 2,765 | cpp | C++ | src/installerapplication.cpp | CommitteeOfZero/noidget | 1ba0b37f7552c1659a8a7c8dd62893c9eece702a | [
"MIT"
] | null | null | null | src/installerapplication.cpp | CommitteeOfZero/noidget | 1ba0b37f7552c1659a8a7c8dd62893c9eece702a | [
"MIT"
] | null | null | null | src/installerapplication.cpp | CommitteeOfZero/noidget | 1ba0b37f7552c1659a8a7c8dd62893c9eece702a | [
"MIT"
] | null | null | null | #include "installerapplication.h"
#include "installerwindow.h"
#include <api/apihost.h>
#include "fs.h"
#include <tx/transaction.h>
#include "receiptwriter.h"
#include "win32_registry.h"
#include <QFile>
#include <QTextStream>
#include <QStyleFactory>
#include <QResource>
#include <QMessageBox>
#include <QScriptEngineA... | 29.414894 | 79 | 0.662929 | CommitteeOfZero |
97c48b8a9788a1ab9232e0d8f1621cfa722de560 | 99 | hpp | C++ | templates/include/Quote.hpp | mcqueen256/mql4dllft | 2b918da25efa8056eca967e4d40d07487f030ee8 | [
"MIT"
] | null | null | null | templates/include/Quote.hpp | mcqueen256/mql4dllft | 2b918da25efa8056eca967e4d40d07487f030ee8 | [
"MIT"
] | 11 | 2017-07-11T22:26:44.000Z | 2017-07-20T04:14:54.000Z | templates/include/Quote.hpp | mcqueen256/mql4dllft | 2b918da25efa8056eca967e4d40d07487f030ee8 | [
"MIT"
] | null | null | null | #ifndef QUOTE_HPP
#define QUOTE_HPP
class Quote {
private:
public:
Quote();
~Quote();
};
#endif | 9 | 17 | 0.686869 | mcqueen256 |
97c5775757ddabd48f6c0aadaef9348ed40d34f0 | 7,770 | cpp | C++ | src/protocol/websocket/client.cpp | cysme/pump | d91cfdf3e09ebca1e90f0c1395a3b3fba1158a0c | [
"Apache-2.0"
] | 2 | 2020-07-16T04:57:40.000Z | 2020-11-24T10:33:48.000Z | src/protocol/websocket/client.cpp | jimi36/pump | d91cfdf3e09ebca1e90f0c1395a3b3fba1158a0c | [
"Apache-2.0"
] | 2 | 2020-12-23T09:40:16.000Z | 2021-03-03T09:49:36.000Z | src/protocol/websocket/client.cpp | cysme/pump | d91cfdf3e09ebca1e90f0c1395a3b3fba1158a0c | [
"Apache-2.0"
] | 3 | 2020-11-24T10:33:35.000Z | 2021-04-19T01:53:24.000Z | /*
* Copyright (C) 2015-2018 ZhengHaiTao <ming8ren@163.com>
*
* 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... | 31.714286 | 92 | 0.563964 | cysme |
97c76b6ded2d81f894df6d6bec179d34d02bd5ed | 5,538 | cpp | C++ | packages/monte_carlo/event/estimator/test/tstSurfaceFluxEstimatorDagMC.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 10 | 2019-11-14T19:58:30.000Z | 2021-04-04T17:44:09.000Z | packages/monte_carlo/event/estimator/test/tstSurfaceFluxEstimatorDagMC.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 43 | 2020-03-03T19:59:20.000Z | 2021-09-08T03:36:08.000Z | packages/monte_carlo/event/estimator/test/tstSurfaceFluxEstimatorDagMC.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 6 | 2020-02-12T17:37:07.000Z | 2020-09-08T18:59:51.000Z | //---------------------------------------------------------------------------//
//!
//! \file tstSurfaceFluxEstimatorDagMC.cpp
//! \author Alex Robinson
//! \brief Surface flux estimator using DagMC unit tests.
//!
//---------------------------------------------------------------------------//
// Std Lib Includes
#... | 41.328358 | 112 | 0.524016 | bam241 |
97c7fe1215edf4b42686f017ef6d2281e3ab6088 | 22,669 | cpp | C++ | apc_grasping/src/fill_bins_and_tote.cpp | Juxi/apb-baseline | fd47a5fd78cdfd75c68601a40ca4726d7d20c9ce | [
"BSD-3-Clause"
] | 9 | 2017-02-06T10:24:56.000Z | 2022-02-27T20:59:52.000Z | apc_grasping/src/fill_bins_and_tote.cpp | Juxi/apb-baseline | fd47a5fd78cdfd75c68601a40ca4726d7d20c9ce | [
"BSD-3-Clause"
] | null | null | null | apc_grasping/src/fill_bins_and_tote.cpp | Juxi/apb-baseline | fd47a5fd78cdfd75c68601a40ca4726d7d20c9ce | [
"BSD-3-Clause"
] | 2 | 2017-10-15T08:33:37.000Z | 2019-03-05T07:29:38.000Z | /*
Copyright 2016 Australian Centre for Robotic Vision
*/
#include <geometry_msgs/Pose.h>
#include <ros/ros.h>
#include <moveit_msgs/CollisionObject.h>
#include <moveit_msgs/PlanningScene.h>
#include <apc_msgs/FillUnfillBinsCollisionModel.h>
#include <std_srvs/SetBool.h>
#include <std_srvs/Trigger.h>
#include <... | 37.908027 | 83 | 0.5961 | Juxi |
97c9998964e85bfb4e70b1f99c3c4b490be2c22a | 235 | cpp | C++ | docs/mfc/reference/codesnippet/CPP/cmfcpopupmenu-class_2.cpp | jmittert/cpp-docs | cea5a8ee2b4764b2bac4afe5d386362ffd64e55a | [
"CC-BY-4.0",
"MIT"
] | 14 | 2018-01-28T18:10:55.000Z | 2021-11-16T13:21:18.000Z | docs/mfc/reference/codesnippet/CPP/cmfcpopupmenu-class_2.cpp | jmittert/cpp-docs | cea5a8ee2b4764b2bac4afe5d386362ffd64e55a | [
"CC-BY-4.0",
"MIT"
] | null | null | null | docs/mfc/reference/codesnippet/CPP/cmfcpopupmenu-class_2.cpp | jmittert/cpp-docs | cea5a8ee2b4764b2bac4afe5d386362ffd64e55a | [
"CC-BY-4.0",
"MIT"
] | 2 | 2018-10-10T07:37:30.000Z | 2019-06-21T15:18:07.000Z | CMFCPopupMenu* pPopupMenu = new CMFCPopupMenu;
// CPoint point
// CMenu* pPopup
// The this pointer points to CMainFrame class which extends the CFrameWnd class.
pPopupMenu->Create (this, point.x, point.y, pPopup->Detach ()); | 47 | 83 | 0.72766 | jmittert |
97cd01b4141bf5cca6925538f0cc7b863578db68 | 4,656 | cpp | C++ | src/generate-random-inputs-euclidean.cpp | maumueller/random-inputs | 12d876dfbf06a54af3e876123905a082b41e04dc | [
"MIT"
] | 1 | 2019-07-31T07:33:26.000Z | 2019-07-31T07:33:26.000Z | src/generate-random-inputs-euclidean.cpp | maumueller/random-inputs | 12d876dfbf06a54af3e876123905a082b41e04dc | [
"MIT"
] | null | null | null | src/generate-random-inputs-euclidean.cpp | maumueller/random-inputs | 12d876dfbf06a54af3e876123905a082b41e04dc | [
"MIT"
] | null | null | null | /**
* @file generate-random-inputs-euclidean.cpp
* @author Martin Aumüller
*
*/
#include <algorithm>
#include <cmath>
#include <random>
#include <utility>
#include <fstream>
#include <iostream>
#include <set>
#include <tclap/CmdLine.h>
std::random_device rd;
std::mt19937_64 gen(rd());
std::normal_distribution<dou... | 30.03871 | 141 | 0.624785 | maumueller |
97ce52b8c973ca389d67b354274bf9b4de93785e | 23,632 | cpp | C++ | src/clustering/louvain.cpp | zlthinker/STBA | c0034d67018c9b7a72459821e9e9ad46870b6292 | [
"MIT"
] | 175 | 2020-08-02T11:48:11.000Z | 2022-02-28T04:54:36.000Z | src/clustering/louvain.cpp | zlthinker/STBA | c0034d67018c9b7a72459821e9e9ad46870b6292 | [
"MIT"
] | 1 | 2020-10-02T08:42:11.000Z | 2020-10-02T08:42:11.000Z | src/clustering/louvain.cpp | zlthinker/STBA | c0034d67018c9b7a72459821e9e9ad46870b6292 | [
"MIT"
] | 25 | 2020-08-02T13:04:15.000Z | 2022-02-28T04:54:28.000Z | #include "STBA/clustering/louvain.h"
#include "STBA/utility.h"
#include <queue>
#include <chrono>
#include <unordered_map>
#include <iostream>
size_t RandomPick(std::unordered_map<size_t, double> const & prob_map)
{
assert(!prob_map.empty());
double sum = 0.0;
std::unordered_map<size_t, double>::const_ite... | 33.663818 | 132 | 0.609047 | zlthinker |
97ce6d330d558ae100db503d62572da03fa4e46a | 1,593 | cpp | C++ | 3rdparty/libcxx/libcxx/test/std/language.support/support.limits/support.limits.general/exception.version.pass.cpp | jbdelcuv/openenclave | c2e9cfabd788597f283c8dd39edda5837b1b1339 | [
"MIT"
] | 15 | 2019-08-05T01:24:20.000Z | 2022-01-12T08:19:55.000Z | 3rdparty/libcxx/libcxx/test/std/language.support/support.limits/support.limits.general/exception.version.pass.cpp | jbdelcuv/openenclave | c2e9cfabd788597f283c8dd39edda5837b1b1339 | [
"MIT"
] | 21 | 2020-02-05T11:09:56.000Z | 2020-03-26T18:09:09.000Z | 3rdparty/libcxx/libcxx/test/std/language.support/support.limits/support.limits.general/exception.version.pass.cpp | jbdelcuv/openenclave | c2e9cfabd788597f283c8dd39edda5837b1b1339 | [
"MIT"
] | 9 | 2019-09-24T06:26:58.000Z | 2021-11-22T08:54:00.000Z | //===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------... | 27.947368 | 80 | 0.666667 | jbdelcuv |
97d12936cf4bb7640cd2bd31ab0c547dd7ffbc28 | 8,751 | cc | C++ | src/catkin_projects/drake_iiwa_sim/src/ros_scene_graph_visualizer.cc | mehrdad-shokri/spartan | 854b26e3af75910ef57b874db7853abd4249543e | [
"BSD-3-Clause-Clear"
] | 32 | 2017-09-09T12:02:02.000Z | 2022-01-26T10:46:31.000Z | src/catkin_projects/drake_iiwa_sim/src/ros_scene_graph_visualizer.cc | mehrdad-shokri/spartan | 854b26e3af75910ef57b874db7853abd4249543e | [
"BSD-3-Clause-Clear"
] | 235 | 2017-06-06T18:14:17.000Z | 2020-10-01T15:09:21.000Z | src/catkin_projects/drake_iiwa_sim/src/ros_scene_graph_visualizer.cc | mehrdad-shokri/spartan | 854b26e3af75910ef57b874db7853abd4249543e | [
"BSD-3-Clause-Clear"
] | 32 | 2017-06-09T15:27:59.000Z | 2021-07-13T02:58:58.000Z | #include "drake_iiwa_sim/ros_scene_graph_visualizer.h"
#include "drake/multibody/shapes/geometry.h"
#include "drake/common/drake_assert.h"
#include "drake/geometry/geometry_visualization.h"
#include "drake/math/rigid_transform.h"
#include "drake/math/rotation_matrix.h"
#include "drake/math/quaternion.h"
#include "drak... | 38.893333 | 93 | 0.642898 | mehrdad-shokri |
97d2074f21a845e1b6b7ec12ba6a27e54cc3cf51 | 136,210 | cpp | C++ | capPaintPlayerWav2Sketch/AudioSampleYeahwav.cpp | Drc3p0/TouchSound | 3748d161a3706918ce75934cd64543347426545e | [
"MIT"
] | 1 | 2019-10-23T17:47:05.000Z | 2019-10-23T17:47:05.000Z | capPaintPlayerWav2Sketch/AudioSampleYeahwav.cpp | Drc3p0/TouchSound | 3748d161a3706918ce75934cd64543347426545e | [
"MIT"
] | null | null | null | capPaintPlayerWav2Sketch/AudioSampleYeahwav.cpp | Drc3p0/TouchSound | 3748d161a3706918ce75934cd64543347426545e | [
"MIT"
] | null | null | null | // Audio data converted from WAV file by wav2sketch
#include "AudioSampleYeahwav.h"
// Converted from YEAHwav.wav, using 11025 Hz, u-law encoding
const unsigned int AudioSampleYeahwav[12089] = {
0x0300BCDD,0x00020380,0x01010480,0x81808282,0x83868180,0x85878002,0x80018500,0x0003808A,
0x81000082,0x01018301,0x838... | 89.611842 | 89 | 0.88865 | Drc3p0 |
97d22cfa4d2c779f4392e9567e15715f18ec83b1 | 2,136 | cpp | C++ | user_models/src/coding/galois.cpp | uclanrl/dt-icansim | 3d4288145abe4cafbbd75af2b0bc697c0bebe4e8 | [
"bzip2-1.0.6"
] | null | null | null | user_models/src/coding/galois.cpp | uclanrl/dt-icansim | 3d4288145abe4cafbbd75af2b0bc697c0bebe4e8 | [
"bzip2-1.0.6"
] | null | null | null | user_models/src/coding/galois.cpp | uclanrl/dt-icansim | 3d4288145abe4cafbbd75af2b0bc697c0bebe4e8 | [
"bzip2-1.0.6"
] | null | null | null | /*
* Copyright (c) 2006-2013, University of California, Los Angeles
* Coded by Joe Yeh/Uichin Lee
* Modified and extended by Seunghoon Lee/Sung Chul Choi
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following condition... | 49.674419 | 188 | 0.740637 | uclanrl |
97d2306696381fd1499a05a90e0469bdcb40987b | 1,978 | cpp | C++ | CPP/WebDev/bbws/WebFramework/Items/Request.cpp | michaelg29/Programming | 2544a742393c6d94e93879f70246ce17d0997011 | [
"MIT"
] | 2 | 2021-04-05T20:44:54.000Z | 2022-01-13T05:25:11.000Z | CPP/WebDev/bbws/WebFramework/Items/Request.cpp | michaelg29/Programming | 2544a742393c6d94e93879f70246ce17d0997011 | [
"MIT"
] | 12 | 2020-02-17T05:19:01.000Z | 2022-03-17T14:56:38.000Z | CPP/WebDev/bbws/WebFramework/Items/Request.cpp | michaelg29/Programming | 2544a742393c6d94e93879f70246ce17d0997011 | [
"MIT"
] | 1 | 2022-01-25T16:48:21.000Z | 2022-01-25T16:48:21.000Z | #include "Request.h"
#include <istream>
#include <sstream>
#include <fstream>
#include <vector>
#include <iterator>
std::string Request::parse() {
std::istringstream iss(m_request);
std::vector<std::string> parsed((std::istream_iterator<std::string>(iss)), std::istream_iterator<std::string>());
method = Global::s... | 23.270588 | 114 | 0.602629 | michaelg29 |
97d25f3120d7c58bf0ce3edfff4aea1bb1ae8ec7 | 501 | cpp | C++ | common/tests/StringToIntMapTest.cpp | alexandru-andronache/adventofcode | ee41d82bae8b705818fda5bd43e9962bb0686fec | [
"Apache-2.0"
] | 3 | 2021-07-01T14:31:06.000Z | 2022-03-29T20:41:21.000Z | common/tests/StringToIntMapTest.cpp | alexandru-andronache/adventofcode | ee41d82bae8b705818fda5bd43e9962bb0686fec | [
"Apache-2.0"
] | null | null | null | common/tests/StringToIntMapTest.cpp | alexandru-andronache/adventofcode | ee41d82bae8b705818fda5bd43e9962bb0686fec | [
"Apache-2.0"
] | null | null | null | #include "StringToIntMapTest.h"
#include <StringToIntMap.h>
using namespace stringtointmap;
TEST_F(StringToIntMapTest, add_string_test_get_index)
{
StringToIntMap t;
t.addString("aaa");
t.addString("bbb");
ASSERT_EQ(t.getIndex("aaa"), 0);
ASSERT_EQ(t.getIndex("ccc"), -1);
}
TEST_F(StringToIntMap... | 20.875 | 54 | 0.686627 | alexandru-andronache |
97d327047291fe0f38d38e90a1c8411abf3f7bd4 | 105,063 | cc | C++ | frontend/src/frontend.cc | robert-mijakovic/readex-ptf | 5514b0545721ef27de0426a7fa0116d2e0bb5eef | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | frontend/src/frontend.cc | robert-mijakovic/readex-ptf | 5514b0545721ef27de0426a7fa0116d2e0bb5eef | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | frontend/src/frontend.cc | robert-mijakovic/readex-ptf | 5514b0545721ef27de0426a7fa0116d2e0bb5eef | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | /**
@file frontend.cc
@ingroup Frontend
@brief Front-end agent
@author Karl Fuerlinger
@verbatim
Revision: $Revision$
Revision date: $Date$
Committed by: $Author$
This file is part of the Periscope Tuning Framework.
See http://www.lrr.in.tum.de/periscope for details.
... | 39.63146 | 150 | 0.513987 | robert-mijakovic |
97d3a473e807c175f2b8a7b3a177cf074cb02032 | 734 | cpp | C++ | qpropgen/templates/template.cpp | agateau/qpropgen | 2eaf65b3b75f63ab97560f86820542f5c17f8c31 | [
"Apache-2.0"
] | 12 | 2018-11-12T17:03:55.000Z | 2020-10-04T22:07:30.000Z | qpropgen/templates/template.cpp | agateau/qpropgen | 2eaf65b3b75f63ab97560f86820542f5c17f8c31 | [
"Apache-2.0"
] | 2 | 2021-03-25T21:40:45.000Z | 2021-04-05T15:09:49.000Z | qpropgen/templates/template.cpp | agateau/qpropgen | 2eaf65b3b75f63ab97560f86820542f5c17f8c31 | [
"Apache-2.0"
] | 1 | 2018-11-12T17:03:55.000Z | 2018-11-12T17:03:55.000Z | // {{ autogenerated_disclaimer }}
#include <{{ header }}>
{{ className }}::{{ className }}(QObject* parent)
: {{ baseClassName }}(parent) {
}
{% for property in properties if not property.impl == 'pure' %}
{{ property.type }} {{ className }}::{{ property.name }}() const {
return {{ property.varName }};
}
{%-... | 27.185185 | 79 | 0.565395 | agateau |
97d8d86a5d670d77b6f886800afe52610252c49c | 3,455 | cpp | C++ | tc 160+/StonesGame.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 3 | 2015-05-25T06:24:37.000Z | 2016-09-10T07:58:00.000Z | tc 160+/StonesGame.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | null | null | null | tc 160+/StonesGame.cpp | ibudiselic/contest-problem-solutions | 88082981b4d87da843472e3ca9ed5f4c42b3f0aa | [
"BSD-2-Clause"
] | 5 | 2015-05-25T06:24:40.000Z | 2021-08-19T19:22:29.000Z | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
void bounds(int N, int M, int K, int &l, int &r) {
int rpoint = max(K, M);
int inpoint = M - rpoint + K;
l = M - 2*(inp... | 39.712644 | 317 | 0.495224 | ibudiselic |
97da2f72108d65d88e60fdf55eb84c7142c85449 | 17,713 | cpp | C++ | imdexp/src/viewer/viewer.cpp | olivierchatry/iri3d | cae98c61d9257546d0fc81e69709297d04a17a14 | [
"MIT"
] | 2 | 2022-01-02T08:12:29.000Z | 2022-02-12T22:15:11.000Z | imdexp/src/viewer/viewer.cpp | olivierchatry/iri3d | cae98c61d9257546d0fc81e69709297d04a17a14 | [
"MIT"
] | null | null | null | imdexp/src/viewer/viewer.cpp | olivierchatry/iri3d | cae98c61d9257546d0fc81e69709297d04a17a14 | [
"MIT"
] | 1 | 2022-01-02T08:09:51.000Z | 2022-01-02T08:09:51.000Z |
#include <stdafx.h>
const int grid_size = 80; // draw a 10x10 grid.
const int grid_primitive_count = grid_size * grid_size * 4; // eache sqaure take 4 lines.
const float grid_increment = 20.0f;
Viewer::Viewer() : _loger(0), _d3d_device(0), _d3d_object(0),
_d3d_bac... | 32.923792 | 133 | 0.616666 | olivierchatry |
97ded0faefa2f15836eacf1033fdbb91b50abc48 | 1,356 | cpp | C++ | algorithms/RANGETREELAZY.cpp | chinoxyz/guiafuentes | 753d026d91ddcbabcccee7947a2ee6c581eb94eb | [
"MIT"
] | null | null | null | algorithms/RANGETREELAZY.cpp | chinoxyz/guiafuentes | 753d026d91ddcbabcccee7947a2ee6c581eb94eb | [
"MIT"
] | null | null | null | algorithms/RANGETREELAZY.cpp | chinoxyz/guiafuentes | 753d026d91ddcbabcccee7947a2ee6c581eb94eb | [
"MIT"
] | null | null | null | #define MAXN 100000
#define T int
#define neutro 0
// entrada, arbol, acumulado(propagacion) elemento 0 se desperdicia
T input[MAXN]; T tree[MAXN*17]; T acum[MAXN*17];
T f(T a, T b) { return a + b; } // Funcion que mantiene el segment tree
// init(1,1,n)
void init(int node, int b, int e) {
acum[node] = 0;
if(b == e... | 27.673469 | 71 | 0.514749 | chinoxyz |
97dfc4c86bb06a5524073a57fa567a120bd0c5e7 | 602 | cc | C++ | examples/channels.cc | kjdv/kthread | d606c2455e9db52c731f58b8b30ad37a55e956d6 | [
"MIT"
] | 1 | 2021-05-09T16:12:56.000Z | 2021-05-09T16:12:56.000Z | examples/channels.cc | kjdv/kthread | d606c2455e9db52c731f58b8b30ad37a55e956d6 | [
"MIT"
] | null | null | null | examples/channels.cc | kjdv/kthread | d606c2455e9db52c731f58b8b30ad37a55e956d6 | [
"MIT"
] | 1 | 2021-05-09T16:12:57.000Z | 2021-05-09T16:12:57.000Z | #include <channel.hh>
#include <threadpool.hh>
#include <iostream>
namespace {
using namespace std;
using namespace kthread;
void consume(receiver<int> tx)
{
while(tx.receive()
.map([](auto&& item) {
cout << "consuming " << item << '\n';
return 0;
})
... | 15.05 | 51 | 0.523256 | kjdv |
97e04a1132734684d8e4d05439fcae771b5c05c3 | 8,906 | cpp | C++ | tests/type_check_test.cpp | claremacrae/eml | d10eb7fcfc51abb277c1edbec8f15a7ed806ceb1 | [
"MIT"
] | 3 | 2020-11-03T19:22:11.000Z | 2021-05-05T13:16:15.000Z | tests/type_check_test.cpp | claremacrae/eml | d10eb7fcfc51abb277c1edbec8f15a7ed806ceb1 | [
"MIT"
] | 2 | 2020-04-01T12:57:24.000Z | 2021-02-19T10:17:30.000Z | tests/type_check_test.cpp | claremacrae/eml | d10eb7fcfc51abb277c1edbec8f15a7ed806ceb1 | [
"MIT"
] | 2 | 2020-10-15T18:28:18.000Z | 2020-10-25T16:44:17.000Z | #include "ast.hpp"
#include "compiler.hpp"
#include <catch2/catch.hpp>
auto parse_and_type_check(eml::Compiler& compiler, std::string_view s,
eml::GarbageCollector& gc)
{
return eml::parse(s, gc).and_then(
[&compiler](auto&& ast) { return compiler.type_check(ast); });
}
TEST_CASE("T... | 23.072539 | 79 | 0.548843 | claremacrae |
97e2a9ee82142776598131c22d6f79ad122e0f03 | 1,063 | cpp | C++ | solved/o-q/phone-list/uva/phone.cpp | abuasifkhan/pc-code | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | [
"Unlicense"
] | 13 | 2015-09-30T19:18:04.000Z | 2021-06-26T21:11:30.000Z | solved/o-q/phone-list/uva/phone.cpp | sbmaruf/pc-code | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | [
"Unlicense"
] | null | null | null | solved/o-q/phone-list/uva/phone.cpp | sbmaruf/pc-code | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | [
"Unlicense"
] | 13 | 2015-01-04T09:49:54.000Z | 2021-06-03T13:18:44.000Z | #include <cstdio>
#include <cstring>
#define ALPHABET 10
#define WORDS 10000
#define WORDLEN 10
#define Zero(v) memset(v, 0, sizeof(v))
#define NonZero(v) (memcmp(v, _zero, sizeof(_zero)) != 0)
static const int _zero[ALPHABET] = {0};
struct Trie {
struct Node {
int children[ALPHABET];
bool end;
};
int n... | 15.185714 | 58 | 0.573848 | abuasifkhan |
97e3bb6c7ff45308e577587f3a2c2f82ec39c4c1 | 1,472 | cpp | C++ | Code/ecrireMemoire/ecirreMemoire.cpp | joabda/Robot | ce27e2e615cb87480c05f9e0ce32124648f9baff | [
"MIT"
] | 1 | 2020-01-26T15:36:07.000Z | 2020-01-26T15:36:07.000Z | Code/ecrireMemoire/ecirreMemoire.cpp | joabda/Robot | ce27e2e615cb87480c05f9e0ce32124648f9baff | [
"MIT"
] | null | null | null | Code/ecrireMemoire/ecirreMemoire.cpp | joabda/Robot | ce27e2e615cb87480c05f9e0ce32124648f9baff | [
"MIT"
] | null | null | null | /*
* Code permettant d'ecrire sur la mémoire externe
* du microcontroleur ATMega16 de Atmel.
*
* Ecole Polytechnique de Montreal
* Departement de genie informatique
* Cours inf1900
*
* Joe Abdo, Mathurin Critin, Teo Quiquempoix et Philippe Babin,
* 2019
*
* Code qui n'est sous aucune license.
*
*/
#includ... | 29.44 | 140 | 0.661005 | joabda |
97e7691f6689308ea11c838e4f93a9ed034a0db2 | 2,168 | cpp | C++ | parrot/src/parrot/renderer/Shader.cpp | MiloHX/Parrot | 159f583b2e43396dcc42dc3456a9c5d3fb043133 | [
"Apache-2.0"
] | null | null | null | parrot/src/parrot/renderer/Shader.cpp | MiloHX/Parrot | 159f583b2e43396dcc42dc3456a9c5d3fb043133 | [
"Apache-2.0"
] | null | null | null | parrot/src/parrot/renderer/Shader.cpp | MiloHX/Parrot | 159f583b2e43396dcc42dc3456a9c5d3fb043133 | [
"Apache-2.0"
] | null | null | null | #include "prpch.h"
#include "parrot/renderer/Shader.h"
#include "parrot/renderer/Renderer.h"
#include "platform/OpenGL/OpenGLShader.h"
namespace parrot {
Ref<Shader> Shader::create(const std::string& file_path) {
switch (Renderer::getAPI()) {
case RendererAPI::API::None:
PR_CORE... | 34.967742 | 127 | 0.625 | MiloHX |
97e987f22301e3c4da2ea659edd61b2616906de1 | 4,525 | cpp | C++ | uppsrc/CtrlLib/DropTree.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | 2 | 2016-04-07T07:54:26.000Z | 2020-04-14T12:37:34.000Z | uppsrc/CtrlLib/DropTree.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | 1 | 2021-04-06T21:57:39.000Z | 2021-04-06T21:57:39.000Z | uppsrc/CtrlLib/DropTree.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | 3 | 2017-08-26T12:06:05.000Z | 2019-11-22T16:57:47.000Z | #include "CtrlLib.h"
namespace Upp {
CH_VALUE(TreeDropEdge, ChBorder(BlackBorder()));
CtrlFrame& TreeDropFrame()
{
static LookFrame m(TreeDropEdge);
return m;
}
PopUpTree::PopUpTree() {
SetFrame(TreeDropFrame());
Accel();
MouseMoveCursor();
NoPopUpEx();
SetDropLines(16);
open = autosize = ... | 19.759825 | 84 | 0.615691 | dreamsxin |
97ea9746475e69d636022c161a72c557f296e6d9 | 2,318 | cpp | C++ | unittest/splitter/splitter.cpp | relick/tls | a9ef85384e0b6394d94daf7798891f8ee4aa31ac | [
"MIT"
] | null | null | null | unittest/splitter/splitter.cpp | relick/tls | a9ef85384e0b6394d94daf7798891f8ee4aa31ac | [
"MIT"
] | null | null | null | unittest/splitter/splitter.cpp | relick/tls | a9ef85384e0b6394d94daf7798891f8ee4aa31ac | [
"MIT"
] | null | null | null | #include <execution>
#include <tls/splitter.h>
#include "../catch.hpp"
TEST_CASE("tls::splitter<> specification") {
SECTION("new instances are default initialized") {
struct test {
int x = 4;
};
REQUIRE(tls::splitter<int>().local() == int{});
REQUIRE(tls::splitter<double... | 31.324324 | 111 | 0.52761 | relick |
97ebafe714b489aff42b63d3d3702660ca97c4c9 | 3,165 | cxx | C++ | bpkg/types-parsers.cxx | build2/bpkg | bd939839b44d90d027517e447537dd52539269ff | [
"MIT"
] | 19 | 2018-05-30T12:01:25.000Z | 2022-01-29T21:37:23.000Z | bpkg/types-parsers.cxx | build2/bpkg | bd939839b44d90d027517e447537dd52539269ff | [
"MIT"
] | 2 | 2019-03-18T22:31:45.000Z | 2020-07-28T06:44:03.000Z | bpkg/types-parsers.cxx | build2/bpkg | bd939839b44d90d027517e447537dd52539269ff | [
"MIT"
] | 1 | 2019-02-04T02:58:14.000Z | 2019-02-04T02:58:14.000Z | // file : bpkg/types-parsers.cxx -*- C++ -*-
// license : MIT; see accompanying LICENSE file
#include <bpkg/types-parsers.hxx>
namespace bpkg
{
namespace cli
{
void parser<url>::
parse (url& x, bool& xs, scanner& s)
{
const char* o (s.next ());
if (!s.more ())
throw missing... | 19.066265 | 75 | 0.473934 | build2 |
97ecdd04a7d87b1c52a06075aa9abd8c6990c1b2 | 770 | cc | C++ | base/containers/flag_set_test.cc | mayah/base | aec046929938d2aaebaadce5c5abb58b5cf342b4 | [
"MIT"
] | null | null | null | base/containers/flag_set_test.cc | mayah/base | aec046929938d2aaebaadce5c5abb58b5cf342b4 | [
"MIT"
] | null | null | null | base/containers/flag_set_test.cc | mayah/base | aec046929938d2aaebaadce5c5abb58b5cf342b4 | [
"MIT"
] | null | null | null | #include "base/containers/flag_set.h"
#include <gtest/gtest.h>
TEST(FlagSetTest, basic)
{
base::FlagSet s;
EXPECT_TRUE(s.empty());
EXPECT_EQ(0, s.size());
s.set(0);
s.set(1);
s.set(5);
s.set(8);
s.set(16);
s.set(31);
s.set(31);
s.set(63);
EXPECT_EQ(7, s.size());
... | 16.73913 | 37 | 0.568831 | mayah |
97f349dfc87fcba4188322e893a6f26fd9c42b84 | 1,516 | cpp | C++ | core/vulkan/vk_memory_tracker_layer/cc/layer_helpers.cpp | isabella232/gapid | bee6c18117577f871a4737a6be77af04c6f11577 | [
"Apache-2.0"
] | 2,100 | 2017-03-06T02:39:43.000Z | 2022-03-30T07:49:26.000Z | core/vulkan/vk_memory_tracker_layer/cc/layer_helpers.cpp | isabella232/gapid | bee6c18117577f871a4737a6be77af04c6f11577 | [
"Apache-2.0"
] | 1,994 | 2017-03-06T02:15:02.000Z | 2022-03-29T22:06:12.000Z | core/vulkan/vk_memory_tracker_layer/cc/layer_helpers.cpp | isabella232/gapid | bee6c18117577f871a4737a6be77af04c6f11577 | [
"Apache-2.0"
] | 351 | 2017-03-06T06:43:35.000Z | 2022-03-30T01:14:27.000Z | /*
* Copyright (C) 2019 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... | 28.074074 | 75 | 0.723615 | isabella232 |
97fa2a64a9aba5feceda8a56215f77ef3f95c38c | 10,789 | cpp | C++ | CommonWalkingControlModules/csrc/ActiveSetQP/QP.cpp | wxmerkt/ihmc-open-robotics-software | 2c47c9a9bd999e7811038e99c3888683f9973a2a | [
"Apache-2.0"
] | 170 | 2016-02-01T18:58:50.000Z | 2022-03-17T05:28:01.000Z | CommonWalkingControlModules/csrc/ActiveSetQP/QP.cpp | wxmerkt/ihmc-open-robotics-software | 2c47c9a9bd999e7811038e99c3888683f9973a2a | [
"Apache-2.0"
] | 162 | 2016-01-29T17:04:29.000Z | 2022-02-10T16:25:37.000Z | CommonWalkingControlModules/csrc/ActiveSetQP/QP.cpp | wxmerkt/ihmc-open-robotics-software | 2c47c9a9bd999e7811038e99c3888683f9973a2a | [
"Apache-2.0"
] | 83 | 2016-01-28T22:49:01.000Z | 2022-03-28T03:11:24.000Z | #include <math.h>
#include <iostream>
#include <Eigen/Cholesky>
#include <Eigen/LU>
#include <Eigen/SVD>
#include "fastQP.h"
#define _USE_MATH_DEFINES
extern "C"
{
int MAX_ITER = -1; // default: #equality constraints
}
using namespace Eigen;
using namespace std;
//template <typename tA, typename tB, typename tC,... | 33.927673 | 346 | 0.634721 | wxmerkt |