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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a5b6963bcc138dbb2b4a3eed413fcfa41da29dde | 27,371 | cc | C++ | lib/proc.cc | Mnkras/atlas-system-agent | ee1e18002d5938bf83a01dd09125ffa6715a3c87 | [
"Apache-2.0"
] | null | null | null | lib/proc.cc | Mnkras/atlas-system-agent | ee1e18002d5938bf83a01dd09125ffa6715a3c87 | [
"Apache-2.0"
] | null | null | null | lib/proc.cc | Mnkras/atlas-system-agent | ee1e18002d5938bf83a01dd09125ffa6715a3c87 | [
"Apache-2.0"
] | null | null | null | #include "proc.h"
#include "util.h"
#include <cinttypes>
#include <cstring>
#include <utility>
namespace atlasagent {
Proc::Proc(spectator::Registry* registry, spectator::Tags net_tags,
std::string path_prefix) noexcept
: registry_(registry), net_tags_{std::move(net_tags)}, path_prefix_(std::move(path_... | 34.778907 | 100 | 0.657009 | Mnkras |
a5c04ecea6a3fe7c59975249a30694e14203d29f | 6,664 | cpp | C++ | tests/dataset_tests/MNIST/MnistTest.cpp | MatthieuHernandez/StraightforwardNeuralNetwork | e0b99a80bb1b3f76dcb08134aa0f1bc3e6b705d7 | [
"Apache-2.0"
] | 14 | 2019-08-29T07:20:19.000Z | 2022-03-22T12:51:02.000Z | tests/dataset_tests/MNIST/MnistTest.cpp | MatthieuHernandez/StraightforwardNeuralNetwork | e0b99a80bb1b3f76dcb08134aa0f1bc3e6b705d7 | [
"Apache-2.0"
] | 7 | 2020-08-07T11:08:45.000Z | 2021-05-08T17:11:12.000Z | tests/dataset_tests/MNIST/MnistTest.cpp | MatthieuHernandez/StraightforwardNeuralNetwork | e0b99a80bb1b3f76dcb08134aa0f1bc3e6b705d7 | [
"Apache-2.0"
] | 3 | 2020-08-07T10:53:52.000Z | 2021-02-16T22:13:22.000Z | #include "ExtendedGTest.hpp"
#include "neural_network/StraightforwardNeuralNetwork.hpp"
#include "Mnist.hpp"
using namespace std;
using namespace chrono;
using namespace snn;
class MnistTest : public testing::Test
{
protected:
static void SetUpTestSuite()
{
Mnist dataset("./datasets/MNIST");
d... | 31.885167 | 99 | 0.695978 | MatthieuHernandez |
a5c28fdde1fbb5613f3925799393f8851486754e | 9,627 | cpp | C++ | BookShop/P4/test-caso1-auto.cpp | diazmaria/BookShop | a3e21fc0bc52a9eca7c6dbe5cf27f60c1cee0a30 | [
"Apache-2.0"
] | null | null | null | BookShop/P4/test-caso1-auto.cpp | diazmaria/BookShop | a3e21fc0bc52a9eca7c6dbe5cf27f60c1cee0a30 | [
"Apache-2.0"
] | null | null | null | BookShop/P4/test-caso1-auto.cpp | diazmaria/BookShop | a3e21fc0bc52a9eca7c6dbe5cf27f60c1cee0a30 | [
"Apache-2.0"
] | null | null | null | /*
* ©2014 Antonio G.ª Dguez. & el resto de profesores de POO
*/
#include <ctime>
#include <sstream>
#include <string>
#include <iomanip>
#include <stdexcept>
#include <cmath>
#include <memory>
#include <locale>
#include <regex.h>
#include "fct.h"
#include "test-auto.h"
#include "tarjeta.h"
#include "usuario.h"
#i... | 27.904348 | 83 | 0.623766 | diazmaria |
a5c2d09dae7d6aa3e155e35d5d728daa54d6aa9c | 2,969 | cpp | C++ | LightOJ/LightOJ - 1397/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | 1 | 2022-02-11T16:55:36.000Z | 2022-02-11T16:55:36.000Z | LightOJ/LightOJ - 1397/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | LightOJ/LightOJ - 1397/Accepted.cpp | kzvd4729/Problem-Solving | 13b105e725a4c2f8db7fecc5d7a8f932b9fef4ab | [
"MIT"
] | null | null | null | /****************************************************************************************
* @author: kzvd4729 created: 2018-05-21 17:54:33
* solution_verdict: Accepted language: C++
* run... | 21.671533 | 111 | 0.356012 | kzvd4729 |
a5c4294201f63663d97494b68455d664c3cf5546 | 908 | cpp | C++ | Bolt/src/Bolt/Renderer/Texture.cpp | HerlufFraDiku/Bolt | 4b41109eb6dd3025135f8ecdd8c7cead6cd6d878 | [
"Apache-2.0"
] | null | null | null | Bolt/src/Bolt/Renderer/Texture.cpp | HerlufFraDiku/Bolt | 4b41109eb6dd3025135f8ecdd8c7cead6cd6d878 | [
"Apache-2.0"
] | null | null | null | Bolt/src/Bolt/Renderer/Texture.cpp | HerlufFraDiku/Bolt | 4b41109eb6dd3025135f8ecdd8c7cead6cd6d878 | [
"Apache-2.0"
] | null | null | null | #include "blpch.h"
#include "Bolt/Renderer/Renderer.h"
#include "Bolt/Renderer/Texture.h"
#include "Platform/OpenGL/OpenGLTexture.h"
namespace Bolt {
Ref<Texture2D> Texture2D::Create(const std::string& path) {
switch (Renderer::GetApi()) {
case RendererAPI::API::None: BL_CORE_ASSERT(false, "RendererAPI::None i... | 33.62963 | 108 | 0.740088 | HerlufFraDiku |
a5c7aa26b17e79219340eabb25294632e8f0975a | 241,402 | cpp | C++ | SampleProject/Builds/Il2CppOutputProject/Source/il2cppOutput/Il2CppCCWs103.cpp | frenchmajorcsminor/MapsSDK-Unity | 0b3c0713d63279bd9fa62837fa7559d7f3cbd439 | [
"MIT"
] | null | null | null | SampleProject/Builds/Il2CppOutputProject/Source/il2cppOutput/Il2CppCCWs103.cpp | frenchmajorcsminor/MapsSDK-Unity | 0b3c0713d63279bd9fa62837fa7559d7f3cbd439 | [
"MIT"
] | null | null | null | SampleProject/Builds/Il2CppOutputProject/Source/il2cppOutput/Il2CppCCWs103.cpp | frenchmajorcsminor/MapsSDK-Unity | 0b3c0713d63279bd9fa62837fa7559d7f3cbd439 | [
"MIT"
] | null | null | null | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include <limits>
#include "vm/CachedCCWBase.h"
#include "utils/New.h"
// System.Collections.Generic.IDictionary`2<System.Int32,UnityEngine.Experimental.TerrainAPI.TerrainUtility/TerrainMap>
struct ... | 47.389478 | 273 | 0.825155 | frenchmajorcsminor |
a5cad16447abc0f1b01ce872e52441067ba43bec | 498 | hpp | C++ | library/ATF/_IO_COUNTERS.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/_IO_COUNTERS.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/_IO_COUNTERS.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>
START_ATF_NAMESPACE
struct _IO_COUNTERS
{
unsigned __int64 ReadOperationCount;
unsigned __int64 WriteOperationCount;
unsigned __int64 Ot... | 27.666667 | 108 | 0.738956 | lemkova |
a5caf2d9f7fd5775948c17d667bdd7255813d461 | 5,802 | cpp | C++ | com/app/httpsupload.cpp | vheinitz/cl2 | d66b9ce8248126575984f1ade3e56bd01b2926fa | [
"MIT"
] | null | null | null | com/app/httpsupload.cpp | vheinitz/cl2 | d66b9ce8248126575984f1ade3e56bd01b2926fa | [
"MIT"
] | null | null | null | com/app/httpsupload.cpp | vheinitz/cl2 | d66b9ce8248126575984f1ade3e56bd01b2926fa | [
"MIT"
] | null | null | null | #include <QtNetwork>
#include "httpsupload.h"
#include <log/clog.h>
HttpsUpload::HttpsUpload(QObject *parent): QObject(parent),
_authRequestCnt(0),
_lastError(QSslError::NoError),
_openConnections(0),
_maxOpenConnections(1)
{
connect(&_nwAccMngr, SIGNAL(authenticationRequired(QNetworkRe... | 30.698413 | 169 | 0.605653 | vheinitz |
a5cf968feed218f8541e99e57a8d8da93d48c372 | 423 | hpp | C++ | source/utilities/tarjan.hpp | coder0xff/Plange | 26535f6c72d7ab0aaf753218ddbf3f4ad16283f7 | [
"BSD-3-Clause"
] | 16 | 2015-12-04T18:17:03.000Z | 2020-09-11T08:40:32.000Z | source/utilities/tarjan.hpp | coder0xff/Plange | 26535f6c72d7ab0aaf753218ddbf3f4ad16283f7 | [
"BSD-3-Clause"
] | 12 | 2017-07-12T02:04:05.000Z | 2018-07-07T01:17:12.000Z | source/utilities/tarjan.hpp | coder0xff/Plange | 26535f6c72d7ab0aaf753218ddbf3f4ad16283f7 | [
"BSD-3-Clause"
] | 5 | 2016-11-11T11:47:47.000Z | 2020-02-06T02:07:30.000Z | #ifndef INCLUDED_UTILITIES_TARJAN_HPP
#define INCLUDED_UTILITIES_TARJAN_HPP
#include <functional>
#include <vector>
//See https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
std::vector<std::vector<size_t>> tarjan(size_t const vertexCount, std::function<std::vector<size_t> (size_t)> cons... | 35.25 | 175 | 0.820331 | coder0xff |
a5d755b4882a0ef9da94462b219e6e883b004d25 | 2,533 | cpp | C++ | Lavio/Lavio/Source/Graphics/Graphic.cpp | landon912/Lavio | c726f43ed98f630d68ea6bc234f367b67578c918 | [
"MIT"
] | 1 | 2021-04-29T12:43:59.000Z | 2021-04-29T12:43:59.000Z | Lavio/Lavio/Source/Graphics/Graphic.cpp | landon912/Lavio | c726f43ed98f630d68ea6bc234f367b67578c918 | [
"MIT"
] | null | null | null | Lavio/Lavio/Source/Graphics/Graphic.cpp | landon912/Lavio | c726f43ed98f630d68ea6bc234f367b67578c918 | [
"MIT"
] | null | null | null | // **************************************** Lavio Engine ****************************************
// **************************** Copyright (c) 2017 All Rights Reserved **************************
// ***************************** Landon Kirk (landonaddison@yahoo.com) **************************
#include "Graphic.h"
#in... | 31.271605 | 233 | 0.639558 | landon912 |
a5d9cd9e861440aedeb0ae46d6af2abd5fe1815b | 1,574 | cpp | C++ | src/extractor.cpp | vsl-lang/vsl-bindgen | 96c48b698de341caa2c245c172c1ea8cbd18a825 | [
"Apache-2.0"
] | 1 | 2017-07-27T06:41:02.000Z | 2017-07-27T06:41:02.000Z | src/extractor.cpp | vsl-lang/vsl-bindgen | 96c48b698de341caa2c245c172c1ea8cbd18a825 | [
"Apache-2.0"
] | null | null | null | src/extractor.cpp | vsl-lang/vsl-bindgen | 96c48b698de341caa2c245c172c1ea8cbd18a825 | [
"Apache-2.0"
] | null | null | null | #include "extract.hpp"
#include <iostream>
/**
* The visitor which manages where and what AST nodes should go and where they
* should go.
*/
CLANG_VISITOR(Extract::visitor) {
CXCursorKind kind = clang_getCursorKind(cursor);
// Setup extractor
Extract& extractor = Extract::getInstance();
// We only... | 29.148148 | 78 | 0.648666 | vsl-lang |
77767f69484de47241a3be5fd043301ffcc8d5d1 | 4,916 | cpp | C++ | sg/generator/UnstructuredVol.cpp | ebachard/ospray_studio | 78928c93b482f9f95aa300c8f58c728dadedbe2f | [
"Apache-2.0"
] | 52 | 2018-10-09T23:56:32.000Z | 2022-03-25T09:27:40.000Z | sg/generator/UnstructuredVol.cpp | ebachard/ospray_studio | 78928c93b482f9f95aa300c8f58c728dadedbe2f | [
"Apache-2.0"
] | 11 | 2018-11-19T18:51:47.000Z | 2022-03-28T14:03:57.000Z | sg/generator/UnstructuredVol.cpp | ebachard/ospray_studio | 78928c93b482f9f95aa300c8f58c728dadedbe2f | [
"Apache-2.0"
] | 8 | 2019-02-10T00:16:24.000Z | 2022-02-17T19:50:15.000Z | // Copyright 2009-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#include "Generator.h"
// std
#include <sg/scene/volume/Unstructured.h>
#include <random>
namespace ospray {
namespace sg {
struct UnstructuredVol : public Generator
{
UnstructuredVol();
~UnstructuredVol() override = default;
void... | 26.010582 | 78 | 0.567535 | ebachard |
7776fa947d61b67e5d23f2a6bd89552a500cec98 | 1,452 | cpp | C++ | of/OF60.cpp | 4llenchan/dsa | 314991a32a24578dbf48e82ddded95804c95aa10 | [
"MIT"
] | null | null | null | of/OF60.cpp | 4llenchan/dsa | 314991a32a24578dbf48e82ddded95804c95aa10 | [
"MIT"
] | null | null | null | of/OF60.cpp | 4llenchan/dsa | 314991a32a24578dbf48e82ddded95804c95aa10 | [
"MIT"
] | null | null | null | #include <gtest/gtest.h>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include "Common.h"
using namespace std;
/**
* https://leetcode-cn.com/leetbook/read/illustration-of-algorithm/ozzl1r/
*/
class Solution {
public:
vector<double> dicesProbability(int n) {
/* 初始dp，即f(1)，因f(n)只与f(n-... | 25.034483 | 115 | 0.504132 | 4llenchan |
777afed31b036c761365d132db310a0599aaad31 | 1,242 | cpp | C++ | Contests/VTEX Cup 2019/a.cpp | rodrigoAMF7/Notebook---Maratonas | 06b38197a042bfbd27b20f707493e0a19fda7234 | [
"MIT"
] | 4 | 2019-01-25T21:22:55.000Z | 2019-03-20T18:04:01.000Z | Contests/VTEX Cup 2019/a.cpp | rodrigoAMF/competitive-programming-notebook | 06b38197a042bfbd27b20f707493e0a19fda7234 | [
"MIT"
] | null | null | null | Contests/VTEX Cup 2019/a.cpp | rodrigoAMF/competitive-programming-notebook | 06b38197a042bfbd27b20f707493e0a19fda7234 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
// Nome de Tipos
typedef long ll;
typedef unsigned long long ull;
typedef long double ld;
// Atalhos
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define l length()
#define forn(i, n) for ( int i = 0; i < (n); ++i )
#define fornx(i, de, ate) for ( int i = (de); i... | 18 | 62 | 0.561997 | rodrigoAMF7 |
77801c8e667ff2433517acb8f4c4f6ba4f53656f | 349 | cpp | C++ | verifications/string/mp.ut.test.cpp | Pachicobue/AlgoLib | 346f2208e9e93ef3c7e03c1b3ad525bc08be6d2e | [
"Unlicense"
] | 4 | 2018-04-01T18:41:16.000Z | 2019-08-11T11:45:47.000Z | verifications/string/mp.ut.test.cpp | pachicobue/algolib | 8acbce5c49cdfada7d187e7acab25a5c6a2f7fc5 | [
"Unlicense"
] | null | null | null | verifications/string/mp.ut.test.cpp | pachicobue/algolib | 8acbce5c49cdfada7d187e7acab25a5c6a2f7fc5 | [
"Unlicense"
] | 1 | 2018-04-08T11:38:22.000Z | 2018-04-08T11:38:22.000Z | #define PROBLEM \
"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
#include "../../src/string/mp.hpp"
void Test()
{
Str s = "aabaabaaa";
const auto rs = mp(s.begin(), s.end());
assert(rs == (Vec<int>{-1, 0, 1, 0, 1, 2, 3, 4, 5, 2}));
}
int main()
{
Test();
std::cout << "Hel... | 19.388889 | 72 | 0.550143 | Pachicobue |
778073a2aacba85eff1ed33e496888831480d00e | 6,468 | hpp | C++ | internal/polynomial_regression_internals.hpp | andviane/polynomial_regression | 292d1cfe63c6de70cd3d853fe534fec72ab8cd93 | [
"MIT"
] | 1 | 2020-08-20T17:40:22.000Z | 2020-08-20T17:40:22.000Z | internal/polynomial_regression_internals.hpp | andviane/polynomial_regression | 292d1cfe63c6de70cd3d853fe534fec72ab8cd93 | [
"MIT"
] | null | null | null | internal/polynomial_regression_internals.hpp | andviane/polynomial_regression | 292d1cfe63c6de70cd3d853fe534fec72ab8cd93 | [
"MIT"
] | null | null | null | #ifndef _POLYNOMIAL_REGRESSION_ABC_INTERNALS_H
#define _POLYNOMIAL_REGRESSION_ABC_INTERNALS_H __POLYNOMIAL_REGRESSION_ABC_INTERNALS_H
/**
* PURPOSE:
*
* Polynomial Regression aims to fit a non-linear relationship to a set of
* points. It approximates this by solving a series of linear equations using
* a leas... | 34.588235 | 123 | 0.575294 | andviane |
778678c7bf1fc966743f3a7b7ee4d3597cbe585b | 6,046 | cpp | C++ | ThorEngine/Source Code/C_Camera.cpp | markitus18/Game-Engine | ea9546a16f2e40d13002340b4cb6b42a33a41344 | [
"Unlicense"
] | null | null | null | ThorEngine/Source Code/C_Camera.cpp | markitus18/Game-Engine | ea9546a16f2e40d13002340b4cb6b42a33a41344 | [
"Unlicense"
] | null | null | null | ThorEngine/Source Code/C_Camera.cpp | markitus18/Game-Engine | ea9546a16f2e40d13002340b4cb6b42a33a41344 | [
"Unlicense"
] | null | null | null | #include "C_Camera.h"
#include "GameObject.h"
#include "C_Transform.h"
#include "Engine.h"
#include "M_Renderer3D.h"
#include "OpenGL.h"
#include "Scene.h"
#define DEFAULT_CAMERA_WIDTH 1920
#define DEFAULT_CAMERA_HEIGHT 1080
C_Camera::C_Camera(GameObject* gameObject) : Component(Component::Type::Camera, gameObject,... | 26.871111 | 203 | 0.769931 | markitus18 |
778b93b690cdc1f73b8ccc95c8201ddc6b2f8966 | 950 | hpp | C++ | libs/parsejson/include/sge/parse/json/find_object.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | libs/parsejson/include/sge/parse/json/find_object.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | libs/parsejson/include/sge/parse/json/find_object.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_PARSE_JSON_FIND_OBJECT_HPP_INCLUDED
#define SGE_PARSE_JSON_FIND_OBJECT_HPP_INCLUDED
#i... | 31.666667 | 94 | 0.772632 | cpreh |
778e2504956f9271e5d48e101c19378ce3f6d68b | 3,480 | cpp | C++ | Before Summer 2017/SummerTrain Archieve/Submissions.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | 1 | 2019-12-19T06:51:20.000Z | 2019-12-19T06:51:20.000Z | Before Summer 2017/SummerTrain Archieve/Submissions.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | null | null | null | Before Summer 2017/SummerTrain Archieve/Submissions.cpp | mohamedGamalAbuGalala/Practice | 2a5fa3bdaf995d0c304f04231e1a69e6960f72c8 | [
"MIT"
] | null | null | null |
// By :: abu_galala
#include <iostream>
#include <vector>
#include <set>
#include <string.h>
using namespace std;
class node {
public:
int ind, cost;
};
bool operator < (node a, node b) {
if (a.cost != b.cost)
return a.cost < b.cost;
else
return a.ind < b.ind;
}
vector <int> res, arr[100001], C[100001];
in... | 18.219895 | 63 | 0.483621 | mohamedGamalAbuGalala |
779260281bdac2c5b5331b756cf5f7f36a509827 | 604 | hpp | C++ | example/mouse_facade.hpp | gabriel-araujjo/ipc | b76165b8758cfb85a04014a5755ebaecbddb20ce | [
"MIT"
] | null | null | null | example/mouse_facade.hpp | gabriel-araujjo/ipc | b76165b8758cfb85a04014a5755ebaecbddb20ce | [
"MIT"
] | null | null | null | example/mouse_facade.hpp | gabriel-araujjo/ipc | b76165b8758cfb85a04014a5755ebaecbddb20ce | [
"MIT"
] | null | null | null | #pragma once
#include "data.hpp"
namespace example {
enum mouse_button {
LEFT,
RIGTH,
MIDDLE,
};
// Testing may listener approaches
struct on_mouse_click {
virtual void on_press(point, mouse_button) = 0;
virtual void on_release(point, mouse_button) = 0;
};
struct mouse_move_listener {
virtual void opera... | 18.875 | 81 | 0.728477 | gabriel-araujjo |
77936d1d29062bdaafd50c4a52850d18356fe9dd | 1,176 | cpp | C++ | SHS/Buffer.cpp | wanttobeno/SimpleHTTPServer | 4607d8507bb46e0c7b602c35d669af5c1e79142b | [
"Apache-2.0"
] | null | null | null | SHS/Buffer.cpp | wanttobeno/SimpleHTTPServer | 4607d8507bb46e0c7b602c35d669af5c1e79142b | [
"Apache-2.0"
] | null | null | null | SHS/Buffer.cpp | wanttobeno/SimpleHTTPServer | 4607d8507bb46e0c7b602c35d669af5c1e79142b | [
"Apache-2.0"
] | 1 | 2019-11-24T16:38:54.000Z | 2019-11-24T16:38:54.000Z | #include "Buffer.h"
Buffer::Buffer(std::unique_ptr<char[]> ptr, size_t length) : buffer(std::move(ptr)), length(length)
{
}
Buffer::Buffer(char* ptr, size_t length) : buffer(ptr), length(length)
{
}
Buffer::Buffer(size_t length) : buffer(new char[length]), length(length)
{
}
Buffer::Buffer(Buffer&& b) : buffer(std:... | 17.043478 | 126 | 0.653061 | wanttobeno |
7797460bb4b3605c5fbc49efe00a31f64fac825a | 998 | cpp | C++ | leetcode/removeDuplicatefromsortedlist2.cpp | WIZARD-CXY/pl | 22b7f5d81804f4e333d3cff6433364ba1a0ac7ef | [
"Apache-2.0"
] | 1 | 2016-01-20T08:26:34.000Z | 2016-01-20T08:26:34.000Z | leetcode/removeDuplicatefromsortedlist2.cpp | WIZARD-CXY/pl | 22b7f5d81804f4e333d3cff6433364ba1a0ac7ef | [
"Apache-2.0"
] | 1 | 2015-10-21T05:38:17.000Z | 2015-11-02T07:42:55.000Z | leetcode/removeDuplicatefromsortedlist2.cpp | WIZARD-CXY/pl | 22b7f5d81804f4e333d3cff6433364ba1a0ac7ef | [
"Apache-2.0"
] | null | null | null | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode *dummy= new ListNode(-1);
dummy->next=head;
ListNode *... | 23.761905 | 65 | 0.422846 | WIZARD-CXY |
77a8a1ad7811ee3d83cc146d40ff6b8288b4c08e | 5,815 | cpp | C++ | level1/p12_warehouse/source.cpp | xenoppy/c2021 | a465ec47b3771c5bf14dddb26cba34b091645200 | [
"MIT"
] | 1 | 2021-03-04T03:52:58.000Z | 2021-03-04T03:52:58.000Z | level1/p12_warehouse/source.cpp | xenoppy/c2021 | a465ec47b3771c5bf14dddb26cba34b091645200 | [
"MIT"
] | null | null | null | level1/p12_warehouse/source.cpp | xenoppy/c2021 | a465ec47b3771c5bf14dddb26cba34b091645200 | [
"MIT"
] | null | null | null | /*
README:
对储存仓库信息的文件格式做出规定：第一行记录货品数，随后每一行读取货物名称和数字
货物名字禁止包含空格
先选择是新建一个仓库文件或读取一个仓库文件
再进入主菜单：
1.查看仓库内容
2.入库
3.出库
4.将某项物品从仓库中移除
5.退出
操作过程中会自动保存文件
*/
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
#include <Windows.h>
#include <time.h>
#include... | 19.383333 | 87 | 0.461737 | xenoppy |
77b26a45ca898ba678943cca7341bfbcf06769fb | 316 | cpp | C++ | cppDiamond/src/spellCard.cpp | mjjohnson322/oop | e0e8e3486917a18d38734b9460d6cf47ec20331b | [
"MIT"
] | null | null | null | cppDiamond/src/spellCard.cpp | mjjohnson322/oop | e0e8e3486917a18d38734b9460d6cf47ec20331b | [
"MIT"
] | null | null | null | cppDiamond/src/spellCard.cpp | mjjohnson322/oop | e0e8e3486917a18d38734b9460d6cf47ec20331b | [
"MIT"
] | null | null | null | #include <iostream>
#include "spellType.h"
#include "card.h"
#include "spellCard.h"
namespace card{
SpellCard::SpellCard(std::string _name, SpellType _type)
: Card(_name), type(_type){}
SpellType SpellCard::getSpellType() const{
return this->type;
}
SpellCard::~SpellCard(){
}
} | 21.066667 | 60 | 0.648734 | mjjohnson322 |
77b3f073d05dd6aa52552ff67df2192d64a98f71 | 307 | cpp | C++ | 1953/1691497_AC_0MS_72K.cpp | vandreas19/POJ_sol | 4895764ab800e8c2c4b2334a562dec2f07fa243e | [
"MIT"
] | 18 | 2017-08-14T07:34:42.000Z | 2022-01-29T14:20:29.000Z | 1953/1691497_AC_0MS_72K.cpp | pinepara/poj_solutions | 4895764ab800e8c2c4b2334a562dec2f07fa243e | [
"MIT"
] | null | null | null | 1953/1691497_AC_0MS_72K.cpp | pinepara/poj_solutions | 4895764ab800e8c2c4b2334a562dec2f07fa243e | [
"MIT"
] | 14 | 2016-12-21T23:37:22.000Z | 2021-07-24T09:38:57.000Z | #include<iostream.h>
void main()
{
int iResult[45],iCaseNum,i,iLength;
iResult[0]=2;
iResult[1]=3;
for(i=2;i<45;i++)
iResult[i]=iResult[i-1]+iResult[i-2];
cin>>iCaseNum;
for(i=0;i<iCaseNum;i++)
{
cin>>iLength;
cout<<"Scenario #"<<i+1<<":\n"<<iResult[iLength-1]<<"\n"<<endl;
}
} | 19.1875 | 66 | 0.57329 | vandreas19 |
77bb08835112e093d4bb7c115fa9387cfd8730ee | 5,912 | cpp | C++ | cmd/kv_seek.cpp | gelfand/silkrpc | ecbfb0bb31c4d9ca8bd37bd193ae922fb4bbfbb3 | [
"Apache-2.0"
] | 9 | 2021-03-08T13:26:46.000Z | 2022-02-25T23:23:16.000Z | cmd/kv_seek.cpp | gelfand/silkrpc | ecbfb0bb31c4d9ca8bd37bd193ae922fb4bbfbb3 | [
"Apache-2.0"
] | 151 | 2020-11-22T15:42:58.000Z | 2022-03-31T20:12:18.000Z | cmd/kv_seek.cpp | gelfand/silkrpc | ecbfb0bb31c4d9ca8bd37bd193ae922fb4bbfbb3 | [
"Apache-2.0"
] | 5 | 2021-03-15T11:01:34.000Z | 2022-03-12T15:45:00.000Z | /*
Copyright 2020 The Silkrpc Authors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed t... | 39.945946 | 105 | 0.635995 | gelfand |
77c959cc6a2bc549b7f5074ad641741ccf43cd94 | 5,224 | cpp | C++ | example-EventDispatcher-1/src/ofApp.cpp | selflash/ofxSelflash | 087a263b2d4de970edd75ecab2c2a48b7b58e62d | [
"MIT"
] | 19 | 2015-05-14T09:57:38.000Z | 2022-01-10T23:32:28.000Z | example-EventDispatcher-1/src/ofApp.cpp | selflash/ofxSelflash | 087a263b2d4de970edd75ecab2c2a48b7b58e62d | [
"MIT"
] | 3 | 2015-08-04T09:07:26.000Z | 2018-01-18T07:14:35.000Z | example-EventDispatcher-1/src/ofApp.cpp | selflash/ofxSelflash | 087a263b2d4de970edd75ecab2c2a48b7b58e62d | [
"MIT"
] | 1 | 2015-08-04T09:05:22.000Z | 2015-08-04T09:05:22.000Z | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup() {
ofSetWindowTitle("example-Eventdispatcher-1");
//---------------------------------------
dispatcherA = new flEventDispatcher();
dispatcherA->debug(true);
dispatcherA->addEventListener... | 32.855346 | 88 | 0.411371 | selflash |
77d0e2ade75aa7e0d6f4afccb5ae6715ec1ab6af | 1,726 | cpp | C++ | Sail/src/Sail/entities/systems/light/LightListSystem.cpp | BTH-StoraSpel-DXR/SPLASH | 1bf4c9b96cbcce570ed3a97f30a556a992e1ad08 | [
"MIT"
] | 12 | 2019-09-11T15:52:31.000Z | 2021-11-14T20:33:35.000Z | Sail/src/Sail/entities/systems/light/LightListSystem.cpp | BTH-StoraSpel-DXR/Game | 1bf4c9b96cbcce570ed3a97f30a556a992e1ad08 | [
"MIT"
] | 227 | 2019-09-11T08:40:24.000Z | 2020-06-26T14:12:07.000Z | Sail/src/Sail/entities/systems/light/LightListSystem.cpp | BTH-StoraSpel-DXR/Game | 1bf4c9b96cbcce570ed3a97f30a556a992e1ad08 | [
"MIT"
] | 2 | 2020-10-26T02:35:18.000Z | 2020-10-26T02:36:01.000Z | #include "pch.h"
#include "LightListSystem.h"
#include "../../components/LightListComponent.h"
#include "../../Entity.h"
#include "Sail/graphics/light/LightSetup.h"
#ifdef _DEBUG
#include "Sail/graphics/camera/PerspectiveCamera.h"
#endif
LightListSystem::LightListSystem() {
registerComponent<LightListComponent>(true... | 27.396825 | 98 | 0.728853 | BTH-StoraSpel-DXR |
77d90609e59d924561abdedefdc182d911389e23 | 524 | hh | C++ | src/render/TexDictionary.hh | DeadlyFugu/rail-canyon | 4b3e0d761fcf60a55e2a70ca2e2787ec2bfef53b | [
"Zlib"
] | 3 | 2018-03-13T07:24:25.000Z | 2021-11-21T01:09:26.000Z | src/render/TexDictionary.hh | DeadlyFugu/rail-canyon | 4b3e0d761fcf60a55e2a70ca2e2787ec2bfef53b | [
"Zlib"
] | null | null | null | src/render/TexDictionary.hh | DeadlyFugu/rail-canyon | 4b3e0d761fcf60a55e2a70ca2e2787ec2bfef53b | [
"Zlib"
] | 4 | 2018-03-04T20:31:39.000Z | 2019-12-13T19:35:23.000Z | // Represents a RenderWare TXD file
#pragma once
#include "common.hh"
#include "texture.hh"
#include <bigg.hpp>
class TexDictionary {
struct TextureEntry {
bgfx::TextureHandle handle;
std::string name;
int width, height;
};
std::vector<TextureEntry> textures;
int listbox_item_current = 0;
public:
/// load... | 19.407407 | 51 | 0.734733 | DeadlyFugu |
77d96996cff8fc1e5d6ecd3863c13694bf19aa50 | 406 | cpp | C++ | raygame/BooleanDecision.cpp | pSmith000/SteeringBehaviours | 9e0d4e2dd0d5a2db1d68b66bd4eb431548f76544 | [
"MIT"
] | null | null | null | raygame/BooleanDecision.cpp | pSmith000/SteeringBehaviours | 9e0d4e2dd0d5a2db1d68b66bd4eb431548f76544 | [
"MIT"
] | null | null | null | raygame/BooleanDecision.cpp | pSmith000/SteeringBehaviours | 9e0d4e2dd0d5a2db1d68b66bd4eb431548f76544 | [
"MIT"
] | null | null | null | #include "BooleanDecision.h"
BooleanDecision::BooleanDecision(Decision* leftChild, Decision* rightChild)
{
m_left = leftChild;
m_right = rightChild;
}
void BooleanDecision::makeDecision(Agent* agent, float deltaTime)
{
if (checkCondition(agent, deltaTime))
if (m_left)
{
m_left->makeDecision(agent, deltaTime... | 17.652174 | 75 | 0.716749 | pSmith000 |
77d9e08ae9cb5ad95e8d96dc6f896f82696f8e48 | 7,465 | hpp | C++ | Source/AllProjects/Drivers/ZWave/ZWaveLevi/Shared/ZWaveLeviSh_Thermo.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 51 | 2020-12-26T18:17:16.000Z | 2022-03-15T04:29:35.000Z | Source/AllProjects/Drivers/ZWave/ZWaveLevi/Shared/ZWaveLeviSh_Thermo.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | null | null | null | Source/AllProjects/Drivers/ZWave/ZWaveLevi/Shared/ZWaveLeviSh_Thermo.hpp | MarkStega/CQC | c1d0e01ec2abcaa5b8eb1899b9f0522fecee4b07 | [
"MIT"
] | 4 | 2020-12-28T07:24:39.000Z | 2021-12-29T12:09:37.000Z | //
// FILE NAME: ZWaveLevih_Thermo.hpp
//
// AUTHOR: Dean Roddey
//
// CREATED: 07/12/2012
//
// COPYRIGHT: Charmed Quark Systems, Ltd @ 2020
//
// This software is copyrighted by 'Charmed Quark Systems, Ltd' and
// the author (Dean Roddey.) It is licensed under the MIT Open Source
// license:
//
// https://opens... | 30.345528 | 78 | 0.414601 | MarkStega |
77e037154146af32d12211eb380fe20c9d1fd513 | 7,338 | cpp | C++ | Source/Evolve/WarpXEvolveES.cpp | guj/WarpX | 7833e281dd9fa695a57d097eac31acef7ccaa3eb | [
"BSD-3-Clause-LBNL"
] | null | null | null | Source/Evolve/WarpXEvolveES.cpp | guj/WarpX | 7833e281dd9fa695a57d097eac31acef7ccaa3eb | [
"BSD-3-Clause-LBNL"
] | null | null | null | Source/Evolve/WarpXEvolveES.cpp | guj/WarpX | 7833e281dd9fa695a57d097eac31acef7ccaa3eb | [
"BSD-3-Clause-LBNL"
] | null | null | null | /* Copyright 2019 Andrew Myers, Axel Huebl, David Bizzozero
* David Grote, Maxence Thevenet, Remi Lehe
*
*
* This file is part of WarpX.
*
* License: BSD-3-Clause-LBNL
*/
#include <WarpX.H>
#include <WarpX_f.H>
namespace
{
const std::string level_prefix {"Level_"};
}
using namespace amrex;
void
WarpX::Evo... | 33.972222 | 105 | 0.58749 | guj |
77ebc6b6b6da24cdfdd9db6caf4d6488cdf1de9d | 1,101 | cpp | C++ | solved/circuitmath.cpp | AudreyFelicio/Kattis-Solutions | bc5856e1c7d9b8d8c2677e2af5e84a37110200e8 | [
"MIT"
] | null | null | null | solved/circuitmath.cpp | AudreyFelicio/Kattis-Solutions | bc5856e1c7d9b8d8c2677e2af5e84a37110200e8 | [
"MIT"
] | null | null | null | solved/circuitmath.cpp | AudreyFelicio/Kattis-Solutions | bc5856e1c7d9b8d8c2677e2af5e84a37110200e8 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
unordered_map<char, bool> maps;
for (int i = 0; i < n; i++) {
string x;
cin >> x;
if (x == "T") {
maps[i + 'A'] = true;
} else {
maps[i + 'A... | 21.173077 | 48 | 0.479564 | AudreyFelicio |
77f016f18e6d45700ffec15f941866ebf22b0038 | 7,338 | cpp | C++ | disp_color/src/tftlcd_mm16_vertibo_a.cpp | Bergi84/vihaltests | f338e6aff3e389501dc8a018f1dbde862b7971a1 | [
"BSD-2-Clause"
] | null | null | null | disp_color/src/tftlcd_mm16_vertibo_a.cpp | Bergi84/vihaltests | f338e6aff3e389501dc8a018f1dbde862b7971a1 | [
"BSD-2-Clause"
] | null | null | null | disp_color/src/tftlcd_mm16_vertibo_a.cpp | Bergi84/vihaltests | f338e6aff3e389501dc8a018f1dbde862b7971a1 | [
"BSD-2-Clause"
] | 2 | 2022-01-05T01:53:54.000Z | 2022-03-14T19:58:29.000Z | /* -----------------------------------------------------------------------------
* This file is a part of the NVCM Tests project: https://github.com/nvitya/nvcmtests
* Copyright (c) 2018 Viktor Nagy, nvitya
*
* This software is provided 'as-is', without any express or implied warranty.
* In no event will the autho... | 34.777251 | 90 | 0.676206 | Bergi84 |
af873c2a5cc75a981fd63f052900b68e1b64d792 | 2,330 | cpp | C++ | fon9/PkCont.cpp | fonwin/Plan | 3bfa9407ab04a26293ba8d23c2208bbececb430e | [
"Apache-2.0"
] | 21 | 2019-01-29T14:41:46.000Z | 2022-03-11T00:22:56.000Z | fon9/PkCont.cpp | fonwin/Plan | 3bfa9407ab04a26293ba8d23c2208bbececb430e | [
"Apache-2.0"
] | null | null | null | fon9/PkCont.cpp | fonwin/Plan | 3bfa9407ab04a26293ba8d23c2208bbececb430e | [
"Apache-2.0"
] | 9 | 2019-01-27T14:19:33.000Z | 2022-03-11T06:18:24.000Z | // \file fon9/PkCont.cpp
// \author fonwinz@gmail.com
#include "fon9/PkCont.hpp"
namespace fon9 {
PkContFeeder::PkContFeeder() {
}
PkContFeeder::~PkContFeeder() {
this->Timer_.DisposeAndWait();
}
void PkContFeeder::Clear() {
this->Timer_.StopAndWait();
PkPendings::Locker pks{this->PkPendings_};
pks->clea... | 31.066667 | 114 | 0.607296 | fonwin |
af9493c1cd572e46ff5beaa0a72634156b86b660 | 1,891 | cpp | C++ | Engine/Source/Runtime/Scene/Components/MeshComponent.cpp | Futureblur/MoonEngine | 0b3e8e9d04e7ca7b6c3cbf657e59a5c3b82cfa9b | [
"Apache-2.0"
] | 1 | 2021-10-17T12:11:28.000Z | 2021-10-17T12:11:28.000Z | Engine/Source/Runtime/Scene/Components/MeshComponent.cpp | Futureblur/MoonEngine | 0b3e8e9d04e7ca7b6c3cbf657e59a5c3b82cfa9b | [
"Apache-2.0"
] | null | null | null | Engine/Source/Runtime/Scene/Components/MeshComponent.cpp | Futureblur/MoonEngine | 0b3e8e9d04e7ca7b6c3cbf657e59a5c3b82cfa9b | [
"Apache-2.0"
] | null | null | null | // Copyright (c) 2021 Futureblur. All rights reserved. Visit https://ice.futureblur.com for more information.
#include "MeshComponent.h"
#include <glad/glad.h>
#include <glm/gtc/matrix_transform.hpp>
#include "Renderer/Renderer.h"
#include "Renderer/RenderingPipeline.h"
#include "Renderer/Shader.h"
#include "Rendere... | 19.494845 | 109 | 0.67266 | Futureblur |
af94c6c141f5de9442ca3a1ba235147d317f68eb | 964 | cpp | C++ | 1106/main.cpp | Heliovic/PAT_Solutions | 7c5dd554654045308f2341713c3e52cc790beb59 | [
"MIT"
] | 2 | 2019-03-18T12:55:38.000Z | 2019-09-07T10:11:26.000Z | 1106/main.cpp | Heliovic/My_PAT_Answer | 7c5dd554654045308f2341713c3e52cc790beb59 | [
"MIT"
] | null | null | null | 1106/main.cpp | Heliovic/My_PAT_Answer | 7c5dd554654045308f2341713c3e52cc790beb59 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <climits>
#include <vector>
#include <cmath>
#define MAX_N 102400
using namespace std;
vector<int> tree[MAX_N];
double min_price = INT_MAX;
int min_num = 0;
int N;
double P, r;
void dfs(int id, int lev)
{
if (tree[id].size() == 0)
{
double tmpprice = P * pow((1 + r / 100)... | 16.62069 | 54 | 0.455394 | Heliovic |
af9f2f53155c084964a3c3263a3e06785912f174 | 10,147 | cpp | C++ | FariaRomEditor/MapEditorPalette.cpp | dennisjenkins75/FariaRomEditor | 5050ce9a498ecb4ad5f7ffc76503cce258961cba | [
"MIT"
] | 6 | 2017-08-06T20:02:34.000Z | 2018-10-23T16:21:58.000Z | FariaRomEditor/MapEditorPalette.cpp | dennisjenkins75/FariaRomEditor | 5050ce9a498ecb4ad5f7ffc76503cce258961cba | [
"MIT"
] | null | null | null | FariaRomEditor/MapEditorPalette.cpp | dennisjenkins75/FariaRomEditor | 5050ce9a498ecb4ad5f7ffc76503cce258961cba | [
"MIT"
] | null | null | null | /* MapEditorTools.cpp */
#include "FariaRomEditor.h"
static void RenderPaletteTiles(HWND hWnd, HDC hDC, MAP_CONTAINER *pMapData, int nFirstTile, int nLastTile);
static inline int ScreenToTileIndex(MAP_CONTAINER *pMapData, int x)
{
int temp = pMapData->PaletteData.render_width + pMapData->PaletteData.tile_sp... | 29.074499 | 123 | 0.691929 | dennisjenkins75 |
afa630d5df68105c73ceb2746a021e773a98fa64 | 2,951 | cpp | C++ | src/Mushcore/MushcoreParamList.cpp | quimnuss/adanaxis | a04eb945fe808aeb9be5da305a37ff47e04dd006 | [
"MIT"
] | null | null | null | src/Mushcore/MushcoreParamList.cpp | quimnuss/adanaxis | a04eb945fe808aeb9be5da305a37ff47e04dd006 | [
"MIT"
] | null | null | null | src/Mushcore/MushcoreParamList.cpp | quimnuss/adanaxis | a04eb945fe808aeb9be5da305a37ff47e04dd006 | [
"MIT"
] | null | null | null | //%Header {
/*****************************************************************************
*
* File: src/Mushcore/MushcoreParamList.cpp
*
* Author: Andy Southgate 2002-2005
*
* This file contains original work by Andy Southgate. The author and his
* employer (Mushware Limited) irrevocably waive all of their cop... | 26.827273 | 79 | 0.638089 | quimnuss |
afa66b731dfac39dad5c1578317f762331b142dd | 2,046 | cpp | C++ | src/Factory/PonUserPlaneTest.cpp | edwardgc/oo | 6abd25204423927375787cc80536dce9344b9702 | [
"Apache-2.0"
] | null | null | null | src/Factory/PonUserPlaneTest.cpp | edwardgc/oo | 6abd25204423927375787cc80536dce9344b9702 | [
"Apache-2.0"
] | null | null | null | src/Factory/PonUserPlaneTest.cpp | edwardgc/oo | 6abd25204423927375787cc80536dce9344b9702 | [
"Apache-2.0"
] | null | null | null | /**
* Copyright (c) 2020 Nokia. All rights reserved.
* This program contains proprietary information which is a trade secret
* of Nokia and also is protected as an unpublished work under applicable
* Copyright laws. Recipient is to retain this program in confidence and
* is not permitted to use or make copies ther... | 25.259259 | 94 | 0.727761 | edwardgc |
afa69b9a7b893f94ba732a4698cd8358ce481e00 | 551 | cpp | C++ | src/tcp_socket.cpp | linear-rpc/linear-cpp | 9f3b2a924a11848829f00e325b5449db0a4c6e30 | [
"MIT"
] | 19 | 2015-09-02T03:25:55.000Z | 2021-03-07T15:02:33.000Z | src/tcp_socket.cpp | linear-rpc/linear-cpp | 9f3b2a924a11848829f00e325b5449db0a4c6e30 | [
"MIT"
] | 2 | 2015-12-11T12:03:11.000Z | 2017-09-13T09:03:33.000Z | src/tcp_socket.cpp | linear-rpc/linear-cpp | 9f3b2a924a11848829f00e325b5449db0a4c6e30 | [
"MIT"
] | 6 | 2015-11-25T08:55:51.000Z | 2021-03-07T15:02:36.000Z | #include "linear/log.h"
#include "linear/tcp_socket.h"
#include "tcp_socket_impl.h"
using namespace linear::log;
namespace linear {
TCPSocket::TCPSocket() : Socket() {
}
TCPSocket::TCPSocket(const shared_ptr<SocketImpl>& socket) : Socket(socket) {
if (GetType() != Socket::TCP) {
LINEAR_LOG(LOG_ERR, "invalid ... | 20.407407 | 88 | 0.68784 | linear-rpc |
afa910c847aabc2b19eb012a9d9f1c7d45027852 | 1,440 | cpp | C++ | STRING/stringfunctions(string functions tried).cpp | shauryauppal/Algo-DS-StudyMaterial | 1c481f066d21b33ec2533156e75f45fa9b6a7606 | [
"Apache-2.0"
] | 3 | 2020-12-03T14:52:23.000Z | 2021-12-19T09:26:50.000Z | STRING/stringfunctions(string functions tried).cpp | shauryauppal/Algo-DS-StudyMaterial | 1c481f066d21b33ec2533156e75f45fa9b6a7606 | [
"Apache-2.0"
] | null | null | null | STRING/stringfunctions(string functions tried).cpp | shauryauppal/Algo-DS-StudyMaterial | 1c481f066d21b33ec2533156e75f45fa9b6a7606 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
using namespace std;
int main()
{
char a[10000],b[10000];
cout<<"ENTER STRING 1st(A) THEN ENTER STRING 2nd (B)=>\n";
gets(a);
gets(b);
char c[10000];
int l1=strlen(a),l2=strlen(b);
cout<<"\n\nLength of st... | 40 | 159 | 0.651389 | shauryauppal |
afac29a92106c38d23bbbccbeff44fd3ddaa0329 | 349 | cpp | C++ | 3D_Engine/ResourceUI.cpp | Normanbg/3dEngine | 8a2484c151a16786e6f72be287cb94d2915707ec | [
"MIT"
] | 3 | 2018-11-17T20:21:26.000Z | 2019-03-19T15:08:19.000Z | 3D_Engine/ResourceUI.cpp | Normanbg/3dEngine | 8a2484c151a16786e6f72be287cb94d2915707ec | [
"MIT"
] | null | null | null | 3D_Engine/ResourceUI.cpp | Normanbg/3dEngine | 8a2484c151a16786e6f72be287cb94d2915707ec | [
"MIT"
] | 1 | 2018-09-14T14:53:37.000Z | 2018-09-14T14:53:37.000Z | #include "ResourceUI.h"
#include "mmgr/mmgr.h"
ResourceUI::ResourceUI(uuid UUID) : ResourceTexture(UUID)
{
type = UI;
}
ResourceUI::~ResourceUI()
{
}
void ResourceUI::Save(Config & config) const
{
}
void ResourceUI::Load(const Config & config)
{
if (exportedFile.size() == 0) {
exportedFile = LIB_UI_PATH + ... | 12.464286 | 58 | 0.679083 | Normanbg |
afac9f503047e91775c2515fa64da671c5b0885e | 884 | cpp | C++ | Minecraft/src/Frustum.cpp | Aether2606/MinecraftWeek | 9fce8567b18fae38b97313ecb2243ea88b11b154 | [
"MIT"
] | 2 | 2021-02-26T23:11:16.000Z | 2021-05-22T17:33:31.000Z | Minecraft/src/Frustum.cpp | Aether2606/MinecraftWeek | 9fce8567b18fae38b97313ecb2243ea88b11b154 | [
"MIT"
] | 1 | 2021-05-22T07:16:11.000Z | 2021-05-22T17:33:56.000Z | Minecraft/src/Frustum.cpp | Aether2606/MinecraftWeek | 9fce8567b18fae38b97313ecb2243ea88b11b154 | [
"MIT"
] | null | null | null | #include "Frustum.h"
glm::vec4* Frustum::s_Planes = new glm::vec4[6];
bool Frustum::PlaneIntersection(const glm::mat4& pv, const glm::vec3& position, const float skin)
{
for (int i = 0; i < 6; i++)
{
auto p = glm::normalize(s_Planes[i]);
glm::vec3 normal = glm::vec3(p.x, p.y, p.z);
float distance = p.w;
if ... | 32.740741 | 97 | 0.567873 | Aether2606 |
afae422b88fd5d2b331ec322672b9207986e28d6 | 661 | cpp | C++ | dash/examples/ex.02.array/main.cpp | RuhanDev/dash | c56193149c334e552df6f8439c3fb1510048b7f1 | [
"BSD-3-Clause"
] | 1 | 2019-05-19T20:31:20.000Z | 2019-05-19T20:31:20.000Z | dash/examples/ex.02.array/main.cpp | RuhanDev/dash | c56193149c334e552df6f8439c3fb1510048b7f1 | [
"BSD-3-Clause"
] | null | null | null | dash/examples/ex.02.array/main.cpp | RuhanDev/dash | c56193149c334e552df6f8439c3fb1510048b7f1 | [
"BSD-3-Clause"
] | 2 | 2019-10-02T23:19:22.000Z | 2020-06-27T09:23:31.000Z | /**
* \example ex.02.array/main.cpp
* Example illustrating access to elements in a \c dash::Array by
* global index.
*/
#include <unistd.h>
#include <iostream>
#include <cstddef>
#include <libdash.h>
using std::cout;
using std::endl;
int main(int argc, char* argv[])
{
dash::init(&argc, &argv);
auto myid = ... | 16.525 | 65 | 0.552194 | RuhanDev |
afb1af9259f44c565ae84e43093099bbb81e2eb8 | 1,700 | cpp | C++ | DeepSpace/src/main/cpp/commands/GotoTarget.cpp | NorthernForce/DeepSpace | b8446f0fb732e7df030970332574e13d94e79df9 | [
"MIT"
] | 3 | 2019-01-08T00:09:56.000Z | 2020-03-12T03:05:20.000Z | DeepSpace/src/main/cpp/commands/GotoTarget.cpp | NorthernForce/DeepSpace | b8446f0fb732e7df030970332574e13d94e79df9 | [
"MIT"
] | 12 | 2019-01-17T00:33:54.000Z | 2019-06-27T01:56:18.000Z | DeepSpace/src/main/cpp/commands/GotoTarget.cpp | NorthernForce/DeepSpace | b8446f0fb732e7df030970332574e13d94e79df9 | [
"MIT"
] | null | null | null | /*----------------------------------------------------------------------------*/
/* Copyright (c) 2017-2018 FIRST. All Rights Reserved. */
/* Open Source Software - may be modified and shared by FRC teams. The code */
/* must be accompanied by the FIRST BSD license file in the root directory of... | 33.333333 | 80 | 0.61 | NorthernForce |
afb62116c2aded701d4d48cf15e1abc60e6468bd | 5,224 | cpp | C++ | src/testing/unit/test-grid.cpp | freedomcondor/argos3-harry | 10cc040af3d5339538cfd801f0317fa8269429a5 | [
"MIT"
] | 1 | 2021-01-15T21:58:34.000Z | 2021-01-15T21:58:34.000Z | src/testing/unit/test-grid.cpp | freedomcondor/argos3-harry | 10cc040af3d5339538cfd801f0317fa8269429a5 | [
"MIT"
] | 1 | 2021-02-28T23:45:32.000Z | 2021-02-28T23:45:32.000Z | src/testing/unit/test-grid.cpp | freedomcondor/argos3-harry | 10cc040af3d5339538cfd801f0317fa8269429a5 | [
"MIT"
] | 7 | 2021-02-26T16:41:06.000Z | 2022-01-19T21:36:31.000Z | #include <argos3/core/utility/logging/argos_log.h>
#include <argos3/core/simulator/space/positional_indices/grid.h>
#include <argos3/plugins/simulator/entities/led_entity.h>
using namespace argos;
/****************************************/
/****************************************/
const size_t NUM_LEDS = 10;
/****... | 32.447205 | 119 | 0.434916 | freedomcondor |
afbf299c7b6f02eeb0e37c5a2021d94959705012 | 506 | cpp | C++ | cpp-projects/tous-les-prenoms-app/utility/time.cpp | FlorianLance/TousLesPrenoms | 57e2b6b39efac924e10066f97f9a718bd069f9d6 | [
"MIT"
] | null | null | null | cpp-projects/tous-les-prenoms-app/utility/time.cpp | FlorianLance/TousLesPrenoms | 57e2b6b39efac924e10066f97f9a718bd069f9d6 | [
"MIT"
] | null | null | null | cpp-projects/tous-les-prenoms-app/utility/time.cpp | FlorianLance/TousLesPrenoms | 57e2b6b39efac924e10066f97f9a718bd069f9d6 | [
"MIT"
] | null | null | null |
#include "time.hpp"
// Qt
#include <QTime>
#include <QCoreApplication>
using namespace tool;
void Time::wait_process(int ms){
QTime dieTime= QTime::currentTime().addMSecs(ms);
while (QTime::currentTime() < dieTime){
QCoreApplication::processEvents( QEventLoop::AllEvents, 5 > ms ? ms : 5);
}
}
s... | 25.3 | 126 | 0.70751 | FlorianLance |
afc11364cf202d3d98512d8a4d96aa28caa41f40 | 1,058 | cpp | C++ | Nodes/Source.cpp | karyfoundation/sitron | 88b81bf7a2d0153644218e3220263aa1cb88cc81 | [
"Unlicense"
] | 1 | 2016-07-23T16:20:50.000Z | 2016-07-23T16:20:50.000Z | Nodes/Source.cpp | karyfoundation/sitron | 88b81bf7a2d0153644218e3220263aa1cb88cc81 | [
"Unlicense"
] | 1 | 2016-10-14T13:49:00.000Z | 2016-10-14T13:49:00.000Z | Nodes/Source.cpp | karyfoundation/sitron | 88b81bf7a2d0153644218e3220263aa1cb88cc81 | [
"Unlicense"
] | null | null | null | /*
* Source.cpp
*
* Created on: Nov 29, 2015
* Author: sina
*/
#include "Base.h"
#include "Identifier.h"
#include "Source.h"
extern int yyerror(const char* msg);
extern int yywarning(const char* msg);
void sourceStrCorrector(std::string* str)
{
std::string::iterator it;
it = str->begin();
... | 20.745098 | 74 | 0.547259 | karyfoundation |
afc6953bba4852f5d1664e78a2d6e3a0d6eaefa5 | 1,970 | cpp | C++ | dev/plugins/glFuncs/glDrawPoints.cpp | gnilk/yapt | 1f1d7bad26fb477b545927774f323c367c0e1dad | [
"BSD-3-Clause"
] | null | null | null | dev/plugins/glFuncs/glDrawPoints.cpp | gnilk/yapt | 1f1d7bad26fb477b545927774f323c367c0e1dad | [
"BSD-3-Clause"
] | null | null | null | dev/plugins/glFuncs/glDrawPoints.cpp | gnilk/yapt | 1f1d7bad26fb477b545927774f323c367c0e1dad | [
"BSD-3-Clause"
] | null | null | null | #include "glShaderBase.h"
#include "glDrawPoints.h"
#include "yapt/ySystem.h"
#include "yapt/logger.h"
#include <math.h>
#ifdef WIN32
#define WIN32_LEAN_AND_MEAN
#include <Windows.h>
#include <gl/glew.h>
#include <gl/GL.h>
#include <gl/GLU.h>
#else
#include <OpenGl/glu.h>
#endif
using namespace yapt;
#ifndef M_PI... | 23.176471 | 88 | 0.711675 | gnilk |
afc9bbb865a8d6d9e3aa2fc5a7e9fcca1b83e33c | 15,630 | hh | C++ | include/click/list.hh | MacWR/Click-changed-for-ParaGraph | 18285e5da578fbb7285d10380836146e738dee6e | [
"Apache-2.0"
] | 129 | 2015-10-08T14:38:35.000Z | 2022-03-06T14:54:44.000Z | include/click/list.hh | MacWR/Click-changed-for-ParaGraph | 18285e5da578fbb7285d10380836146e738dee6e | [
"Apache-2.0"
] | 241 | 2016-02-17T16:17:58.000Z | 2022-03-15T09:08:33.000Z | include/click/list.hh | MacWR/Click-changed-for-ParaGraph | 18285e5da578fbb7285d10380836146e738dee6e | [
"Apache-2.0"
] | 61 | 2015-12-17T01:46:58.000Z | 2022-02-07T22:25:19.000Z | #ifndef CLICK_LIST_HH
#define CLICK_LIST_HH 1
/*
* list.hh -- List template
* Eddie Kohler
*
* Copyright (c) 2008 Meraki, Inc.
*
* 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... | 27.663717 | 80 | 0.613692 | MacWR |
afccc51de959365cf7da07227148b6648e070828 | 478 | cpp | C++ | ICPC/Test/scc_test.cpp | zaki-joho/ProconLibrary | 3a11e506c43522801f878dda2f9845ae83612a4d | [
"MIT"
] | 2 | 2019-05-22T11:49:58.000Z | 2019-10-05T19:13:42.000Z | ICPC/Test/scc_test.cpp | zaki-joho/ProconLibrary | 3a11e506c43522801f878dda2f9845ae83612a4d | [
"MIT"
] | 25 | 2019-10-15T09:22:21.000Z | 2019-11-20T05:29:09.000Z | ICPC/Test/scc_test.cpp | zaki-joho/ProconLibrary | 3a11e506c43522801f878dda2f9845ae83612a4d | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
#include"../Graph/scc.hpp"
int main(){
int V,E;
cin>>V>>E;
Graph g(V);
for(int i=0;i<E;i++){
int s,t;
cin>>s>>t;
g[s].push_back(Edge(s,t,0));
}
vector<int> cmp;
int k=scc(g,cmp);
assert(k==(*max_element(cmp.begin(),cm... | 18.384615 | 55 | 0.464435 | zaki-joho |
afd27784adaf0d3c24b97ff779acdb313040e2e0 | 4,072 | cpp | C++ | libs/vm-modules/src/math/tensor/tensor_estimator.cpp | marcuswin/ledger | b79c5c4e7e92ff02ea4328fcc0885bf8ded2b8b2 | [
"Apache-2.0"
] | 1 | 2019-09-11T09:46:04.000Z | 2019-09-11T09:46:04.000Z | libs/vm-modules/src/math/tensor/tensor_estimator.cpp | marcuswin/ledger | b79c5c4e7e92ff02ea4328fcc0885bf8ded2b8b2 | [
"Apache-2.0"
] | null | null | null | libs/vm-modules/src/math/tensor/tensor_estimator.cpp | marcuswin/ledger | b79c5c4e7e92ff02ea4328fcc0885bf8ded2b8b2 | [
"Apache-2.0"
] | 1 | 2019-09-19T12:38:46.000Z | 2019-09-19T12:38:46.000Z | //------------------------------------------------------------------------------
//
// Copyright 2018-2019 Fetch.AI Limited
//
// 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
//
// ... | 25.45 | 97 | 0.685167 | marcuswin |
afd376e43e41976cc09b7e267f2cdc7df22a4b44 | 1,269 | cpp | C++ | number-of-ways-to-arrive-at-destination/number-of-ways-to-arrive-at-destination.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | 2 | 2022-01-02T19:15:00.000Z | 2022-01-05T21:12:24.000Z | number-of-ways-to-arrive-at-destination/number-of-ways-to-arrive-at-destination.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | null | null | null | number-of-ways-to-arrive-at-destination/number-of-ways-to-arrive-at-destination.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | 1 | 2022-03-11T17:11:07.000Z | 2022-03-11T17:11:07.000Z | class Solution {
public:
typedef long long ll;
typedef pair<long long, long long> ppl;
int countPaths(int n, vector<vector<int>>& roads) {
int mod = (1e9+7);
vector<ll> dist(n,LLONG_MAX);
vector<int> ways(n,0);
priority_queue<ppl, vector<ppl>, greater<ppl>> pq;
d... | 30.214286 | 67 | 0.446809 | Ananyaas |
afd5d82cc8512cdf30e2e19b5da799ef83fbbe18 | 255 | cpp | C++ | STL 2/FindTheUniqueElement.cpp | mhimanshu712/CppPad | 7b3fdbd32573da11b4544d2c2bb8b1adbc145b76 | [
"MIT"
] | 3 | 2020-07-05T06:43:59.000Z | 2020-10-25T06:51:11.000Z | STL 2/FindTheUniqueElement.cpp | mhimanshu712/CppPad | 7b3fdbd32573da11b4544d2c2bb8b1adbc145b76 | [
"MIT"
] | null | null | null | STL 2/FindTheUniqueElement.cpp | mhimanshu712/CppPad | 7b3fdbd32573da11b4544d2c2bb8b1adbc145b76 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int FindUnique(int arr[], int size){
unordered_map <int,int> m;
for(int i=0;i<size;i++)
m[arr[i]]++;
for(int i=0;i<size;i++){
if(m[arr[i]]==1)
return arr[i];
}
} | 18.214286 | 36 | 0.509804 | mhimanshu712 |
afd8a7ba9c93987cf9b86ea938ffa0f25e3699a9 | 8,070 | cpp | C++ | src/campaign/camplib/name.cpp | Terebinth/freefalcon-central | c28d807183ab447ef6a801068aa3769527d55deb | [
"BSD-2-Clause"
] | 117 | 2015-01-13T14:48:49.000Z | 2022-03-16T01:38:19.000Z | src/campaign/camplib/name.cpp | darongE/freefalcon-central | c28d807183ab447ef6a801068aa3769527d55deb | [
"BSD-2-Clause"
] | 4 | 2015-05-01T13:09:53.000Z | 2017-07-22T09:11:06.000Z | src/campaign/camplib/name.cpp | darongE/freefalcon-central | c28d807183ab447ef6a801068aa3769527d55deb | [
"BSD-2-Clause"
] | 78 | 2015-01-13T09:27:47.000Z | 2022-03-18T14:39:09.000Z | // ***************************************************************************
// ObjName.cpp
//
// Stuff used to deal with naming
// ***************************************************************************
#include <stdio.h>
#include <conio.h>
#include <stddef.h>
#include <fcntl.h>
#include <io.h>
#include <stdlib... | 20.482234 | 95 | 0.566667 | Terebinth |
afde2c9d3d0243fa1e4edd6a2df133b70175a4f8 | 8,613 | cpp | C++ | docs/melb-cpp-talk-feb-2017/82-extra-type-erasure.cpp | RossBencina/StaticMode | 04eead233a6a03aa4f47c22f81c1d89b4e5cf5ca | [
"MIT"
] | 3 | 2017-02-15T22:49:40.000Z | 2018-04-19T15:42:57.000Z | docs/melb-cpp-talk-feb-2017/82-extra-type-erasure.cpp | RossBencina/StaticMode | 04eead233a6a03aa4f47c22f81c1d89b4e5cf5ca | [
"MIT"
] | 14 | 2017-02-19T14:25:30.000Z | 2017-02-20T10:11:42.000Z | docs/melb-cpp-talk-feb-2017/82-extra-type-erasure.cpp | RossBencina/StaticMode | 04eead233a6a03aa4f47c22f81c1d89b4e5cf5ca | [
"MIT"
] | null | null | null | //!clang++ -std=c++11 -Weverything -Wno-c++98-compat -Wno-unused-const-variable 82-extra-type-erasure.cpp -o z82.out && ./z82.out
// Define an abstract Painter base class (interface)
// Provide an implementation of Painter: AsciiPainterT<> that is a template,
// parameterised by a mode expression. Instantiate templat... | 35.8875 | 129 | 0.67282 | RossBencina |
afdfab721a2db5c4fcf8e794b3789e3e0da735d3 | 8,543 | cpp | C++ | NGS/sample-src/DTools/DTools.cpp | NGS-lib/NGSplusplus | 7fa9fff2453917f24e9e35dab1f04a9be67f7f13 | [
"BSL-1.0"
] | 3 | 2015-11-23T14:24:06.000Z | 2017-11-21T21:04:06.000Z | NGS/sample-src/DTools/DTools.cpp | NGS-lib/NGSplusplus | 7fa9fff2453917f24e9e35dab1f04a9be67f7f13 | [
"BSL-1.0"
] | null | null | null | NGS/sample-src/DTools/DTools.cpp | NGS-lib/NGSplusplus | 7fa9fff2453917f24e9e35dab1f04a9be67f7f13 | [
"BSL-1.0"
] | null | null | null | #include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <cmath>
#include <functional>
#include "NGS++.h"
using namespace std;
using namespace NGS;
/** \brief This program load a sam file then outputs density information, either in wig format or in "BIN" format.
It uses NGS++ mo... | 30.952899 | 160 | 0.593937 | NGS-lib |
afe10ba40d39dbf8efe1fea95255c7122cbc52b1 | 6,263 | cpp | C++ | source/modules/problem/hierarchical/hierarchical.cpp | JonathanLehner/korali | 90f97d8e2fed2311f988f39cfe014f23ba7dd6cf | [
"MIT"
] | 43 | 2018-07-26T07:20:42.000Z | 2022-03-02T10:23:12.000Z | source/modules/problem/hierarchical/hierarchical.cpp | JonathanLehner/korali | 90f97d8e2fed2311f988f39cfe014f23ba7dd6cf | [
"MIT"
] | 212 | 2018-09-21T10:44:07.000Z | 2022-03-22T14:33:05.000Z | source/modules/problem/hierarchical/hierarchical.cpp | JonathanLehner/korali | 90f97d8e2fed2311f988f39cfe014f23ba7dd6cf | [
"MIT"
] | 16 | 2018-07-25T15:00:36.000Z | 2022-03-22T14:19:46.000Z | #include "modules/problem/hierarchical/hierarchical.hpp"
#include "sample/sample.hpp"
namespace korali
{
namespace problem
{
;
void Hierarchical::initialize()
{
for (size_t i = 0; i < _k->_variables.size(); i++)
{
bool foundDistribution = false;
for (size_t j = 0; j < _k->_distributions.size(); j++)
... | 32.283505 | 186 | 0.689286 | JonathanLehner |
afe46ce7058f71ecc33e7bd79826da8271eb72e9 | 3,136 | cpp | C++ | src/plugins/aggregator/feed.cpp | MellonQ/leechcraft | 71cbb238d2dade56b3865278a6a8e6a58c217fc5 | [
"BSL-1.0"
] | 1 | 2017-01-12T07:05:45.000Z | 2017-01-12T07:05:45.000Z | src/plugins/aggregator/feed.cpp | MellonQ/leechcraft | 71cbb238d2dade56b3865278a6a8e6a58c217fc5 | [
"BSL-1.0"
] | null | null | null | src/plugins/aggregator/feed.cpp | MellonQ/leechcraft | 71cbb238d2dade56b3865278a6a8e6a58c217fc5 | [
"BSL-1.0"
] | null | null | null | /**********************************************************************
* LeechCraft - modular cross-platform feature rich internet client.
* Copyright (C) 2006-2014 Georg Rudoy
*
* Boost Software License - Version 1.0 - August 17th, 2003
*
* Permission is hereby granted, free of charge, to any person or organiz... | 30.446602 | 78 | 0.675702 | MellonQ |
afea1e46cfa34a0295e88948a1712f1aa775577d | 6,222 | cpp | C++ | Axis.Orange/services/management/EssentialsPluginLoader.cpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | 2 | 2021-07-23T08:49:54.000Z | 2021-07-29T22:07:30.000Z | Axis.Orange/services/management/EssentialsPluginLoader.cpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | null | null | null | Axis.Orange/services/management/EssentialsPluginLoader.cpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | null | null | null | #include "EssentialsPluginLoader.hpp"
#include "services/management/ServiceLocator.hpp"
#include "application/factories/boundary_conditions/LockConstraintFactory.hpp"
#include "application/factories/boundary_conditions/NodalVelocityConstraintFactory.hpp"
#include "application/factories/boundary_conditions/PrescribedDis... | 40.402597 | 99 | 0.765509 | renato-yuzup |
affef21c14d2e3d7b2991f61251cdd07def2b3c7 | 3,093 | hpp | C++ | Source/Helios/Debugging/Debugging.hpp | Makogan/Nyx-Helios | c70eae4010896ab5dc16bba4472d5a8dd7a66c51 | [
"MIT"
] | null | null | null | Source/Helios/Debugging/Debugging.hpp | Makogan/Nyx-Helios | c70eae4010896ab5dc16bba4472d5a8dd7a66c51 | [
"MIT"
] | null | null | null | Source/Helios/Debugging/Debugging.hpp | Makogan/Nyx-Helios | c70eae4010896ab5dc16bba4472d5a8dd7a66c51 | [
"MIT"
] | 1 | 2018-05-04T16:01:18.000Z | 2018-05-04T16:01:18.000Z | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
/** *
* @brief A set of functions to generate OpenGL debugging messages
*
* @file Debugging.hpp
* @author Camilo Talero
* @date 2018-04-19
... | 46.164179 | 91 | 0.405755 | Makogan |
9b80c8909966f9890bc27377a8d3cf1d52cdcd19 | 587 | cpp | C++ | Watermelon.cpp | muhtasim-neon/CodeForces_Problem_Solution | e64794187d423b1eb27dcc754cc3e3b87fed7ae5 | [
"CC0-1.0"
] | null | null | null | Watermelon.cpp | muhtasim-neon/CodeForces_Problem_Solution | e64794187d423b1eb27dcc754cc3e3b87fed7ae5 | [
"CC0-1.0"
] | null | null | null | Watermelon.cpp | muhtasim-neon/CodeForces_Problem_Solution | e64794187d423b1eb27dcc754cc3e3b87fed7ae5 | [
"CC0-1.0"
] | null | null | null | ███ ██ ███████ ██████ ███ ██
████ ██ ██ ██ ██ ████ ██
██ ██ ██ █████ ██ ██ ██ ██ ██
██ ██ ██ ██ ██ ██ ██ ██ ██
██ ████ ███... | 30.894737 | 68 | 0.144804 | muhtasim-neon |
9b87cc319f8f3156d3c3717bdb29e3f7de528ca1 | 1,135 | hpp | C++ | libraries/state_db/include/koinos/state_db/backends/map/map_backend.hpp | joticajulian/koinos-chain | b5db60b427ebb97dabf1acf8108e94bbc75a46d4 | [
"MIT"
] | 9 | 2021-04-27T19:48:25.000Z | 2022-03-04T16:27:13.000Z | libraries/state_db/include/koinos/state_db/backends/map/map_backend.hpp | joticajulian/koinos-chain | b5db60b427ebb97dabf1acf8108e94bbc75a46d4 | [
"MIT"
] | 162 | 2021-04-27T07:04:17.000Z | 2022-03-30T20:27:56.000Z | libraries/state_db/include/koinos/state_db/backends/map/map_backend.hpp | joticajulian/koinos-chain | b5db60b427ebb97dabf1acf8108e94bbc75a46d4 | [
"MIT"
] | 5 | 2021-04-27T19:48:33.000Z | 2022-02-22T23:06:56.000Z | #pragma once
#include <koinos/state_db/backends/backend.hpp>
#include <koinos/state_db/backends/map/map_iterator.hpp>
namespace koinos::state_db::backends::map {
class map_backend final : public abstract_backend {
public:
using key_type = abstract_backend::key_type;
using value_type = abstract_backe... | 29.868421 | 74 | 0.696035 | joticajulian |
9b8b3041f777920479e110bd6f5aec6c0ec6ce5a | 9,003 | cpp | C++ | taurob_laser_scanner_mount/src/laser_scanner_mount.cpp | taurob/taurobtrackerapi | e0f73f46bc017508ab4417be920427c2b6565809 | [
"Unlicense"
] | 5 | 2016-09-13T16:05:02.000Z | 2021-02-10T14:10:55.000Z | taurob_laser_scanner_mount/src/laser_scanner_mount.cpp | SimonSchwaiger/taurobtrackerapi | e0f73f46bc017508ab4417be920427c2b6565809 | [
"Unlicense"
] | 2 | 2017-02-24T17:23:30.000Z | 2019-08-27T14:59:08.000Z | taurob_laser_scanner_mount/src/laser_scanner_mount.cpp | SimonSchwaiger/taurobtrackerapi | e0f73f46bc017508ab4417be920427c2b6565809 | [
"Unlicense"
] | 7 | 2017-02-24T13:06:49.000Z | 2021-12-20T10:07:27.000Z | #include <ros/ros.h>
#include <sensor_msgs/JointState.h>
#include <std_msgs/Float64.h>
#include <std_msgs/Bool.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <stdio.h>
#include <fcntl.h>
#include <string.h>
#include <time.h>
#include <boost/date_time/posix_time/posix_time.hpp>
#incl... | 31.812721 | 131 | 0.738976 | taurob |
9b8be3d226d237eb51384f22a76471a08a30841f | 6,822 | hpp | C++ | SDL2_Engine/Projects/SDL2_Engine/src/Scenes/SceneManager.hpp | MitchCroft/SDL2_Engine | 8f4bbb7ad914649de47cdeb19bd9956e0b9a8c5f | [
"MIT"
] | null | null | null | SDL2_Engine/Projects/SDL2_Engine/src/Scenes/SceneManager.hpp | MitchCroft/SDL2_Engine | 8f4bbb7ad914649de47cdeb19bd9956e0b9a8c5f | [
"MIT"
] | null | null | null | SDL2_Engine/Projects/SDL2_Engine/src/Scenes/SceneManager.hpp | MitchCroft/SDL2_Engine | 8f4bbb7ad914649de47cdeb19bd9956e0b9a8c5f | [
"MIT"
] | 1 | 2022-03-27T04:53:25.000Z | 2022-03-27T04:53:25.000Z | #pragma once
//! Include the SDL2_Engine objects
#include "../__LibraryManagement.hpp"
#include "../Utilities/IGlobal.hpp"
#include "../Utilities/TypeID.hpp"
namespace SDL2_Engine {
//! Prototype the Scene Manager Initialiser object
namespace Initialisation { struct SceneManagerInitialiser; }
namespace Scenes {
... | 33.940299 | 152 | 0.610085 | MitchCroft |
9b9424d65c2b323011c2bf16771372b4fe3497a3 | 6,354 | cpp | C++ | DiscoveringModernCpp/c++17/fsize_unroll_test.cpp | SebastianTirado/Cpp-Learning-Archive | fb83379d0cc3f9b2390cef00119464ec946753f4 | [
"MIT"
] | 19 | 2019-09-15T12:23:51.000Z | 2020-06-18T08:31:26.000Z | DiscoveringModernCpp/c++17/fsize_unroll_test.cpp | SebastianTirado/Cpp-Learning-Archive | fb83379d0cc3f9b2390cef00119464ec946753f4 | [
"MIT"
] | 15 | 2021-12-07T06:46:03.000Z | 2022-01-31T07:55:32.000Z | DiscoveringModernCpp/c++17/fsize_unroll_test.cpp | SebastianTirado/Cpp-Learning-Archive | fb83379d0cc3f9b2390cef00119464ec946753f4 | [
"MIT"
] | 13 | 2019-06-29T02:58:27.000Z | 2020-05-07T08:52:22.000Z | #include <cassert>
#include <iostream>
#include <cmath>
#if 0
template <typename Target, typename Source, int N>
struct fsize_assign
{
static void eval(Target& tar, const Source& src)
{
if constexpr (N > 0)
fsize_assign<Target, Source, N-1>::eval(tar, src);
std::cout << "assign entry " << ... | 25.518072 | 109 | 0.528014 | SebastianTirado |
9b95eaa842a0498298a711b4171a1248ba00ab3e | 788 | cpp | C++ | dataStructure/MGraph/src/MyQueue.cpp | Duan-You/C-C- | c64e477889178efdb9b4e32a0f20cd76d39e937c | [
"Apache-2.0"
] | null | null | null | dataStructure/MGraph/src/MyQueue.cpp | Duan-You/C-C- | c64e477889178efdb9b4e32a0f20cd76d39e937c | [
"Apache-2.0"
] | null | null | null | dataStructure/MGraph/src/MyQueue.cpp | Duan-You/C-C- | c64e477889178efdb9b4e32a0f20cd76d39e937c | [
"Apache-2.0"
] | null | null | null | #include "myQueue.h"
void InitQueue(SqQueue &Q)
{
Q.base=(QElemType*)malloc(MAXSIZE*sizeof(QElemType));
if(!Q.base)
exit(0);
Q.rear=0;
Q.front=Q.rear;
}
bool QueueEmpty(SqQueue Q)
{
if(Q.front==Q.rear)
return true;
return false;
}
int QueueLength(SqQueue Q)
{
return (Q.rea... | 16.416667 | 57 | 0.601523 | Duan-You |
9b9a6117d24bb026c4ba592e6236e7c475bddb23 | 1,063 | cpp | C++ | BaseObjects/Msg.cpp | WhiteGroup/JAV-AV-Engine | c258c1bb283d2cccc358dab5d3a7bacd4fc35790 | [
"MIT"
] | 15 | 2016-11-03T20:39:13.000Z | 2022-01-17T16:00:21.000Z | BaseObjects/Msg.cpp | ZhuHuiBeiShaDiao/JAV-AV-Engine | c258c1bb283d2cccc358dab5d3a7bacd4fc35790 | [
"MIT"
] | null | null | null | BaseObjects/Msg.cpp | ZhuHuiBeiShaDiao/JAV-AV-Engine | c258c1bb283d2cccc358dab5d3a7bacd4fc35790 | [
"MIT"
] | 16 | 2016-11-04T11:40:39.000Z | 2022-02-25T07:25:52.000Z | #include "Msg.h"
TCHAR MessageString[1024] ;
TCHAR *MSC(UINT32 MessageId)
{
if ( FormatMessage(FORMAT_MESSAGE_FROM_HMODULE , NULL , MessageId , MAKELANGID(LANG_FARSI ,SUBLANG_DEFAULT) ,
MessageString ,sizeof (MessageString) , NULL ) == 0 )
{
PutLog(FORMATMESSAGE_ERROR);
MessageString[0] = NULL ;
}
return... | 27.25641 | 110 | 0.712135 | WhiteGroup |
9ba1f251e2fa9a577c49ca84ea9cfc550116cfbf | 79 | cpp | C++ | FindRoadDisplay/findroadcontroller.cpp | 100Ohm/Data-structure-Graph-Qt-Navigation-System | 2b771e5913fbb73fc33e465a5e7526328c914fe9 | [
"Apache-2.0"
] | 6 | 2018-11-20T03:46:26.000Z | 2020-07-04T15:33:24.000Z | FindRoadDisplay/findroadcontroller.cpp | liziwenzzzz/Data-structure-Graph-Qt-Navigation-System | 2b771e5913fbb73fc33e465a5e7526328c914fe9 | [
"Apache-2.0"
] | null | null | null | FindRoadDisplay/findroadcontroller.cpp | liziwenzzzz/Data-structure-Graph-Qt-Navigation-System | 2b771e5913fbb73fc33e465a5e7526328c914fe9 | [
"Apache-2.0"
] | 1 | 2018-11-20T03:50:28.000Z | 2018-11-20T03:50:28.000Z | #include "findroadcontroller.h"
FindRoadController::FindRoadController()
{
}
| 11.285714 | 40 | 0.78481 | 100Ohm |
9ba48cf0c509e311c8855e258f8906b1cfeae311 | 1,085 | cpp | C++ | luogu/codes/P2678.cpp | Tony031218/OI | 562f5f45d0448f4eab77643b99b825405a123d92 | [
"MIT"
] | 1 | 2021-02-22T03:39:24.000Z | 2021-02-22T03:39:24.000Z | luogu/codes/P2678.cpp | Tony031218/OI | 562f5f45d0448f4eab77643b99b825405a123d92 | [
"MIT"
] | null | null | null | luogu/codes/P2678.cpp | Tony031218/OI | 562f5f45d0448f4eab77643b99b825405a123d92 | [
"MIT"
] | null | null | null | /*************************************************************
* > File Name : P2678.cpp
* > Author : Tony
* > Created Time : 2019/05/26 15:38:14
* > Algorithm : 二分答案
**************************************************************/
#include <bits/stdc++.h>
using namespace std;
inlin... | 25.232558 | 65 | 0.4 | Tony031218 |
9babd48c3e9b706962812e70cb01a6388cc3477f | 3,053 | hpp | C++ | CodeRed/Core/CodeRedGraphics.hpp | LinkClinton/Code-Red | 491621144aba559f068c7f91d71e3d0d7c87761e | [
"MIT"
] | 34 | 2019-09-11T09:12:16.000Z | 2022-02-13T12:50:25.000Z | CodeRed/Core/CodeRedGraphics.hpp | LinkClinton/Code-Red | 491621144aba559f068c7f91d71e3d0d7c87761e | [
"MIT"
] | 7 | 2019-09-22T14:21:26.000Z | 2020-03-24T10:36:20.000Z | CodeRed/Core/CodeRedGraphics.hpp | LinkClinton/Code-Red | 491621144aba559f068c7f91d71e3d0d7c87761e | [
"MIT"
] | 6 | 2019-10-21T18:05:55.000Z | 2021-04-22T05:07:30.000Z | #pragma once
#include "../Shared/Enum/PixelFormat.hpp"
#include "../Shared/Enum/AddressMode.hpp"
#include "../Shared/Enum/BlendFactor.hpp"
#include "../Shared/Enum/BlendOperator.hpp"
#include "../Shared/Enum/BorderColor.hpp"
#include "../Shared/Enum/ColorMask.hpp"
#include "../Shared/Enum/CompareOperator.hpp"
#include... | 40.171053 | 66 | 0.767442 | LinkClinton |
9bacd5b8be7fac2e4d022cf5f9b2f81330306282 | 2,212 | cpp | C++ | ViAn/GUI/Analysis/queuewidget.cpp | NFCSKL/NFC-ViAn | ce04b78b4c9695374d71198f57d4236a5cad1525 | [
"MIT"
] | 1 | 2019-12-08T03:53:03.000Z | 2019-12-08T03:53:03.000Z | ViAn/GUI/Analysis/queuewidget.cpp | NFCSKL/NFC-ViAn | ce04b78b4c9695374d71198f57d4236a5cad1525 | [
"MIT"
] | 182 | 2018-02-08T11:03:26.000Z | 2019-06-27T15:27:47.000Z | ViAn/GUI/Analysis/queuewidget.cpp | NFCSKL/NFC-ViAn | ce04b78b4c9695374d71198f57d4236a5cad1525 | [
"MIT"
] | null | null | null | #include "queuewidget.h"
#include "Analysis/analysismethod.h"
#include "analysislistitem.h"
#include <QLabel>
#include <QLayout>
#include <QProgressBar>
#include <QPushButton>
/**
* @brief QueueWidget::QueueWidget
* @param parent
* Setup widget layout
*/
QueueWidget::QueueWidget(QWidget *parent) : QWidget(parent... | 26.023529 | 82 | 0.668626 | NFCSKL |
9bb3473a4f79984d17aaa7a36364094a8beb6ee9 | 10,596 | hh | C++ | Source/Compiler/Contexts.hh | fuzziqersoftware/nemesys | ee6cc8e1fd804b5cfaa94a79e295770cadec8204 | [
"MIT"
] | 9 | 2018-02-05T06:52:02.000Z | 2022-03-27T18:26:14.000Z | Source/Compiler/Contexts.hh | fuzziqersoftware/nemesys | ee6cc8e1fd804b5cfaa94a79e295770cadec8204 | [
"MIT"
] | 1 | 2021-05-17T16:53:12.000Z | 2021-05-31T11:19:28.000Z | Source/Compiler/Contexts.hh | fuzziqersoftware/nemesys | ee6cc8e1fd804b5cfaa94a79e295770cadec8204 | [
"MIT"
] | 3 | 2018-02-06T17:24:34.000Z | 2021-11-16T17:20:28.000Z | #pragma once
#include <atomic>
#include <map>
#include <memory>
#include <set>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <libamd64/CodeBuffer.hh>
#include "../AST/PythonASTNodes.hh"
#include "../AST/SourceFile.hh"
#include "../Types/Strings.hh... | 31.535714 | 94 | 0.750189 | fuzziqersoftware |
9bb6e12a4f35d6122abe68747d441421420d694f | 202 | hpp | C++ | Algorithms/2Sorting/tools.hpp | CainHsu/ProgramStudy-leetcode | 23653e8927902aed64ba13a23a1d6c983b7ea5d5 | [
"Apache-2.0"
] | 1 | 2019-12-08T06:21:57.000Z | 2019-12-08T06:21:57.000Z | Algorithms/2Sorting/tools.hpp | CainHsu/ProgramStudy-leetcode | 23653e8927902aed64ba13a23a1d6c983b7ea5d5 | [
"Apache-2.0"
] | null | null | null | Algorithms/2Sorting/tools.hpp | CainHsu/ProgramStudy-leetcode | 23653e8927902aed64ba13a23a1d6c983b7ea5d5 | [
"Apache-2.0"
] | null | null | null | //
// Created by xuche on 2020/6/10.
//
#ifndef PROGRAMSTUDY_LEETCODE_TOOLS_HPP
#define PROGRAMSTUDY_LEETCODE_TOOLS_HPP
int min(const int& a, const int& b);
#endif //PROGRAMSTUDY_LEETCODE_TOOLS_HPP
| 16.833333 | 40 | 0.777228 | CainHsu |
9bb79effde5c7e2f26c3707c722bd2a524fbee30 | 12,561 | cpp | C++ | code/if2/if2-spa/if2-spa.cpp | dbarrows/epidemic-forecasting | a0865fa20c992dc4159e79bb332500e3ff2357ae | [
"MIT"
] | null | null | null | code/if2/if2-spa/if2-spa.cpp | dbarrows/epidemic-forecasting | a0865fa20c992dc4159e79bb332500e3ff2357ae | [
"MIT"
] | null | null | null | code/if2/if2-spa/if2-spa.cpp | dbarrows/epidemic-forecasting | a0865fa20c992dc4159e79bb332500e3ff2357ae | [
"MIT"
] | null | null | null | /* Dexter Barrows
dbarrows.github.io
McMaster University
2016
*/
#include <stdio.h>
#include <math.h>
#include <sys/time.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <cmath>
#include <cstdlib>
#include <fstream>
#define Treal 100 // time to simulate over
#define R0tr... | 27.12959 | 148 | 0.574317 | dbarrows |
9bbc879f0ba4a400182dfc5b04ab88af550427c3 | 3,862 | cpp | C++ | tests/src/normalization/LogNormCounts.cpp | LTLA/libscran | 12faf62c42c388f26db3b03d322c5f430e2c5080 | [
"MIT"
] | 4 | 2021-06-16T10:08:04.000Z | 2022-02-23T14:03:41.000Z | tests/src/normalization/LogNormCounts.cpp | LTLA/libscran | 12faf62c42c388f26db3b03d322c5f430e2c5080 | [
"MIT"
] | 3 | 2021-10-16T23:14:47.000Z | 2021-12-23T07:51:54.000Z | tests/src/normalization/LogNormCounts.cpp | LTLA/libscran | 12faf62c42c388f26db3b03d322c5f430e2c5080 | [
"MIT"
] | null | null | null | #include <gtest/gtest.h>
#include "../data/data.h"
#include "../utils/compare_vectors.h"
#include "tatami/base/DenseMatrix.hpp"
#include "tatami/stats/sums.hpp"
#include "scran/normalization/LogNormCounts.hpp"
#include <cmath>
class LogNormCountsTester : public ::testing::Test {
protected:
void SetUp() {
... | 27.784173 | 130 | 0.592957 | LTLA |
9bc1b06207c35791859ccff392c5d9e5b66a1a92 | 4,298 | cpp | C++ | CPUSoliditySHA3Solver/cpuSolver.cpp | AmberSunshine/BNBTCminer | 0132c6d2f32befaa39b5306848c96eddb06e7186 | [
"Apache-2.0"
] | 6 | 2021-05-31T02:15:29.000Z | 2022-03-09T22:55:43.000Z | CPUSoliditySHA3Solver/cpuSolver.cpp | AmberSunshine/BNBTCminer | 0132c6d2f32befaa39b5306848c96eddb06e7186 | [
"Apache-2.0"
] | null | null | null | CPUSoliditySHA3Solver/cpuSolver.cpp | AmberSunshine/BNBTCminer | 0132c6d2f32befaa39b5306848c96eddb06e7186 | [
"Apache-2.0"
] | 3 | 2021-05-31T02:15:34.000Z | 2021-10-07T21:36:15.000Z | /*
Copyright 2018 Lip Wee Yeo Amano
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in ... | 31.602941 | 120 | 0.728944 | AmberSunshine |
9bc1bdfb650983b74e4d211eab0461c4b4b560be | 1,524 | cpp | C++ | NGIRL.cpp | StavrosChryselis/spoj | b4b721995634cfc7d5a52eb4cb95347f2fdca2b3 | [
"MIT"
] | 2 | 2019-03-02T19:59:54.000Z | 2019-05-26T12:58:06.000Z | NGIRL.cpp | StavrosChryselis/spoj | b4b721995634cfc7d5a52eb4cb95347f2fdca2b3 | [
"MIT"
] | null | null | null | NGIRL.cpp | StavrosChryselis/spoj | b4b721995634cfc7d5a52eb4cb95347f2fdca2b3 | [
"MIT"
] | null | null | null | /*
****************************************************************
****************************************************************
-> Coded by Stavros Chryselis
-> Visit my github for more solved problems over multiple sites
-> https://github.com/StavrosChryselis
-> Feel free to email me at stavrikios@gm... | 17.72093 | 94 | 0.499344 | StavrosChryselis |
9bc20df4bb7488b40dd0c721df76dd91d27306e2 | 4,247 | cpp | C++ | src/Shape/NuiCLMappableData.cpp | hustztz/NatureUserInterfaceStudio | 3cdac6b6ee850c5c8470fa5f1554c7447be0d8af | [
"MIT"
] | 3 | 2016-07-14T13:04:35.000Z | 2017-04-01T09:58:27.000Z | src/Shape/NuiCLMappableData.cpp | hustztz/NatureUserInterfaceStudio | 3cdac6b6ee850c5c8470fa5f1554c7447be0d8af | [
"MIT"
] | null | null | null | src/Shape/NuiCLMappableData.cpp | hustztz/NatureUserInterfaceStudio | 3cdac6b6ee850c5c8470fa5f1554c7447be0d8af | [
"MIT"
] | 1 | 2021-11-21T15:33:35.000Z | 2021-11-21T15:33:35.000Z | #include "NuiCLMappableData.h"
NuiCLMappableData::NuiCLMappableData()
: m_pointIndices("pointIndex")
, m_triangleIndices("triangleIndex")
, m_wireframeIndices("wireframeIndex")
, m_positionStream("position")
, m_colorStream("color")
, m_normalStream("normal")
, m_patchUVStream("UV")
, m_streamDirty(t... | 30.120567 | 115 | 0.76454 | hustztz |
9bc91d1d25cd0573bdbaab34c2b38aac17298e94 | 1,916 | hh | C++ | tests/Waffle/Container/Inflector/InflectorAggregateTest.hh | azjezz/waffle | 3a880ac4e7bd10739bc7134aaf1a531bfb623ba3 | [
"MIT"
] | 5 | 2018-11-27T20:20:13.000Z | 2018-12-28T15:30:35.000Z | tests/Waffle/Container/Inflector/InflectorAggregateTest.hh | azjezz/waffle | 3a880ac4e7bd10739bc7134aaf1a531bfb623ba3 | [
"MIT"
] | 3 | 2018-12-13T19:11:09.000Z | 2018-12-21T01:11:51.000Z | tests/Waffle/Container/Inflector/InflectorAggregateTest.hh | azjezz/waffle | 3a880ac4e7bd10739bc7134aaf1a531bfb623ba3 | [
"MIT"
] | null | null | null | <?hh
namespace Waffle\Tests\Container\Inflector;
use type Waffle\Container\ContainerAwareInterface;
use type Waffle\Container\Container;
use function Facebook\FBExpect\expect;
use type Waffle\Container\Inflector\InflectorAggregate;
use type Waffle\Container\Inflector\Inflector;
use type Facebook\HackTest\HackTest;
us... | 30.412698 | 75 | 0.656054 | azjezz |
9bcb087678867733631c556ba6dae3114b8bbed2 | 4,107 | hpp | C++ | editor.hpp | soleilgames/ruine | 02bed4b38507d4ee99ec38efb93647e6edfa8868 | [
"MIT"
] | 1 | 2017-06-26T08:05:53.000Z | 2017-06-26T08:05:53.000Z | editor.hpp | soleilgames/ruine | 02bed4b38507d4ee99ec38efb93647e6edfa8868 | [
"MIT"
] | null | null | null | editor.hpp | soleilgames/ruine | 02bed4b38507d4ee99ec38efb93647e6edfa8868 | [
"MIT"
] | null | null | null | /*
* Copyright (C) 2017 Florian GOLESTIN
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, p... | 32.338583 | 80 | 0.636961 | soleilgames |
9bd10b362d5ae81df910b156f3d2cde3e89881bd | 722 | cpp | C++ | elastic-circuits/examples/complexdiv.cpp | minseongg/dynamatic | 268d97690f128569da46e4f39a99346e93ee9d4e | [
"MIT"
] | 46 | 2019-11-16T13:44:07.000Z | 2022-03-12T14:28:44.000Z | elastic-circuits/examples/complexdiv.cpp | minseongg/dynamatic | 268d97690f128569da46e4f39a99346e93ee9d4e | [
"MIT"
] | 11 | 2020-05-12T17:20:51.000Z | 2022-02-04T10:04:59.000Z | elastic-circuits/examples/complexdiv.cpp | minseongg/dynamatic | 268d97690f128569da46e4f39a99346e93ee9d4e | [
"MIT"
] | 22 | 2020-02-21T21:33:40.000Z | 2022-02-24T06:50:41.000Z | #include <math.h>
void complexdiv(int a_i[1000], int a_r[1000], int b_i[1000], int b_r[1000], int c_i[1000],
int c_r[1000]) {
int i;
for (i = 0; i < 1000; i++) {
int bi = b_i[i];
int br = b_r[i];
int ai = a_i[i];
int ar = a_r[i];
int cr, ci;
if (... | 26.740741 | 90 | 0.34626 | minseongg |
9bd15d02fc0284290aaf70f9f2e354e4e7562c48 | 12,229 | cpp | C++ | test/implicit_convergence.cpp | owlas/magpy | 45c1332209154ef6be863e4797054a0b642493ec | [
"BSD-3-Clause"
] | 5 | 2017-11-13T21:55:45.000Z | 2020-12-29T10:42:41.000Z | test/implicit_convergence.cpp | owlas/magpy | 45c1332209154ef6be863e4797054a0b642493ec | [
"BSD-3-Clause"
] | 9 | 2017-10-06T09:30:08.000Z | 2018-02-17T17:17:38.000Z | test/implicit_convergence.cpp | owlas/magpy | 45c1332209154ef6be863e4797054a0b642493ec | [
"BSD-3-Clause"
] | 2 | 2017-11-24T16:18:46.000Z | 2020-06-08T11:54:40.000Z | /// Test convergence
/**
* @deprecated
*
*/
#include "../include/integrators.hpp"
#include "../include/rng.hpp"
#include "../include/io.hpp"
#include "../include/llg.hpp"
#include "../include/field.hpp"
#include "../include/constants.hpp"
#include <functional>
#include <vector>
#include <cmath>
#include <iostream>
... | 33.50411 | 109 | 0.51198 | owlas |
9bd345d2b5fd118ead6687be4fe7e4cdfa4225be | 736 | cpp | C++ | CPlusPlusFundamentals/ArrayVectors/Closessed/main.cpp | bozhikovstanislav/Cpp-SoftUni | 6562d15b9e3a550b11566630a1bc1ec65670bff7 | [
"MIT"
] | null | null | null | CPlusPlusFundamentals/ArrayVectors/Closessed/main.cpp | bozhikovstanislav/Cpp-SoftUni | 6562d15b9e3a550b11566630a1bc1ec65670bff7 | [
"MIT"
] | null | null | null | CPlusPlusFundamentals/ArrayVectors/Closessed/main.cpp | bozhikovstanislav/Cpp-SoftUni | 6562d15b9e3a550b11566630a1bc1ec65670bff7 | [
"MIT"
] | null | null | null | //
// Created by stanislav on 29.11.18.
//
#include <iostream>
#include <cmath>
using namespace std;
int GetClosestInt(int numbers[], int value) {
float min_quotient = INT8_MAX;
int index = 0;
for (int j = 0; j < value; ++j) {
for (int i = 0; i < value; ++i) {
int n = numbers[i];
... | 21.028571 | 47 | 0.498641 | bozhikovstanislav |
9be53bc015e78ae3c57a618dfc1af384f761062e | 1,083 | cc | C++ | CH16_TemplatesAndGenericProgramming/exercises/ex16_22_main.cc | iZhangHui/CppPrimer | e61f660c9b0155a2c13d64f104cbd3f641ea00c4 | [
"Unlicense"
] | 34 | 2016-09-23T06:22:35.000Z | 2021-12-09T14:01:14.000Z | CH16_TemplatesAndGenericProgramming/exercises/ex16_22_main.cc | zhangzheng0317/CppPrimer | 322ed3cb120fe0282fe75e147b7d13c2a966519c | [
"Unlicense"
] | null | null | null | CH16_TemplatesAndGenericProgramming/exercises/ex16_22_main.cc | zhangzheng0317/CppPrimer | 322ed3cb120fe0282fe75e147b7d13c2a966519c | [
"Unlicense"
] | 10 | 2018-05-14T01:35:18.000Z | 2021-06-14T02:44:53.000Z | #include <string>
#include <fstream>
#include <iostream>
#include <cstdlib> // for EXIT_FAILURE
#include "TextQuery.h"
using namespace std;
void runQueries(ifstream& infile)
{
// infile is an ifstream that is the file we want to query
TextQuery tq(infile); // store the file and build the query map
// iterate wi... | 27.075 | 70 | 0.677747 | iZhangHui |
9beb0a766ac1ee1ca9df6f3a59ea8f58c0f23c96 | 1,188 | cpp | C++ | libraries/protocol/operations/create_research_license_operation.cpp | DEIPworld/deip-chain | d3fdcfdde179f700156156ea87522a807ec52532 | [
"MIT"
] | 1 | 2021-08-16T12:44:43.000Z | 2021-08-16T12:44:43.000Z | libraries/protocol/operations/create_research_license_operation.cpp | DEIPworld/deip-chain | d3fdcfdde179f700156156ea87522a807ec52532 | [
"MIT"
] | null | null | null | libraries/protocol/operations/create_research_license_operation.cpp | DEIPworld/deip-chain | d3fdcfdde179f700156156ea87522a807ec52532 | [
"MIT"
] | 2 | 2021-08-16T12:44:46.000Z | 2021-12-31T17:09:45.000Z | #include <deip/protocol/deip_operations.hpp>
#include <locale>
#include <fc/log/logger.hpp>
#include <functional>
#include <numeric>
namespace deip {
namespace protocol {
struct license_conditions_validator
{
typedef void result_type;
template <typename T> void operator()(const T& v) const
{
}
vo... | 28.285714 | 127 | 0.718855 | DEIPworld |
9becae42a435ad20f47f57ba4d3d06dab2c90475 | 20,792 | cpp | C++ | reference/mesh.cpp | balazs-bamer/cuda-bezier-triangle-raytracer | 08b9ec1eb17b49f73429d4f7f943896a3c17d50e | [
"MIT"
] | null | null | null | reference/mesh.cpp | balazs-bamer/cuda-bezier-triangle-raytracer | 08b9ec1eb17b49f73429d4f7f943896a3c17d50e | [
"MIT"
] | null | null | null | reference/mesh.cpp | balazs-bamer/cuda-bezier-triangle-raytracer | 08b9ec1eb17b49f73429d4f7f943896a3c17d50e | [
"MIT"
] | null | null | null | #include "mesh.h"
float Mesh::getSmallestSide() const {
float smallestSide = std::numeric_limits<float>::max();
for(auto &triangle : mMesh) {
for(uint32_t i = 0u; i < 3u; ++i) {
smallestSide = std::min(smallestSide, (triangle[i] - triangle[(i + 1u) % 3u]).norm());
}
}
return smallestSide;
}
voi... | 43.497908 | 226 | 0.647172 | balazs-bamer |
9beda4926c564a81220cced0b6ad4e08fd4eece4 | 5,041 | hpp | C++ | engine/convolution/Layer2DProtectingReference.hpp | MGNeo/cnn | 4f77ca84591cc8e2b843f96bef0d7bf372c35ab9 | [
"BSD-2-Clause"
] | null | null | null | engine/convolution/Layer2DProtectingReference.hpp | MGNeo/cnn | 4f77ca84591cc8e2b843f96bef0d7bf372c35ab9 | [
"BSD-2-Clause"
] | null | null | null | engine/convolution/Layer2DProtectingReference.hpp | MGNeo/cnn | 4f77ca84591cc8e2b843f96bef0d7bf372c35ab9 | [
"BSD-2-Clause"
] | null | null | null | #pragma once
#include "Layer2D.hpp"
namespace cnn
{
namespace engine
{
namespace convolution
{
// Layer2DProtectingReference is a type which implements semantics of protecting reference to Layer2D.
// The smart reference proxies all methods of Layer2D and doesn't allow to use methods, which ch... | 31.117284 | 122 | 0.670502 | MGNeo |
9bf66c90649ac3e6039e7a5db6907c958c3c11e3 | 2,351 | cpp | C++ | ch03/e3-11.cpp | nanonashy/PPPUCpp2ndJP | b829867e9e21bf59d9c5ea6c2fbe96bb03597301 | [
"MIT"
] | 3 | 2021-12-17T17:25:18.000Z | 2022-03-02T15:52:23.000Z | ch03/e3-11.cpp | nashinium/PPPUCpp2ndJP | b829867e9e21bf59d9c5ea6c2fbe96bb03597301 | [
"MIT"
] | 1 | 2020-04-22T07:16:34.000Z | 2020-04-22T10:04:04.000Z | ch03/e3-11.cpp | nashinium/PPPUCpp2ndJP | b829867e9e21bf59d9c5ea6c2fbe96bb03597301 | [
"MIT"
] | 1 | 2020-04-22T08:13:51.000Z | 2020-04-22T08:13:51.000Z | #include "../include/std_lib_facilities.h"
int main() {
// 定義
int penny = 0;
int nickel = 0;
int dime = 0;
int quarter = 0;
int half_dollar = 0;
int dollar = 0;
int total_cent = 0;
// プロンプト
std::cout << "How many pennies do you have?: ";
std::cin >> penny;
... | 33.112676 | 81 | 0.483624 | nanonashy |
9bfe26cc2dc3cbbe92250d98ae84caf7b57a0d9f | 2,729 | cpp | C++ | Algoritmos_Voraces/MaratonDeCineDeTerror/MaratonDeCineDeTerror.cpp | manumonforte/AdvancedAlgorithm | fe82ef552147a041e7ad717f85999eb677f5340a | [
"MIT"
] | 4 | 2019-01-30T21:35:40.000Z | 2019-06-25T03:19:44.000Z | Algoritmos_Voraces/MaratonDeCineDeTerror/MaratonDeCineDeTerror.cpp | manumonforte/AdvancedAlgorithm | fe82ef552147a041e7ad717f85999eb677f5340a | [
"MIT"
] | null | null | null | Algoritmos_Voraces/MaratonDeCineDeTerror/MaratonDeCineDeTerror.cpp | manumonforte/AdvancedAlgorithm | fe82ef552147a041e7ad717f85999eb677f5340a | [
"MIT"
] | 3 | 2019-06-06T17:01:28.000Z | 2021-06-27T10:55:34.000Z | // Manuel Monforte
// TAIS62
/*El problmea nos pregunta que a cuantas peliculas puede acceder como maximo Deborah, para ello
ordenamos las peliculas dependiendo de su hora final de manera creciente. De manera que para cada pelicula
comprobamos si ocupa parte de la siguiente, si no es asi aumentamos las peliculas que ... | 23.525862 | 106 | 0.662514 | manumonforte |
5000ee6575c6f0229d30f933863f7e9879909835 | 2,547 | hpp | C++ | src/ropufu/math_constants.hpp | ropufu/aftermath | ab9364c41672a188879d84ebebb5a23f2d6641ec | [
"MIT"
] | null | null | null | src/ropufu/math_constants.hpp | ropufu/aftermath | ab9364c41672a188879d84ebebb5a23f2d6641ec | [
"MIT"
] | null | null | null | src/ropufu/math_constants.hpp | ropufu/aftermath | ab9364c41672a188879d84ebebb5a23f2d6641ec | [
"MIT"
] | null | null | null |
#ifndef ROPUFU_AFTERMATH_MATH_CONSTANTS_HPP_INCLUDED
#define ROPUFU_AFTERMATH_MATH_CONSTANTS_HPP_INCLUDED
namespace ropufu::aftermath
{
/** A place for some mathematical constants. */
template <typename t_numeric_type>
struct math_constants
{
/** The number 1/2. */
static constexpr t_n... | 53.0625 | 119 | 0.705143 | ropufu |
50013ccd1cd1c0bc3f7b15ab7dae7a66c53deca8 | 12,581 | cpp | C++ | BacktrackingHelper.cpp | younasiqw/HOPROCSGO | efdbc9f636d39cfe425707086ac60afbafe78e72 | [
"MIT"
] | null | null | null | BacktrackingHelper.cpp | younasiqw/HOPROCSGO | efdbc9f636d39cfe425707086ac60afbafe78e72 | [
"MIT"
] | null | null | null | BacktrackingHelper.cpp | younasiqw/HOPROCSGO | efdbc9f636d39cfe425707086ac60afbafe78e72 | [
"MIT"
] | null | null | null | #include "sdk.h"
#include "BacktrackingHelper.h"
#include "global.h"
#include "xor.h"
#include "Math.h"
#define TICK_INTERVAL (g_pGlobals->interval_per_tick)
#define TIME_TO_TICKS(dt) (floorf((0.5f + (float)(dt) / TICK_INTERVAL)))
#define TICKS_TO_TIME(t) (TICK_INTERVAL * (t))
template <class T, class U>
i... | 8.599453 | 168 | 0.58326 | younasiqw |
5008631606ffc014087e84ab619346e5954abc75 | 2,455 | hpp | C++ | TrollGameEngine/TrollMath/Point.hpp | LeviOfficalDriftingRealmsDev/DriftingRealmsWorldEditor | 8d3edb8c1ef18447a1689e81128ad2c32ca0262e | [
"MIT"
] | null | null | null | TrollGameEngine/TrollMath/Point.hpp | LeviOfficalDriftingRealmsDev/DriftingRealmsWorldEditor | 8d3edb8c1ef18447a1689e81128ad2c32ca0262e | [
"MIT"
] | null | null | null | TrollGameEngine/TrollMath/Point.hpp | LeviOfficalDriftingRealmsDev/DriftingRealmsWorldEditor | 8d3edb8c1ef18447a1689e81128ad2c32ca0262e | [
"MIT"
] | null | null | null | #pragma once
#include <cmath>
#include "MathConstants.hpp"
#include "MathFunctions.hpp"
namespace TMath{
class Point;
//! Stores a point that is described by an angle and a magnitude
class PolarPoint{
public:
PolarPoint();
PolarPoint(const float &angle, const float &magni... | 36.102941 | 91 | 0.602444 | LeviOfficalDriftingRealmsDev |
5009b4756572daaa049ed4fbe1a49e26368454a3 | 1,243 | cpp | C++ | module_01/ex03/HumanB.cpp | paulahemsi/piscine_cpp | f98feefd8e70308f77442f9b4cb64758676349a7 | [
"MIT"
] | 4 | 2021-12-14T18:02:53.000Z | 2022-03-24T01:12:38.000Z | module_01/ex03/HumanB.cpp | paulahemsi/piscine_cpp | f98feefd8e70308f77442f9b4cb64758676349a7 | [
"MIT"
] | null | null | null | module_01/ex03/HumanB.cpp | paulahemsi/piscine_cpp | f98feefd8e70308f77442f9b4cb64758676349a7 | [
"MIT"
] | 3 | 2021-11-01T00:34:50.000Z | 2022-01-29T19:57:30.000Z | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* HumanB.cpp :+: :+: :+: ... | 32.710526 | 80 | 0.256637 | paulahemsi |
5012885b4b0b9aaa101338270ae30a833a7d0642 | 5,485 | cpp | C++ | src/Main.cpp | loki077/ColorClusteringCpp | 431a9b65d4918b05484ee7931dc80612f2941df1 | [
"MIT"
] | null | null | null | src/Main.cpp | loki077/ColorClusteringCpp | 431a9b65d4918b05484ee7931dc80612f2941df1 | [
"MIT"
] | null | null | null | src/Main.cpp | loki077/ColorClusteringCpp | 431a9b65d4918b05484ee7931dc80612f2941df1 | [
"MIT"
] | null | null | null | /********************************************************************************************
Project Name : Color Clusturing with input from .bin file and dimension
Developer : Lokesh Ramina
Platform : c++ compiler g++ on Ubuntu 16.04
Date : 22-03-2019
Purpose : Task
Note : Please ... | 26.626214 | 96 | 0.517411 | loki077 |
50157bbce453cac2b99e7f4434790ec18419262e | 3,490 | cpp | C++ | src/lib/util/tests/TestUtHashMap.cpp | MarkLeone/PostHaste | 56083e30a58489338e39387981029488d7af2390 | [
"MIT"
] | 4 | 2015-05-07T03:29:52.000Z | 2016-08-29T17:30:15.000Z | src/lib/util/tests/TestUtHashMap.cpp | MarkLeone/PostHaste | 56083e30a58489338e39387981029488d7af2390 | [
"MIT"
] | 1 | 2018-05-14T04:41:04.000Z | 2018-05-14T04:41:04.000Z | src/lib/util/tests/TestUtHashMap.cpp | MarkLeone/PostHaste | 56083e30a58489338e39387981029488d7af2390 | [
"MIT"
] | null | null | null | #include "util/UtHashMap.h"
#include <gtest/gtest.h>
class TestUtHashMap : public testing::Test { };
TEST_F(TestUtHashMap, TestCStringHash)
{
UtHash hashFn;
const char* s1 = "hello";
char* s2 = (char*) strdup(s1);
EXPECT_NE(s1, s2);
EXPECT_EQ(hashFn(s1), hashFn(s2));
free(s2);
}
TEST_F(TestUt... | 20.409357 | 74 | 0.592837 | MarkLeone |
5016cded48bec8d6254729dfdb89c9f59c9a2096 | 7,243 | cpp | C++ | llvm/lib/SYCL/KernelPropGen.cpp | mgehre-xlx/sycl | 2086745509ef4bc298d7bbec402a123dae68f25e | [
"Apache-2.0"
] | 61 | 2019-04-12T18:49:57.000Z | 2022-03-19T22:23:16.000Z | llvm/lib/SYCL/KernelPropGen.cpp | mgehre-xlx/sycl | 2086745509ef4bc298d7bbec402a123dae68f25e | [
"Apache-2.0"
] | 127 | 2019-04-09T00:55:50.000Z | 2022-03-21T15:35:41.000Z | llvm/lib/SYCL/KernelPropGen.cpp | mgehre-xlx/sycl | 2086745509ef4bc298d7bbec402a123dae68f25e | [
"Apache-2.0"
] | 10 | 2019-04-02T18:25:40.000Z | 2022-02-15T07:11:37.000Z | //===- KernelPropGen.cpp ---------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Retrieve... | 35.160194 | 80 | 0.633301 | mgehre-xlx |
501c89831217b45ef173dd1d7b708e277ce20810 | 9,387 | cpp | C++ | Blocks/Core/BlockDatabase.cpp | swr06/Block | 5eca9caa18ba7c296955d6a718f3f9311c3a0351 | [
"MIT"
] | 8 | 2020-11-18T12:04:32.000Z | 2021-07-15T08:19:42.000Z | Blocks/Core/BlockDatabase.cpp | swr06/Block | 5eca9caa18ba7c296955d6a718f3f9311c3a0351 | [
"MIT"
] | null | null | null | Blocks/Core/BlockDatabase.cpp | swr06/Block | 5eca9caa18ba7c296955d6a718f3f9311c3a0351 | [
"MIT"
] | 2 | 2021-03-27T15:26:39.000Z | 2021-06-06T16:57:15.000Z | #include "BlockDatabase.h"
namespace Blocks
{
extern std::unordered_map<std::string, BlockDatabaseParser::ParsedBlockData> ParsedBlockDataList;
std::unordered_map<uint8_t, BlockDatabaseParser::ParsedBlockData> ParsedBlockDataListID;
GLClasses::TextureArray BlockTextureArray;
GLClasses::TextureArray BlockNormalText... | 20.953125 | 146 | 0.688292 | swr06 |
50202c83cbd17402a793f1507258a896707b4748 | 40,120 | cpp | C++ | software/swkernels/xi_swsoftmax_top.cpp | yhyoung/CHaiDNN | 1877a81e0d1b44773af455b0eab4399636bbc181 | [
"Apache-2.0"
] | 288 | 2018-03-23T01:41:40.000Z | 2022-03-03T08:52:54.000Z | software/swkernels/xi_swsoftmax_top.cpp | yhyoung/CHaiDNN | 1877a81e0d1b44773af455b0eab4399636bbc181 | [
"Apache-2.0"
] | 171 | 2018-03-25T11:03:23.000Z | 2022-01-29T14:16:59.000Z | software/swkernels/xi_swsoftmax_top.cpp | yhyoung/CHaiDNN | 1877a81e0d1b44773af455b0eab4399636bbc181 | [
"Apache-2.0"
] | 154 | 2018-03-23T01:31:33.000Z | 2022-03-04T14:26:40.000Z | /*----------------------------------------------------
Copyright 2017 Xilinx, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by app... | 31.076685 | 141 | 0.648804 | yhyoung |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.