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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
dd05284c102ac99a75464f29ae7e8320f1abbc9a | 430 | hpp | C++ | development/CppDB/libCppDb/include/CppDb/details/CrcTypes.hpp | AntonPoturaev/CppDB | 034d7feafc438fc585441742472bf4b5ef637eb2 | [
"Unlicense"
] | null | null | null | development/CppDB/libCppDb/include/CppDb/details/CrcTypes.hpp | AntonPoturaev/CppDB | 034d7feafc438fc585441742472bf4b5ef637eb2 | [
"Unlicense"
] | null | null | null | development/CppDB/libCppDb/include/CppDb/details/CrcTypes.hpp | AntonPoturaev/CppDB | 034d7feafc438fc585441742472bf4b5ef637eb2 | [
"Unlicense"
] | null | null | null | #if !defined(__CPP_ABSTRACT_DATA_BASE_DETAILS_CRC_TYPES_HPP__)
# define __CPP_ABSTRACT_DATA_BASE_DETAILS_CRC_TYPES_HPP__
#include <boost/crc.hpp>
namespace CppAbstractDataBase { namespace Details {
typedef boost::crc_32_type tCrcAlgorithm;
} /// end namespace Details
typedef Details::tCrcAlgorithm::value_type tCr... | 33.076923 | 62 | 0.832558 | AntonPoturaev |
dd08d346ce941191c315e37a554d85af48b33e05 | 32,801 | cpp | C++ | tracer/src/Datadog.Trace.ClrProfiler.Native/always_on_profiler.cpp | Kielek/signalfx-dotnet-tracing | 80c65ca936748788629287472401fa9f31b79410 | [
"Apache-2.0"
] | null | null | null | tracer/src/Datadog.Trace.ClrProfiler.Native/always_on_profiler.cpp | Kielek/signalfx-dotnet-tracing | 80c65ca936748788629287472401fa9f31b79410 | [
"Apache-2.0"
] | 2 | 2022-02-10T06:13:13.000Z | 2022-02-17T01:31:15.000Z | tracer/src/Datadog.Trace.ClrProfiler.Native/always_on_profiler.cpp | Kielek/signalfx-dotnet-tracing | 80c65ca936748788629287472401fa9f31b79410 | [
"Apache-2.0"
] | null | null | null | // We want to use std::min, not the windows.h macro
#define NOMINMAX
#include "always_on_profiler.h"
#include "logger.h"
#include <chrono>
#include <map>
#include <algorithm>
#ifndef _WIN32
#include <pthread.h>
#include <codecvt>
#endif
constexpr auto kMaxStringLength = 512UL;
constexpr auto kMaxCodesPerBuffer = ... | 36.649162 | 161 | 0.637176 | Kielek |
dd094ffbce2847e2b78b31337b526a123f35b8f3 | 183 | hpp | C++ | include/net/http/client/curl_native.hpp | francisfsjiang/libjstack | 2ffdd7f953f30edf6755cc53260e744ca0fad451 | [
"MIT"
] | 10 | 2015-03-19T04:41:21.000Z | 2016-03-24T13:58:15.000Z | include/net/http/client/curl_native.hpp | francisfsjiang/Abathur | 2ffdd7f953f30edf6755cc53260e744ca0fad451 | [
"MIT"
] | 2 | 2021-08-07T11:47:07.000Z | 2021-09-05T04:35:37.000Z | include/net/http/client/curl_native.hpp | francisfsjiang/Abathur | 2ffdd7f953f30edf6755cc53260e744ca0fad451 | [
"MIT"
] | 3 | 2015-03-20T11:57:16.000Z | 2017-01-24T03:47:50.000Z |
#ifndef LIBJSTACK_CURL_NATIVE_HPP
#define LIBJSTACK_CURL_NATIVE_HPP
namespace libjstack::net::http::curl_native {
#include <curl/curl.h>
}
#endif //LIBJSTACK_CURL_NATIVE_HPP
| 15.25 | 45 | 0.786885 | francisfsjiang |
dd0bd28ad4978de4a81b7644bb52f95d53aa12d6 | 429 | cpp | C++ | Codeforces/262A-Roma and Lucky Numbers/262A-Roma and Lucky Numbers.cpp | alielsokary/Competitive-programming | 7dffaa334e18c61c8a7985f5bbb64e3613d1008b | [
"MIT"
] | null | null | null | Codeforces/262A-Roma and Lucky Numbers/262A-Roma and Lucky Numbers.cpp | alielsokary/Competitive-programming | 7dffaa334e18c61c8a7985f5bbb64e3613d1008b | [
"MIT"
] | null | null | null | Codeforces/262A-Roma and Lucky Numbers/262A-Roma and Lucky Numbers.cpp | alielsokary/Competitive-programming | 7dffaa334e18c61c8a7985f5bbb64e3613d1008b | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int n, k,a[100000], b[100000], x, cnt,cnt2;
int main()
{
cin>>n>>k;
for (int i = 0; i < n; i++) {
cin>>a[i];
x = a[i];
while(x>0){
int tmp = x%10;
x/= 10;
if(tmp == 7 || tmp == 4)
cnt++;
}
b[i] = cnt;
cnt = 0;
}
f... | 13 | 43 | 0.398601 | alielsokary |
dd10ec2db2b80310b1733d3f2daaad6d0308a38d | 1,104 | hpp | C++ | MLPP/BernoulliNB/BernoulliNB.hpp | KangLin/MLPP | abd2dba6076c98aa2e1c29fb3198b74a3f28f8fe | [
"MIT"
] | 927 | 2021-12-03T07:02:25.000Z | 2022-03-30T07:37:23.000Z | MLPP/BernoulliNB/BernoulliNB.hpp | DJofOUC/MLPP | 6940fc1fbcb1bc16fe910c90a32d9e4db52e264f | [
"MIT"
] | 7 | 2022-02-13T22:38:08.000Z | 2022-03-07T01:00:32.000Z | MLPP/BernoulliNB/BernoulliNB.hpp | DJofOUC/MLPP | 6940fc1fbcb1bc16fe910c90a32d9e4db52e264f | [
"MIT"
] | 132 | 2022-01-13T02:19:04.000Z | 2022-03-23T19:23:56.000Z | //
// BernoulliNB.hpp
//
// Created by Marc Melikyan on 1/17/21.
//
#ifndef BernoulliNB_hpp
#define BernoulliNB_hpp
#include <vector>
#include <map>
namespace MLPP{
class BernoulliNB{
public:
BernoulliNB(std::vector<std::vector<double>> inputSet, std::vector<double> outputSet);
... | 23.489362 | 98 | 0.505435 | KangLin |
dd130a931a0c27414f70b43818c607c5e21b315d | 503 | cpp | C++ | src/qwelk.cpp | raincheque/qwelk | e78ee0ccf7a7f1af91d823d0563b0af360933237 | [
"MIT"
] | 25 | 2017-11-22T13:48:05.000Z | 2021-12-29T05:49:01.000Z | src/qwelk.cpp | netboy3/qwelk-vcvrack-plugins | e78ee0ccf7a7f1af91d823d0563b0af360933237 | [
"MIT"
] | 12 | 2017-11-20T20:45:27.000Z | 2021-12-08T20:35:06.000Z | src/qwelk.cpp | netboy3/qwelk-vcvrack-plugins | e78ee0ccf7a7f1af91d823d0563b0af360933237 | [
"MIT"
] | 4 | 2018-01-11T21:02:12.000Z | 2019-09-29T12:32:50.000Z | #include "qwelk.hpp"
Plugin *pluginInstance;
void init(rack::Plugin *p) {
pluginInstance = p;
p->addModel(modelAutomaton);
p->addModel(modelByte);
p->addModel(modelChaos);
p->addModel(modelColumn);
p->addModel(modelGate);
p->addModel(modelOr);
p->addModel(modelNot);
p->addModel(m... | 21.869565 | 32 | 0.652087 | raincheque |
dd1390f4214bcff6805ff06e973499feb4bc1223 | 4,040 | cpp | C++ | modules/core/src/MetaObject/core/detail/Time.cpp | dtmoodie/MetaObject | 8238d143d578ff9c0c6506e7e627eca15e42369e | [
"MIT"
] | 2 | 2017-10-26T04:41:49.000Z | 2018-02-09T05:12:19.000Z | modules/core/src/MetaObject/core/detail/Time.cpp | dtmoodie/MetaObject | 8238d143d578ff9c0c6506e7e627eca15e42369e | [
"MIT"
] | null | null | null | modules/core/src/MetaObject/core/detail/Time.cpp | dtmoodie/MetaObject | 8238d143d578ff9c0c6506e7e627eca15e42369e | [
"MIT"
] | 3 | 2017-01-08T21:09:48.000Z | 2018-02-10T04:27:32.000Z | #include "Time.hpp"
#include <iomanip>
#include <sstream>
namespace mo
{
static Time::GetTime_f time_source = nullptr;
Time Time::now()
{
if (time_source)
{
return time_source();
}
return std::chrono::high_resolution_clock::now();
}
void Time::setTimeSou... | 23.352601 | 95 | 0.490594 | dtmoodie |
dd169e862e5831092be13e9aa1a2b62c61c269be | 2,859 | cpp | C++ | src/disp/Module.cpp | LegalizeAdulthood/cimple | 5ec70784f2ee3e455a2258f82b07c0dacccb4093 | [
"MIT"
] | 4 | 2015-12-16T06:43:14.000Z | 2020-01-24T06:05:47.000Z | src/disp/Module.cpp | LegalizeAdulthood/cimple | 5ec70784f2ee3e455a2258f82b07c0dacccb4093 | [
"MIT"
] | null | null | null | src/disp/Module.cpp | LegalizeAdulthood/cimple | 5ec70784f2ee3e455a2258f82b07c0dacccb4093 | [
"MIT"
] | null | null | null | /*
**==============================================================================
**
** Copyright (c) 2003, 2004, 2005, 2006, Michael Brasher, Karl Schopmeyer
**
** Permission is hereby granted, free of charge, to any person obtaining a
** copy of this software and associated documentation files (the "Software"),
** ... | 25.526786 | 80 | 0.637636 | LegalizeAdulthood |
dd1985b492652c976d8a4d3e6f07cc0be30b3ed4 | 1,799 | cpp | C++ | tree/medium/145.BinaryTreePostorderTraversal.cpp | XiaotaoGuo/Leetcode-Solution-In-Cpp | 8e01e35c742a7afb0c8cdd228a6a5e564375434e | [
"Apache-2.0"
] | null | null | null | tree/medium/145.BinaryTreePostorderTraversal.cpp | XiaotaoGuo/Leetcode-Solution-In-Cpp | 8e01e35c742a7afb0c8cdd228a6a5e564375434e | [
"Apache-2.0"
] | null | null | null | tree/medium/145.BinaryTreePostorderTraversal.cpp | XiaotaoGuo/Leetcode-Solution-In-Cpp | 8e01e35c742a7afb0c8cdd228a6a5e564375434e | [
"Apache-2.0"
] | null | null | null | /*
* @lc app=leetcode id=145 lang=cpp
*
* [145] Binary Tree Postorder Traversal
*
* https://leetcode.com/problems/binary-tree-postorder-traversal/description/
*
* algorithms
* Medium (55.73%)
* Likes: 2082
* Dislikes: 104
* Total Accepted: 415.3K
* Total Submissions: 742.6K
* Testcase Example: '[1,n... | 16.657407 | 77 | 0.566982 | XiaotaoGuo |
dd1a7e577104f752756106fe37dbb18b33216096 | 15,684 | cpp | C++ | kwm/axlib/application.cpp | a-morales/kwm | 2ee8078616d5a37287aeb7c5b20f0dba982b19ed | [
"MIT"
] | 13 | 2020-06-30T09:48:28.000Z | 2022-03-29T04:42:54.000Z | kwm/axlib/application.cpp | a-morales/kwm | 2ee8078616d5a37287aeb7c5b20f0dba982b19ed | [
"MIT"
] | null | null | null | kwm/axlib/application.cpp | a-morales/kwm | 2ee8078616d5a37287aeb7c5b20f0dba982b19ed | [
"MIT"
] | 3 | 2020-02-16T00:57:05.000Z | 2022-03-13T23:50:08.000Z | #include "application.h"
#include "element.h"
#include "sharedworkspace.h"
#include "event.h"
#include "display.h"
#include "axlib.h"
#define internal static
#define local_persist static
enum ax_application_notifications
{
AXApplication_Notification_WindowCreated,
AXApplication_Notification_WindowFocused,
... | 38.253659 | 161 | 0.672533 | a-morales |
dd1b4f199dfec33ec5d15fefe4cfa47258fe1744 | 925 | cpp | C++ | ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | Mogikan/OpenMP | 7fa130159dfb32a9885c31b2c4e36de4ef36fa44 | [
"Apache-2.0"
] | null | null | null | ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | Mogikan/OpenMP | 7fa130159dfb32a9885c31b2c4e36de4ef36fa44 | [
"Apache-2.0"
] | null | null | null | ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | Mogikan/OpenMP | 7fa130159dfb32a9885c31b2c4e36de4ef36fa44 | [
"Apache-2.0"
] | null | null | null | // ConsoleApplication1.cpp : Defines the entry point for the console application.
//
#pragma once;
#include "stdafx.h"
#include <list>
#include <iostream>
using namespace std;
int main()
{
std::list<int> intlist;
for (int i = 0; i < 10; i++)
{
intlist.push_back(i);
}
std::list<int>::iterator iterator,iterator... | 18.877551 | 101 | 0.632432 | Mogikan |
dd1f71ee6a148aa7a853aad610459efc653d3a84 | 2,428 | cpp | C++ | src/token.cpp | JevinJ/ConnectFour | 3e131c9ff957c3ca108b6f79e8940ba3ae40e8d4 | [
"MIT"
] | null | null | null | src/token.cpp | JevinJ/ConnectFour | 3e131c9ff957c3ca108b6f79e8940ba3ae40e8d4 | [
"MIT"
] | null | null | null | src/token.cpp | JevinJ/ConnectFour | 3e131c9ff957c3ca108b6f79e8940ba3ae40e8d4 | [
"MIT"
] | null | null | null | /*
* token.cpp
*
* Created on: Dec 24, 2017
* Author: Jevin
*/
#include <iostream>
#include "config.hpp"
#include "token.hpp"
#include "resourcemanager.hpp"
Token::Token() :
x_pos(0),
y_pos(0) {
model.setRadius(TOKEN_RADIUS);
model.setTexture(&resource_manager.textures[Textures::To... | 24.039604 | 107 | 0.669275 | JevinJ |
dd22ffc5f1053df295a6743345308994cf239cd1 | 26,682 | cpp | C++ | src/app/GameView.cpp | Daivuk/ggj16 | 0ba896f3b6ece32ed3a6e190825e53e88f666d5e | [
"MIT"
] | null | null | null | src/app/GameView.cpp | Daivuk/ggj16 | 0ba896f3b6ece32ed3a6e190825e53e88f666d5e | [
"MIT"
] | null | null | null | src/app/GameView.cpp | Daivuk/ggj16 | 0ba896f3b6ece32ed3a6e190825e53e88f666d5e | [
"MIT"
] | 1 | 2019-10-19T04:49:33.000Z | 2019-10-19T04:49:33.000Z | #include "GameView.h"
#include "Player.h"
#include "TiledMapNode.h"
#include "Fireplace.h"
#include "DanceSequence.h"
#include "LightLayer.h"
#include "Tree.h"
#include "Rock.h"
#include "MusicEmitter.h"
#include "DancePedestral.h"
#include "Monster.h"
#include "BloodLayer.h"
#include "Stockpile.h"
#include "Stone.h"
#... | 26.602193 | 174 | 0.574395 | Daivuk |
dd292d6b7460b7bfbd4c2503f5f32bd4bfff325f | 8,898 | cpp | C++ | AVSGatewayManager/test/AVSGatewayManagerTest.cpp | rysmith0315/avs-device-sdk | f0fa55856af9e33d0889ac14820efbb807341f17 | [
"Apache-2.0"
] | null | null | null | AVSGatewayManager/test/AVSGatewayManagerTest.cpp | rysmith0315/avs-device-sdk | f0fa55856af9e33d0889ac14820efbb807341f17 | [
"Apache-2.0"
] | null | null | null | AVSGatewayManager/test/AVSGatewayManagerTest.cpp | rysmith0315/avs-device-sdk | f0fa55856af9e33d0889ac14820efbb807341f17 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2019 Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0/
*
* or in the "licen... | 35.73494 | 119 | 0.764329 | rysmith0315 |
dd2b3a0606d4f086cfcdd028231cd9711e51406e | 1,496 | cpp | C++ | Breakout/laser.cpp | henry9836/Space-Invaders | 75a3c530589c3a0b6f207e6fd2bbcaad9c9f6c98 | [
"MIT"
] | null | null | null | Breakout/laser.cpp | henry9836/Space-Invaders | 75a3c530589c3a0b6f207e6fd2bbcaad9c9f6c98 | [
"MIT"
] | null | null | null | Breakout/laser.cpp | henry9836/Space-Invaders | 75a3c530589c3a0b6f207e6fd2bbcaad9c9f6c98 | [
"MIT"
] | null | null | null | //
// Bachelor of Software Engineering
// Media Design School
// Auckland
// New Zealand
//
// (c) 2018 Media Design School.
//
// File Name : laser.cpp
// Description : controls lasers
// Author : Henry Oliver
// Mail : henry.oliver@mediadesign.school.nz
//
// Library Includes
// Local Includes
#... | 13.724771 | 66 | 0.645053 | henry9836 |
dd2d3aa721bd507c5401bafa86e2ff70669e61da | 3,478 | cpp | C++ | source/launch.cpp | mvandevander/SpechtCMDLauncher | 692c6acec43f6c91a63edce8094be8c18ad677ab | [
"MIT"
] | 1 | 2022-02-09T01:14:25.000Z | 2022-02-09T01:14:25.000Z | source/launch.cpp | mvandevander/SpechtCMDLauncher | 692c6acec43f6c91a63edce8094be8c18ad677ab | [
"MIT"
] | null | null | null | source/launch.cpp | mvandevander/SpechtCMDLauncher | 692c6acec43f6c91a63edce8094be8c18ad677ab | [
"MIT"
] | null | null | null | // Launch.cpp is a command line utilitiy for launching Applications without
// a .bat script from a config file
// TODO: Write my own token parsing, and compare
#include <cstdio>
#include <stdlib.h>
#include "SpechtStringLib.cpp"
#define internal static
#define local_persist static
#define global_variable static
str... | 25.021583 | 92 | 0.591432 | mvandevander |
dd306cf223ff136818dd3c8b1a7dc37e82d3d7cc | 8,356 | cc | C++ | testing/mystrlen_test_multi_event.cc | jasonspencer/CPP_LPE_wrap | b4b20b730cb04d91c665314aa805cfce4f3ddf35 | [
"Apache-2.0"
] | 1 | 2020-08-10T21:35:14.000Z | 2020-08-10T21:35:14.000Z | testing/mystrlen_test_multi_event.cc | jasonspencer/CPP_LPE_wrap | b4b20b730cb04d91c665314aa805cfce4f3ddf35 | [
"Apache-2.0"
] | null | null | null | testing/mystrlen_test_multi_event.cc | jasonspencer/CPP_LPE_wrap | b4b20b730cb04d91c665314aa805cfce4f3ddf35 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <sstream>
#include <cstring> // std strlen
#include <functional>
#include <memory>
#include <jsplib/perf/PerfEventCount.hh>
#include <jsplib/perf/ScopedEventTrigger.hh>
#include <jsplib/perf/WallTimeEvent.hh>
#ifndef TOTALSTRINGLENGTH
#define TOTALSTRINGLENGTH (1<<30)
#endif
// g++ -O3 -... | 43.978947 | 226 | 0.640618 | jasonspencer |
dd30ba1707c087832ab694c9fc294b4c3a359ab5 | 1,353 | cpp | C++ | 线性表/顺序实现大题/P19.5.cpp | Ruvikm/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | 103 | 2021-01-07T13:03:57.000Z | 2022-03-31T03:10:35.000Z | 线性表/顺序实现大题/P19.5.cpp | fu123567/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | null | null | null | 线性表/顺序实现大题/P19.5.cpp | fu123567/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | 23 | 2021-04-10T07:53:03.000Z | 2022-03-31T00:33:05.000Z | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#pragma region 建立顺序存储的线性表
#define MAX 30
#define _for(i,a,b) for( int i=(a); i<(b); ++i)
#define _rep(i,a,b) for( int i=(a); i<=(b); ++i)
typedef struct {
int data[MAX];
int length;
}List;
void swap(int& a, int& b) {
int t;
t = a;... | 17.802632 | 56 | 0.574279 | Ruvikm |
dd400b2b4d4bd9ccb7aac503d7135a31cfdc8598 | 3,046 | cpp | C++ | PareidoliaCL/pattern.cpp | cpkt9762/PareidoliaTriggerbot | fdd98d4fc31fa6dec60176c87264705ddff8a3e8 | [
"MIT"
] | 21 | 2019-11-05T10:21:39.000Z | 2022-03-27T09:07:26.000Z | PareidoliaCL/pattern.cpp | blackhades00/PareidoliaTriggerbot | fdd98d4fc31fa6dec60176c87264705ddff8a3e8 | [
"MIT"
] | null | null | null | PareidoliaCL/pattern.cpp | blackhades00/PareidoliaTriggerbot | fdd98d4fc31fa6dec60176c87264705ddff8a3e8 | [
"MIT"
] | 18 | 2019-11-03T13:55:50.000Z | 2022-03-27T09:07:27.000Z | /*++
Copyright (c) 2019 changeofpace. All rights reserved.
Use of this source code is governed by the MIT license. See the 'LICENSE' file
for more information.
--*/
#include "pattern.h"
#include "log.h"
#include "ntdll.h"
_Use_decl_annotations_
BOOL
PtnFindPatternUnique(
PVOID pBaseAddress,
SIZE_T cbSear... | 21.602837 | 78 | 0.587656 | cpkt9762 |
dd45fb34e2674257c2cc5f5bb9b285324a86752b | 2,562 | cc | C++ | tests&old_stuff/old tests/learning by doing/cache - Copy.cc | reiss-josh/RESTful_memcache | 40a21020cd3830c9e11b075039cb7a3b760ac0ad | [
"MIT"
] | 1 | 2019-05-02T21:47:15.000Z | 2019-05-02T21:47:15.000Z | tests&old_stuff/old tests/learning by doing/cache - Copy.cc | reiss-josh/RESTful_memcache | 40a21020cd3830c9e11b075039cb7a3b760ac0ad | [
"MIT"
] | null | null | null | tests&old_stuff/old tests/learning by doing/cache - Copy.cc | reiss-josh/RESTful_memcache | 40a21020cd3830c9e11b075039cb7a3b760ac0ad | [
"MIT"
] | 1 | 2018-10-08T06:04:44.000Z | 2018-10-08T06:04:44.000Z | #include <cache.hh>
#include <iostream>
struct Cache::Impl {
private:
index_type memused_;
evictor_type evictor_;
hash_func hasher_;
index_type maxmem_;
public:
/*Impl(index_type maxmem, evictor_type evictor, hash_func hasher)
: maxmem_(maxmem), evictor_(evictor), hasher_(hasher), memused_(0)
{
}
~Impl() = ... | 22.875 | 78 | 0.703357 | reiss-josh |
dd493e03d27603d239c22a07eed05f382237c86c | 2,357 | hpp | C++ | queue.hpp | praktikum-tiunpad-2021/tugas-08a-AriqHakim | 8e0fdb0e61830928704aeb4756c8fc4413674e1a | [
"MIT"
] | null | null | null | queue.hpp | praktikum-tiunpad-2021/tugas-08a-AriqHakim | 8e0fdb0e61830928704aeb4756c8fc4413674e1a | [
"MIT"
] | null | null | null | queue.hpp | praktikum-tiunpad-2021/tugas-08a-AriqHakim | 8e0fdb0e61830928704aeb4756c8fc4413674e1a | [
"MIT"
] | null | null | null | #pragma once
namespace strukdat {
namespace priority_queue {
/**
* @brief Implementasi struct untuk elemen, harus ada isi dan prioritas elemen.
*/
template <typename T>
struct Element {
T data;
int priority;
Element* next;
};
template <typename T>
using ElementPtr = Element<T> *;
/**
* @brief implemetasi ... | 20.318966 | 79 | 0.600764 | praktikum-tiunpad-2021 |
dd506a0fa0bac06cc2667e0cb814f0f8d55a42fa | 4,039 | cpp | C++ | src/GeneralSettingsPage.cpp | lingnand/Helium | d1f8fab6eb5d60e35b3287f6ea35cd1fae71f816 | [
"BSD-3-Clause"
] | 8 | 2021-04-16T02:05:54.000Z | 2022-03-16T13:56:23.000Z | src/GeneralSettingsPage.cpp | lingnand/Helium | d1f8fab6eb5d60e35b3287f6ea35cd1fae71f816 | [
"BSD-3-Clause"
] | null | null | null | src/GeneralSettingsPage.cpp | lingnand/Helium | d1f8fab6eb5d60e35b3287f6ea35cd1fae71f816 | [
"BSD-3-Clause"
] | 2 | 2021-04-17T10:49:58.000Z | 2021-07-21T20:39:52.000Z | /*
* GeneralSettingsPage.cpp
*
* Created on: May 25, 2015
* Author: lingnan
*/
#include <bb/cascades/TitleBar>
#include <bb/cascades/Picker>
#include <bb/cascades/Label>
#include <bb/cascades/DropDown>
#include <bb/cascades/Option>
#include <bb/cascades/Divider>
#include <bb/cascades/ScrollView>
#include <b... | 38.103774 | 129 | 0.732359 | lingnand |
dd53cab832213078acd8b3f185a44673d7be4aa8 | 1,213 | cpp | C++ | src/gasdev.cpp | atyre2/HABITAT | bbf231fcfe48cb11b27117266bfc85f427225414 | [
"MIT"
] | null | null | null | src/gasdev.cpp | atyre2/HABITAT | bbf231fcfe48cb11b27117266bfc85f427225414 | [
"MIT"
] | 2 | 2019-03-29T22:15:17.000Z | 2019-03-29T22:15:50.000Z | src/gasdev.cpp | atyre2/HABITAT | bbf231fcfe48cb11b27117266bfc85f427225414 | [
"MIT"
] | null | null | null | #include <math.h>
#include "mt19937.h"
#include "util2019.h"
#include "gasdev.h"
//---------------------------------------------------------------------------
/* Returns a normally distributed deviate with zero mean and unit variance,
using ran1(idum) as the source of uniform deviates. Taken from
numerical recipe... | 25.270833 | 77 | 0.589448 | atyre2 |
dd560ca786c1e4570e39164b58b3757dc29a169f | 8,459 | hpp | C++ | include/rabbit/graphics/graphics.hpp | demurzasty/rabb | f980fd18332f7846cd22b502f1075d224938379c | [
"MIT"
] | 8 | 2020-11-21T17:59:09.000Z | 2022-02-13T05:14:40.000Z | include/rabbit/graphics/graphics.hpp | demurzasty/rabb | f980fd18332f7846cd22b502f1075d224938379c | [
"MIT"
] | null | null | null | include/rabbit/graphics/graphics.hpp | demurzasty/rabb | f980fd18332f7846cd22b502f1075d224938379c | [
"MIT"
] | 1 | 2020-11-23T23:01:14.000Z | 2020-11-23T23:01:14.000Z | #pragma once
#include "viewport.hpp"
#include "environment.hpp"
#include "texture.hpp"
#include "material.hpp"
#include "mesh.hpp"
#include "../components/transform.hpp"
#include "../components/camera.hpp"
#include "../components/geometry.hpp"
#include "../components/light.hpp"
#include <memory>
names... | 39.713615 | 202 | 0.747488 | demurzasty |
dd581e2a7cdf51648dd61510b5f7a625d1cf573f | 1,076 | cpp | C++ | games/jungle_chess/impl/jungle_chess.cpp | JacobFischer/Joueur.cpp | 673fce574ca80fb8f02777e610884a1c9808501d | [
"MIT"
] | 1 | 2015-08-09T01:29:34.000Z | 2015-08-09T01:29:34.000Z | games/jungle_chess/impl/jungle_chess.cpp | JacobFischer/Joueur.cpp | 673fce574ca80fb8f02777e610884a1c9808501d | [
"MIT"
] | null | null | null | games/jungle_chess/impl/jungle_chess.cpp | JacobFischer/Joueur.cpp | 673fce574ca80fb8f02777e610884a1c9808501d | [
"MIT"
] | null | null | null | // DO NOT MODIFY THIS FILE
// Never try to directly create an instance of this class, or modify its member variables.
// This contains implementation details, written by code, and only useful to code
#include "jungle_chess.hpp"
#include "../../../joueur/src/register.hpp"
#include "../../../joueur/src/exceptions.hpp"
... | 25.619048 | 94 | 0.67658 | JacobFischer |
e57b35cd99acac58fcd73cc73f21a74700c4d32b | 26,109 | cpp | C++ | src/pmp/algorithms/SurfaceRemeshing.cpp | choyfung/pmp-library | 4a72c918494dac92f5e77545b71c7a327dafe71e | [
"BSD-3-Clause"
] | 1 | 2020-05-21T04:15:44.000Z | 2020-05-21T04:15:44.000Z | src/pmp/algorithms/SurfaceRemeshing.cpp | choyfung/pmp-library | 4a72c918494dac92f5e77545b71c7a327dafe71e | [
"BSD-3-Clause"
] | null | null | null | src/pmp/algorithms/SurfaceRemeshing.cpp | choyfung/pmp-library | 4a72c918494dac92f5e77545b71c7a327dafe71e | [
"BSD-3-Clause"
] | 1 | 2020-05-21T04:15:52.000Z | 2020-05-21T04:15:52.000Z | //=============================================================================
// Copyright (C) 2011-2018 The pmp-library developers
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source ... | 30.608441 | 87 | 0.423724 | choyfung |
e57d51693282e2a2a352ae9e8b9c07fe816cb123 | 1,889 | cpp | C++ | src/earconverter.cpp | jodavaho/earth_coords | f964f5e85749eb3a0ab5170bd6b15a871ecf6b27 | [
"MIT"
] | null | null | null | src/earconverter.cpp | jodavaho/earth_coords | f964f5e85749eb3a0ab5170bd6b15a871ecf6b27 | [
"MIT"
] | null | null | null | src/earconverter.cpp | jodavaho/earth_coords | f964f5e85749eb3a0ab5170bd6b15a871ecf6b27 | [
"MIT"
] | null | null | null | /*
* earconverter.cpp
*
* Created on: Mar 26, 2011
* Author: joshua
*/
#include <EarthCoords/EarthCoords.h>
#include <stdio.h>
#include <stdlib.h>
using namespace RSN;
int main(int argc, char** argv){
if (argc==1){
}
EarthCoords e;
double x,y;
for (int i=1;i<argc;i+=2){
if (strcmp("-h",argv[i])==0)... | 25.527027 | 53 | 0.60667 | jodavaho |
e585a602837d0026215acd3613baf037690a2eba | 15,276 | cc | C++ | util.cc | jkominek/fdbfs | 0a347cc63f99428ff37348486a29b11ea13d9292 | [
"0BSD"
] | 12 | 2019-09-11T09:32:31.000Z | 2022-01-14T05:26:38.000Z | util.cc | jkominek/fdbfs | 0a347cc63f99428ff37348486a29b11ea13d9292 | [
"0BSD"
] | 18 | 2019-12-17T22:32:01.000Z | 2022-03-14T06:03:15.000Z | util.cc | jkominek/fdbfs | 0a347cc63f99428ff37348486a29b11ea13d9292 | [
"0BSD"
] | null | null | null | #include "util.h"
#include <strings.h>
#include <stdio.h>
#include <time.h>
#include <ctype.h>
#ifdef LZ4_BLOCK_COMPRESSION
#include <lz4.h>
#endif
#ifdef ZSTD_BLOCK_COMPRESSION
#include <zstd.h>
#endif
#include "values.pb.h"
struct fdbfs_filehandle **extract_fdbfs_filehandle(struct fuse_file_info *fi)
{
static_... | 30.613226 | 108 | 0.661364 | jkominek |
e5870aeafd1ec110394b6da4a5100249254e5468 | 3,513 | hpp | C++ | inc/Alphabet.hpp | esaliya/lbl.pisa | 1846075d84021303f3971534b0ea830845b0cb9e | [
"BSD-3-Clause-LBNL"
] | 4 | 2020-08-19T17:48:00.000Z | 2021-06-17T14:39:48.000Z | inc/Alphabet.hpp | esaliya/lbl.pisa | 1846075d84021303f3971534b0ea830845b0cb9e | [
"BSD-3-Clause-LBNL"
] | 4 | 2020-08-14T16:43:20.000Z | 2020-08-21T01:03:01.000Z | inc/Alphabet.hpp | PASSIONLab/PASTIS | 1846075d84021303f3971534b0ea830845b0cb9e | [
"BSD-3-Clause-LBNL"
] | null | null | null | // Created by Saliya Ekanayake on 1/22/19.
#pragma once
#include <cstring>
#include <string>
namespace
pastis
{
class
Alphabet
{
public:
enum type {PROTEIN, DNA};
static const unsigned short capacity = 128;
std::string letters;
unsigned short size;
unsigned short max_char;
unsigned char char_... | 15.683036 | 71 | 0.568745 | esaliya |
e58b0e4981e854b2a38992b0e1c156da04817a83 | 2,803 | cpp | C++ | OcularCore/src/Math/Random/CMWC.cpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 8 | 2017-01-27T01:06:06.000Z | 2020-11-05T20:23:19.000Z | OcularCore/src/Math/Random/CMWC.cpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 39 | 2016-06-03T02:00:36.000Z | 2017-03-19T17:47:39.000Z | OcularCore/src/Math/Random/CMWC.cpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 4 | 2019-05-22T09:13:36.000Z | 2020-12-01T03:17:45.000Z | /**
* Copyright 2014-2017 Steven T Sell (ssell@vertexfragment.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 requir... | 32.218391 | 92 | 0.351052 | ssell |
e5966c7d7338e04d4f35ac22fbc1ffb55193646b | 5,159 | hpp | C++ | lib/include/interlinck/Core/Syntax/SyntaxVariant.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | null | null | null | lib/include/interlinck/Core/Syntax/SyntaxVariant.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | 50 | 2021-06-30T20:01:50.000Z | 2021-11-28T16:21:26.000Z | lib/include/interlinck/Core/Syntax/SyntaxVariant.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | null | null | null | #ifndef INTERLINCK_CORE_SYNTAX_SYNTAXVARIANT_H
#define INTERLINCK_CORE_SYNTAX_SYNTAXVARIANT_H
#include <cassert>
#include <bitset>
#include "interlinck/interlinck_global.hpp"
namespace interlinck::Core::Syntax
{
class ISyntaxNode;
class ISyntaxToken;
class ISyntaxTrivia;
namespace _detail
{
constexpr std::bitset<4... | 35.826389 | 110 | 0.680364 | henrikfroehling |
e5a369b4ae18d3d951e5b1a3df8be196edd99fae | 11,443 | cpp | C++ | src/mesh.cpp | ddrevicky/cpu-renderer | 445e467377558e9a42bd32feac74c517e55e60be | [
"MIT"
] | 4 | 2019-03-18T18:44:02.000Z | 2022-01-17T17:16:51.000Z | src/mesh.cpp | ddrevicky/cpu-renderer | 445e467377558e9a42bd32feac74c517e55e60be | [
"MIT"
] | null | null | null | src/mesh.cpp | ddrevicky/cpu-renderer | 445e467377558e9a42bd32feac74c517e55e60be | [
"MIT"
] | 1 | 2019-03-18T18:44:22.000Z | 2019-03-18T18:44:22.000Z | #include "mesh.h"
#include "common.h"
#include "bunny.h"
using glm::normalize;
using glm::vec2;
using glm::vec3;
using glm::vec4;
#define PI 3.14159265358979323846264338327950f
Mesh UtilMesh::MakeBunnyMesh()
{
Mesh mesh = {};
mesh.isTexturable = false;
mesh.vertexCount = 0;
mesh.vertices = (Vertex *)malloc(2092 ... | 37.273616 | 138 | 0.585336 | ddrevicky |
e5aaeca79a571acefdb4e26a65da167153685c47 | 1,968 | cpp | C++ | code archive/CF/734E.cpp | brianbbsu/program | c4505f2b8c0b91010e157db914a63c49638516bc | [
"MIT"
] | 4 | 2018-04-08T08:07:58.000Z | 2021-06-07T14:55:24.000Z | code archive/CF/734E.cpp | brianbbsu/program | c4505f2b8c0b91010e157db914a63c49638516bc | [
"MIT"
] | null | null | null | code archive/CF/734E.cpp | brianbbsu/program | c4505f2b8c0b91010e157db914a63c49638516bc | [
"MIT"
] | 1 | 2018-10-29T12:37:25.000Z | 2018-10-29T12:37:25.000Z | //{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef bri... | 24.296296 | 123 | 0.57876 | brianbbsu |
e5adb9ceed8b97daf62b23a84f53f6e01f287334 | 479 | cpp | C++ | question_solution/first_time/1027.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | 1 | 2020-09-24T13:35:45.000Z | 2020-09-24T13:35:45.000Z | question_solution/first_time/1027.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | null | null | null | question_solution/first_time/1027.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | null | null | null | #include <cstdio>
int a[110], len, s;
int pd(int x) {
len = 0;
int d= x;
while(x>0) {
len++;
a[len] = x%10;
x = x/10;
}
for(int i = 1;i<=len;i++) {
s= 0;
s = s + a[i]*a[i]*a[i];
}
if(s == d) {
return 0;
}
else {
return 1;
}
... | 15.966667 | 31 | 0.323591 | xiaoland |
e5aef649a03bb14be46c75d5a62ca98388714c65 | 431 | cc | C++ | examples/google-code-jam/BryceSandlund/Brattleship.cc | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | examples/google-code-jam/BryceSandlund/Brattleship.cc | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | examples/google-code-jam/BryceSandlund/Brattleship.cc | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
ll T;
cin >> T;
for (ll cs = 1; cs <= T; ++cs) {
ll R, C, W;
cin >> R >> C >> W;
ll moves = (C / W) * R;
if (C % W == 0) {
moves += W-1;
}
el... | 15.392857 | 48 | 0.37819 | rbenic-fer |
e5b421b796abba481ae71cd45ba2c0d4d745a0fa | 318 | hpp | C++ | TGEngine/TGEngine.hpp | ThePixly/TGEngine | aff5d5f42c3094dcc37253f4a3f5e09db560a4eb | [
"Apache-2.0"
] | null | null | null | TGEngine/TGEngine.hpp | ThePixly/TGEngine | aff5d5f42c3094dcc37253f4a3f5e09db560a4eb | [
"Apache-2.0"
] | null | null | null | TGEngine/TGEngine.hpp | ThePixly/TGEngine | aff5d5f42c3094dcc37253f4a3f5e09db560a4eb | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "Stdbase.hpp"
#include "App.hpp"
#include "pipeline/Pipeline.hpp"
#include "pipeline/Draw.hpp"
#include "game_content/Actor.hpp"
#include "game_content/Light.hpp"
#include "ui/UI.hpp"
SINCE(0, 0, 1)
void initTGEngine(Window* window, void(*draw)(IndexBuffer*, VertexBuffer*), void(*init)(void)); | 26.5 | 95 | 0.738994 | ThePixly |
e5bb03bacfe29c4c281d494bc99258f2a9f09872 | 1,253 | hpp | C++ | source/ashes/renderer/GlRenderer/Enum/GlQueryType.hpp | DragonJoker/Ashes | a6ed950b3fd8fb9626c60b4291fbd52ea75ac66e | [
"MIT"
] | 227 | 2018-09-17T16:03:35.000Z | 2022-03-19T02:02:45.000Z | source/ashes/renderer/GlRenderer/Enum/GlQueryType.hpp | DragonJoker/RendererLib | 0f8ad8edec1b0929ebd10247d3dd0a9ee8f8c91a | [
"MIT"
] | 39 | 2018-02-06T22:22:24.000Z | 2018-08-29T07:11:06.000Z | source/ashes/renderer/GlRenderer/Enum/GlQueryType.hpp | DragonJoker/Ashes | a6ed950b3fd8fb9626c60b4291fbd52ea75ac66e | [
"MIT"
] | 8 | 2019-05-04T10:33:32.000Z | 2021-04-05T13:19:27.000Z | /*
This file belongs to Ashes.
See LICENSE file in root folder
*/
#pragma once
#include <vector>
namespace ashes::gl
{
enum GlQueryType
: GLenum
{
GL_QUERY_TYPE_SAMPLES_PASSED = 0x8914,
GL_QUERY_TYPE_PRIMITIVES_GENERATED = 0x8C87,
GL_QUERY_TYPE_TIMESTAMP = 0x8E28,
GL_QUERY_TYPE_VERTICES_SUBMITTED = 0x82EE... | 29.833333 | 81 | 0.797287 | DragonJoker |
e5be320567ef32a0d2335e55d64601e871f424d5 | 3,101 | cpp | C++ | src/sysCommon/controller.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | 27 | 2021-09-28T00:33:11.000Z | 2021-11-18T19:38:40.000Z | src/sysCommon/controller.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | null | null | null | src/sysCommon/controller.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | null | null | null | #include "types.h"
/*
* --INFO--
* Address: ........
* Size: 00009C
*/
void _Error(char*, ...)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 0000F4
*/
void _Print(char*, ...)
{
// UNUSED FUNCTION
}
struct Controller {
u8 unknown00[0x20];
u32 _20;
u32 _24;
u32 _28;
u32 _2C;
u32 _30;... | 14.159817 | 74 | 0.537891 | doldecomp |
e5c03082b68d39e51789eef9b772f44eecc96c0c | 12,068 | hpp | C++ | join/network/include/join/protocol.hpp | mrabine/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | 1 | 2021-09-14T13:53:07.000Z | 2021-09-14T13:53:07.000Z | join/network/include/join/protocol.hpp | joinframework/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | 15 | 2021-08-09T23:55:02.000Z | 2021-11-22T11:05:41.000Z | join/network/include/join/protocol.hpp | 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, ... | 25.896996 | 81 | 0.545409 | mrabine |
e5c208de8521f1f39ff879baf31058d17db8e27c | 3,757 | cpp | C++ | board.cpp | marifdemirtas/minesweeper | 4e49692a4af8edf75673d6e53f8dfa5b8c715a8c | [
"MIT"
] | null | null | null | board.cpp | marifdemirtas/minesweeper | 4e49692a4af8edf75673d6e53f8dfa5b8c715a8c | [
"MIT"
] | null | null | null | board.cpp | marifdemirtas/minesweeper | 4e49692a4af8edf75673d6e53f8dfa5b8c715a8c | [
"MIT"
] | null | null | null | #include <iostream>
#include "board.h"
using namespace std;
/**
* Constructor
*/
Board::Board(int row_count, int col_count)
{
board = new int*[row_count];
for (int i = 0; i < row_count; i++){
board[i] = new int[col_count];
for (int j = 0; j < col_count; j++){
board[i][j] = 0;
... | 23.929936 | 85 | 0.438914 | marifdemirtas |
e5c6aa0df0c94138ef97000c6627cd6ee4f8501d | 1,259 | hpp | C++ | wrapper/stupid_iterator.hpp | TooBiased/growt | 8b6bb4052763351b8799c392f0573da3efdd1e34 | [
"BSD-2-Clause"
] | 79 | 2016-10-13T17:42:53.000Z | 2022-03-10T07:04:03.000Z | wrapper/stupid_iterator.hpp | TooBiased/growt | 8b6bb4052763351b8799c392f0573da3efdd1e34 | [
"BSD-2-Clause"
] | 8 | 2016-10-07T14:03:50.000Z | 2021-06-09T08:09:07.000Z | wrapper/stupid_iterator.hpp | TooBiased/growt | 8b6bb4052763351b8799c392f0573da3efdd1e34 | [
"BSD-2-Clause"
] | 11 | 2018-09-29T11:32:13.000Z | 2022-03-10T07:04:05.000Z | /*******************************************************************************
* wrapper/junction_wrapper.h
*
* Wrapper to use junction's junction::ConcurrentMap_... in our benchmarks
* use #define JUNCTION_TYPE junction::ConcurrentMap_Leapfrog to chose the table
*
* Part of Project growt - https://github.com/T... | 27.369565 | 80 | 0.559174 | TooBiased |
e5c717fff21c427d9df41750f33789951afb75cb | 4,427 | cpp | C++ | src/serial_port.cpp | NaokiTakahashi12/wit901c_rs485 | a78e724145e9f8267d60f17336b5f69296529fa9 | [
"MIT"
] | null | null | null | src/serial_port.cpp | NaokiTakahashi12/wit901c_rs485 | a78e724145e9f8267d60f17336b5f69296529fa9 | [
"MIT"
] | null | null | null | src/serial_port.cpp | NaokiTakahashi12/wit901c_rs485 | a78e724145e9f8267d60f17336b5f69296529fa9 | [
"MIT"
] | null | null | null |
#include <wit901c_rs485/serial_port.hpp>
#include <thread>
#include <chrono>
#include <Eigen/Dense>
#include <boost/system/error_code.hpp>
#include <boost/asio/io_service.hpp>
#include <boost/asio/serial_port.hpp>
#include <boost/asio/read.hpp>
#include <boost/asio/write.hpp>
namespace wit901c_rs485 {
class Se... | 31.621429 | 114 | 0.510052 | NaokiTakahashi12 |
e5c9444cde58149a53a5b2afd4155a8f065c0f25 | 707 | cpp | C++ | Baekjoon/13023.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | Baekjoon/13023.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | Baekjoon/13023.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int> > adj;
vector<bool> check;
int N, M, flag = 0;
void dfs(int cur, int cnt)
{
if (cnt == 4)
{
flag = 1;
return;
}
check[cur] = true;
int size = adj[cur].size();
for (int i = 0; i < size; i++)
{
int next = adj[cur][i];
if (!check... | 14.428571 | 34 | 0.547383 | Twinparadox |
e5d5e5f4b98658eac0cf2f141408f4f74f8db09a | 435 | cpp | C++ | src/OneKey/OneKey/HeroTask.cpp | xylsxyls/xueyelingshuan | 61eb1c7c4f76c3eaf4cf26e4b2b37b6ed2abc5b9 | [
"MIT"
] | 3 | 2019-11-26T05:33:47.000Z | 2020-05-18T06:49:41.000Z | src/OneKey/OneKey/HeroTask.cpp | xylsxyls/xueyelingshuan | 61eb1c7c4f76c3eaf4cf26e4b2b37b6ed2abc5b9 | [
"MIT"
] | null | null | null | src/OneKey/OneKey/HeroTask.cpp | xylsxyls/xueyelingshuan | 61eb1c7c4f76c3eaf4cf26e4b2b37b6ed2abc5b9 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "HeroTask.h"
#include "CKeyBoard/CKeyboardAPI.h"
#include "D:\\SendToMessageTest.h"
HeroTask::HeroTask():
m_code1(0),
m_code2(0)
{
}
void HeroTask::DoTask()
{
if (m_code1 != 0)
{
CKeyboard::KeyPress(m_code1, 0);
}
if (m_code2 != 0)
{
CKeyboard::KeyPress(m_cod... | 15 | 54 | 0.627586 | xylsxyls |
e5dfd1ad9efbc76565f94871afa3f79f020134bf | 914 | hpp | C++ | src/core/template.hpp | RamchandraApte/OmniTemplate | f150f451871b0ab43ac39a798186278106da1527 | [
"MIT"
] | 14 | 2019-04-23T21:44:12.000Z | 2022-03-04T22:48:59.000Z | src/core/template.hpp | RamchandraApte/OmniTemplate | f150f451871b0ab43ac39a798186278106da1527 | [
"MIT"
] | 3 | 2019-04-25T10:45:32.000Z | 2020-08-05T22:40:39.000Z | src/core/template.hpp | RamchandraApte/OmniTemplate | f150f451871b0ab43ac39a798186278106da1527 | [
"MIT"
] | 1 | 2020-07-16T22:16:33.000Z | 2020-07-16T22:16:33.000Z | #pragma once
#include "algebra/big_integer.hpp"
#include "algebra/fft.hpp"
#include "algebra/linear_algebra.hpp"
#include "algebra/polynomial.hpp"
#include "combinatorics/combinatorics.hpp"
#include "combinatorics/permutation.hpp"
#include "core/all.hpp"
#include "core/main.hpp"
#include "core/time.hpp"
#include "ds/bi... | 28.5625 | 42 | 0.76477 | RamchandraApte |
e5f049beca1fb78b70071000c1a814969e9b54a8 | 1,881 | cc | C++ | dohboy/src/settings.cc | connectiblutz/dohboy | 78601bf314e77bcb11970f8922cdc67f66857665 | [
"MIT"
] | null | null | null | dohboy/src/settings.cc | connectiblutz/dohboy | 78601bf314e77bcb11970f8922cdc67f66857665 | [
"MIT"
] | null | null | null | dohboy/src/settings.cc | connectiblutz/dohboy | 78601bf314e77bcb11970f8922cdc67f66857665 | [
"MIT"
] | null | null | null | #include "settings.h"
#include <bcl/fileutil.h>
namespace dohboy {
Settings Settings::instance;
void Settings::load(std::string& target, cJSON* config, const std::string& name) {
if (cJSON_HasObjectItem(config, name.c_str())) {
cJSON* tmp = cJSON_GetObjectItem(config, name.c_str());
if (tmp && cJSON_Is... | 32.431034 | 91 | 0.699628 | connectiblutz |
e5f4468cbcdbf312f931dbaf6546bf5c3ce130b0 | 10,144 | cc | C++ | dfs/img_gzfile.cc | jamesyoungman/beebtools | 3780a6f7fba9cdb18e1522720508ecc9a5efd1b6 | [
"Apache-2.0"
] | 4 | 2020-07-17T19:01:59.000Z | 2020-07-19T21:36:41.000Z | dfs/img_gzfile.cc | jamesyoungman/beebtools | 3780a6f7fba9cdb18e1522720508ecc9a5efd1b6 | [
"Apache-2.0"
] | null | null | null | dfs/img_gzfile.cc | jamesyoungman/beebtools | 3780a6f7fba9cdb18e1522720508ecc9a5efd1b6 | [
"Apache-2.0"
] | 1 | 2022-02-19T20:31:29.000Z | 2022-02-19T20:31:29.000Z | //
// Copyright 2020 James Youngman
//
// 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 la... | 31.116564 | 100 | 0.661869 | jamesyoungman |
f901c2418c65937bb4727d46b735e344b541b490 | 3,976 | cpp | C++ | genetics/shared/geometry/ObjShape.cpp | crest01/ShapeGenetics | 7321f6484be668317ad763c0ca5e4d6cbfef8cd1 | [
"MIT"
] | 18 | 2017-04-26T13:53:43.000Z | 2021-05-29T03:55:27.000Z | genetics/shared/geometry/ObjShape.cpp | crest01/ShapeGenetics | 7321f6484be668317ad763c0ca5e4d6cbfef8cd1 | [
"MIT"
] | null | null | null | genetics/shared/geometry/ObjShape.cpp | crest01/ShapeGenetics | 7321f6484be668317ad763c0ca5e4d6cbfef8cd1 | [
"MIT"
] | 2 | 2017-10-17T10:32:01.000Z | 2019-11-11T07:23:54.000Z | #include "ObjShape.h"
#include <fstream>
#include <iostream>
namespace PGA {
void ObjShape::normalizeShape()
{
if (v.size() == 0) {
return;
}
math::float3 center;
math::float3 min;
math::float3 max;
center = v[0];
min = center;
max = center;
for (int i = 1; i < v.size(); ++i) {
center += v[i];
if (mi... | 20.080808 | 95 | 0.51333 | crest01 |
f902e446e98e7b31e63ee30763abca9fb7640976 | 1,541 | hpp | C++ | src/dam/matrix4f.hpp | delveam/chess | 2c1e8582b73cb59d71e14a50f671d4ccbac34b95 | [
"MIT"
] | null | null | null | src/dam/matrix4f.hpp | delveam/chess | 2c1e8582b73cb59d71e14a50f671d4ccbac34b95 | [
"MIT"
] | 1 | 2021-07-25T15:54:27.000Z | 2021-07-25T15:54:27.000Z | src/dam/matrix4f.hpp | delveam/chess | 2c1e8582b73cb59d71e14a50f671d4ccbac34b95 | [
"MIT"
] | null | null | null | #ifndef DAM_MATRIX4_HPP
#define DAM_MATRIX4_HPP
#include <array>
namespace dam {
class Matrix4F;
}
class dam::Matrix4F {
public:
Matrix4F() = default;
Matrix4F(std::array<float, 16> data) :
m_data(data)
{
}
unsigned int rows() const
{
return m_rows;
}
unsigned int colu... | 28.018182 | 67 | 0.687865 | delveam |
f9059fc7656e2fd4b795effcc2d844a182e305b0 | 1,510 | cpp | C++ | src/main.cpp | saeenyoda/Hash_Table | b014e76c2089a7d4159c1f9ec55442de5ce41511 | [
"MIT",
"Unlicense"
] | null | null | null | src/main.cpp | saeenyoda/Hash_Table | b014e76c2089a7d4159c1f9ec55442de5ce41511 | [
"MIT",
"Unlicense"
] | null | null | null | src/main.cpp | saeenyoda/Hash_Table | b014e76c2089a7d4159c1f9ec55442de5ce41511 | [
"MIT",
"Unlicense"
] | null | null | null | #include "util.h"
int main() {
HashTable<int, File> table(1000);
std::cout << "Welcome to our Repo!\n\n";
int in = 0;
bool flag = false;
while (!flag) {
std::cout << "\n";
menu();
in = input();
system("cls");
switch (in) {
default:
break;
case 1:
load_file(table);
break;
case 2: {
... | 16.413043 | 84 | 0.523179 | saeenyoda |
f907a8a9b57ab0202d85faa7f61207a4dc8d05e7 | 8,268 | hpp | C++ | optionals/arcadian/base/config_sound.hpp | JeffPerk/HavocTeam | 6fb616c41da4baece79ebac941bac72a78c715f9 | [
"MIT"
] | null | null | null | optionals/arcadian/base/config_sound.hpp | JeffPerk/HavocTeam | 6fb616c41da4baece79ebac941bac72a78c715f9 | [
"MIT"
] | 7 | 2021-11-22T04:36:52.000Z | 2021-12-13T18:55:24.000Z | optionals/arcadian/base/config_sound.hpp | JeffPerk/HavocTeam | 6fb616c41da4baece79ebac941bac72a78c715f9 | [
"MIT"
] | null | null | null | attenuationEffectType = "CarAttenuation";
soundGetIn[] = {"A3\Sounds_F\vehicles2\soft\Mrap_01\Mrap_01_Enter", 0.44, 1};
soundGetOut[] = {"A3\Sounds_F\vehicles2\soft\Mrap_01\Mrap_01_Exit", 0.44, 1, 40};
soundDammage[] = {"", 0.56, 1};
insideSoundCoef = 1;
buildCrash0[] = {"A3\Sounds_F\vehicles2\soft\shared\collisions... | 49.214286 | 116 | 0.73851 | JeffPerk |
f9081e05578584029a42cbdd9f3584ac056a9114 | 8,627 | cpp | C++ | MonoNative.Tests/mscorlib/System/Reflection/mscorlib_System_Reflection_AssemblyName_Fixture.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | 7 | 2015-03-10T03:36:16.000Z | 2021-11-05T01:16:58.000Z | MonoNative.Tests/mscorlib/System/Reflection/mscorlib_System_Reflection_AssemblyName_Fixture.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | 1 | 2020-06-23T10:02:33.000Z | 2020-06-24T02:05:47.000Z | MonoNative.Tests/mscorlib/System/Reflection/mscorlib_System_Reflection_AssemblyName_Fixture.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | null | null | null | // Mono Native Fixture
// Assembly: mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
// Namespace: System.Reflection
// Name: AssemblyName
// C++ Typed Name: mscorlib::System::Reflection::AssemblyName
#include <gtest/gtest.h>
#include <mscorlib/System/Reflection/mscorlib_System_Reflection_A... | 24.933526 | 150 | 0.722499 | brunolauze |
f90a157b484bf7553757f731e5729b3c5e23f30e | 961 | cpp | C++ | 737.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 8 | 2018-10-31T11:00:19.000Z | 2020-07-31T05:25:06.000Z | 737.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | null | null | null | 737.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 2 | 2018-05-31T11:29:22.000Z | 2019-09-11T06:34:40.000Z | class Solution {
public:
bool areSentencesSimilarTwo(vector<string>& words1, vector<string>& words2, vector<pair<string, string>> pairs) {
if (words1.size() != words2.size()) return false;
map<string, string> m;
for (int i = 0; i < pairs.size(); i++){
string parent1 = find(m, pai... | 30.03125 | 117 | 0.480749 | zfang399 |
f90ee2953cf8de6346777a82f96500eeeb535f3b | 11,306 | hpp | C++ | include/worker_thread.hpp | cschreib/ice3 | 44aa182543d037863fb7726827e688490ac26275 | [
"MIT"
] | null | null | null | include/worker_thread.hpp | cschreib/ice3 | 44aa182543d037863fb7726827e688490ac26275 | [
"MIT"
] | null | null | null | include/worker_thread.hpp | cschreib/ice3 | 44aa182543d037863fb7726827e688490ac26275 | [
"MIT"
] | null | null | null | #ifndef WORKER_THREAD_HPP
#define WORKER_THREAD_HPP
#include <vector>
#include "lock_free_queue.hpp"
#include "threading_policies.hpp"
#include "worker_thread_fwd.hpp"
#ifdef NO_STD_THREAD
#pragma GCC system_header
#include <boost/thread.hpp>
#include <boost/functional.hpp>
typedef boost::thread thr... | 21.700576 | 91 | 0.549266 | cschreib |
f916751bd2d5b36248cab4599a8f68b59836351b | 3,021 | cpp | C++ | src/eepp/ui/css/propertyspecification.cpp | jayrulez/eepp | 09c5c1b6b4c0306bb0a188474778c6949b5df3a7 | [
"MIT"
] | 37 | 2020-01-20T06:21:24.000Z | 2022-03-21T17:44:50.000Z | src/eepp/ui/css/propertyspecification.cpp | jayrulez/eepp | 09c5c1b6b4c0306bb0a188474778c6949b5df3a7 | [
"MIT"
] | null | null | null | src/eepp/ui/css/propertyspecification.cpp | jayrulez/eepp | 09c5c1b6b4c0306bb0a188474778c6949b5df3a7 | [
"MIT"
] | 9 | 2019-03-22T00:33:07.000Z | 2022-03-01T01:35:59.000Z | #include <eepp/core/core.hpp>
#include <eepp/system/log.hpp>
#include <eepp/ui/css/propertyspecification.hpp>
namespace EE { namespace UI { namespace CSS {
SINGLETON_DECLARE_IMPLEMENTATION( PropertySpecification )
PropertySpecification::~PropertySpecification() {}
PropertyDefinition& PropertySpecification::register... | 29.910891 | 100 | 0.714995 | jayrulez |
f91c1ebbf48fb01f9e37432b0304a0947b024a07 | 2,435 | cpp | C++ | 00124_binary-tree-maximum-path-sum/200208-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | 6 | 2019-10-23T01:07:29.000Z | 2021-12-05T01:51:16.000Z | 00124_binary-tree-maximum-path-sum/200208-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | null | null | null | 00124_binary-tree-maximum-path-sum/200208-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | 1 | 2021-12-03T06:54:57.000Z | 2021-12-03T06:54:57.000Z | // https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/
#include <cstdio>
#include <algorithm>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
void release(TreeNode* t)
{
if (t) {
release(t->left);
release(t->r... | 22.136364 | 69 | 0.544969 | yanlinlin82 |
f91d805b7315035dc22746fb046e08442503f6be | 425 | cpp | C++ | CodeForces/841/B - Godsend.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-02-24T06:45:56.000Z | 2018-05-29T04:47:39.000Z | CodeForces/841/B - Godsend.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | null | null | null | CodeForces/841/B - Godsend.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-06-28T09:53:27.000Z | 2022-03-23T13:29:57.000Z | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout<<(x)<<endl
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ms(x,y) memset(x,y,sizeof x)
typedef long long LL;
const LL mod=1e9+7,inf=0x3f3f3f3f,maxn=1123456;
LL n,sum,a,flag;
int main(){
ios::sync_with_stdio(false);
cin>>n;
for(int i=... | 20.238095 | 47 | 0.64 | QAQrz |
f91f517680e5e0dd53b2e3c058af5eac2a6b3ee0 | 1,120 | cpp | C++ | src/QtFuzzy/nFuzzySNormFactory.cpp | Vladimir-Lin/QtFuzzy | 185869384f3ce9d3a801080b675bae8ed6c5fb12 | [
"MIT"
] | null | null | null | src/QtFuzzy/nFuzzySNormFactory.cpp | Vladimir-Lin/QtFuzzy | 185869384f3ce9d3a801080b675bae8ed6c5fb12 | [
"MIT"
] | null | null | null | src/QtFuzzy/nFuzzySNormFactory.cpp | Vladimir-Lin/QtFuzzy | 185869384f3ce9d3a801080b675bae8ed6c5fb12 | [
"MIT"
] | null | null | null | #include <qtfuzzy.h>
N::Fuzzy::SNormFactory:: SNormFactory(void)
{
}
N::Fuzzy::SNormFactory::~SNormFactory(void)
{
}
N::Fuzzy::SNorm * N::Fuzzy::SNormFactory::create(const QString & zName) const
{
#define FSNF(CN) if (zName==CN().className()) return new CN()
FSNF ( Maximum ) ;
FSNF ( AlgebraicSum ) ;
... | 28.717949 | 77 | 0.475893 | Vladimir-Lin |
f924ed633381bcc5babc06e4f9d3f332bad627b2 | 2,686 | hh | C++ | src/ggl/Graph.hh | michaelapeterka/GGL | 99e585b773ad8f33e39160d2cbd71c00e036fa37 | [
"MIT"
] | 20 | 2017-05-09T15:37:04.000Z | 2021-11-24T10:51:02.000Z | src/ggl/Graph.hh | michaelapeterka/GGL | 99e585b773ad8f33e39160d2cbd71c00e036fa37 | [
"MIT"
] | 2 | 2017-05-24T08:00:25.000Z | 2017-05-24T08:01:01.000Z | src/ggl/Graph.hh | michaelapeterka/GGL | 99e585b773ad8f33e39160d2cbd71c00e036fa37 | [
"MIT"
] | 7 | 2017-05-29T10:55:18.000Z | 2020-12-04T14:24:51.000Z | #ifndef GGL_GRAPH_HH_
#define GGL_GRAPH_HH_
#include <boost/graph/properties.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <iostream>
#include <vector>
#include <set>
#include "sgm/Graph_boost.hh"
//! The ggl namespace contains classes needed to specify rules of a graph
//! grammar and ... | 27.979167 | 78 | 0.642964 | michaelapeterka |
234e424ee765ce167a5d7a82484fedeabc8e887b | 10,711 | hpp | C++ | src/parser/lexer/string_reader.hpp | alohaeee/-orrosion | 7529cf9fb2d15f4d67a45013bd90760bc9c8f579 | [
"MIT"
] | null | null | null | src/parser/lexer/string_reader.hpp | alohaeee/-orrosion | 7529cf9fb2d15f4d67a45013bd90760bc9c8f579 | [
"MIT"
] | null | null | null | src/parser/lexer/string_reader.hpp | alohaeee/-orrosion | 7529cf9fb2d15f4d67a45013bd90760bc9c8f579 | [
"MIT"
] | null | null | null | #ifndef CORROSION_SRC_PARSER_LEXER_STRING_READER_HPP_
#define CORROSION_SRC_PARSER_LEXER_STRING_READER_HPP_
#include "utility/std_incl.hpp"
#include "lexer/lexer.hpp"
#include "parser/parse_session.hpp"
#include "ast/token.hpp"
#include "span/source_file.hpp"
#include "span/symbol.hpp"
#include "span/span.hpp"
#inclu... | 29.752778 | 135 | 0.642424 | alohaeee |
235065baa317611a019f596d0f90b837f98d8488 | 606 | cpp | C++ | Code/2020/Day 3/day3p1.cpp | holllikill/AdventOfCode2019 | 7ea69ac9cf57ba15196047564f40e63f4d20d996 | [
"MIT"
] | 1 | 2020-01-28T00:06:30.000Z | 2020-01-28T00:06:30.000Z | Code/2020/Day 3/day3p1.cpp | holllikill/AdventOfCode2019 | 7ea69ac9cf57ba15196047564f40e63f4d20d996 | [
"MIT"
] | null | null | null | Code/2020/Day 3/day3p1.cpp | holllikill/AdventOfCode2019 | 7ea69ac9cf57ba15196047564f40e63f4d20d996 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
using namespace std;
int main () {
ifstream infile;
infile.open ("input.txt");
string total[500];
int i = 0;
if (infile.is_open()) {
while (infile.good()) {
char c[40];
infile.getline(c, 256);
total[i... | 16.833333 | 38 | 0.429043 | holllikill |
2353913ff868e3d33d8c912eae7628f289ed2759 | 5,949 | cpp | C++ | components/network/tcp/iot_tcp.cpp | lask/esp-iot-solution | 40cec135eace36cf11ab72988e27546a2c0d025b | [
"Apache-2.0"
] | 8 | 2021-03-29T16:42:39.000Z | 2022-02-18T07:05:00.000Z | components/network/tcp/iot_tcp.cpp | Conanzhou/esp-iot-solution | f2e0a8ee2448b26171fe361add1b6786b7cf43a0 | [
"Apache-2.0"
] | 27 | 2019-03-12T10:13:29.000Z | 2019-06-07T20:40:56.000Z | components/network/tcp/iot_tcp.cpp | Conanzhou/esp-iot-solution | f2e0a8ee2448b26171fe361add1b6786b7cf43a0 | [
"Apache-2.0"
] | 3 | 2020-05-01T06:33:57.000Z | 2020-05-13T12:01:25.000Z | // Copyright 2015-2016 Espressif Systems (Shanghai) PTE LTD
//
// 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 app... | 25.642241 | 120 | 0.597411 | lask |
23555e12d8d2541b45abfc5e9eb42037e5b9d8a5 | 1,545 | cp | C++ | MacOS/Sources/Support/CClockEventHandler.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 12 | 2015-04-21T16:10:43.000Z | 2021-11-05T13:41:46.000Z | MacOS/Sources/Support/CClockEventHandler.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 2 | 2015-11-02T13:32:11.000Z | 2019-07-10T21:11:21.000Z | MacOS/Sources/Support/CClockEventHandler.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 6 | 2015-01-12T08:49:12.000Z | 2021-03-27T09:11:10.000Z | /*
Copyright (c) 2007 Cyrus Daboo. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless re... | 29.150943 | 92 | 0.732039 | mulberry-mail |
235bab4fddd1c645d87cf3164c014efe2abeece2 | 299 | hpp | C++ | src/tool.hpp | Montag55/gl-playground | 7501718726f8933e7550abfacaeff9708a4ab270 | [
"MIT"
] | null | null | null | src/tool.hpp | Montag55/gl-playground | 7501718726f8933e7550abfacaeff9708a4ab270 | [
"MIT"
] | null | null | null | src/tool.hpp | Montag55/gl-playground | 7501718726f8933e7550abfacaeff9708a4ab270 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
// assure compile class will be there
class GraphApp;
class Tool {
public:
Tool(GraphApp* app);
virtual bool draw() const = 0;
virtual bool registerTool() = 0;
void setPriority(int prio);
protected:
GraphApp* m_linkedApp;
int m_priotity;
}; | 17.588235 | 38 | 0.67893 | Montag55 |
235ccc2ae0a2b5fe5b4f3268928091154f4cc7f8 | 14,458 | hpp | C++ | src/libs/optframe/src/OptFrame/MultiObjValue.hpp | fellipessanha/LMRRC-Team-AIDA | 8076599427df0e35890caa7301972a53ae327edb | [
"MIT"
] | 1 | 2021-08-19T13:31:29.000Z | 2021-08-19T13:31:29.000Z | src/libs/optframe/src/OptFrame/MultiObjValue.hpp | fellipessanha/LMRRC-Team-AIDA | 8076599427df0e35890caa7301972a53ae327edb | [
"MIT"
] | null | null | null | src/libs/optframe/src/OptFrame/MultiObjValue.hpp | fellipessanha/LMRRC-Team-AIDA | 8076599427df0e35890caa7301972a53ae327edb | [
"MIT"
] | null | null | null | #ifndef OPTFRAME_MULTI_OBJ_VALUE_HPP
#define OPTFRAME_MULTI_OBJ_VALUE_HPP
#include <assert.h>
#include <iostream>
#include <sstream>
#include <tuple>
#include "SingleObjValue.hpp" // must re-use some structures
#include "myconcepts.h"
//#include <OptFrame/printable/printable.h>
namespace optframe {
// Struct to ha... | 33.236782 | 155 | 0.634389 | fellipessanha |
2360bd309419075ba38cb55f88873bc1911fbde4 | 972 | cpp | C++ | src/simulator.cpp | RicoAntonioFelix/TELEVISION-SIMULATOR | 318862b3a3e0a30dbcc34e9e6fb364d8ed1a4f38 | [
"Apache-2.0"
] | null | null | null | src/simulator.cpp | RicoAntonioFelix/TELEVISION-SIMULATOR | 318862b3a3e0a30dbcc34e9e6fb364d8ed1a4f38 | [
"Apache-2.0"
] | null | null | null | src/simulator.cpp | RicoAntonioFelix/TELEVISION-SIMULATOR | 318862b3a3e0a30dbcc34e9e6fb364d8ed1a4f38 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2014-2015 Rico Antonio Felix
*
* 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 o... | 25.578947 | 75 | 0.709877 | RicoAntonioFelix |
236394ec20600a21bdcb7a74a3118867e877c422 | 144 | hpp | C++ | include/cgla/cgla.hpp | Blodangan/cgla | 48e3418c3fbe7c2e01ec0b107f1fb862de8f48e0 | [
"MIT"
] | 1 | 2020-07-09T19:50:09.000Z | 2020-07-09T19:50:09.000Z | include/cgla/cgla.hpp | Blodangan/cgla | 48e3418c3fbe7c2e01ec0b107f1fb862de8f48e0 | [
"MIT"
] | null | null | null | include/cgla/cgla.hpp | Blodangan/cgla | 48e3418c3fbe7c2e01ec0b107f1fb862de8f48e0 | [
"MIT"
] | null | null | null | #ifndef CGLA_CGLA_HPP
#define CGLA_CGLA_HPP
#include "config.hpp"
#include "vector.hpp"
#include "matrix.hpp"
#include "transform.hpp"
#endif
| 14.4 | 24 | 0.763889 | Blodangan |
2374a4a78a7c28009d58df9962397dfd618c6436 | 1,218 | cpp | C++ | src/test/tst4.cpp | TING2938/Gmx2020PostAnalysis | 0859383946c05c7424adb1ffa72fd2f8066ce850 | [
"MIT"
] | 4 | 2021-11-23T15:02:13.000Z | 2022-03-21T16:32:09.000Z | src/test/tst4.cpp | jianghuili/Gmx2020PostAnalysis | 0859383946c05c7424adb1ffa72fd2f8066ce850 | [
"MIT"
] | null | null | null | src/test/tst4.cpp | jianghuili/Gmx2020PostAnalysis | 0859383946c05c7424adb1ffa72fd2f8066ce850 | [
"MIT"
] | 1 | 2021-11-23T15:01:49.000Z | 2021-11-23T15:01:49.000Z | #include <itp/core>
#include <format>
#include <map>
#include <vector>
#define Print(...) std::cout << std::format(__VA_ARGS__)
std::vector<std::string> splitString(const std::string& str)
{
std::vector<std::string> result;
std::string::const_iterator currPos = str.begin();
const std::stri... | 23.882353 | 69 | 0.554187 | TING2938 |
237a2bf739070b77f847360e67b4b390ece00c8b | 609 | cpp | C++ | 201403/1.cpp | YiqinXiong/CSP_Practice | b5840117175f0370d4c1fbcc3c6ffd1fd337a04c | [
"MIT"
] | null | null | null | 201403/1.cpp | YiqinXiong/CSP_Practice | b5840117175f0370d4c1fbcc3c6ffd1fd337a04c | [
"MIT"
] | null | null | null | 201403/1.cpp | YiqinXiong/CSP_Practice | b5840117175f0370d4c1fbcc3c6ffd1fd337a04c | [
"MIT"
] | null | null | null | /*
* 用时 10分
* 得分 100分
*/
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_N = 2005;
bool arr[MAX_N];
int N;
int main()
{
int ans = 0;
fill(begin(arr), end(arr), false);
cin >> N;
for (int i = 0; i < N; i++)
{
int num;
cin >> num;
//把数字范围调整为[0,20... | 16.459459 | 53 | 0.456486 | YiqinXiong |
237b40b10cccd5bfd935e1c28b2f669e41669b0d | 1,376 | hpp | C++ | libs/input/include/sge/input/processor.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | libs/input/include/sge/input/processor.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | libs/input/include/sge/input/processor.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 3 | 2018-05-11T01:11:34.000Z | 2021-04-24T19:47:45.000Z | // Copyright Carl Philipp Reh 2006 - 2019.
// 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 SGE_INPUT_PROCESSOR_HPP_INCLUDED
#define SGE_INPUT_PROCESSOR_HPP_INCLUDED
#include <sge/co... | 26.980392 | 78 | 0.736919 | cpreh |
237f6fdbd1cc682f87a412f4e80acb75d1d96931 | 5,508 | cpp | C++ | source/projects/ar.swell_tilde/ar.swell_tilde.cpp | isabelgk/airfx | bc97f9a093ceba9cd27020f4b4db1c508a37545f | [
"MIT"
] | 16 | 2021-06-20T04:51:09.000Z | 2022-03-30T03:03:32.000Z | source/projects/ar.swell_tilde/ar.swell_tilde.cpp | isabelgk/airfx | bc97f9a093ceba9cd27020f4b4db1c508a37545f | [
"MIT"
] | 7 | 2021-06-20T01:22:22.000Z | 2022-01-24T14:33:31.000Z | source/projects/ar.swell_tilde/ar.swell_tilde.cpp | isabelgk/airfx | bc97f9a093ceba9cd27020f4b4db1c508a37545f | [
"MIT"
] | null | null | null | #include "c74_min.h"
using namespace c74::min;
class swell : public object<swell>, public vector_operator<> {
public:
MIN_DESCRIPTION {"adds attack"};
MIN_TAGS {""};
MIN_AUTHOR {"Isabel Kaspriskie"};
inlet<> in1 {this, "(signal) Input1"};
inlet<> in2 {this, "(signal) Input2"};
outlet<> out1 {this, "(signal) Ou... | 34.21118 | 95 | 0.662309 | isabelgk |
238abc8dd6f4da245d254d61a20a3fa92318a2d3 | 424 | cpp | C++ | Limux/src/Platform/OpenGL/OpenGLBuffer.cpp | silvertakana/Lumix | 35a6c0d35229a71dc4445369bb400c4e5adca1af | [
"MIT"
] | 2 | 2021-09-25T05:22:50.000Z | 2021-09-30T21:04:11.000Z | Limux/src/Platform/OpenGL/OpenGLBuffer.cpp | silvertakana/Lumix | 35a6c0d35229a71dc4445369bb400c4e5adca1af | [
"MIT"
] | null | null | null | Limux/src/Platform/OpenGL/OpenGLBuffer.cpp | silvertakana/Lumix | 35a6c0d35229a71dc4445369bb400c4e5adca1af | [
"MIT"
] | null | null | null | #include "lmxpch.h"
#include "OpenGLBuffer.h"
namespace LMX
{
OpenGLBuffer::OpenGLBuffer(void* data, uint32_t size)
{
glCreateBuffers(1, &ID);
glNamedBufferData(ID, size, data, GL_STATIC_DRAW);
}
void OpenGLBuffer::Bind(GLenum type) const
{
glBindBuffer(type, ID);
}
void OpenGLBuffer::UnBind(GLenum type... | 16.96 | 54 | 0.70283 | silvertakana |
238dca0057b6ce883051786807ee1eb9f032f726 | 13,571 | cpp | C++ | samples/common/cns_openpose/postprocess_body_pose.cpp | HFauto/CNStream | 1d4847327fff83eedbc8de6911855c5f7bb2bf22 | [
"Apache-2.0"
] | 172 | 2019-08-24T10:05:14.000Z | 2022-03-29T07:45:18.000Z | samples/common/cns_openpose/postprocess_body_pose.cpp | HFauto/CNStream | 1d4847327fff83eedbc8de6911855c5f7bb2bf22 | [
"Apache-2.0"
] | 27 | 2019-09-01T11:04:45.000Z | 2022-01-17T09:27:07.000Z | samples/common/cns_openpose/postprocess_body_pose.cpp | HFauto/CNStream | 1d4847327fff83eedbc8de6911855c5f7bb2bf22 | [
"Apache-2.0"
] | 72 | 2019-08-24T10:13:06.000Z | 2022-03-28T08:26:05.000Z | /*************************************************************************
* Copyright (C) [2021] 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... | 44.061688 | 116 | 0.658905 | HFauto |
2391b76a3b21df73fc82d4bd351a1c50c20f30a4 | 482 | cpp | C++ | Aula03/usoScanf.cpp | renancosta/ProgramacaoI20221 | 3bff0c2d39d97ba442683e66ea1551d3777f79ba | [
"MIT"
] | null | null | null | Aula03/usoScanf.cpp | renancosta/ProgramacaoI20221 | 3bff0c2d39d97ba442683e66ea1551d3777f79ba | [
"MIT"
] | null | null | null | Aula03/usoScanf.cpp | renancosta/ProgramacaoI20221 | 3bff0c2d39d97ba442683e66ea1551d3777f79ba | [
"MIT"
] | null | null | null | #include<stdlib.h>
#include<stdio.h>
main(){
int idade1,idade2;
float altura1,altura2;
printf("Pessoa 1\n");
printf("Informe sua idade: ");
scanf("%d",&idade1);
printf("Informe sua altura: ");
scanf("%f",&altura1);
printf("\nPessoa 2\n");
printf("Informe sua idade: ");
scanf("%d",&idade2);
printf("Informe s... | 24.1 | 61 | 0.653527 | renancosta |
23926c104d34bbe4441171984d5ee3425037264e | 689 | cpp | C++ | P1516.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | P1516.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | P1516.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <iostream>
using namespace std;
long long x, y, m, n, L, d, a, b;
void exgcd(long long a, long long b, long long &d, long long &x, long long &y){
if(b)
exgcd(b, a%b, d, y, x),
y -= x*(a/b);
else
d = a, x = 1, y = 0;
}
long long gcd(int u, int v){
return v ... | 19.138889 | 79 | 0.404935 | AndrewWayne |
2392982e76eb752ea3fe78ed3b5511ca2d3ee45a | 194 | cpp | C++ | leetcode/Algorithms/FactorialTrailingZeroes/solution.cpp | hxdone/puzzles | b729bce8a61f77ad7cbb70957e00c5ade9a0a35f | [
"Apache-2.0"
] | 2 | 2015-07-03T03:05:30.000Z | 2015-07-03T03:05:31.000Z | leetcode/Algorithms/FactorialTrailingZeroes/solution.cpp | hxdone/puzzles | b729bce8a61f77ad7cbb70957e00c5ade9a0a35f | [
"Apache-2.0"
] | null | null | null | leetcode/Algorithms/FactorialTrailingZeroes/solution.cpp | hxdone/puzzles | b729bce8a61f77ad7cbb70957e00c5ade9a0a35f | [
"Apache-2.0"
] | null | null | null | // by hxdone
class Solution {
public:
int trailingZeroes(int n) {
int sum = 0;
while (n) {
n /= 5;
sum += n;
}
return sum;
}
};
| 13.857143 | 31 | 0.391753 | hxdone |
2393edef020fbe0b95563bb6486cda2d0ac05229 | 3,938 | cpp | C++ | src/quadtree.cpp | JamesBremner/quadtree | 5200978410006b67c67e64659c98fb3cb20c7669 | [
"BSD-2-Clause"
] | null | null | null | src/quadtree.cpp | JamesBremner/quadtree | 5200978410006b67c67e64659c98fb3cb20c7669 | [
"BSD-2-Clause"
] | null | null | null | src/quadtree.cpp | JamesBremner/quadtree | 5200978410006b67c67e64659c98fb3cb20c7669 | [
"BSD-2-Clause"
] | null | null | null | #include <iostream>
#include <sstream>
#include <vector>
#include "cRunWatch.h"
#include "quadtree.h"
namespace quad
{
std::vector<cPoint *> cCell::myPointsFound;
cCell::cCell(const cPoint &p, float d)
: center(p), dim(d / 2), nw(0)
{
}
cCell::~cCell()
{
if (nw)
{
... | 24.308642 | 70 | 0.452514 | JamesBremner |
2398c81e98139b368926645cda7a8894d157327e | 14,975 | cc | C++ | Cassie_Example/opt_two_step/gen/opt/J_u_leftToeHeight_cassie.cc | prem-chand/Cassie_CFROST | da4bd51442f86e852cbb630cc91c9a380a10b66d | [
"BSD-3-Clause"
] | null | null | null | Cassie_Example/opt_two_step/gen/opt/J_u_leftToeHeight_cassie.cc | prem-chand/Cassie_CFROST | da4bd51442f86e852cbb630cc91c9a380a10b66d | [
"BSD-3-Clause"
] | null | null | null | Cassie_Example/opt_two_step/gen/opt/J_u_leftToeHeight_cassie.cc | prem-chand/Cassie_CFROST | da4bd51442f86e852cbb630cc91c9a380a10b66d | [
"BSD-3-Clause"
] | null | null | null | /*
* Automatically Generated from Mathematica.
* Thu 14 Oct 2021 09:55:24 GMT-04:00
*/
#ifdef MATLAB_MEX_FILE
#include <stdexcept>
#include <cmath>
#include<math.h>
/**
* Copied from Wolfram Mathematica C Definitions file mdefs.hpp
* Changed marcos to inline functions (Eric Cousineau)
*/
inline double Power(doub... | 23.96 | 352 | 0.649883 | prem-chand |
23a3994cd45bce582d2b4dd466dbc45dec978069 | 3,636 | cpp | C++ | src/support.cpp | TehSnappy/lib_lunar_ex | a4cd4a3cdec44c2adaefbf1791b8863db568cbbd | [
"MIT"
] | null | null | null | src/support.cpp | TehSnappy/lib_lunar_ex | a4cd4a3cdec44c2adaefbf1791b8863db568cbbd | [
"MIT"
] | null | null | null | src/support.cpp | TehSnappy/lib_lunar_ex | a4cd4a3cdec44c2adaefbf1791b8863db568cbbd | [
"MIT"
] | 1 | 2019-10-12T03:23:41.000Z | 2019-10-12T03:23:41.000Z |
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <ctype.h>
#include "lunar-master/watdefs.h"
#include "lunar-master/afuncs.h"
#include "lunar-master/date.h"
static const long double j2000 = 2451545.0;
static void my_remove_char( char *buff, const char removed)... | 27.338346 | 116 | 0.578108 | TehSnappy |
23aec974649df6b1ddb184478d165c1ff9c72a40 | 1,104 | hpp | C++ | src/heuristics/acceptCritTemperature.hpp | lucasmpavelski/Adaptive-IG | cf48ffae80597a6fd1738da6b4871fe98a3b5189 | [
"Unlicense"
] | null | null | null | src/heuristics/acceptCritTemperature.hpp | lucasmpavelski/Adaptive-IG | cf48ffae80597a6fd1738da6b4871fe98a3b5189 | [
"Unlicense"
] | null | null | null | src/heuristics/acceptCritTemperature.hpp | lucasmpavelski/Adaptive-IG | cf48ffae80597a6fd1738da6b4871fe98a3b5189 | [
"Unlicense"
] | null | null | null | #pragma once
#include <cmath>
#include <paradiseo/eo/eo>
#include <paradiseo/mo/mo>
/**
* Acceptance Criterion for extreme intensification : accept if the new solution
* is better than previous one
*/
template <class Neighbor>
class acceptCritTemperature : public moAcceptanceCriterion<Neighbor>,
... | 27.6 | 80 | 0.679348 | lucasmpavelski |
23b0aedf3506240106fbfcca4defb72bae6c8ced | 4,264 | cpp | C++ | ProjectLunarFront/Main.cpp | Edgaru089/ProjectLunarFront | bf59c6dec36e0576082acf3c72abf3c82bc92241 | [
"MIT"
] | null | null | null | ProjectLunarFront/Main.cpp | Edgaru089/ProjectLunarFront | bf59c6dec36e0576082acf3c72abf3c82bc92241 | [
"MIT"
] | null | null | null | ProjectLunarFront/Main.cpp | Edgaru089/ProjectLunarFront | bf59c6dec36e0576082acf3c72abf3c82bc92241 | [
"MIT"
] | null | null | null | #include "Main.hpp"
#include "Instance.hpp"
#include "JudgeWorker.hpp"
#include "JudgeRecord.hpp"
#include "StringDatabase.hpp"
#include "Problem.hpp"
#include "Page.hpp"
#include "PageStatus.hpp"
#include "PageStatusDetail.hpp"
Log dlog;
ofstream logout;
atomic_bool running, stopped;
#ifdef _WIN32
//Platform-Deped... | 26.987342 | 122 | 0.671435 | Edgaru089 |
23b4ad9cdb20903326df1a29a1593c58bd7812cd | 2,406 | cpp | C++ | raygame/MyColor.cpp | BlueJayAtAIE/RaylibCPP | 74dcf59f4c469a21f439344dca14dfba53ee3969 | [
"MIT"
] | 1 | 2020-09-09T15:44:45.000Z | 2020-09-09T15:44:45.000Z | raygame/MyColor.cpp | BlueJayAtAIE/RaylibCPP | 74dcf59f4c469a21f439344dca14dfba53ee3969 | [
"MIT"
] | null | null | null | raygame/MyColor.cpp | BlueJayAtAIE/RaylibCPP | 74dcf59f4c469a21f439344dca14dfba53ee3969 | [
"MIT"
] | null | null | null | #include "MyColor.h"
MyColor::MyColor()
{
}
MyColor::MyColor(int red, int green, int blue, int alpha)
{
r = red;
g = green;
b = blue;
a = alpha;
clamp();
}
void MyColor::clamp()
{
if (r > 255)
r = 255;
if (r < 0)
r = 0;
if (g > 255)
g = 255;
if (g < 0)
g = 0;
if (b > 255)
b = 255;
if (b < 0)... | 16.367347 | 68 | 0.549875 | BlueJayAtAIE |
23b901b1ddd924dc75e5064f41c6b706958bf029 | 3,171 | cc | C++ | examples/distributed_grid.cc | mpi-advance/Exhanced-MPL-tiny- | 9585fdc337a69c207a7c771d850b5ad7542666fa | [
"BSD-3-Clause"
] | 2 | 2021-10-13T03:55:48.000Z | 2022-01-28T15:33:54.000Z | examples/distributed_grid.cc | mpi-advance/mpl-subset | 9585fdc337a69c207a7c771d850b5ad7542666fa | [
"BSD-3-Clause"
] | null | null | null | examples/distributed_grid.cc | mpi-advance/mpl-subset | 9585fdc337a69c207a7c771d850b5ad7542666fa | [
"BSD-3-Clause"
] | null | null | null | #include <cstdlib>
#include <iostream>
#include <mpl/mpl.hpp>
template<std::size_t dim, typename T, typename A>
void update_overlap(const mpl::cart_communicator &C, mpl::distributed_grid<dim, T, A> &G,
mpl::tag tag = mpl::tag()) {
mpl::shift_ranks ranks;
for (std::size_t i = 0; i < dim; ++i) {
... | 41.181818 | 91 | 0.613371 | mpi-advance |
23bd94d5e5ce23c6580393b45a8a267c1e885e99 | 1,110 | cpp | C++ | 64.cpp | machinecc/leetcode | 32bbf6c1f9124049c046a235c85b14ca9168daa8 | [
"MIT"
] | null | null | null | 64.cpp | machinecc/leetcode | 32bbf6c1f9124049c046a235c85b14ca9168daa8 | [
"MIT"
] | null | null | null | 64.cpp | machinecc/leetcode | 32bbf6c1f9124049c046a235c85b14ca9168daa8 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdlib>
#include <string>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <climits>
#include <stack>
#include <sstream>
#include <numeric>
#include <unordered_map>
using namespace std;
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
... | 15.416667 | 57 | 0.445045 | machinecc |
23bec30b8dedd40fd60e7c39d8c2b4066e60d237 | 750 | cpp | C++ | string/165 Compare Version Numbers.cpp | CoderQuinnYoung/leetcode | 6ea15c68124b16824bab9ed2e0e5a40c72eb3db1 | [
"BSD-3-Clause"
] | null | null | null | string/165 Compare Version Numbers.cpp | CoderQuinnYoung/leetcode | 6ea15c68124b16824bab9ed2e0e5a40c72eb3db1 | [
"BSD-3-Clause"
] | null | null | null | string/165 Compare Version Numbers.cpp | CoderQuinnYoung/leetcode | 6ea15c68124b16824bab9ed2e0e5a40c72eb3db1 | [
"BSD-3-Clause"
] | null | null | null | //
// 165 Compare Version Numbers.cpp
// Leetcode
//
// Created by Quinn on 2020/12/15.
// Copyright © 2020 Quinn. All rights reserved.
//
#include <stdio.h>
#include <string>
using namespace std;
class Solution {
public:
int compareVersion(string v1, string v2) {
for(int i = 0, j = 0; i < v1.size() |... | 22.058824 | 64 | 0.441333 | CoderQuinnYoung |
23c2037b617b9fd8fe3f9b2460d65e2150ae595b | 405 | hpp | C++ | sources/SoundEffect.hpp | PawelWorwa/SFMLris | 525c29eefee2ec68512d3d320fb0e9aae95b9549 | [
"MIT"
] | null | null | null | sources/SoundEffect.hpp | PawelWorwa/SFMLris | 525c29eefee2ec68512d3d320fb0e9aae95b9549 | [
"MIT"
] | 4 | 2018-01-10T19:17:00.000Z | 2018-01-10T20:21:27.000Z | sources/SoundEffect.hpp | PawelWorwa/SFMLris | 525c29eefee2ec68512d3d320fb0e9aae95b9549 | [
"MIT"
] | null | null | null | #ifndef SFMLRIS_SOUNDEFFECT_HPP
#define SFMLRIS_SOUNDEFFECT_HPP
#include <SFML/Audio/Sound.hpp>
#include <SFML/Audio/SoundBuffer.hpp>
class SoundEffect {
public:
explicit SoundEffect(const std::string &filePath);
void play();
void playOnce();
private:
sf::SoundBuffer buffer;
... | 17.608696 | 58 | 0.669136 | PawelWorwa |
23c526ab0e7ce0125042d98e6c6846a1b295e8d9 | 895 | hpp | C++ | LD46 - Square Loves Circle/Source/Transitions.hpp | milo-brandt/milos-ludum-dare-entries | 6b4907463395ee99720386bca48726a798af14d2 | [
"MIT"
] | null | null | null | LD46 - Square Loves Circle/Source/Transitions.hpp | milo-brandt/milos-ludum-dare-entries | 6b4907463395ee99720386bca48726a798af14d2 | [
"MIT"
] | null | null | null | LD46 - Square Loves Circle/Source/Transitions.hpp | milo-brandt/milos-ludum-dare-entries | 6b4907463395ee99720386bca48726a798af14d2 | [
"MIT"
] | null | null | null | //
// Transitions.hpp
// Dummy
//
// Created by Milo Brandt on 4/18/20.
// Copyright © 2020 Milo Brandt. All rights reserved.
//
#ifndef Transitions_hpp
#define Transitions_hpp
#include "Common/Window.h"
#include "Game/ImmediateData.h"
#include <variant>
namespace RenderEffects{
struct LoveFade{
Vect... | 23.552632 | 80 | 0.653631 | milo-brandt |
23ce6f7b8b7eb697fe5e919e76be54fb05aabb02 | 12,601 | hpp | C++ | opentrack/options.hpp | asarnow/opentrack | aed80a837d79eb6997435e062e5fbda0a140a715 | [
"ISC"
] | null | null | null | opentrack/options.hpp | asarnow/opentrack | aed80a837d79eb6997435e062e5fbda0a140a715 | [
"ISC"
] | null | null | null | opentrack/options.hpp | asarnow/opentrack | aed80a837d79eb6997435e062e5fbda0a140a715 | [
"ISC"
] | null | null | null | /* Copyright (c) 2013-2014 Stanislaw Halik
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*/
#pragma once
#include <memory>
#include <tuple>
#... | 29.168981 | 117 | 0.5594 | asarnow |
23ceaf9cb955071e61169f036d3a4fe377f8a6b5 | 30,751 | cpp | C++ | artifact/storm/src/storm/modelchecker/helper/infinitehorizon/SparseDeterministicInfiniteHorizonHelper.cpp | glatteis/tacas21-artifact | 30b4f522bd3bdb4bebccbfae93f19851084a3db5 | [
"MIT"
] | null | null | null | artifact/storm/src/storm/modelchecker/helper/infinitehorizon/SparseDeterministicInfiniteHorizonHelper.cpp | glatteis/tacas21-artifact | 30b4f522bd3bdb4bebccbfae93f19851084a3db5 | [
"MIT"
] | null | null | null | artifact/storm/src/storm/modelchecker/helper/infinitehorizon/SparseDeterministicInfiniteHorizonHelper.cpp | glatteis/tacas21-artifact | 30b4f522bd3bdb4bebccbfae93f19851084a3db5 | [
"MIT"
] | 1 | 2022-02-05T12:39:53.000Z | 2022-02-05T12:39:53.000Z | #include "SparseDeterministicInfiniteHorizonHelper.h"
#include "storm/modelchecker/helper/infinitehorizon/internal/ComponentUtility.h"
#include "storm/modelchecker/helper/infinitehorizon/internal/LraViHelper.h"
#include "storm/storage/SparseMatrix.h"
#include "storm/storage/StronglyConnectedComponentDecomposition.h"... | 71.018476 | 340 | 0.605997 | glatteis |
23d26327a7db8bc2b8610e9dccd146ef0101ed3e | 14,772 | cpp | C++ | src/bindings/Scriptdev2/scripts/northrend/icecrown_citadel/icecrown_citadel/boss_lord_marrowgar.cpp | mfooo/wow | 3e5fad4cfdf0fd1c0a2fd7c9844e6f140a1bb32d | [
"OpenSSL"
] | 1 | 2017-11-16T19:04:07.000Z | 2017-11-16T19:04:07.000Z | src/bindings/Scriptdev2/scripts/northrend/icecrown_citadel/icecrown_citadel/boss_lord_marrowgar.cpp | mfooo/wow | 3e5fad4cfdf0fd1c0a2fd7c9844e6f140a1bb32d | [
"OpenSSL"
] | null | null | null | src/bindings/Scriptdev2/scripts/northrend/icecrown_citadel/icecrown_citadel/boss_lord_marrowgar.cpp | mfooo/wow | 3e5fad4cfdf0fd1c0a2fd7c9844e6f140a1bb32d | [
"OpenSSL"
] | null | null | null | /* Copyright (C) 2006 - 2010 ScriptDev2 <https://scriptdev2.svn.sourceforge.net/>
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any l... | 34.115473 | 139 | 0.546845 | mfooo |
23d5d0fe82a7157b45cd3e14aaeecdbb5842c18e | 1,782 | cpp | C++ | source/tvision/tapplica.cpp | ebelin/tvision | bf09d50c30a58298894cd478125c43b91a6e7c79 | [
"MIT"
] | null | null | null | source/tvision/tapplica.cpp | ebelin/tvision | bf09d50c30a58298894cd478125c43b91a6e7c79 | [
"MIT"
] | 1 | 2020-10-12T22:41:38.000Z | 2020-11-05T22:35:39.000Z | source/tvision/tapplica.cpp | jvprat/tvision | 394febdb490ce962930db173274a81e10fac82f8 | [
"MIT"
] | null | null | null | /*-------------------------------------------------------------------*/
/* filename - tapplica.cpp */
/* */
/* function(s) */
/* TApplication mem... | 26.597015 | 77 | 0.522447 | ebelin |
23da388b5a166cf2e3c5c63bc2ef412d32d348d6 | 896 | cpp | C++ | src/flower/layer/dropout.cpp | Fs02/Flower | b2a91c78fc6a72766abcf1cac620e22233899d99 | [
"MIT"
] | 1 | 2016-12-02T14:33:16.000Z | 2016-12-02T14:33:16.000Z | src/flower/layer/dropout.cpp | Fs02/Flower | b2a91c78fc6a72766abcf1cac620e22233899d99 | [
"MIT"
] | null | null | null | src/flower/layer/dropout.cpp | Fs02/Flower | b2a91c78fc6a72766abcf1cac620e22233899d99 | [
"MIT"
] | null | null | null | #include <flower/layer/dropout.h>
#include <cmath>
using namespace flower;
Dropout::Dropout(double probabilty)
: ILayerDef(), probability_(probabilty)
{}
layer_ptr Dropout::create(Net *net) const
{
return std::make_shared<DropoutLayer>(net, *this);
}
DropoutLayer::DropoutLayer(Net *net, const Dropout &defin... | 22.974359 | 96 | 0.678571 | Fs02 |
23da4c60992b779b19b86e9c2838dcb8cd53f88a | 398 | hpp | C++ | src/Utils.hpp | robifr/snake | 611c6cc0460a92cca7e033108be13510aeba6b69 | [
"MIT"
] | null | null | null | src/Utils.hpp | robifr/snake | 611c6cc0460a92cca7e033108be13510aeba6b69 | [
"MIT"
] | null | null | null | src/Utils.hpp | robifr/snake | 611c6cc0460a92cca7e033108be13510aeba6b69 | [
"MIT"
] | null | null | null | #pragma once
#include <SDL.h>
#include <SDL_ttf.h>
struct My_SDL_Deleter {
void operator()(SDL_Window* p) const { SDL_DestroyWindow(p); }
void operator()(SDL_Renderer* p) const { SDL_DestroyRenderer(p); }
void operator()(SDL_Texture* p) const { SDL_DestroyTexture(p); }
void operator()(SDL_Surface* p) const { SDL_... | 33.166667 | 67 | 0.71608 | robifr |
23da4f11060e930c31d6fed9e4ad7de50db33474 | 686 | cpp | C++ | plugins/gdifont/src/get_text_metrics.cpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | plugins/gdifont/src/get_text_metrics.cpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | plugins/gdifont/src/get_text_metrics.cpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 3 | 2018-05-11T01:11:34.000Z | 2021-04-24T19:47:45.000Z | // Copyright Carl Philipp Reh 2006 - 2019.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <sge/font/exception.hpp>
#include <sge/gdifont/device_context.hpp>
#include <sge/gdifont/g... | 32.666667 | 100 | 0.734694 | cpreh |
23db41847375c135f27605b198c71aba58e9244d | 2,894 | cpp | C++ | code/src/engine/task/scheduler_dummy.cpp | shossjer/fimbulwinter | d894e4bddb5d2e6dc31a8112d245c6a1828604e3 | [
"0BSD"
] | 3 | 2020-04-29T14:55:58.000Z | 2020-08-20T08:43:24.000Z | code/src/engine/task/scheduler_dummy.cpp | shossjer/fimbulwinter | d894e4bddb5d2e6dc31a8112d245c6a1828604e3 | [
"0BSD"
] | 1 | 2022-03-12T11:37:46.000Z | 2022-03-12T20:17:38.000Z | code/src/engine/task/scheduler_dummy.cpp | shossjer/fimbulwinter | d894e4bddb5d2e6dc31a8112d245c6a1828604e3 | [
"0BSD"
] | null | null | null | #include "config.h"
#if TASK_USE_DUMMY
#include "core/async/Thread.hpp"
#include "core/container/Queue.hpp"
#include "core/sync/Event.hpp"
#include "engine/task/scheduler.hpp"
#include "utility/any.hpp"
#include "utility/optional.hpp"
#include "utility/variant.hpp"
namespace
{
struct Work
{
engine::Hash strand... | 17.754601 | 115 | 0.671389 | shossjer |
23e2cf346822e124d7474943c2e1bf9f7a2d5db3 | 8,024 | cpp | C++ | gui/src/SearchWindow.cpp | eosswedenorg/eosio-keygen | a73689e275a893b719608fe3808eddc030833cf1 | [
"MIT"
] | 1 | 2020-04-23T09:23:30.000Z | 2020-04-23T09:23:30.000Z | gui/src/SearchWindow.cpp | eosswedenorg/eosio-keygen | a73689e275a893b719608fe3808eddc030833cf1 | [
"MIT"
] | 16 | 2019-12-20T14:02:01.000Z | 2021-05-07T11:59:52.000Z | gui/src/SearchWindow.cpp | eosswedenorg/eosio-keygen | a73689e275a893b719608fe3808eddc030833cf1 | [
"MIT"
] | 3 | 2020-02-14T04:04:45.000Z | 2020-04-23T09:23:44.000Z | /**
* MIT License
*
* Copyright (c) 2020-2021 EOS Sw/eden
*
* 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... | 28.154386 | 126 | 0.709621 | eosswedenorg |
23e937c0481d5c9fc19d66de45f00e03d74891bb | 3,482 | cpp | C++ | cpp/logger.cpp | s-bear/miscellanea | 6f1398289e3c73057aa89ebcf926a57139ead380 | [
"Unlicense"
] | null | null | null | cpp/logger.cpp | s-bear/miscellanea | 6f1398289e3c73057aa89ebcf926a57139ead380 | [
"Unlicense"
] | null | null | null | cpp/logger.cpp | s-bear/miscellanea | 6f1398289e3c73057aa89ebcf926a57139ead380 | [
"Unlicense"
] | null | null | null |
// This is free and unencumbered software released into the public domain.
#include "logger.hpp"
#include <sstream>
#include <cstdio>
#include <functional>
namespace logging {
logger_t logger;
level_t str_to_level(const std::string& str) {
if(str == "debug") return logging::debug;
else if(str... | 20.850299 | 79 | 0.601091 | s-bear |
23eb150e93023a0bf2eea82377684efb921bc2cc | 1,224 | cpp | C++ | 361/a.cpp | vladshablinsky/algo | 815392708d00dc8d3159b4866599de64fa9d34fa | [
"MIT"
] | 1 | 2021-10-24T00:46:37.000Z | 2021-10-24T00:46:37.000Z | 361/a.cpp | vladshablinsky/algo | 815392708d00dc8d3159b4866599de64fa9d34fa | [
"MIT"
] | null | null | null | 361/a.cpp | vladshablinsky/algo | 815392708d00dc8d3159b4866599de64fa9d34fa | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> v;
bool can_right(int x) {
return x != 3 && x != 9 && x != 6 && x != 0;
}
bool can_left(int x) {
return x != 1 && x != 4 && x != 7 && x != 0;
}
bool can_down(int x) {
return x != 7 && x != 0 && x != ... | 14.926829 | 46 | 0.430556 | vladshablinsky |
23ed8b868f27f5f6e73a2d09a277025f0bb0464c | 6,158 | cc | C++ | tests/inter/inter.cc | DavidFarago/crab | c5fba9a132afea11c10f2790d232d192b2d0ae9c | [
"Apache-2.0"
] | null | null | null | tests/inter/inter.cc | DavidFarago/crab | c5fba9a132afea11c10f2790d232d192b2d0ae9c | [
"Apache-2.0"
] | null | null | null | tests/inter/inter.cc | DavidFarago/crab | c5fba9a132afea11c10f2790d232d192b2d0ae9c | [
"Apache-2.0"
] | 1 | 2020-03-01T12:33:53.000Z | 2020-03-01T12:33:53.000Z | #include "../program_options.hpp"
#include "../common.hpp"
#include <crab/cg/cg_bgl.hpp>
#include <crab/analysis/graphs/sccg_bgl.hpp>
using namespace std;
using namespace crab::analyzer;
using namespace crab::cfg;
using namespace crab::cfg_impl;
using namespace crab::domain_impl;
using namespace crab::cg;
z_cfg_t* f... | 32.582011 | 98 | 0.655083 | DavidFarago |
23f23405a1b5eb52cc77c99528980fa9a84b5abd | 4,267 | cc | C++ | chats.cc | cadencorontzos/statsAndChats | aa402ce6215011f8d0ddf39d8426c6edf78705c9 | [
"Apache-2.0"
] | null | null | null | chats.cc | cadencorontzos/statsAndChats | aa402ce6215011f8d0ddf39d8426c6edf78705c9 | [
"Apache-2.0"
] | null | null | null | chats.cc | cadencorontzos/statsAndChats | aa402ce6215011f8d0ddf39d8426c6edf78705c9 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include "gram.hh"
// next_word_in(line):
//
// Process the characters of the std::string object 'line', seeking
// the next contiguous sequence of letters within that string.
//
// Once it has processed that next word, it modifies 'line' to exclude
// the prefix of processed characters from it, an... | 26.018293 | 92 | 0.599719 | cadencorontzos |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.