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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
bc841ce99a1fd1e3ebb122c560ef9326d1780878 | 3,851 | cpp | C++ | src/server.cpp | paxakor/cache_server | 5d8b93559fd3cec2ef0769bad8c92753586ebb7b | [
"MIT"
] | null | null | null | src/server.cpp | paxakor/cache_server | 5d8b93559fd3cec2ef0769bad8c92753586ebb7b | [
"MIT"
] | null | null | null | src/server.cpp | paxakor/cache_server | 5d8b93559fd3cec2ef0769bad8c92753586ebb7b | [
"MIT"
] | null | null | null | // Copyright 2016-2017, Pavel Korozevtsev.
#include <unistd.h>
#include "include/defs.hpp"
#include "include/filesystem.hpp"
#include "include/log.hpp"
#include "include/server.hpp"
#include "include/utils.hpp"
namespace pkr {
Server::Server(const ServerConfig& cfg)
: max_threads(cfg.max_threads)
, working_... | 26.743056 | 80 | 0.589717 | paxakor |
bc8477cd3157f57e6c6020e17217167d153f0e1e | 1,376 | cpp | C++ | facebook/2016/round2/2/main.cpp | seirion/code | 3b8bf79764107255185061cec33decbc2235d03a | [
"Apache-2.0"
] | 13 | 2015-06-07T09:26:26.000Z | 2019-05-01T13:23:38.000Z | facebook/2016/round2/2/main.cpp | seirion/code | 3b8bf79764107255185061cec33decbc2235d03a | [
"Apache-2.0"
] | null | null | null | facebook/2016/round2/2/main.cpp | seirion/code | 3b8bf79764107255185061cec33decbc2235d03a | [
"Apache-2.0"
] | 4 | 2016-03-05T06:21:05.000Z | 2017-02-17T15:34:18.000Z | // Facebook Hacker Cup 2016 Round 2
// Carnival Coins
// https://www.facebook.com/hackercup/problem/1627951250755660/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
int n, k;
double p;
double mylog[3002];
void input() {
cin >> n >> k >> p;
}
voi... | 19.111111 | 63 | 0.479651 | seirion |
bc856ef6913e5c9219b5803c217e98499d655550 | 523 | cpp | C++ | src/plugins/picture/pictureplugin.cpp | qtmediahub/qtmediahub-ruins | 844c71dbd7bcbd94a6ba76b952b7d1850e3ddc67 | [
"BSD-3-Clause"
] | null | null | null | src/plugins/picture/pictureplugin.cpp | qtmediahub/qtmediahub-ruins | 844c71dbd7bcbd94a6ba76b952b7d1850e3ddc67 | [
"BSD-3-Clause"
] | null | null | null | src/plugins/picture/pictureplugin.cpp | qtmediahub/qtmediahub-ruins | 844c71dbd7bcbd94a6ba76b952b7d1850e3ddc67 | [
"BSD-3-Clause"
] | null | null | null | #include "pictureplugin.h"
#include <QtPlugin>
PicturePlugin::PicturePlugin()
{
m_model = new PictureModel(this);
}
QObject *PicturePlugin::pluginProperties() const
{
return const_cast<PicturePlugin *>(this);
}
void PicturePlugin::registerPlugin(QDeclarativeContext *context)
{
//FIXME: these structures ... | 21.791667 | 93 | 0.743786 | qtmediahub |
bc8cb88c93e47587c84163d445339aeaa39edd1c | 1,185 | cpp | C++ | Linked_Lsit/Circular Linked List/Sorted inserted for circle linked list.cpp | linyos/GreekForGeeks-Practice | eaabce3ac9e45a86dfb28f2296129c2016e570bf | [
"MIT"
] | null | null | null | Linked_Lsit/Circular Linked List/Sorted inserted for circle linked list.cpp | linyos/GreekForGeeks-Practice | eaabce3ac9e45a86dfb28f2296129c2016e570bf | [
"MIT"
] | null | null | null | Linked_Lsit/Circular Linked List/Sorted inserted for circle linked list.cpp | linyos/GreekForGeeks-Practice | eaabce3ac9e45a86dfb28f2296129c2016e570bf | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <map>
#include <stack>
#include<vector>
#include <math.h>
#include <algorithm>
using namespace std;
class Node
{
public:
int data;
Node * next;
};
void SortedInsert(Node ** head_ref, Node * newNode) {
Node * current = *head_ref;
if (current == NULL) {
newNode->ne... | 14.277108 | 75 | 0.587342 | linyos |
bc8e57bc7f012ca797c169d55047b9b6f2b733bd | 1,816 | cpp | C++ | src/hgs-TV/Decomposition/RouteSequence/BarycentreClusteringDecomposition.cpp | alberto-santini/cvrp-decomposition | 854d2b5b7cdd51fe4ab46acac7d88dbc7e5bfb88 | [
"MIT"
] | null | null | null | src/hgs-TV/Decomposition/RouteSequence/BarycentreClusteringDecomposition.cpp | alberto-santini/cvrp-decomposition | 854d2b5b7cdd51fe4ab46acac7d88dbc7e5bfb88 | [
"MIT"
] | null | null | null | src/hgs-TV/Decomposition/RouteSequence/BarycentreClusteringDecomposition.cpp | alberto-santini/cvrp-decomposition | 854d2b5b7cdd51fe4ab46acac7d88dbc7e5bfb88 | [
"MIT"
] | null | null | null | #include "BarycentreClusteringDecomposition.h"
#include "../ClusteringUtils/KMeans.h"
namespace genvrp {
RouteSequenceDecomposition::SPList BarycentreClusteringDecomposition::getSubproblems(const Individual& mpIndividual, const SolverStatus& status) const {
using namespace kmeans;
#ifndef BATCH_MODE
... | 41.272727 | 156 | 0.647577 | alberto-santini |
bc936812afa4d6abd49cdc83203b12d4d86623a3 | 4,913 | cpp | C++ | Engine/sdk/src/lwSysGraphics.cpp | ruuuubi/corsairs-client | ddbcd293d6ef3f58ff02290c02382cbb7e0939a2 | [
"Apache-2.0"
] | 1 | 2021-06-14T09:34:08.000Z | 2021-06-14T09:34:08.000Z | Engine/sdk/src/lwSysGraphics.cpp | ruuuubi/corsairs-client | ddbcd293d6ef3f58ff02290c02382cbb7e0939a2 | [
"Apache-2.0"
] | null | null | null | Engine/sdk/src/lwSysGraphics.cpp | ruuuubi/corsairs-client | ddbcd293d6ef3f58ff02290c02382cbb7e0939a2 | [
"Apache-2.0"
] | null | null | null | //
#include "lwSysGraphics.h"
#include "lwDeviceObject.h"
#include "lwResourceMgr.h"
#include "lwSceneMgr.h"
LW_BEGIN
lwISysGraphics* lwSysGraphics::__sys_graphics = LW_NULL;
LW_STD_RELEASE( lwSysGraphics );
//LW_STD_IMPLEMENTATION( lwSysGraphics );
LW_RESULT lwSysGraphics::GetInterface( LW_VOID** i, lwGUID guid... | 20.301653 | 92 | 0.619784 | ruuuubi |
bc95184e86a406df2dad688948c9f3f89d15f8f7 | 6,025 | cpp | C++ | Violation/violation.cpp | AngusRitossa/Heaps | 0658004f4a209387de2fb1490ce0c1ae890b40de | [
"MIT"
] | 4 | 2018-07-10T07:34:25.000Z | 2021-08-20T05:21:11.000Z | Violation/violation.cpp | AngusRitossa/Heaps | 0658004f4a209387de2fb1490ce0c1ae890b40de | [
"MIT"
] | null | null | null | Violation/violation.cpp | AngusRitossa/Heaps | 0658004f4a209387de2fb1490ce0c1ae890b40de | [
"MIT"
] | null | null | null | #include <algorithm>
// Minimum violation heap, O(1) push, decrease-key, merge. O(log(n)) pop
template<class T> struct ViolationNode
{
typedef struct ViolationNode<T>* pnode;
T val;
int rank;
bool isRoot;
pnode child, left, right; // Pointer two leftmost child, right/left nodes in sibling linked list/main linked l... | 22.314815 | 133 | 0.588216 | AngusRitossa |
bc99671b8122a291e8cf6de8247ff05b424166f2 | 31 | cpp | C++ | ege/sfml/SFML.cpp | sppmacd/ege | a82ff6fccc8ac1bce5a50ed5a8f101b63f58b020 | [
"MIT"
] | 1 | 2020-12-30T17:21:11.000Z | 2020-12-30T17:21:11.000Z | ege/sfml/SFML.cpp | sppmacd/ege | a82ff6fccc8ac1bce5a50ed5a8f101b63f58b020 | [
"MIT"
] | 20 | 2020-09-02T08:37:13.000Z | 2021-09-02T06:47:08.000Z | ege/sfml/SFML.cpp | sppmacd/ege | a82ff6fccc8ac1bce5a50ed5a8f101b63f58b020 | [
"MIT"
] | null | null | null | // dummy file to satisfy CMake
| 15.5 | 30 | 0.741935 | sppmacd |
bc9a0fa159afc0ebe783b190a6d4a32c38a78e08 | 84,913 | cpp | C++ | lua-bindings/lua_imguiDrawList_auto.cpp | gloomyzen/cocos2d-x-imgui | 5ec858cb6de5fc04b3b83d24d2052e26de1766a7 | [
"MIT"
] | null | null | null | lua-bindings/lua_imguiDrawList_auto.cpp | gloomyzen/cocos2d-x-imgui | 5ec858cb6de5fc04b3b83d24d2052e26de1766a7 | [
"MIT"
] | null | null | null | lua-bindings/lua_imguiDrawList_auto.cpp | gloomyzen/cocos2d-x-imgui | 5ec858cb6de5fc04b3b83d24d2052e26de1766a7 | [
"MIT"
] | null | null | null | #include "lua_imguiDrawList_auto.hpp"
#include "imgui_lua.hpp"
#include "scripting/lua-bindings/manual/tolua_fix.h"
#include "scripting/lua-bindings/manual/LuaBasicConversions.h"
#ifdef COCOS2D_DEBUG
#undef COCOS2D_DEBUG
#endif
namespace imgui
{
using ImDrawList = ImDrawList;
}
int lua_x_imguiDrawList_ImDrawList_... | 33.924491 | 139 | 0.65361 | gloomyzen |
bc9d66801c9baf84aea7a7101b11c9f16794bb9d | 467 | hpp | C++ | joint_limits_interface_extensions/include/joint_limits_interface_extensions/common_namespaces.hpp | smilerobotics/ros_control_extensions | 1eee21217708dcee80aa3d91b2c6415c1f4feffa | [
"MIT"
] | null | null | null | joint_limits_interface_extensions/include/joint_limits_interface_extensions/common_namespaces.hpp | smilerobotics/ros_control_extensions | 1eee21217708dcee80aa3d91b2c6415c1f4feffa | [
"MIT"
] | null | null | null | joint_limits_interface_extensions/include/joint_limits_interface_extensions/common_namespaces.hpp | smilerobotics/ros_control_extensions | 1eee21217708dcee80aa3d91b2c6415c1f4feffa | [
"MIT"
] | 1 | 2021-10-14T06:37:36.000Z | 2021-10-14T06:37:36.000Z | #ifndef JOINT_LIMITS_INTERFACE_EXTENSIONS_COMMON_NAMESPACES_HPP
#define JOINT_LIMITS_INTERFACE_EXTENSIONS_COMMON_NAMESPACES_HPP
namespace hardware_interface {}
namespace hardware_interface_extensions {}
namespace joint_limits_interface {}
namespace joint_limits_interface_extensions {
namespace hi = hardware_interfa... | 29.1875 | 63 | 0.880086 | smilerobotics |
bca5ae959feb660f5587ccbd6fd9c25c0d2c3a8b | 6,363 | hpp | C++ | include/jkl/ioc.hpp | feverzsj/jkl | 1ea32ff2495120cc901d29a9c351154ca1f565e4 | [
"MIT"
] | null | null | null | include/jkl/ioc.hpp | feverzsj/jkl | 1ea32ff2495120cc901d29a9c351154ca1f565e4 | [
"MIT"
] | null | null | null | include/jkl/ioc.hpp | feverzsj/jkl | 1ea32ff2495120cc901d29a9c351154ca1f565e4 | [
"MIT"
] | null | null | null | #pragma once
#include <jkl/config.hpp>
#include <jkl/util/log.hpp>
#include <boost/asio/signal_set.hpp>
#include <boost/asio/io_context.hpp>
#include <boost/asio/executor_work_guard.hpp>
#include <deque>
#include <memory>
#include <thread>
#include <atomic>
#include <optional>
#include <exception>
#include <type_trai... | 20.726384 | 102 | 0.550684 | feverzsj |
bca816cf593979740320e4b7b4c361ab984f3320 | 1,296 | cc | C++ | public/util/store/test/basic.cc | room77/77up | 736806fbf52a5e722e8e57ef5c248823b067175d | [
"MIT"
] | 3 | 2015-05-18T14:52:47.000Z | 2018-11-12T07:51:00.000Z | public/util/store/test/basic.cc | room77/77up | 736806fbf52a5e722e8e57ef5c248823b067175d | [
"MIT"
] | null | null | null | public/util/store/test/basic.cc | room77/77up | 736806fbf52a5e722e8e57ef5c248823b067175d | [
"MIT"
] | 3 | 2015-08-04T05:58:18.000Z | 2018-11-12T07:51:01.000Z | // Copyright 2013 B. Uygar Oztekin
// This library tests basic functionality including:
// - Create the store.
// - find()
// - checking an iterator against end();
#include "util/store/test/test_macros.h"
namespace store {
namespace test {
namespace {
template<class Store>
struct BasicFunctionality : public Tester<... | 25.92 | 74 | 0.621142 | room77 |
bcad3cfc14192df10750064557a9d0265835ed49 | 1,480 | cpp | C++ | CPlusPlus-Class/Formative 01.02 Enum/Formative 01.02 Enum.cpp | AlieuFriggeri/SAE921-GRP4100-CPlusPlus-Class-A.Friggeri | 137729b63d2f093bf8510faab79cd0c7a38e0f19 | [
"MIT"
] | null | null | null | CPlusPlus-Class/Formative 01.02 Enum/Formative 01.02 Enum.cpp | AlieuFriggeri/SAE921-GRP4100-CPlusPlus-Class-A.Friggeri | 137729b63d2f093bf8510faab79cd0c7a38e0f19 | [
"MIT"
] | null | null | null | CPlusPlus-Class/Formative 01.02 Enum/Formative 01.02 Enum.cpp | AlieuFriggeri/SAE921-GRP4100-CPlusPlus-Class-A.Friggeri | 137729b63d2f093bf8510faab79cd0c7a38e0f19 | [
"MIT"
] | null | null | null | // Formative 01.02 Enum.cpp : Ce fichier contient la fonction 'main'. L'exécution du programme commence et se termine à cet endroit.
//
#include <iostream>
char animalChoisi = 'r';
enum class animaux : char{
Lion = 'l',
Souris ='s',
Chat='c',
Chien='h',
Pigeon='p',
Mouton='m'
};
std::string cr... | 23.492063 | 152 | 0.576351 | AlieuFriggeri |
bcb2b9a45e918a5c1b5aba88f13a60982bf1f9b4 | 9,447 | inl | C++ | Library/Sources/Stroika/Foundation/Containers/Concrete/Queue_Array.inl | SophistSolutions/Stroika | f4e5d84767903a054fba0a6b9c7c4bd1aaefd105 | [
"MIT"
] | 28 | 2015-09-22T21:43:32.000Z | 2022-02-28T01:35:01.000Z | Library/Sources/Stroika/Foundation/Containers/Concrete/Queue_Array.inl | SophistSolutions/Stroika | f4e5d84767903a054fba0a6b9c7c4bd1aaefd105 | [
"MIT"
] | 98 | 2015-01-22T03:21:27.000Z | 2022-03-02T01:47:00.000Z | Library/Sources/Stroika/Foundation/Containers/Concrete/Queue_Array.inl | SophistSolutions/Stroika | f4e5d84767903a054fba0a6b9c7c4bd1aaefd105 | [
"MIT"
] | 4 | 2019-02-21T16:45:25.000Z | 2022-02-18T13:40:04.000Z | /*
* Copyright(c) Sophist Solutions, Inc. 1990-2021. All rights reserved
*/
#ifndef _Stroika_Foundation_Containers_Concrete_Queue_Array_inl_
#define _Stroika_Foundation_Containers_Concrete_Queue_Array_inl_
/*
********************************************************************************
************************... | 41.434211 | 205 | 0.610882 | SophistSolutions |
bcb84447bb2c9844c9a10302927ffb42ed8bc554 | 927 | cpp | C++ | common/stderr_log.cpp | free1978/mapbox-gl-native | 2a50fccd24e762d0de5a53bac358e5ddfea8d213 | [
"BSD-2-Clause"
] | 2 | 2017-02-28T22:41:54.000Z | 2020-02-13T20:54:55.000Z | common/stderr_log.cpp | free1978/mapbox-gl-native | 2a50fccd24e762d0de5a53bac358e5ddfea8d213 | [
"BSD-2-Clause"
] | null | null | null | common/stderr_log.cpp | free1978/mapbox-gl-native | 2a50fccd24e762d0de5a53bac358e5ddfea8d213 | [
"BSD-2-Clause"
] | null | null | null | #include "stderr_log.hpp"
#include <iostream>
#include <cstdarg>
namespace mbgl {
void StderrLogBackend::record(EventSeverity severity, Event event, const std::string &msg) {
std::cerr << "[" << severity << "] " << event << ": " << msg << std::endl;
}
void StderrLogBackend::record(EventSeverity severity, Event ... | 29.903226 | 106 | 0.596548 | free1978 |
bcbc5d1555e17c2fc9d709ebcafceb1ddedbd3ce | 677 | cpp | C++ | leetcode.com/1008 Construct Binary Search Tree from Preorder Traversal/better.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | 1 | 2020-08-20T11:02:49.000Z | 2020-08-20T11:02:49.000Z | leetcode.com/1008 Construct Binary Search Tree from Preorder Traversal/better.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | null | null | null | leetcode.com/1008 Construct Binary Search Tree from Preorder Traversal/better.cpp | sky-bro/AC | 29bfa3f13994612887e18065fa6e854b9a29633d | [
"MIT"
] | 1 | 2022-01-01T23:23:13.000Z | 2022-01-01T23:23:13.000Z | #include <iostream>
#include <vector>
#include "leetcode.hpp"
using namespace std;
// ref: [Java/C++/Python] O(N) Solution
// https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/discuss/252232/JavaC%2B%2BPython-O(N)-Solution
class Solution {
private:
TreeNode* helper(vector<int> nu... | 25.074074 | 132 | 0.660266 | sky-bro |
344a546188d296b112e1445f24d6273fea1137e0 | 3,603 | hpp | C++ | Axis/Graphics/GraphicsVulkan/Include/Axis/VulkanCommandBuffer.hpp | SimmyPeet/Axis | a58c073d13f74d0224fbfca34a4dcd4b9d0c6726 | [
"Apache-2.0"
] | 1 | 2022-01-23T14:51:51.000Z | 2022-01-23T14:51:51.000Z | Axis/Graphics/GraphicsVulkan/Include/Axis/VulkanCommandBuffer.hpp | SimmyPeet/Axis | a58c073d13f74d0224fbfca34a4dcd4b9d0c6726 | [
"Apache-2.0"
] | null | null | null | Axis/Graphics/GraphicsVulkan/Include/Axis/VulkanCommandBuffer.hpp | SimmyPeet/Axis | a58c073d13f74d0224fbfca34a4dcd4b9d0c6726 | [
"Apache-2.0"
] | 1 | 2022-01-10T21:01:54.000Z | 2022-01-10T21:01:54.000Z | /// \copyright Simmypeet - Copyright (C)
/// This file is subject to the terms and conditions defined in
/// file `LICENSE`, which is part of this source code package.
#ifndef AXIS_VULKANCOMMANDBUFFER_HPP
#define AXIS_VULKANCOMMANDBUFFER_HPP
#pragma once
#include "../../../../System/Include/Axis... | 37.14433 | 131 | 0.646128 | SimmyPeet |
344bc032ae60b15397aa06cac16212391f8bc630 | 4,645 | cpp | C++ | Othuum/VishalaNetworkLib/Protocoll/Client/LobbyConnector.cpp | Liech/Yathsou | 95b6dda3c053bc25789cce416088e22f54a743b4 | [
"MIT"
] | 5 | 2021-04-20T17:00:41.000Z | 2022-01-18T20:16:03.000Z | Othuum/VishalaNetworkLib/Protocoll/Client/LobbyConnector.cpp | Liech/Yathsou | 95b6dda3c053bc25789cce416088e22f54a743b4 | [
"MIT"
] | 7 | 2021-08-22T21:30:50.000Z | 2022-01-14T16:56:34.000Z | Othuum/VishalaNetworkLib/Protocoll/Client/LobbyConnector.cpp | Liech/Yathsou | 95b6dda3c053bc25789cce416088e22f54a743b4 | [
"MIT"
] | null | null | null | #include "LobbyConnector.h"
#include "Serializable/LoginInstructions.h"
#include <iostream>
#include "Core/BinaryPackage.h"
#include "Serializable/SelfBriefing.h"
namespace Vishala {
namespace Client {
LobbyConnector::LobbyConnector(int myPort, std::string ip, int port, SelfBriefing playerDescription) {
_... | 40.391304 | 160 | 0.683961 | Liech |
34534e4e3c3f96c60a896a0edb1b1c1ed128b8a2 | 2,004 | cc | C++ | nodes/P2K/p2k.cc | kgoba/roombreak | 6936d7003d2541fd3fb44bda0a31bf66439f35dc | [
"MIT"
] | 1 | 2021-06-16T07:55:28.000Z | 2021-06-16T07:55:28.000Z | nodes/P2K/p2k.cc | kgoba/roombreak | 6936d7003d2541fd3fb44bda0a31bf66439f35dc | [
"MIT"
] | 3 | 2016-04-04T14:13:42.000Z | 2016-04-04T15:07:24.000Z | nodes/P2K/p2k.cc | kgoba/roombreak | 6936d7003d2541fd3fb44bda0a31bf66439f35dc | [
"MIT"
] | 1 | 2021-06-16T07:55:30.000Z | 2021-06-16T07:55:30.000Z | #include "p2k.h"
#include <util/delay.h>
// I2C subaddress (A0-A2 pins)
#define SUBADDRESS 0
/*
// pin bit numbers at MCP chip (0 - PA0, 7 - PB7, 8 - PB0, 15 - PB7)
#define PIN_LED1 (8+7)
#define PIN_LED2 (8+6)
#define PIN_J1 (8+5)
#define PIN_J2 (8+4)
#define PIN_J3 (8+3... | 21.319149 | 77 | 0.603293 | kgoba |
3455b377e4ca3fd2e49d3c03fa1c5e149042a6ac | 566 | cpp | C++ | project_euler/007/7.cpp | jason24585/practice | 6f3f961f766d80c73e1855e4b6f4cb167625a22a | [
"MIT"
] | null | null | null | project_euler/007/7.cpp | jason24585/practice | 6f3f961f766d80c73e1855e4b6f4cb167625a22a | [
"MIT"
] | null | null | null | project_euler/007/7.cpp | jason24585/practice | 6f3f961f766d80c73e1855e4b6f4cb167625a22a | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <cmath>
int main(){
std::vector<int> primes;
int n = 10001;
int num = 2;
bool isPrime = true;
while(true){
for(int i = 2; i <= sqrt(num); i++){
if(num % i == 0){
isPrime = false;
break;
}... | 17.6875 | 44 | 0.416961 | jason24585 |
34566ec849c06507474a4ad55c8749f5a94aae5b | 5,067 | cpp | C++ | libs/fnd/numeric/test/src/unit_test_fnd_numeric_midpoint.cpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 4 | 2018-06-10T13:35:32.000Z | 2021-06-03T14:27:41.000Z | libs/fnd/numeric/test/src/unit_test_fnd_numeric_midpoint.cpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 566 | 2017-01-31T05:36:09.000Z | 2022-02-09T05:04:37.000Z | libs/fnd/numeric/test/src/unit_test_fnd_numeric_midpoint.cpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 1 | 2018-07-05T04:40:53.000Z | 2018-07-05T04:40:53.000Z | /**
* @file unit_test_fnd_numeric_midpoint.cpp
*
* @brief midpoint のテスト
*
* @author myoukaku
*/
#include <bksge/fnd/numeric/midpoint.hpp>
#include <bksge/fnd/config.hpp>
#include <gtest/gtest.h>
#include <limits>
#include "constexpr_test.hpp"
BKSGE_WARNING_PUSH();
BKSGE_WARNING_DISABLE_MSVC(4307... | 35.683099 | 84 | 0.647918 | myoukaku |
345b34a39cea5d8f07d12affb37387b1d6f16077 | 12,549 | cpp | C++ | lib/CodeGen/ScopeExitActions.cpp | scross99/locic | a24bb380e17f8af69e7389acf8ce354c91a2abf3 | [
"MIT"
] | 80 | 2015-02-19T21:38:57.000Z | 2016-05-25T06:53:12.000Z | lib/CodeGen/ScopeExitActions.cpp | scross99/locic | a24bb380e17f8af69e7389acf8ce354c91a2abf3 | [
"MIT"
] | 8 | 2015-02-20T09:47:20.000Z | 2015-11-13T07:49:17.000Z | lib/CodeGen/ScopeExitActions.cpp | scross99/locic | a24bb380e17f8af69e7389acf8ce354c91a2abf3 | [
"MIT"
] | 6 | 2015-02-20T11:26:19.000Z | 2016-04-13T14:30:39.000Z | #include <stdexcept>
#include <vector>
#include <llvm-abi/TypeBuilder.hpp>
#include <locic/CodeGen/ArgInfo.hpp>
#include <locic/CodeGen/ConstantGenerator.hpp>
#include <locic/CodeGen/Exception.hpp>
#include <locic/CodeGen/Function.hpp>
#include <locic/CodeGen/IREmitter.hpp>
#include <locic/CodeGen/ScopeEmitter.hpp>
#... | 34.100543 | 120 | 0.67846 | scross99 |
346de0d89227426484691f172598873d22c30e6c | 1,059 | cpp | C++ | src/frontend/ast/treetypes/ASTFunAppExpr.cpp | mdclyburn/tipc | bdc968c2908c599738ec1e05a17d39c37e2c5fcb | [
"MIT"
] | null | null | null | src/frontend/ast/treetypes/ASTFunAppExpr.cpp | mdclyburn/tipc | bdc968c2908c599738ec1e05a17d39c37e2c5fcb | [
"MIT"
] | null | null | null | src/frontend/ast/treetypes/ASTFunAppExpr.cpp | mdclyburn/tipc | bdc968c2908c599738ec1e05a17d39c37e2c5fcb | [
"MIT"
] | null | null | null | #include "ASTFunAppExpr.h"
#include "ASTVisitor.h"
#include "ASTinternal.h"
std::vector<ASTExpr*> ASTFunAppExpr::getActuals() const {
return rawRefs(ACTUALS);
}
void ASTFunAppExpr::accept(ASTVisitor * visitor) {
if (visitor->visit(this)) {
getFunction()->accept(visitor);
for (auto a : getActuals()) {
... | 22.531915 | 61 | 0.616619 | mdclyburn |
347b00dbf52a87bf941576f44212525bb102f099 | 1,741 | cc | C++ | src/q_651_700/q0668.cc | vNaonLu/daily-leetcode | 2830c2cd413d950abe7c6d9b833c771f784443b0 | [
"MIT"
] | 2 | 2021-09-28T18:41:03.000Z | 2021-09-28T18:42:57.000Z | src/q_651_700/q0668.cc | vNaonLu/Daily_LeetCode | 30024b561611d390931cef1b22afd6a5060cf586 | [
"MIT"
] | 16 | 2021-09-26T11:44:20.000Z | 2021-11-28T06:44:02.000Z | src/q_651_700/q0668.cc | vNaonLu/daily-leetcode | 2830c2cd413d950abe7c6d9b833c771f784443b0 | [
"MIT"
] | 1 | 2021-11-22T09:11:36.000Z | 2021-11-22T09:11:36.000Z | #include <gtest/gtest.h>
#include <iostream>
using namespace std;
/**
* This file is generated by leetcode_add.py v1.0
*
* 668.
* Kth Smallest Number in Multiplication Table
*
* ––––––––––––––––––––––––––––– Description –––––––––––––––––––––––––––––
*
* Nearly everyone has used the <a
* href="https:... | 23.213333 | 74 | 0.508329 | vNaonLu |
347bc89c0120cbeae8e12271a8ee8692ce3823ea | 1,676 | cpp | C++ | Source/Server/Platform/Linux/LinuxPlatform.cpp | stosSe4r/ds3os | 1e7819449ce12efc618e26f4abca6448cf819b37 | [
"MIT"
] | 1 | 2022-01-28T21:46:59.000Z | 2022-01-28T21:46:59.000Z | Source/Server/Platform/Linux/LinuxPlatform.cpp | stosSe4r/ds3os | 1e7819449ce12efc618e26f4abca6448cf819b37 | [
"MIT"
] | null | null | null | Source/Server/Platform/Linux/LinuxPlatform.cpp | stosSe4r/ds3os | 1e7819449ce12efc618e26f4abca6448cf819b37 | [
"MIT"
] | null | null | null | /*
* Dark Souls 3 - Open Server
* Copyright (C) 2021 Tim Leonard
*
* This program is free software; licensed under the MIT license.
* You should have received a copy of the license along with this program.
* If not, see <https://opensource.org/licenses/MIT>.
*/
#include "Core/Utils/Logging.h"
#include "Platform... | 21.21519 | 74 | 0.671241 | stosSe4r |
347c8fcaab1c8a44ade3f6970841cd4c7f1a31f9 | 1,490 | hpp | C++ | satellite/include/Console.hpp | terra-render/Terra | fe2404b70f828ac807f776b25d4f5d702952c25b | [
"MIT"
] | 10 | 2017-05-18T12:33:49.000Z | 2019-11-05T00:21:16.000Z | satellite/include/Console.hpp | sparkon/Terra | 49ba88604dea35b450b0b61b3048ad1d3ef0d27b | [
"MIT"
] | 1 | 2019-08-15T04:09:05.000Z | 2019-08-15T23:55:35.000Z | satellite/include/Console.hpp | sparkon/Terra | 49ba88604dea35b450b0b61b3048ad1d3ef0d27b | [
"MIT"
] | 1 | 2018-02-04T07:14:12.000Z | 2018-02-04T07:14:12.000Z | #pragma once
// stdlib
#include <vector>
#include <functional>
#include <string>
// Satellite
#include <Graphics.hpp>
class Console;
using CommandArgs = std::vector<std::string>;
using CommandCallback = std::function<int ( const CommandArgs& args ) >;
struct ImGuiTextEditCallbackData;
struct ImFont... | 26.140351 | 99 | 0.609396 | terra-render |
347d92c45219ba671142fb7753fb7644679c1a9a | 362 | cpp | C++ | source/get_dividend.cpp | tonradev/programmiersprachen-aufgabe-1 | d5ddaf9f78058cd7ba7c75343db4db7517004f27 | [
"MIT"
] | null | null | null | source/get_dividend.cpp | tonradev/programmiersprachen-aufgabe-1 | d5ddaf9f78058cd7ba7c75343db4db7517004f27 | [
"MIT"
] | null | null | null | source/get_dividend.cpp | tonradev/programmiersprachen-aufgabe-1 | d5ddaf9f78058cd7ba7c75343db4db7517004f27 | [
"MIT"
] | null | null | null | // Aufgabe 1.3
#include <iostream>
#include <cmath>
int get_dividend() {
int number = 1;
for (int i = 1; i < 21; ++i) {
if(number%i != 0) {
number += 1;
i = 1;
}
else {
continue;
}
}
std:: cout << number;
return number;
}
int mai... | 14.48 | 34 | 0.428177 | tonradev |
3480db8f212890bfe8c25f0dba687e3ada83078d | 2,132 | cpp | C++ | src/ResourceManager.cpp | fuzzblob/YoAudio | 714117d6a4d418259e192f491cc743d980558824 | [
"MIT"
] | 9 | 2018-12-10T02:53:07.000Z | 2022-01-23T12:04:44.000Z | src/ResourceManager.cpp | fuzzblob/YoAudio | 714117d6a4d418259e192f491cc743d980558824 | [
"MIT"
] | null | null | null | src/ResourceManager.cpp | fuzzblob/YoAudio | 714117d6a4d418259e192f491cc743d980558824 | [
"MIT"
] | 1 | 2018-01-21T18:49:10.000Z | 2018-01-21T18:49:10.000Z | #include "ResourceManager.h"
#include "Platform.h"
#include "Log.h"
#include "AudioDevice.h"
std::shared_ptr<Sample> ResourceManager::GetSound(const std::string & filename)
{
if (assetPath.size() == 0) {
auto sdl_path = SDL_GetBasePath();
assetPath = std::string(sdl_path);
assetPath.append("assets/");
SDL_fr... | 26.65 | 96 | 0.713415 | fuzzblob |
3482f19e829e4d198ccf32f7e448c1cebcfaf8a5 | 4,153 | cxx | C++ | PHOS/PHOSbase/AliPHOSTrackSegmentMaker.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 52 | 2016-12-11T13:04:01.000Z | 2022-03-11T11:49:35.000Z | PHOS/PHOSbase/AliPHOSTrackSegmentMaker.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 1,388 | 2016-11-01T10:27:36.000Z | 2022-03-30T15:26:09.000Z | PHOS/PHOSbase/AliPHOSTrackSegmentMaker.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 275 | 2016-06-21T20:24:05.000Z | 2022-03-31T13:06:19.000Z | /**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors ... | 31.462121 | 94 | 0.674693 | AllaMaevskaya |
3488b94e87d441e28f453a7da8cdc3feefdc11bf | 5,062 | cpp | C++ | src/all/frm/core/BasicRenderer/ImageLightComponent.cpp | john-chapman/GfxSampleFramework | 6c19d1c7fdf28d8a74884876aa8839b4b982d65a | [
"MIT"
] | 19 | 2017-02-22T21:02:44.000Z | 2021-05-19T16:41:30.000Z | src/all/frm/core/BasicRenderer/ImageLightComponent.cpp | john-chapman/GfxSampleFramework | 6c19d1c7fdf28d8a74884876aa8839b4b982d65a | [
"MIT"
] | 68 | 2016-11-14T17:48:54.000Z | 2021-11-08T13:41:06.000Z | src/all/frm/core/BasicRenderer/ImageLightComponent.cpp | john-chapman/GfxSampleFramework | 6c19d1c7fdf28d8a74884876aa8839b4b982d65a | [
"MIT"
] | 7 | 2017-05-05T17:49:02.000Z | 2020-12-31T06:51:13.000Z | #include "ImageLightComponent.h"
#include <frm/core/types.h>
#include <frm/core/Image.h>
#include <frm/core/GlContext.h>
#include <frm/core/Profiler.h>
#include <frm/core/Serializable.inl>
#include <frm/core/Shader.h>
#include <frm/core/Texture.h>
#include <imgui/imgui.h>
namespace frm {
FRM_COMPONENT_DEFINE(ImageL... | 24.935961 | 118 | 0.716713 | john-chapman |
34909f0629dbf99d78c024f01fa8f8786435faa6 | 180 | cpp | C++ | cml/source/MMemoryProxy.cpp | WhyWolfie/Repack-Aren | 4839db138a502ca4cfac8c2a8c950f1b59064955 | [
"FSFAP"
] | null | null | null | cml/source/MMemoryProxy.cpp | WhyWolfie/Repack-Aren | 4839db138a502ca4cfac8c2a8c950f1b59064955 | [
"FSFAP"
] | null | null | null | cml/source/MMemoryProxy.cpp | WhyWolfie/Repack-Aren | 4839db138a502ca4cfac8c2a8c950f1b59064955 | [
"FSFAP"
] | null | null | null | #include "stdafx.h"
#include "MMemoryProxy.h"
void (*g_fpOnCrcFail)() = 0;
MCrc32Container g_crc32Container;
MCrc32Container* GetCrcContainer()
{
return &g_crc32Container;
}
| 12.857143 | 34 | 0.75 | WhyWolfie |
3495adbf56cb7ddc0914bc23eb8abe782598f357 | 128 | hpp | C++ | Vendor/GLM/glm/ext/vector_bool1.hpp | wdrDarx/DEngine3 | 27e2de3b56b6d4c8705e8a0e36f5911d8651caa2 | [
"MIT"
] | 2 | 2022-01-11T21:15:31.000Z | 2022-02-22T21:14:33.000Z | Vendor/GLM/glm/ext/vector_bool1.hpp | wdrDarx/DEngine3 | 27e2de3b56b6d4c8705e8a0e36f5911d8651caa2 | [
"MIT"
] | null | null | null | Vendor/GLM/glm/ext/vector_bool1.hpp | wdrDarx/DEngine3 | 27e2de3b56b6d4c8705e8a0e36f5911d8651caa2 | [
"MIT"
] | null | null | null | version https://git-lfs.github.com/spec/v1
oid sha256:50f4a314e5e58d4d9905d21c5e7f61a93fea6c904e3715c40363d7483f4dc881
size 649
| 32 | 75 | 0.882813 | wdrDarx |
349b557295f0949e0c8ef69e31cf89e80f022e7c | 493 | hpp | C++ | include/hadouken/scripting/modules/bencoding_module.hpp | hadouken/hadouken | bb89164f324bb6a2c4a17c0d39a28f7a7f40bea9 | [
"MIT"
] | 338 | 2015-01-09T06:29:33.000Z | 2022-02-28T22:48:37.000Z | include/hadouken/scripting/modules/bencoding_module.hpp | vktr/hadouken | bb89164f324bb6a2c4a17c0d39a28f7a7f40bea9 | [
"MIT"
] | 161 | 2015-01-08T21:14:10.000Z | 2020-08-31T12:53:17.000Z | include/hadouken/scripting/modules/bencoding_module.hpp | hadouken/hadouken | bb89164f324bb6a2c4a17c0d39a28f7a7f40bea9 | [
"MIT"
] | 76 | 2015-02-05T19:32:56.000Z | 2020-08-30T21:36:35.000Z | #ifndef HADOUKEN_SCRIPTING_MODULES_BENCODINGMODULE_HPP
#define HADOUKEN_SCRIPTING_MODULES_BENCODINGMODULE_HPP
namespace hadouken
{
namespace scripting
{
namespace modules
{
class bencoding_module
{
public:
static int initialize(voi... | 21.434783 | 55 | 0.535497 | hadouken |
349b75a2967c3ce7386a6b8dc26317b3cdef11fb | 201 | cpp | C++ | core/src/Util/Util.cpp | tokongs/yage | 14c9411d8efce08b89c0deb134b5c3023a32c577 | [
"MIT"
] | null | null | null | core/src/Util/Util.cpp | tokongs/yage | 14c9411d8efce08b89c0deb134b5c3023a32c577 | [
"MIT"
] | null | null | null | core/src/Util/Util.cpp | tokongs/yage | 14c9411d8efce08b89c0deb134b5c3023a32c577 | [
"MIT"
] | null | null | null | #include <Util.h>
std::string getCurrentWorkingDir( void ) {
char buff[FILENAME_MAX];
getCurrentDir( buff, FILENAME_MAX );
std::string current_working_dir(buff);
return current_working_dir;
} | 25.125 | 42 | 0.751244 | tokongs |
349e03430a3c58f69c5f987ace4779e4b50c9cd1 | 1,266 | cpp | C++ | SH1/Balance a Binary Search Tree.cpp | shtanriverdi/CS487-Introduction-to-Competitive-Programming-Progress | 0d7a4fa4346ee08d9b2b2f628c3ffab7f3f81166 | [
"MIT"
] | 4 | 2019-12-12T19:59:50.000Z | 2020-01-20T15:44:44.000Z | SH1/Balance a Binary Search Tree.cpp | shtanriverdi/CS487-Introduction-to-Competitive-Programming-Progress | 0d7a4fa4346ee08d9b2b2f628c3ffab7f3f81166 | [
"MIT"
] | null | null | null | SH1/Balance a Binary Search Tree.cpp | shtanriverdi/CS487-Introduction-to-Competitive-Programming-Progress | 0d7a4fa4346ee08d9b2b2f628c3ffab7f3f81166 | [
"MIT"
] | null | null | null | // Question Link ---> https://leetcode.com/problems/balance-a-binary-search-tree/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
... | 31.65 | 83 | 0.537125 | shtanriverdi |
34a09101973e845c1a9d64da4ae9fcdc974dd73d | 1,588 | hpp | C++ | src/color/hsl/akin/YPbPr.hpp | 3l0w/color | e42d0933b6b88564807bcd5f49e9c7f66e24990a | [
"Apache-2.0"
] | 120 | 2015-12-31T22:30:14.000Z | 2022-03-29T15:08:01.000Z | src/color/hsl/akin/YPbPr.hpp | 3l0w/color | e42d0933b6b88564807bcd5f49e9c7f66e24990a | [
"Apache-2.0"
] | 6 | 2016-08-22T02:14:56.000Z | 2021-11-06T22:39:52.000Z | src/color/hsl/akin/YPbPr.hpp | 3l0w/color | e42d0933b6b88564807bcd5f49e9c7f66e24990a | [
"Apache-2.0"
] | 23 | 2016-02-03T01:56:26.000Z | 2021-09-28T16:36:27.000Z | #ifndef color_hsl_akin_YPbPr
#define color_hsl_akin_YPbPr
#include "../../generic/akin/hsl.hpp"
#include "../category.hpp"
#include "../../YPbPr/category.hpp"
namespace color
{
namespace akin
{
template< ::color::constant::YPbPr::reference_enum reference_number >struct hsl< ::color::category::Y... | 63.52 | 192 | 0.731738 | 3l0w |
34a3c2a3bfadd0de2b8e14b2b41d50ef96dfb2e7 | 1,429 | cpp | C++ | C++/Miscellaneous/range_sum_segment_tree.cpp | SanjogSamuelSamantaray/algorithmsUse | c7ce8255e4e06741e64953a84e188a4fdba3c949 | [
"MIT"
] | 12 | 2020-10-01T18:17:49.000Z | 2021-03-24T18:37:36.000Z | C++/Miscellaneous/range_sum_segment_tree.cpp | SanjogSamuelSamantaray/algorithmsUse | c7ce8255e4e06741e64953a84e188a4fdba3c949 | [
"MIT"
] | 94 | 2020-10-01T17:35:11.000Z | 2021-03-26T10:44:15.000Z | C++/Miscellaneous/range_sum_segment_tree.cpp | SanjogSamuelSamantaray/algorithmsUse | c7ce8255e4e06741e64953a84e188a4fdba3c949 | [
"MIT"
] | 142 | 2020-10-01T17:38:56.000Z | 2021-12-02T11:10:18.000Z | // Point update and range query using segment tree
#include<bits/stdc++.h>
using namespace std;
#define N 100005
// Vector to store segment tree values
vector<int> st(N);
// Building the segment tree using the given vector v
void build_st(int node, int beg, int end, vector<int> v)
{
if(beg == end)
{
st[node] = v... | 22.68254 | 72 | 0.60112 | SanjogSamuelSamantaray |
34a439d667ed7affd6a6ca5f3de8e765b3a4b8a2 | 5,227 | cpp | C++ | jni/levelEditor/Editor.cpp | kaitokidi/androidSpaceTongue | 0c839dd92fe6393fa095735b08cb8966c771c36a | [
"MIT"
] | null | null | null | jni/levelEditor/Editor.cpp | kaitokidi/androidSpaceTongue | 0c839dd92fe6393fa095735b08cb8966c771c36a | [
"MIT"
] | null | null | null | jni/levelEditor/Editor.cpp | kaitokidi/androidSpaceTongue | 0c839dd92fe6393fa095735b08cb8966c771c36a | [
"MIT"
] | null | null | null | #include "Editor.hpp"
Editor::Editor(sf::RenderWindow&w)
:
levels("res/levelsfile.txt"),
background(w)
{
window = &w;
tCurrentLvl.setFont(Resources::font);
sSave.setRadius(20);
sSave.setFillColor(sf::Color::Red);
sSave.setOrigin(10,10);
sSave.setPosition(50,50);
currentLvl = 0;
setLevel(curr... | 29.365169 | 102 | 0.588866 | kaitokidi |
34a796b911415f6477c4ddf94a7b0ea3f92d8b62 | 6,753 | cpp | C++ | CashFlowManager/Asset/assetsummarydialog.cpp | epw7856/CashFlowManager | 48b277a97c1e1af8e0151e0a8aee835188e87bdc | [
"MIT"
] | 1 | 2020-12-01T23:24:31.000Z | 2020-12-01T23:24:31.000Z | CashFlowManager/Asset/assetsummarydialog.cpp | epw7856/CashFlowManager | 48b277a97c1e1af8e0151e0a8aee835188e87bdc | [
"MIT"
] | null | null | null | CashFlowManager/Asset/assetsummarydialog.cpp | epw7856/CashFlowManager | 48b277a97c1e1af8e0151e0a8aee835188e87bdc | [
"MIT"
] | null | null | null | #include "assetinterface.h"
#include "assetsummarydialog.h"
#include "assetsummarydialogcontroller.h"
#include "currencyutilities.h"
#include <QScrollBar>
#include "ui_assetsummarydialog.h"
AssetSummaryDialog::AssetSummaryDialog(AssetInterface& localAssetInterface, QWidget *parent) :
QDialog(parent),
ui(new Ui... | 37.104396 | 137 | 0.709018 | epw7856 |
34ab7e0798072c6879c9de5521d386af66a3f835 | 11,707 | cpp | C++ | CronosEngine/Cronos/src/Providers/AssimpImporter.cpp | lucho1/CronosEngine- | d280d927806a8552b6f40b4486709471e0efcef5 | [
"Apache-2.0"
] | 3 | 2019-09-23T11:28:04.000Z | 2020-06-30T08:42:10.000Z | CronosEngine/Cronos/src/Providers/AssimpImporter.cpp | lucho1/CronosEngine- | d280d927806a8552b6f40b4486709471e0efcef5 | [
"Apache-2.0"
] | null | null | null | CronosEngine/Cronos/src/Providers/AssimpImporter.cpp | lucho1/CronosEngine- | d280d927806a8552b6f40b4486709471e0efcef5 | [
"Apache-2.0"
] | 6 | 2019-10-15T19:53:28.000Z | 2021-08-24T20:09:11.000Z | #include "Providers/cnpch.h"
#include "AssimpImporter.h"
#include "Application.h"
#include "Modules/Filesystem.h"
#include "Modules/Scene.h"
#include "Modules/TextureManager.h"
#include "Modules/ResourceManager.h"
#include "Renderer/GLRenderer3D.h"
#include "Renderer/GLRenderer3D.h"
#include "GameObject/Components/... | 34.946269 | 142 | 0.709917 | lucho1 |
34acbc704190a135a17a886e2c3149bc2431d326 | 757 | cpp | C++ | Chess/StateManager.cpp | NanoBreeze/Tcp-Chess | 2cf51a8b6991dbeced7714b18429640394b04641 | [
"Apache-2.0"
] | 1 | 2017-08-01T17:28:39.000Z | 2017-08-01T17:28:39.000Z | Chess/StateManager.cpp | NanoBreeze/TCP-Chess | 2cf51a8b6991dbeced7714b18429640394b04641 | [
"Apache-2.0"
] | null | null | null | Chess/StateManager.cpp | NanoBreeze/TCP-Chess | 2cf51a8b6991dbeced7714b18429640394b04641 | [
"Apache-2.0"
] | null | null | null | #include "StateManager.h"
StateManager& StateManager::getInstance()
{
static StateManager statemanager;
return statemanager;
}
void StateManager::setSelectedSquare(Square* square)
{
selectedSquare = square;
}
void StateManager::removeSelectedSquare()
{
selectedSquare = nullptr;
}
MovesDisplay&... | 15.14 | 53 | 0.713342 | NanoBreeze |
34b2d59762844fbc95b03bd35b3200da831c9d25 | 553,472 | cpp | C++ | chipyard.TestHarness.TinyRocketConfig/chipyard.TestHarness.TinyRocketConfig/VTestHarness__6.cpp | vargandhi/ime-congs | 963be79b7b319d8e74edae09df7bdf3330371401 | [
"BSD-3-Clause"
] | null | null | null | chipyard.TestHarness.TinyRocketConfig/chipyard.TestHarness.TinyRocketConfig/VTestHarness__6.cpp | vargandhi/ime-congs | 963be79b7b319d8e74edae09df7bdf3330371401 | [
"BSD-3-Clause"
] | null | null | null | chipyard.TestHarness.TinyRocketConfig/chipyard.TestHarness.TinyRocketConfig/VTestHarness__6.cpp | vargandhi/ime-congs | 963be79b7b319d8e74edae09df7bdf3330371401 | [
"BSD-3-Clause"
] | null | null | null | // Verilated -*- C++ -*-
// DESCRIPTION: Verilator output: Design implementation internals
// See VTestHarness.h for the primary calling header
#include "VTestHarness.h"
#include "VTestHarness__Syms.h"
#include "verilated_dpi.h"
VL_INLINE_OPT void VTestHarness::_sequent__TOP__1062(VTestHarness__Syms* __restrict vlSy... | 110.341308 | 267 | 0.736946 | vargandhi |
34b844c4998c0f3db95f752fb0a4db46f98c4eaa | 915 | hpp | C++ | engine/input/MouseDevice.hpp | taida957789/ouzel | a8c1cc74e6151a0f7d7d2c534f8747cba46a36af | [
"Unlicense"
] | 1 | 2021-03-01T13:17:49.000Z | 2021-03-01T13:17:49.000Z | engine/input/MouseDevice.hpp | taida957789/ouzel | a8c1cc74e6151a0f7d7d2c534f8747cba46a36af | [
"Unlicense"
] | null | null | null | engine/input/MouseDevice.hpp | taida957789/ouzel | a8c1cc74e6151a0f7d7d2c534f8747cba46a36af | [
"Unlicense"
] | null | null | null | // Copyright 2015-2020 Elviss Strazdins. All rights reserved.
#ifndef OUZEL_INPUT_MOUSEDEVICE_HPP
#define OUZEL_INPUT_MOUSEDEVICE_HPP
#include <future>
#include "InputDevice.hpp"
#include "Mouse.hpp"
namespace ouzel::input
{
class MouseDevice: public InputDevice
{
public:
MouseDevice(InputSystem&... | 32.678571 | 94 | 0.730055 | taida957789 |
34c9d0070ed4a810aca66d2737d050dd5a0b27f8 | 1,558 | cpp | C++ | imap/test/protocol/UidSearchResponseParserTest.cpp | webOS-ports/mojomail | 49358ac2878e010f5c6e3bd962f047c476c11fc3 | [
"Apache-2.0"
] | 6 | 2015-01-09T02:20:27.000Z | 2021-01-02T08:14:23.000Z | mojomail/imap/test/protocol/UidSearchResponseParserTest.cpp | openwebos/app-services | 021d509d609fce0cb41a0e562650bdd1f3bf4e32 | [
"Apache-2.0"
] | 3 | 2019-05-11T19:17:56.000Z | 2021-11-24T16:04:36.000Z | mojomail/imap/test/protocol/UidSearchResponseParserTest.cpp | openwebos/app-services | 021d509d609fce0cb41a0e562650bdd1f3bf4e32 | [
"Apache-2.0"
] | 6 | 2015-01-09T02:21:13.000Z | 2021-01-02T02:37:10.000Z | // @@@LICENSE
//
// Copyright (c) 2010-2013 LG Electronics, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless require... | 26.862069 | 75 | 0.69448 | webOS-ports |
34d3f0e8f097509a86b849cd675acc8c52d34e88 | 1,804 | hpp | C++ | library/ATF/AutoMineMachineMng.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/AutoMineMachineMng.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/AutoMineMachineMng.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <AutoMineMachine.hpp>
#include <CGuild.hpp>
#include <CPlayer.hpp>
START_ATF_NAMESPACE
struct AutoMineMachineMng
{
AutoMineMachine m_Machine[3]... | 37.583333 | 108 | 0.673503 | lemkova |
34d5a51a13b7b41cf431041ee58a20e889976a24 | 849 | cpp | C++ | toolbox/test/TestHashMap.cpp | campx/toolbox | c19ac77981360345acf2ca53479583042e4f018c | [
"Apache-2.0"
] | null | null | null | toolbox/test/TestHashMap.cpp | campx/toolbox | c19ac77981360345acf2ca53479583042e4f018c | [
"Apache-2.0"
] | null | null | null | toolbox/test/TestHashMap.cpp | campx/toolbox | c19ac77981360345acf2ca53479583042e4f018c | [
"Apache-2.0"
] | null | null | null | #include "gtest/gtest.h"
#include <toolbox/HashMap.h>
#include <map>
#include <string>
TEST(HashMap, Operations)
{
using hash_t = std::hash<std::string>;
using map_t = std::map<hash_t::result_type, std::string>;
using hash_map_t = toolbox::HashMap<hash_t, map_t>;
auto hash_map = hash_map_t{};
auto... | 33.96 | 79 | 0.702002 | campx |
34daa707082b336f322f4e2e64075d7da5d8525c | 464 | hpp | C++ | include/ce2/asset/animgraph/animgraph_link.hpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | include/ce2/asset/animgraph/animgraph_link.hpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | include/ce2/asset/animgraph/animgraph_link.hpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "chokoengine.hpp"
CE_BEGIN_NAMESPACE
class _AnimGraph::Link {
public:
class Cond {
public:
int paramId;
_Var value;
enum class Comp {
Equals,
NEquals,
Greater,
Less,
GEquals,
LEquals,
_COUNT
} comp;
bool Check(const _AnimGraph& g, const State&) const;
};
int... | 13.257143 | 54 | 0.689655 | chokomancarr |
34db9cb5443175a997fba13f7843446f0b007e41 | 508 | cpp | C++ | snippet_C++/Xiti/xiti5-4-5.cpp | boredbird/C_playground | 93eccfd93b02ec8febf02db4a266739adf470ded | [
"MIT"
] | 2 | 2020-10-16T08:37:23.000Z | 2022-01-31T14:31:42.000Z | snippet_C++/Xiti/xiti5-4-5.cpp | boredbird/C_playground | 93eccfd93b02ec8febf02db4a266739adf470ded | [
"MIT"
] | null | null | null | snippet_C++/Xiti/xiti5-4-5.cpp | boredbird/C_playground | 93eccfd93b02ec8febf02db4a266739adf470ded | [
"MIT"
] | null | null | null | //编写一个函数，利用指针将一个字符串反向输出。编写相应的主函数对其进行调用，在主函数中完成原始数据的输入和结果输出。
#include <iostream.h>
void reverse(char *a, int n)//a为字符串首地址,n+1为字符串长度
{
char temp;
for(int k=0;k<((n+1)/2);k++)//a[k]和a[n-k]交换数据
{
temp=*(a+k);
*(a+k)=*(a+n-k);
*(a+n-k)=temp;
}
}
void main()
{
char a[100]; //最多输入100个字符
cout<<"Input the string："... | 19.538462 | 59 | 0.596457 | boredbird |
34dbd07ab8a53afc02e6d76dd75a3da393b385e4 | 708 | cpp | C++ | src/sa/RotateOrFlipMacro.cpp | areong/CornerMacroPlacer | da6841c110a829b33bd705cda13fb371ca369007 | [
"MIT"
] | 2 | 2019-06-14T06:52:45.000Z | 2019-10-14T11:21:07.000Z | src/sa/RotateOrFlipMacro.cpp | areong/CornerMacroPlacer | da6841c110a829b33bd705cda13fb371ca369007 | [
"MIT"
] | 1 | 2019-10-14T11:20:50.000Z | 2019-10-16T11:04:00.000Z | src/sa/RotateOrFlipMacro.cpp | areong/CornerMacroPlacer | da6841c110a829b33bd705cda13fb371ca369007 | [
"MIT"
] | null | null | null | #include "sa/RotateOrFlipMacro.h"
#include <vector>
#include "cornersequence/CornerSequence.h"
#include "sa/FloorplanState.h"
#include "utils/Utils.h"
RotateOrFlipMacro::RotateOrFlipMacro(int numMacros) {
this->numMacros = numMacros;
macroIndex = Utils::randint(0, numMacros);
}
RotateOrFlipMacro::~RotateOrFli... | 26.222222 | 93 | 0.759887 | areong |
34e18123c2dbb61ff3ae06c37424fa1e8706be79 | 1,232 | cpp | C++ | 02/structs.cpp | sanskarkatiyar/CSCI2270 | aee0261e35d16ca8e17f8f950b080053bd6afe0f | [
"MIT"
] | 2 | 2020-03-18T22:56:41.000Z | 2020-04-16T22:33:23.000Z | 02/structs.cpp | sanskarkatiyar/CSCI2270 | aee0261e35d16ca8e17f8f950b080053bd6afe0f | [
"MIT"
] | null | null | null | 02/structs.cpp | sanskarkatiyar/CSCI2270 | aee0261e35d16ca8e17f8f950b080053bd6afe0f | [
"MIT"
] | 2 | 2020-04-24T17:00:57.000Z | 2021-04-05T03:55:43.000Z | #include <iostream>
#include <string>
using namespace std;
// Definition of the structure
struct student
{
string name;
string email;
int birthyear;
string address;
};
int main() {
// Initialization: Method I (Need to remember correct order of members)
// student stu = {"ABC", "abc@colorado.... | 27.377778 | 105 | 0.611201 | sanskarkatiyar |
34e5664336eab446ff2d979716efc93b425cf84d | 14,384 | hpp | C++ | source/dynarithmic/twain/characteristics/twain_select_dialog.hpp | dynarithmic/twainsave-opensource | 9aa0d43572ffd68ba28311e237c33f1ec4557534 | [
"Apache-2.0"
] | null | null | null | source/dynarithmic/twain/characteristics/twain_select_dialog.hpp | dynarithmic/twainsave-opensource | 9aa0d43572ffd68ba28311e237c33f1ec4557534 | [
"Apache-2.0"
] | null | null | null | source/dynarithmic/twain/characteristics/twain_select_dialog.hpp | dynarithmic/twainsave-opensource | 9aa0d43572ffd68ba28311e237c33f1ec4557534 | [
"Apache-2.0"
] | null | null | null | /*
This file is part of the Dynarithmic TWAIN Library (DTWAIN).
Copyright (c) 2002-2020 Dynarithmic Software.
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-... | 55.968872 | 164 | 0.626877 | dynarithmic |
34e812249371fa507dde92bc72f14fed3ce8020b | 2,930 | cpp | C++ | src/ui/weaponicon.cpp | Eae02/tank-game | 0c526b177ccc15dd49e3228489163f13335040db | [
"Zlib"
] | null | null | null | src/ui/weaponicon.cpp | Eae02/tank-game | 0c526b177ccc15dd49e3228489163f13335040db | [
"Zlib"
] | null | null | null | src/ui/weaponicon.cpp | Eae02/tank-game | 0c526b177ccc15dd49e3228489163f13335040db | [
"Zlib"
] | null | null | null | #include "weaponicon.h"
#include "hudmanager.h"
#include "../updateinfo.h"
#include "../graphics/ui/uirenderer.h"
#include "../graphics/ui/font.h"
#include "../utils/ioutils.h"
#include "../world/entities/playerweaponstate.h"
#include <sstream>
#include <GLFW/glfw3.h>
#include <iostream>
namespace TankGame
{
std::ve... | 28.446602 | 105 | 0.709215 | Eae02 |
34ea6ea854ae444ce5bbf575a8c49cae55b7c7a7 | 620 | cpp | C++ | contest/yukicoder/164.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | 7 | 2018-04-14T14:55:51.000Z | 2022-01-31T10:49:49.000Z | contest/yukicoder/164.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | 5 | 2018-04-14T14:28:49.000Z | 2019-05-11T02:22:10.000Z | contest/yukicoder/164.cpp | not522/Competitive-Programming | be4a7d25caf5acbb70783b12899474a56c34dedb | [
"Unlicense"
] | null | null | null | #include "string.hpp"
int64_t toInteger(const String &s, int n) {
int64_t res = 0;
for (char c : s) {
if (isdigit(c)) {
res = res * n + c - '0';
} else if (isalpha(c)) {
res = res * n + tolower(c) - 'a' + 10;
}
}
return res;
}
int main() {
int n(in);
int64_t res = toInteger("ZZZZZZ... | 19.375 | 46 | 0.459677 | not522 |
34f54e7ba1c5385cb2d2803dd295b4d43f2e9f9a | 6,693 | hpp | C++ | sdl2-sonic-drivers/src/files/IFFFile.hpp | Raffaello/sdl2-sonic-drivers | 20584f100ddd7c61f584deaee0b46c5228d8509d | [
"Apache-2.0"
] | 3 | 2021-10-31T14:24:00.000Z | 2022-03-16T08:15:31.000Z | sdl2-sonic-drivers/src/files/IFFFile.hpp | Raffaello/sdl2-sonic-drivers | 20584f100ddd7c61f584deaee0b46c5228d8509d | [
"Apache-2.0"
] | 48 | 2020-06-05T11:11:29.000Z | 2022-02-27T23:58:44.000Z | sdl2-sonic-drivers/src/files/IFFFile.hpp | Raffaello/sdl2-sonic-drivers | 20584f100ddd7c61f584deaee0b46c5228d8509d | [
"Apache-2.0"
] | null | null | null | #pragma once
#include <files/File.hpp>
#include <cstdint>
#include <string>
#include <utils/algorithms.hpp>
namespace files
{
enum class eIFF_ID : uint32_t
{
/* Amiga 8 bits voice */
ID_FORM = utils::MKID_BE('F', 'O', 'R', 'M'),
/* EA IFF 85 group identifier */
ID_CAT = utils::... | 39.370588 | 72 | 0.495443 | Raffaello |
34f67f6ce041825f67ec85545e58c9d8e7dd7889 | 19,054 | cpp | C++ | test/tests.cpp | tamerfrombk/jsonpp | c683e4677f54a521ae9c3308424ef8f40ad5c931 | [
"MIT"
] | null | null | null | test/tests.cpp | tamerfrombk/jsonpp | c683e4677f54a521ae9c3308424ef8f40ad5c931 | [
"MIT"
] | null | null | null | test/tests.cpp | tamerfrombk/jsonpp | c683e4677f54a521ae9c3308424ef8f40ad5c931 | [
"MIT"
] | null | null | null | #define CATCH_CONFIG_MAIN
#include "test/catch.hpp"
#include "jsonpp.hpp"
#include <fstream>
#define JSONPP_DOUBLE_EQUALS(obj, name, expected) do {\
auto target = Approx((expected)).epsilon(std::numeric_limits<double>::epsilon() * 100);\
REQUIRE(obj->getNumberValue(name) == target);\
} while (0)
#define JSONP... | 23.997481 | 121 | 0.583447 | tamerfrombk |
5a54815b5d260c55c1777528cdfcd41eb0f222b4 | 2,332 | cpp | C++ | utilities/C++/google high frequency/43. Multiply Strings.cpp | JanathonL-CMU/tech-interview-handbook | be3adc5142ade45c5677eeb0b082e18e7ca5df92 | [
"MIT"
] | null | null | null | utilities/C++/google high frequency/43. Multiply Strings.cpp | JanathonL-CMU/tech-interview-handbook | be3adc5142ade45c5677eeb0b082e18e7ca5df92 | [
"MIT"
] | null | null | null | utilities/C++/google high frequency/43. Multiply Strings.cpp | JanathonL-CMU/tech-interview-handbook | be3adc5142ade45c5677eeb0b082e18e7ca5df92 | [
"MIT"
] | null | null | null | // 43. Multiply Strings
/*
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
Example 1:
Input: num1 = "2", num2 = "3"
Output: "6"
Example 2:
Input: num1 = "123", num2 = "456"
Output: "56088"
Note:
The length of both num1 and num2... | 25.347826 | 136 | 0.451973 | JanathonL-CMU |
5a5acd38ed41465fae8284e08f57fec96361dc09 | 2,296 | cpp | C++ | Surf n Turf Framework/Surf n Turf Framework/SDK.cpp | SecretH4xor/Code | 6d258a6741a3b4221c37a8058fad3c51bae5997a | [
"MIT"
] | null | null | null | Surf n Turf Framework/Surf n Turf Framework/SDK.cpp | SecretH4xor/Code | 6d258a6741a3b4221c37a8058fad3c51bae5997a | [
"MIT"
] | null | null | null | Surf n Turf Framework/Surf n Turf Framework/SDK.cpp | SecretH4xor/Code | 6d258a6741a3b4221c37a8058fad3c51bae5997a | [
"MIT"
] | null | null | null | #include "SDK.h"
#include <iostream>
CreateInterfaceFn CaptureFactory(char *pszFactoryModule)
{
CreateInterfaceFn fn = NULL;
while ( fn == NULL)
{
HMODULE hFactoryModule = GetModuleHandleA(pszFactoryModule);
if (hFactoryModule)
{
fn = reinterpret_cast<CreateInterfaceFn>(GetProcAddress(hFacto... | 20.318584 | 116 | 0.643728 | SecretH4xor |
5a641fa4d01d2ebf96f24d8eca9349a47fb2a57b | 1,334 | hpp | C++ | src/axis.hpp | mvorbrodt/engine | 0b9c5c1f6d293e98ea8bea3db3bfb67fee84b73c | [
"0BSD"
] | 3 | 2019-04-25T11:39:13.000Z | 2022-01-30T22:24:08.000Z | src/axis.hpp | mvorbrodt/engine | 0b9c5c1f6d293e98ea8bea3db3bfb67fee84b73c | [
"0BSD"
] | null | null | null | src/axis.hpp | mvorbrodt/engine | 0b9c5c1f6d293e98ea8bea3db3bfb67fee84b73c | [
"0BSD"
] | 1 | 2019-11-20T07:58:38.000Z | 2019-11-20T07:58:38.000Z | #pragma once
#include <ostream>
#include "types.hpp"
#include "vector.hpp"
#include "matrix.hpp"
#include "transforms.hpp"
namespace engine
{
class axis
{
public:
axis(const vector& x = UNIT_X, const vector& y = UNIT_Y, const vector& z = UNIT_Z)
: m_axis{ x, y, z }
{
m_axis[X].normalize();
m_axis[Y].no... | 19.333333 | 84 | 0.60045 | mvorbrodt |
5a6881fc0dc34e00c383cf450e07f3032c95b8ee | 947 | cpp | C++ | atcoder.jp/abc079/abc079_c/Main.cpp | shikij1/AtCoder | 7ae2946efdceaea3cc8725e99a2b9c137598e2f8 | [
"MIT"
] | null | null | null | atcoder.jp/abc079/abc079_c/Main.cpp | shikij1/AtCoder | 7ae2946efdceaea3cc8725e99a2b9c137598e2f8 | [
"MIT"
] | null | null | null | atcoder.jp/abc079/abc079_c/Main.cpp | shikij1/AtCoder | 7ae2946efdceaea3cc8725e99a2b9c137598e2f8 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int sz = s.size();
for (int i = 0; i < 1 << (sz - 1); i++)
{
int sum = s.at(0) - '0';
for (int j = 0; j < sz - 1; j++)
{
if (i & 1 << j)
{
sum += s.at(sz - ... | 20.586957 | 46 | 0.213305 | shikij1 |
5a70101bd77d017dfee89492fb907f03eb4b584b | 367 | cc | C++ | chapter5/ex5-20.cc | guojing0/cpp-primer | b0e36982d1323395aaca9bd9be09f383c130b645 | [
"MIT"
] | 1 | 2015-03-15T00:35:51.000Z | 2015-03-15T00:35:51.000Z | chapter5/ex5-20.cc | guojing0/cpp-primer | b0e36982d1323395aaca9bd9be09f383c130b645 | [
"MIT"
] | null | null | null | chapter5/ex5-20.cc | guojing0/cpp-primer | b0e36982d1323395aaca9bd9be09f383c130b645 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main()
{
string str, tempstr;
if (cin >> str) {
while (cin >> tempstr) {
if (str == tempstr) {
cout << str << endl;
break;
} else {
str = tempstr;
} // it should output no ... | 18.35 | 52 | 0.425068 | guojing0 |
5a7220db6858cf186d3337841fe054a6f28e2754 | 234 | cpp | C++ | src/nodes/optionCores/OptionCore.cpp | ToniRingling/HallGUI | 81662644884a027b42a8fe4414f5e51cbf72493d | [
"MIT"
] | null | null | null | src/nodes/optionCores/OptionCore.cpp | ToniRingling/HallGUI | 81662644884a027b42a8fe4414f5e51cbf72493d | [
"MIT"
] | null | null | null | src/nodes/optionCores/OptionCore.cpp | ToniRingling/HallGUI | 81662644884a027b42a8fe4414f5e51cbf72493d | [
"MIT"
] | null | null | null | #include "OptionCore.h"
#include "../../customUI/optionCoreEditors/BlankEditorPanel.h"
using namespace option_cores;
OptionCore::OptionCore(node_components::Option* shell){
this->shell = shell;
}
OptionCore::~OptionCore(){
}
| 16.714286 | 62 | 0.739316 | ToniRingling |
5a77554ce4eb10bbf8c3c0241f67d3cfd61d8eed | 14,401 | hpp | C++ | include/TreeDS/node/binary_node.hpp | barsan-ds/generic-tree | a01ff9dc0a0e0e6dd9d380cf2469d7ea0cc86c60 | [
"MIT"
] | 3 | 2018-10-02T20:18:52.000Z | 2018-10-04T20:16:45.000Z | include/TreeDS/node/binary_node.hpp | barsan-ds/tree-ds | a01ff9dc0a0e0e6dd9d380cf2469d7ea0cc86c60 | [
"MIT"
] | null | null | null | include/TreeDS/node/binary_node.hpp | barsan-ds/tree-ds | a01ff9dc0a0e0e6dd9d380cf2469d7ea0cc86c60 | [
"MIT"
] | null | null | null | #pragma once
#include <cassert> // assert
#include <iomanip> // std::setw()
#include <memory> // std::unique_ptr
#include <ostream>
#include <tuple> // std::make_tuple()
#include <type_traits> //std::enable_if_t
#include <utility> // std::move(), std::forward()
#include <TreeDS/allocator_utility.hpp>
#incl... | 30.771368 | 121 | 0.568294 | barsan-ds |
5a780c755d285a414e27244f59bf68039ffd2bfc | 865 | cpp | C++ | LeetCode/Problems/Algorithms/#983_MinimumCostForTickets_sol2_dp_backward.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#983_MinimumCostForTickets_sol2_dp_backward.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#983_MinimumCostForTickets_sol2_dp_backward.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class Solution {
public:
int mincostTickets(vector<int>& days, vector<int>& costs) {
const int N = days.size();
const int MIN_DAY = days.front();
const int MAX_DAY = days.back();
vector<int> min_cost(MAX_DAY + 30 + 1, 0);
for(int current_day = MAX_DAY, day_id... | 39.318182 | 96 | 0.478613 | Tudor67 |
5a7e9836988dfa406f372d084dcee514c7387c23 | 606 | cpp | C++ | Source/WizardTicTacToe/MainHUD.cpp | powersindustries/WizardTicTacToe-UE4 | 81c216ce6add2c540ba6538f75d328bd575a2972 | [
"MIT"
] | null | null | null | Source/WizardTicTacToe/MainHUD.cpp | powersindustries/WizardTicTacToe-UE4 | 81c216ce6add2c540ba6538f75d328bd575a2972 | [
"MIT"
] | null | null | null | Source/WizardTicTacToe/MainHUD.cpp | powersindustries/WizardTicTacToe-UE4 | 81c216ce6add2c540ba6538f75d328bd575a2972 | [
"MIT"
] | null | null | null | // FILL OUT YOUR COPYRIGHT NOTICE IN THE DESCRIPTION PAGE OF PROJECT SETTINGS.
#include "MainHUD.h"
#include "Blueprint/UserWidget.h"
AMainHUD::AMainHUD()
{
static ConstructorHelpers::FClassFinder<UUserWidget> HUDObject(TEXT("/Game/UI/HUD"));
HUDWidgetClass = HUDObject.Class;
}
void AMainHUD::BeginPlay()
{
... | 18.363636 | 89 | 0.650165 | powersindustries |
5a7ebbb183a5f1d1a0a60425eec22d1752f9007c | 4,125 | cpp | C++ | src/biquad.cpp | turgu1/mezzo | 5b8210665ab615d63f59a4fe8c08fd9a923b8821 | [
"Intel",
"Unlicense"
] | 1 | 2019-10-11T11:02:33.000Z | 2019-10-11T11:02:33.000Z | src/biquad.cpp | turgu1/mezzo | 5b8210665ab615d63f59a4fe8c08fd9a923b8821 | [
"Intel",
"Unlicense"
] | null | null | null | src/biquad.cpp | turgu1/mezzo | 5b8210665ab615d63f59a4fe8c08fd9a923b8821 | [
"Intel",
"Unlicense"
] | null | null | null | // Notice
// ------
//
// This file is part of the Mezzo SoundFont2 Sampling Based Synthesizer:
//
// https://github.com/turgu1/mezzo
//
// Simplified BSD License
// ----------------------
//
// Copyright (c) 2018, Guy Turcotte
// All rights reserved.
//
// Redistribution and use in source and binary forms, with o... | 30.109489 | 82 | 0.578424 | turgu1 |
5a841198ee137deb0417d6a1c9892803babfed1d | 811,953 | cpp | C++ | com.WebGLBuildTest/Classes/Native/Il2CppCompilerCalculateTypeValues_26Table.cpp | chaowyc/PathAdvisor3D | 8d7724fdebcb9c2e12665ceca325c8614a0a7311 | [
"MIT"
] | null | null | null | com.WebGLBuildTest/Classes/Native/Il2CppCompilerCalculateTypeValues_26Table.cpp | chaowyc/PathAdvisor3D | 8d7724fdebcb9c2e12665ceca325c8614a0a7311 | [
"MIT"
] | null | null | null | com.WebGLBuildTest/Classes/Native/Il2CppCompilerCalculateTypeValues_26Table.cpp | chaowyc/PathAdvisor3D | 8d7724fdebcb9c2e12665ceca325c8614a0a7311 | [
"MIT"
] | null | null | null | #include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <cstring>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <limits>
#include <assert.h>
#include <stdint.h>
#include "il2cpp-class-internals.h"
#include "codegen/il2cpp-codegen.h"
#include "i... | 53.97547 | 255 | 0.858111 | chaowyc |
5a85667ed2f832bce120a582d0edf70e797b1c8a | 6,525 | cpp | C++ | releasedExamples/EBAMRGodunov/src/EBTGAStrategy.cpp | boywert/chombo | e06f9f5d23125c7759be33430f57a5beb1112f8d | [
"BSD-3-Clause-LBNL"
] | 4 | 2019-09-05T01:15:10.000Z | 2021-08-06T13:26:21.000Z | releasedExamples/EBAMRGodunov/src/EBTGAStrategy.cpp | boywert/chombo | e06f9f5d23125c7759be33430f57a5beb1112f8d | [
"BSD-3-Clause-LBNL"
] | null | null | null | releasedExamples/EBAMRGodunov/src/EBTGAStrategy.cpp | boywert/chombo | e06f9f5d23125c7759be33430f57a5beb1112f8d | [
"BSD-3-Clause-LBNL"
] | 2 | 2018-12-02T14:02:34.000Z | 2020-12-07T14:22:17.000Z | #ifdef CH_LANG_CC
/*
* _______ __
* / ___/ / ___ __ _ / / ___
* / /__/ _ \/ _ \/ V \/ _ \/ _ \
* \___/_//_/\___/_/_/_/_.__/\___/
* Please refer to Copyright.txt, in Chombo's root directory.
*/
#endif
#include "EBTGAStrategy.H"
#include "NamespaceHeader.H"
//-----------------... | 34.342105 | 96 | 0.551724 | boywert |
5a859cd8affa4726d192c4f30e5c4f56c1af5a95 | 2,549 | cpp | C++ | Codeforces/G_Path_quries.cpp | ANONYMOUS609/Competitive-Programming | d3753eeee24a660963f1d8911bf887c8f41f5677 | [
"MIT"
] | 2 | 2019-01-30T12:45:18.000Z | 2021-05-06T19:02:51.000Z | Codeforces/G_Path_quries.cpp | ANONYMOUS609/Competitive-Programming | d3753eeee24a660963f1d8911bf887c8f41f5677 | [
"MIT"
] | null | null | null | Codeforces/G_Path_quries.cpp | ANONYMOUS609/Competitive-Programming | d3753eeee24a660963f1d8911bf887c8f41f5677 | [
"MIT"
] | 3 | 2020-10-02T15:42:04.000Z | 2022-03-27T15:14:16.000Z | // Path Queries
#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
#include<unordered_map>
using namespace std;
typedef long long ll;
#define ip(arr, n) for(int i=0; i<n; i++) cin>>arr[i];
#define op(arr, n) for(int i=0; i<n; i++) cout<<arr[i]<<" ";
#define fstIO ios_base::sync_with_stdio(false);... | 22.359649 | 124 | 0.544527 | ANONYMOUS609 |
5a93c79f5f2d1a63f1f63d8923911eea1d3115b6 | 315 | cpp | C++ | ouzel/input/android/InputAndroid.cpp | keima97/ouzel | e6673e678b4739235371a15ae3863942b692c5fb | [
"BSD-2-Clause"
] | null | null | null | ouzel/input/android/InputAndroid.cpp | keima97/ouzel | e6673e678b4739235371a15ae3863942b692c5fb | [
"BSD-2-Clause"
] | null | null | null | ouzel/input/android/InputAndroid.cpp | keima97/ouzel | e6673e678b4739235371a15ae3863942b692c5fb | [
"BSD-2-Clause"
] | null | null | null | // Copyright (C) 2016 Elviss Strazdins
// This file is part of the Ouzel engine.
#include "InputAndroid.h"
namespace ouzel
{
namespace input
{
InputAndroid::InputAndroid()
{
}
InputAndroid::~InputAndroid()
{
}
} // namespace input
} // namespace ouzel
| 16.578947 | 41 | 0.580952 | keima97 |
5a953aa2edb8b630ccd5e960274e192609bd89eb | 1,691 | hpp | C++ | log/include/storm/log/Logger.hpp | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | 17 | 2019-02-12T14:40:06.000Z | 2021-12-21T12:54:17.000Z | log/include/storm/log/Logger.hpp | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | null | null | null | log/include/storm/log/Logger.hpp | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | 2 | 2019-02-21T10:07:42.000Z | 2020-05-08T19:49:10.000Z | // Copyright (C) 2021 Arthur LAURENT <arthur.laurent4@gmail.com>
// This file is subject to the license terms in the LICENSE file
// found in the top-level of this distribution
#pragma once
#include <gsl/string_span>
#include <storm/core/Platform.hpp>
#include <storm/log/Fwd.hpp>
#include <storm/log/Modu... | 31.90566 | 92 | 0.594914 | Arthapz |
5aa20fe87e1acdab3eab616500a029995f9012c5 | 8,287 | cpp | C++ | src/energyplus/Test/ZoneHVACBaseboardRadiantConvectiveWater_GTest.cpp | muehleisen/OpenStudio | 3bfe89f6c441d1e61e50b8e94e92e7218b4555a0 | [
"blessing"
] | 354 | 2015-01-10T17:46:11.000Z | 2022-03-29T10:00:00.000Z | src/energyplus/Test/ZoneHVACBaseboardRadiantConvectiveWater_GTest.cpp | muehleisen/OpenStudio | 3bfe89f6c441d1e61e50b8e94e92e7218b4555a0 | [
"blessing"
] | 3,243 | 2015-01-02T04:54:45.000Z | 2022-03-31T17:22:22.000Z | src/energyplus/Test/ZoneHVACBaseboardRadiantConvectiveWater_GTest.cpp | jmarrec/OpenStudio | 5276feff0d8dbd6c8ef4e87eed626bc270a19b14 | [
"blessing"
] | 157 | 2015-01-07T15:59:55.000Z | 2022-03-30T07:46:09.000Z | /***********************************************************************************************************************
* OpenStudio(R), Copyright (c) 2008-2021, Alliance for Sustainable Energy, LLC, and other contributors. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without m... | 54.519737 | 149 | 0.767588 | muehleisen |
5aa7c0dc2979a3f5fb6a83476651e5c0b55a7035 | 959 | hpp | C++ | bench/precision/run.hpp | tufak/Simdify | 693e24ea113e08b8d17ec709d58f7cc53b32fbd2 | [
"MIT"
] | 4 | 2015-05-27T16:52:36.000Z | 2016-05-12T13:21:28.000Z | bench/precision/run.hpp | tufak/Simdify | 693e24ea113e08b8d17ec709d58f7cc53b32fbd2 | [
"MIT"
] | 17 | 2017-07-02T16:48:49.000Z | 2021-11-22T10:29:09.000Z | bench/precision/run.hpp | hrabalik/simdee | 693e24ea113e08b8d17ec709d58f7cc53b32fbd2 | [
"MIT"
] | 1 | 2015-11-14T08:06:19.000Z | 2015-11-14T08:06:19.000Z | #pragma once
#include "stats_printer.hpp"
#include <cstring>
#include <random>
const int g_non_exhaustive_retries = 10000000;
struct run_opts {
bool exhaustive;
};
template <typename GtRoutine, typename Routine>
void run(const run_opts& opts, const char* name, bool positive_only, GtRoutine gt_routine,
R... | 29.96875 | 96 | 0.622523 | tufak |
5ab1b2e9756904e5dfbf22431e12c53d8140222f | 586 | cpp | C++ | placement-2.0/sweets-eating-codeforces.cpp | xenowits/cp | 963b3c7df65b5328d5ce5ef894a46691afefb98c | [
"MIT"
] | null | null | null | placement-2.0/sweets-eating-codeforces.cpp | xenowits/cp | 963b3c7df65b5328d5ce5ef894a46691afefb98c | [
"MIT"
] | null | null | null | placement-2.0/sweets-eating-codeforces.cpp | xenowits/cp | 963b3c7df65b5328d5ce5ef894a46691afefb98c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> arr, int n, int m) {
long long int m_arr[n+1];
for (int i = 1; i <= n; i += 1) {
if (i <= m) {
m_arr[i] = arr[i];
} else {
m_arr[i] = arr[i] + m_arr[i-m];
}
}
long long int prev;
for (int i = 1; i <= n; i += 1) {
if (i == 1) {
... | 14.65 | 43 | 0.462457 | xenowits |
5ab5d2ecaadf1ad175a4605de8348a5ae9e997d1 | 42,953 | cpp | C++ | source/Backends/RepriseToClang/ClangExpressions.cpp | czen/open-ops | b1ab8da354c4aecc0fe76a562395f5861bffc207 | [
"BSD-3-Clause"
] | 23 | 2017-08-01T14:29:48.000Z | 2019-10-09T22:27:38.000Z | source/Backends/RepriseToClang/ClangExpressions.cpp | czen/open-ops | b1ab8da354c4aecc0fe76a562395f5861bffc207 | [
"BSD-3-Clause"
] | 2 | 2017-08-06T08:34:18.000Z | 2017-08-08T16:27:38.000Z | source/Backends/RepriseToClang/ClangExpressions.cpp | czen/open-ops | b1ab8da354c4aecc0fe76a562395f5861bffc207 | [
"BSD-3-Clause"
] | 2 | 2017-08-08T12:25:06.000Z | 2019-09-16T15:18:18.000Z | /// ClangExpressions.cpp
/// Create clang expressions from Reprise expressions.
/// Author: Denis Dubrov (dubrov@sfedu.ru)
/// Created: 12.04.2013
#include "ClangExpressions.h"
#include "ClangTypes.h"
#include "OPS_Core/Helpers.h"
#include "Reprise/Service/DeepWalker.h"
#include "Reprise/Declarations.h"
#include "R... | 26.270948 | 99 | 0.69136 | czen |
5ab5f8609f97f2ca555592b39e1e55f4ea546c36 | 107,079 | cpp | C++ | Flatland Standalone/Classes.cpp | powerspowers/flatland | 731cc2101889135fbd749f4e2edc2d9d82946cc0 | [
"MIT"
] | 9 | 2019-06-05T14:51:47.000Z | 2022-01-19T04:56:48.000Z | Flatland Standalone/Classes.cpp | powerspowers/flatland | 731cc2101889135fbd749f4e2edc2d9d82946cc0 | [
"MIT"
] | null | null | null | Flatland Standalone/Classes.cpp | powerspowers/flatland | 731cc2101889135fbd749f4e2edc2d9d82946cc0 | [
"MIT"
] | 3 | 2018-08-01T17:46:12.000Z | 2022-01-19T04:56:51.000Z | //******************************************************************************
// Copyright (C) 2018 Flatland Online Inc., Philip Stephens, Michael Powers.
// This code is licensed under the MIT license (see LICENCE file for details).
//******************************************************************************
#... | 24.187712 | 155 | 0.653517 | powerspowers |
5ab61cc4ec731ced0b7f1c856a2cf7c40cd2687a | 2,351 | cpp | C++ | src/Graphics/ScreenBuffer.cpp | Shunseii/cpp-arcade-app | e7bad1b8401d9886243f3a6af3bedf40d939e9c1 | [
"MIT"
] | null | null | null | src/Graphics/ScreenBuffer.cpp | Shunseii/cpp-arcade-app | e7bad1b8401d9886243f3a6af3bedf40d939e9c1 | [
"MIT"
] | null | null | null | src/Graphics/ScreenBuffer.cpp | Shunseii/cpp-arcade-app | e7bad1b8401d9886243f3a6af3bedf40d939e9c1 | [
"MIT"
] | null | null | null | #include "Graphics/ScreenBuffer.h"
#include <SDL2/SDL.h>
#include <cassert>
// Converts given 2D (r, c) coordinate of an array
// to a 1D representation of a 2D array.
size_t ScreenBuffer::GetIndex(int r, int c) {
assert(mSurface);
if (mSurface) {
// Convert from 1D array to 2D
return r * mSurface->w + c;
... | 22.390476 | 88 | 0.682688 | Shunseii |
5ab671a84093c551dcadfd845a7e8daf2d79cbe9 | 2,503 | cpp | C++ | 427-construct-quad-tree/427-construct-quad-tree.cpp | arpangoswami/LeetcodeSolutions | 17a2450cacf0020c2626023012a5a354c8fee5da | [
"MIT"
] | null | null | null | 427-construct-quad-tree/427-construct-quad-tree.cpp | arpangoswami/LeetcodeSolutions | 17a2450cacf0020c2626023012a5a354c8fee5da | [
"MIT"
] | null | null | null | 427-construct-quad-tree/427-construct-quad-tree.cpp | arpangoswami/LeetcodeSolutions | 17a2450cacf0020c2626023012a5a354c8fee5da | [
"MIT"
] | null | null | null | /*
// Definition for a QuadTree node.
class Node {
public:
bool val;
bool isLeaf;
Node* topLeft;
Node* topRight;
Node* bottomLeft;
Node* bottomRight;
Node() {
val = false;
isLeaf = false;
topLeft = NULL;
topRight = NULL;
bottomLeft = NULL;
... | 29.797619 | 117 | 0.515781 | arpangoswami |
5ab7f3cdda7b3f620f7c845fec27afb117c89198 | 2,394 | cpp | C++ | sync.cpp | WentsingNee/tsoj_core_cpp | 8a83d6cc81c247a1299da207ac54b62419b75bab | [
"MIT"
] | 1 | 2019-03-08T06:15:52.000Z | 2019-03-08T06:15:52.000Z | sync.cpp | WentsingNee/tsoj_core_cpp | 8a83d6cc81c247a1299da207ac54b62419b75bab | [
"MIT"
] | null | null | null | sync.cpp | WentsingNee/tsoj_core_cpp | 8a83d6cc81c247a1299da207ac54b62419b75bab | [
"MIT"
] | null | null | null | /*
* sync.cpp
*
* Created on: 2018年12月31日
* Author: peter
*/
#include <iostream>
#include <thread>
#include <chrono>
#include <future>
#include <fstream>
using namespace std;
#include <kerbal/range/range.hpp>
#include "CourseManagement.cpp"
#include "ExerciseManagement.cpp"
#include "logger.cpp"
#include... | 25.2 | 89 | 0.648705 | WentsingNee |
5ab8c1a750dda542f3c1c5adeeef8aab9dce7438 | 1,113 | cpp | C++ | ArincTool/TargetToolDoc.cpp | iclosure/arinc429 | 55031fa877418113c97fa1b2e12bcd16c8a323f7 | [
"MIT"
] | 1 | 2019-03-19T00:23:33.000Z | 2019-03-19T00:23:33.000Z | ArincTool/TargetToolDoc.cpp | iclosure/arinc429 | 55031fa877418113c97fa1b2e12bcd16c8a323f7 | [
"MIT"
] | null | null | null | ArincTool/TargetToolDoc.cpp | iclosure/arinc429 | 55031fa877418113c97fa1b2e12bcd16c8a323f7 | [
"MIT"
] | null | null | null | // TargetToolDoc.cpp : implementation of the CTargetToolDoc class
//
#include "stdafx.h"
#include "TargetTool.h"
#include "TargetToolDoc.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CTargetToolDoc
IMPLEMENT_DYNCREATE(CTargetToolDoc, CDocument)
BEGIN_MESSAGE_MAP(CTargetToolDoc, CDocument)
END_MESSAGE_MAP()
... | 14.088608 | 65 | 0.739443 | iclosure |
5abfd3a93cfad9cef2c0f026010ef62d009ff57d | 917 | cpp | C++ | Axis.Capsicum/application/executors/gpu/commands/SolverInitializerCommand.cpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | 2 | 2021-07-23T08:49:54.000Z | 2021-07-29T22:07:30.000Z | Axis.Capsicum/application/executors/gpu/commands/SolverInitializerCommand.cpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | null | null | null | Axis.Capsicum/application/executors/gpu/commands/SolverInitializerCommand.cpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | null | null | null | #include "SolverInitializerCommand.hpp"
namespace adal = axis::domain::algorithms;
namespace ada = axis::domain::analyses;
namespace aaegc = axis::application::executors::gpu::commands;
namespace asmc = axis::services::memory::commands;
namespace afm = axis::foundation::memory;
aaegc::SolverInitializerCommand::... | 29.580645 | 79 | 0.76554 | renato-yuzup |
5ac20d92b7dbb4615a322f61826e13650c4d734c | 3,718 | cpp | C++ | extension/sv_helper/SGA/Util/Pileup.cpp | GenePlus/ncsv | f0f426ae4b64de86eee88518e3a1daf5718ce407 | [
"Apache-2.0",
"MIT"
] | 1 | 2020-09-30T09:31:20.000Z | 2020-09-30T09:31:20.000Z | extension/sv_helper/SGA/Util/Pileup.cpp | GenePlus/ncsv | f0f426ae4b64de86eee88518e3a1daf5718ce407 | [
"Apache-2.0",
"MIT"
] | null | null | null | extension/sv_helper/SGA/Util/Pileup.cpp | GenePlus/ncsv | f0f426ae4b64de86eee88518e3a1daf5718ce407 | [
"Apache-2.0",
"MIT"
] | null | null | null | //-----------------------------------------------
// Copyright 2009 Wellcome Trust Sanger Institute
// Written by Jared Simpson (js18@sanger.ac.uk)
// Released under the GPL
//-----------------------------------------------
//
// Pileup - An array of strings containing all the seen
// bases for a given region/read
//
#... | 25.292517 | 105 | 0.572351 | GenePlus |
5ac77f2cb8f197c56b9360258ec9cc55869dbd31 | 466 | cpp | C++ | component_solution/1.9/03.cpp | hsefz2018/NOIP-openjudge | b606d399b780959caadcf0094b90fa9163f30029 | [
"MIT"
] | 11 | 2016-02-03T11:13:07.000Z | 2021-05-30T04:37:02.000Z | 1.9/03.cpp | 20200117/noip-openjudge | 5c8b0786ea3fe2208ff9a44f244a631dbc5bb24c | [
"MIT"
] | 4 | 2015-08-18T10:52:33.000Z | 2015-10-29T12:51:52.000Z | 1.9/03.cpp | 20200117/noip-openjudge | 5c8b0786ea3fe2208ff9a44f244a631dbc5bb24c | [
"MIT"
] | 5 | 2016-02-03T11:13:09.000Z | 2019-07-10T13:25:59.000Z | #include <iostream>
using namespace std;
int main() {
int n;
int __max = 0, __maxday = 0;
bool flag = false;
cin >> n;
for(int i = 0; i < n; i++) {
int __1, __2;
cin >> __1 >> __2;
if(__1 + __2 >= 8) {
flag = true;
if(__1 + __2 > __max) {
... | 20.26087 | 42 | 0.399142 | hsefz2018 |
5ac9c043ae2ce4d94a063046d88275a99d683e8b | 4,217 | cc | C++ | tests/decode_matrix_den_delay_individualg_dense/decode_matrix_den_delay_individualg_dense_CODE/neuronUpdate.cc | 9inpachi/genn-opencl | 33231225a72611c7b629ef1d13f325f35d4ae2f7 | [
"MIT"
] | 1 | 2020-06-28T19:48:48.000Z | 2020-06-28T19:48:48.000Z | tests/decode_matrix_den_delay_individualg_dense/decode_matrix_den_delay_individualg_dense_CODE/neuronUpdate.cc | 9inpachi/genn-opencl | 33231225a72611c7b629ef1d13f325f35d4ae2f7 | [
"MIT"
] | 1 | 2020-02-10T15:26:29.000Z | 2020-02-10T15:26:29.000Z | tests/decode_matrix_den_delay_individualg_dense/decode_matrix_den_delay_individualg_dense_CODE/neuronUpdate.cc | 9inpachi/genn-opencl | 33231225a72611c7b629ef1d13f325f35d4ae2f7 | [
"MIT"
] | 1 | 2020-02-10T10:47:12.000Z | 2020-02-10T10:47:12.000Z | #include "definitionsInternal.h"
#include "supportCode.h"
extern "C" const char* updateNeuronsProgramSrc = R"(typedef float scalar;
#define DT 1.000000f
__kernel void preNeuronResetKernel(__global unsigned int* d_glbSpkCntPost, __global unsigned int* d_glbSpkCntPre) {
const size_t localId = get_local_id(0);
... | 35.737288 | 244 | 0.637183 | 9inpachi |
62d77492369efc40a4fc6ec02497ba789adceeaa | 838 | cpp | C++ | 502.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 8 | 2018-10-31T11:00:19.000Z | 2020-07-31T05:25:06.000Z | 502.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | null | null | null | 502.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 2 | 2018-05-31T11:29:22.000Z | 2019-09-11T06:34:40.000Z | class Solution {
public:
struct proj{
int cap,net;
};
static bool cmp(proj a,proj b){
if(a.net!=b.net) return a.net>b.net;
return a.cap<b.cap;
}
int findMaximizedCapital(int k, int W, vector<int>& Profits, vector<int>& Capital) {
int ans=0,n=Profits.size();
ve... | 24.647059 | 88 | 0.414081 | zfang399 |
62dbe15c0fdeb64bedc313ac4e858e69a68a15f2 | 2,210 | hpp | C++ | src/programs/swe_plane_timeintegrators/SWE_Plane_TS_interface.hpp | schreibm/sweet | a1b97e5862c3871177dff877dff825fd4b98a085 | [
"MIT"
] | null | null | null | src/programs/swe_plane_timeintegrators/SWE_Plane_TS_interface.hpp | schreibm/sweet | a1b97e5862c3871177dff877dff825fd4b98a085 | [
"MIT"
] | null | null | null | src/programs/swe_plane_timeintegrators/SWE_Plane_TS_interface.hpp | schreibm/sweet | a1b97e5862c3871177dff877dff825fd4b98a085 | [
"MIT"
] | null | null | null | /*
* SWE_Plane_TS_interface.hpp
*
* Created on: 29 May 2017
* Author: Martin Schreiber <SchreiberX@gmail.com>
*/
#ifndef SRC_PROGRAMS_SWE_PLANE_REXI_SWE_PLANE_TS_INTERFACE_HPP_
#define SRC_PROGRAMS_SWE_PLANE_REXI_SWE_PLANE_TS_INTERFACE_HPP_
#include <limits>
#include <sweet/plane/PlaneData_Spectral.hpp>
#i... | 27.625 | 97 | 0.767421 | schreibm |
62dd8584f683c4d9f5bc641495a4bfd4c578220b | 1,081 | hpp | C++ | x_stdlib.hpp | daher-alfawares/x | 70cb4e6f52905c777eae14cfa9e310138d88d7aa | [
"Apache-2.0"
] | null | null | null | x_stdlib.hpp | daher-alfawares/x | 70cb4e6f52905c777eae14cfa9e310138d88d7aa | [
"Apache-2.0"
] | null | null | null | x_stdlib.hpp | daher-alfawares/x | 70cb4e6f52905c777eae14cfa9e310138d88d7aa | [
"Apache-2.0"
] | null | null | null | //
// stdlib.hpp
// x
//
// Created by Daher Alfawares on 1/26/18.
// Copyright © 2018 Daher Alfawares. All rights reserved.
//
#ifndef x_stdlib_hpp
#define x_stdlib_hpp
#include <cstdlib>
namespace x {
template<typename T> T abs(const T& t){
return t < 0 ? -t : t;
}
template<typename T... | 22.061224 | 81 | 0.582794 | daher-alfawares |
62fd226a2958e10c6557f370d25b7ba605239723 | 9,409 | cpp | C++ | applications/builder/source/builder_widget.cpp | skarab/coffee-master | 6c3ff71b7f15735e41c9859b6db981b94414c783 | [
"MIT"
] | null | null | null | applications/builder/source/builder_widget.cpp | skarab/coffee-master | 6c3ff71b7f15735e41c9859b6db981b94414c783 | [
"MIT"
] | null | null | null | applications/builder/source/builder_widget.cpp | skarab/coffee-master | 6c3ff71b7f15735e41c9859b6db981b94414c783 | [
"MIT"
] | null | null | null | #include "builder_widget.h"
namespace builder
{
//-CONSTRUCTORS-------------------------------------------------------------------------------//
Widget::Widget()
{
ui::Window::Create(NULL, basic::Vector2i(), basic::Vector2i(),
ui::WINDOW_STYLE_DrawFrame);
GetLayout().SetStyle(u... | 41.449339 | 143 | 0.525029 | skarab |
1a0da23c99f2ada57ca58f077a163348c2e0b443 | 14,109 | hpp | C++ | src/rpc/server.hpp | SiLeader/cluster-manager | e945fda0758bb9c92de1528408d73b94b862c169 | [
"Apache-2.0"
] | null | null | null | src/rpc/server.hpp | SiLeader/cluster-manager | e945fda0758bb9c92de1528408d73b94b862c169 | [
"Apache-2.0"
] | null | null | null | src/rpc/server.hpp | SiLeader/cluster-manager | e945fda0758bb9c92de1528408d73b94b862c169 | [
"Apache-2.0"
] | null | null | null | //
// Created by cerussite on 2019/11/16.
//
#pragma once
#include <random>
#include <thread>
#include <grpc++/grpc++.h>
#include <cluster/detail/cluster.hpp>
#include "leader.pb.h"
#include "leader.grpc.pb.h"
#define likely(x) __builtin_expect(!!(x), 1)
#define unlikely(x) __builtin_expect(!!(x), 0)
namespace ... | 35.449749 | 100 | 0.501878 | SiLeader |
1a13f92d77561e7d14197d53c154f1ede2bf5235 | 1,286 | cpp | C++ | Semester 2-2/CSE 2202 Numerical Method Lab/Lab 01/A1_solve.cpp | AKC23/AUST | 102fb96d79b45c826fb4eb467ba6a7798e1ab4f4 | [
"MIT"
] | null | null | null | Semester 2-2/CSE 2202 Numerical Method Lab/Lab 01/A1_solve.cpp | AKC23/AUST | 102fb96d79b45c826fb4eb467ba6a7798e1ab4f4 | [
"MIT"
] | null | null | null | Semester 2-2/CSE 2202 Numerical Method Lab/Lab 01/A1_solve.cpp | AKC23/AUST | 102fb96d79b45c826fb4eb467ba6a7798e1ab4f4 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <math.h>
float FunctionEvaluate(float x);
int main()
{
float Xlower, Xupper, Xroot, temp = 0, AbsoluteError, RelativeError;
int i = 0;
printf("Enter the value of a and b respectively:\n");
scanf("%f %f", &Xlower, &Xupper);
printf("No.of iteration|\t Xroo... | 28.577778 | 101 | 0.499222 | AKC23 |
1a23ea1ac24564df256868c0105bc06da80c8049 | 7,704 | cpp | C++ | sources/myjson.cpp | Tasia11/lb1 | ff27bb1f2c66a2261392b128d1f035e20e7fdd2d | [
"MIT"
] | null | null | null | sources/myjson.cpp | Tasia11/lb1 | ff27bb1f2c66a2261392b128d1f035e20e7fdd2d | [
"MIT"
] | null | null | null | sources/myjson.cpp | Tasia11/lb1 | ff27bb1f2c66a2261392b128d1f035e20e7fdd2d | [
"MIT"
] | 1 | 2020-09-14T18:37:59.000Z | 2020-09-14T18:37:59.000Z | //
// Created by alexscorpy on 18.09.2020.
//
#include <myjson.hpp>
#include <algorithm>
// MyJson::MyJson() {};
MyJson::MyJson() = default;
const lengths_of_fields &MyJson::get_length() const {return length;}
std::string MyJson::get_one_split() const
{ // получаем строчку типа |---------|---------|---------|---------... | 34.859729 | 126 | 0.595794 | Tasia11 |
1a28c5a2d89bf1e4df33cc843702efc151f1775d | 1,092 | hpp | C++ | __unit_tests/gv_base_unit_test/unit_test_euler.hpp | dragonsn/gv_game_engine | dca6c1fb1f8d96e9a244f157a63f8a69da084b0f | [
"MIT"
] | 2 | 2018-12-03T13:17:31.000Z | 2020-04-08T07:00:02.000Z | __unit_tests/gv_base_unit_test/unit_test_euler.hpp | dragonsn/gv_game_engine | dca6c1fb1f8d96e9a244f157a63f8a69da084b0f | [
"MIT"
] | null | null | null | __unit_tests/gv_base_unit_test/unit_test_euler.hpp | dragonsn/gv_game_engine | dca6c1fb1f8d96e9a244f157a63f8a69da084b0f | [
"MIT"
] | null | null | null | namespace unit_test_euler
{
void main(gvt_array< gv_string >& args)
{
{
sub_test_timer timer("unit_test_euler0");
const static int nb_test = 1000;
for (int i = 0; i < nb_test; i++)
{
gvt_matrix44< gv_double > mat1, mat2, mat3;
gvt_euler< gv_double > e, e2;
e.v3.v.randomize(-6.f, 6.f);
//e.pitch=0;
... | 33.090909 | 88 | 0.662088 | dragonsn |
1a2cdff2721f92e88bc0dd7869725b1338d932e2 | 337 | cpp | C++ | Game/world/gsoundeffect.cpp | mjaneczek/OpenGothic | 383d8921e35d8e3b7479f6770fc07f73867b3bfd | [
"MIT"
] | 1 | 2020-07-03T22:51:15.000Z | 2020-07-03T22:51:15.000Z | Game/world/gsoundeffect.cpp | mjaneczek/OpenGothic | 383d8921e35d8e3b7479f6770fc07f73867b3bfd | [
"MIT"
] | null | null | null | Game/world/gsoundeffect.cpp | mjaneczek/OpenGothic | 383d8921e35d8e3b7479f6770fc07f73867b3bfd | [
"MIT"
] | null | null | null | #include "gsoundeffect.h"
GSoundEffect::GSoundEffect(Tempest::SoundEffect&& eff)
:eff(std::move(eff)) {
auto p = this->eff.position();
pos = {p[0],p[1],p[2]};
}
void GSoundEffect::setOcclusion(float v) {
occ = v;
eff.setVolume(occ*vol);
}
void GSoundEffect::setVolume(float v) {
vol = v;
eff.setVolu... | 18.722222 | 54 | 0.64095 | mjaneczek |
1a2fbfa4c8707a5124a4aab04478a23078ec712e | 6,124 | cpp | C++ | MFAudio/MFAudio.cpp | sipsorcery/mediafoundationsamples | 74c2f7cfcca2dc585a44f78931cc6a2630c0e106 | [
"Unlicense"
] | 172 | 2015-04-13T10:57:37.000Z | 2022-03-29T08:46:52.000Z | MFAudio/MFAudio.cpp | sipsorcery/mediafoundationsamples | 74c2f7cfcca2dc585a44f78931cc6a2630c0e106 | [
"Unlicense"
] | 9 | 2015-08-25T12:58:34.000Z | 2020-01-30T23:17:12.000Z | MFAudio/MFAudio.cpp | sipsorcery/mediafoundationsamples | 74c2f7cfcca2dc585a44f78931cc6a2630c0e106 | [
"Unlicense"
] | 77 | 2016-01-20T18:33:09.000Z | 2022-02-16T08:55:23.000Z | /******************************************************************************
* Filename: MFAudio.cpp
*
* Description:
* This file contains a C++ console application that plays the audio stream from
* a sample file using the Windows Media Foundation API and the Streaming
* Audio Renderer:
* https://msdn.microsoft.co... | 31.405128 | 112 | 0.664598 | sipsorcery |
1a318732deadc1d329681aff8204a94dd2015af8 | 3,093 | hpp | C++ | external/boost_1_60_0/qsboost/fusion/adapted/struct/detail/adapt_base_attr_filler.hpp | wouterboomsma/quickstep | a33447562eca1350c626883f21c68125bd9f776c | [
"MIT"
] | 1 | 2019-06-27T17:54:13.000Z | 2019-06-27T17:54:13.000Z | external/boost_1_60_0/qsboost/fusion/adapted/struct/detail/adapt_base_attr_filler.hpp | wouterboomsma/quickstep | a33447562eca1350c626883f21c68125bd9f776c | [
"MIT"
] | null | null | null | external/boost_1_60_0/qsboost/fusion/adapted/struct/detail/adapt_base_attr_filler.hpp | wouterboomsma/quickstep | a33447562eca1350c626883f21c68125bd9f776c | [
"MIT"
] | null | null | null | /*=============================================================================
Copyright (c) 2013-2014 Damien Buhl
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)
============================================... | 46.164179 | 85 | 0.565147 | wouterboomsma |
1a39882404dbc6852da5c45aa22f5379c4188e5f | 1,942 | cpp | C++ | Code/System/Core/Math/Transform.cpp | JuanluMorales/KRG | f3a11de469586a4ef0db835af4bc4589e6b70779 | [
"MIT"
] | 419 | 2022-01-27T19:37:43.000Z | 2022-03-31T06:14:22.000Z | Code/System/Core/Math/Transform.cpp | jagt/KRG | ba20cd8798997b0450491b0cc04dc817c4a4bc76 | [
"MIT"
] | 2 | 2022-01-28T20:35:33.000Z | 2022-03-13T17:42:52.000Z | Code/System/Core/Math/Transform.cpp | jagt/KRG | ba20cd8798997b0450491b0cc04dc817c4a4bc76 | [
"MIT"
] | 20 | 2022-01-27T20:41:02.000Z | 2022-03-26T16:16:57.000Z | #include "Transform.h"
//-------------------------------------------------------------------------
namespace KRG
{
Transform const Transform::Identity = Transform( Quaternion( 0, 0, 0, 1 ), Vector( 0, 0, 0, 1 ), Vector( 1, 1, 1, 0 ) );
//---------------------------------------------------------------... | 32.366667 | 125 | 0.372297 | JuanluMorales |
1a4b890d5ce6366303d27ef4e48dfb6cb1ba045a | 159 | cpp | C++ | source/object.cpp | nonameguru/oda | 447943cc15db35e90f6c68e67a1a74d9d303ba4d | [
"Apache-2.0"
] | null | null | null | source/object.cpp | nonameguru/oda | 447943cc15db35e90f6c68e67a1a74d9d303ba4d | [
"Apache-2.0"
] | null | null | null | source/object.cpp | nonameguru/oda | 447943cc15db35e90f6c68e67a1a74d9d303ba4d | [
"Apache-2.0"
] | null | null | null | // oda :: objective data access
#pragma once
#include <data/object>
namespace data
{
object::object()
{
}
object::~object()
{
}
}
| 9.352941 | 32 | 0.540881 | nonameguru |
1a50360a6d92d3381cd2ee09742047068d15f673 | 302 | hpp | C++ | src/CScreen.hpp | radimsuckr/SandGame | f4630615b101553d07bf44c623d848f09a8394f8 | [
"MIT"
] | null | null | null | src/CScreen.hpp | radimsuckr/SandGame | f4630615b101553d07bf44c623d848f09a8394f8 | [
"MIT"
] | null | null | null | src/CScreen.hpp | radimsuckr/SandGame | f4630615b101553d07bf44c623d848f09a8394f8 | [
"MIT"
] | null | null | null | #pragma once
class CMainWindow;
class CScreen {
public:
CScreen(CMainWindow* mainWindow, CScreen* parent);
CScreen* getParent();
virtual void render() = 0;
virtual void update() = 0;
protected:
CScreen* m_parent;
CMainWindow* m_mainWindow;
};
| 18.875 | 58 | 0.609272 | radimsuckr |
1a520644d132aae751f92cbd8fa8480b887578de | 974 | cpp | C++ | kernel/types/dmzTypesVolume.cpp | dmzgroup/dmz | fc2d9ddcb04ed71f4106b8d33539529807b3dea6 | [
"MIT"
] | 2 | 2015-11-05T03:03:43.000Z | 2017-05-15T12:55:39.000Z | kernel/types/dmzTypesVolume.cpp | dmzgroup/dmz | fc2d9ddcb04ed71f4106b8d33539529807b3dea6 | [
"MIT"
] | null | null | null | kernel/types/dmzTypesVolume.cpp | dmzgroup/dmz | fc2d9ddcb04ed71f4106b8d33539529807b3dea6 | [
"MIT"
] | null | null | null | /*!
\class dmz::Volume
\ingroup Types
\brief Volume base class.
\details Provides an interface for testing if a point is contained in a volume.
\fn void dmz::Volume::set_origin (const Vector &Origin)
\brief Sets the origin of the volume.
\param[in] Origin Vector specifying the origin of the Volume.
\fn dmz::Vector ... | 36.074074 | 82 | 0.762834 | dmzgroup |
1a54f4474185fee59a2330242e598f76b6cf0f25 | 1,012 | cpp | C++ | src/AnimationTimerThread.cpp | mbychawski/traffic-simulator | ef576cb9b2083e9e1cb8671356032d90dcfa42aa | [
"BSD-3-Clause"
] | null | null | null | src/AnimationTimerThread.cpp | mbychawski/traffic-simulator | ef576cb9b2083e9e1cb8671356032d90dcfa42aa | [
"BSD-3-Clause"
] | null | null | null | src/AnimationTimerThread.cpp | mbychawski/traffic-simulator | ef576cb9b2083e9e1cb8671356032d90dcfa42aa | [
"BSD-3-Clause"
] | null | null | null | #include "AnimationTimerThread.h"
#include "Scene.h"
#include "Animation.h"
#include <QWaitCondition>
#include <QTimer>
#include <QMutex>
#include <QMutexLocker>
AnimationTimerThread::AnimationTimerThread(QWaitCondition* waitCondition_, double interval_, Scene* scene_, Animation* animation_, QMutex* vMutex_, QMutex *... | 24.682927 | 166 | 0.690711 | mbychawski |
1a5aa9b2194821f6757cb999acd699fd4d3c45c1 | 1,334 | cpp | C++ | src/excel.cpp | wegatron/dt_manage | 10e327b8b304341ed9047d24f3928782821480e8 | [
"Apache-2.0"
] | 3 | 2018-09-05T13:33:21.000Z | 2022-02-12T00:49:16.000Z | src/excel.cpp | wegatron/dt_manage | 10e327b8b304341ed9047d24f3928782821480e8 | [
"Apache-2.0"
] | null | null | null | src/excel.cpp | wegatron/dt_manage | 10e327b8b304341ed9047d24f3928782821480e8 | [
"Apache-2.0"
] | 1 | 2018-09-05T13:33:22.000Z | 2018-09-05T13:33:22.000Z | #include "excel.h"
#include "stdio.h"
#include "encode.h"
void ExportExcel(const QString &filename, const QSortFilterProxyModel *sort_filter,
const std::string &header, const std::string &remark)
{
QMessageBox::information(NULL,"info",filename);
std::string std_filename = filenam... | 32.536585 | 103 | 0.582459 | wegatron |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.