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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e2e98f8fcc220abdabb4aebcef64a8f281d47cf5 | 402 | cpp | C++ | CtCI-6th-Edition-cpp/01_Arrays_And_Strings/01_Is_Unique/isUnique.test.cpp | longztian/cpp | 59203f41162f40a46badf69093d287250e5cbab6 | [
"MIT"
] | null | null | null | CtCI-6th-Edition-cpp/01_Arrays_And_Strings/01_Is_Unique/isUnique.test.cpp | longztian/cpp | 59203f41162f40a46badf69093d287250e5cbab6 | [
"MIT"
] | null | null | null | CtCI-6th-Edition-cpp/01_Arrays_And_Strings/01_Is_Unique/isUnique.test.cpp | longztian/cpp | 59203f41162f40a46badf69093d287250e5cbab6 | [
"MIT"
] | null | null | null | #include "catch.hpp"
#include "isUnique.hpp"
TEST_CASE("true if a string is empty", "[isUnique]") {
REQUIRE(isUnique("") == true);
}
TEST_CASE("true if a string has all unique characters", "[isUnique]") {
REQUIRE(isUnique("abcde") == true);
}
TEST_CASE("false if a string has duplicate characters", "[isUnique]") ... | 25.125 | 71 | 0.666667 | longztian |
e2ef02f25bbfd49d8769438446e5e088dd404f12 | 164 | hpp | C++ | editor/asset/archiver/asset_archiver.hpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | editor/asset/archiver/asset_archiver.hpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | editor/asset/archiver/asset_archiver.hpp | chokomancarr/chokoengine2 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "chokoeditor.hpp"
CE_BEGIN_ED_NAMESPACE
class EAssetArchiver {
public:
static void Exec(const std::string& tar);
};
CE_END_ED_NAMESPACE | 14.909091 | 45 | 0.77439 | chokomancarr |
e2f0a3c88330530a7e7280b294c5d3e278725a8d | 9,235 | cpp | C++ | src/gfx/internal/ApplicationManager.cpp | pcbaecker/ananasgfx | 0637554bf82b990713314a24e4a6ead299be949a | [
"MIT"
] | 1 | 2019-01-28T13:48:17.000Z | 2019-01-28T13:48:17.000Z | src/gfx/internal/ApplicationManager.cpp | pcbaecker/ananasgfx | 0637554bf82b990713314a24e4a6ead299be949a | [
"MIT"
] | 11 | 2019-01-28T13:59:36.000Z | 2019-02-09T14:59:23.000Z | src/gfx/internal/ApplicationManager.cpp | pcbaecker/ananasgfx | 0637554bf82b990713314a24e4a6ead299be949a | [
"MIT"
] | null | null | null | #include <ananasgfx/gfx/internal/ApplicationManager.hpp>
#include <ananasgfx/gfx/Application.hpp>
#include <ananasgfx/test/ApplicationTest.hpp>
#include <ee/Log.hpp>
#include <algorithm>
namespace gfx::_internal {
int ApplicationManager::ReturnCode = EXIT_FAILURE;
void ApplicationManager::removeUnlisted(
... | 42.953488 | 123 | 0.56405 | pcbaecker |
e2f0ab25abaa7252309d90d65cb1bf8f23e5c4ad | 1,214 | hpp | C++ | Engine/src/Platform/OpenGL/openGLRendererAPI.hpp | Niels04/Engine | 2bc0f8d65ffb0f29035edc16958c60826da7f535 | [
"Apache-2.0"
] | null | null | null | Engine/src/Platform/OpenGL/openGLRendererAPI.hpp | Niels04/Engine | 2bc0f8d65ffb0f29035edc16958c60826da7f535 | [
"Apache-2.0"
] | null | null | null | Engine/src/Platform/OpenGL/openGLRendererAPI.hpp | Niels04/Engine | 2bc0f8d65ffb0f29035edc16958c60826da7f535 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "Engine/Rendering/rendererAPI.hpp"
namespace Engine
{
class OpenGLRendererAPI : public RendererAPI
{
public:
virtual void init() const override;
virtual void clear() const override;
virtual void clearDepth() const override;
virtual void setClearColor(const glm::vec4& color) const overr... | 48.56 | 184 | 0.797364 | Niels04 |
e2fac657453f80152cb697629eb5eaf41c9c9dac | 11,608 | cpp | C++ | src/pumiMBBL_meshops.cpp | SCOREC/pumiMBBL | 7f6e5fdb721f948d7929837dadfa841b42e547a6 | [
"BSD-3-Clause"
] | null | null | null | src/pumiMBBL_meshops.cpp | SCOREC/pumiMBBL | 7f6e5fdb721f948d7929837dadfa841b42e547a6 | [
"BSD-3-Clause"
] | 6 | 2020-06-19T19:44:27.000Z | 2022-03-30T23:09:46.000Z | src/pumiMBBL_meshops.cpp | SCOREC/pumiMBBL | 7f6e5fdb721f948d7929837dadfa841b42e547a6 | [
"BSD-3-Clause"
] | 2 | 2020-03-06T20:00:00.000Z | 2021-03-22T14:44:29.000Z | #include "pumiMBBL_meshops.hpp"
namespace pumi {
Vector3 get_rand_point_in_mesh_host(MBBL pumi_obj){
if (pumi_obj.mesh.ndim == 1){
double rand_x1 = (double) rand()/RAND_MAX;
double x1_min = get_global_x1_min_coord(pumi_obj);
double x1_max = get_global_x1_max_coord(pumi_obj);
double... | 40.587413 | 160 | 0.668591 | SCOREC |
c3ad7425940b56501f0e45980977ec323a15b6b7 | 193 | cpp | C++ | tute01.cpp | SLIIT-FacultyOfComputing/tutorial-02b-IT21164330 | d4ea011a8a13fedc19f3889620fbd25d6de00bd2 | [
"MIT"
] | null | null | null | tute01.cpp | SLIIT-FacultyOfComputing/tutorial-02b-IT21164330 | d4ea011a8a13fedc19f3889620fbd25d6de00bd2 | [
"MIT"
] | null | null | null | tute01.cpp | SLIIT-FacultyOfComputing/tutorial-02b-IT21164330 | d4ea011a8a13fedc19f3889620fbd25d6de00bd2 | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
int main(){
float cm, inches;
cout << "Enter a length in cm : ";
cin >> cm;
inches = cm / 2.54;
cout <<"Length in inches is %f \n" <<inches;
} | 19.3 | 46 | 0.601036 | SLIIT-FacultyOfComputing |
c3aec22c81cd06ca508f8b7bfad1cff399058cf9 | 5,780 | hpp | C++ | Libraries/Macaronlib/include/Macaronlib/List.hpp | vpachkov/MacaronOS | e2572761f0d73a435d5660eb88d4dc96c944a349 | [
"MIT"
] | 21 | 2021-08-22T19:06:54.000Z | 2022-03-31T12:44:30.000Z | Libraries/Macaronlib/include/Macaronlib/List.hpp | Plunkerusr/WisteriaOS | 14f853cb8fdd6b958dd94ab24e5f19ac0268a4f6 | [
"MIT"
] | 1 | 2021-09-01T22:55:59.000Z | 2021-09-08T20:52:09.000Z | Libraries/Macaronlib/include/Macaronlib/List.hpp | Plunkerusr/WisteriaOS | 14f853cb8fdd6b958dd94ab24e5f19ac0268a4f6 | [
"MIT"
] | null | null | null | #pragma once
#include "Common.hpp"
#include "Runtime.hpp"
template <typename T>
class ListNode {
public:
ListNode() = default;
~ListNode() = default;
explicit ListNode(const T& val)
: m_val(val)
{
}
explicit ListNode(T&& val)
: m_val(move(val))
{
}
ListNode<T>* ne... | 24.1841 | 89 | 0.606055 | vpachkov |
c3b2f74f2e541b2ecf585752c8245c72eaf1f1f7 | 26,719 | hpp | C++ | zed_wrapper/src/component/include/zed_component.hpp | mehmetkillioglu/zed-ros2-wrapper | b8328f5225e024907366b1cf550bd4655a27e3a1 | [
"MIT"
] | null | null | null | zed_wrapper/src/component/include/zed_component.hpp | mehmetkillioglu/zed-ros2-wrapper | b8328f5225e024907366b1cf550bd4655a27e3a1 | [
"MIT"
] | null | null | null | zed_wrapper/src/component/include/zed_component.hpp | mehmetkillioglu/zed-ros2-wrapper | b8328f5225e024907366b1cf550bd4655a27e3a1 | [
"MIT"
] | null | null | null | #ifndef ZED_COMPONENT_HPP
#define ZED_COMPONENT_HPP
// /////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2019, STEREOLABS.
//
// All rights reserved.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, I... | 42.956592 | 128 | 0.665444 | mehmetkillioglu |
c3b7d4df00cf29cbd4e89df636c19f359a9ae876 | 7,348 | cpp | C++ | Projects/WebAthl/DBForeignKey.cpp | darianbridge/WebAthl | daf916b169983375022a39645419f79c7f3cbfed | [
"Apache-2.0"
] | null | null | null | Projects/WebAthl/DBForeignKey.cpp | darianbridge/WebAthl | daf916b169983375022a39645419f79c7f3cbfed | [
"Apache-2.0"
] | null | null | null | Projects/WebAthl/DBForeignKey.cpp | darianbridge/WebAthl | daf916b169983375022a39645419f79c7f3cbfed | [
"Apache-2.0"
] | 1 | 2021-07-05T10:10:21.000Z | 2021-07-05T10:10:21.000Z | // CDBForeignKey.cpp : implementation file
//
#include "stdafx.h"
#include "resource.h"
#include "BitMaskEnum.h"
#include "DBForeignKey.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
//... | 23.253165 | 77 | 0.693114 | darianbridge |
c3befa0aa7796910d453dc9dcb88279530bb0caa | 175 | cpp | C++ | Python/Source/Constant.cpp | kranar/rover | a4a824321859e34478fec0924c0b76144b3fc20e | [
"Apache-2.0"
] | null | null | null | Python/Source/Constant.cpp | kranar/rover | a4a824321859e34478fec0924c0b76144b3fc20e | [
"Apache-2.0"
] | 30 | 2019-02-05T23:18:13.000Z | 2019-07-05T14:19:04.000Z | Python/Source/Constant.cpp | kranar/rover | a4a824321859e34478fec0924c0b76144b3fc20e | [
"Apache-2.0"
] | 1 | 2020-06-01T06:32:05.000Z | 2020-06-01T06:32:05.000Z | #include "Rover/Python/Constant.hpp"
using namespace pybind11;
using namespace Rover;
void Rover::export_constant(module& module) {
export_constant<object>(module, "");
}
| 19.444444 | 45 | 0.76 | kranar |
c3bf059b87f6834e127769027b9e3408b884a478 | 1,009 | cpp | C++ | PIN64/pin64/block.cpp | MooglyGuy/pin64 | aa411cbabbc400f752411d2c0a0711209d7f4826 | [
"BSD-3-Clause"
] | 1 | 2019-05-22T23:22:14.000Z | 2019-05-22T23:22:14.000Z | PIN64/pin64/block.cpp | MooglyGuy/pin64 | aa411cbabbc400f752411d2c0a0711209d7f4826 | [
"BSD-3-Clause"
] | 1 | 2019-07-04T10:12:06.000Z | 2019-07-04T10:12:06.000Z | PIN64/pin64/block.cpp | MooglyGuy/pin64 | aa411cbabbc400f752411d2c0a0711209d7f4826 | [
"BSD-3-Clause"
] | null | null | null | // license:BSD-3-Clause
// copyright-holders:Ryan Holtz
#include "block.h"
#ifdef PIN64_STANDALONE_BUILD
#include <CRC.h>
#endif
const uint8_t pin64_block_t::BLOCK_ID[4] = { 'P', '6', '4', 'B' };
pin64_block_t::pin64_block_t(uint8_t* data, size_t size)
: pin64_block_t() {
m_data.put(data, size);
finalize();
}
p... | 21.468085 | 91 | 0.676908 | MooglyGuy |
c3bf2d234c0a0835ed4f306331c815e8d962cbbb | 29,235 | cpp | C++ | lib/CodeGen/LiveInterval.cpp | nettrino/IntFlow | 0400aef5da2c154268d8b020e393c950435395b3 | [
"Unlicense"
] | 16 | 2015-09-08T08:49:11.000Z | 2019-07-20T14:46:20.000Z | src/llvm/lib/CodeGen/LiveInterval.cpp | jeltz/rust-debian-package | 07eaa3658867408248c555b1b3a593c012b4f931 | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
] | 1 | 2019-02-10T08:27:48.000Z | 2019-02-10T08:27:48.000Z | src/llvm/lib/CodeGen/LiveInterval.cpp | jeltz/rust-debian-package | 07eaa3658867408248c555b1b3a593c012b4f931 | [
"ECL-2.0",
"Apache-2.0",
"MIT-0",
"MIT"
] | 7 | 2016-05-26T17:31:46.000Z | 2020-11-04T06:39:23.000Z | //===-- LiveInterval.cpp - Live Interval Representation -------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | 33.373288 | 83 | 0.613785 | nettrino |
c3bfc00158c4140b4b2dd560d031f8b650330300 | 331 | cpp | C++ | Pbinfo/SumSec1.cpp | Al3x76/cpp | 08a0977d777e63e0d36d87fcdea777de154697b7 | [
"MIT"
] | 7 | 2019-01-06T19:10:14.000Z | 2021-10-16T06:41:23.000Z | Pbinfo/SumSec1.cpp | Al3x76/cpp | 08a0977d777e63e0d36d87fcdea777de154697b7 | [
"MIT"
] | null | null | null | Pbinfo/SumSec1.cpp | Al3x76/cpp | 08a0977d777e63e0d36d87fcdea777de154697b7 | [
"MIT"
] | 6 | 2019-01-06T19:17:30.000Z | 2020-02-12T22:29:17.000Z | #include <iostream>
using namespace std;
int main()
{
int n, a[1005], iPrim=0, iSecund=0, s=0;
cin>>n;
for(int i=1; i<=n; i++){
cin>>a[i];
if(iPrim==0 && a[i]%2==1) iPrim=i;
if(a[i]%2==1) iSecund=i;
}
for(int i=iPrim; i<=iSecund; i++)
s+=a[i];
cout<<s;
... | 14.391304 | 44 | 0.459215 | Al3x76 |
c3c0abf3818a9b0444888a42727accfa9d1ddffa | 15,981 | cpp | C++ | Tools/STM32FW/STM32Cube_FW_F7_V1.16.2/Projects/STM32756G_EVAL/Demonstrations/TouchGFX/Gui/generated/images/src/Game2D/collectible_item_05.cpp | ramkumarkoppu/NUCLEO-F767ZI-ESW | 85e129d71ee8eccbd0b94b5e07e75b6b91679ee8 | [
"MIT"
] | null | null | null | Tools/STM32FW/STM32Cube_FW_F7_V1.16.2/Projects/STM32756G_EVAL/Demonstrations/TouchGFX/Gui/generated/images/src/Game2D/collectible_item_05.cpp | ramkumarkoppu/NUCLEO-F767ZI-ESW | 85e129d71ee8eccbd0b94b5e07e75b6b91679ee8 | [
"MIT"
] | null | null | null | Tools/STM32FW/STM32Cube_FW_F7_V1.16.2/Projects/STM32756G_EVAL/Demonstrations/TouchGFX/Gui/generated/images/src/Game2D/collectible_item_05.cpp | ramkumarkoppu/NUCLEO-F767ZI-ESW | 85e129d71ee8eccbd0b94b5e07e75b6b91679ee8 | [
"MIT"
] | null | null | null | // Generated by imageconverter. Please, do not edit!
#include <touchgfx/hal/Config.hpp>
LOCATION_EXTFLASH_PRAGMA
KEEP extern const unsigned char _collectible_item_05[] LOCATION_EXTFLASH_ATTRIBUTE = { // 28x28 ARGB8888 pixels.
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x... | 202.291139 | 320 | 0.796446 | ramkumarkoppu |
c3c96dbc7122234e173dc5de3f37248c12aa354a | 6,167 | cpp | C++ | lab4/Lists/lists.cpp | polinaKP/semester_2 | 11713c3f09bc9756f254e5f56b679ae06d2da657 | [
"Unlicense"
] | null | null | null | lab4/Lists/lists.cpp | polinaKP/semester_2 | 11713c3f09bc9756f254e5f56b679ae06d2da657 | [
"Unlicense"
] | null | null | null | lab4/Lists/lists.cpp | polinaKP/semester_2 | 11713c3f09bc9756f254e5f56b679ae06d2da657 | [
"Unlicense"
] | null | null | null | #include <iostream>
#include <list>
typedef struct Node {
int value;
struct Node *next;
} Node;
void push_back(Node ** head, int value)
{
if (*head == NULL) {
*head = new Node;
(*head)->value = value;
(*head)->next = NULL;
return;
}
Node * p_node = *head;
while... | 23.996109 | 60 | 0.483055 | polinaKP |
c3cac169931db87a8c151b472be302f5371a0c6c | 1,529 | cpp | C++ | src/graphics/primitives/Animation.cpp | petuzk/Warcaby | 2102493199c7edf9ea752dfcb374435d5b9049fd | [
"MIT"
] | null | null | null | src/graphics/primitives/Animation.cpp | petuzk/Warcaby | 2102493199c7edf9ea752dfcb374435d5b9049fd | [
"MIT"
] | null | null | null | src/graphics/primitives/Animation.cpp | petuzk/Warcaby | 2102493199c7edf9ea752dfcb374435d5b9049fd | [
"MIT"
] | null | null | null | #include "inc/graphics/primitives/Animation.hpp"
#include "inc/graphics/primitives/Animator.hpp"
Animation::Animation(milliseconds duration, bool parallelToPrev, Animation::State state):
started(false), duration(duration), state(state), onEndCallback(nullptr)
{
Animator::getInstance()->addAnimation(this, parallelToP... | 21.535211 | 102 | 0.712884 | petuzk |
c3cb2b779a659459ce0016a678a25d145866e174 | 10,854 | cpp | C++ | Samples/Win7Samples/security/authorization/azman/azmigrate/AzHelper.cpp | windows-development/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 8 | 2017-04-30T17:38:27.000Z | 2021-11-29T00:59:03.000Z | Samples/Win7Samples/security/authorization/azman/azmigrate/AzHelper.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | null | null | null | Samples/Win7Samples/security/authorization/azman/azmigrate/AzHelper.cpp | TomeSq/Windows-classic-samples | 96f883e4c900948e39660ec14a200a5164a3c7b7 | [
"MIT"
] | 2 | 2020-08-11T13:21:49.000Z | 2021-09-01T10:41:51.000Z | /****************************************************************************
// THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
//... | 26.280872 | 105 | 0.615902 | windows-development |
c3ccec1090f2d963fbdff5ebf8e967ee3cbb4f90 | 3,651 | hpp | C++ | Axis.Core/application/parsing/preprocessing/InstructionFeeder.hpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | 2 | 2021-07-23T08:49:54.000Z | 2021-07-29T22:07:30.000Z | Axis.Core/application/parsing/preprocessing/InstructionFeeder.hpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | null | null | null | Axis.Core/application/parsing/preprocessing/InstructionFeeder.hpp | renato-yuzup/axis-fem | 2e8d325eb9c8e99285f513b4c1218ef53eb0ab22 | [
"MIT"
] | null | null | null | #pragma once
#include <boost/spirit/include/qi.hpp>
#include "services/io/StreamReader.hpp"
#include "AxisString.hpp"
#include "application/parsing/core/ParseContext.hpp"
namespace axis { namespace application { namespace parsing { namespace preprocessing {
/// <summary>
/// Reads data from an input stream and feeds ... | 34.121495 | 101 | 0.671597 | renato-yuzup |
c3d20c5dad55370960e33cd00d0a831c318b5bc2 | 1,320 | cpp | C++ | src/noncasual_lp.cpp | despargy/KukaImplementation-kinetic | 3a9ab106b117acfc6478fbf3e60e49b7e94b2722 | [
"MIT"
] | 1 | 2021-08-21T12:49:27.000Z | 2021-08-21T12:49:27.000Z | src/noncasual_lp.cpp | despargy/KukaImplementation-kinetic | 3a9ab106b117acfc6478fbf3e60e49b7e94b2722 | [
"MIT"
] | null | null | null | src/noncasual_lp.cpp | despargy/KukaImplementation-kinetic | 3a9ab106b117acfc6478fbf3e60e49b7e94b2722 | [
"MIT"
] | null | null | null | #define SUBBLOCK SIZE 22 // for method 0, and 12 for methods 1 and 2
void fir(double * const x, const int Nx,
const double * const h, const int Nh,
double* r)
{
/*
x:
Nx:
h:
Nh:
input data
length of input data
filter coefficients
length of the filter
21r:
the result after filtering
*/
}
int main()
{
const double h[] ... | 25.882353 | 68 | 0.618939 | despargy |
c3d348a86b997bde2cf055764577167b1949bb91 | 68,385 | cpp | C++ | Plugins/Engine/Renderer.cpp | xycsoscyx/gekengine | cb9c933c6646169c0af9c7e49be444ff6f97835d | [
"MIT"
] | 1 | 2019-04-22T00:10:49.000Z | 2019-04-22T00:10:49.000Z | Plugins/Engine/Renderer.cpp | xycsoscyx/gekengine | cb9c933c6646169c0af9c7e49be444ff6f97835d | [
"MIT"
] | null | null | null | Plugins/Engine/Renderer.cpp | xycsoscyx/gekengine | cb9c933c6646169c0af9c7e49be444ff6f97835d | [
"MIT"
] | 2 | 2017-10-16T15:40:55.000Z | 2019-04-22T00:10:50.000Z | #include "GEK/Math/SIMD.hpp"
#include "GEK/Shapes/Sphere.hpp"
#include "GEK/Utility/String.hpp"
#include "GEK/Utility/FileSystem.hpp"
#include "GEK/Utility/JSON.hpp"
#include "GEK/Utility/ContextUser.hpp"
#include "GEK/Utility/ThreadPool.hpp"
#include "GEK/Utility/Allocator.hpp"
#include "GEK/Utility/Profiler.hpp"
#in... | 41.749084 | 220 | 0.66149 | xycsoscyx |
c3d4a9bbcccfb662694cf0299e05f708deb9cb81 | 6,403 | hpp | C++ | include/UnityEngine/TestTools/Utils/CoroutineRunner.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/UnityEngine/TestTools/Utils/CoroutineRunner.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | include/UnityEngine/TestTools/Utils/CoroutineRunner.hpp | darknight1050/BeatSaber-Quest-Codegen | a6eeecc3f0e8f6079630f9a9a72b3121ac7b2032 | [
"Unlicense"
] | null | null | null | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "extern/beatsaber-hook/shared/utils/typedefs.h"
#include "extern/beatsaber-hook/shared/utils/il2cpp-utils-methods.hpp"
#include "extern/b... | 52.056911 | 500 | 0.738872 | darknight1050 |
c3db8f36982be28143335f40bf0b7c380c6e696e | 9,365 | hpp | C++ | src/HALib/protocol/node/HANode.hpp | SBKila/homeassistantlibrary | 7adf8a950d4c428141ac92920bd2630341b3a261 | [
"MIT"
] | null | null | null | src/HALib/protocol/node/HANode.hpp | SBKila/homeassistantlibrary | 7adf8a950d4c428141ac92920bd2630341b3a261 | [
"MIT"
] | null | null | null | src/HALib/protocol/node/HANode.hpp | SBKila/homeassistantlibrary | 7adf8a950d4c428141ac92920bd2630341b3a261 | [
"MIT"
] | null | null | null | #pragma once
#include <Arduino.h>
#include "../../tools/LinkedList.hpp"
#include "../../tools/HAUtils.hpp"
#include "../HASubscribCmd.hpp"
#include "../HAMessage.hpp"
#include "../IHANode.h"
#include "../IHAComponent.h"
#include "../components/HAComponentType.hpp"
//#include "../components/HAComponentProperty.hpp"
//#... | 36.019231 | 139 | 0.564015 | SBKila |
c3dbb8fda99d81e17ea07d6124cfde316b16e0de | 634 | hpp | C++ | src/Chip8.hpp | azadad96/chip8_emulator | fed45202269fe7d41692f05144c8f04a5c97fb04 | [
"MIT"
] | null | null | null | src/Chip8.hpp | azadad96/chip8_emulator | fed45202269fe7d41692f05144c8f04a5c97fb04 | [
"MIT"
] | null | null | null | src/Chip8.hpp | azadad96/chip8_emulator | fed45202269fe7d41692f05144c8f04a5c97fb04 | [
"MIT"
] | null | null | null | #ifndef CHIP8
#define CHIP8
#include "Display.hpp"
#include <SDL2/SDL.h>
#include <string>
#include <cstdint>
#include <cstring>
#include <cstdlib>
#include <cstdio>
class Chip8 {
private:
uint8_t memory[4096];
uint8_t V[16];
uint16_t I;
uint16_t pc;
uint16_t stack[16];
int stackpointer;
... | 15.095238 | 40 | 0.635647 | azadad96 |
c3eaf7b377736236ded5380bb4cc9a390737f63b | 236 | hpp | C++ | ext/bindings/util.hpp | evizitei/pulsar-client-ruby | 173c8e2536743e1756d8e99d7a8e90d7fc688941 | [
"Apache-2.0"
] | 8 | 2019-10-25T07:55:44.000Z | 2021-02-18T19:58:16.000Z | ext/bindings/util.hpp | evizitei/pulsar-client-ruby | 173c8e2536743e1756d8e99d7a8e90d7fc688941 | [
"Apache-2.0"
] | 20 | 2019-10-03T17:57:36.000Z | 2022-02-12T15:29:08.000Z | ext/bindings/util.hpp | evizitei/pulsar-client-ruby | 173c8e2536743e1756d8e99d7a8e90d7fc688941 | [
"Apache-2.0"
] | 8 | 2019-10-03T17:55:59.000Z | 2021-12-15T02:48:31.000Z | #ifndef __PULSAR_RUBY_CLIENT_UTIL_HPP
#define __PULSAR_RUBY_CLIENT_UTIL_HPP
#include "rice/Module.hpp"
#include <pulsar/Client.h>
using namespace pulsar;
void CheckResult(Result res);
void bind_errors(Rice::Module& module);
#endif
| 16.857143 | 39 | 0.805085 | evizitei |
c3ed9360f77f4b1cf93cbb788d3a9fba164c9528 | 2,382 | cpp | C++ | ecs/src/v2/model/ServerInterfaceFixedIp.cpp | yangzhaofeng/huaweicloud-sdk-cpp-v3 | 4f3caac5ba9a9b75b4e5fd61683d1c4d57ec1c23 | [
"Apache-2.0"
] | 5 | 2021-03-03T08:23:43.000Z | 2022-02-16T02:16:39.000Z | ecs/src/v2/model/ServerInterfaceFixedIp.cpp | yangzhaofeng/huaweicloud-sdk-cpp-v3 | 4f3caac5ba9a9b75b4e5fd61683d1c4d57ec1c23 | [
"Apache-2.0"
] | null | null | null | ecs/src/v2/model/ServerInterfaceFixedIp.cpp | yangzhaofeng/huaweicloud-sdk-cpp-v3 | 4f3caac5ba9a9b75b4e5fd61683d1c4d57ec1c23 | [
"Apache-2.0"
] | 7 | 2021-02-26T13:53:35.000Z | 2022-03-18T02:36:43.000Z |
#include "huaweicloud/ecs/v2/model/ServerInterfaceFixedIp.h"
namespace HuaweiCloud {
namespace Sdk {
namespace Ecs {
namespace V2 {
namespace Model {
ServerInterfaceFixedIp::ServerInterfaceFixedIp()
{
ipAddress_ = "";
ipAddressIsSet_ = false;
subnetId_ = "";
subnetIdIsSet_ = false;
}
ServerInter... | 20.358974 | 101 | 0.672964 | yangzhaofeng |
c3efb64cbf192518c0e74a860a2bf2a824468ded | 1,423 | cpp | C++ | Chapter03/Chapter3_Source_Code/OddEven_Cond_var.cpp | ngdzu/CPP-Reactive-Programming | e1a19feb40be086d47227587b8ed3d509b7518ca | [
"MIT"
] | 98 | 2018-07-03T08:55:31.000Z | 2022-03-21T22:16:58.000Z | Chapter03/Chapter3_Source_Code/OddEven_Cond_var.cpp | ngdzu/CPP-Reactive-Programming | e1a19feb40be086d47227587b8ed3d509b7518ca | [
"MIT"
] | 1 | 2020-11-30T10:38:58.000Z | 2020-12-15T06:56:20.000Z | Chapter03/Chapter3_Source_Code/OddEven_Cond_var.cpp | ngdzu/CPP-Reactive-Programming | e1a19feb40be086d47227587b8ed3d509b7518ca | [
"MIT"
] | 54 | 2018-07-06T02:09:27.000Z | 2021-11-10T08:42:50.000Z | //====================================================================
// C++ concurrency - Thread synchronization using condition variable.
// Program to print 1-100 in order using odd and even number threads.
//====================================================================
#include <iostream>
#include <thread>
... | 22.951613 | 70 | 0.516514 | ngdzu |
7f0fd286ef82fc860d4d422cb5b3118467a8d111 | 1,270 | hpp | C++ | hallow/src/engine/renderer/render_system/RenderSystem.hpp | Lugo-Studio/Hallow | e2851051ae839c7b3d4d37ef7ab6947d7b23b117 | [
"MIT"
] | null | null | null | hallow/src/engine/renderer/render_system/RenderSystem.hpp | Lugo-Studio/Hallow | e2851051ae839c7b3d4d37ef7ab6947d7b23b117 | [
"MIT"
] | null | null | null | hallow/src/engine/renderer/render_system/RenderSystem.hpp | Lugo-Studio/Hallow | e2851051ae839c7b3d4d37ef7ab6947d7b23b117 | [
"MIT"
] | null | null | null | //
// Created by galex on 5/18/2021.
//
#ifndef HALLOW_RENDERSYSTEM_HPP
#define HALLOW_RENDERSYSTEM_HPP
#include "helpers/RootDir.h"
#include "engine/time/Time.hpp"
#include "engine/device/HallowDevice.hpp"
#include "engine/pipeline/HallowPipeline.hpp"
#include <string>
#include <memory>
#include <vector>
#include <... | 25.918367 | 123 | 0.759843 | Lugo-Studio |
7f1287c293135a7e747186f41bb1bf134014be2c | 671 | hpp | C++ | src/ModelBase/tdataunit.hpp | TKUICLab-humanoid/imageprocess_submodule | 76b08611f1ef38e67b89e95b5d3e3459906ab908 | [
"MIT"
] | null | null | null | src/ModelBase/tdataunit.hpp | TKUICLab-humanoid/imageprocess_submodule | 76b08611f1ef38e67b89e95b5d3e3459906ab908 | [
"MIT"
] | null | null | null | src/ModelBase/tdataunit.hpp | TKUICLab-humanoid/imageprocess_submodule | 76b08611f1ef38e67b89e95b5d3e3459906ab908 | [
"MIT"
] | null | null | null | #ifndef TDATAUNIT_H
#define TDATAUNIT_H
#include <fstream>
#include <string>
#include <stdlib.h>
#include <string.h>
#include "tku_libs/TKU_tool.h"
//include "../../../strategy/src/StrategyNameAndPath.h"
using namespace std;
struct ColorRange
{
float HueMin;
float HueMax;
float SaturationMin;
float Sa... | 17.205128 | 55 | 0.695976 | TKUICLab-humanoid |
7f1a5f3a892ee030e5b7af7eb6d392cd0cdfcb52 | 2,619 | cc | C++ | http/hpack/dynamic_metadata.cc | larrystd/muduohttp | 7ba68e4359b520598f6a2c3d81ab810f5e737336 | [
"Apache-2.0"
] | 2 | 2021-01-08T09:49:55.000Z | 2021-09-29T04:25:43.000Z | src/hpack/dynamic_metadata.cc | shadow-yuan/libhttp2 | fa5fbca9a3fd836bb40b53ef51b6dc4cc53995d1 | [
"Apache-2.0"
] | null | null | null | src/hpack/dynamic_metadata.cc | shadow-yuan/libhttp2 | fa5fbca9a3fd836bb40b53ef51b6dc4cc53995d1 | [
"Apache-2.0"
] | null | null | null | #include "src/hpack/dynamic_metadata.h"
#include <stdio.h>
namespace hpack {
dynamic_metadata_table::dynamic_metadata_table(uint32_t default_max_size)
: _max_table_size_limit(default_max_size)
, _max_table_size(default_max_size)
, _current_table_size(0) {}
dynamic_metadata_table::~dynamic_metadata_table(... | 31.554217 | 120 | 0.686522 | larrystd |
7f2521eb29df63e21370b3dec11b7776024f2e48 | 1,059 | cpp | C++ | backup/2/codesignal/c++/number-minimization.cpp | yangyanzhan/code-camp | 4272564e916fc230a4a488f92ae32c07d355dee0 | [
"Apache-2.0"
] | 21 | 2019-11-16T19:08:35.000Z | 2021-11-12T12:26:01.000Z | backup/2/codesignal/c++/number-minimization.cpp | yangyanzhan/code-camp | 4272564e916fc230a4a488f92ae32c07d355dee0 | [
"Apache-2.0"
] | 1 | 2022-02-04T16:02:53.000Z | 2022-02-04T16:02:53.000Z | backup/2/codesignal/c++/number-minimization.cpp | yangyanzhan/code-camp | 4272564e916fc230a4a488f92ae32c07d355dee0 | [
"Apache-2.0"
] | 4 | 2020-05-15T19:39:41.000Z | 2021-10-30T06:40:31.000Z | // Hi, I'm Yanzhan. For more algothmic problems, visit my Youtube Channel (Yanzhan Yang's Youtube Channel) : https://www.youtube.com/channel/UCDkz-__gl3frqLexukpG0DA?view_as=subscriber or my Twitter Account (Yanzhan Yang's Twitter) : https://twitter.com/YangYanzhan or my GitHub HomePage (Yanzhan Yang's GitHub HomePage)... | 48.136364 | 345 | 0.666667 | yangyanzhan |
7f2a0bc5aab40b856864fb0abc9a497f21a7c6b8 | 513 | cpp | C++ | arquivos .h e .cpp/Inimigo.cpp | moises-dias/hunter-adventures | a403bc09d3583005ad689ed2ebbfe1361e678788 | [
"MIT"
] | 2 | 2020-05-26T22:46:48.000Z | 2022-01-12T12:32:06.000Z | arquivos .h e .cpp/Inimigo.cpp | moises-dias/hunter-adventures | a403bc09d3583005ad689ed2ebbfe1361e678788 | [
"MIT"
] | null | null | null | arquivos .h e .cpp/Inimigo.cpp | moises-dias/hunter-adventures | a403bc09d3583005ad689ed2ebbfe1361e678788 | [
"MIT"
] | null | null | null | #include "Inimigo.h"
Inimigo::Inimigo()
{
ID=4;
permiteColisaoChao = true;
permiteColisaoEnt = true;
funcionando=false;
estado = PARADO;
jogadores[0] = NULL;
jogadores[1] = NULL;
colisao = new bool[NUM_COLISOES];
for(int i = 0; i < NUM_COLISOES; i++)
colisao[i] = false;
... | 15.545455 | 43 | 0.608187 | moises-dias |
7f2d66ba25bd22a70f6c3db1d77392c4a176d7c7 | 2,005 | cc | C++ | rst/defer/defer_test.cc | sabbakumov/rst | c0257ab1fb17dea7b022cc4955f715d80a9b32f6 | [
"BSD-2-Clause"
] | 4 | 2016-12-15T13:06:36.000Z | 2022-01-10T16:34:00.000Z | rst/defer/defer_test.cc | sabbakumov/rst | c0257ab1fb17dea7b022cc4955f715d80a9b32f6 | [
"BSD-2-Clause"
] | 103 | 2019-01-24T18:06:35.000Z | 2021-11-02T13:33:34.000Z | rst/defer/defer_test.cc | sabbakumov/rst | c0257ab1fb17dea7b022cc4955f715d80a9b32f6 | [
"BSD-2-Clause"
] | 4 | 2018-04-24T06:59:59.000Z | 2022-02-04T18:10:03.000Z | // Copyright (c) 2017, Sergey Abbakumov
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of condi... | 27.094595 | 73 | 0.709227 | sabbakumov |
b523dcdd72030528b6de09cca417219c83050814 | 23 | cpp | C++ | source/vzero_102/config.cpp | slafi/VoltaZero | c361bf9d4b207364fa43b337f946f2a0d1a8b321 | [
"MIT"
] | null | null | null | source/vzero_102/config.cpp | slafi/VoltaZero | c361bf9d4b207364fa43b337f946f2a0d1a8b321 | [
"MIT"
] | null | null | null | source/vzero_102/config.cpp | slafi/VoltaZero | c361bf9d4b207364fa43b337f946f2a0d1a8b321 | [
"MIT"
] | null | null | null |
#include "config.h"
| 5.75 | 19 | 0.608696 | slafi |
b5246043ed8422f371130d3f0d5c34c87eb326ec | 3,915 | cpp | C++ | src/simulation/FindBoundingBoxOperation.cpp | citron0xa9/FluidSim | 2c2c3ac15b0bfa60bf40a8aebff1010309a65029 | [
"MIT"
] | 1 | 2016-05-26T13:07:34.000Z | 2016-05-26T13:07:34.000Z | src/simulation/FindBoundingBoxOperation.cpp | citron0xa9/FluidSim | 2c2c3ac15b0bfa60bf40a8aebff1010309a65029 | [
"MIT"
] | null | null | null | src/simulation/FindBoundingBoxOperation.cpp | citron0xa9/FluidSim | 2c2c3ac15b0bfa60bf40a8aebff1010309a65029 | [
"MIT"
] | null | null | null |
#include "FindBoundingBoxOperation.h"
#include "ParticleSystem.h"
#include <cassert>
FindBoundingBoxOperation::FindBoundingBoxOperation(ParticleSystem& parent,
const std::vector<std::reference_wrapper<ParticleSystem>>& respectedParticleSystems,
const std::vector<std::reference_wrapper<RigidBodySim>>& respec... | 35.27027 | 112 | 0.723116 | citron0xa9 |
b527d652b3ebf0bed3b67d1cfe19c7c6e60baeb6 | 1,700 | cpp | C++ | src/Engine/Geometry/MathFunctions.cpp | Chainsawkitten/Deathcap | 37ed5afccd3113d34612d89c6e6508e8da9a0d7f | [
"MIT"
] | 3 | 2017-09-08T06:05:10.000Z | 2017-10-28T04:22:20.000Z | src/Engine/Geometry/MathFunctions.cpp | Chainsawkitten/Deathcap | 37ed5afccd3113d34612d89c6e6508e8da9a0d7f | [
"MIT"
] | 894 | 2017-08-30T09:57:28.000Z | 2018-01-30T12:35:38.000Z | src/Engine/Geometry/MathFunctions.cpp | Chainsawkitten/LargeGameProjectEngine | 37ed5afccd3113d34612d89c6e6508e8da9a0d7f | [
"MIT"
] | 1 | 2020-11-06T23:59:58.000Z | 2020-11-06T23:59:58.000Z | #include "MathFunctions.hpp"
#include <glm/gtc/quaternion.hpp>
float Geometry::DotQuat(const glm::quat& q1, const glm::quat& q2) {
return q1.x*q2.x + q1.y*q2.y + q1.z*q2.z + q1.w*q2.w;
}
void Geometry::NormalizeQuat(glm::quat& q) {
float d = sqrt(DotQuat(q, q));
if (d >= 0.00001) {
d = 1 / d;
... | 22.666667 | 71 | 0.561176 | Chainsawkitten |
b52f642c514ab34d332991df23ddb22492de0f55 | 1,112 | hpp | C++ | injection.hpp | TomGlint/ANSim | f02edc65a80fbbcf3bc812f4f6841658571c2024 | [
"MIT"
] | null | null | null | injection.hpp | TomGlint/ANSim | f02edc65a80fbbcf3bc812f4f6841658571c2024 | [
"MIT"
] | null | null | null | injection.hpp | TomGlint/ANSim | f02edc65a80fbbcf3bc812f4f6841658571c2024 | [
"MIT"
] | null | null | null | // $Id$
#ifndef _INJECTION_HPP_
#define _INJECTION_HPP_
#include "config_utils.hpp"
using namespace std;
class InjectionProcess
{
protected:
long long int _nodes;
double _rate;
InjectionProcess(long long int nodes, double rate);
public:
virtual ~InjectionProcess() {}
virtual bool test(long long int sourc... | 22.693878 | 86 | 0.716727 | TomGlint |
b52f7a8c4bae20d4e59cacb17e0d70a79b2a6d3a | 3,670 | hpp | C++ | Bitcoin/le.hpp | 3nprob/clboss | 0435b6c074347ce82e490a5988534054e9d7348d | [
"MIT"
] | 108 | 2020-10-01T17:12:40.000Z | 2022-03-30T09:18:03.000Z | Bitcoin/le.hpp | 3nprob/clboss | 0435b6c074347ce82e490a5988534054e9d7348d | [
"MIT"
] | 94 | 2020-10-03T13:40:30.000Z | 2022-03-30T09:18:00.000Z | Bitcoin/le.hpp | 3nprob/clboss | 0435b6c074347ce82e490a5988534054e9d7348d | [
"MIT"
] | 17 | 2020-10-29T13:27:59.000Z | 2022-03-18T13:05:03.000Z | #ifndef BITCOIN_LE_HPP
#define BITCOIN_LE_HPP
#include"Ln/Amount.hpp"
#include<cstdint>
#include<iostream>
namespace Bitcoin { namespace Detail { class Le16; }}
namespace Bitcoin { namespace Detail { class Le16Const; }}
namespace Bitcoin { namespace Detail { class Le32; }}
namespace Bitcoin { namespace Detail { class... | 23.986928 | 75 | 0.688828 | 3nprob |
b530cac05020f34cbf6f83321b858f6c71ea71d9 | 949 | cpp | C++ | OculusPlatformBP/Source/OculusPlatformBP/Private/OBP_UserAndRoomArray.cpp | InnerLoopLLC/OculusPlatformBP | d4bfb5568c56aa781e2ee76896d69a0ade1f57a2 | [
"MIT"
] | 29 | 2020-10-22T13:46:23.000Z | 2022-03-18T14:32:51.000Z | OculusPlatformBP/Source/OculusPlatformBP/Private/OBP_UserAndRoomArray.cpp | InnerLoopLLC/OculusPlatformBP | d4bfb5568c56aa781e2ee76896d69a0ade1f57a2 | [
"MIT"
] | 2 | 2021-05-06T18:14:39.000Z | 2021-05-25T01:12:15.000Z | OculusPlatformBP/Source/OculusPlatformBP/Private/OBP_UserAndRoomArray.cpp | InnerLoopLLC/OculusPlatformBP | d4bfb5568c56aa781e2ee76896d69a0ade1f57a2 | [
"MIT"
] | null | null | null | // OculusPlatformBP plugin by InnerLoop LLC 2020
#include "OBP_UserAndRoomArray.h"
// --------------------
// Initializers
// --------------------
UOBP_UserAndRoomArray::UOBP_UserAndRoomArray(const FObjectInitializer& ObjectInitializer)
: Super(ObjectInitializer)
{
}
// --------------------
// OVR_UserAndRoomArray... | 24.973684 | 108 | 0.755532 | InnerLoopLLC |
b53258701e2368a14fd035e0b530268b6954082c | 1,357 | cpp | C++ | lib/Builder/FloatsToFloat/FloatsToFloat.cpp | digirea/HIVE | 8896b0cc858c1ad0683888b925f71c0f0d71bf9d | [
"MIT"
] | null | null | null | lib/Builder/FloatsToFloat/FloatsToFloat.cpp | digirea/HIVE | 8896b0cc858c1ad0683888b925f71c0f0d71bf9d | [
"MIT"
] | null | null | null | lib/Builder/FloatsToFloat/FloatsToFloat.cpp | digirea/HIVE | 8896b0cc858c1ad0683888b925f71c0f0d71bf9d | [
"MIT"
] | null | null | null | /**
* @file FloatsToFloat.cpp
* 複数Floatデータ再構築モジュール
*/
#include "FloatsToFloat.h"
/// コンストラクタ
FloatsToFloat::FloatsToFloat(){
m_volume = 0;
}
/**
* BufferVolumeData再構築
* @param volume 再構築対象のBufferVolumeData
* @param offset 再構築対象のバッファオフセット
* @return 作成されたバッファ数
*/
int FloatsToFloat::Create(BufferVolumeDa... | 20.253731 | 66 | 0.613854 | digirea |
b5364184b2fb1afa3a3b89d9b8b077dce5e1eec8 | 2,461 | cpp | C++ | thirdparty/qtvesta/LocalImageLoader.cpp | hoehnp/SpaceDesignTool | 9abd34048274b2ce9dbbb685124177b02d6a34ca | [
"IJG"
] | 6 | 2018-09-05T12:41:59.000Z | 2021-07-01T05:34:23.000Z | thirdparty/qtvesta/LocalImageLoader.cpp | hoehnp/SpaceDesignTool | 9abd34048274b2ce9dbbb685124177b02d6a34ca | [
"IJG"
] | 2 | 2015-02-07T19:09:21.000Z | 2015-08-14T03:15:42.000Z | thirdparty/qtvesta/LocalImageLoader.cpp | hoehnp/SpaceDesignTool | 9abd34048274b2ce9dbbb685124177b02d6a34ca | [
"IJG"
] | 2 | 2015-03-25T15:50:31.000Z | 2017-12-06T12:16:47.000Z | // Copyright (C) 2010 Chris Laurel <claurel@gmail.com>
//
// This file is a part of qtvesta, a set of classes for using
// the VESTA library with the Qt framework.
//
// qtvesta is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the ... | 25.905263 | 88 | 0.576189 | hoehnp |
b53931b37d620011083a7ce995bef5b64e02b70f | 1,459 | cpp | C++ | Chapter_5_Mathematics/Number_Theory/kattis_pascal.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | 2 | 2021-12-29T04:12:59.000Z | 2022-03-30T09:32:19.000Z | Chapter_5_Mathematics/Number_Theory/kattis_pascal.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | null | null | null | Chapter_5_Mathematics/Number_Theory/kattis_pascal.cpp | BrandonTang89/CP4_Code | 5114471f439978dd11f6f2cbf6af20ca654593da | [
"MIT"
] | 1 | 2022-03-01T06:12:46.000Z | 2022-03-01T06:12:46.000Z | /* Kattis - pascal
The function given stops at the largest divisor of n. This is n/i where i is the smallest prime
factor of n. So after doing sieve, we just find the first prime factor of n (<= sqrt n).
If we still cannot find such a factor. N is prime, so we ouput n-1. Else if n == 1, just output 0.
Time: O(1e6 lo... | 23.532258 | 98 | 0.557916 | BrandonTang89 |
b53b6683e8416118684cd9d7a6d3d5a8de4a4f64 | 2,135 | cpp | C++ | source/RenderColorMap.cpp | xzrunner/painting2 | c16e0133adf27a877b40b8fce642b5a42e043d09 | [
"MIT"
] | null | null | null | source/RenderColorMap.cpp | xzrunner/painting2 | c16e0133adf27a877b40b8fce642b5a42e043d09 | [
"MIT"
] | null | null | null | source/RenderColorMap.cpp | xzrunner/painting2 | c16e0133adf27a877b40b8fce642b5a42e043d09 | [
"MIT"
] | null | null | null | #include "painting2/RenderColorMap.h"
namespace pt2
{
static const pt0::Color R_IDENTITY(255, 0, 0, 0);
static const pt0::Color G_IDENTITY(0, 255, 0, 0);
static const pt0::Color B_IDENTITY(0, 0, 255, 0);
static const float INV_255 = 1.0f / 255;
RenderColorMap::RenderColorMap()
: rmap(255, 0, 0, 0)
, gmap(0, 255, 0... | 26.6875 | 102 | 0.608431 | xzrunner |
b53d8742434867cb3aeac03975006a7247581f97 | 1,483 | cpp | C++ | atcoder/abc/abc116/d.cpp | yu3mars/proconVSCodeGcc | fcf36165bb14fb6f555664355e05dd08d12e426b | [
"MIT"
] | null | null | null | atcoder/abc/abc116/d.cpp | yu3mars/proconVSCodeGcc | fcf36165bb14fb6f555664355e05dd08d12e426b | [
"MIT"
] | null | null | null | atcoder/abc/abc116/d.cpp | yu3mars/proconVSCodeGcc | fcf36165bb14fb6f555664355e05dd08d12e426b | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
int dx4[4] = {1,0,-1,0}, dy4[4] = {0,1,... | 23.539683 | 60 | 0.473365 | yu3mars |
b55b80c61d2b6d2a8ed6b3c0358267840425bee3 | 1,172 | cpp | C++ | 2021/day2/main.cpp | bielskij/AOC-2019 | e98d660412037b3fdac4a6b49adcb9230f518c99 | [
"MIT"
] | null | null | null | 2021/day2/main.cpp | bielskij/AOC-2019 | e98d660412037b3fdac4a6b49adcb9230f518c99 | [
"MIT"
] | null | null | null | 2021/day2/main.cpp | bielskij/AOC-2019 | e98d660412037b3fdac4a6b49adcb9230f518c99 | [
"MIT"
] | null | null | null | #include "common/types.h"
#include "utils/file.h"
#include "utils/utils.h"
#define DEBUG_LEVEL 5
#include "common/debug.h"
int main(int argc, char *argv[]) {
auto lines = File::readAllLines(argv[1]);
{
Point3d<int> pos;
for (auto &r : lines) {
int val;
if (sscanf(r.c_str(), "forward %d", &val) == 1) {... | 19.213115 | 56 | 0.524744 | bielskij |
b5696a6bbc80994055fcbcf5d858e7df0afdde2f | 220 | cpp | C++ | E9_tabelline tra 2 e 10.cpp | LeccaMelo/informatica_3 | dcb30e3277d238bbe2dbbadeda40df20b6971b40 | [
"MIT"
] | null | null | null | E9_tabelline tra 2 e 10.cpp | LeccaMelo/informatica_3 | dcb30e3277d238bbe2dbbadeda40df20b6971b40 | [
"MIT"
] | null | null | null | E9_tabelline tra 2 e 10.cpp | LeccaMelo/informatica_3 | dcb30e3277d238bbe2dbbadeda40df20b6971b40 | [
"MIT"
] | 2 | 2016-11-24T08:29:36.000Z | 2017-04-20T13:59:28.000Z | #include<stdio.h>
main()
{
int N;
int L;
int I;
int tab;
N=2;
L=0;
while(L<=7){
N=N+1;
I=1;
while(I<=10){
tab=N*I;
printf("%d",tab);
I++;
}
L++;
printf("\n");
}
}
| 9.565217 | 21 | 0.377273 | LeccaMelo |
b573236b227067155c8346752b604e095ac88978 | 395 | cpp | C++ | Clase_17_DynamicProgramming/fibonacci.cpp | EdgarEspinozaPE/ProgramacionCompetitivaA | 53c3eb3e2bc9f1dd1033e0c24b0cb24f96def1e9 | [
"BSD-3-Clause"
] | null | null | null | Clase_17_DynamicProgramming/fibonacci.cpp | EdgarEspinozaPE/ProgramacionCompetitivaA | 53c3eb3e2bc9f1dd1033e0c24b0cb24f96def1e9 | [
"BSD-3-Clause"
] | null | null | null | Clase_17_DynamicProgramming/fibonacci.cpp | EdgarEspinozaPE/ProgramacionCompetitivaA | 53c3eb3e2bc9f1dd1033e0c24b0cb24f96def1e9 | [
"BSD-3-Clause"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
long fibonacci(long n) {
if (n <= 1)
return n;
return fibonacci(n - 1) + fibonacci(n - 2);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
n = 8;
cout << fibonac... | 14.107143 | 45 | 0.56962 | EdgarEspinozaPE |
b573beae4f1fc4de07c059fe5805cfa80a3798ec | 20,314 | cpp | C++ | src/main/VRMain.cpp | jtveite/MinVR | 7a4f26371d434096388840ed61bea9dcd3527167 | [
"BSD-3-Clause"
] | null | null | null | src/main/VRMain.cpp | jtveite/MinVR | 7a4f26371d434096388840ed61bea9dcd3527167 | [
"BSD-3-Clause"
] | null | null | null | src/main/VRMain.cpp | jtveite/MinVR | 7a4f26371d434096388840ed61bea9dcd3527167 | [
"BSD-3-Clause"
] | null | null | null | #include <main/VRMain.h>
#include <stdio.h>
#ifdef WIN32
#include <windows.h>
#else
#include <unistd.h>
#endif
#include <display/VRConsoleNode.h>
#include <display/VRGraphicsWindowNode.h>
#include <display/VRGroupNode.h>
#include <display/VROffAxisProjectionNode.h>
#include <display/VRStereoNode.h>
#include <display/... | 33.744186 | 257 | 0.651177 | jtveite |
b583c4962b4ea41a97bb42e9b2db3ad59effcb88 | 2,533 | cpp | C++ | HDUOJ/1253/bfs_priority_queue.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | 2 | 2018-02-14T01:59:31.000Z | 2018-03-28T03:30:45.000Z | HDUOJ/1253/bfs_priority_queue.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | null | null | null | HDUOJ/1253/bfs_priority_queue.cpp | codgician/ACM | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | [
"MIT"
] | 2 | 2017-12-30T02:46:35.000Z | 2018-03-28T03:30:49.000Z | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <iomanip>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define SIZE 51
using namespace std;
typedef struct _Node
{
int x, y, z;
int step;
bool op... | 25.079208 | 225 | 0.498223 | codgician |
b5872c559be2f727bea7f9a26a80ad5a79fee6e4 | 5,850 | cpp | C++ | project3/main.cpp | Inscrupulous/CPE212 | cc4462d5c42ce16894b79117ef88111e728e098c | [
"Apache-2.0"
] | null | null | null | project3/main.cpp | Inscrupulous/CPE212 | cc4462d5c42ce16894b79117ef88111e728e098c | [
"Apache-2.0"
] | null | null | null | project3/main.cpp | Inscrupulous/CPE212 | cc4462d5c42ce16894b79117ef88111e728e098c | [
"Apache-2.0"
] | null | null | null | #include "classroom.hpp"
#include "list.hpp"
#include "student.hpp"
#include <iostream>
#include <fstream>
#include <string>
List<Assignment> ReadGradesFile(const std::string &file, bool &successful)
{
std::ifstream infile;
List<Assignment> list;
infile.open(file.c_str());
if(!infile.is_open())
{... | 27.209302 | 88 | 0.372479 | Inscrupulous |
b58755b8a9838713b6b8f0f13d7fb510d9481f0a | 1,929 | cpp | C++ | mr.Sadman/Classes/GameAct/Objects/Physical/Radiation.cpp | 1pkg/dump | 0ee579cb6a97ae64d5367cc624b2407d7d4b1c7b | [
"MIT"
] | null | null | null | mr.Sadman/Classes/GameAct/Objects/Physical/Radiation.cpp | 1pkg/dump | 0ee579cb6a97ae64d5367cc624b2407d7d4b1c7b | [
"MIT"
] | 3 | 2020-12-11T10:01:27.000Z | 2022-02-13T22:12:05.000Z | mr.Sadman/Classes/GameAct/Objects/Tech/Radiation.cpp | 1pkg/dump | 0ee579cb6a97ae64d5367cc624b2407d7d4b1c7b | [
"MIT"
] | null | null | null | #include "Radiation.hpp"
#include "Game/Levels/Chunk.hpp"
namespace Objects
{
namespace Tech
{
Radiation::Radiation()
: _particle( cocos2d::ParticleFlower::create() )
{
}
Radiation::~Radiation()
{
_particle->removeFromParentAndCleanup( true );
}
void
Radiation::initialize()
{
_particle->se... | 20.741935 | 80 | 0.692068 | 1pkg |
b58b30b20f882aa1a826cb6d0ec1392f72947038 | 1,860 | hpp | C++ | src/interfaces/IConnection.hpp | LesGameDevToolsMagique/MagiqueMessenger | 66c502b9b97f0a8761114f7b601216005a73e907 | [
"MIT"
] | null | null | null | src/interfaces/IConnection.hpp | LesGameDevToolsMagique/MagiqueMessenger | 66c502b9b97f0a8761114f7b601216005a73e907 | [
"MIT"
] | null | null | null | src/interfaces/IConnection.hpp | LesGameDevToolsMagique/MagiqueMessenger | 66c502b9b97f0a8761114f7b601216005a73e907 | [
"MIT"
] | null | null | null | //
// Created by Jean-Antoine Dupont on 14/03/2016.
//
#ifndef __ICONNECTION_HPP__
#define __ICONNECTION_HPP__
#include <string> // std::string
#include <sys/types.h> // socket - bind - listen - accept
#include <sys/socket.h> // socket - bind - listen - accept
#include <netinet/in.h> //... | 33.214286 | 126 | 0.509677 | LesGameDevToolsMagique |
b58ca32dca61b144c57673c4278aacc0c201fa28 | 2,138 | cpp | C++ | C++/freeCodeCamp.org_C++ Tutorial for Beginners/src/025_Constructor Functions/ConstructorFunctions.cpp | JCOCA-Tech/coding-2021 | 180f8cd8830abf386dcd2399309a1b203a22ee3b | [
"MIT"
] | 1 | 2021-10-14T02:26:41.000Z | 2021-10-14T02:26:41.000Z | C++/freeCodeCamp.org_C++ Tutorial for Beginners/src/025_Constructor Functions/ConstructorFunctions.cpp | JCOCA-Tech/coding-2021 | 180f8cd8830abf386dcd2399309a1b203a22ee3b | [
"MIT"
] | null | null | null | C++/freeCodeCamp.org_C++ Tutorial for Beginners/src/025_Constructor Functions/ConstructorFunctions.cpp | JCOCA-Tech/coding-2021 | 180f8cd8830abf386dcd2399309a1b203a22ee3b | [
"MIT"
] | null | null | null | #include <iostream>
/* Simple C++ program that uses constructor functions */
using namespace std;
class Book // A class is a custom datatype template or blueprint
{
public:
string title;
string author;
int pages;
Book(string aTitle, string aAuthor, int aPages) // constructor usin... | 29.287671 | 130 | 0.552853 | JCOCA-Tech |
b58ced8e2150447e03387a46dcfa56f66b7c428c | 1,122 | cpp | C++ | gearoenix/render/camera/gx-rnd-cmr-manager.cpp | Hossein-Noroozpour/gearoenix | c8fa8b8946c03c013dad568d6d7a97d81097c051 | [
"BSD-Source-Code"
] | 35 | 2018-01-07T02:34:38.000Z | 2022-02-09T05:19:03.000Z | gearoenix/render/camera/gx-rnd-cmr-manager.cpp | Hossein-Noroozpour/gearoenix | c8fa8b8946c03c013dad568d6d7a97d81097c051 | [
"BSD-Source-Code"
] | 111 | 2017-09-20T09:12:36.000Z | 2020-12-27T12:52:03.000Z | gearoenix/render/camera/gx-rnd-cmr-manager.cpp | Hossein-Noroozpour/gearoenix | c8fa8b8946c03c013dad568d6d7a97d81097c051 | [
"BSD-Source-Code"
] | 5 | 2020-02-11T11:17:37.000Z | 2021-01-08T17:55:43.000Z | #include "gx-rnd-cmr-manager.hpp"
#include "../engine/gx-rnd-eng-engine.hpp"
#include "gx-rnd-cmr-orthographic.hpp"
#include "gx-rnd-cmr-perspective.hpp"
gearoenix::render::camera::Manager::Manager(std::unique_ptr<system::stream::Stream> s, engine::Engine* const e) noexcept
: e(e)
, cache(std::move(s))
{
}
st... | 37.4 | 160 | 0.605169 | Hossein-Noroozpour |
b5904cc1966466510355afdcd9748a21457091d2 | 51,465 | cpp | C++ | proj.android/Photon-AndroidNDK_SDK/LoadBalancing-cpp/src/Client.cpp | h-iwata/MultiplayPaint | b170ec60bdda93c041ef59625ac2d6eba54d0335 | [
"MIT"
] | 1 | 2016-05-31T22:56:26.000Z | 2016-05-31T22:56:26.000Z | proj.ios_mac/Photon-iOS_SDK/LoadBalancing-cpp/src/Client.cpp | h-iwata/MultiplayPaint | b170ec60bdda93c041ef59625ac2d6eba54d0335 | [
"MIT"
] | null | null | null | proj.ios_mac/Photon-iOS_SDK/LoadBalancing-cpp/src/Client.cpp | h-iwata/MultiplayPaint | b170ec60bdda93c041ef59625ac2d6eba54d0335 | [
"MIT"
] | null | null | null | /* Exit Games Photon LoadBalancing - C++ Client Lib
* Copyright (C) 2004-2015 by Exit Games GmbH. All rights reserved.
* http://www.exitgames.com
* mailto:developer@exitgames.com
*/
#include "LoadBalancing-cpp/inc/Client.h"
#include "LoadBalancing-cpp/inc/Enums/CustomAuthenticationType.h"
#include "LoadBal... | 38.4354 | 339 | 0.712426 | h-iwata |
b59135669105fd4a36aa4c9375d01013c66f8760 | 934 | cpp | C++ | Searching/Linear_search.cpp | calmesam01/Algorithms | c3b137b0c0bbd43cb542b12e0d8a6f91a3c06138 | [
"MIT"
] | 5 | 2017-05-19T12:21:19.000Z | 2021-12-09T10:35:37.000Z | Searching/Linear_search.cpp | calmesam01/Algorithms | c3b137b0c0bbd43cb542b12e0d8a6f91a3c06138 | [
"MIT"
] | null | null | null | Searching/Linear_search.cpp | calmesam01/Algorithms | c3b137b0c0bbd43cb542b12e0d8a6f91a3c06138 | [
"MIT"
] | 1 | 2017-06-25T14:16:00.000Z | 2017-06-25T14:16:00.000Z | /*Linear search algo to search all the elements linearly
Author = Satyam
Complexity = O(n)
*/
//Adding Header files
#include<iostream>
//Setting std namespace
using namespace std;
//Main function started
int main(){
//Declaring variables
int n,arr[50],element;
bool a=false;
cout << "How many... | 21.227273 | 67 | 0.542827 | calmesam01 |
b592ac04d0c6e8556a31843c576619a0e3b4a3bb | 8,404 | cpp | C++ | source/Library/Numeric/LongInt.cpp | dracc/VCMP-SqMod | d3e6adea147f5b2cae5119ddd6028833aa625c09 | [
"MIT"
] | null | null | null | source/Library/Numeric/LongInt.cpp | dracc/VCMP-SqMod | d3e6adea147f5b2cae5119ddd6028833aa625c09 | [
"MIT"
] | null | null | null | source/Library/Numeric/LongInt.cpp | dracc/VCMP-SqMod | d3e6adea147f5b2cae5119ddd6028833aa625c09 | [
"MIT"
] | null | null | null | // ------------------------------------------------------------------------------------------------
#include "Library/Numeric/LongInt.hpp"
#include "Library/Numeric/Random.hpp"
#include "Base/Shared.hpp"
#include "Base/DynArg.hpp"
// -------------------------------------------------------------------------------------... | 42.444444 | 149 | 0.486435 | dracc |
b5976e5b63e16087f73c50ef909cff93f019e8ee | 3,604 | cpp | C++ | 160. Intersection of Two Linked Lists.cpp | NeoYY/Leetcode-Solution | 0f067973d3c296ac7f2fa85a89dbdd5295b0b037 | [
"MIT"
] | null | null | null | 160. Intersection of Two Linked Lists.cpp | NeoYY/Leetcode-Solution | 0f067973d3c296ac7f2fa85a89dbdd5295b0b037 | [
"MIT"
] | null | null | null | 160. Intersection of Two Linked Lists.cpp | NeoYY/Leetcode-Solution | 0f067973d3c296ac7f2fa85a89dbdd5295b0b037 | [
"MIT"
] | null | null | null | /*
Write a program to find the node at which the intersection of two singly linked lists begins.
For example, the following two linked lists:
begin to intersect at node c1.
Example 1:
Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with val... | 27.937984 | 307 | 0.549945 | NeoYY |
b598a37351cc6a8f1b27572dc377a2b943fccdec | 702 | cpp | C++ | src/Main.cpp | PetokLorand/ETL | 9aebbd4044a1604813163b1104aa5d4d017befa9 | [
"MIT"
] | null | null | null | src/Main.cpp | PetokLorand/ETL | 9aebbd4044a1604813163b1104aa5d4d017befa9 | [
"MIT"
] | null | null | null | src/Main.cpp | PetokLorand/ETL | 9aebbd4044a1604813163b1104aa5d4d017befa9 | [
"MIT"
] | null | null | null | #include <iostream>
#include "ExpressionTemplates.hpp"
#include "Argument.hpp"
class Scalar
: public et::BaseExpression<Scalar>
, public et::AdditionExpressionGenerator<Scalar>
{
public:
Scalar(int value) : m_value(value) {}
et::Int32Expression operator()(auto&&) { return m_value; }
private:
int... | 18.972973 | 62 | 0.579772 | PetokLorand |
b59d061bdf40f8b2cf48f1fd6efb78107245da4a | 6,542 | cc | C++ | modules/drivers/apriltags/april_tags.cc | positionering/apollo | 53d961f054f8a1c2e647337d5b0108985e289d38 | [
"Apache-2.0"
] | 1 | 2019-05-14T18:36:40.000Z | 2019-05-14T18:36:40.000Z | modules/drivers/apriltags/april_tags.cc | positionering/apollo | 53d961f054f8a1c2e647337d5b0108985e289d38 | [
"Apache-2.0"
] | null | null | null | modules/drivers/apriltags/april_tags.cc | positionering/apollo | 53d961f054f8a1c2e647337d5b0108985e289d38 | [
"Apache-2.0"
] | null | null | null | /******************************************************************************
* Copyright 2018 The Apollo Authors. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
... | 30.427907 | 108 | 0.594314 | positionering |
b5a06157c1baed2af9b30832f44c7454a5951ec9 | 403 | cpp | C++ | duration.cpp | kuldeep3/C-Programming- | 86db928902c752434cce417eae846d6a6384ae31 | [
"MIT"
] | 1 | 2019-09-14T17:59:11.000Z | 2019-09-14T17:59:11.000Z | duration.cpp | kuldeep3/C-Programming- | 86db928902c752434cce417eae846d6a6384ae31 | [
"MIT"
] | null | null | null | duration.cpp | kuldeep3/C-Programming- | 86db928902c752434cce417eae846d6a6384ae31 | [
"MIT"
] | 3 | 2019-10-01T15:51:17.000Z | 2019-10-02T16:31:08.000Z | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
while (n--)
{
int sh,sm,eh,em,min,hr;
cin>>sh>>sm>>eh>>em;
if (em<sm)
{
em = em+60;
min = em-sm;
eh = eh - 1;
}
else
{
min = ... | 16.12 | 33 | 0.334988 | kuldeep3 |
b5a0d7048547191ff3f7eeabb7147f26ef9b0c1b | 5,403 | cpp | C++ | libs/unicode/src/utf/utf32_codecvt.cpp | cordarei/boost-unicode | edfe39ff623c286cb157c7495ffeeee4dfd2d319 | [
"BSL-1.0"
] | 1 | 2019-02-26T07:46:39.000Z | 2019-02-26T07:46:39.000Z | libs/unicode/src/utf/utf32_codecvt.cpp | cordarei/boost-unicode | edfe39ff623c286cb157c7495ffeeee4dfd2d319 | [
"BSL-1.0"
] | null | null | null | libs/unicode/src/utf/utf32_codecvt.cpp | cordarei/boost-unicode | edfe39ff623c286cb157c7495ffeeee4dfd2d319 | [
"BSL-1.0"
] | null | null | null | // Define a UTF-32 codecvt fact.
// Though this file is under the Boost license, it is NOT (or not yet) part of
// Boost!
// Copyright Graham Barnett, Rogier van Dalen 2005.
// Use, modification, and distribution are subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy ... | 23.38961 | 78 | 0.646863 | cordarei |
b5a286fc25c9eeb226960bc335240f45d42b2bf0 | 16,543 | cc | C++ | cpp/tests/test-config-load.cc | peurpdapeurp/ndnrtc | 59552bff9398ee2e49636f32cac020cc8027ae04 | [
"BSD-2-Clause"
] | null | null | null | cpp/tests/test-config-load.cc | peurpdapeurp/ndnrtc | 59552bff9398ee2e49636f32cac020cc8027ae04 | [
"BSD-2-Clause"
] | null | null | null | cpp/tests/test-config-load.cc | peurpdapeurp/ndnrtc | 59552bff9398ee2e49636f32cac020cc8027ae04 | [
"BSD-2-Clause"
] | null | null | null | //
// test-config-load.cc
//
// Created by Peter Gusev on 02 March 2016.
// Copyright 2013-2016 Regents of the University of California
//
#include <stdlib.h>
#include "gtest/gtest.h"
#include "client/src/config.hpp"
#define TEST_CONFIG_FILE "tests/default.cfg"
#define TEST_CONFIG_SAMPLE_CONSUMER_FILE "tests/samp... | 47.950725 | 111 | 0.75603 | peurpdapeurp |
b5a3696b833329118c2f39e01cf650d0a845c223 | 13,853 | cpp | C++ | kinesis-video-producer/src/CachingEndpointOnlyCallbackProvider.cpp | nsharma098/amazon-kinesis-video-streams-producer-sdk-cpp | e3b63724494b16e00079027ccc232e8914731d66 | [
"Apache-2.0"
] | null | null | null | kinesis-video-producer/src/CachingEndpointOnlyCallbackProvider.cpp | nsharma098/amazon-kinesis-video-streams-producer-sdk-cpp | e3b63724494b16e00079027ccc232e8914731d66 | [
"Apache-2.0"
] | null | null | null | kinesis-video-producer/src/CachingEndpointOnlyCallbackProvider.cpp | nsharma098/amazon-kinesis-video-streams-producer-sdk-cpp | e3b63724494b16e00079027ccc232e8914731d66 | [
"Apache-2.0"
] | null | null | null | /** Copyright 2019 Amazon.com. All rights reserved. */
#include "CachingEndpointOnlyCallbackProvider.h"
#include "Version.h"
#include "Logger.h"
namespace com { namespace amazonaws { namespace kinesis { namespace video {
LOGGER_TAG("com.amazonaws.kinesis.video");
using std::move;
using std::unique_ptr;
using std::m... | 42.888545 | 129 | 0.687216 | nsharma098 |
b286bf50a799ff50d525c2e34404edef583f241b | 2,593 | cpp | C++ | Dx11/Rendering/MeshSDF.cpp | stoyannk/dx11-framework | 1f1ce560d7c80f9e05f39479c316761f54c5cf12 | [
"BSD-2-Clause"
] | 18 | 2015-12-07T16:08:27.000Z | 2020-02-11T12:30:36.000Z | Dx11/Rendering/MeshSDF.cpp | stoyannk/dx11-framework | 1f1ce560d7c80f9e05f39479c316761f54c5cf12 | [
"BSD-2-Clause"
] | null | null | null | Dx11/Rendering/MeshSDF.cpp | stoyannk/dx11-framework | 1f1ce560d7c80f9e05f39479c316761f54c5cf12 | [
"BSD-2-Clause"
] | 8 | 2017-02-18T01:30:57.000Z | 2022-01-03T22:41:11.000Z | // Copyright (c) 2011-2014, Stoyan Nikolov
// All rights reserved.
// This software is governed by a permissive BSD-style license. See LICENSE.
#include "stdafx.h"
#include "MeshSDF.h"
#include "MathConv.h"
#include <numeric>
#include <utility>
#include <ThirdParty/glm/glm/gtc/matrix_transform.hpp>
using n... | 26.731959 | 105 | 0.651755 | stoyannk |
b286d01b53be9c52bfc2956d5a1f098dc9dfd065 | 3,167 | hh | C++ | src/Kernel/SphericalTableKernel.hh | jmikeowen/Spheral | 3e1082a7aefd6b328bd3ae24ca1a477108cfc3c4 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 22 | 2018-07-31T21:38:22.000Z | 2020-06-29T08:58:33.000Z | src/Kernel/SphericalTableKernel.hh | jmikeowen/Spheral | 3e1082a7aefd6b328bd3ae24ca1a477108cfc3c4 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 41 | 2020-09-28T23:14:27.000Z | 2022-03-28T17:01:33.000Z | src/Kernel/SphericalTableKernel.hh | jmikeowen/Spheral | 3e1082a7aefd6b328bd3ae24ca1a477108cfc3c4 | [
"BSD-Source-Code",
"BSD-3-Clause-LBNL",
"FSFAP"
] | 7 | 2019-12-01T07:00:06.000Z | 2020-09-15T21:12:39.000Z | //---------------------------------Spheral++----------------------------------//
// SphericalTableKernel
//
// Take a 3D Kernel and build a specialized 1D tabulated version appropriate
// for use with the spherical SPH algorithm described in
// Omang, M., Børve, S., & Trulsen, J. (2006). SPH in spherical and cylindrica... | 34.802198 | 113 | 0.688033 | jmikeowen |
b28953c094397a1814b6e0fd88971a0252e2e957 | 2,851 | hpp | C++ | thread/mrsw.hpp | aconstlink/snakeoil | 3c6e02655e1134f8422f01073090efdde80fc109 | [
"MIT"
] | 1 | 2017-08-11T19:12:24.000Z | 2017-08-11T19:12:24.000Z | thread/mrsw.hpp | aconstlink/snakeoil | 3c6e02655e1134f8422f01073090efdde80fc109 | [
"MIT"
] | 11 | 2018-07-07T20:09:44.000Z | 2020-02-16T22:45:09.000Z | thread/mrsw.hpp | aconstlink/snakeoil | 3c6e02655e1134f8422f01073090efdde80fc109 | [
"MIT"
] | null | null | null | #pragma once
#include "semaphore.hpp"
namespace so_thread
{
/// multi-reader single-writer
class mrsw
{
so_this_typedefs( mrsw ) ;
private:
semaphore_t _reader ;
semaphore_t _writer ;
public:
mrsw( void_t ) noexcept
{
}
mrsw( this_rref_t... | 22.100775 | 68 | 0.507892 | aconstlink |
b28dc718841c241ea9a019d26d8244e16ef3d074 | 13,133 | cpp | C++ | Code/Projects/Eldritch/src/Components/wbcompeldfrobbable.cpp | kas1e/Eldritch | 032b4ac52f7508c89efa407d6fe60f40c6281fd9 | [
"Zlib"
] | null | null | null | Code/Projects/Eldritch/src/Components/wbcompeldfrobbable.cpp | kas1e/Eldritch | 032b4ac52f7508c89efa407d6fe60f40c6281fd9 | [
"Zlib"
] | null | null | null | Code/Projects/Eldritch/src/Components/wbcompeldfrobbable.cpp | kas1e/Eldritch | 032b4ac52f7508c89efa407d6fe60f40c6281fd9 | [
"Zlib"
] | null | null | null | #include "core.h"
#include "wbcompeldfrobbable.h"
#include "aabb.h"
#include "wbcompeldtransform.h"
#include "wbcompeldcollision.h"
#include "wbcompeldmesh.h"
#include "wbentity.h"
#include "eldritchframework.h"
#include "irenderer.h"
#include "configmanager.h"
#include "wbeventmanager.h"
#include "eldritchmesh.h"
#inc... | 31.120853 | 80 | 0.727404 | kas1e |
b29103fbb0fe79d08cd96b498067621f8d948f9a | 987 | cpp | C++ | Sort strings based on position value.cpp | dishanp/Coding-In-C-and-Cpp | bb615c8c524920f1b0bcbadf1c8b9328aa83616a | [
"BSD-2-Clause"
] | 2 | 2021-10-01T04:20:04.000Z | 2021-10-01T04:20:06.000Z | Sort strings based on position value.cpp | dishanp/Coding-In-C-and-Cpp | bb615c8c524920f1b0bcbadf1c8b9328aa83616a | [
"BSD-2-Clause"
] | null | null | null | Sort strings based on position value.cpp | dishanp/Coding-In-C-and-Cpp | bb615c8c524920f1b0bcbadf1c8b9328aa83616a | [
"BSD-2-Clause"
] | 8 | 2021-10-01T04:20:38.000Z | 2022-03-19T17:05:05.000Z | /*
Write a function sortStringByValue() which takes in a list of strings and sort them according
to the sum of the positional value of the alphabets where position of a is 1, b is 2, c is 3.....etc.
till z=26. Alphabets are not ----- character other than alphabets (upper and lower case) should
not be considered for po... | 24.073171 | 101 | 0.666667 | dishanp |
b291e943f232b65823824b1c3d221b10af839b94 | 6,169 | hpp | C++ | octotiger/radiation/kernel_interface.hpp | srinivasyadav18/octotiger | 4d93c50fe345a081b7985ecb4cb698d16c121565 | [
"BSL-1.0"
] | 35 | 2016-11-17T22:35:11.000Z | 2022-01-24T19:07:36.000Z | octotiger/radiation/kernel_interface.hpp | srinivasyadav18/octotiger | 4d93c50fe345a081b7985ecb4cb698d16c121565 | [
"BSL-1.0"
] | 123 | 2016-11-17T21:29:25.000Z | 2022-03-03T21:40:04.000Z | octotiger/radiation/kernel_interface.hpp | srinivasyadav18/octotiger | 4d93c50fe345a081b7985ecb4cb698d16c121565 | [
"BSL-1.0"
] | 10 | 2018-11-28T18:17:42.000Z | 2022-01-25T12:52:37.000Z | // Copyright (c) 2019 AUTHORS
//
// 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)
#pragma once
#include "octotiger/defs.hpp"
#include "octotiger/radiation/cpu_kernel.hpp"
#include "octotiger/radiation/cuda_kerne... | 33.166667 | 84 | 0.53088 | srinivasyadav18 |
b29334f1c72da4be6685f83f50a5d08dc8779faa | 441 | cpp | C++ | acmicpc.net/2261.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | 4 | 2016-04-15T07:54:39.000Z | 2021-01-11T09:02:16.000Z | acmicpc.net/2261.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | null | null | null | acmicpc.net/2261.cpp | kbu1564/SimpleAlgorithm | 7e5b0d2fe19461417d88de0addd2235da55787d3 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
struct point {
int x, y;
bool operator<(const point& p) {
return x < p.x || (x == p.x && y < p.y);
}
};
set<point> xy;
int main() {
int N; scanf("%d", &N);
for (int i = 0; i < N; i++) {... | 17.64 | 42 | 0.548753 | kbu1564 |
b294f1c719412818a41f1d4c65ded55c38105469 | 1,982 | cpp | C++ | source/Texture.cpp | Xaer033/Torque | 55ed32b5269e0058121b38e95be19b67e325db6d | [
"MIT"
] | null | null | null | source/Texture.cpp | Xaer033/Torque | 55ed32b5269e0058121b38e95be19b67e325db6d | [
"MIT"
] | null | null | null | source/Texture.cpp | Xaer033/Torque | 55ed32b5269e0058121b38e95be19b67e325db6d | [
"MIT"
] | null | null | null |
#include "Texture.h"
#include "IwGL.h"
#include "IwImage.h"
namespace GG
{
Texture::Texture()
{
_image = NULL;
_handle = 0;
}
Texture::Texture( CIwImage & image )
{
_handle = 0;
setImage( image );
}
Texture::~Texture()
{
//we dont own image, so dont free
_image = NULL;
if( _handle )
glDe... | 16.79661 | 148 | 0.655399 | Xaer033 |
b29735647e323dce1479ed96703f40a43197e0fc | 1,335 | cpp | C++ | Cracking coding Interview/Array and String/URLify.cpp | jv640/Coding | 19bda40200ee1fdcc16bb3dc174fe14c7090b58d | [
"MIT"
] | null | null | null | Cracking coding Interview/Array and String/URLify.cpp | jv640/Coding | 19bda40200ee1fdcc16bb3dc174fe14c7090b58d | [
"MIT"
] | null | null | null | Cracking coding Interview/Array and String/URLify.cpp | jv640/Coding | 19bda40200ee1fdcc16bb3dc174fe14c7090b58d | [
"MIT"
] | null | null | null | /*
Description : Write a method to replace all spaces in a string with '%20: You may assume that the string has sufficient space at the end to hold the additional characters,
and that you are given the "true" length of the string/
*/
int replaceSpaces(char str[])
{
// count spaces and find curr... | 24.722222 | 174 | 0.484644 | jv640 |
b29cf73236e924e5609aa88ce9dba0bb6ca75816 | 5,744 | cpp | C++ | src/losses.cpp | AvocadoML/ReferenceBackend | 391644beb6eacc1982c23aab6ca5104acae4131e | [
"Apache-2.0"
] | null | null | null | src/losses.cpp | AvocadoML/ReferenceBackend | 391644beb6eacc1982c23aab6ca5104acae4131e | [
"Apache-2.0"
] | null | null | null | src/losses.cpp | AvocadoML/ReferenceBackend | 391644beb6eacc1982c23aab6ca5104acae4131e | [
"Apache-2.0"
] | null | null | null | /*
* losses.cpp
*
* Created on: Nov 25, 2021
* Author: Maciej Kozarzewski
*/
#include <Avocado/reference_backend.h>
#include <Avocado/backend_descriptors.hpp>
#include "utils.hpp"
namespace
{
using namespace avocado::backend;
template<typename T>
T kernel_MSE_loss(const T *output, const T *target, av_i... | 33.011494 | 140 | 0.686281 | AvocadoML |
b2a44270c5ac741c456296b45b733c5670016c8f | 3,458 | h++ | C++ | include/ogonek/segmentation/graphemes.h++ | libogonek/ogonek | 46b7edbf6b7ff89892f5ba25494749b442e771b3 | [
"CC0-1.0"
] | 25 | 2016-10-21T12:37:23.000Z | 2021-02-22T05:46:46.000Z | include/ogonek/segmentation/graphemes.h++ | libogonek/ogonek | 46b7edbf6b7ff89892f5ba25494749b442e771b3 | [
"CC0-1.0"
] | null | null | null | include/ogonek/segmentation/graphemes.h++ | libogonek/ogonek | 46b7edbf6b7ff89892f5ba25494749b442e771b3 | [
"CC0-1.0"
] | 4 | 2016-09-05T10:23:18.000Z | 2020-07-09T19:37:37.000Z | // Ogonek
//
// Written in 2012-2013 by Martinho Fernandes <martinho.fernandes@gmail.com>
//
// To the extent possible under law, the author(s) have dedicated all copyright and related
// and neighboring rights to this software to the public domain worldwide. This software is
// distributed without any warranty.
//
// ... | 37.182796 | 120 | 0.643436 | libogonek |
b2abaced5f1b57ccd0a666a432bb5287208d68b7 | 4,346 | hpp | C++ | include/Matrix3.hpp | CCColda/calcda | 0d30d2d7c0d8c4abdbf7642e8df2879b9ef7b7a0 | [
"MIT"
] | null | null | null | include/Matrix3.hpp | CCColda/calcda | 0d30d2d7c0d8c4abdbf7642e8df2879b9ef7b7a0 | [
"MIT"
] | null | null | null | include/Matrix3.hpp | CCColda/calcda | 0d30d2d7c0d8c4abdbf7642e8df2879b9ef7b7a0 | [
"MIT"
] | null | null | null | #ifndef CALCDA_MATRIX3_H
#define CALCDA_MATRIX3_H
#include <initializer_list> // std::initializer_list
#include "Intrinsic.hpp"
#include "Rotation.hpp" // Calcda::Rotation
#include "Vector2.hpp" // Calcda::Vector2
#include "Vector3.hpp" // Calcda::Vector3
#include <string>
namespace Calcda {
//! @brief Class for... | 28.973333 | 78 | 0.645651 | CCColda |
b2b3634ccfd0f8cf7b428301b2b6bcc576370662 | 5,716 | hpp | C++ | include/smooth/c1.hpp | tgurriet/smooth | c19e35e23c8e0084314726729d0cf6729192240f | [
"MIT"
] | 31 | 2021-07-06T21:05:05.000Z | 2022-02-09T13:26:44.000Z | include/smooth/c1.hpp | tgurriet/smooth | c19e35e23c8e0084314726729d0cf6729192240f | [
"MIT"
] | 23 | 2021-07-07T21:13:49.000Z | 2022-03-19T04:40:37.000Z | include/smooth/c1.hpp | tgurriet/smooth | c19e35e23c8e0084314726729d0cf6729192240f | [
"MIT"
] | 6 | 2021-07-09T07:16:08.000Z | 2022-01-12T14:29:44.000Z | // smooth: Lie Theory for Robotics
// https://github.com/pettni/smooth
//
// Licensed under the MIT License <http://opensource.org/licenses/MIT>.
//
// Copyright (c) 2021 Petter Nilsson
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation fi... | 22.592885 | 88 | 0.647481 | tgurriet |
b2b448081e570f152ecb5186ac7edce3b04d01ba | 3,526 | hpp | C++ | include/edlib/EDP/LocalHamiltonian.hpp | cecri/ExactDiagonalization | a168ed2f60149b1c3e5bd9ae46a5d169aea76773 | [
"MIT"
] | null | null | null | include/edlib/EDP/LocalHamiltonian.hpp | cecri/ExactDiagonalization | a168ed2f60149b1c3e5bd9ae46a5d169aea76773 | [
"MIT"
] | null | null | null | include/edlib/EDP/LocalHamiltonian.hpp | cecri/ExactDiagonalization | a168ed2f60149b1c3e5bd9ae46a5d169aea76773 | [
"MIT"
] | null | null | null | #pragma once
#include <Eigen/Sparse>
namespace edp
{
namespace internal
{
inline uint32_t ipow(uint32_t base, uint32_t exp)
{
uint32_t result = 1U;
while(exp != 0)
{
if((exp & 1U) != 0)
{
result *= base;
}
exp >>= 1U;
... | 27.76378 | 99 | 0.577708 | cecri |
b2b58a468617610f26a94ce21af9b0d8c5a552ee | 7,484 | cpp | C++ | Implementations/content/strings (14)/Heavy/SuffixArrayTest.cpp | wanglawrence9990/USACO | 45c9bce4b3ac77d2a4ba2e646ff45a02563b59d2 | [
"CC0-1.0"
] | null | null | null | Implementations/content/strings (14)/Heavy/SuffixArrayTest.cpp | wanglawrence9990/USACO | 45c9bce4b3ac77d2a4ba2e646ff45a02563b59d2 | [
"CC0-1.0"
] | null | null | null | Implementations/content/strings (14)/Heavy/SuffixArrayTest.cpp | wanglawrence9990/USACO | 45c9bce4b3ac77d2a4ba2e646ff45a02563b59d2 | [
"CC0-1.0"
] | 1 | 2021-07-04T02:36:09.000Z | 2021-07-04T02:36:09.000Z | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef ... | 28.241509 | 94 | 0.563201 | wanglawrence9990 |
b2c369a20d23a70445a99c42cc27e5bd2b1168d8 | 1,193 | cpp | C++ | cpp/src/exercise/e0900/e0892.cpp | ajz34/LeetCodeLearn | 70ff8a3c17199a100819b356735cd9b13ff166a7 | [
"MIT"
] | null | null | null | cpp/src/exercise/e0900/e0892.cpp | ajz34/LeetCodeLearn | 70ff8a3c17199a100819b356735cd9b13ff166a7 | [
"MIT"
] | null | null | null | cpp/src/exercise/e0900/e0892.cpp | ajz34/LeetCodeLearn | 70ff8a3c17199a100819b356735cd9b13ff166a7 | [
"MIT"
] | null | null | null | // https://leetcode-cn.com/problems/surface-area-of-3d-shapes/
#include "extern.h"
class S0892 {
public:
int surfaceArea(vector<vector<int>>& grid) {
if (grid.empty() || grid.front().empty()) return 0;
int r_size = grid.size(), c_size = grid.front().size();
int result = 0;
for (int... | 34.085714 | 73 | 0.50964 | ajz34 |
b2c76d68c287040000c84c2c6f878d977b19a5af | 1,897 | cpp | C++ | SortingAndSearching/SlidingMedian/m2.cpp | 0x5eba/CSES-solutions | c18b66262f5dbef44b58d793f5185c3d0cf3a77c | [
"MIT"
] | 27 | 2019-12-23T21:20:00.000Z | 2022-02-06T04:28:27.000Z | SortingAndSearching/SlidingMedian/m2.cpp | 0x5eba/CSES-solutions | c18b66262f5dbef44b58d793f5185c3d0cf3a77c | [
"MIT"
] | 2 | 2020-04-14T21:40:43.000Z | 2020-09-06T11:15:42.000Z | SortingAndSearching/SlidingMedian/m2.cpp | 0x5eba/CSES-solutions | c18b66262f5dbef44b58d793f5185c3d0cf3a77c | [
"MIT"
] | 9 | 2020-05-22T08:00:29.000Z | 2021-09-14T09:01:58.000Z | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
bool mysort(ii &a, ii &b) {
return (a.first < b.first);
}
template<typename T> T getint() {
T val=0;
char c;
bool neg=false;
while((c=getchar()) && !(c>='0' && c<='9')) {
neg|=c=='-';
}
do {
val=(val*10)+c-'... | 20.180851 | 84 | 0.448603 | 0x5eba |
b2c8aeded0904b0b2479c8225e17385703a8f9ec | 511 | hpp | C++ | src/acceleration/bbox.hpp | gosteponlegopls/inferno | b007277be1c0500403bd46c93b279c02615fbb17 | [
"MIT"
] | 13 | 2019-09-09T09:29:27.000Z | 2019-10-26T00:04:29.000Z | src/acceleration/bbox.hpp | gosteponlegopls/inferno | b007277be1c0500403bd46c93b279c02615fbb17 | [
"MIT"
] | null | null | null | src/acceleration/bbox.hpp | gosteponlegopls/inferno | b007277be1c0500403bd46c93b279c02615fbb17 | [
"MIT"
] | 1 | 2019-10-07T15:44:23.000Z | 2019-10-07T15:44:23.000Z | #ifndef INFERNO_ACCELERATION_BBOX_H_
#define INFERNO_ACCELERATION_BBOX_H_
#include "../maths.hpp"
class Ray;
class Triangle;
class BBox {
public:
glm::vec3 vmin, vmax;
BBox();
void MakeEmpty();
void Add(glm::vec3 vec);
bool Inside(glm::vec3 v);
bool TestIntersect(Ray& ray);
float ClosestIntersection(Ra... | 20.44 | 64 | 0.726027 | gosteponlegopls |
b2cd318fd9d56335f1794610ba1da280fd11d400 | 2,298 | cpp | C++ | GenericExpressInstanceParserTests/BenchmarkTestCase.cpp | quinte17/GenericExpressInstanceParser | cfa5736e73fb34cc1fa86f87f7dcd1e74218c42f | [
"Zlib"
] | null | null | null | GenericExpressInstanceParserTests/BenchmarkTestCase.cpp | quinte17/GenericExpressInstanceParser | cfa5736e73fb34cc1fa86f87f7dcd1e74218c42f | [
"Zlib"
] | 6 | 2015-02-15T13:35:19.000Z | 2015-02-15T14:41:05.000Z | GenericExpressInstanceParserTests/BenchmarkTestCase.cpp | quinte17/GenericExpressInstanceParser | cfa5736e73fb34cc1fa86f87f7dcd1e74218c42f | [
"Zlib"
] | null | null | null | #include "BenchmarkTestCase.h"
//qt inlcudes
#include <QTest>
//stl includes
#include <sstream>
//generic express instance parser (geip) inclues
#include <GenericExpressInstanceParser.h>
BenchmarkTestCase::BenchmarkTestCase(QObject *parent)
: QObject(parent)
{
}
BenchmarkTestCase::~BenchmarkTestCase()
{
}
/*... | 23.44898 | 85 | 0.568755 | quinte17 |
b2ceff915f080f48571331a4f045f1088351e225 | 1,166 | cpp | C++ | utils/print_stats.cpp | ndvbd/tongrams | a301022cd01a21f542757c22b6738ff647887e00 | [
"Apache-2.0"
] | null | null | null | utils/print_stats.cpp | ndvbd/tongrams | a301022cd01a21f542757c22b6738ff647887e00 | [
"Apache-2.0"
] | null | null | null | utils/print_stats.cpp | ndvbd/tongrams | a301022cd01a21f542757c22b6738ff647887e00 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include "../lm_types.hpp"
#include "util.hpp"
#include "stats.cpp"
using namespace tongrams;
template<typename T>
void print_stats(const char* binary_filename) {
T model;
util::logger("Loading data structure");
size_t bytes = util::load(model, binary_filename);
model.print_stats(... | 27.116279 | 95 | 0.593482 | ndvbd |
b2d37ae701bdb5a596446000a15e667c0b88cee3 | 588 | cpp | C++ | Source/SA/Logger/Streams/ALogStream.cpp | SapphireSuite/Logger | c922f1b0899274cc586df66b18572da55f4a3e2a | [
"MIT"
] | null | null | null | Source/SA/Logger/Streams/ALogStream.cpp | SapphireSuite/Logger | c922f1b0899274cc586df66b18572da55f4a3e2a | [
"MIT"
] | 1 | 2022-02-08T18:52:56.000Z | 2022-02-08T18:52:56.000Z | Source/SA/Logger/Streams/ALogStream.cpp | SapphireSuite/Logger | c922f1b0899274cc586df66b18572da55f4a3e2a | [
"MIT"
] | null | null | null | // Copyright (c) 2022 Sapphire's Suite. All Rights Reserved.
#include <Streams/ALogStream.hpp>
namespace Sa
{
void ALogStream::ProcessLog(const Log& _log, bool _bForce)
{
if (_bForce)
{
Output(_log);
return;
}
const bool bLevelEnabled = levelFlags & _log.level;
const bool bChannelEnabled = channelF... | 16.8 | 77 | 0.693878 | SapphireSuite |
b2d9e93db99c1ec59c85467669589c93523066b3 | 4,349 | hpp | C++ | test/data_sampler.hpp | youruncleda/relative_pose | cb613f210a812e03754fbfc9c2e93d1f6fe4a265 | [
"BSD-3-Clause"
] | 21 | 2020-07-08T17:58:17.000Z | 2022-02-28T03:58:37.000Z | test/data_sampler.hpp | taogashi/relative_pose | cb613f210a812e03754fbfc9c2e93d1f6fe4a265 | [
"BSD-3-Clause"
] | null | null | null | test/data_sampler.hpp | taogashi/relative_pose | cb613f210a812e03754fbfc9c2e93d1f6fe4a265 | [
"BSD-3-Clause"
] | 5 | 2020-07-24T01:26:28.000Z | 2020-10-13T13:32:48.000Z | #include <opencv2/opencv.hpp>
double ANGLE_EPSILON = 1e-5;
struct DataSampler
{
bool zero_screw_transl;
double angle_bound, nearest_dist, baseline_turb, depth,
focal, half_size, noise, outlier_rate;
cv::Vec3d baseline;
cv::RNG rng;
DataSampler();
void sampleRays(int num_points, cv::... | 31.28777 | 83 | 0.675328 | youruncleda |
b2dbd22913caabe1dd52abe4ff37accd261dd658 | 1,528 | cpp | C++ | src/body_interact_game/body_analizer.cpp | forno/body_interact_game | 8668c45fbe4c0d91aa1345b6c833d3b507920669 | [
"BSD-3-Clause"
] | 1 | 2021-04-26T04:44:19.000Z | 2021-04-26T04:44:19.000Z | src/body_interact_game/body_analizer.cpp | forno/body_interact_game | 8668c45fbe4c0d91aa1345b6c833d3b507920669 | [
"BSD-3-Clause"
] | null | null | null | src/body_interact_game/body_analizer.cpp | forno/body_interact_game | 8668c45fbe4c0d91aa1345b6c833d3b507920669 | [
"BSD-3-Clause"
] | null | null | null | #include <body_interact_game/body_analizer.hpp>
#include <Eigen/SVD>
namespace
{
constexpr auto pi {3.141592653589793};
inline Eigen::AngleAxisd get_yaw_inverse_matrix(Eigen::Affine3d pos) noexcept
{
const auto ypr {pos.rotation().eulerAngles(2, 0, 1)};
const auto yaw_angle {ypr(0) < pi / 2 ? ypr(2) : ypr(2) - ... | 36.380952 | 104 | 0.744764 | forno |
b2e414c4c122c0d20494e7a124f7f019fee0a649 | 4,709 | cpp | C++ | src/io.cpp | cmourglia/cpp_utils | ae7ea1521ac68edced2dbe0f0d00d760028cc2d2 | [
"MIT"
] | null | null | null | src/io.cpp | cmourglia/cpp_utils | ae7ea1521ac68edced2dbe0f0d00d760028cc2d2 | [
"MIT"
] | null | null | null | src/io.cpp | cmourglia/cpp_utils | ae7ea1521ac68edced2dbe0f0d00d760028cc2d2 | [
"MIT"
] | null | null | null | #include <beard/io/io.h>
#include <beard/core/macros.h>
#include <codecvt>
#if BEARD_PLATFORM_WINDOWS
START_EXTERNAL_INCLUDE
# include <Windows.h>
END_EXTERNAL_INCLUDE
#elif
# error TODO
#endif
namespace beard::io
{
i64 get_file_write_time(const char* filename)
{
#if BEARD_PLATFORM_WINDOWS
HANDLE fileHandle = Crea... | 24.148718 | 109 | 0.635804 | cmourglia |
b2e714af274683b9767415360dea70f91b29b6c6 | 278 | hpp | C++ | include/o80_example/joint.hpp | intelligent-soft-robots/o80_example | bd72eca61e0ddd0c3318ac3aabdba163e77c5ba2 | [
"BSD-3-Clause"
] | 1 | 2021-04-08T09:03:43.000Z | 2021-04-08T09:03:43.000Z | include/o80_example/joint.hpp | intelligent-soft-robots/o80_example | bd72eca61e0ddd0c3318ac3aabdba163e77c5ba2 | [
"BSD-3-Clause"
] | 1 | 2020-12-22T16:44:38.000Z | 2020-12-22T16:44:38.000Z | include/o80_example/joint.hpp | intelligent-soft-robots/o80_example | bd72eca61e0ddd0c3318ac3aabdba163e77c5ba2 | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#include "o80/state.hpp"
namespace o80_example
{
class Joint : public o80::State<double, Joint>
{
public:
Joint() : o80::State<double, Joint>(0)
{
}
Joint(double value) : o80::State<double, Joint>(value)
{
}
};
} // namespace o80_example
| 15.444444 | 58 | 0.625899 | intelligent-soft-robots |
b2e827a6d1cd26afc8fe25b85bef4d70d035f9c0 | 8,556 | cpp | C++ | Engine/Preview_Lightning.cpp | AutoSync/LightningEngine | 0c3b0daba4399aa71d56327254caca59cb5f4858 | [
"Apache-2.0"
] | null | null | null | Engine/Preview_Lightning.cpp | AutoSync/LightningEngine | 0c3b0daba4399aa71d56327254caca59cb5f4858 | [
"Apache-2.0"
] | null | null | null | Engine/Preview_Lightning.cpp | AutoSync/LightningEngine | 0c3b0daba4399aa71d56327254caca59cb5f4858 | [
"Apache-2.0"
] | null | null | null | //// 2018 - 2022 AutoSync Lightning Engine | Erick Andrade - All Rights Reserved
//
///* nuklear - 1.32.0 - public domain */
//#include <stdio.h>
//#include <stdlib.h>
//#include <stdint.h>
//#include <stdarg.h>
//#include <string.h>
//#include <math.h>
//#include <assert.h>
//#include <limits.h>
//#include <time.h>
//... | 36.564103 | 126 | 0.589177 | AutoSync |
b2e941fecd4d3f3e6b267317035a2a83f01e782f | 1,145 | cpp | C++ | src/ui/AsyncMessage.cpp | jnmeurisse/FortiRDP | 53f48413c8a292304de27468b271847534353c61 | [
"Apache-2.0"
] | null | null | null | src/ui/AsyncMessage.cpp | jnmeurisse/FortiRDP | 53f48413c8a292304de27468b271847534353c61 | [
"Apache-2.0"
] | null | null | null | src/ui/AsyncMessage.cpp | jnmeurisse/FortiRDP | 53f48413c8a292304de27468b271847534353c61 | [
"Apache-2.0"
] | 1 | 2022-02-19T19:47:43.000Z | 2022-02-19T19:47:43.000Z | /*!
* This file is part of FortiRDP
*
* Copyright (C) 2022 Jean-Noel Meurisse
* SPDX-License-Identifier: Apache-2.0
*
*/
#include "AsyncMessage.h"
AsyncMessage::AsyncMessage(UINT eventNumber):
_id(eventNumber)
{
}
AsyncMessage::~AsyncMessage()
{
}
LRESULT AsyncMessage::send(HWND hWnd, void* lParam) const
{
retu... | 24.361702 | 82 | 0.8 | jnmeurisse |
b2ed90e1ec93d49c26bdf4abf6e6eb746fb82ebc | 508 | cpp | C++ | 1000-1100/1003. Check If Word Is Valid After Substitutions.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 1000-1100/1003. Check If Word Is Valid After Substitutions.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 1000-1100/1003. Check If Word Is Valid After Substitutions.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | class Solution
{
public:
bool isValid(string s)
{
stack<char> stk;
for (auto &c : s)
{
if (c == 'c')
{
string tmp;
for (int i = 0; i < 2 && !stk.empty(); i++)
{
tmp.push_back(stk.top());
stk.pop();
}
if (tmp.size() == 2 && tmp[0] ==... | 18.142857 | 62 | 0.385827 | erichuang1994 |
b2f02d92f43bcf33b03806283c1ec89cf100506e | 2,806 | hpp | C++ | MACAO/ORAM.hpp | thanghoang/MACAO | b1614ca7311f3555ca492b1088ca031089c1099e | [
"MIT"
] | 4 | 2020-02-25T22:55:35.000Z | 2021-06-17T22:10:34.000Z | MACAO/ORAM.hpp | thanghoang/MACAO | b1614ca7311f3555ca492b1088ca031089c1099e | [
"MIT"
] | null | null | null | MACAO/ORAM.hpp | thanghoang/MACAO | b1614ca7311f3555ca492b1088ca031089c1099e | [
"MIT"
] | 5 | 2020-03-04T21:37:54.000Z | 2022-01-07T19:27:15.000Z | /*
* ORAM.hpp
*
* Author: thanghoang
*/
#ifndef SSORAM_HPP
#define SSORAM_HPP
#include "config.h"
class ORAM
{
public:
ORAM();
~ORAM();
static int build(TYPE_POS_MAP *pos_map, TYPE_INDEX **metaData);
static int getEvictIdx(TYPE_INDEX *srcIdx, TYPE_INDEX *destIdx, TYPE_INDEX *siblIdx, strin... | 43.84375 | 160 | 0.743051 | thanghoang |
b2f0a5db171fc333c3dde0a8f6200150cdfbde7d | 1,847 | cpp | C++ | usaco_practice/gold/gold_practice/radio.cpp | juneharold/USACO | a96b54f68e7247c61044f3c0d9e7260952c508e2 | [
"MIT"
] | null | null | null | usaco_practice/gold/gold_practice/radio.cpp | juneharold/USACO | a96b54f68e7247c61044f3c0d9e7260952c508e2 | [
"MIT"
] | null | null | null | usaco_practice/gold/gold_practice/radio.cpp | juneharold/USACO | a96b54f68e7247c61044f3c0d9e7260952c508e2 | [
"MIT"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
#define f first
#define s second
const int MAX=1005;
int N, M, dp[MAX][MAX]={};
pair<int, int> fj[MAX], bs[MAX];
string fjpath, bspath;
int solve(int a, int b) {
if (a<0 || b<0) return 1e9;
if (dp[a][b]!=1e9) return dp[a][b];
... | 22.253012 | 85 | 0.409854 | juneharold |
b2f19468a25729f55ddfba3f5415c1ade12e5fa3 | 502 | cpp | C++ | Lista5/exe3.cpp | nathalyoliveira/LG1-IFSP | b072c916f71a8b5924a766d8b6fa4e0a481faa64 | [
"MIT"
] | null | null | null | Lista5/exe3.cpp | nathalyoliveira/LG1-IFSP | b072c916f71a8b5924a766d8b6fa4e0a481faa64 | [
"MIT"
] | null | null | null | Lista5/exe3.cpp | nathalyoliveira/LG1-IFSP | b072c916f71a8b5924a766d8b6fa4e0a481faa64 | [
"MIT"
] | null | null | null | #include<stdio.h>
#include<conio.h>
int main()
{
int a[15], b[15],i, j,x, y;
for (i=0;i<15;++i)
{puts("DIGITE OS VALORES DO VETOR A:");
scanf("%d", &a[i]);}
for(i=0;i<15;++i)
{
b[i]=1;
for(y=a[i]; y>=1; y--)
{b[i]=b[i]*y;}
}
for(i=0;i<15;++i)
for(j=i+1;j<15... | 14.764706 | 46 | 0.39243 | nathalyoliveira |
b2f381a8a283377e0c47afcc4b39f4069dd274d2 | 797 | cpp | C++ | src/TCPClient.cpp | mjssw/crux-net | 6dd2e2b36e9e6211b959f21cb34e3c7fb4845788 | [
"BSD-3-Clause"
] | 1 | 2016-07-04T16:07:57.000Z | 2016-07-04T16:07:57.000Z | src/TCPClient.cpp | mjssw/crux-net | 6dd2e2b36e9e6211b959f21cb34e3c7fb4845788 | [
"BSD-3-Clause"
] | null | null | null | src/TCPClient.cpp | mjssw/crux-net | 6dd2e2b36e9e6211b959f21cb34e3c7fb4845788 | [
"BSD-3-Clause"
] | null | null | null | #include "TCPClient.h"
#include "Session.h"
namespace Crux
{
TCPClient::TCPClient()
: m_Connected(false), m_pSession( NULL )
{
}
TCPClient::~TCPClient()
{
}
void TCPClient::Disconnect()
{
m_Connected = false;
m_pSession->Disconnect();
}
bool TCPClient::Connected() const
{
return m_Connected;
}
void TCPClient::... | 15.037736 | 66 | 0.734003 | mjssw |
b2ffe4331f29fb6e3bcbc7f7f79bd88ccf42a2f3 | 706 | cpp | C++ | Algorithms/Implementation/counting-valleys.cpp | CodeLogist/hackerrank-solutions | faecc4c9563a017eb61e83f0025aa9eb78fd33a1 | [
"MIT"
] | 73 | 2016-09-14T18:20:41.000Z | 2022-02-05T14:58:04.000Z | Algorithms/Implementation/counting-valleys.cpp | A-STAR0/hackerrank-solutions-1 | 518cdd9049477d70c499ba4f51f06ac99178f0ab | [
"MIT"
] | 3 | 2017-03-03T01:12:31.000Z | 2020-04-18T16:51:59.000Z | Algorithms/Implementation/counting-valleys.cpp | A-STAR0/hackerrank-solutions-1 | 518cdd9049477d70c499ba4f51f06ac99178f0ab | [
"MIT"
] | 69 | 2017-03-02T19:03:54.000Z | 2022-03-29T12:35:38.000Z | #include <vector>
#include <iostream>
#include <algorithm>
int main() {
int n; std::cin >> n;
std::vector<int> heights(n+2,0);
std::string steps; std::cin >> steps;
for (int i = 1; i < n+1; i++) {
heights[i] = heights[i-1] + (steps[i-1] == 'U' ? 1 : -1);
}
int valley_count = 0... | 22.774194 | 86 | 0.444759 | CodeLogist |
6507a43c497b8fa11b5b99747952df588ab4ff6d | 1,638 | cpp | C++ | gameObjects/Shot.cpp | streusselhirni/HF-ICT_GUI_Game-Pokemon | a260fd8088b3c1ef69a7d197d8de3448459341ba | [
"MIT"
] | null | null | null | gameObjects/Shot.cpp | streusselhirni/HF-ICT_GUI_Game-Pokemon | a260fd8088b3c1ef69a7d197d8de3448459341ba | [
"MIT"
] | null | null | null | gameObjects/Shot.cpp | streusselhirni/HF-ICT_GUI_Game-Pokemon | a260fd8088b3c1ef69a7d197d8de3448459341ba | [
"MIT"
] | null | null | null | #include <QString>
#include <cmath>
#include "Shot.h"
#include <QPainter>
Shot::Shot(int x, int y, int speed, int angle)
: GameObject(x, y, 50, new QMovie("img/pokeball.gif"), 50),
speed(speed),
angle(angle),
rotation(0),
t(0) {
this->fired = false;
}
void Shot::mov... | 26.419355 | 95 | 0.559829 | streusselhirni |
650e168120823187ed7ae46f661159a7f19274dc | 963 | cpp | C++ | Friendship/Main.cpp | rastabrandy02/Programming2 | 8dba0e75c01dc884df09f19bcacf1140ca9ca501 | [
"MIT"
] | null | null | null | Friendship/Main.cpp | rastabrandy02/Programming2 | 8dba0e75c01dc884df09f19bcacf1140ca9ca501 | [
"MIT"
] | null | null | null | Friendship/Main.cpp | rastabrandy02/Programming2 | 8dba0e75c01dc884df09f19bcacf1140ca9ca501 | [
"MIT"
] | 1 | 2021-02-22T08:43:48.000Z | 2021-02-22T08:43:48.000Z | #include <iostream>
#include "Friendship.cpp"
using namespace std;
void StarTouched(Player* p)
{
p->invincible = true;
}
int main()
{
string name;
string itemName;
bool playing = true;
cout << "Introduce your name: " << endl;
cin >> name;
Player player(name);
while (playing)
{
cout << "---STATS---" << e... | 20.0625 | 64 | 0.608515 | rastabrandy02 |
651025462d34c381134cf849b531b7444cfdf6e3 | 2,486 | cpp | C++ | Practice/2018/2018.9.25/BZOJ3428.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | 4 | 2017-10-31T14:25:18.000Z | 2018-06-10T16:10:17.000Z | Practice/2018/2018.9.25/BZOJ3428.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | null | null | null | Practice/2018/2018.9.25/BZOJ3428.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define mem(Arr,x) memset(Arr,x,sizeof(Arr))
const int maxN=50100;
const int inf=2147483647;
class Point
{
public:
int x,y;
};
int n;
Point B[maxN],W[maxN],Up[maxN],Down[maxN];
int... | 19.888 | 95 | 0.542639 | SYCstudio |
651039cda528f0b5c29d952f73704ceab04ddcba | 103 | cpp | C++ | src/my_app.cpp | mahilab/mahi-template | 022d0aa27b69abc71b7c6df610a65149069d62ad | [
"MIT"
] | 6 | 2018-09-14T05:07:03.000Z | 2021-09-30T17:15:11.000Z | template/src/my_app.cpp | mahilab/MEL | b877b2ed9cd265b1ee3c1cc623a339ec1dc73185 | [
"Zlib"
] | 1 | 2020-10-15T13:46:27.000Z | 2020-10-15T13:46:27.000Z | src/my_app.cpp | mahilab/mahi-template | 022d0aa27b69abc71b7c6df610a65149069d62ad | [
"MIT"
] | 3 | 2018-09-20T00:58:31.000Z | 2022-02-09T06:02:56.000Z | #include "MyClass.hpp"
int main() {
MyClass my_class;
my_class.hello_world();
return 0;
}
| 12.875 | 27 | 0.631068 | mahilab |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.