hexsha stringlengths 40 40 | size int64 7 1.05M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 269 | max_stars_repo_name stringlengths 5 109 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count int64 1 191k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 4 269 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 9 | max_issues_count int64 1 48.5k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 4 269 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 9 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 7 1.05M | avg_line_length float64 1.21 330k | max_line_length int64 6 990k | alphanum_fraction float64 0.01 0.99 | author_id stringlengths 2 40 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4e1942c0374214c5b57128b5130230f2e8f2e7ee | 5,386 | cpp | C++ | src/TaskGroup.cpp | Javask/CeresTask | d8233ea05320f2b10932caa3527de148ace6ab96 | [
"MIT"
] | null | null | null | src/TaskGroup.cpp | Javask/CeresTask | d8233ea05320f2b10932caa3527de148ace6ab96 | [
"MIT"
] | null | null | null | src/TaskGroup.cpp | Javask/CeresTask | d8233ea05320f2b10932caa3527de148ace6ab96 | [
"MIT"
] | null | null | null | #include <utility>
#include "../include/CeresTask/TaskGroup.h"
#include "RandomString.h"
TaskGroup::TaskGroup() : TaskGroup("TaskGroup_" + generateRandomString(8)) {}
TaskGroup::TaskGroup(std::string name) : name(std::move(std::move(name))) {}
std::optional<size_t> TaskGroup::getFreeIndex() {
auto lock = std::uni... | 27.762887 | 77 | 0.665986 | Javask |
4e1c59d49445bc156ca0d49cb85e6a5dae2ba0fd | 5,855 | cpp | C++ | RESP/Decoder.cpp | dzoidx/redvid | 5ae19afb5cef3d8786f9a8a8642fb687aa5ce329 | [
"MIT"
] | null | null | null | RESP/Decoder.cpp | dzoidx/redvid | 5ae19afb5cef3d8786f9a8a8642fb687aa5ce329 | [
"MIT"
] | null | null | null | RESP/Decoder.cpp | dzoidx/redvid | 5ae19afb5cef3d8786f9a8a8642fb687aa5ce329 | [
"MIT"
] | null | null | null | //
// Created by morgan on 04.02.2019.
//
#include "Decoder.h"
#include <map>
#include <sstream>
std::map<char, DataType> TypeMap =
{
std::make_pair('+', DataType::SimpleString),
std::make_pair('-', DataType::Error),
std::make_pair(':', DataType::Integer),
std::make_pair('$', DataType:... | 22.871094 | 59 | 0.532536 | dzoidx |
4e1f912406da57f4ff43ad069b52381e8d5522a1 | 6,948 | cpp | C++ | main.cpp | JacobSchneck/FeedTheLobster | 07eec4afecb293e28c0b0138fc3f02dda3d53d3e | [
"MIT"
] | null | null | null | main.cpp | JacobSchneck/FeedTheLobster | 07eec4afecb293e28c0b0138fc3f02dda3d53d3e | [
"MIT"
] | null | null | null | main.cpp | JacobSchneck/FeedTheLobster | 07eec4afecb293e28c0b0138fc3f02dda3d53d3e | [
"MIT"
] | null | null | null | // Jacob Schneck
// CS 1wait0
// Module-wait: Open Ended Project
#include "Family.h"
#include "Lobster.h"
#include <iostream>
#include <string>
#include <unistd.h>
#include <vector>
using namespace std;
bool isInVector(vector<string> &vec, string item);
bool removeFromVector(vector<string> &vec, string item);
int ma... | 32.018433 | 95 | 0.471215 | JacobSchneck |
89ed11eea24dcb6dc9c71262f9f9fd0887f4bd67 | 287 | cpp | C++ | ui/api.cpp | mlafroce/avr-avogadro | 2bbd07c4c699749354a5b2f4a1ecd9c6855ab183 | [
"MIT"
] | 9 | 2020-01-24T17:19:57.000Z | 2022-01-01T19:05:20.000Z | ui/api.cpp | mlafroce/avr-avogadro | 2bbd07c4c699749354a5b2f4a1ecd9c6855ab183 | [
"MIT"
] | 12 | 2019-08-04T05:44:21.000Z | 2020-02-24T21:40:21.000Z | ui/api.cpp | mlafroce/avr-avogadro | 2bbd07c4c699749354a5b2f4a1ecd9c6855ab183 | [
"MIT"
] | 2 | 2020-08-20T14:25:31.000Z | 2021-07-13T14:05:23.000Z | #include <QApplication>
#include "MainWindow.h"
#include "McuWrapper.h"
extern "C" {
int run_avogadro_gui(int argc, char *argv[], void* mcu) {
QApplication app(argc, argv);
MainWindow mainWindow(0, mcu);
mainWindow.show();
return app.exec();
}
}
| 22.076923 | 61 | 0.616725 | mlafroce |
89f2f3b2e82acfab04d752a85305ca4f64a3d6d7 | 12,780 | cpp | C++ | src/pgo_toy_example_node.cpp | edward0im/pgo_toy_example | 6473b37f55a739f81faa80cf43e42be2ff3bd9f0 | [
"MIT"
] | 3 | 2020-12-25T08:00:16.000Z | 2022-02-10T02:14:09.000Z | src/pgo_toy_example_node.cpp | edward0im/pgo_toy_example | 6473b37f55a739f81faa80cf43e42be2ff3bd9f0 | [
"MIT"
] | null | null | null | src/pgo_toy_example_node.cpp | edward0im/pgo_toy_example | 6473b37f55a739f81faa80cf43e42be2ff3bd9f0 | [
"MIT"
] | 2 | 2020-12-22T08:44:52.000Z | 2021-01-17T08:47:38.000Z | #include "pgo_toy_example.h"
#include <ros/ros.h>
#include <geometry_msgs/Point.h>
#include <visualization_msgs/Marker.h>
#include <visualization_msgs/MarkerArray.h>
#include <Eigen/Dense>
#include <g2o/core/sparse_optimizer.h>
#include <g2o/core/optimizable_graph.h>
#include <g2o/core/block_solver.h>
#include <g2o... | 36.936416 | 205 | 0.667919 | edward0im |
89f54868854a9e7999180e73cd70e498f00c39ac | 3,241 | hpp | C++ | modules/source/src/data_handler.hpp | Hairuijy/CNStream | 8f6ea30cf25acc45d042686acbbfb7c476ff32c5 | [
"Apache-2.0"
] | 1 | 2019-11-05T01:13:42.000Z | 2019-11-05T01:13:42.000Z | modules/source/src/data_handler.hpp | Hairuijy/CNStream | 8f6ea30cf25acc45d042686acbbfb7c476ff32c5 | [
"Apache-2.0"
] | null | null | null | modules/source/src/data_handler.hpp | Hairuijy/CNStream | 8f6ea30cf25acc45d042686acbbfb7c476ff32c5 | [
"Apache-2.0"
] | null | null | null | /*************************************************************************
* Copyright (C) [2019] by Cambricon, Inc. 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 a... | 31.163462 | 99 | 0.676952 | Hairuijy |
89f9727206ad4cb4ad1737db857f865fb25027f5 | 4,940 | cpp | C++ | src/WinAPIWrap.cpp | MattRCole/win-core-audio | f79e6d337d48f4eb3ff790d97182bb1fac4a31e5 | [
"MIT"
] | 1 | 2019-10-18T12:26:08.000Z | 2019-10-18T12:26:08.000Z | src/WinAPIWrap.cpp | MattRCole/win-core-audio | f79e6d337d48f4eb3ff790d97182bb1fac4a31e5 | [
"MIT"
] | 3 | 2018-09-27T17:21:10.000Z | 2019-10-18T22:06:50.000Z | src/WinAPIWrap.cpp | MattRCole/win-core-audio | f79e6d337d48f4eb3ff790d97182bb1fac4a31e5 | [
"MIT"
] | 1 | 2019-10-18T12:28:33.000Z | 2019-10-18T12:28:33.000Z | #include "WinAPIWrap.h"
#include "common.h"
#include <string>
#include <sstream>
#include <mmdeviceapi.h>
#include <vector>
#include <functiondiscoverykeys_devpkey.h>
#include <endpointvolume.h>
#include <locale>
namespace WinAPIWrap
{
IMMDeviceEnumerator *InjectionFramework::pEnum = nullptr;
bool Injecti... | 24.577114 | 138 | 0.660729 | MattRCole |
d6012b667c1e58d08c410b03060955d71d08670d | 541 | cpp | C++ | projects/sentifer_mtbase/tests/main.cpp | Kyurenpoto/sentifer | 9a29e32db6a0faf810de7f26626f28d0ae787054 | [
"MIT"
] | 1 | 2020-06-04T04:07:16.000Z | 2020-06-04T04:07:16.000Z | projects/sentifer_mtbase/tests/main.cpp | Kyurenpoto/sentifer | 9a29e32db6a0faf810de7f26626f28d0ae787054 | [
"MIT"
] | null | null | null | projects/sentifer_mtbase/tests/main.cpp | Kyurenpoto/sentifer | 9a29e32db6a0faf810de7f26626f28d0ae787054 | [
"MIT"
] | null | null | null | #define DOCTEST_CONFIG_IMPLEMENT
#include "doctest/doctest.h"
#include "sentifer_mtbase/mtbase.h"
int main(int argc, char** argv) {
doctest::Context context;
context.setOption("abort-after", 5);
context.setOption("order-by", "file");
context.applyCommandLine(argc, argv);
context.setOption("no-b... | 20.037037 | 48 | 0.687616 | Kyurenpoto |
d604026e2083c58b03e1533b4115edfb12d23b04 | 2,315 | hpp | C++ | System/block_coustom_produce/cp.hpp | YS-THX/Hello-Linux | dc222abe4e961a65282d7bc8ac6a301657386ddc | [
"Apache-2.0"
] | 2 | 2020-09-27T07:18:54.000Z | 2020-11-25T01:49:33.000Z | System/block_coustom_produce/cp.hpp | Mr-Hunter/Linux | dc222abe4e961a65282d7bc8ac6a301657386ddc | [
"Apache-2.0"
] | null | null | null | System/block_coustom_produce/cp.hpp | Mr-Hunter/Linux | dc222abe4e961a65282d7bc8ac6a301657386ddc | [
"Apache-2.0"
] | null | null | null | #ifndef __CP_HPP__
#define __CP_HPP__
#include <iostream>
#include <queue>
#include <pthread.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
class BlockQueue{
private:
std::queue<int> bq;
int cap;
pthread_mutex_t lock;
pthread_cond_t cond_p;//queue em... | 21.238532 | 60 | 0.443197 | YS-THX |
d6048a1a59c60e0e7f313d6a6eeafcc979887ef8 | 3,261 | cpp | C++ | dataset/test/modification/1526_all/27/transformation_1.cpp | Karina5005/Plagiarism | ce11f72ba21a754ca84a27e5f26a31a19d6cb6fb | [
"MIT"
] | 3 | 2022-02-15T00:29:39.000Z | 2022-03-15T08:36:44.000Z | dataset/test/modification/1526_all/27/transformation_1.cpp | Kira5005-code/Plagiarism | ce11f72ba21a754ca84a27e5f26a31a19d6cb6fb | [
"MIT"
] | null | null | null | dataset/test/modification/1526_all/27/transformation_1.cpp | Kira5005-code/Plagiarism | ce11f72ba21a754ca84a27e5f26a31a19d6cb6fb | [
"MIT"
] | null | null | null | #include <iomanip>
#include <iostream>
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
... | 16.553299 | 101 | 0.508433 | Karina5005 |
d60579a4a96b2793857d57a9ef86954883adf759 | 527 | cpp | C++ | Luogu/P3817/P3817.cpp | AtomAlpaca/OI-Codes | 11f8dd4798616f1937d190e7220d7eedaeb75169 | [
"WTFPL"
] | 1 | 2021-11-12T14:19:53.000Z | 2021-11-12T14:19:53.000Z | Luogu/P3817/P3817.cpp | AtomAlpaca/OI-Codes | 11f8dd4798616f1937d190e7220d7eedaeb75169 | [
"WTFPL"
] | null | null | null | Luogu/P3817/P3817.cpp | AtomAlpaca/OI-Codes | 11f8dd4798616f1937d190e7220d7eedaeb75169 | [
"WTFPL"
] | null | null | null | #include <iostream>
using std::cout;
using std::cin;
int main()
{
int * n = new int;
long long x, ans = 0;
cin >> *n >> x;
long long nums[*n];
for (int i = 0; i < *n; ++i)
{
cin >> nums[i];
}
if (nums[0] > x)
{
ans += nums[0] - x;
nums[0] = x;
}
for (int i = 1; i < *n; ++i)
{
if (nums[i] + num... | 11.977273 | 36 | 0.428843 | AtomAlpaca |
d60b78f2faf57b301d4670e0de628060681db3d3 | 489 | cpp | C++ | Estrutura de Dados I/Linguagem C/Pilhas/pilhasParesImpares.cpp | lucaslopesx/unifenas-repo | 9d8ac538955e4c61af9c7036f8f14b2b5730fab3 | [
"MIT"
] | 1 | 2021-09-26T22:51:17.000Z | 2021-09-26T22:51:17.000Z | Estrutura de Dados I/Linguagem C/Pilhas/pilhasParesImpares.cpp | lucaslopesx/Unifenas-repo | 154223f380cb4d46c2071232386cf128694875fe | [
"MIT"
] | null | null | null | Estrutura de Dados I/Linguagem C/Pilhas/pilhasParesImpares.cpp | lucaslopesx/Unifenas-repo | 154223f380cb4d46c2071232386cf128694875fe | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include "pilha.h"
int main(void){
pilha pp,pi;
int n,x,i;
init(&pp);
init(&pi);
printf("Quantidade de numeros: ");
scanf("%d",&n);
for(i=0;i<n;i++){
printf("%d numero:",i+1);
scanf("%d",&x);
if(x % 2 == 0){
push(&pp,x);
}else{
push(&pi,x);
}
}
pr... | 10.630435 | 35 | 0.501022 | lucaslopesx |
d61609d322d95ea01cf674e18ca035f365f59e0d | 282 | cpp | C++ | vecTest.cpp | adlternative/algorithm-Brush | 0ad801ae519a0d1258faac364a8802e435397899 | [
"Apache-2.0"
] | null | null | null | vecTest.cpp | adlternative/algorithm-Brush | 0ad801ae519a0d1258faac364a8802e435397899 | [
"Apache-2.0"
] | null | null | null | vecTest.cpp | adlternative/algorithm-Brush | 0ad801ae519a0d1258faac364a8802e435397899 | [
"Apache-2.0"
] | null | null | null | //
// Created by adl on 2020/9/6.
//
#include<bits/stdc++.h>
using namespace std;
int main(int argc,char*argv[])
{
vector<int>v;
list<int>l{1,2,3};
v.insert(v.begin(),l.begin(),l.end());
for (const auto &item:v) {
cout << item<<endl;
}
return 0;
} | 15.666667 | 42 | 0.549645 | adlternative |
d6276f653a420d74c60402c0dea98aa9f64ddc0c | 737 | hpp | C++ | Source/compiler/parse_walker.hpp | longxdragon/Indicator | 5572534f99862ba20769a12635758beae0cdc118 | [
"MIT"
] | 10 | 2019-12-03T02:10:09.000Z | 2020-08-17T13:47:56.000Z | Source/compiler/parse_walker.hpp | longxdragon/Indicator | 5572534f99862ba20769a12635758beae0cdc118 | [
"MIT"
] | null | null | null | Source/compiler/parse_walker.hpp | longxdragon/Indicator | 5572534f99862ba20769a12635758beae0cdc118 | [
"MIT"
] | null | null | null | //
// parse_walker.hpp
// Indicator
//
// Created by 许龙 on 2019/12/26.
// Copyright © 2019 许龙. All rights reserved.
//
#ifndef parse_walker_hpp
#define parse_walker_hpp
#include <stdio.h>
#include <string>
#include <map>
#include "ast_node.hpp"
#include "common.hpp"
/** Just need 1. var check; 2. function param... | 19.918919 | 63 | 0.686567 | longxdragon |
d628d0578a84a4bb0ef7113831410b63dbef598e | 596 | cpp | C++ | Online-Judge-Solution/UVA Solutions/10550(Combination Lock).cpp | arifparvez14/Basic-and-competetive-programming | 4cb9ee7fbed3c70307d0f63499fcede86ed3c732 | [
"MIT"
] | null | null | null | Online-Judge-Solution/UVA Solutions/10550(Combination Lock).cpp | arifparvez14/Basic-and-competetive-programming | 4cb9ee7fbed3c70307d0f63499fcede86ed3c732 | [
"MIT"
] | null | null | null | Online-Judge-Solution/UVA Solutions/10550(Combination Lock).cpp | arifparvez14/Basic-and-competetive-programming | 4cb9ee7fbed3c70307d0f63499fcede86ed3c732 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int main()
{
long int a,b,c,d,ang,x,y,z;
while(cin>>a>>b>>c>>d)
{
if(a==0 && b==0 && c==0 && d==0)
break;
if(a<b)
x=(40+a)-b;
else if(a==b)
x=0;
else
x=a-b;
if(c<b)
... | 16.555556 | 40 | 0.318792 | arifparvez14 |
d63535436d7c709f6ba54ceb42b0bdf1b7bcae23 | 674 | cpp | C++ | UVA Solved Problem/11849 - CD/11849 - CD_binary_search.cpp | ahmed-dinar/UVA | 5cb43864744475ed7ac94e6cb6cae50ad80603c7 | [
"MIT"
] | null | null | null | UVA Solved Problem/11849 - CD/11849 - CD_binary_search.cpp | ahmed-dinar/UVA | 5cb43864744475ed7ac94e6cb6cae50ad80603c7 | [
"MIT"
] | null | null | null | UVA Solved Problem/11849 - CD/11849 - CD_binary_search.cpp | ahmed-dinar/UVA | 5cb43864744475ed7ac94e6cb6cae50ad80603c7 | [
"MIT"
] | null | null | null | #include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
int main()
{
long N,M,co,v;
while(scanf("%ld %ld",&N,&M)==2){
if(N==0&&M==0)
break;
vector<long>n;
vector<long>m;
for(int... | 19.257143 | 56 | 0.445104 | ahmed-dinar |
d6357021ca515cd18413a6487ae54dfab08e1976 | 18,462 | cpp | C++ | ds3/3_core/component/transfer/transfer_service_component.cpp | demonsaw/Code | b036d455e9e034d7fd178e63d5e992242d62989a | [
"MIT"
] | 132 | 2017-03-22T03:46:38.000Z | 2022-03-08T15:08:16.000Z | ds3/3_core/component/transfer/transfer_service_component.cpp | demonsaw/Code | b036d455e9e034d7fd178e63d5e992242d62989a | [
"MIT"
] | 4 | 2017-04-06T17:46:10.000Z | 2018-08-08T18:27:59.000Z | ds3/3_core/component/transfer/transfer_service_component.cpp | demonsaw/Code | b036d455e9e034d7fd178e63d5e992242d62989a | [
"MIT"
] | 30 | 2017-03-26T22:38:17.000Z | 2021-11-21T20:50:17.000Z | //
// The MIT License(MIT)
//
// Copyright(c) 2014 Demonsaw LLC
//
// 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, c... | 23.36962 | 157 | 0.645109 | demonsaw |
d63584b4827837197ad612b8c9bf0ef4b02be30c | 3,796 | cpp | C++ | trunk/suicore/src/Framework/Controls/HeaderedContentControl.cpp | redrains/MPFUI | f7511ecbd220fb5069cd13a16d0067b7aec6e684 | [
"MIT"
] | 2 | 2017-10-16T08:16:50.000Z | 2017-10-18T07:07:51.000Z | trunk/suicore/src/Framework/Controls/HeaderedContentControl.cpp | redrains/MPFUI | f7511ecbd220fb5069cd13a16d0067b7aec6e684 | [
"MIT"
] | null | null | null | trunk/suicore/src/Framework/Controls/HeaderedContentControl.cpp | redrains/MPFUI | f7511ecbd220fb5069cd13a16d0067b7aec6e684 | [
"MIT"
] | 4 | 2017-11-02T03:55:34.000Z | 2022-02-16T07:02:51.000Z |
#include <Framework/Controls/HeaderedContentControl.h>
#include <System/Tools/VisualTreeOp.h>
#include <System/Tools/LogicalTreeOp.h>
namespace suic
{
ImplementRTTIOfClass(HeaderedContentControl, ContentControl)
DpProperty* HeaderedContentControl::HasHeaderProperty;
DpProperty* HeaderedContentControl::HeaderProper... | 29.889764 | 144 | 0.716807 | redrains |
d636045c8b5723e42a04c8923ae3270b27f490a7 | 305 | cpp | C++ | Class-04/Problem-13(Method-1).cpp | Emrul-Hasan-Emon/Intermediate-Session-2021 | 188b82eb3f063a203186ebfb6b01acaa3ab12b02 | [
"MIT"
] | 2 | 2021-12-06T17:57:11.000Z | 2022-01-15T14:34:00.000Z | Class-04/Problem-13(Method-1).cpp | Emrul-Hasan-Emon/Intermediate-Session-2021 | 188b82eb3f063a203186ebfb6b01acaa3ab12b02 | [
"MIT"
] | null | null | null | Class-04/Problem-13(Method-1).cpp | Emrul-Hasan-Emon/Intermediate-Session-2021 | 188b82eb3f063a203186ebfb6b01acaa3ab12b02 | [
"MIT"
] | null | null | null | Find sum of divisors of a number. Time complexity of this solution will be O(n).
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, i, f=0, sum_divisor=0;
cin>>n;
for(i=1; i<=n; i++)
{
if(n%i==0)
sum_divisor+=i;
}
cout<<sum_divisor<<endl;
}
| 16.944444 | 80 | 0.554098 | Emrul-Hasan-Emon |
d638c21a45114b6b343b82082a9a9bb9b70782e1 | 1,852 | hpp | C++ | src/archive.hpp | Alreschas/serialization | 4fd02bc47f2929ca3e107786db9d1bc2568920e5 | [
"MIT"
] | null | null | null | src/archive.hpp | Alreschas/serialization | 4fd02bc47f2929ca3e107786db9d1bc2568920e5 | [
"MIT"
] | null | null | null | src/archive.hpp | Alreschas/serialization | 4fd02bc47f2929ca3e107786db9d1bc2568920e5 | [
"MIT"
] | null | null | null | #pragma once
#include "common.hpp"
#define ARCHIVE_NAMEDVALUE(value) createNamedValue(#value,value)
template<class T>
struct KeyedValue{
std::string key;
T &value;
};
template<class T>
KeyedValue<T> createNamedValue(std::string key,T& value){
return KeyedValue<T>{key,value};
}
template<class Format>
st... | 19.702128 | 71 | 0.569654 | Alreschas |
d642e35e5b8820ce9b29c380556ad64650894562 | 841 | cpp | C++ | test/misc/2-sat.test.cpp | emthrm/library | 0876ba7ec64e23b5ec476a7a0b4880d497a36be1 | [
"Unlicense"
] | 1 | 2021-12-26T14:17:29.000Z | 2021-12-26T14:17:29.000Z | test/misc/2-sat.test.cpp | emthrm/library | 0876ba7ec64e23b5ec476a7a0b4880d497a36be1 | [
"Unlicense"
] | 3 | 2020-07-13T06:23:02.000Z | 2022-02-16T08:54:26.000Z | test/misc/2-sat.test.cpp | emthrm/library | 0876ba7ec64e23b5ec476a7a0b4880d497a36be1 | [
"Unlicense"
] | null | null | null | /*
* @brief その他/2-SAT
*/
#define PROBLEM "https://judge.yosupo.jp/problem/two_sat"
#include <iostream>
#include <string>
#include <vector>
#include "../../misc/2-sat.hpp"
int main() {
std::string p, cnf;
int n, m;
std::cin >> p >> cnf >> n >> m;
TwoSat ts(n);
while (m--) {
int a, b, ze... | 20.02381 | 79 | 0.439952 | emthrm |
d647477d8c593f7272e5e5544d83b4a260a75086 | 980 | hpp | C++ | cpp-course/8_puzzle/board.hpp | Lascor22/ITMO-university | a252773ea1dea6179ba37403f38656be499640fc | [
"MIT"
] | null | null | null | cpp-course/8_puzzle/board.hpp | Lascor22/ITMO-university | a252773ea1dea6179ba37403f38656be499640fc | [
"MIT"
] | null | null | null | cpp-course/8_puzzle/board.hpp | Lascor22/ITMO-university | a252773ea1dea6179ba37403f38656be499640fc | [
"MIT"
] | 4 | 2021-02-19T01:08:57.000Z | 2021-11-21T14:41:53.000Z | #pragma once
#include <vector>
#include <iostream>
struct board {
board();
board(const board &other);
explicit board(unsigned size);
explicit board(std::vector <std::vector <unsigned>> const &data);
size_t size() const;
bool is_goal() const;
unsigned hamming() const;
unsigned ma... | 21.304348 | 73 | 0.656122 | Lascor22 |
d64e099eced941f03792ed1326ee49f9970a7cde | 11,395 | hpp | C++ | include/DataStructures/BinarySearchTree.hpp | asucato2/datastructures | 9867af2e44a9394a1f72f6161373f74837ea0633 | [
"MIT"
] | null | null | null | include/DataStructures/BinarySearchTree.hpp | asucato2/datastructures | 9867af2e44a9394a1f72f6161373f74837ea0633 | [
"MIT"
] | null | null | null | include/DataStructures/BinarySearchTree.hpp | asucato2/datastructures | 9867af2e44a9394a1f72f6161373f74837ea0633 | [
"MIT"
] | null | null | null | //
// Created by ansucato on 10/15/19.
//
#ifndef DATASTRUCTURES_BINARYSEARCHTREE_HPP
#define DATASTRUCTURES_BINARYSEARCHTREE_HPP
#include <iostream>
namespace DataStructures
{
template<typename keyType, typename valueType>
class BinarySearchTree
{
public:
BinarySearchTree();
BinarySearchTree(keyType... | 23.939076 | 137 | 0.629925 | asucato2 |
d64ec386322097a7b5154f7905a910beea07b659 | 2,532 | cpp | C++ | src/gamebase/src/impl/gameobj/InactiveObjectConstruct.cpp | TheMrButcher/opengl_lessons | 76ac96c45773a54a85d49c6994770b0c3496303f | [
"MIT"
] | 1 | 2016-10-25T21:15:16.000Z | 2016-10-25T21:15:16.000Z | src/gamebase/src/impl/gameobj/InactiveObjectConstruct.cpp | TheMrButcher/gamebase | 76ac96c45773a54a85d49c6994770b0c3496303f | [
"MIT"
] | 375 | 2016-06-04T11:27:40.000Z | 2019-04-14T17:11:09.000Z | src/gamebase/src/impl/gameobj/InactiveObjectConstruct.cpp | TheMrButcher/gamebase | 76ac96c45773a54a85d49c6994770b0c3496303f | [
"MIT"
] | null | null | null | /**
* Copyright (c) 2018 Slavnejshev Filipp
* This file is licensed under the terms of the MIT license.
*/
#include <stdafx.h>
#include <gamebase/impl/gameobj/InactiveObjectConstruct.h>
#include <gamebase/impl/gameview/ILayer.h>
#include <gamebase/impl/gameview/GameView.h>
#include <gamebase/impl/reg/PropertiesRegi... | 30.878049 | 112 | 0.723539 | TheMrButcher |
d6537f70cd8e613ded1b5fdb51aa3baf7e37a033 | 4,489 | cpp | C++ | src/cpThread.cpp | asc135/CodePort | 306d40d0a6d5ccb249b22249f2b3702ac09c021b | [
"BSD-3-Clause"
] | null | null | null | src/cpThread.cpp | asc135/CodePort | 306d40d0a6d5ccb249b22249f2b3702ac09c021b | [
"BSD-3-Clause"
] | null | null | null | src/cpThread.cpp | asc135/CodePort | 306d40d0a6d5ccb249b22249f2b3702ac09c021b | [
"BSD-3-Clause"
] | null | null | null | // ----------------------------------------------------------------------------
// CodePort++
//
// A Portable Operating System Abstraction Library
// Copyright 2013 Amardeep S. Chana. All rights reserved.
// Use of this software is bound by the terms of the Modified BSD License.
//
// Module Name: cpThread.cp... | 20.782407 | 95 | 0.57652 | asc135 |
d65a939269814b2e33852921aecaed85b72bfd71 | 147 | cc | C++ | cxx/dataforge/src/SimpleEnvelope.cc | Zelenyy/phd-code | d5b8bfefd2418a915dde89f7da2cb6683f438556 | [
"MIT"
] | null | null | null | cxx/dataforge/src/SimpleEnvelope.cc | Zelenyy/phd-code | d5b8bfefd2418a915dde89f7da2cb6683f438556 | [
"MIT"
] | null | null | null | cxx/dataforge/src/SimpleEnvelope.cc | Zelenyy/phd-code | d5b8bfefd2418a915dde89f7da2cb6683f438556 | [
"MIT"
] | null | null | null | //
// Created by zelenyy on 26.02.2020.
//
#include "SimpleEnvelope.hh"
SimpleEnvelope::SimpleEnvelope(Binary&data) {
this->binary = &data;
}
| 16.333333 | 45 | 0.687075 | Zelenyy |
d65cb66c271650c1af8b8274faec8124b9a023fe | 2,353 | cpp | C++ | Engine/Src/Resource/ResourceManager.cpp | dead1ock/monsoon | 0a61046ef84c71bd41349c7206a7e6f70d013a9f | [
"MIT"
] | 2 | 2015-01-09T19:19:40.000Z | 2015-12-09T02:52:31.000Z | Engine/Src/Resource/ResourceManager.cpp | dead1ock/monsoon | 0a61046ef84c71bd41349c7206a7e6f70d013a9f | [
"MIT"
] | null | null | null | Engine/Src/Resource/ResourceManager.cpp | dead1ock/monsoon | 0a61046ef84c71bd41349c7206a7e6f70d013a9f | [
"MIT"
] | null | null | null | /**
* Copyright (c) 2014-2016 Dallin Wellington
*
*/
#include "Resource/ResourceManager.h"
#include <fstream>
#include <sstream>
using namespace Monsoon;
using namespace Monsoon::Resource;
ResourceManager::ResourceManager()
: mNextResourceId(0)
{
nullResourceData.filename = "null";
nullResourceData.size = 0;
}
... | 20.111111 | 79 | 0.703357 | dead1ock |
d65dd5a33eef80f9826e4e5eb27279480375e789 | 624 | cpp | C++ | src/BestTimeToBuyAndSellStockWithCooldown.cpp | yanzhe-chen/LeetCode | d82f0b9721ea613ab216c78e7286671d0e9e4187 | [
"MIT"
] | 43 | 2015-10-10T12:59:52.000Z | 2018-07-11T18:07:00.000Z | src/BestTimeToBuyAndSellStockWithCooldown.cpp | yanzhe-chen/LeetCode | d82f0b9721ea613ab216c78e7286671d0e9e4187 | [
"MIT"
] | null | null | null | src/BestTimeToBuyAndSellStockWithCooldown.cpp | yanzhe-chen/LeetCode | d82f0b9721ea613ab216c78e7286671d0e9e4187 | [
"MIT"
] | 11 | 2015-10-10T14:41:11.000Z | 2018-07-28T06:03:16.000Z | #include "BestTimeToBuyAndSellStockWithCooldown.hpp"
int BestTimeToBuyAndSellStockWithCooldown::maxProfit(vector<int> &prices) {
size_t n = prices.size();
if (n <= 1) return 0;
vector<int> buy(n + 1, 0);
vector<int> sell(n + 1, 0);
buy[1] = -prices[0];
for (int i = 2; i <= n; i++) {
i... | 26 | 75 | 0.527244 | yanzhe-chen |
d6648e942d305837d3fb8b1b87a82367f0808504 | 1,838 | cc | C++ | policies/DIF/Routing/DomainRouting/rModule.cc | karlhto/RINA | 68fe850c7871d59fb882e06fa55432088d12cc51 | [
"MIT"
] | 30 | 2015-01-19T15:02:24.000Z | 2021-11-05T09:29:48.000Z | policies/DIF/Routing/DomainRouting/rModule.cc | karlhto/RINA | 68fe850c7871d59fb882e06fa55432088d12cc51 | [
"MIT"
] | 20 | 2015-01-14T16:22:03.000Z | 2020-10-14T14:17:06.000Z | policies/DIF/Routing/DomainRouting/rModule.cc | karlhto/RINA | 68fe850c7871d59fb882e06fa55432088d12cc51 | [
"MIT"
] | 13 | 2015-01-22T09:16:50.000Z | 2020-09-03T09:47:14.000Z | // The MIT License (MIT)
//
// Copyright (c) 2014-2016 Brno University of Technology, PRISTINE project
//
// 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 wit... | 39.106383 | 112 | 0.747552 | karlhto |
d669ec974f14fdf097acd4389e303925caac794b | 558 | hpp | C++ | src/pattern.hpp | clienthax/neptools | 90f3e1cc8cf388e7050b15c44fa51e330973fd53 | [
"WTFPL"
] | 1 | 2021-04-23T20:23:26.000Z | 2021-04-23T20:23:26.000Z | src/pattern.hpp | clienthax/neptools | 90f3e1cc8cf388e7050b15c44fa51e330973fd53 | [
"WTFPL"
] | null | null | null | src/pattern.hpp | clienthax/neptools | 90f3e1cc8cf388e7050b15c44fa51e330973fd53 | [
"WTFPL"
] | null | null | null | #ifndef UUID_741BE2A9_1F86_4DD5_A032_0D7D5CCBA762
#define UUID_741BE2A9_1F86_4DD5_A032_0D7D5CCBA762
#pragma once
#include "utils.hpp"
#include "except.hpp"
#include "nonowning_string.hpp"
namespace Neptools
{
struct Pattern
{
const Byte* pattern;
const Byte* mask;
size_t size;
const Byte* MaybeFind(... | 18.6 | 78 | 0.706093 | clienthax |
d66c86e99b563e28cb69802823d2de49a79c5226 | 861 | cpp | C++ | codeforces/C - Sanatorium/Accepted (2).cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | 1 | 2022-02-11T16:55:36.000Z | 2022-02-11T16:55:36.000Z | codeforces/C - Sanatorium/Accepted (2).cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | codeforces/C - Sanatorium/Accepted (2).cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | /****************************************************************************************
* @author: kzvd4729 created: Mar/18/2018 18:47
* solution_verdict: Accepted language: GNU C++17
* run... | 39.136364 | 111 | 0.370499 | kzvd4729 |
6990b2d5d472a299893c2c48cbd7fe787e899648 | 9,284 | cpp | C++ | TestApp/TestApp.cpp | erasoni/FolderConfig | 5aaa8aed557070898ec96febc2fdef50729bdb76 | [
"BSD-2-Clause"
] | 2 | 2019-01-19T16:35:45.000Z | 2021-08-14T04:25:51.000Z | TestApp/TestApp.cpp | ambiesoft/FolderConfig | 5aaa8aed557070898ec96febc2fdef50729bdb76 | [
"BSD-2-Clause"
] | null | null | null | TestApp/TestApp.cpp | ambiesoft/FolderConfig | 5aaa8aed557070898ec96febc2fdef50729bdb76 | [
"BSD-2-Clause"
] | null | null | null | // TestApp.cpp : main project file.
#include "stdafx.h"
#include "../../lsMisc/stdwin32/stdwin32.h"
#include "../../lsMisc/UTF16toUTF8.h"
#include "../../lsMisc/stdosd/stdosd.h"
using namespace System;
using namespace System::IO;
using namespace System::Reflection;
using namespace System::Diagnostics;
us... | 34.902256 | 135 | 0.699483 | erasoni |
6990ff7360608a086afa508f9cfa2bc69e862d17 | 1,110 | cpp | C++ | sort/merge_sort_e.cpp | xierensong/cppPGround | 35fe41eb53269357452c59a536c17edace3424da | [
"MIT"
] | null | null | null | sort/merge_sort_e.cpp | xierensong/cppPGround | 35fe41eb53269357452c59a536c17edace3424da | [
"MIT"
] | null | null | null | sort/merge_sort_e.cpp | xierensong/cppPGround | 35fe41eb53269357452c59a536c17edace3424da | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
void print(vector<int> nums1) {
for(auto num : nums1) {
cout << num << ' ';
}
cout << endl;
}
void merge(vector<int> nums1, vector<int> &nums2, int low, int pos, int high)
{
int i=low,j=pos+1;
int k=low;
while(i<=pos && j <= high) {
... | 19.473684 | 77 | 0.479279 | xierensong |
6994bf78c136721d40f4358f408d3b6386ffebc2 | 1,093 | cpp | C++ | src/client/Http_Client.cpp | Snackya/KH2-co-op-mix | d585c67743e7555d7aed789ed282a50024ef0e17 | [
"MIT"
] | 2 | 2021-07-03T17:38:39.000Z | 2021-09-11T21:10:55.000Z | src/client/Http_Client.cpp | Snackya/KH2-Co-op-Mix | d585c67743e7555d7aed789ed282a50024ef0e17 | [
"MIT"
] | 6 | 2021-09-12T02:15:06.000Z | 2021-09-13T03:58:21.000Z | src/client/Http_Client.cpp | Snackya/KH2-co-op-mix | d585c67743e7555d7aed789ed282a50024ef0e17 | [
"MIT"
] | null | null | null | #include "Http_Client.hpp"
void Http_Client::send_checks(std::map<uint16_t, uint8_t>& checks)
{
// for some reason keep_alive doesn't work only on sending,
// so we need to recreate the client here
delete cli;
cli = new httplib::Client(server_address.c_str());
std::string package = Utils::map_to_string(checks);
... | 26.658537 | 66 | 0.68527 | Snackya |
69978f476ed0307f3a3d33d5627b472ac3f3e756 | 926 | hpp | C++ | dsac/include/dsac/algorithm/detail/bubble_sort.hpp | dymons/algorithms | 7e45852f25c565df02bb2791f1dcae5b71aa5a94 | [
"MIT"
] | null | null | null | dsac/include/dsac/algorithm/detail/bubble_sort.hpp | dymons/algorithms | 7e45852f25c565df02bb2791f1dcae5b71aa5a94 | [
"MIT"
] | null | null | null | dsac/include/dsac/algorithm/detail/bubble_sort.hpp | dymons/algorithms | 7e45852f25c565df02bb2791f1dcae5b71aa5a94 | [
"MIT"
] | null | null | null | #pragma once
#include <algorithm>
namespace dsac::detail {
/*!
\brief
Bubble Sort is the simplest sorting algorithm that works by repeatedly
swapping the adjacent elements if they are in wrong order.
\param begin
Iterator to the initial position in the sequence
\param end
Itera... | 27.235294 | 78 | 0.658747 | dymons |
699f334c5f5260234459658c639c6fa009bc247a | 2,799 | cpp | C++ | TheBasic/GLTriangleQt.cpp | gongjianbo/OpenGLwithQtWidgets | 329a7a0ab64f605f6bbbf35708945f1ac1c621a9 | [
"MIT"
] | 9 | 2020-05-30T06:37:16.000Z | 2022-03-29T07:38:55.000Z | TheBasic/GLTriangleQt.cpp | gongjianbo/OpenGLwithQtWidgets | 329a7a0ab64f605f6bbbf35708945f1ac1c621a9 | [
"MIT"
] | null | null | null | TheBasic/GLTriangleQt.cpp | gongjianbo/OpenGLwithQtWidgets | 329a7a0ab64f605f6bbbf35708945f1ac1c621a9 | [
"MIT"
] | 3 | 2020-04-14T14:41:11.000Z | 2021-12-27T11:08:18.000Z | #include "GLTriangleQt.h"
GLTriangleQt::GLTriangleQt(QWidget *parent)
: QOpenGLWidget(parent)
{
}
GLTriangleQt::~GLTriangleQt()
{
//initializeGL在显示时才调用，释放未初始化的会异常
if(!isValid())
return;
//QOpenGLWidget
//三个虚函数不需要makeCurrent，对应的操作已由框架完成
//但是释放时需要设置当前上下文
makeCurrent();
vao.destr... | 26.158879 | 98 | 0.662379 | gongjianbo |
69a0a79cb009547a0c1abe8d4a30f2c9ffbd89c7 | 3,654 | cpp | C++ | Nagi/Source/Camera.cpp | nfginola/VkPlayground | b512117f47497d2c8f24b501e9fd3d8861504187 | [
"MIT"
] | 1 | 2022-01-09T05:30:29.000Z | 2022-01-09T05:30:29.000Z | Nagi/Source/Camera.cpp | nfginola/VkPlayground | b512117f47497d2c8f24b501e9fd3d8861504187 | [
"MIT"
] | null | null | null | Nagi/Source/Camera.cpp | nfginola/VkPlayground | b512117f47497d2c8f24b501e9fd3d8861504187 | [
"MIT"
] | null | null | null | #include "pch.h"
#include "Camera.h"
namespace Nagi
{
Camera::Camera(float aspectRatio, float fovInDegs, float nearPlane, float farPlane, float moveSpeed, const glm::vec3& initialPosition) :
m_frameMoveDir(glm::vec3(0.f)),
m_worldPosition(initialPosition),
m_localRight(s_worldRight),
m_localUp(s_worldUp),
m... | 25.914894 | 167 | 0.718938 | nfginola |
69ad8ea1bddbed267638c38fb4e2128c6fccf986 | 996 | hpp | C++ | app/gui/internal.hpp | ovese/filtermodel | 64f70b11627528d92c5ee62236b78b31b30b829f | [
"MIT"
] | null | null | null | app/gui/internal.hpp | ovese/filtermodel | 64f70b11627528d92c5ee62236b78b31b30b829f | [
"MIT"
] | null | null | null | app/gui/internal.hpp | ovese/filtermodel | 64f70b11627528d92c5ee62236b78b31b30b829f | [
"MIT"
] | null | null | null | // Copyright (c) 2020 INRA Distributed under the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef ORG_VLEPROJECT_IRRITATOR_APP_INTERNAL_2020
#define ORG_VLEPROJECT_IRRITATOR_APP_INTERNAL_2020
#include <irritator/core.hpp>
#incl... | 27.666667 | 78 | 0.738956 | ovese |
69b213c96651b728760eb0678b04421640d7de4d | 4,243 | cpp | C++ | src/unzip.cpp | toyobayashi/evm-windows | 5734cfe8555ccc492671e15bc30b54467681c749 | [
"MIT"
] | null | null | null | src/unzip.cpp | toyobayashi/evm-windows | 5734cfe8555ccc492671e15bc30b54467681c749 | [
"MIT"
] | null | null | null | src/unzip.cpp | toyobayashi/evm-windows | 5734cfe8555ccc492671e15bc30b54467681c749 | [
"MIT"
] | null | null | null | #include <zlib/unzip.h>
#include "util.h"
#include "path.hpp"
#include <time.h>
#define UNZ_BUFFER_SIZE 64 * 1024
static int last = -1;
bool Util::unzip(const std::wstring& zipFilePathW, const std::wstring& outDirW, Util::unzCallback callback, void* param) {
unzFile unzfile = unzOpen(Util::w2a(zipFilePathW, CP_ACP... | 27.198718 | 122 | 0.589206 | toyobayashi |
69bacd059e4d053e87c1cfa44015b8dc90595f85 | 410 | cpp | C++ | MyThirthyHomeWork/func.1/func.1.cpp | pashak14/CppHomeWork | 861bf1241800f2c6a0fb782738554d617de89599 | [
"MIT"
] | null | null | null | MyThirthyHomeWork/func.1/func.1.cpp | pashak14/CppHomeWork | 861bf1241800f2c6a0fb782738554d617de89599 | [
"MIT"
] | null | null | null | MyThirthyHomeWork/func.1/func.1.cpp | pashak14/CppHomeWork | 861bf1241800f2c6a0fb782738554d617de89599 | [
"MIT"
] | 1 | 2020-12-14T11:52:04.000Z | 2020-12-14T11:52:04.000Z |
#include <iostream>
using namespace std;
void sys( int digit, int syst ) {
int i, j, arr[50];
for (i = 0; digit > 0; i++) {
arr[i] = digit % syst;
digit /= syst;
}
for (j = i - 1; j >= 0; j--) {
if (arr[j] < 10) {
cout << arr[j];
}
else {
... | 15.769231 | 46 | 0.380488 | pashak14 |
69bb12e2cf69f97fa2eb8bba367c0215bebdf6b4 | 3,042 | cpp | C++ | source/mat4x4.cpp | ZY4N-Corporation/ChunkModifier | dfe4f615abadadbc714995fd7f1afc01108576f9 | [
"Apache-2.0"
] | 75 | 2021-05-25T22:01:45.000Z | 2022-03-08T22:01:41.000Z | source/mat4x4.cpp | ZY4N/ChunkModifier | dfe4f615abadadbc714995fd7f1afc01108576f9 | [
"Apache-2.0"
] | null | null | null | source/mat4x4.cpp | ZY4N/ChunkModifier | dfe4f615abadadbc714995fd7f1afc01108576f9 | [
"Apache-2.0"
] | null | null | null | #include <mat4x4.hpp>
mat4x4::mat4x4(float* _numbers){
memcpy(numbers, _numbers, len * sizeof(float));
}
mat4x4 mat4x4::fromXAngle(const float angle) {
float numbers[]{
1, 0 , 0 , 0,
0, cos(angle),-sin(angle), 0,
0, sin(angle), cos(angle), 0,
0, 0 , 0 ... | 27.405405 | 92 | 0.490467 | ZY4N-Corporation |
69bfb6e32c5ebc83bd69f1bc3f0542faf16ca092 | 2,870 | cpp | C++ | src/tests/test_tokenizer.cpp | Anish1234567/JiaoBenScript | 6d94e8f1dfce0911a34b605e057ab6fd77233204 | [
"MIT"
] | 5 | 2017-06-21T20:30:56.000Z | 2020-02-05T08:49:09.000Z | src/tests/test_tokenizer.cpp | Anish1234567/JiaoBenScript | 6d94e8f1dfce0911a34b605e057ab6fd77233204 | [
"MIT"
] | null | null | null | src/tests/test_tokenizer.cpp | Anish1234567/JiaoBenScript | 6d94e8f1dfce0911a34b605e057ab6fd77233204 | [
"MIT"
] | 3 | 2019-09-21T01:40:18.000Z | 2020-03-31T18:44:56.000Z | #include <vector>
#include "catch.hpp"
#include "../tokenizer.h"
TEST_CASE("Test tokencode_to_string") {
CHECK(tokencode_to_string(TokenCode::STRING) == "STR");
CHECK(tokencode_to_string(TokenCode::GREATEQ) == ">=");
}
std::vector<Token::Ptr> get_tokens(const std::string &input) {
Tokenizer tokenizer;
... | 24.956522 | 83 | 0.564808 | Anish1234567 |
69c39364b2ce3e2ed8d7843712962451420f1cec | 263 | cpp | C++ | CsPlatformServices/Source/CsPlatformServices/Public/Utility/CsPlatformServicesLog.cpp | closedsum/core | c3cae44a177b9684585043a275130f9c7b67fef0 | [
"Unlicense"
] | 2 | 2019-03-17T10:43:53.000Z | 2021-04-20T21:24:19.000Z | CsPlatformServices/Source/CsPlatformServices/Public/Utility/CsPlatformServicesLog.cpp | closedsum/core | c3cae44a177b9684585043a275130f9c7b67fef0 | [
"Unlicense"
] | null | null | null | CsPlatformServices/Source/CsPlatformServices/Public/Utility/CsPlatformServicesLog.cpp | closedsum/core | c3cae44a177b9684585043a275130f9c7b67fef0 | [
"Unlicense"
] | null | null | null | // Copyright 2017-2021 Closed Sum Games, LLC. All Rights Reserved.
#include "Utility/CsPlatformServicesLog.h"
#include "CsPlatformServices.h"
void FCsPlatformServicesLog::Warning(const FString& Str)
{
UE_LOG(LogCsPlatformServices, Warning, TEXT("%s"), *Str);
}
| 29.222222 | 66 | 0.771863 | closedsum |
69d3ca7df3ba35779d70c87f65b86cbf4d8f5de1 | 583 | cc | C++ | src/autometal/operators/Operator.cc | homer6/autometal | ea90dc97ee982216b34ef8d00d774254074eb9ee | [
"MIT"
] | null | null | null | src/autometal/operators/Operator.cc | homer6/autometal | ea90dc97ee982216b34ef8d00d774254074eb9ee | [
"MIT"
] | null | null | null | src/autometal/operators/Operator.cc | homer6/autometal | ea90dc97ee982216b34ef8d00d774254074eb9ee | [
"MIT"
] | null | null | null | #include "autometal/operators/Operator.h"
#include "autometal/platforms/Platform.h"
using autometal::platforms::Platform;
using autometal::platforms::Command;
using autometal::platforms::CommandResult;
namespace autometal{
namespace operators{
Platform* Operator::getPlatform(){
if( this->platfo... | 13.880952 | 48 | 0.643225 | homer6 |
69d54588543d28cd581829b4fa0709f5883e32fb | 372 | cpp | C++ | C++/5_length-stirng.cpp | rabeeh-ta/Kerala-Syllabus-CS-practicals | 272c59f395d5f57717e51751ba2530ab780f149a | [
"MIT"
] | 3 | 2020-04-04T11:11:46.000Z | 2021-06-24T16:14:25.000Z | C++/5_length-stirng.cpp | Sameerabdulla/Kerala-Syllabus-CS-practicals | 272c59f395d5f57717e51751ba2530ab780f149a | [
"MIT"
] | null | null | null | C++/5_length-stirng.cpp | Sameerabdulla/Kerala-Syllabus-CS-practicals | 272c59f395d5f57717e51751ba2530ab780f149a | [
"MIT"
] | 2 | 2020-04-04T11:11:56.000Z | 2020-11-08T07:24:07.000Z | /*
Q. Find the length of the string without using strlen() function.
*/
#include <iostream>
using namespace std;
int main()
{
char name[100];
int count = 0;
cout << "Enter the string to be counted. \n";
cin.getline(name, 100);
while (name[count] != '\0')
{
count++;
}
c... | 15.5 | 69 | 0.545699 | rabeeh-ta |
69d55d8c40c39116212c8feda655548abcfb7c9c | 235 | hpp | C++ | include/IModule.hpp | hypergig/Waybar | 3945c7766891148c339a77118b7c1dbe709af407 | [
"MIT"
] | 2,432 | 2018-08-08T22:37:39.000Z | 2022-03-31T13:12:43.000Z | include/IModule.hpp | hypergig/Waybar | 3945c7766891148c339a77118b7c1dbe709af407 | [
"MIT"
] | 1,381 | 2018-08-09T19:40:32.000Z | 2022-03-31T16:58:08.000Z | include/IModule.hpp | hypergig/Waybar | 3945c7766891148c339a77118b7c1dbe709af407 | [
"MIT"
] | 450 | 2018-08-09T12:03:00.000Z | 2022-03-29T21:19:13.000Z | #pragma once
#include <gtkmm/widget.h>
namespace waybar {
class IModule {
public:
virtual ~IModule() = default;
virtual auto update() -> void = 0;
virtual operator Gtk::Widget &() = 0;
};
} // namespace waybar
| 15.666667 | 48 | 0.617021 | hypergig |
69d5fd901215c9acdea2134e6972a896d8621e9f | 845 | hpp | C++ | src/mir/main_bindings.hpp | bjorn3/mrustc | 01f73e7894119405ab3f92b6191f044e491c9062 | [
"MIT"
] | 1,706 | 2015-01-18T11:01:10.000Z | 2022-03-31T00:31:54.000Z | src/mir/main_bindings.hpp | bjorn3/mrustc | 01f73e7894119405ab3f92b6191f044e491c9062 | [
"MIT"
] | 215 | 2015-03-26T10:31:36.000Z | 2022-03-13T02:04:13.000Z | src/mir/main_bindings.hpp | bjorn3/mrustc | 01f73e7894119405ab3f92b6191f044e491c9062 | [
"MIT"
] | 114 | 2015-03-26T10:29:02.000Z | 2022-03-21T20:59:37.000Z | /*
* MRustC - Rust Compiler
* - By John Hodge (Mutabah/thePowersGang)
*
* mir/main_bindings.hpp
* - main.cpp binding
*/
#pragma once
#include <iostream>
#include <hir/hir.hpp>
class TransList;
extern void HIR_GenerateMIR(::HIR::Crate& crate);
extern void MIR_Dump(::std::ostream& sink, const ::HIR::Crate& crate)... | 35.208333 | 182 | 0.731361 | bjorn3 |
69db87bef37fc441e7a298890c3c1c0be63c52b4 | 70 | cpp | C++ | main.cpp | bruce1114/class | 9096dbd2a76d00e96f519ae230fdd8d2a651c476 | [
"MIT"
] | null | null | null | main.cpp | bruce1114/class | 9096dbd2a76d00e96f519ae230fdd8d2a651c476 | [
"MIT"
] | null | null | null | main.cpp | bruce1114/class | 9096dbd2a76d00e96f519ae230fdd8d2a651c476 | [
"MIT"
] | null | null | null | #include"helloclass.h"
int main()
{
HelloClass h;
h.sayhello();
}
| 10 | 22 | 0.642857 | bruce1114 |
69dba336f0e64fab9c95ebb35f9d8ceb98fd6448 | 8,647 | cpp | C++ | unittests/unittest_objects_vector3.cpp | ShmFw/shmfw | d386841f8b1425cbeca8c8a3fc6919bf8d83c38e | [
"BSD-3-Clause"
] | 1 | 2016-02-06T14:57:32.000Z | 2016-02-06T14:57:32.000Z | unittests/unittest_objects_vector3.cpp | ShmFw/shmfw | d386841f8b1425cbeca8c8a3fc6919bf8d83c38e | [
"BSD-3-Clause"
] | null | null | null | unittests/unittest_objects_vector3.cpp | ShmFw/shmfw | d386841f8b1425cbeca8c8a3fc6919bf8d83c38e | [
"BSD-3-Clause"
] | 1 | 2018-11-07T02:45:24.000Z | 2018-11-07T02:45:24.000Z |
#include "unittest_objects.h"
namespace ShmFwTest{
TEST_F ( ObjectTest, serializeToStringVector3 ) {
ShmFw::Vector3<> var1, var2;
var1.rand ( -10, 10 );
std::string str = var1.human_readable();
var2.human_readable(str);
//std::cout << "var1: " << var1 << ", var2: " << var2 << std::endl;
EXPECT... | 44.117347 | 107 | 0.569562 | ShmFw |
69dd3c02d83acada99d0b7ccc103073f2cb461e7 | 10,076 | cpp | C++ | 1_Reformat/reformat.cpp | billkarsh/Alignment_Projects | f2ce48477da866b09a13fd33f1a53a8af644b35b | [
"BSD-3-Clause"
] | 11 | 2015-07-24T14:41:25.000Z | 2022-03-19T13:27:51.000Z | 1_Reformat/reformat.cpp | billkarsh/Alignment_Projects | f2ce48477da866b09a13fd33f1a53a8af644b35b | [
"BSD-3-Clause"
] | 1 | 2016-05-14T22:26:25.000Z | 2016-05-14T22:26:25.000Z | 1_Reformat/reformat.cpp | billkarsh/Alignment_Projects | f2ce48477da866b09a13fd33f1a53a8af644b35b | [
"BSD-3-Clause"
] | 18 | 2015-03-10T18:45:58.000Z | 2021-08-16T13:56:48.000Z | //
// Reformat either:
// {-x=xml file, -r=Rick file, -d-idb}.
//
// New xml files have 'title' attributes like this:
// "z.id-rgn", or,
// "z.id-rgn_col.row.cam" (if data present).
//
// New Rick files have lines like this:
// "z id 6_aff_val_by_row -999 -999 -999 path", or,
// "z id 6_aff_val_by_row col row cam path"... | 24.338164 | 75 | 0.353811 | billkarsh |
69e2daf24dad52b751b151bd087301b96a90085d | 1,167 | cpp | C++ | src/client/BidirectionalUdpConnection.cpp | oakdoor/enterprisediodefiletransfer | 64cf04f47fd48fa4723b022968babdd8d62702d3 | [
"MIT"
] | 1 | 2021-05-27T09:53:20.000Z | 2021-05-27T09:53:20.000Z | src/client/BidirectionalUdpConnection.cpp | oakdoor/enterprisediodefiletransfer | 64cf04f47fd48fa4723b022968babdd8d62702d3 | [
"MIT"
] | null | null | null | src/client/BidirectionalUdpConnection.cpp | oakdoor/enterprisediodefiletransfer | 64cf04f47fd48fa4723b022968babdd8d62702d3 | [
"MIT"
] | 1 | 2021-09-16T14:12:27.000Z | 2021-09-16T14:12:27.000Z | // Copyright PA Knowledge Ltd 2021
// MIT License. For licence terms see LICENCE.md file.
#include "BidirectionalUdpConnection.hpp"
#include "UdpClient.hpp"
#include "enterprisediode/EnterpriseDiodeHeader.hpp"
using namespace boost::asio::ip;
BidirectionalUdpConnection::BidirectionalUdpConnection(const std::string& ... | 36.46875 | 197 | 0.771208 | oakdoor |
69e39c6ddfa4bc08601711aa562db621058bf126 | 170 | cpp | C++ | src/util.cpp | andersfylling/sorting-nine-inputs-requires-twenty-five-comparisons | b7a89507aa81387c384293c2d1a1d06505226b14 | [
"MIT"
] | 8 | 2020-04-27T20:08:56.000Z | 2021-04-10T17:00:14.000Z | src/util.cpp | andersfylling/sorting-nine-inputs-requires-twenty-five-comparisons | b7a89507aa81387c384293c2d1a1d06505226b14 | [
"MIT"
] | null | null | null | src/util.cpp | andersfylling/sorting-nine-inputs-requires-twenty-five-comparisons | b7a89507aa81387c384293c2d1a1d06505226b14 | [
"MIT"
] | null | null | null | #include <sortnet/util.h>
namespace sortnet {
double FloatPrecision(double v, double p) { return (floor((v * pow(10, p) + 0.5)) / pow(10, p)); }
} // namespace sortnet | 28.333333 | 98 | 0.652941 | andersfylling |
69e4aca2ae35b48fb688097ace6ed36325d2ef8a | 486 | cc | C++ | code/render/coregraphics/bufferlock.cc | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 67 | 2015-03-30T19:56:16.000Z | 2022-03-11T13:52:17.000Z | code/render/coregraphics/bufferlock.cc | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 5 | 2015-04-15T17:17:33.000Z | 2016-02-11T00:40:17.000Z | code/render/coregraphics/bufferlock.cc | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 34 | 2015-03-30T15:08:00.000Z | 2021-09-23T05:55:10.000Z | //------------------------------------------------------------------------------
// bufferlock.cc
// (C) 2012-2016 Individual contributors, see AUTHORS file
//------------------------------------------------------------------------------
#include "stdneb.h"
#include "coregraphics/bufferlock.h"
#if __OGL4__
namespace ... | 34.714286 | 80 | 0.518519 | gscept |
69ea764a7fb3a8d83c38862b8643118e5e5fa9f2 | 13,038 | cpp | C++ | ffscript/ScriptScopeParser.cpp | VincentPT/xscript | cea6ee9e8c5af87af75188695ffa89080dce49b8 | [
"MIT"
] | null | null | null | ffscript/ScriptScopeParser.cpp | VincentPT/xscript | cea6ee9e8c5af87af75188695ffa89080dce49b8 | [
"MIT"
] | null | null | null | ffscript/ScriptScopeParser.cpp | VincentPT/xscript | cea6ee9e8c5af87af75188695ffa89080dce49b8 | [
"MIT"
] | 1 | 2019-12-24T22:24:01.000Z | 2019-12-24T22:24:01.000Z | /******************************************************************
* File: ScriptScopeParser.cpp
* Description: implement a part of ScriptScope class.
* the parsing script part.
* Author: Vincent Pham
*
* Copyright (c) 2018 VincentPT.
** Distributed under the MIT License (http://opensource.org... | 35.048387 | 157 | 0.716061 | VincentPT |
69eb41a6bd5f47bd1e3d0dc7157f2a5f76ff97ad | 2,702 | cpp | C++ | WPTelnetDLib/FileHelpers.cpp | FurballTheGreat/WPTelnetD | 8050a417a0c0e389ce687cdae1040207d28bef46 | [
"MIT"
] | 5 | 2015-10-28T14:48:47.000Z | 2021-05-12T06:20:16.000Z | WPTelnetDLib/FileHelpers.cpp | FurballTheGreat/WPTelnetD | 8050a417a0c0e389ce687cdae1040207d28bef46 | [
"MIT"
] | null | null | null | WPTelnetDLib/FileHelpers.cpp | FurballTheGreat/WPTelnetD | 8050a417a0c0e389ce687cdae1040207d28bef46 | [
"MIT"
] | 3 | 2015-02-13T18:17:10.000Z | 2015-09-30T08:57:00.000Z | #include "pch.h"
#include "FileHelpers.h"
#include<string>
bool FileExists(std::string pFileName)
{
WIN32_FIND_DATAA findFileData;
HANDLE handle = FindFirstFileA(pFileName.c_str(), &findFileData);
bool found = handle != INVALID_HANDLE_VALUE;
if (found)
FindClose(handle);
return found;
}
std::string GetCurrentD... | 18.895105 | 105 | 0.661362 | FurballTheGreat |
69ec011b4e21febb3dbd606a16f1c200809cc566 | 3,334 | cpp | C++ | src/io/MathematicaTrajPrinter.cpp | takafumihoriuchi/HyLaGI | 26b9f32a84611ee62d9cbbd903773d224088c959 | [
"BSL-1.0"
] | 1 | 2019-03-15T07:11:09.000Z | 2019-03-15T07:11:09.000Z | src/io/MathematicaTrajPrinter.cpp | takafumihoriuchi/HyLaGI | 26b9f32a84611ee62d9cbbd903773d224088c959 | [
"BSL-1.0"
] | null | null | null | src/io/MathematicaTrajPrinter.cpp | takafumihoriuchi/HyLaGI | 26b9f32a84611ee62d9cbbd903773d224088c959 | [
"BSL-1.0"
] | null | null | null | #include "MathematicaTrajPrinter.h"
#include <stack>
using namespace std;
using namespace hydla::simulator;
namespace hydla {
namespace io {
/*
void MathematicaPrinter::output_result_tree(const phase_result_const_sptr_t& result_root) const
{
if (result_root->children.size() == 0)
{
std::cout << "No Result." ... | 28.254237 | 165 | 0.556989 | takafumihoriuchi |
69ee58f026af91417a0881a4b8c5504d73600cc8 | 3,208 | cpp | C++ | UnicornHatReporter/UnicornHatReporter.cpp | SeanCline/build-indicator | fa329c03c5ff3ccf94ef45fdbcdc024293bfb9ef | [
"MIT"
] | 6 | 2015-04-05T09:54:55.000Z | 2017-07-29T14:26:09.000Z | UnicornHatReporter/UnicornHatReporter.cpp | SeanCline/build-indicator | fa329c03c5ff3ccf94ef45fdbcdc024293bfb9ef | [
"MIT"
] | 1 | 2017-11-07T15:01:13.000Z | 2017-11-08T12:33:10.000Z | UnicornHatReporter/UnicornHatReporter.cpp | SeanCline/build-indicator | fa329c03c5ff3ccf94ef45fdbcdc024293bfb9ef | [
"MIT"
] | null | null | null | #include "UnicornHatReporter.h"
#include "BuildStatusReporter.h"
#include "BuildStatus.h"
#include "AsyncAnimationPlayer.h"
#include <Gif.h>
#include <boost/program_options.hpp>
#include <memory>
#include <iostream>
#include <chrono>
using namespace std;
using namespace std::chrono;
using namespace boost::program_o... | 34.869565 | 170 | 0.739401 | SeanCline |
69f1ff6793bf8f5c55755502e58a510d9c35d49d | 787 | cpp | C++ | Components/VclZip.pro.v3.10.1/VCLZipBCB4_3.cpp | 98kmir2/98kmir2 | 46196a161d46cc7a85d168dca683b4aff477a709 | [
"BSD-3-Clause"
] | 15 | 2020-02-13T11:59:11.000Z | 2021-12-31T14:53:44.000Z | Components/VclZip.pro.v3.10.1/VCLZipBCB4_3.cpp | bsjzx8/98 | 46196a161d46cc7a85d168dca683b4aff477a709 | [
"BSD-3-Clause"
] | null | null | null | Components/VclZip.pro.v3.10.1/VCLZipBCB4_3.cpp | bsjzx8/98 | 46196a161d46cc7a85d168dca683b4aff477a709 | [
"BSD-3-Clause"
] | 13 | 2020-02-20T07:22:09.000Z | 2021-12-31T14:56:09.000Z | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
USERES("VCLZipBCB4_3.res");
USEPACKAGE("vcl40.bpi");
USEUNIT("kpSFXCfg.pas");
USERES("kpSFXCfg.dcr");
USEUNIT("VCLUnZip.pas");
USERES("VCLUnZip.dcr");
USEUNIT("VCLZip.pas");
USERES("VCLZip.dcr");
USEPACKAGE("v... | 34.217391 | 77 | 0.360864 | 98kmir2 |
69f35ca341f4c83a2deceaf4b54094c7d3ba3f94 | 1,446 | cpp | C++ | cpp/1001-10000/1181-1190/Make Array Strictly Increasing.cpp | KaiyuWei/leetcode | fd61f5df60cfc7086f7e85774704bacacb4aaa5c | [
"MIT"
] | 150 | 2015-04-04T06:53:49.000Z | 2022-03-21T13:32:08.000Z | cpp/1001-10000/1181-1190/Make Array Strictly Increasing.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 1 | 2015-04-13T15:15:40.000Z | 2015-04-21T20:23:16.000Z | cpp/1001-10000/1181-1190/Make Array Strictly Increasing.cpp | yizhu1012/leetcode | d6fa443a8517956f1fcc149c8c4f42c0ad93a4a7 | [
"MIT"
] | 64 | 2015-06-30T08:00:07.000Z | 2022-01-01T16:44:14.000Z | class Solution {
map<pair<int, int>, int> cache;
public:
int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
sort(arr2.begin(), arr2.end());
int val= dfs(arr1, arr2, 0, -1);
if(val>=2000)
return -1;
else
return val;
}
int dfs(vecto... | 32.133333 | 90 | 0.456432 | KaiyuWei |
69f467eb8ebe75059442430fb274a39474ca5991 | 850 | cpp | C++ | src/util/timestamp.cpp | fcten/xscrip | 3bad5fa410191bc0577d489c1465c5a680e8e82d | [
"BSD-3-Clause"
] | 6 | 2018-11-01T20:00:55.000Z | 2021-11-08T09:22:07.000Z | src/util/timestamp.cpp | fcten/xscrip | 3bad5fa410191bc0577d489c1465c5a680e8e82d | [
"BSD-3-Clause"
] | null | null | null | src/util/timestamp.cpp | fcten/xscrip | 3bad5fa410191bc0577d489c1465c5a680e8e82d | [
"BSD-3-Clause"
] | 1 | 2019-07-22T10:04:10.000Z | 2019-07-22T10:04:10.000Z | #include "timestamp.hpp"
namespace xscript::util {
timestamp::timestamp() :
d(std::chrono::system_clock::now().time_since_epoch())
{
}
// 转为秒级时间戳
std::time_t timestamp::seconds() {
std::chrono::seconds ts = std::chrono::duration_cast<std::chrono::seconds>(d);
return ts.count();
}
// 转为毫秒级时间戳
std::time_... | 21.794872 | 92 | 0.672941 | fcten |
69f81651ef48b0c435e9a51b37c95c8ca332a8f1 | 673 | cpp | C++ | ExportEngine/UserInterface.cpp | SonicYeager/CppPractice | 05b80ac918648ba733ec5fce969eac4b2ae79b58 | [
"MIT"
] | null | null | null | ExportEngine/UserInterface.cpp | SonicYeager/CppPractice | 05b80ac918648ba733ec5fce969eac4b2ae79b58 | [
"MIT"
] | 9 | 2020-10-26T10:14:46.000Z | 2020-10-27T12:13:51.000Z | ExportEngine/UserInterface.cpp | SonicYeager/CppPractice | 05b80ac918648ba733ec5fce969eac4b2ae79b58 | [
"MIT"
] | null | null | null | #include "UserInterface.h"
#include <string>
class UserInterface : public IUserInterface
{
public:
bool OpenProgress(const char* pHeader, __int64 maxProgress) override
{
if(pHeader == nullptr)
return false;
m_header = pHeader;
m_progress = 0;
return true;
}
void SetProgress(__int64 pro... | 16.02381 | 70 | 0.668648 | SonicYeager |
69fc7492f5757ca4eeef81d6cb9ca7b3e899364b | 3,374 | cpp | C++ | darkroom/src/gazebo/LighthouseVisualPlugin.cpp | mattgil23/test01 | 9464e40caf483eae60fa9c0b490ce8f09e552a53 | [
"BSD-3-Clause"
] | null | null | null | darkroom/src/gazebo/LighthouseVisualPlugin.cpp | mattgil23/test01 | 9464e40caf483eae60fa9c0b490ce8f09e552a53 | [
"BSD-3-Clause"
] | null | null | null | darkroom/src/gazebo/LighthouseVisualPlugin.cpp | mattgil23/test01 | 9464e40caf483eae60fa9c0b490ce8f09e552a53 | [
"BSD-3-Clause"
] | null | null | null | #include "darkroom/gazebo/LighthouseVisualPlugin.hpp"
namespace gazebo
{
namespace rendering
{
int LighthouseVisualPlugin::instance_counter = 1;
////////////////////////////////////////////////////////////////////////////////
// Constructor
LighthouseVisualPlugin::LighthouseV... | 35.893617 | 133 | 0.499704 | mattgil23 |
69fe25cc2370be3d2f074e01b36c1d0da88c5cc6 | 1,178 | cpp | C++ | Topology_API/ComponentClass.cpp | AhmedLotfy02/Topology_API | e1fd793368a90dce2446295eef93a504c7ec3607 | [
"MIT"
] | 1 | 2021-12-31T18:14:53.000Z | 2021-12-31T18:14:53.000Z | Topology_API/ComponentClass.cpp | AhmedLotfy02/Topology_API | e1fd793368a90dce2446295eef93a504c7ec3607 | [
"MIT"
] | null | null | null | Topology_API/ComponentClass.cpp | AhmedLotfy02/Topology_API | e1fd793368a90dce2446295eef93a504c7ec3607 | [
"MIT"
] | null | null | null | #include "ComponentClass.h"
ComponentClass::ComponentClass(string typ, string id, DeviceClass *d, unordered_map<string, string> netlist)
{
this->set_Device(d);
this->set_id(id);
this->set_type(typ);
this->set_netList(netlist);
}
ComponentClass::ComponentClass()
{
}
void ComponentClass::set_type(string type)
{
... | 16.591549 | 108 | 0.667233 | AhmedLotfy02 |
69ff3435eef118a6de0bbfa519aae45eaa311b08 | 2,434 | cpp | C++ | Code/UT_Range.cpp | apoapse/ApoapseProtocol | 5b3132600d12c4378489ae9ecd3fa86fe67a40f1 | [
"Apache-2.0"
] | null | null | null | Code/UT_Range.cpp | apoapse/ApoapseProtocol | 5b3132600d12c4378489ae9ecd3fa86fe67a40f1 | [
"Apache-2.0"
] | null | null | null | Code/UT_Range.cpp | apoapse/ApoapseProtocol | 5b3132600d12c4378489ae9ecd3fa86fe67a40f1 | [
"Apache-2.0"
] | null | null | null | // ----------------------------------------------------------------------------
// Copyright (C) 2020 Apoapse
// Copyright (C) 2020 Guillaume Puyal
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the Li... | 23.403846 | 85 | 0.652835 | apoapse |
69ffa7cc4232ecdb70124bd0d756e5b482477b96 | 642 | cpp | C++ | example/main.cpp | ReneMuala/lanconv | 210b118129e1576a85ab9b9870fd026a8eaf4580 | [
"MIT"
] | null | null | null | example/main.cpp | ReneMuala/lanconv | 210b118129e1576a85ab9b9870fd026a8eaf4580 | [
"MIT"
] | null | null | null | example/main.cpp | ReneMuala/lanconv | 210b118129e1576a85ab9b9870fd026a8eaf4580 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include "../source/lanconv.hpp"
int main(){
std::string num_str = "73";
int num_int = lan::to_int(num_str);
float num_float = lan::to_float(num_str) + 0.5;
double num_double = lan::to_double(num_str) + 0.5555;
long num_long = lan::to_long(num_str);
long long num_llong = lan... | 29.181818 | 54 | 0.626168 | ReneMuala |
0e062e433b2efbf924ef4bd21e94e8bee468fba0 | 409 | cpp | C++ | test/NSymmetry_Test.cpp | katherlee/EDLib | 9ce44caedc73755e522feabf8167ecc440c08a1e | [
"MIT"
] | 22 | 2017-01-04T02:04:20.000Z | 2022-01-24T05:18:54.000Z | test/NSymmetry_Test.cpp | katherlee/EDLib | 9ce44caedc73755e522feabf8167ecc440c08a1e | [
"MIT"
] | 4 | 2017-03-02T19:19:04.000Z | 2020-05-13T02:26:07.000Z | test/NSymmetry_Test.cpp | katherlee/EDLib | 9ce44caedc73755e522feabf8167ecc440c08a1e | [
"MIT"
] | 9 | 2017-02-05T06:54:04.000Z | 2020-02-04T06:54:34.000Z | //
// Created by iskakoff on 21/08/16.
//
#include "gtest/gtest.h"
#include "edlib/NSymmetry.h"
#include "edlib/EDParams.h"
TEST(NSymmetryTest, Initialization) {
alps::params p;
EDLib::define_parameters(p);
EDLib::Symmetry::NSymmetry sym(p);
while(sym.next_sector()) {
sym.init();
int i = 0;
while... | 17.782609 | 43 | 0.618582 | katherlee |
0e0f0171a1b52e68bf4a6267f0baa3488f0b2ed5 | 513 | hpp | C++ | src/utils/ExpressionValue.hpp | ldXiao/polyfem | d4103af16979ff67d461a9ebe46a14bbc4dc8c7c | [
"MIT"
] | null | null | null | src/utils/ExpressionValue.hpp | ldXiao/polyfem | d4103af16979ff67d461a9ebe46a14bbc4dc8c7c | [
"MIT"
] | null | null | null | src/utils/ExpressionValue.hpp | ldXiao/polyfem | d4103af16979ff67d461a9ebe46a14bbc4dc8c7c | [
"MIT"
] | null | null | null | #pragma once
#include <polyfem/Common.hpp>
#include <tinyexpr.h>
namespace polyfem {
class ExpressionValue
{
public:
~ExpressionValue();
ExpressionValue();
void init(const json &vals);
void init(const double val);
void init(const std::string &expr);
double operator()(double x, double y) const;
do... | 15.088235 | 56 | 0.674464 | ldXiao |
97b8feced2d8b97773ada4ba3f3258c6dabacf46 | 5,552 | cc | C++ | aoc-2021/21.cc | akshaypundle/aoc | f98ebe72877a98addb831664b9881141d7f78b2a | [
"MIT"
] | null | null | null | aoc-2021/21.cc | akshaypundle/aoc | f98ebe72877a98addb831664b9881141d7f78b2a | [
"MIT"
] | null | null | null | aoc-2021/21.cc | akshaypundle/aoc | f98ebe72877a98addb831664b9881141d7f78b2a | [
"MIT"
] | null | null | null | #include <algorithm>
#include <cmath>
#include <iostream>
#include "library.h"
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using namespace library;
class Problem {
public:
int die=1;
int dierolls=0;
int ... | 24.785714 | 104 | 0.415166 | akshaypundle |
97beb6ea84b412bdc7d6f4e21b4f6ba4098beefd | 3,660 | cpp | C++ | libWetCloth/Core/Capsule.cpp | rushmash/libwetcloth | 24f16481c68952c3d2a91acd6e3b74eb091b66bc | [
"BSD-3-Clause-Clear"
] | null | null | null | libWetCloth/Core/Capsule.cpp | rushmash/libwetcloth | 24f16481c68952c3d2a91acd6e3b74eb091b66bc | [
"BSD-3-Clause-Clear"
] | null | null | null | libWetCloth/Core/Capsule.cpp | rushmash/libwetcloth | 24f16481c68952c3d2a91acd6e3b74eb091b66bc | [
"BSD-3-Clause-Clear"
] | null | null | null | //
// This file is part of the libWetCloth open source project
//
// The code is licensed solely for academic and non-commercial use under the
// terms of the Clear BSD License. The terms of the Clear BSD License are
// provided below. Other licenses may be obtained by contacting the faculty
// of the Columbia Computer... | 35.882353 | 91 | 0.674863 | rushmash |
97c4c5494b439eaf2c831b58bfdf21df54aa14de | 8,913 | hpp | C++ | include/stms/async.hpp | RotartsiORG/StoneMason | 0f6efefad68b29e7e82524e705ce47606ba53665 | [
"Apache-2.0"
] | 1 | 2021-10-02T19:31:14.000Z | 2021-10-02T19:31:14.000Z | include/stms/async.hpp | RotartsiORG/StoneMason | 0f6efefad68b29e7e82524e705ce47606ba53665 | [
"Apache-2.0"
] | 1 | 2020-06-17T01:15:45.000Z | 2020-06-17T01:16:08.000Z | include/stms/async.hpp | RotartsiORG/StoneMason | 0f6efefad68b29e7e82524e705ce47606ba53665 | [
"Apache-2.0"
] | 1 | 2020-10-17T23:57:27.000Z | 2020-10-17T23:57:27.000Z | /**
* @file stms/async.hpp
* @brief `ThreadPool`s for async task scheduling and execution.
* @author Grant Yang (rotartsi0482@gmail.com)
* @date 12/30/19
*/
#pragma once
#ifndef __STONEMASON_ASYNC_HPP
#define __STONEMASON_ASYNC_HPP
//!< Include guard
#include <queue>
#include <cinttypes>
#include <future>
#inc... | 37.44958 | 139 | 0.616627 | RotartsiORG |
97c5daa56133cd9bc2f6683969847cda32314689 | 17,819 | cpp | C++ | src/NotificationSystem/NotificationPopupLayout.cpp | dmlys/QtTools | aaf9605a5dd9b01460c90641bb849bc9477e2fff | [
"BSL-1.0"
] | null | null | null | src/NotificationSystem/NotificationPopupLayout.cpp | dmlys/QtTools | aaf9605a5dd9b01460c90641bb849bc9477e2fff | [
"BSL-1.0"
] | null | null | null | src/NotificationSystem/NotificationPopupLayout.cpp | dmlys/QtTools | aaf9605a5dd9b01460c90641bb849bc9477e2fff | [
"BSL-1.0"
] | 1 | 2019-02-12T09:33:48.000Z | 2019-02-12T09:33:48.000Z | #include <tuple>
#include <ext/config.hpp>
#include <ext/utility.hpp>
#include <QtCore/QEvent>
#include <QtCore/QTimer>
#include <QtCore/QMetaObject>
#include <QtCore/QMetaMethod>
#include <QtGui/QScreen>
#include <QtGui/QMouseEvent>
#include <QtGui/QResizeEvent>
#include <QtWidgets/QApplication>
#include <QtWidgets/Q... | 26.795489 | 152 | 0.698356 | dmlys |
97c762502373d0a81e405555436f18c85eb53a26 | 613 | cpp | C++ | src/Transcension3D.cpp | zanshi/transcension3d | 304374e83d709d73358d225567676ad7048509e6 | [
"MIT"
] | 7 | 2015-05-30T13:56:34.000Z | 2017-11-04T17:58:26.000Z | src/Transcension3D.cpp | zanshi/transcension3d | 304374e83d709d73358d225567676ad7048509e6 | [
"MIT"
] | null | null | null | src/Transcension3D.cpp | zanshi/transcension3d | 304374e83d709d73358d225567676ad7048509e6 | [
"MIT"
] | null | null | null | #include <Application.hpp>
#undef main
int main(int argc, char *argv[]) {
// Application initialization
std::vector<std::string> args(argv, argv+argc);
std::string input;
//std::cout << args.size() << std::endl;
if(args.size() == 2) {
input = args[1];
std::cout << "Input: " << ... | 20.433333 | 77 | 0.541599 | zanshi |
97cdab787729eef5c2dab1023108e2f9c87f6112 | 9,176 | cpp | C++ | Step3/calcDensityForDiffThresh.cpp | ediston/Link-Clustering-Algorithm | e93a4b92f50bedae75c779937b5242d487075043 | [
"Unlicense"
] | 2 | 2015-05-20T09:05:30.000Z | 2017-11-08T09:23:54.000Z | Step3/calcDensityForDiffThresh.cpp | ediston/Link-Clustering-Algorithm | e93a4b92f50bedae75c779937b5242d487075043 | [
"Unlicense"
] | null | null | null | Step3/calcDensityForDiffThresh.cpp | ediston/Link-Clustering-Algorithm | e93a4b92f50bedae75c779937b5242d487075043 | [
"Unlicense"
] | null | null | null | /*
1. Treat each edge id as a cluster, unordered map from edgeId to a set
2. also store size of each cluster which will 0 in the begining
// $ g++ -std=c++0x -O3 -o calcDensityForDiffThresh calcDensityForDiffThresh.cpp
// $ ./calcDensityForDiffThresh networkEdgeIdMap.csv network.jaccs sortedjaccs.csv Nthresholds thr... | 39.551724 | 119 | 0.537707 | ediston |
97d870fb1ccf3e44f88406c61d063a9eaf252ea0 | 402 | cpp | C++ | Number Theory/extended-euclid.cpp | chaitanyarahalkar/Algorithms | 27c7f952645afccab12d89c025d69a427c36550f | [
"MIT"
] | 3 | 2021-07-22T12:43:59.000Z | 2021-07-23T16:34:54.000Z | Number Theory/extended-euclid.cpp | chaitanyarahalkar/Algorithms | 27c7f952645afccab12d89c025d69a427c36550f | [
"MIT"
] | null | null | null | Number Theory/extended-euclid.cpp | chaitanyarahalkar/Algorithms | 27c7f952645afccab12d89c025d69a427c36550f | [
"MIT"
] | 1 | 2020-05-03T13:56:55.000Z | 2020-05-03T13:56:55.000Z | #include <iostream>
using std::cout;
int extended_euclid(int a,int b,int* x,int* y){
if(a == 0){
*x = 0;
*y = 1;
return b;
}
int x1,y1;
int gcd = extended_euclid(b%a,a,&x1,&y1);
*x = y1 - (b/a)*x1;
*y = x1;
return gcd;
}
int main(void){
int x,y;
int a = 100;
int b = 201;
int gcd = extended_eucl... | 11.485714 | 47 | 0.529851 | chaitanyarahalkar |
97dcabfacbead4cb40b8ff3d6060a2427a76504f | 13,419 | cxx | C++ | Core/GraphicsKit/Frame.cxx | broken-bytes/Cyanite-Engine | 5733e1fc010b375bbafc9ebfa41e248845f945b3 | [
"MIT"
] | null | null | null | Core/GraphicsKit/Frame.cxx | broken-bytes/Cyanite-Engine | 5733e1fc010b375bbafc9ebfa41e248845f945b3 | [
"MIT"
] | null | null | null | Core/GraphicsKit/Frame.cxx | broken-bytes/Cyanite-Engine | 5733e1fc010b375bbafc9ebfa41e248845f945b3 | [
"MIT"
] | 1 | 2020-12-20T07:35:05.000Z | 2020-12-20T07:35:05.000Z | #include "pch.hxx"
#include "Frame.hxx"
namespace Cyanite::GraphicsKit {
Frame::Frame(
winrt::com_ptr<ID3D12Device> device,
winrt::com_ptr<ID3D12PipelineState> pso,
winrt::com_ptr<ID3D12PipelineState> shadowMapPso,
winrt::com_ptr<ID3D12DescriptorHeap> dsvHeap,
winrt::com_ptr<ID3D12DescriptorHeap> cbvSrvHeap... | 39.351906 | 207 | 0.751472 | broken-bytes |
97e08698a994bc586a230c8e154c2d148eda3c5d | 3,945 | cpp | C++ | src/mw_adapter/ExchangeEventDataReaderListenerImpl.cpp | mw-smenon/opendds_example | 4e17478c60b5d2717695e48c107ced44e1478e0d | [
"MIT"
] | 1 | 2019-01-15T14:15:15.000Z | 2019-01-15T14:15:15.000Z | src/mw_adapter/ExchangeEventDataReaderListenerImpl.cpp | mw-smenon/opendds_example | 4e17478c60b5d2717695e48c107ced44e1478e0d | [
"MIT"
] | null | null | null | src/mw_adapter/ExchangeEventDataReaderListenerImpl.cpp | mw-smenon/opendds_example | 4e17478c60b5d2717695e48c107ced44e1478e0d | [
"MIT"
] | null | null | null | // -*- C++ -*-
// *******************************************************************
//
// (c) Copyright 2006, Object Computing, Inc.
// All Rights Reserved.
//
// *******************************************************************
#include "ExchangeEventDataReaderListenerImpl.h"
#include "StockQuoterTypeSupportC.h"
... | 35.223214 | 106 | 0.59924 | mw-smenon |
97e10347b44dd5923d226aa5dc984c6e55ef74eb | 8,188 | cpp | C++ | benchmarks/discrete_trajectory.cpp | al2me6/Principia | 3473dbc3727a41edfffcc2cd2e94a49a720d3b7b | [
"MIT"
] | 565 | 2015-01-04T21:47:18.000Z | 2022-03-22T12:04:58.000Z | benchmarks/discrete_trajectory.cpp | al2me6/Principia | 3473dbc3727a41edfffcc2cd2e94a49a720d3b7b | [
"MIT"
] | 1,019 | 2015-01-03T11:42:27.000Z | 2022-03-29T21:02:15.000Z | benchmarks/discrete_trajectory.cpp | al2me6/Principia | 3473dbc3727a41edfffcc2cd2e94a49a720d3b7b | [
"MIT"
] | 92 | 2015-02-11T23:08:58.000Z | 2022-03-21T03:35:37.000Z |
// .\Release\x64\benchmarks.exe --benchmark_filter=DiscreteTrajectory
#include "physics/discrete_trajectory.hpp"
#include "base/not_null.hpp"
#include "benchmark/benchmark.h"
#include "geometry/frame.hpp"
#include "ksp_plugin/frames.hpp"
#include "quantities/elementary_functions.hpp"
#include "quantities/named_quant... | 32.363636 | 80 | 0.705056 | al2me6 |
97e1e8680b8d574c1a164376d430e517837fb6e6 | 2,239 | hpp | C++ | src/base/foundation/GmatType.hpp | saichikine/GMAT | 80bde040e12946a61dae90d9fc3538f16df34190 | [
"Apache-2.0"
] | null | null | null | src/base/foundation/GmatType.hpp | saichikine/GMAT | 80bde040e12946a61dae90d9fc3538f16df34190 | [
"Apache-2.0"
] | null | null | null | src/base/foundation/GmatType.hpp | saichikine/GMAT | 80bde040e12946a61dae90d9fc3538f16df34190 | [
"Apache-2.0"
] | 1 | 2021-12-05T05:40:15.000Z | 2021-12-05T05:40:15.000Z | //------------------------------------------------------------------------------
// GmatType
//------------------------------------------------------------------------------
// GMAT: General Mission Analysis Tool
//
// Copyright (c) 2002 - 2018 United States Government as represented by the
//... | 33.41791 | 81 | 0.644484 | saichikine |
97e4914ee99401d6c6613ba99f81abd43fe4cf72 | 5,483 | hpp | C++ | include/memory/hadesmem/pelib/tls_dir.hpp | CvX/hadesmem | d2c5164cc753dac37879ac8079f2ae23f2b8edb5 | [
"MIT"
] | 24 | 2018-08-18T18:05:37.000Z | 2021-09-28T00:26:35.000Z | include/memory/hadesmem/pelib/tls_dir.hpp | CvX/hadesmem | d2c5164cc753dac37879ac8079f2ae23f2b8edb5 | [
"MIT"
] | null | null | null | include/memory/hadesmem/pelib/tls_dir.hpp | CvX/hadesmem | d2c5164cc753dac37879ac8079f2ae23f2b8edb5 | [
"MIT"
] | 9 | 2018-04-16T09:53:09.000Z | 2021-02-26T05:04:49.000Z | // Copyright (C) 2010-2014 Joshua Boyce.
// See the file COPYING for copying permission.
#pragma once
#include <array>
#include <cstddef>
#include <cstdint>
#include <iosfwd>
#include <memory>
#include <ostream>
#include <vector>
#include <utility>
#include <windows.h>
#include <winnt.h>
#include <... | 24.922727 | 81 | 0.664235 | CvX |
97e76dd533429b113b107b2c04ef75d597d87745 | 1,041 | cpp | C++ | src/viz.cpp | CloudDanielWang/rgbd-slam | c42b99335c1f19091ec4414dc46f6c1b4dbe532c | [
"MIT"
] | 6 | 2018-04-20T19:25:21.000Z | 2021-06-22T18:44:02.000Z | src/viz.cpp | CloudDanielWang/rgbd-slam | c42b99335c1f19091ec4414dc46f6c1b4dbe532c | [
"MIT"
] | null | null | null | src/viz.cpp | CloudDanielWang/rgbd-slam | c42b99335c1f19091ec4414dc46f6c1b4dbe532c | [
"MIT"
] | 2 | 2017-08-09T07:59:57.000Z | 2018-02-09T19:10:29.000Z | #include "acrbslam/viz.h"
#include "acrbslam/data.h"
namespace acrbslam
{
viz::Viz3d viz_initialize()
{
cv::viz::Viz3d vis ( "Visual Odometry" );
cv::viz::WCoordinateSystem world_coor ( 1.0 ), camera_coor ( 0.5 );
cv::Point3d cam_pos ( 0, -1.0, -1.0 ), cam_focal_point ( 0,0,0 ), cam_y_dir ( ... | 26.692308 | 96 | 0.60999 | CloudDanielWang |
97f0a3073a327d80775858924333b3b2c9253aa8 | 543 | cpp | C++ | BASIC c++/manipulating_string/relation_operator_on_string.cpp | jattramesh/Learning_git | 5191ecc6c0c11b69b9786f2a8bdd3db7228987d6 | [
"MIT"
] | null | null | null | BASIC c++/manipulating_string/relation_operator_on_string.cpp | jattramesh/Learning_git | 5191ecc6c0c11b69b9786f2a8bdd3db7228987d6 | [
"MIT"
] | null | null | null | BASIC c++/manipulating_string/relation_operator_on_string.cpp | jattramesh/Learning_git | 5191ecc6c0c11b69b9786f2a8bdd3db7228987d6 | [
"MIT"
] | null | null | null | //
// Created by rahul on 19/8/19.
//
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s1("ABC");
string s2("XYZ");
string s3=s1+s2;
if(s1!=s2)
cout<<"s1 is not equal to s2";
if(s1>s2)
cout<<"s1 is greater than s2";
else
cout<<"s2 is greater ... | 19.392857 | 38 | 0.511971 | jattramesh |
97fa04190b1239967fbb2ec39bb5cb14f1edff6a | 8,017 | cpp | C++ | DPC++Compiler/FPGAExampleDesigns/qrd/src/qrd_demo.cpp | daniellephillips/BaseKit-code-samples | 5a56803d536ba2e6e90b3735e8a6c1b5c6e74546 | [
"MIT"
] | 1 | 2020-02-21T06:58:51.000Z | 2020-02-21T06:58:51.000Z | DPC++Compiler/FPGAExampleDesigns/qrd/src/qrd_demo.cpp | Acidburn0zzz/BaseKit-code-samples | 9fcb6ae509fb6e95aed0ae8ffd713d2ca364987b | [
"MIT"
] | null | null | null | DPC++Compiler/FPGAExampleDesigns/qrd/src/qrd_demo.cpp | Acidburn0zzz/BaseKit-code-samples | 9fcb6ae509fb6e95aed0ae8ffd713d2ca364987b | [
"MIT"
] | null | null | null | // ==============================================================
// Copyright (C) 2019 Intel Corporation
//
// SPDX-License-Identifier: MIT
// =============================================================
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of this
// software and assoc... | 43.335135 | 154 | 0.573905 | daniellephillips |
3f01cdc3c55c30e49061049bae29264d02b57604 | 480 | cpp | C++ | BigNum/main.cpp | githubofhuo/data-structure-and-algorithm | d06c2598ed648bc79f4062ac6bc39b66e254d1f3 | [
"MIT"
] | null | null | null | BigNum/main.cpp | githubofhuo/data-structure-and-algorithm | d06c2598ed648bc79f4062ac6bc39b66e254d1f3 | [
"MIT"
] | null | null | null | BigNum/main.cpp | githubofhuo/data-structure-and-algorithm | d06c2598ed648bc79f4062ac6bc39b66e254d1f3 | [
"MIT"
] | null | null | null | #include <iostream>
#include "BigNum1.h"
using namespace std;
int main() {
// int i,n;
// BigNum x[101]; //定义大数的对象数组
// x[0]=1;
// for(i=1;i<101;i++)
// x[i]=x[i-1]*(4*i-2)/(i+1);
// cin>>n;
// x[n].print();
// x[n+1].print();
// (x[n]+x[n+1]).print();
// (x[n]-x[n+1]).print();
/... | 20.869565 | 37 | 0.429167 | githubofhuo |
3f04d4ad4fb4cf175478c5de99de34e239cf4141 | 1,022 | cpp | C++ | Leetcode/15.3Sum.cpp | xingbofeng/Leetcode | 752dddbfd2deb0fe32285ec92d0a16710511342e | [
"MIT"
] | null | null | null | Leetcode/15.3Sum.cpp | xingbofeng/Leetcode | 752dddbfd2deb0fe32285ec92d0a16710511342e | [
"MIT"
] | null | null | null | Leetcode/15.3Sum.cpp | xingbofeng/Leetcode | 752dddbfd2deb0fe32285ec92d0a16710511342e | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <set>
using namespace std;
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
set<vector<int>> res;
sort(nums.begin(), nums.end());
for (int k = 0; k < nums.size(); ++k) {
if (nums[k] > 0) {
break;
}
int targ... | 23.227273 | 55 | 0.433464 | xingbofeng |
3f0c4e4a9814ece6161a6ed3ca4866a915b4d2f5 | 715 | hpp | C++ | lnthrow.hpp | jonathanrlemos/CloudSync | fdf90cdf74f7598ccfccc0a688babef9526e07b2 | [
"MIT"
] | 1 | 2019-10-09T05:28:43.000Z | 2019-10-09T05:28:43.000Z | lnthrow.hpp | jonathan-lemos/CloudSync | fdf90cdf74f7598ccfccc0a688babef9526e07b2 | [
"MIT"
] | null | null | null | lnthrow.hpp | jonathan-lemos/CloudSync | fdf90cdf74f7598ccfccc0a688babef9526e07b2 | [
"MIT"
] | null | null | null | /** @file lnthrow.hpp
* @brief throws an exception showing line number/file
* @copyright Copyright (c) 2018 Jonathan Lemos
*
* This software may be modified and distributed under the terms
* of the MIT license. See the LICENSE file for details.
*/
#include <stdexcept>
#include <string>
#define __GET_LNTHROW(_1... | 39.722222 | 142 | 0.704895 | jonathanrlemos |
3f0d42a3a6d01919bcf5b784a55d5c6197c127dd | 6,619 | cpp | C++ | join/core/src/error.cpp | mrabine/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | 1 | 2021-09-14T13:53:07.000Z | 2021-09-14T13:53:07.000Z | join/core/src/error.cpp | joinframework/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | 15 | 2021-08-09T23:55:02.000Z | 2021-11-22T11:05:41.000Z | join/core/src/error.cpp | mrabine/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | null | null | null | /**
* MIT License
*
* Copyright (c) 2021 Mathieu Rabine
*
* 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, ... | 39.873494 | 90 | 0.524551 | mrabine |
3f0e813b4ec05e67d3d2308e0d6372611a5372f9 | 403 | cpp | C++ | cards/DezaktywacjaKarty.cpp | programistagd/TrachOnline | 2acd9ffac0add87fd0f1824ae2b75132933496c7 | [
"MIT"
] | 3 | 2016-06-07T11:55:23.000Z | 2016-06-09T17:17:52.000Z | cards/DezaktywacjaKarty.cpp | radeusgd/TrachOnline | 2acd9ffac0add87fd0f1824ae2b75132933496c7 | [
"MIT"
] | 25 | 2016-06-13T16:14:18.000Z | 2017-07-29T08:12:23.000Z | cards/DezaktywacjaKarty.cpp | radeusgd/TrachOnline | 2acd9ffac0add87fd0f1824ae2b75132933496c7 | [
"MIT"
] | null | null | null | #include "cards/DezaktywacjaKarty.hpp"
using namespace Cards;
string DezaktywacjaKarty::getName(){
return "dezaktywacja_karty";
}
bool DezaktywacjaKarty::canBePlayedAt(CardPtr card, GameServer* game){
return true;
}
CardPtr DezaktywacjaKarty::makeNew(){
return make_shared<DezaktywacjaKarty>();
}
void D... | 20.15 | 70 | 0.754342 | programistagd |
3f175cc58cd8791daeded16cc9523d13eb747c2d | 58,700 | cpp | C++ | src/AdvCmpDlgOpt.cpp | FarPlugins/AdvCmpEx | f8f308b51dfd42b7f45766455370a066d10bfaee | [
"BSD-3-Clause"
] | 6 | 2021-01-20T08:45:30.000Z | 2022-01-23T09:39:58.000Z | src/AdvCmpDlgOpt.cpp | FarPlugins/AdvCmpEx | f8f308b51dfd42b7f45766455370a066d10bfaee | [
"BSD-3-Clause"
] | 5 | 2021-01-04T19:02:34.000Z | 2021-02-01T16:32:05.000Z | src/AdvCmpDlgOpt.cpp | FarPlugins/AdvCmpEx | f8f308b51dfd42b7f45766455370a066d10bfaee | [
"BSD-3-Clause"
] | null | null | null | /****************************************************************************
* AdvCmpDlgOpt.cpp
*
* Plugin module for Far Manager 3.0
*
* Copyright (c) 2006 Alexey Samlyukov
****************************************************************************/
/*
Redistribution and use in source and binary forms, with or... | 47.723577 | 152 | 0.604191 | FarPlugins |
3f18c4ecacd8d406c7e35811ddb6cbd4a2b9c8a4 | 11,095 | cpp | C++ | SpaceBoxGen.cpp | ab4daa/space-Urho3D | 68f78c3a63a16b2aea25017d674a9a1cac4b5405 | [
"CC0-1.0"
] | 4 | 2019-03-09T07:10:29.000Z | 2020-03-19T03:51:02.000Z | SpaceBoxGen.cpp | ab4daa/space-Urho3D | 68f78c3a63a16b2aea25017d674a9a1cac4b5405 | [
"CC0-1.0"
] | null | null | null | SpaceBoxGen.cpp | ab4daa/space-Urho3D | 68f78c3a63a16b2aea25017d674a9a1cac4b5405 | [
"CC0-1.0"
] | 1 | 2019-03-09T06:58:55.000Z | 2019-03-09T06:58:55.000Z | #include "SpaceBoxGen.h"
#include <Urho3D/Urho3DAll.h>
namespace Urho3D
{
typedef struct vertex_s
{
Vector3 position;
unsigned color;
}vertex_data;
static void buildStar(float size, const Vector3 &pos, float dist, vertex_data * vertexBufferOut)
{
const Vector3 vertexes[6] =
{
Vector3(-size, -size, 0.0... | 31.7 | 135 | 0.67598 | ab4daa |
3f194216bcb73bf1c55950f014da49d997eadea5 | 636 | cpp | C++ | io/echo-even.cpp | MatthewCalligaro/CS70Textbook | c7fb8e2163a0da562972aea37e35f2b5825a9b80 | [
"MIT"
] | 8 | 2020-01-24T20:50:59.000Z | 2021-08-01T17:57:37.000Z | io/echo-even.cpp | cs70-grutoring/CS70Textbook | c7fb8e2163a0da562972aea37e35f2b5825a9b80 | [
"MIT"
] | null | null | null | io/echo-even.cpp | cs70-grutoring/CS70Textbook | c7fb8e2163a0da562972aea37e35f2b5825a9b80 | [
"MIT"
] | 1 | 2020-04-04T17:15:19.000Z | 2020-04-04T17:15:19.000Z |
/**
* \file echo-even.cpp
* \copyright Matthew Calligaro
* \date January 2020
* \brief A command line program which echos the input to standard input
*/
#include <iostream>
#include <string>
int main() {
// Read input from standard input
std::string input;
std::cout << "Please enter your input: ";
std::... | 22.714286 | 78 | 0.638365 | MatthewCalligaro |
3f1c80e170b317031b51f5b419815096cefe9836 | 4,430 | cpp | C++ | client.cpp | theom/tls-socket | 05a293b5e9ad9e30826628458f9b9bb349fe1d08 | [
"BSD-2-Clause"
] | 4 | 2018-03-24T12:02:20.000Z | 2020-12-31T20:04:15.000Z | client.cpp | theom/tls-socket | 05a293b5e9ad9e30826628458f9b9bb349fe1d08 | [
"BSD-2-Clause"
] | 1 | 2019-08-04T05:34:44.000Z | 2019-08-05T12:03:44.000Z | client.cpp | theom/tls-socket | 05a293b5e9ad9e30826628458f9b9bb349fe1d08 | [
"BSD-2-Clause"
] | 1 | 2018-03-24T15:01:03.000Z | 2018-03-24T15:01:03.000Z | //
// (C) 2018 Jens Páll Hafsteinsson, Axon ehf.
//
// tls-socket is released under the Simplified BSD License (see LICENSE)
#include <iostream>
#include "tls_client_socket.hpp"
#include "credentials.hpp"
#include "socket_utils.hpp"
class tls_client
{
public:
tls_client()
{
init_sockets();
}
... | 25.45977 | 97 | 0.467494 | theom |
3f23dde8f8057000982f3dd123ccfa698e6b964c | 47,875 | cpp | C++ | vscript/languages/squirrel/testSqPlus2/testSqPlus2.cpp | DannyParker0001/Kisak-Strike | 99ed85927336fe3aff2efd9b9382b2b32eb1d05d | [
"Unlicense"
] | 252 | 2020-12-16T15:34:43.000Z | 2022-03-31T23:21:37.000Z | cstrike15_src/vscript/languages/squirrel/testSqPlus2/testSqPlus2.cpp | bahadiraraz/Counter-Strike-Global-Offensive | 9a0534100cb98ffa1cf0c32e138f0e7971e910d3 | [
"MIT"
] | 23 | 2020-12-20T18:02:54.000Z | 2022-03-28T16:58:32.000Z | cstrike15_src/vscript/languages/squirrel/testSqPlus2/testSqPlus2.cpp | bahadiraraz/Counter-Strike-Global-Offensive | 9a0534100cb98ffa1cf0c32e138f0e7971e910d3 | [
"MIT"
] | 42 | 2020-12-19T04:32:33.000Z | 2022-03-30T06:00:28.000Z | // testSqPlus2.cpp
// Created by John Schultz 9/21/2005
// Free for any use.
// Step through the code with a debugger (setting breakpoints in functions)
// to get an idea how everything works.
#include <stdarg.h>
#include <stdio.h>
#if 0
#include <string>
//#define SQPLUS_SUPPORT_STD_STRING
#define SQPLUS_SUPPORT_SQ... | 38.269384 | 381 | 0.63576 | DannyParker0001 |
3f27ff3034be1b432e301b00dcd1819d5b1adedb | 2,307 | cpp | C++ | Assignment_3/Vehicle.cpp | Xudmud/Data-Structures | fdc4c418db0e8d77667a0b9ab6e0c4ff81a63563 | [
"MIT"
] | null | null | null | Assignment_3/Vehicle.cpp | Xudmud/Data-Structures | fdc4c418db0e8d77667a0b9ab6e0c4ff81a63563 | [
"MIT"
] | null | null | null | Assignment_3/Vehicle.cpp | Xudmud/Data-Structures | fdc4c418db0e8d77667a0b9ab6e0c4ff81a63563 | [
"MIT"
] | null | null | null | /* Gregory Wicklund
* Class: CSCI-2421
* HW 3 Vehicle.cpp file
*/
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include "Vehicle.h"
//Constructor. Assigns blank values in case no data is read.
Vehicle::Vehicle()
{
year = 0;
make = "";
model = "";
}
Vehicle::Vehicle(std::stringstre... | 19.550847 | 66 | 0.642393 | Xudmud |
3f2db63a0e6ff4937c55fd7b29b3bf34d43d2868 | 717 | cpp | C++ | Listas2/SALA/exe5sala.cpp | nathalyoliveira/LG1-IFSP | b072c916f71a8b5924a766d8b6fa4e0a481faa64 | [
"MIT"
] | null | null | null | Listas2/SALA/exe5sala.cpp | nathalyoliveira/LG1-IFSP | b072c916f71a8b5924a766d8b6fa4e0a481faa64 | [
"MIT"
] | null | null | null | Listas2/SALA/exe5sala.cpp | nathalyoliveira/LG1-IFSP | b072c916f71a8b5924a766d8b6fa4e0a481faa64 | [
"MIT"
] | null | null | null | #include<stdio.h>
#include<conio.h>
int main()
{
float a, b, c;
printf("Digite tres numeros:");
scanf("%f %f %f", &a, &b, &c);
if ((a<b)&&(a<c)&&(b<c))
printf("Os valores em ordem crescente sao: %.2f %.2f %.2f", a, b, c);
else if((a<b)&&(a<c)&&(c<b))
printf("Os valores em ordem crescente sao: %.2f %.2f %.2f",a, c, b... | 24.724138 | 69 | 0.564854 | nathalyoliveira |
3f2ebc2ba559f559de112cd481a2ef913c595603 | 51,974 | cpp | C++ | apps/esmtool/record.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | apps/esmtool/record.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | apps/esmtool/record.cpp | Bodillium/openmw | 5fdd264d0704e33b44b1ccf17ab4fb721f362e34 | [
"Unlicense"
] | null | null | null | #include "record.hpp"
#include "labels.hpp"
#include <iostream>
#include <boost/format.hpp>
void printAIPackage(ESM::AIPackage p)
{
std::cout << " AI Type: " << aiTypeLabel(p.mType)
<< " (" << boost::format("0x%08X") % p.mType << ")" << std::endl;
if (p.mType == ESM::AI_Wander)
{
st... | 40.041602 | 102 | 0.522704 | Bodillium |
3f2ed3b28f2cd772374f7fbb33556fda2afb3f13 | 99 | cpp | C++ | src/noc_file_dialog.cpp | wtrsltnk/goldsrc-maps | e70e52207b70de7fdd8e6e7d7b515a5d7dc1d4d9 | [
"MIT"
] | 4 | 2019-03-13T00:50:43.000Z | 2020-03-24T07:17:14.000Z | src/noc_file_dialog.cpp | wtrsltnk/goldsrc-maps | e70e52207b70de7fdd8e6e7d7b515a5d7dc1d4d9 | [
"MIT"
] | null | null | null | src/noc_file_dialog.cpp | wtrsltnk/goldsrc-maps | e70e52207b70de7fdd8e6e7d7b515a5d7dc1d4d9 | [
"MIT"
] | null | null | null |
#define NOC_FILE_DIALOG_IMPLEMENTATION
#define NOC_FILE_DIALOG_WIN32
#include <noc_file_dialog.h>
| 19.8 | 38 | 0.868687 | wtrsltnk |
3f353d97233e81b2fbe6e762c7101502cb94752f | 2,628 | cc | C++ | src/test/algo/positions.t.cc | maxpev/algorithm_dumpster | e68c7da1b1d278fefe2617ce19e4278ac623d286 | [
"Apache-2.0"
] | null | null | null | src/test/algo/positions.t.cc | maxpev/algorithm_dumpster | e68c7da1b1d278fefe2617ce19e4278ac623d286 | [
"Apache-2.0"
] | null | null | null | src/test/algo/positions.t.cc | maxpev/algorithm_dumpster | e68c7da1b1d278fefe2617ce19e4278ac623d286 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2019 Denis Yaroshevskiy
*
* 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 agr... | 23.052632 | 75 | 0.570396 | maxpev |
3f3875332f607f1096018de7d33a2cef20752038 | 1,553 | cpp | C++ | src/projx_robot_control/src/simulation_servo_controller.cpp | Francisco-Ibarra07/sparky | b8047fd6492b340cde66348346ebf1f36ca05785 | [
"MIT"
] | 2 | 2019-11-27T00:09:29.000Z | 2020-07-30T02:25:08.000Z | src/projx_robot_control/src/simulation_servo_controller.cpp | Francisco-Ibarra07/sparky | b8047fd6492b340cde66348346ebf1f36ca05785 | [
"MIT"
] | null | null | null | src/projx_robot_control/src/simulation_servo_controller.cpp | Francisco-Ibarra07/sparky | b8047fd6492b340cde66348346ebf1f36ca05785 | [
"MIT"
] | null | null | null | #include "projx_robot_control/simulation_servo_controller.hpp"
// Constructor initializes publishers
ServoController::ServoController(){
initROSComm();
}
// Empty desctructor
ServoController::~ServoController() {}
// Define publishers for each motor joint
void ServoController::initROSComm(){
// Front ser... | 32.354167 | 100 | 0.765615 | Francisco-Ibarra07 |
278fbaf5688fdad40f6a3971323bcde19e21f0f8 | 23,986 | cpp | C++ | projects/qgfx/src/qgfx/vulkan/vulkan_context_handle.cpp | Quadrion/qgfx | e853d5e357df052e0c09d4678c43ed96b4998778 | [
"MIT"
] | 2 | 2019-01-15T02:57:48.000Z | 2020-10-30T11:36:13.000Z | projects/qgfx/src/qgfx/vulkan/vulkan_context_handle.cpp | Quadrion/qgfx | e853d5e357df052e0c09d4678c43ed96b4998778 | [
"MIT"
] | null | null | null | projects/qgfx/src/qgfx/vulkan/vulkan_context_handle.cpp | Quadrion/qgfx | e853d5e357df052e0c09d4678c43ed96b4998778 | [
"MIT"
] | null | null | null | #if defined(QGFX_VULKAN)
#include <map>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
#include <cstring>
#include "qgfx/vulkan/queue_family.h"
#include "qgfx/vulkan/vulkan_context_handle.h"
#include "qgfx/vulkan/vulkan_rasterizer.h"
#include "qgfx/vulkan/vulkan_pipeline.h"
#include "qgfx/v... | 30.711908 | 140 | 0.79167 | Quadrion |
2790f751c027c0610baaf0e9810c9bc505440df5 | 9,191 | cpp | C++ | xunit-test/CountersTest/StrongCounterTest.cpp | fabriziosta/cpp-client | 5056c9fc35b5ae30f79b26c7362637c9dfc2100b | [
"Apache-2.0"
] | 6 | 2015-09-08T21:00:40.000Z | 2021-08-06T15:20:11.000Z | xunit-test/CountersTest/StrongCounterTest.cpp | fabriziosta/cpp-client | 5056c9fc35b5ae30f79b26c7362637c9dfc2100b | [
"Apache-2.0"
] | 198 | 2015-02-10T11:35:21.000Z | 2022-03-08T16:42:51.000Z | xunit-test/CountersTest/StrongCounterTest.cpp | fabriziosta/cpp-client | 5056c9fc35b5ae30f79b26c7362637c9dfc2100b | [
"Apache-2.0"
] | 10 | 2015-09-10T07:46:56.000Z | 2021-11-28T17:26:43.000Z | /*
* StrongCounterTest.cpp
*
* Created on: May 8, 2018
* Author: rigazilla
*/
#include "infinispan/hotrod/ConfigurationBuilder.h"
#include "infinispan/hotrod/RemoteCacheManager.h"
#include "StrongCounterTest.h"
using ::infinispan::hotrod::ConfigurationBuilder;
using ::infinispan::hotrod::Configuration;
std... | 40.668142 | 113 | 0.725384 | fabriziosta |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.