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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ff05932e8e55201de1611d969f06a644cc0a651f | 2,062 | cpp | C++ | src/UI/Core/TextArea.cpp | Goof-fr/OPHD | ab3414181b04ab2757b124d81fd5592f930c5370 | [
"BSD-3-Clause"
] | 2 | 2020-01-27T19:44:45.000Z | 2020-01-27T19:44:49.000Z | src/UI/Core/TextArea.cpp | Goof-fr/OPHD | ab3414181b04ab2757b124d81fd5592f930c5370 | [
"BSD-3-Clause"
] | null | null | null | src/UI/Core/TextArea.cpp | Goof-fr/OPHD | ab3414181b04ab2757b124d81fd5592f930c5370 | [
"BSD-3-Clause"
] | null | null | null | // This is an open source non-commercial project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
#include "TextArea.h"
#include "../../Common.h"
#include "../../Constants.h"
#include "../../FontManager.h"
#include "NAS2D/Utility.h"
#include "NAS2D/Render... | 19.826923 | 167 | 0.618817 | Goof-fr |
ff0dbeaaa207b26349a0dd1cccc12db72b12809c | 317 | hpp | C++ | include/RED4ext/Scripting/Natives/Generated/game/PSMZones.hpp | jackhumbert/RED4ext.SDK | 2c55eccb83beabbbe02abae7945af8efce638fca | [
"MIT"
] | 42 | 2020-12-25T08:33:00.000Z | 2022-03-22T14:47:07.000Z | include/RED4ext/Scripting/Natives/Generated/game/PSMZones.hpp | jackhumbert/RED4ext.SDK | 2c55eccb83beabbbe02abae7945af8efce638fca | [
"MIT"
] | 38 | 2020-12-28T22:36:06.000Z | 2022-02-16T11:25:47.000Z | include/RED4ext/Scripting/Natives/Generated/game/PSMZones.hpp | jackhumbert/RED4ext.SDK | 2c55eccb83beabbbe02abae7945af8efce638fca | [
"MIT"
] | 20 | 2020-12-28T22:17:38.000Z | 2022-03-22T17:19:01.000Z | #pragma once
// This file is generated from the Game's Reflection data
#include <cstdint>
namespace RED4ext
{
namespace game {
enum class PSMZones : uint32_t
{
Default = 0,
Public = 1,
Safe = 2,
Restricted = 3,
Dangerous = 4,
Any = 4294967295,
};
} // namespace game
} // namespace RED4ext
| 15.85 | 57 | 0.649842 | jackhumbert |
ff14623c4a3e531d648f00c5d95c6fcc02d58690 | 2,679 | cc | C++ | thirdparty/aria2/test/array_funTest.cc | deltegic/deltegic | 9b4f3a505a6842db52efbe850150afbab3af5e2f | [
"BSD-3-Clause"
] | null | null | null | thirdparty/aria2/test/array_funTest.cc | deltegic/deltegic | 9b4f3a505a6842db52efbe850150afbab3af5e2f | [
"BSD-3-Clause"
] | 2 | 2021-04-08T08:46:23.000Z | 2021-04-08T08:57:58.000Z | thirdparty/aria2/test/array_funTest.cc | deltegic/deltegic | 9b4f3a505a6842db52efbe850150afbab3af5e2f | [
"BSD-3-Clause"
] | null | null | null | #include "array_fun.h"
#include <cppunit/extensions/HelperMacros.h>
using namespace aria2::expr;
namespace aria2 {
class array_funTest : public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE(array_funTest);
CPPUNIT_TEST(testArray_negate);
CPPUNIT_TEST(testArray_and);
CPPUNIT_TEST(testArrayLength);
CPPUNIT_TEST... | 26.009709 | 76 | 0.702128 | deltegic |
d4332047cfa3d0a3a68ad938fae594992542c332 | 1,032 | hpp | C++ | libvvhd/headers/XIsoline.hpp | rosik/vvflow | 87caadf3973b31058a16a1372365ae8a7a157cdb | [
"MIT"
] | 29 | 2020-08-05T16:08:35.000Z | 2022-02-21T06:43:01.000Z | libvvhd/headers/XIsoline.hpp | rosik/vvflow | 87caadf3973b31058a16a1372365ae8a7a157cdb | [
"MIT"
] | 6 | 2021-01-07T21:29:57.000Z | 2021-06-28T20:54:04.000Z | libvvhd/headers/XIsoline.hpp | rosik/vvflow | 87caadf3973b31058a16a1372365ae8a7a157cdb | [
"MIT"
] | 6 | 2020-07-24T06:53:54.000Z | 2022-01-06T06:12:45.000Z | #pragma once
#include "XField.hpp"
#include <list>
#include <deque>
#include <sstream>
class XIsoline {
public:
XIsoline() = delete;
XIsoline(const XIsoline&) = delete;
XIsoline(XIsoline&&) = delete;
XIsoline& operator=(const XIsoline&) = delete;
XIsoline& operator=(XIsoline&&) = delete;
XIs... | 22.933333 | 72 | 0.585271 | rosik |
d43ce46ed6cf430880372955c8ab51fc2c09aca2 | 1,184 | cpp | C++ | tests/regression/GoToLoops1/test.cpp | SusanTan/noelle | 33c9e10a20bc59590c13bf29fb661fc406a9e687 | [
"MIT"
] | 43 | 2020-09-04T15:21:40.000Z | 2022-03-23T03:53:02.000Z | tests/regression/GoToLoops1/test.cpp | SusanTan/noelle | 33c9e10a20bc59590c13bf29fb661fc406a9e687 | [
"MIT"
] | 15 | 2020-09-17T18:06:15.000Z | 2022-01-24T17:14:36.000Z | tests/regression/GoToLoops1/test.cpp | SusanTan/noelle | 33c9e10a20bc59590c13bf29fb661fc406a9e687 | [
"MIT"
] | 23 | 2020-09-04T15:50:09.000Z | 2022-03-25T13:38:25.000Z | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
void func1();
void func2();
int sccCausing1 = 0;
void func1() {
if (sccCausing1++ > 2) {
sccCausing1 = 0;
func2();
}
}
int sccCausing2 = 1;
void func2() {
if (sccCausing2++ > 2) {
sccCausing2 = 0;
func1();
}
}
int main (int argc, char... | 17.411765 | 62 | 0.537162 | SusanTan |
d43f88f0da65efa13a81277c2e8a34f637314dfe | 3,186 | cpp | C++ | JAERO/tests/fftwrapper_tests.cpp | Roethenbach/JAERO | 753a4409507a356489f3635b93dc16955c8cf01a | [
"MIT"
] | 152 | 2015-12-02T01:38:42.000Z | 2022-03-29T10:41:37.000Z | JAERO/tests/fftwrapper_tests.cpp | Roethenbach/JAERO | 753a4409507a356489f3635b93dc16955c8cf01a | [
"MIT"
] | 59 | 2015-12-02T02:11:24.000Z | 2022-03-21T02:48:11.000Z | JAERO/tests/fftwrapper_tests.cpp | Roethenbach/JAERO | 753a4409507a356489f3635b93dc16955c8cf01a | [
"MIT"
] | 38 | 2015-12-07T16:24:03.000Z | 2021-12-25T15:44:27.000Z | #include "../fftwrapper.h"
#include "../util/RuntimeError.h"
#include "../DSP.h"
//important for Qt include cpputest last as it mucks up new and causes compiling to fail
#include "CppUTest/TestHarness.h"
TEST_GROUP(Test_FFTWrapper)
{
const double doubles_equal_threshold=0.00001;
void setup()
{
sr... | 57.927273 | 527 | 0.743879 | Roethenbach |
d440af2356c934fd13611eaccc185007e848b38f | 2,411 | cpp | C++ | inorder_traversal.cpp | akhilesh59/Programming-Helpers | c4af814f99fc8288e28fb6fb8fee61acf9549f2c | [
"MIT"
] | null | null | null | inorder_traversal.cpp | akhilesh59/Programming-Helpers | c4af814f99fc8288e28fb6fb8fee61acf9549f2c | [
"MIT"
] | null | null | null | inorder_traversal.cpp | akhilesh59/Programming-Helpers | c4af814f99fc8288e28fb6fb8fee61acf9549f2c | [
"MIT"
] | 6 | 2021-10-21T13:01:30.000Z | 2021-10-31T08:29:34.000Z |
// RECURSION METHOD
// #include <iostream>
// using namespace std;
// struct Node {
// int data;
// Node *left, *right;
// Node (int data) {
// this->data = data;
// this->left = this->right = nullptr;
// }
// };
// // recursion function
// void inorder(Node* root) {
// if (root ... | 19.601626 | 64 | 0.404811 | akhilesh59 |
d440b79d4eeeecba139bcead65783a7cf67fb3c2 | 5,961 | cpp | C++ | kcalg/sec/zk/ffs/ffsa.cpp | kn1ghtc/kctsb | ee0e5b31dbe293dad0fb6ea5acf5da1652e4e733 | [
"Apache-2.0"
] | 1 | 2021-03-16T00:10:51.000Z | 2021-03-16T00:10:51.000Z | kcalg/sec/zk/ffs/ffsa.cpp | kn1ghtc/kctsb | ee0e5b31dbe293dad0fb6ea5acf5da1652e4e733 | [
"Apache-2.0"
] | null | null | null | kcalg/sec/zk/ffs/ffsa.cpp | kn1ghtc/kctsb | ee0e5b31dbe293dad0fb6ea5acf5da1652e4e733 | [
"Apache-2.0"
] | null | null | null | #include "ffsa.h"
#include "opentsb/kc_sec.h"
#include <iostream>
/*check GMP number for primality*/
bool ffsa_check_prime(mpz_class p)
{
int8_t reps = 25;
int prob = mpz_probab_prime_p(p.get_mpz_t(), reps);
if(prob == 2)
return true;
else if(prob == 0)
return false;
else if(prob... | 23.104651 | 95 | 0.539171 | kn1ghtc |
d446a9568df176437c55638ff603caf95c5e8191 | 5,671 | hpp | C++ | include/uxr/agent/transport/util/InterfaceLinux.hpp | vibnwis/Micro-XRCE-DDS-Agent | 57ff677855b75d79657b7c20110241e6c1eec351 | [
"Apache-2.0"
] | null | null | null | include/uxr/agent/transport/util/InterfaceLinux.hpp | vibnwis/Micro-XRCE-DDS-Agent | 57ff677855b75d79657b7c20110241e6c1eec351 | [
"Apache-2.0"
] | null | null | null | include/uxr/agent/transport/util/InterfaceLinux.hpp | vibnwis/Micro-XRCE-DDS-Agent | 57ff677855b75d79657b7c20110241e6c1eec351 | [
"Apache-2.0"
] | null | null | null | // Copyright 2017-present Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// 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
//
// U... | 33.556213 | 91 | 0.588256 | vibnwis |
d4496a1f863a7e06e2727f8ec8ec8dcc773f8e61 | 2,757 | hpp | C++ | src/mlpack/core/metrics/iou_metric_impl.hpp | gaurav-singh1998/mlpack | c104a2dcf0b51a98d9d6fcfc01d4e7047cc83872 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2021-12-09T17:58:29.000Z | 2021-12-09T17:58:29.000Z | src/mlpack/core/metrics/iou_metric_impl.hpp | R-Aravind/mlpack | 99d11a9b4d379885cf7f8160d8c71fb792fa1bbc | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | src/mlpack/core/metrics/iou_metric_impl.hpp | R-Aravind/mlpack | 99d11a9b4d379885cf7f8160d8c71fb792fa1bbc | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2019-09-17T21:33:59.000Z | 2019-09-17T21:33:59.000Z | /**
* @file core/metrics/iou_metric_impl.hpp
* @author Kartik Dutt
*
* Implementation of Intersection Over Union metric.
*
* mlpack is free software; you may redistribute it and/or modify it under the
* terms of the 3-clause BSD license. You should have received a copy of the
* 3-clause BSD license along with ... | 34.898734 | 79 | 0.608995 | gaurav-singh1998 |
d44ed9ea3d1c11e444823cbd28a6c503669cd4a2 | 10,283 | cpp | C++ | src/test/unit/lang/parser/math_functions_test.cpp | drezap/stan | 9b319ed125e2a7d14d0c9c246d2f462dad668537 | [
"BSD-3-Clause"
] | 1 | 2019-07-05T01:40:40.000Z | 2019-07-05T01:40:40.000Z | src/test/unit/lang/parser/math_functions_test.cpp | drezap/stan | 9b319ed125e2a7d14d0c9c246d2f462dad668537 | [
"BSD-3-Clause"
] | null | null | null | src/test/unit/lang/parser/math_functions_test.cpp | drezap/stan | 9b319ed125e2a7d14d0c9c246d2f462dad668537 | [
"BSD-3-Clause"
] | 1 | 2018-08-28T12:09:08.000Z | 2018-08-28T12:09:08.000Z | #include <gtest/gtest.h>
#include <test/unit/lang/utility.hpp>
TEST(lang_parser, abs_math_function_signatures) {
test_parsable("function-signatures/math/functions/abs");
}
TEST(lang_parser, asin_math_function_signatures) {
test_parsable("function-signatures/math/functions/asin");
}
TEST(lang_parser, asinh_math_f... | 30.333333 | 82 | 0.817563 | drezap |
d45284ba5583709a12d74e1d5b741b1777075e51 | 683 | cxx | C++ | NeosegPipeline/AntsJointFusionParameters.cxx | KevinPhamCPE/Neosegpipeline | 91b4c4f3e56dd5f3203d240a5aca932c28287bd3 | [
"Apache-2.0"
] | null | null | null | NeosegPipeline/AntsJointFusionParameters.cxx | KevinPhamCPE/Neosegpipeline | 91b4c4f3e56dd5f3203d240a5aca932c28287bd3 | [
"Apache-2.0"
] | null | null | null | NeosegPipeline/AntsJointFusionParameters.cxx | KevinPhamCPE/Neosegpipeline | 91b4c4f3e56dd5f3203d240a5aca932c28287bd3 | [
"Apache-2.0"
] | null | null | null | #include "AntsJointFusionParameters.h"
AntsJointFusionParameters::AntsJointFusionParameters()
{
m_output_dir_default="";
m_output_dir=m_output_dir_default;
m_compute_rois_parc_fusion_default= false ;
m_compute_rois_parc_fusion=m_compute_rois_parc_fusion_default;
}
void AntsJointFusionParameters::setOut... | 20.088235 | 72 | 0.82284 | KevinPhamCPE |
d453fbb44894c49055ea505f25e6961ee52c79f2 | 456 | hpp | C++ | library/ATF/DLGTEMPLATE.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/DLGTEMPLATE.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/DLGTEMPLATE.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
#pragma pack(push, 2)
const struct DLGTEMPLATE
{
unsigned int style;
unsigned int dwExtendedStyle;
unsigned __i... | 21.714286 | 108 | 0.649123 | lemkova |
d454b0536ea3bd6a168d8daac1a5c6451443e237 | 4,488 | cpp | C++ | UnitTest/Primitive.cpp | garlyon/onion2 | b20d966de6a9ddeee0b66478d50725d1eaaad4c8 | [
"MIT"
] | null | null | null | UnitTest/Primitive.cpp | garlyon/onion2 | b20d966de6a9ddeee0b66478d50725d1eaaad4c8 | [
"MIT"
] | null | null | null | UnitTest/Primitive.cpp | garlyon/onion2 | b20d966de6a9ddeee0b66478d50725d1eaaad4c8 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "CppUnitTest.h"
#include "../Collision/Primitive.h"
#include "Tetrahedron.h"
#include <set>
#include <algorithm>
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
namespace UnitTest
{
TEST_CLASS( Neighborhood )
{
template <typename A, typename B>
void check( A a, ... | 28.769231 | 115 | 0.532531 | garlyon |
d4556d997b55c84d1489226659aa8bd4165e704f | 5,888 | cpp | C++ | Phase #3/Items.cpp | Squshy/sqa-baller-squad-v2 | a63cac6d24f282137864453727fa1c35371997fd | [
"MIT"
] | null | null | null | Phase #3/Items.cpp | Squshy/sqa-baller-squad-v2 | a63cac6d24f282137864453727fa1c35371997fd | [
"MIT"
] | null | null | null | Phase #3/Items.cpp | Squshy/sqa-baller-squad-v2 | a63cac6d24f282137864453727fa1c35371997fd | [
"MIT"
] | 1 | 2020-02-27T13:18:06.000Z | 2020-02-27T13:18:06.000Z | /**
* Items Function Definition file for Our Auction Sales Service Project
*
* @author Paul Kerrigan, Henry Zheng, Calvin Lapp
* @date January 24, 2020
* @version 1.0
* @name Items.cpp
*/
#include "Items.h"
#include <string>
#include "Users.h"
#include "AuctionLib.h"
string** bidList;
int bidListCount = 0;
bool ite... | 37.503185 | 152 | 0.563179 | Squshy |
d4560b83baff7d59f3efc50a387b12ff9f04e9f8 | 217 | cpp | C++ | source/Node.cpp | xzrunner/sop | 80f84765548fde33d990663d4a4b8054bb6714d1 | [
"MIT"
] | null | null | null | source/Node.cpp | xzrunner/sop | 80f84765548fde33d990663d4a4b8054bb6714d1 | [
"MIT"
] | null | null | null | source/Node.cpp | xzrunner/sop | 80f84765548fde33d990663d4a4b8054bb6714d1 | [
"MIT"
] | null | null | null | #include "sop/Node.h"
#include <assert.h>
namespace sop
{
Node::Node()
: m_parms(*this)
{
}
void Node::SetParent(const std::shared_ptr<Node>& node)
{
m_parent = node;
m_level = node->m_level + 1;
}
} | 10.85 | 55 | 0.617512 | xzrunner |
d457e79f2a5d43b52250b34878bd5ed5d996e0d4 | 1,462 | cpp | C++ | ch16/ex16.53.54.55/main.cpp | zhang1990215/Cpp-Primer | 81e51869c02f2ba75e4fe491dee07eaedce2bbc9 | [
"CC0-1.0"
] | null | null | null | ch16/ex16.53.54.55/main.cpp | zhang1990215/Cpp-Primer | 81e51869c02f2ba75e4fe491dee07eaedce2bbc9 | [
"CC0-1.0"
] | null | null | null | ch16/ex16.53.54.55/main.cpp | zhang1990215/Cpp-Primer | 81e51869c02f2ba75e4fe491dee07eaedce2bbc9 | [
"CC0-1.0"
] | null | null | null | /***************************************************************************
* @file main.cpp
* @author Yue Wang
* @date 16 Feb 2014
Aug, 2015
* @remark This code is for the exercises from C++ Primer 5th Edition
* @note
****************************************************... | 30.458333 | 86 | 0.583447 | zhang1990215 |
d461774f952bed1c0d629aa1a558f1dc90ec3f9e | 10,453 | cpp | C++ | src/MapDrawer.cpp | sarthou/semantic_map_drawer | 2e1bce2fdefb25d87194a5ee888b03c2807b0bca | [
"Apache-2.0"
] | null | null | null | src/MapDrawer.cpp | sarthou/semantic_map_drawer | 2e1bce2fdefb25d87194a5ee888b03c2807b0bca | [
"Apache-2.0"
] | null | null | null | src/MapDrawer.cpp | sarthou/semantic_map_drawer | 2e1bce2fdefb25d87194a5ee888b03c2807b0bca | [
"Apache-2.0"
] | null | null | null | #include "route_drawer/MapDrawer.h"
#include <opencv2/imgproc/imgproc.hpp>
void MapDrawer::draw(std::vector<corridor_t> corridors)
{
for(size_t i = 0; i < corridors.size(); i++)
drawOneCorridor(corridors[i]);
}
void MapDrawer::draw(std::vector<openspace_t> openspaces)
{
for(size_t i = 0; i < openspaces.size()... | 38.430147 | 161 | 0.667368 | sarthou |
d4622904c62f26a74067e522b4c5f303b223aaff | 11,086 | cpp | C++ | test/new_lexer_test.cpp | Nicholas-Baron/little-lang | dc7cca0ad4d06987f12edbe990ae6f27ec02d182 | [
"MIT"
] | 1 | 2019-08-09T13:59:32.000Z | 2019-08-09T13:59:32.000Z | test/new_lexer_test.cpp | Nicholas-Baron/little-lang | dc7cca0ad4d06987f12edbe990ae6f27ec02d182 | [
"MIT"
] | 3 | 2019-08-08T04:39:49.000Z | 2019-12-11T20:57:47.000Z | test/new_lexer_test.cpp | Nicholas-Baron/little-lang | dc7cca0ad4d06987f12edbe990ae6f27ec02d182 | [
"MIT"
] | null | null | null | #include "new_lexer.hpp"
#include <catch2/catch.hpp>
TEST_CASE("the lexer will not accept empty inputs") {
std::string buffer;
auto lexer = lexer::from_buffer(buffer);
CHECK(lexer != nullptr);
CHECK(lexer->peek_token() == lexer::token_type::eof);
}
TEST_CASE("the lexer will report locations for tok... | 30.539945 | 79 | 0.638102 | Nicholas-Baron |
d466d3fc9ad349b40da93af5b1f5ae6e4d78ec36 | 5,442 | cc | C++ | msf_distort/src/msf_distort.cc | tdnet12434/multi_sensor_fusion | fea64a56ecab2bd65f96675c207cd0d776c4a969 | [
"Apache-2.0"
] | 1 | 2018-07-11T11:32:26.000Z | 2018-07-11T11:32:26.000Z | msf_distort/src/msf_distort.cc | tdnet12434/multi_sensor_fusion | fea64a56ecab2bd65f96675c207cd0d776c4a969 | [
"Apache-2.0"
] | null | null | null | msf_distort/src/msf_distort.cc | tdnet12434/multi_sensor_fusion | fea64a56ecab2bd65f96675c207cd0d776c4a969 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2012-2013 Simon Lynen, ASL, ETH Zurich, Switzerland
* You can contact the author at <slynen at ethz dot ch>
*
* 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... | 37.020408 | 103 | 0.725101 | tdnet12434 |
d46764d908176863484f6f12857d802e55eeba10 | 7,601 | cpp | C++ | libs/gui/src/font.cpp | blagodarin/yttrium | 534289c3082355e5537a03c0b5855b60f0c344ad | [
"Apache-2.0"
] | null | null | null | libs/gui/src/font.cpp | blagodarin/yttrium | 534289c3082355e5537a03c0b5855b60f0c344ad | [
"Apache-2.0"
] | null | null | null | libs/gui/src/font.cpp | blagodarin/yttrium | 534289c3082355e5537a03c0b5855b60f0c344ad | [
"Apache-2.0"
] | null | null | null | // This file is part of the Yttrium toolkit.
// Copyright (C) Sergei Blagodarin.
// SPDX-License-Identifier: Apache-2.0
#include <yttrium/gui/font.h>
#include <yttrium/base/exceptions.h>
#include <yttrium/geometry/rect.h>
#include <yttrium/image/image.h>
#include <yttrium/renderer/2d.h>
#include <yttrium/renderer/man... | 30.526104 | 170 | 0.662281 | blagodarin |
d46f2d4882e48f3e55477fc22a159829c7d2ca77 | 7,282 | cpp | C++ | dp/gl/src/Shader.cpp | asuessenbach/pipeline | 2e49968cc3b9948a57f7ee6c4cc3258925c92ab2 | [
"BSD-3-Clause"
] | 217 | 2015-01-06T09:26:53.000Z | 2022-03-23T14:03:18.000Z | dp/gl/src/Shader.cpp | asuessenbach/pipeline | 2e49968cc3b9948a57f7ee6c4cc3258925c92ab2 | [
"BSD-3-Clause"
] | 10 | 2015-01-25T12:42:05.000Z | 2017-11-28T16:10:16.000Z | dp/gl/src/Shader.cpp | asuessenbach/pipeline | 2e49968cc3b9948a57f7ee6c4cc3258925c92ab2 | [
"BSD-3-Clause"
] | 44 | 2015-01-13T01:19:41.000Z | 2022-02-21T21:35:08.000Z | // Copyright (c) 2010-2016, NVIDIA CORPORATION. All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of con... | 30.855932 | 92 | 0.634304 | asuessenbach |
d46f9faa425e0f5c23fb0c5f229aa7cc9b820409 | 1,153 | cpp | C++ | OperatorsAndConditions/06.PointDistance/Startup.cpp | Tanya-Zheleva/FMI-Intro-Programming | c326d331ac72bc41e4664b23fc56a4da7d2d6729 | [
"MIT"
] | 2 | 2020-10-27T09:27:14.000Z | 2021-10-09T14:57:15.000Z | OperatorsAndConditions/06.PointDistance/Startup.cpp | Tanya-Zheleva/FMI-Intro-Programming | c326d331ac72bc41e4664b23fc56a4da7d2d6729 | [
"MIT"
] | null | null | null | OperatorsAndConditions/06.PointDistance/Startup.cpp | Tanya-Zheleva/FMI-Intro-Programming | c326d331ac72bc41e4664b23fc56a4da7d2d6729 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
double x1 = 0, y1 = 0, x2 = 0, y2 = 0, x = 0, y = 0;
cin >> x1 >> y1 >> x2 >> y2 >> x >> y;
double distance = 0;
if (x >= x1 && x <= x2 && y >= y1 && y <= y2)
{
cout << "distance=" << distance << endl;
}
else
{
if (x > x1 && x < x2 &... | 20.589286 | 68 | 0.447528 | Tanya-Zheleva |
d471b6e9e858654e1c9ae2a9bdaa02e9dbc17322 | 22,747 | cpp | C++ | src/EditorRuntime/GUI/PreferencesGenerated.cpp | akumetsuv/flood | e0d6647df9b7fac72443a0f65c0003b0ead7ed3a | [
"BSD-2-Clause"
] | null | null | null | src/EditorRuntime/GUI/PreferencesGenerated.cpp | akumetsuv/flood | e0d6647df9b7fac72443a0f65c0003b0ead7ed3a | [
"BSD-2-Clause"
] | null | null | null | src/EditorRuntime/GUI/PreferencesGenerated.cpp | akumetsuv/flood | e0d6647df9b7fac72443a0f65c0003b0ead7ed3a | [
"BSD-2-Clause"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////
// C++ code generated with wxFormBuilder (version Jun 30 2011)
// http://www.wxformbuilder.org/
//
// PLEASE DO "NOT" EDIT THIS FILE!
///////////////////////////////////////////////////////////////////////////
#include "Editor/API.h"
... | 43.913127 | 191 | 0.728624 | akumetsuv |
d478c34c9e275be45836a40c4ceb1088c1206cf9 | 1,728 | cpp | C++ | third-party/Empirical/examples/math/math.cpp | koellingh/empirical-p53-simulator | aa6232f661e8fc65852ab6d3e809339557af521b | [
"MIT"
] | null | null | null | third-party/Empirical/examples/math/math.cpp | koellingh/empirical-p53-simulator | aa6232f661e8fc65852ab6d3e809339557af521b | [
"MIT"
] | null | null | null | third-party/Empirical/examples/math/math.cpp | koellingh/empirical-p53-simulator | aa6232f661e8fc65852ab6d3e809339557af521b | [
"MIT"
] | null | null | null | // This file is part of Empirical, https://github.com/devosoft/Empirical
// Copyright (C) Michigan State University, 2016-2017.
// Released under the MIT Software license; see doc/LICENSE
//
//
// Some examples code for using math functions.
#include <iostream>
#include "emp/math/math.hpp"
int main()
{
std::co... | 45.473684 | 102 | 0.488426 | koellingh |
d47a5cf69d13c7bea9bca793f3911943798bc2d2 | 2,915 | cpp | C++ | miditool/miditool.cpp | DannyHavenith/miditool | f3a371912ef5d2d5f23fce30c06a378575debb36 | [
"BSL-1.0"
] | null | null | null | miditool/miditool.cpp | DannyHavenith/miditool | f3a371912ef5d2d5f23fce30c06a378575debb36 | [
"BSL-1.0"
] | null | null | null | miditool/miditool.cpp | DannyHavenith/miditool | f3a371912ef5d2d5f23fce30c06a378575debb36 | [
"BSL-1.0"
] | null | null | null | //
// Copyright (C) 2012 Danny Havenith
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
#include <iostream>
#include <fstream>
#include <exception>
#include <iomanip> // for setiosflags, setw
#include... | 29.15 | 133 | 0.578731 | DannyHavenith |
d47f901d5644fd16a972e82ad4b2cfe6670851c4 | 512 | hxx | C++ | util-lib/include/util/VectorComparator.hxx | andrey-nakin/caen-v1720e-frontend | 00d713df62cf3abe330b08411e1f3732e56b4895 | [
"MIT"
] | null | null | null | util-lib/include/util/VectorComparator.hxx | andrey-nakin/caen-v1720e-frontend | 00d713df62cf3abe330b08411e1f3732e56b4895 | [
"MIT"
] | 8 | 2019-03-06T08:43:29.000Z | 2019-05-07T11:28:08.000Z | util-lib/include/util/VectorComparator.hxx | andrey-nakin/gneis-daq | 00d713df62cf3abe330b08411e1f3732e56b4895 | [
"MIT"
] | null | null | null | #pragma once
#include <cstring>
#include <vector>
namespace util {
class VectorComparator {
VectorComparator() = delete;
public:
template<typename ValueT>
static bool equal(std::vector<ValueT> const& a,
std::vector<ValueT> const& b) {
if (a.size() != b.size()) {
return false;
}
if (a.empty()) {
... | 13.128205 | 76 | 0.605469 | andrey-nakin |
d481bf312f155e5eedaad5a503d3e60689a8e52e | 6,271 | cc | C++ | src/SymmetryAxisNormal.cc | maruinen/FullereneViewer | da1554af2de21e90bfa0380a5b635f8bab8e2d8c | [
"Apache-2.0"
] | null | null | null | src/SymmetryAxisNormal.cc | maruinen/FullereneViewer | da1554af2de21e90bfa0380a5b635f8bab8e2d8c | [
"Apache-2.0"
] | null | null | null | src/SymmetryAxisNormal.cc | maruinen/FullereneViewer | da1554af2de21e90bfa0380a5b635f8bab8e2d8c | [
"Apache-2.0"
] | null | null | null | /*
* Project: FullereneViewer
* Version: 1.0
* Copyright: (C) 2011-14 Dr.Sc.KAWAMOTO,Takuji (Ext)
*/
#include <assert.h>
#include "SymmetryAxisNormal.h"
#include "CarbonAllotrope.h"
#include "OpenGLUtil.h"
#include "ShutUp.h"
SymmetryAxisNormal::SymmetryAxisNormal(CarbonAllotrope* ca, SymmetryAxis* axis)
: Inte... | 36.672515 | 103 | 0.69351 | maruinen |
d482493f22cee7d1d51fd9516f9bc6a9e3f4c973 | 2,222 | cpp | C++ | Visual Studio 2010/Projects/bjarneStroustrupC++PartIII/bjarneStroustrupC++PartIII/Chapter20TryThis1.cpp | Ziezi/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 9 | 2018-10-24T15:16:47.000Z | 2021-12-14T13:53:50.000Z | Visual Studio 2010/Projects/bjarneStroustrupC++PartIII/bjarneStroustrupC++PartIII/Chapter20TryThis1.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | null | null | null | Visual Studio 2010/Projects/bjarneStroustrupC++PartIII/bjarneStroustrupC++PartIII/Chapter20TryThis1.cpp | ChrisBKirov/Programming-Principles-and-Practice-Using-C-by-Bjarne-Stroustrup- | 6fd64801863e883508f15d16398744405f4f9e34 | [
"Unlicense"
] | 7 | 2018-10-29T15:30:37.000Z | 2021-01-18T15:15:09.000Z | /*
TITLE Improving "ugly" code Chapter20TryThis1.cpp
"Bjarne Stroustrup "C++ Programming: Principles and Practice.""
COMMENT
Objective: If you were able how would you change Jill's code
to get rid of the ugliness?
Input: -
Output: -
Author: Chris B. Kirov
Date: 17. 02. 2017
*/
#in... | 21.572816 | 125 | 0.5045 | Ziezi |
d4839516c3e8b8be4f0bab362e61cfb67d92d376 | 1,125 | hpp | C++ | include/Frame.hpp | AgostonSzepessy/oxshans-battle | 15d4cd5eb6375cca5e8e426fc9b8f70e74ca28b0 | [
"MIT"
] | null | null | null | include/Frame.hpp | AgostonSzepessy/oxshans-battle | 15d4cd5eb6375cca5e8e426fc9b8f70e74ca28b0 | [
"MIT"
] | null | null | null | include/Frame.hpp | AgostonSzepessy/oxshans-battle | 15d4cd5eb6375cca5e8e426fc9b8f70e74ca28b0 | [
"MIT"
] | null | null | null | #pragma once
#include <SFML/Graphics.hpp>
#include <SFML/System.hpp>
#include <vector>
/**
* A class that .
*/
/**
* @brief The Frame class Contains the frames in a vector that are needed for an AnimatedSprite
* and the delay between each frame. A frame is an sf::IntRect and the
* AnimatedSprite uses that to fi... | 21.226415 | 95 | 0.661333 | AgostonSzepessy |
d48e6d4501bd9a61aedb5138d3e0d499ed60ec4e | 356 | cpp | C++ | libs/libc/unistd.cpp | jasonwer/WingOS | 1e3b8b272bc93542fda48ed1cf3226e63c923f39 | [
"BSD-2-Clause"
] | null | null | null | libs/libc/unistd.cpp | jasonwer/WingOS | 1e3b8b272bc93542fda48ed1cf3226e63c923f39 | [
"BSD-2-Clause"
] | null | null | null | libs/libc/unistd.cpp | jasonwer/WingOS | 1e3b8b272bc93542fda48ed1cf3226e63c923f39 | [
"BSD-2-Clause"
] | null | null | null | #include "unistd.h"
#include <kern/syscall.h>
unsigned int sleep(unsigned int sec)
{
timespec time = {0, 0};
time.tv_sec = sec;
return sys::sys$nano_sleep(&time, nullptr);
}
suseconds_t usleep(suseconds_t sec)
{
timespec time = {0, 0};
time.tv_sec = 0;
time.tv_nsec = sec * 1000;
return sys... | 19.777778 | 47 | 0.646067 | jasonwer |
d491564c71c02486d74c18544dd6e9165346ab3f | 6,337 | hpp | C++ | include/dragon/graph/graph.hpp | parth-07/dragon | 2e771d698398303c8ae6d603d28bc3acfa116181 | [
"MIT"
] | 1 | 2021-02-24T17:51:32.000Z | 2021-02-24T17:51:32.000Z | include/dragon/graph/graph.hpp | parth-07/dragon | 2e771d698398303c8ae6d603d28bc3acfa116181 | [
"MIT"
] | 1 | 2021-02-24T17:57:04.000Z | 2021-05-17T11:09:40.000Z | include/dragon/graph/graph.hpp | parth-07/ds-and-algos | 2e771d698398303c8ae6d603d28bc3acfa116181 | [
"MIT"
] | null | null | null | #ifndef DRAGON_GRAPH_GRAPH_HPP
#define DRAGON_GRAPH_GRAPH_HPP
#include <limits>
#include <map>
#include <vector>
namespace dragon {
/**
* `Graph` is an efficient, easy to use generic implementation of the basic
* graph data structure.
*
* @param ValueT type of value of graph nodes.
* @param EdgeValueT type of wei... | 29.751174 | 79 | 0.666246 | parth-07 |
d49271aab644f8d38800109d637721cba882a027 | 11,956 | cpp | C++ | cmd/silkrpc_toolbox.cpp | enriavil1/silkrpc | 1fa2109658d4c89b6cfdd5190d919bd1324f367e | [
"Apache-2.0"
] | null | null | null | cmd/silkrpc_toolbox.cpp | enriavil1/silkrpc | 1fa2109658d4c89b6cfdd5190d919bd1324f367e | [
"Apache-2.0"
] | null | null | null | cmd/silkrpc_toolbox.cpp | enriavil1/silkrpc | 1fa2109658d4c89b6cfdd5190d919bd1324f367e | [
"Apache-2.0"
] | null | null | null | /*
Copyright 2020-2021 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 agr... | 41.513889 | 134 | 0.640683 | enriavil1 |
d49658b46836b6b2620117739b0a4e5e9eb6a2cb | 836 | cpp | C++ | tests/math_unit/math/rev/scal/fun/digamma_test.cpp | alashworth/stan-monorepo | 75596bc1f860ededd7b3e9ae9002aea97ee1cd46 | [
"BSD-3-Clause"
] | 1 | 2019-09-06T15:53:17.000Z | 2019-09-06T15:53:17.000Z | tests/math_unit/math/rev/scal/fun/digamma_test.cpp | alashworth/stan-monorepo | 75596bc1f860ededd7b3e9ae9002aea97ee1cd46 | [
"BSD-3-Clause"
] | 8 | 2019-01-17T18:51:16.000Z | 2019-01-17T18:51:39.000Z | tests/math_unit/math/rev/scal/fun/digamma_test.cpp | alashworth/stan-monorepo | 75596bc1f860ededd7b3e9ae9002aea97ee1cd46 | [
"BSD-3-Clause"
] | null | null | null | #include <stan/math/rev/scal.hpp>
#include <gtest/gtest.h>
#include <math/rev/scal/fun/nan_util.hpp>
#include <math/rev/scal/util.hpp>
#include <boost/math/special_functions/digamma.hpp>
#include <boost/math/special_functions/zeta.hpp>
TEST(AgradRev, digamma) {
AVAR a = 0.5;
AVAR f = digamma(a);
EXPECT_FLOAT_EQ(... | 22.594595 | 54 | 0.704545 | alashworth |
d49a88af357d8cbe7924edd00ab4b2f556ee786b | 2,238 | tcc | C++ | phpcxx/fcall.tcc | sjinks/php-cxx | c519f841c2d7122bcf02db7d43a109a6ec818e1d | [
"MIT"
] | 5 | 2017-02-26T23:55:20.000Z | 2019-10-12T04:04:38.000Z | phpcxx/fcall.tcc | sjinks/php-cxx | c519f841c2d7122bcf02db7d43a109a6ec818e1d | [
"MIT"
] | 25 | 2017-03-18T07:03:42.000Z | 2018-03-28T21:33:57.000Z | phpcxx/fcall.tcc | sjinks/php-cxx | c519f841c2d7122bcf02db7d43a109a6ec818e1d | [
"MIT"
] | 1 | 2017-03-18T07:27:25.000Z | 2017-03-18T07:27:25.000Z | #ifndef PHPCXX_FCALL_TCC
#define PHPCXX_FCALL_TCC
#ifndef PHPCXX_FCALL_H
#error "Please do not include this file directly, use fcall.h instead"
#endif
#include "array.h"
#include "value.h"
#include "bailoutrestorer.h"
namespace {
/**
* @internal
* @brief Helper function for codecov (`_zend_bailout` is for some re... | 24.064516 | 133 | 0.628686 | sjinks |
d49f7b41346bf9acb7b3d683c824f176ca38aca6 | 1,481 | cpp | C++ | set1/repeat_key_xor_test.cpp | guzhoucan/cryptopals | a45280158867a86b5d8c61bf7194277d05abdf14 | [
"MIT"
] | 1 | 2020-08-07T22:38:27.000Z | 2020-08-07T22:38:27.000Z | set1/repeat_key_xor_test.cpp | guzhoucan/cryptopals | a45280158867a86b5d8c61bf7194277d05abdf14 | [
"MIT"
] | null | null | null | set1/repeat_key_xor_test.cpp | guzhoucan/cryptopals | a45280158867a86b5d8c61bf7194277d05abdf14 | [
"MIT"
] | null | null | null | #include "repeat_key_xor.h"
#include <fstream>
#include "absl/strings/escaping.h"
#include "gtest/gtest.h"
namespace cryptopals {
namespace {
TEST(RepeatKeyXorTest, RepeatKeyXorEncode) {
std::string key = "ICE";
std::string plaintext =
"Burning 'em, if you ain't quick and nimble\nI go crazy when I hear a ... | 30.854167 | 80 | 0.713032 | guzhoucan |
d4a03b833995edadf3870c0ab6fb12ddb9534388 | 1,151 | hpp | C++ | src/Logic/JFIFRewriter.hpp | vividos/RemotePhotoTool | d17ae2abbda531acbd0ec8e90ddc4856c4fdfa00 | [
"BSD-2-Clause"
] | 16 | 2015-03-26T02:32:43.000Z | 2021-10-18T16:34:31.000Z | src/Logic/JFIFRewriter.hpp | vividos/RemotePhotoTool | d17ae2abbda531acbd0ec8e90ddc4856c4fdfa00 | [
"BSD-2-Clause"
] | 7 | 2019-02-21T06:07:09.000Z | 2022-01-01T10:00:50.000Z | src/Logic/JFIFRewriter.hpp | vividos/RemotePhotoTool | d17ae2abbda531acbd0ec8e90ddc4856c4fdfa00 | [
"BSD-2-Clause"
] | 6 | 2019-05-07T09:21:15.000Z | 2021-09-01T06:36:24.000Z | //
// RemotePhotoTool - remote camera control software
// Copyright (C) 2008-2018 Michael Fink
//
/// \file JFIFRewriter.hpp JFIF (JPEG File Interchange Format) rewriter
//
#pragma once
// includes
#include <ulib/stream/IStream.hpp>
/// \brief JFIF rewriter
/// Loads JFIF data stream (used internally by JPEG images) ... | 23.979167 | 96 | 0.658558 | vividos |
d4a0b39ea7a1e18149b9e420fe6231854b636669 | 8,625 | cpp | C++ | examples/ota-provider-app/ota-provider-common/OTAProviderExample.cpp | jimlyall-q/connectedhomeip | e4d15a802e663f1f2ed7b8205f027d30e447eb0e | [
"Apache-2.0"
] | 19 | 2021-02-17T12:31:28.000Z | 2022-03-24T09:15:43.000Z | examples/ota-provider-app/ota-provider-common/OTAProviderExample.cpp | jimlyall-q/connectedhomeip | e4d15a802e663f1f2ed7b8205f027d30e447eb0e | [
"Apache-2.0"
] | 18 | 2021-06-01T20:01:19.000Z | 2022-03-11T09:43:52.000Z | examples/ota-provider-app/ota-provider-common/OTAProviderExample.cpp | jimlyall-q/connectedhomeip | e4d15a802e663f1f2ed7b8205f027d30e447eb0e | [
"Apache-2.0"
] | 14 | 2020-12-14T11:05:45.000Z | 2022-03-29T08:42:30.000Z | /*
*
* Copyright (c) 2021 Project CHIP 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
*
* http://www.apache.org/licenses/LICENSE... | 46.621622 | 131 | 0.69971 | jimlyall-q |
d4a81fdf75a61d38c73dcd454e601354f1b4ac0e | 461 | cpp | C++ | sqrt.cpp | LiFengcheng01/CPP-Homework | 192766b689996b166a394ceb4e9b256fa39e54e0 | [
"Apache-2.0"
] | 1 | 2018-10-12T05:00:45.000Z | 2018-10-12T05:00:45.000Z | sqrt.cpp | LiFengcheng01/CPP-Homework | 192766b689996b166a394ceb4e9b256fa39e54e0 | [
"Apache-2.0"
] | null | null | null | sqrt.cpp | LiFengcheng01/CPP-Homework | 192766b689996b166a394ceb4e9b256fa39e54e0 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cmath>
using namespace std;
int int_sqrt(int x);
int Mypow(int di,int mi);
int main()
{
int i;
for(i=0;i<=100;i++)
cout<<i<<" "<<int_sqrt(i)<<endl;
system("pause");
return 0;
}
int int_sqrt(int x)
{
int i;
for(i=0;;i++)
{
if(x>=Mypow(i,2)&&x<Mypow(i+1... | 14.40625 | 39 | 0.518438 | LiFengcheng01 |
d4aa0ce1738e379af3688b811645da90f4788173 | 12,682 | hpp | C++ | sdk/core/azure-core/inc/azure/core/http/http.hpp | ahsonkhan/azure-sdk-for-cpp | ae612c5db562bb2176bdbc3cc1550a2ed835d553 | [
"MIT"
] | null | null | null | sdk/core/azure-core/inc/azure/core/http/http.hpp | ahsonkhan/azure-sdk-for-cpp | ae612c5db562bb2176bdbc3cc1550a2ed835d553 | [
"MIT"
] | null | null | null | sdk/core/azure-core/inc/azure/core/http/http.hpp | ahsonkhan/azure-sdk-for-cpp | ae612c5db562bb2176bdbc3cc1550a2ed835d553 | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation. All rights reserved.
// SPDX-License-Identifier: MIT
/**
* @file
* @brief HTTP request and response functionality.
*/
#pragma once
#include "azure/core/case_insensitive_containers.hpp"
#include "azure/core/dll_import_export.hpp"
#include "azure/core/exception.hpp"
#include ... | 32.025253 | 100 | 0.6607 | ahsonkhan |
d4b604ba4e9830111aac0f0aa9f91986efd8a541 | 2,005 | cpp | C++ | AtCoder/E_CoinsRespawn.cpp | davimedio01/competitive-programming | e2a90f0183c11a90a50738a9a690efe03773d43f | [
"MIT"
] | 2 | 2020-09-10T15:48:02.000Z | 2020-09-12T00:05:35.000Z | AtCoder/E_CoinsRespawn.cpp | davimedio01/competitive-programming | e2a90f0183c11a90a50738a9a690efe03773d43f | [
"MIT"
] | null | null | null | AtCoder/E_CoinsRespawn.cpp | davimedio01/competitive-programming | e2a90f0183c11a90a50738a9a690efe03773d43f | [
"MIT"
] | 2 | 2020-09-09T17:01:05.000Z | 2020-09-09T17:02:27.000Z | #include <bits/stdc++.h>
using namespace std;
int N, M, P;
vector<tuple<int, int, long long>> grafo;
long long resp;
void BellmanFord(int inicio)
{
vector<long long> distancia(N + 1, LONG_LONG_MAX);
distancia[inicio] = 0;
//Verifica o looping negativo (não há máximo)
vector<bool> v... | 25.0625 | 71 | 0.4798 | davimedio01 |
d4b7acfb32f080d3f7986adf3300da9d34419eb3 | 12,490 | cpp | C++ | Backends/Graphics4/OpenGL/Sources/Kore/RenderTargetImpl.cpp | varomix/Kore | fca273e3d865898e87bebd9ee58b13635bcdfd5c | [
"Zlib"
] | null | null | null | Backends/Graphics4/OpenGL/Sources/Kore/RenderTargetImpl.cpp | varomix/Kore | fca273e3d865898e87bebd9ee58b13635bcdfd5c | [
"Zlib"
] | null | null | null | Backends/Graphics4/OpenGL/Sources/Kore/RenderTargetImpl.cpp | varomix/Kore | fca273e3d865898e87bebd9ee58b13635bcdfd5c | [
"Zlib"
] | null | null | null | #include "pch.h"
#include "RenderTargetImpl.h"
#include "ogl.h"
#include <Kore/Graphics4/Graphics.h>
#include <Kore/Log.h>
#include <Kore/System.h>
#ifdef KORE_ANDROID
#include <GLContext.h>
#endif
using namespace Kore;
#ifndef GL_RGBA16F_EXT
#define GL_RGBA16F_EXT 0x881A
#endif
#ifndef GL_RGBA32F_EXT
#define GL_RG... | 31.700508 | 159 | 0.766453 | varomix |
d4b9a9a7f341c505aef9f2b9e908a91ef4a6d1b8 | 473 | cpp | C++ | firmware/examples/Delay/source/main.cpp | znic1967/Khalils-Kids | 4e8d744837c1ba63adf3ec3ec317a40860b463aa | [
"Apache-2.0"
] | null | null | null | firmware/examples/Delay/source/main.cpp | znic1967/Khalils-Kids | 4e8d744837c1ba63adf3ec3ec317a40860b463aa | [
"Apache-2.0"
] | null | null | null | firmware/examples/Delay/source/main.cpp | znic1967/Khalils-Kids | 4e8d744837c1ba63adf3ec3ec317a40860b463aa | [
"Apache-2.0"
] | null | null | null | #include <inttypes.h>
#include <cstdint>
#include "utility/log.hpp"
#include "utility/time.hpp"
int main(void)
{
LOG_INFO("Delay Application Starting...");
LOG_INFO(
"This example merely prints a statement every second using the delay "
"function.");
uint32_t counter = 0;
while (true)
{
LO... | 19.708333 | 76 | 0.634249 | znic1967 |
d4cb4d5e46c607312b1d1c274f5280a31eb5ad58 | 2,145 | hpp | C++ | tiffconvert/Font.hpp | Imagine-Programming/tiffconvert | 1eba05f3f876ac669d28ab9309326376bef61ef1 | [
"MIT"
] | null | null | null | tiffconvert/Font.hpp | Imagine-Programming/tiffconvert | 1eba05f3f876ac669d28ab9309326376bef61ef1 | [
"MIT"
] | 3 | 2021-02-15T08:10:59.000Z | 2021-03-13T10:52:47.000Z | tiffconvert/Font.hpp | Imagine-Programming/tiffconvert | 1eba05f3f876ac669d28ab9309326376bef61ef1 | [
"MIT"
] | null | null | null | #pragma once
#ifndef libtiffconvert_font_h
#define libtiffconvert_font_h
#include "libtiffconvert.h"
#include <string>
#include <cstdint>
#include <Windows.h>
namespace TiffConvert {
/// <summary>
/// Flags that specify how a font should be loaded.
/// </summary>
enum FontConfig : uint32_t {
FONT_BOLD = (1 <<... | 28.986486 | 91 | 0.644755 | Imagine-Programming |
d4cec0522b84a09c904aa4bb7f30637fcf727dac | 3,702 | cpp | C++ | libs/multi_array/test/storage_order.cpp | zyiacas/boost-doc-zh | 689e5a3a0a4dbead1a960f7b039e3decda54aa2c | [
"BSL-1.0"
] | 198 | 2015-01-13T05:47:18.000Z | 2022-03-09T04:46:46.000Z | libs/multi_array/test/storage_order.cpp | sdfict/boost-doc-zh | 689e5a3a0a4dbead1a960f7b039e3decda54aa2c | [
"BSL-1.0"
] | 9 | 2015-01-28T16:33:19.000Z | 2020-04-12T23:03:28.000Z | libs/multi_array/test/storage_order.cpp | sdfict/boost-doc-zh | 689e5a3a0a4dbead1a960f7b039e3decda54aa2c | [
"BSL-1.0"
] | 139 | 2015-01-15T20:09:31.000Z | 2022-01-31T15:21:16.000Z | // Copyright 2002 The Trustees of Indiana University.
// Use, modification and distribution is subject to 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)
// Boost.MultiArray Library
// Authors: Ronald Garcia
// ... | 23.1375 | 75 | 0.551053 | zyiacas |
d4d6c86fbc8fe8dc720abba88f7ddf72d7917792 | 7,897 | cpp | C++ | all/native/renderers/NMLModelRenderer.cpp | mostafa-j13/mobile-sdk | 60d51e4d37c7fb9558b1310345083c7f7d6b79e7 | [
"BSD-3-Clause"
] | null | null | null | all/native/renderers/NMLModelRenderer.cpp | mostafa-j13/mobile-sdk | 60d51e4d37c7fb9558b1310345083c7f7d6b79e7 | [
"BSD-3-Clause"
] | null | null | null | all/native/renderers/NMLModelRenderer.cpp | mostafa-j13/mobile-sdk | 60d51e4d37c7fb9558b1310345083c7f7d6b79e7 | [
"BSD-3-Clause"
] | null | null | null | #include "NMLModelRenderer.h"
#include "components/ThreadWorker.h"
#include "datasources/VectorDataSource.h"
#include "graphics/Shader.h"
#include "graphics/ShaderManager.h"
#include "graphics/ViewState.h"
#include "graphics/utils/GLContext.h"
#include "layers/VectorLayer.h"
#include "projections/Projection.h"
#include... | 39.288557 | 214 | 0.635431 | mostafa-j13 |
d4d989943cc7f3ea91b3aa28139e790d5e4b652d | 1,219 | hpp | C++ | source/graphs/depth_first_search.hpp | pawel-kieliszczyk/algorithms | 0703ec99ce9fb215709b56fb0eefbdd576c71ed2 | [
"MIT"
] | null | null | null | source/graphs/depth_first_search.hpp | pawel-kieliszczyk/algorithms | 0703ec99ce9fb215709b56fb0eefbdd576c71ed2 | [
"MIT"
] | null | null | null | source/graphs/depth_first_search.hpp | pawel-kieliszczyk/algorithms | 0703ec99ce9fb215709b56fb0eefbdd576c71ed2 | [
"MIT"
] | null | null | null | #ifndef PK_GRAPHS_DEPTHFIRSTSEARCH_HPP
#define PK_GRAPHS_DEPTHFIRSTSEARCH_HPP
#include "stack.hpp"
#include "vector.hpp"
namespace pk
{
namespace graphs
{
class depth_first_search
{
public:
template<
class graph_type,
class visitor_type>
static void run(
const graph_typ... | 19.66129 | 98 | 0.541427 | pawel-kieliszczyk |
d4d98ae4a5a7b0a378fc0783f1409b9d0246eed3 | 1,547 | hpp | C++ | include/help_line.hpp | matt-harvey/swx | e7b10fe7d4bf0bd6581ceada53ad14b08bc1d852 | [
"Apache-2.0"
] | 7 | 2017-10-08T08:08:25.000Z | 2020-04-27T09:25:00.000Z | include/help_line.hpp | matt-harvey/swx | e7b10fe7d4bf0bd6581ceada53ad14b08bc1d852 | [
"Apache-2.0"
] | null | null | null | include/help_line.hpp | matt-harvey/swx | e7b10fe7d4bf0bd6581ceada53ad14b08bc1d852 | [
"Apache-2.0"
] | 1 | 2020-04-27T09:24:42.000Z | 2020-04-27T09:24:42.000Z | /*
* Copyright 2014 Matthew Harvey
*
* 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 agre... | 27.140351 | 75 | 0.740142 | matt-harvey |
d4da5e2271d4defc822bb600d756a6ff27a0535e | 214 | hpp | C++ | include/transactions/entities/BillGates.hpp | perriera/blockchain | 2c89ecc110dcc9c042bdb919c7cf3017a43d4ce8 | [
"MIT"
] | null | null | null | include/transactions/entities/BillGates.hpp | perriera/blockchain | 2c89ecc110dcc9c042bdb919c7cf3017a43d4ce8 | [
"MIT"
] | null | null | null | include/transactions/entities/BillGates.hpp | perriera/blockchain | 2c89ecc110dcc9c042bdb919c7cf3017a43d4ce8 | [
"MIT"
] | null | null | null | #ifndef _BILLGATES_HPP
#define _BILLGATES_HPP
#include <iostream>
#include "../../../extra/include/Definitions.hpp"
#include "../Entity.hpp"
class BillGates extends Entity {
public:
};
#endif // _BILLGATES_HPP
| 15.285714 | 49 | 0.728972 | perriera |
d4dc6e15a639a65d420fa629c3ea962a0daa2b07 | 5,268 | hpp | C++ | src/sdglib/readers/FileReader.hpp | KatOfCats/sdg | 1916e5c86dd88e601ab7476f38daef2bd3b3b6fc | [
"MIT"
] | null | null | null | src/sdglib/readers/FileReader.hpp | KatOfCats/sdg | 1916e5c86dd88e601ab7476f38daef2bd3b3b6fc | [
"MIT"
] | null | null | null | src/sdglib/readers/FileReader.hpp | KatOfCats/sdg | 1916e5c86dd88e601ab7476f38daef2bd3b3b6fc | [
"MIT"
] | null | null | null | //
// Created by Luis Yanes (EI) on 15/09/2017.
//
#ifndef SEQSORTER_FILEREADER_H
#define SEQSORTER_FILEREADER_H
#include <cstring>
#include <fstream>
#include <iostream>
#include <fcntl.h>
#include <sdglib/readers/Common.hpp>
#include <sdglib/utilities/OutputLog.hpp>
#include "kseq.hpp"
struct FastxReaderParams {
... | 29.931818 | 138 | 0.598899 | KatOfCats |
d4e1aecf20faef926ca29686f1962cabc17116de | 5,299 | cpp | C++ | ReferenceDesign/SampleQTHMI/SDLApps/Templates/ChoiceSet/test/ChoiceSetTest.cpp | zenghuan1/HMI_SDK_LIB | d0d03af04abe07f5ca087cabcbb1e4f4858f266a | [
"BSD-3-Clause"
] | 8 | 2019-01-04T10:08:39.000Z | 2021-12-13T16:34:08.000Z | ReferenceDesign/SampleQTHMI/SDLApps/Templates/ChoiceSet/test/ChoiceSetTest.cpp | zenghuan1/HMI_SDK_LIB | d0d03af04abe07f5ca087cabcbb1e4f4858f266a | [
"BSD-3-Clause"
] | 33 | 2017-07-27T09:51:59.000Z | 2018-07-13T09:45:52.000Z | ReferenceDesign/SampleQTHMI/SDLApps/Templates/ChoiceSet/test/ChoiceSetTest.cpp | JH-G/HMI_SDK_LIB | caa4eac66d1f3b76349ef5d6ca5cf7dd69fcd760 | [
"BSD-3-Clause"
] | 12 | 2017-07-28T02:54:53.000Z | 2022-02-20T15:48:24.000Z | #include "ChoiceSetTest.h"
using namespace test;
using namespace hmi_sdk;
using namespace rpc_test;
CChoiceSetTest::CChoiceSetTest()
{
}
void CChoiceSetTest::SetUpTestCase()
{
}
void CChoiceSetTest::TearDownTestCase()
{
}
void CChoiceSetTest::SetUp()
{
}
void CChoiceSetTest::TearDown()
{
}
TEST_F(CChoiceSetT... | 27.743455 | 106 | 0.727873 | zenghuan1 |
d4e7f73096ec165db0e99002e18f0747627aea84 | 15,597 | cc | C++ | src/driver/tcp/TcpConnection.cc | lsgw/longd | 31caabd42a47c05857ae98716ef877052092aabe | [
"MIT"
] | null | null | null | src/driver/tcp/TcpConnection.cc | lsgw/longd | 31caabd42a47c05857ae98716ef877052092aabe | [
"MIT"
] | null | null | null | src/driver/tcp/TcpConnection.cc | lsgw/longd | 31caabd42a47c05857ae98716ef877052092aabe | [
"MIT"
] | null | null | null | #include "driver.h"
#include "Buffer.h"
#include "sockets.h"
#include "tcp.h"
#include <strings.h>
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>
#include <errno.h>
class TcpConnnection : public driver<TcpConnnection> {
public:
void init(PortPtr port, MessagePtr& message) override
{
assert(message->type... | 31.509091 | 120 | 0.623838 | lsgw |
d4e812eef103969aebf1cacaaa70cb49ecaaf4be | 534 | cpp | C++ | path_planning/a_star/main.cpp | EatAllBugs/cpp_robotics | f0ee1b936f8f3d40ec78c30846cd1fbdf72ef27c | [
"MIT"
] | 1 | 2022-01-23T13:17:28.000Z | 2022-01-23T13:17:28.000Z | path_planning/a_star/main.cpp | yinflight/cpp_robotics | f0ee1b936f8f3d40ec78c30846cd1fbdf72ef27c | [
"MIT"
] | null | null | null | path_planning/a_star/main.cpp | yinflight/cpp_robotics | f0ee1b936f8f3d40ec78c30846cd1fbdf72ef27c | [
"MIT"
] | 1 | 2022-01-23T13:17:16.000Z | 2022-01-23T13:17:16.000Z | #include <iostream>
#include "a_star.hpp"
using namespace cpp_robotics::path_planning;
int main() {
std::cout << "Hello, World!" << std::endl;
//! load map data
cv::Mat map_data = cv::imread("../maps/map2.png", CV_8UC1);
if (map_data.empty()) {
std::cerr << "load map image fail." << std::endl;
return... | 25.428571 | 61 | 0.625468 | EatAllBugs |
d4f027e29b231c1032a15d9481272ce7db913a8a | 791 | cpp | C++ | LeetCode/ThousandOne/0287-find_duplicated_num.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0287-find_duplicated_num.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandOne/0287-find_duplicated_num.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 287. 寻找重复数
给定一个包含 n + 1 个整数的数组 nums，其数字都在 1 到 n 之间（包括 1 和 n），可知至少存在一个重复的整数。
假设只有一个重复的整数，找出这个重复的数。
示例 1:
输入: [1,3,4,2,2]
输出: 2
示例 2:
输入: [3,1,3,4,2]
输出: 3
说明：
不能更改原数组（假设数组是只读的）。
只能使用额外的 O(1) 的空间。
时间复杂度小于 O(n^2) 。
数组中只有一个重复的数字，但它可能不止重复出现一次。
*/
int findDuplicate(vector<int>& A)
{
i... | 14.125 | 64 | 0.529709 | Ginkgo-Biloba |
d4f2f70717ce542d8b524f37266924a3ed61637b | 19,726 | cpp | C++ | Backends/Graphics5/Vulkan/Sources/Kore/PipelineState5Impl.cpp | hyperluminality/Kinc | f1802becc92e9a9eaa2e13b205d6a18eb58359a3 | [
"Zlib"
] | null | null | null | Backends/Graphics5/Vulkan/Sources/Kore/PipelineState5Impl.cpp | hyperluminality/Kinc | f1802becc92e9a9eaa2e13b205d6a18eb58359a3 | [
"Zlib"
] | null | null | null | Backends/Graphics5/Vulkan/Sources/Kore/PipelineState5Impl.cpp | hyperluminality/Kinc | f1802becc92e9a9eaa2e13b205d6a18eb58359a3 | [
"Zlib"
] | null | null | null | #include "pch.h"
#include "Vulkan.h"
#include <kinc/graphics5/shader.h>
#include <kinc/graphics5/pipeline.h>
#include <assert.h>
#include <malloc.h>
#include <map>
#include <string>
#include <string.h>
extern VkDevice device;
extern VkRenderPass render_pass;
extern VkDescriptorSet desc_set;
bool memory_type_from_p... | 34.913274 | 166 | 0.759302 | hyperluminality |
be02da1e4682e055e9bd49fd7c5f526f8bf1be96 | 2,031 | cpp | C++ | src/Graphics/Camera.cpp | khskarl/tori | 52e07e7b8bdbab7b46c4565a6be9353c0ce59422 | [
"MIT"
] | 2 | 2018-07-05T23:50:20.000Z | 2020-02-07T12:34:05.000Z | src/Graphics/Camera.cpp | khskarl/tori | 52e07e7b8bdbab7b46c4565a6be9353c0ce59422 | [
"MIT"
] | null | null | null | src/Graphics/Camera.cpp | khskarl/tori | 52e07e7b8bdbab7b46c4565a6be9353c0ce59422 | [
"MIT"
] | null | null | null | #include "Camera.hpp"
#include <glm/gtx/rotate_vector.hpp>
#include <glm/gtc/matrix_transform.hpp>
Camera::Camera () {
this->BuildProjectionMatrix();
}
Camera::Camera (const glm::vec3 pos, const glm::vec3 direction, const float width, const float height) {
m_position = pos;
m_direction = direction;
m_width = w... | 24.178571 | 104 | 0.641556 | khskarl |
be07628f4cf1c892299c014a9e0346b5e18eb045 | 2,661 | cpp | C++ | outputDialogs/signaldata.cpp | kerdemdemir/sharpEar | 6193fad5a776b246caed72d89009d64afc1db5a0 | [
"BSD-4-Clause"
] | 5 | 2016-04-27T08:01:06.000Z | 2021-12-21T07:07:14.000Z | outputDialogs/signaldata.cpp | kerdemdemir/sharpEar | 6193fad5a776b246caed72d89009d64afc1db5a0 | [
"BSD-4-Clause"
] | 3 | 2016-04-27T08:02:17.000Z | 2017-04-18T18:46:40.000Z | outputDialogs/signaldata.cpp | kerdemdemir/sharpEar | 6193fad5a776b246caed72d89009d64afc1db5a0 | [
"BSD-4-Clause"
] | null | null | null | #include "signaldata.h"
#include <qvector.h>
#include <qmutex.h>
#include <qreadwritelock.h>
class SignalData::PrivateData
{
public:
PrivateData():
boundingRect( 1.0, 1.0, -2.0, -2.0 ) // invalid
{
values.reserve( 1000 );
}
inline void append( const QPointF &sample )
{
valu... | 20.469231 | 69 | 0.585118 | kerdemdemir |
be089947172f9410e10fb07cb376d3c43383fa65 | 5,762 | hpp | C++ | code/path_marker.hpp | LoginLEE/HKUST-COMP2012h-2D-Shooting-Game | d03812a4a8cba8d31873157d71818b8c67d495fd | [
"MIT"
] | null | null | null | code/path_marker.hpp | LoginLEE/HKUST-COMP2012h-2D-Shooting-Game | d03812a4a8cba8d31873157d71818b8c67d495fd | [
"MIT"
] | null | null | null | code/path_marker.hpp | LoginLEE/HKUST-COMP2012h-2D-Shooting-Game | d03812a4a8cba8d31873157d71818b8c67d495fd | [
"MIT"
] | null | null | null | #pragma once
#include <SFML/Graphics.hpp>
#include "global_defines.hpp"
#include "game_entity.hpp"
#include "collision_box.hpp"
#include "textured_block.hpp"
class Enemy;
/**
* @brief Class for Enemy Path Markers
*
* This class represents a invisible Entity that guides the Enemy and controls their pathing ar... | 29.548718 | 109 | 0.660708 | LoginLEE |
be157d8576d9ca5d82098886d9298f0c468cfbd9 | 1,553 | cpp | C++ | IntervalsList.cpp | alechh/test-opencv | ab82723e4f9dda88a63add60d5f28dda5a22bc73 | [
"Apache-2.0"
] | 1 | 2022-03-24T08:05:22.000Z | 2022-03-24T08:05:22.000Z | IntervalsList.cpp | alechh/test-opencv | ab82723e4f9dda88a63add60d5f28dda5a22bc73 | [
"Apache-2.0"
] | null | null | null | IntervalsList.cpp | alechh/test-opencv | ab82723e4f9dda88a63add60d5f28dda5a22bc73 | [
"Apache-2.0"
] | null | null | null | #include "IntervalsList.h"
#include <iostream>
/**
* Default constructor
*/
IntervalsList::IntervalsList()
{
head = nullptr;
tail = nullptr;
next = nullptr;
}
/**
* Destructor
*/
IntervalsList::~IntervalsList()
{
while (head != nullptr)
{
Interval* oldHead = head;
head = head->... | 19.17284 | 86 | 0.59369 | alechh |
be15ae8b056357a1e3842f6e767273f5e01852bd | 4,342 | hpp | C++ | nucleo-g431-akashi04-i2s/Core/Inc/murasaki_platform.hpp | suikan4github/murasaki_samples_audio | 30ce5bc821e529e3415c7983ed435dbacc9b1126 | [
"MIT"
] | 12 | 2019-02-24T05:22:37.000Z | 2021-10-01T05:56:59.000Z | nucleo-g431-akashi04-i2s/Core/Inc/murasaki_platform.hpp | suikan4github/murasaki_samples_audio | 30ce5bc821e529e3415c7983ed435dbacc9b1126 | [
"MIT"
] | 122 | 2019-02-23T13:51:42.000Z | 2021-11-13T01:24:34.000Z | nucleo-l412-64/Inc/murasaki_platform.hpp | suikan4github/murasaki_samples | f339c1bf555035f4416797e3938fbe25cc82414c | [
"MIT"
] | 3 | 2019-02-24T16:38:25.000Z | 2022-03-22T15:25:09.000Z | /**
* @file murasaki_platform.hpp
*
* @date 2017/11/12
* @author Seiichi "Suikan" Horie
* @brief An interface for the applicaiton from murasaki library to main.c
* @details
* The resources below are impremented in the murasaki_platform.cpp and serve as glue to the main.c.
*/
#ifndef MURASAKI_PLATFORM_HPP_
#def... | 30.363636 | 100 | 0.739982 | suikan4github |
be16f13425dc340b268540882541197a0db249a2 | 343 | cpp | C++ | src/filter_cells.cpp | LTLA/diet.scran | c274bf058e10c174a06a409af50fcad225d40f0d | [
"MIT"
] | null | null | null | src/filter_cells.cpp | LTLA/diet.scran | c274bf058e10c174a06a409af50fcad225d40f0d | [
"MIT"
] | null | null | null | src/filter_cells.cpp | LTLA/diet.scran | c274bf058e10c174a06a409af50fcad225d40f0d | [
"MIT"
] | null | null | null | #include "tatamize.h"
#include "scran/quality_control/FilterCells.hpp"
#include "Rcpp.h"
//[[Rcpp::export(rng=false)]]
SEXP filter_cells(SEXP x, Rcpp::LogicalVector discard) {
scran::FilterCells qc;
auto y = qc.run(extract_NumericMatrix_shared(x), static_cast<const int*>(discard.begin()));
return new_Matri... | 31.181818 | 95 | 0.723032 | LTLA |
be18722437b404c2701a0321ff7f681cac1ac88a | 1,777 | cpp | C++ | Prim's_Algorithm _for_MST.cpp | taareek/c-plus-plus | b9d04f710e9b2e65786618f8bbced4a56c149444 | [
"Unlicense"
] | null | null | null | Prim's_Algorithm _for_MST.cpp | taareek/c-plus-plus | b9d04f710e9b2e65786618f8bbced4a56c149444 | [
"Unlicense"
] | null | null | null | Prim's_Algorithm _for_MST.cpp | taareek/c-plus-plus | b9d04f710e9b2e65786618f8bbced4a56c149444 | [
"Unlicense"
] | null | null | null | #include<iostream>
#include<cstdlib>
#define a 9
using namespace std;
struct prims
{
int cost;
int parent;
bool visited;
};
void printGraph(int graph[a][a]){
for(int i=0; i<a; i++){
for(int j=0; j<a; j++){
cout<<graph[i][j]<<" ";
}
cout<<endl;
... | 20.662791 | 66 | 0.420934 | taareek |
be1aa88cce90ce63ac8cd0d78f3045ee6dd9cdf8 | 12,230 | hpp | C++ | framework/areg/base/RuntimeClassID.hpp | Ali-Nasrolahi/areg-sdk | 4fbc2f2644220196004a31672a697a864755f0b6 | [
"Apache-2.0"
] | 70 | 2021-07-20T11:26:16.000Z | 2022-03-27T11:17:43.000Z | framework/areg/base/RuntimeClassID.hpp | Ali-Nasrolahi/areg-sdk | 4fbc2f2644220196004a31672a697a864755f0b6 | [
"Apache-2.0"
] | 32 | 2021-07-31T05:20:44.000Z | 2022-03-20T10:11:52.000Z | framework/areg/base/RuntimeClassID.hpp | Ali-Nasrolahi/areg-sdk | 4fbc2f2644220196004a31672a697a864755f0b6 | [
"Apache-2.0"
] | 40 | 2021-11-02T09:45:38.000Z | 2022-03-27T11:17:46.000Z | #pragma once
/************************************************************************
* This file is part of the AREG SDK core engine.
* AREG SDK is dual-licensed under Free open source (Apache version 2.0
* License) and Commercial (with various pricing models) licenses, depending
* on the nature of the project (c... | 35.865103 | 107 | 0.553802 | Ali-Nasrolahi |
be1ec1f0e46485e8f7775cc784e8d2d64e8b2c98 | 1,200 | cpp | C++ | RLSimion/CNTKWrapper/InputData.cpp | xcillero001/SimionZoo | b343b08f3356e1aa230d4132b0abb58aac4c5e98 | [
"MIT"
] | 1 | 2019-02-21T10:40:28.000Z | 2019-02-21T10:40:28.000Z | RLSimion/CNTKWrapper/InputData.cpp | JosuGom3z/SimionZoo | b343b08f3356e1aa230d4132b0abb58aac4c5e98 | [
"MIT"
] | null | null | null | RLSimion/CNTKWrapper/InputData.cpp | JosuGom3z/SimionZoo | b343b08f3356e1aa230d4132b0abb58aac4c5e98 | [
"MIT"
] | null | null | null | #include "InputData.h"
#include "xmltags.h"
#include "ParameterValues.h"
#include "CNTKWrapperInternals.h"
#include "Exceptions.h"
InputData::InputData(tinyxml2::XMLElement * pParentNode)
{
m_id = pParentNode->Attribute(XML_ATTRIBUTE_Id);
if (m_id.empty())
throw ProblemParserElementNotFound(XML_ATTRIBUTE_Id);
... | 22.222222 | 132 | 0.758333 | xcillero001 |
be2028dd6194d28f16be8bda33256e006569f045 | 14,138 | cpp | C++ | private/src/diagnostic/IasDiagnosticStream.cpp | juimonen/SmartXbar | 033f521a5dba5bce5e097df9c98af5b2cc2636dd | [
"BSD-3-Clause"
] | 5 | 2018-11-05T07:37:58.000Z | 2022-03-04T06:40:09.000Z | private/src/diagnostic/IasDiagnosticStream.cpp | juimonen/SmartXbar | 033f521a5dba5bce5e097df9c98af5b2cc2636dd | [
"BSD-3-Clause"
] | null | null | null | private/src/diagnostic/IasDiagnosticStream.cpp | juimonen/SmartXbar | 033f521a5dba5bce5e097df9c98af5b2cc2636dd | [
"BSD-3-Clause"
] | 7 | 2018-12-04T07:32:19.000Z | 2021-02-17T11:28:28.000Z | /*
* Copyright (C) 2018 Intel Corporation.All rights reserved.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
/**
* File: IasDiagnosticStream.cpp
*/
#include <assert.h>
#include <ctime>
#include <cstdio>
#include <algorithm>
#include <chrono>
#include "diagnostic/IasDiagnosticStream.hpp"
#include "diagnostic/Ias... | 33.742243 | 302 | 0.698331 | juimonen |
be25620a6c09d51fbd97664e0d6e263b4fb04e7f | 130 | cpp | C++ | src/modules/vmount/vmount.cpp | Diksha-agg/Firmware_val | 1efc1ba06997d19df3ed9bd927cfb24401b0fe03 | [
"BSD-3-Clause"
] | null | null | null | src/modules/vmount/vmount.cpp | Diksha-agg/Firmware_val | 1efc1ba06997d19df3ed9bd927cfb24401b0fe03 | [
"BSD-3-Clause"
] | null | null | null | src/modules/vmount/vmount.cpp | Diksha-agg/Firmware_val | 1efc1ba06997d19df3ed9bd927cfb24401b0fe03 | [
"BSD-3-Clause"
] | null | null | null | version https://git-lfs.github.com/spec/v1
oid sha256:c3585e2db12c3926546d8188a694cd568aa96746e1589110d909fb4649296d1f
size 18247
| 32.5 | 75 | 0.884615 | Diksha-agg |
be2927dafaa6379e3f2fe1a3f64700e9781ce4ed | 981 | cpp | C++ | examples/gpds/main.cpp | Tectu/cpp-properties | b56a5ae13a21a3d8569cce9290d8d8befae15f3f | [
"MIT"
] | 9 | 2021-01-08T11:44:14.000Z | 2021-09-05T13:48:35.000Z | examples/gpds/main.cpp | Tectu/cpp-properties | b56a5ae13a21a3d8569cce9290d8d8befae15f3f | [
"MIT"
] | 4 | 2021-01-07T22:32:41.000Z | 2021-09-14T20:08:04.000Z | examples/gpds/main.cpp | Tectu/cpp-properties | b56a5ae13a21a3d8569cce9290d8d8befae15f3f | [
"MIT"
] | 1 | 2021-03-04T06:28:20.000Z | 2021-03-04T06:28:20.000Z | #include <iostream>
#include <gpds/container.hpp>
#include <gpds/archiver_xml.hpp>
#include "cppproperties/properties.hpp"
#include "cppproperties/archiver_gpds.hpp"
struct shape :
tct::properties::properties
{
MAKE_PROPERTY(locked, bool);
MAKE_PROPERTY(x, int);
MAKE_PROPERTY(y, int);
MAKE_PROPER... | 20.87234 | 50 | 0.610601 | Tectu |
be2c2fafa2b3aed8c193c6c1bf55d2fdb5f05f13 | 965 | cpp | C++ | Medium/19_Remove_Nth_Node_From_End_of_List.cpp | Napolean28/leet | 80854c24a9549cc665bddc8e87489bd4b550a00d | [
"MIT"
] | 1 | 2019-12-24T19:41:34.000Z | 2019-12-24T19:41:34.000Z | Medium/19_Remove_Nth_Node_From_End_of_List.cpp | Napolean28/leet | 80854c24a9549cc665bddc8e87489bd4b550a00d | [
"MIT"
] | null | null | null | Medium/19_Remove_Nth_Node_From_End_of_List.cpp | Napolean28/leet | 80854c24a9549cc665bddc8e87489bd4b550a00d | [
"MIT"
] | 1 | 2019-12-23T10:20:00.000Z | 2019-12-23T10:20:00.000Z | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int getLen(ListNode* head){
int len = 0;
while(head != NULL){
len++;
head = head->next;... | 22.44186 | 56 | 0.448705 | Napolean28 |
be3001675b70a04f35feab7ee872b2a8bbfadc18 | 7,011 | cpp | C++ | src/core/postprocessing/backbuffer_resolver.cpp | SleepKiller/swbfii-shaderpatch | b49ce3349d4dd09b19237ff4766652166ba1ffd4 | [
"MIT"
] | 5 | 2018-03-02T04:02:39.000Z | 2018-08-07T19:36:50.000Z | src/core/postprocessing/backbuffer_resolver.cpp | SleepKiller/swbfii-shaderpatch | b49ce3349d4dd09b19237ff4766652166ba1ffd4 | [
"MIT"
] | 27 | 2018-03-10T20:37:38.000Z | 2018-10-08T11:10:34.000Z | src/core/postprocessing/backbuffer_resolver.cpp | SleepKiller/swbfii-shaderpatch | b49ce3349d4dd09b19237ff4766652166ba1ffd4 | [
"MIT"
] | null | null | null |
#include "backbuffer_resolver.hpp"
#include "../d3d11_helpers.hpp"
#include <DirectXTex.h>
namespace sp::core::postprocessing {
Backbuffer_resolver::Backbuffer_resolver(Com_ptr<ID3D11Device5> device,
shader::Database& shaders)
: _resolve_vs{std::get<0>(
shaders.ve... | 36.326425 | 89 | 0.607046 | SleepKiller |
be336e816c8b899a7c976e3e9a0ac37c4b723b66 | 4,465 | cpp | C++ | armm/STM32/src/hwi2cslave_stm32_v1.cpp | Bergi84/vihal | 7c139b544bb5ed5a27088bbb6b993f061e055ce8 | [
"BSD-2-Clause"
] | 13 | 2018-02-26T14:56:02.000Z | 2022-03-31T06:01:56.000Z | armm/STM32/src/hwi2cslave_stm32_v1.cpp | Bergi84/vihal | 7c139b544bb5ed5a27088bbb6b993f061e055ce8 | [
"BSD-2-Clause"
] | 2 | 2022-03-12T10:18:07.000Z | 2022-03-14T20:06:26.000Z | armm/STM32/src/hwi2cslave_stm32_v1.cpp | Bergi84/vihal | 7c139b544bb5ed5a27088bbb6b993f061e055ce8 | [
"BSD-2-Clause"
] | 3 | 2020-11-04T09:15:01.000Z | 2021-07-06T09:42:00.000Z | /* -----------------------------------------------------------------------------
* This file is a part of the NVCM project: https://github.com/nvitya/nvcm
* Copyright (c) 2018 Viktor Nagy, nvitya
*
* This software is provided 'as-is', without any express or implied warranty.
* In no event will the authors be held ... | 20.864486 | 97 | 0.618365 | Bergi84 |
be3944e34edde676ff4d93b9d326f3e846e7198f | 5,877 | cpp | C++ | src/globalsearch/http/httprequestmanager.cpp | lilithean/XtalOpt | 9ebc125e6014b27e72a04fb62c8820c7b9670c61 | [
"BSD-3-Clause"
] | 23 | 2017-09-01T04:35:02.000Z | 2022-01-16T13:51:17.000Z | src/globalsearch/http/httprequestmanager.cpp | lilithean/XtalOpt | 9ebc125e6014b27e72a04fb62c8820c7b9670c61 | [
"BSD-3-Clause"
] | 20 | 2017-08-29T15:29:46.000Z | 2022-01-20T09:10:59.000Z | src/globalsearch/http/httprequestmanager.cpp | lilithean/XtalOpt | 9ebc125e6014b27e72a04fb62c8820c7b9670c61 | [
"BSD-3-Clause"
] | 21 | 2017-06-15T03:11:34.000Z | 2022-02-28T05:20:44.000Z | /**********************************************************************
HttpRequestManager - Submit http 'get' and 'post' requests with a
QNetworkAccessManager and receive the results
Copyright (C) 2017-2018 by Patrick Avery
This source code is released under the New BSD License, (the "Li... | 30.931579 | 80 | 0.674153 | lilithean |
be3deb80e8531487df0b431d675cadcadfb98212 | 3,633 | hpp | C++ | Periapsis/src/game/main_window.hpp | kulibali/periapsis | 8a8588caff526d3b17604c96338145329be160b8 | [
"MIT"
] | null | null | null | Periapsis/src/game/main_window.hpp | kulibali/periapsis | 8a8588caff526d3b17604c96338145329be160b8 | [
"MIT"
] | null | null | null | Periapsis/src/game/main_window.hpp | kulibali/periapsis | 8a8588caff526d3b17604c96338145329be160b8 | [
"MIT"
] | null | null | null | #ifndef PERIAPSIS_MAIN_WINDOW_H
#define PERIAPSIS_MAIN_WINDOW_H
//
// $Id$
//
// Copyright (c) 2008, The Periapsis Project. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
// ... | 35.271845 | 109 | 0.674649 | kulibali |
be3e65e07c3fcb64b7a52b965e48bccb6d9f8577 | 340 | cpp | C++ | src/patternMatchValidator/AnyPatternMatchValidator.cpp | sroehling/ChartPatternRecognitionLib | d9bd25c0fc5a8942bb98c74c42ab52db80f680c1 | [
"MIT"
] | 9 | 2019-07-15T19:10:07.000Z | 2021-12-14T12:16:18.000Z | src/patternMatchValidator/AnyPatternMatchValidator.cpp | sroehling/ChartPatternRecognitionLib | d9bd25c0fc5a8942bb98c74c42ab52db80f680c1 | [
"MIT"
] | null | null | null | src/patternMatchValidator/AnyPatternMatchValidator.cpp | sroehling/ChartPatternRecognitionLib | d9bd25c0fc5a8942bb98c74c42ab52db80f680c1 | [
"MIT"
] | 2 | 2020-05-23T03:25:25.000Z | 2021-11-19T16:41:44.000Z | /*
* AnyPatternMatchValidator.cpp
*
* Created on: Jun 18, 2014
* Author: sroehling
*/
#include <AnyPatternMatchValidator.h>
AnyPatternMatchValidator::AnyPatternMatchValidator() {
}
bool AnyPatternMatchValidator::validPattern(const PatternMatch &)
{
return true;
}
AnyPatternMatchValidator::~AnyPatternMa... | 15.454545 | 65 | 0.75 | sroehling |
be41f1e87de4fe59078b694951cb90900698e62d | 826 | cpp | C++ | src/gamelib/components/CollisionComponent.cpp | mall0c/GameLib | df4116b53c39be7b178dd87f7eb0fe32a94d00d3 | [
"MIT"
] | 1 | 2020-02-17T09:53:36.000Z | 2020-02-17T09:53:36.000Z | src/gamelib/components/CollisionComponent.cpp | mall0c/GameLib | df4116b53c39be7b178dd87f7eb0fe32a94d00d3 | [
"MIT"
] | null | null | null | src/gamelib/components/CollisionComponent.cpp | mall0c/GameLib | df4116b53c39be7b178dd87f7eb0fe32a94d00d3 | [
"MIT"
] | null | null | null | #include "gamelib/components/CollisionComponent.hpp"
#include "gamelib/core/geometry/CollisionSystem.hpp"
namespace gamelib
{
CollisionComponent::CollisionComponent()
{
_props.registerProperty("flags", flags, 0, num_colflags, str_colflags);
}
CollisionComponent::~CollisionComponent()
{
... | 20.146341 | 79 | 0.623487 | mall0c |
be45a5d04efd03001b7ea061367aba467b00b7ba | 349 | cpp | C++ | library/succinct/main.cpp | bluedawnstar/algorithm_library | 4c7f64ec61fc2ba059b64ad7ba20fcb5b838ced6 | [
"Unlicense"
] | 40 | 2017-11-26T05:29:18.000Z | 2020-11-13T00:29:26.000Z | library/succinct/main.cpp | bluedawnstar/algorithm_library | 4c7f64ec61fc2ba059b64ad7ba20fcb5b838ced6 | [
"Unlicense"
] | 101 | 2019-02-09T06:06:09.000Z | 2021-12-25T16:55:37.000Z | library/succinct/main.cpp | bluedawnstar/algorithm_library | 4c7f64ec61fc2ba059b64ad7ba20fcb5b838ced6 | [
"Unlicense"
] | 6 | 2017-01-03T14:17:58.000Z | 2021-01-22T10:37:04.000Z | #include <iostream>
using namespace std;
#define TEST(ModuleName) extern void test##ModuleName(void); \
test##ModuleName()
int main(void) {
TEST(BitVectorRank);
TEST(WaveletTree);
TEST(WaveletTreeBitVector);
TEST(WaveletMatrix);
TEST(WaveletMatrixArray);
TEST(Wa... | 21.8125 | 65 | 0.659026 | bluedawnstar |
be46616bf23901fa75ab08931a99583b1bce52bd | 530 | hpp | C++ | unit_tests/classgenerator.hpp | julienlopez/CppDependencyAnalyzer | d29065e7988ef7f553785ce7cb8bf2bb03097c66 | [
"MIT"
] | null | null | null | unit_tests/classgenerator.hpp | julienlopez/CppDependencyAnalyzer | d29065e7988ef7f553785ce7cb8bf2bb03097c66 | [
"MIT"
] | 7 | 2019-12-10T12:59:20.000Z | 2020-07-01T14:13:44.000Z | unit_tests/classgenerator.hpp | julienlopez/CppDependencyAnalyzer | d29065e7988ef7f553785ce7cb8bf2bb03097c66 | [
"MIT"
] | null | null | null | #pragma once
#include "class.hpp"
namespace Testing
{
class ClassGenerator
{
public:
explicit ClassGenerator(std::wstring class_name = L"A", std::wstring header_file_name = L"a.hpp");
~ClassGenerator() = default;
operator Cda::ClassFiles() const;
ClassGenerator& addLine(std::wstring line);
privat... | 18.928571 | 102 | 0.713208 | julienlopez |
be4723f5197a44609d384533bee263f0f7a7494d | 4,825 | cpp | C++ | demo/sdk_demo_v2/SETTINGS_virtualBG_workflow.cpp | j421037/zoom | 3ba230a3ace50b7b8d722550eb320011a374f90d | [
"RSA-MD"
] | null | null | null | demo/sdk_demo_v2/SETTINGS_virtualBG_workflow.cpp | j421037/zoom | 3ba230a3ace50b7b8d722550eb320011a374f90d | [
"RSA-MD"
] | null | null | null | demo/sdk_demo_v2/SETTINGS_virtualBG_workflow.cpp | j421037/zoom | 3ba230a3ace50b7b8d722550eb320011a374f90d | [
"RSA-MD"
] | 3 | 2020-11-04T08:51:33.000Z | 2020-11-06T04:49:07.000Z | #include "stdafx.h"
#include "SETTINGS_virtualBG_workflow.h"
CSDKVirtualBGSettingsWorkFlow::CSDKVirtualBGSettingsWorkFlow()
{
m_pSettingService = NULL;
m_pVBGSettingContext = NULL;
m_pVideoSettingsContext = NULL;
m_pTestVideoDeviceHelper = NULL;
Init();
}
CSDKVirtualBGSettingsWorkFlow::~CSDKVirtualBGSettingsWorkF... | 28.382353 | 144 | 0.813886 | j421037 |
be487eca0271cd5326b4063632b42274629692ef | 1,363 | hpp | C++ | source/URI/Query.hpp | kurocha/uri | b920d01de5323126eaf539d4217d357b47fde64e | [
"Unlicense",
"MIT"
] | 2 | 2018-07-06T19:43:16.000Z | 2018-07-06T19:44:46.000Z | source/URI/Query.hpp | kurocha/uri | b920d01de5323126eaf539d4217d357b47fde64e | [
"Unlicense",
"MIT"
] | null | null | null | source/URI/Query.hpp | kurocha/uri | b920d01de5323126eaf539d4217d357b47fde64e | [
"Unlicense",
"MIT"
] | null | null | null | //
// Query.hpp
// File file is part of the "URI" project and released under the MIT License.
//
// Created by Samuel Williams on 17/7/2017.
// Copyright, 2017, by Samuel Williams. All rights reserved.
//
#pragma once
#include "Encoding.hpp"
#include <string>
#include <map>
namespace URI
{
/// Assumes applicat... | 28.395833 | 86 | 0.685253 | kurocha |
be56e60561f98ff854f29f7a4636fda78b0f6ce8 | 647 | hpp | C++ | src/Cell.hpp | JaroslawWiosna/nonogram-solver | 5d6f9eec5b56700e2930478e67bc99b7b8951664 | [
"MIT"
] | null | null | null | src/Cell.hpp | JaroslawWiosna/nonogram-solver | 5d6f9eec5b56700e2930478e67bc99b7b8951664 | [
"MIT"
] | null | null | null | src/Cell.hpp | JaroslawWiosna/nonogram-solver | 5d6f9eec5b56700e2930478e67bc99b7b8951664 | [
"MIT"
] | null | null | null | #pragma once
#include <array>
#include <cassert>
#include <functional>
#include <iostream>
#include <memory>
#include <vector>
enum class Cell_type {
unfilled = -1,
empty,
one,
};
struct Cell {
Cell_type type = Cell_type::unfilled;
void print() const {
switch (type) {
case Cel... | 18.485714 | 41 | 0.446677 | JaroslawWiosna |
be57434d352eadefc22396c8caa40c1f7027e55d | 807 | cc | C++ | src/.unfinished/_89-gray-code.cc | q191201771/yoko_leetcode | a29b163169f409856e9c9808890bcb25ca976f78 | [
"MIT"
] | 2 | 2018-07-28T06:11:30.000Z | 2019-01-15T15:16:54.000Z | src/.unfinished/_89-gray-code.cc | q191201771/yoko_leetcode | a29b163169f409856e9c9808890bcb25ca976f78 | [
"MIT"
] | null | null | null | src/.unfinished/_89-gray-code.cc | q191201771/yoko_leetcode | a29b163169f409856e9c9808890bcb25ca976f78 | [
"MIT"
] | null | null | null | The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A
gray code sequence must begin with 0.
Example 1:
Input: 2
Output: [0,1,3,2]
Explanation:
00 - 0
01 - 1
11 -... | 20.692308 | 116 | 0.677819 | q191201771 |
be586aef943398347d424720037eeb46d868e3a7 | 632 | cpp | C++ | FlightComputerV2/src/Mount.cpp | jowallace1/FlightComputerV2 | b8ea60bd370243ef05611267cba214bf72c34f9b | [
"MIT"
] | null | null | null | FlightComputerV2/src/Mount.cpp | jowallace1/FlightComputerV2 | b8ea60bd370243ef05611267cba214bf72c34f9b | [
"MIT"
] | null | null | null | FlightComputerV2/src/Mount.cpp | jowallace1/FlightComputerV2 | b8ea60bd370243ef05611267cba214bf72c34f9b | [
"MIT"
] | null | null | null | #include "Mount.h"
Mount::Mount(double yawRatio, unsigned int yawOffset, unsigned int yawPin, double pitchRatio, unsigned int pitchOffset, unsigned int pitchPin)
: yawRatio(yawRatio), pitchRatio(pitchRatio)
{
yawServo.offset = yawOffset;
yawServo.pin = yawPin;
pitchServo.offset = pitchOffset;
pitc... | 19.151515 | 142 | 0.683544 | jowallace1 |
41534a336201e5b58c51aa778b08dc92074aa99a | 21,709 | cpp | C++ | bindings/cpp/opencv_4/superres.cpp | bamorim/opencv-rust | d83ac457cea9540f2d535bc6158e1910ba887eea | [
"MIT"
] | null | null | null | bindings/cpp/opencv_4/superres.cpp | bamorim/opencv-rust | d83ac457cea9540f2d535bc6158e1910ba887eea | [
"MIT"
] | null | null | null | bindings/cpp/opencv_4/superres.cpp | bamorim/opencv-rust | d83ac457cea9540f2d535bc6158e1910ba887eea | [
"MIT"
] | null | null | null | #include "common.hpp"
#include <opencv2/superres.hpp>
#include "superres_types.hpp"
extern "C" {
Result<cv::Ptr<cv::superres::FrameSource>*> cv_superres_createFrameSource_Camera_int(int deviceId) {
try {
cv::Ptr<cv::superres::FrameSource> ret = cv::superres::createFrameSource_Camera(deviceId);
return Ok(new c... | 34.845907 | 298 | 0.752591 | bamorim |
4154f0845f18ec1e6c102c2171fd1da3a8b4d1d9 | 1,187 | cpp | C++ | src/unitTest/rootNodeTest/piecewiseLR_test.cpp | JiaoYiZhang/learned_index | bc8028edcc8c63609bbad7b9c591704fbca838bb | [
"MIT"
] | 3 | 2021-03-13T07:07:51.000Z | 2021-11-17T10:36:57.000Z | src/unitTest/rootNodeTest/piecewiseLR_test.cpp | JiaoYiZhang/learned_index | bc8028edcc8c63609bbad7b9c591704fbca838bb | [
"MIT"
] | null | null | null | src/unitTest/rootNodeTest/piecewiseLR_test.cpp | JiaoYiZhang/learned_index | bc8028edcc8c63609bbad7b9c591704fbca838bb | [
"MIT"
] | null | null | null | /**
* @file piecewiseLR_test.cpp
* @author Jiaoyi
* @brief
* @version 0.1
* @date 2021-11-03
*
* @copyright Copyright (c) 2021
*
*/
#include "../../include/nodes/rootNode/trainModel/piecewiseLR.h"
#include "../../experiment/dataset/lognormal_distribution.h"
#include "gtest/gtest.h"
std::vector<std::pair<dou... | 24.729167 | 64 | 0.69166 | JiaoYiZhang |
415704f4b50e4fbda53e66a4c20d451e2d2493ec | 933 | cpp | C++ | luogu_1378/luogu_1378.cpp | skyfackr/luogu_personal_cppcode | b59af9839745d65091e6c01cddf53e5bb6fb274a | [
"BSD-3-Clause"
] | null | null | null | luogu_1378/luogu_1378.cpp | skyfackr/luogu_personal_cppcode | b59af9839745d65091e6c01cddf53e5bb6fb274a | [
"BSD-3-Clause"
] | null | null | null | luogu_1378/luogu_1378.cpp | skyfackr/luogu_personal_cppcode | b59af9839745d65091e6c01cddf53e5bb6fb274a | [
"BSD-3-Clause"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
double allsquare;
double beginx,beginy,endx,endy,ans;
bool bj[10];
int n,i,j,k;
const double pi=3.1415926535;
struct oils
{
double x,y;
double r;
} oil[10];
void rget(int i)
{
oil[i].r=min(min(abs(oil[i].x-beginx),abs(oil[i].x-endx)),min(abs(oil[i].y-beginy),abs(oil[i... | 16.660714 | 106 | 0.562701 | skyfackr |
4159c0f78d3e75c0d3e38523117ebefd0e8603f1 | 4,095 | cpp | C++ | PseudoContact.cpp | fanufree/assign-it | 7eae0828aea4964f1d459a14a0e13025fefc4c9a | [
"MIT"
] | null | null | null | PseudoContact.cpp | fanufree/assign-it | 7eae0828aea4964f1d459a14a0e13025fefc4c9a | [
"MIT"
] | null | null | null | PseudoContact.cpp | fanufree/assign-it | 7eae0828aea4964f1d459a14a0e13025fefc4c9a | [
"MIT"
] | null | null | null | /*
* PseudoContact.cpp
*
* Created on: 2012-05-03
* Author: e4k2
*/
#include <algorithm>
#include <cassert>
#include "PseudoContact.h"
#include "Utilities.h"
PseudoContact::PseudoContact() : contacts(), res1(-1), res2(-1)
{
}
PseudoContact::PseudoContact(const Contact& c) : contacts(), res1(c.r1->num), r... | 20.475 | 111 | 0.652259 | fanufree |
415a0601f9d104e6a6c2922a448f82de09c901bf | 6,714 | hpp | C++ | test/profiling/PubSubWriter.hpp | zhangzhimin/Fast-RTPS | 3032f11d0c62d226eea39ea4f8428afef4558693 | [
"Apache-2.0"
] | null | null | null | test/profiling/PubSubWriter.hpp | zhangzhimin/Fast-RTPS | 3032f11d0c62d226eea39ea4f8428afef4558693 | [
"Apache-2.0"
] | null | null | null | test/profiling/PubSubWriter.hpp | zhangzhimin/Fast-RTPS | 3032f11d0c62d226eea39ea4f8428afef4558693 | [
"Apache-2.0"
] | 1 | 2021-08-23T01:09:51.000Z | 2021-08-23T01:09:51.000Z | // Copyright 2016 Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless re... | 28.09205 | 135 | 0.634346 | zhangzhimin |
4163f0229edb2eeda4f6cdd66a0b3c9b5e0da52e | 2,216 | hpp | C++ | src/common/Surface.hpp | LibreSprite/Dotto | 3d057875fd0e33d2a72add44c316af9fdc5be7c8 | [
"MIT"
] | 151 | 2021-12-28T21:22:42.000Z | 2022-03-30T13:53:28.000Z | src/common/Surface.hpp | LibreSprite/Dotto | 3d057875fd0e33d2a72add44c316af9fdc5be7c8 | [
"MIT"
] | 9 | 2021-12-29T13:20:00.000Z | 2022-03-18T12:47:19.000Z | src/common/Surface.hpp | Linux-Gamer/Dotto | ed722f0bbcbcb230b7c40977a5552cba81e5075d | [
"MIT"
] | 18 | 2021-12-28T19:58:49.000Z | 2022-03-31T16:38:14.000Z | // Copyright (c) 2021 LibreSprite Authors (cf. AUTHORS.md)
// This file is released under the terms of the MIT license.
// Read LICENSE.txt for more information.
#pragma once
#include <memory>
#include <variant>
#include <common/Color.hpp>
#include <common/Rect.hpp>
#include <common/types.hpp>
#include <gui/Texture.... | 29.157895 | 79 | 0.636733 | LibreSprite |
416b5fab9b61a030672653091ad09ce3e4bb9f7a | 3,965 | hpp | C++ | ql/experimental/preexperimental/cmsSwap.hpp | universe1987/QuantLib | bbb0145aff285853755b9f6ed013f53a41163acb | [
"BSD-3-Clause"
] | 4 | 2016-03-28T15:05:23.000Z | 2020-02-17T23:05:57.000Z | ql/experimental/preexperimental/cmsSwap.hpp | universe1987/QuantLib | bbb0145aff285853755b9f6ed013f53a41163acb | [
"BSD-3-Clause"
] | 1 | 2015-02-02T20:32:43.000Z | 2015-02-02T20:32:43.000Z | ql/experimental/preexperimental/cmsSwap.hpp | pcaspers/quantlib | bbb0145aff285853755b9f6ed013f53a41163acb | [
"BSD-3-Clause"
] | 10 | 2015-01-26T14:50:24.000Z | 2015-10-23T07:41:30.000Z | /*! \file cmsSwap.hpp
\brief Cms Swap
Peter Caspers
*/
#include <ql/quantlib.hpp>
#include <CmsPricer.hpp>
#ifndef quantlib_cmsSwap_hpp
#define quantlib_cmsSwap_hpp
using namespace boost;
using namespace std;
namespace QuantLib {
/*! cms swap */
class CmsSwap {
public:
/*! construct cms swap
fo... | 35.720721 | 188 | 0.743253 | universe1987 |
416b984d852fec81708615caf4def63394124b70 | 1,056 | cpp | C++ | src/NeuralNetwork.cpp | lymven-io/NeuralNet | a1f997cea55d9e74e766c8a7f81e0d76e88f81b1 | [
"MIT"
] | null | null | null | src/NeuralNetwork.cpp | lymven-io/NeuralNet | a1f997cea55d9e74e766c8a7f81e0d76e88f81b1 | [
"MIT"
] | null | null | null | src/NeuralNetwork.cpp | lymven-io/NeuralNet | a1f997cea55d9e74e766c8a7f81e0d76e88f81b1 | [
"MIT"
] | null | null | null | #include "../include/NeuralNetwork.hpp"
void NeuralNetwork::printToConsole()
{
for(int i = 0; i < this->layers.size(); i++)
{
if(i == 0) {
Matrix *m = this->layers.at(i)->matrixifyVals();
m->printToConsole();
}
else {
Matrix *m = this->layers.at(i)->m... | 25.142857 | 73 | 0.542614 | lymven-io |
416def2f661532e2721ba6137ca76ccaa59f3195 | 72 | hpp | C++ | include/mruby_integration/shapes/pixel.hpp | HellRok/Taylor | aa9d901b4db77395a0bde896500016353adcd73b | [
"MIT"
] | 40 | 2021-05-25T04:21:49.000Z | 2022-02-19T05:05:45.000Z | include/mruby_integration/shapes/pixel.hpp | HellRok/Taylor | aa9d901b4db77395a0bde896500016353adcd73b | [
"MIT"
] | 4 | 2021-09-17T06:52:35.000Z | 2021-12-29T23:07:18.000Z | include/mruby_integration/shapes/pixel.hpp | HellRok/Taylor | aa9d901b4db77395a0bde896500016353adcd73b | [
"MIT"
] | 1 | 2021-12-23T00:59:27.000Z | 2021-12-23T00:59:27.000Z | #pragma once
#include "mruby.h"
void append_shapes_pixel(mrb_state*);
| 12 | 37 | 0.763889 | HellRok |
4174b84df1271075afe71f1bb0f028e0b2917692 | 3,898 | cpp | C++ | examples/model.cpp | afranchuk/clipp | 74f40c1718acc0822a4338587b9bbea9fdc5f737 | [
"MIT"
] | 910 | 2017-11-08T20:27:19.000Z | 2022-03-31T03:35:11.000Z | examples/model.cpp | afranchuk/clipp | 74f40c1718acc0822a4338587b9bbea9fdc5f737 | [
"MIT"
] | 58 | 2017-11-15T20:13:10.000Z | 2022-03-26T20:14:22.000Z | examples/model.cpp | afranchuk/clipp | 74f40c1718acc0822a4338587b9bbea9fdc5f737 | [
"MIT"
] | 98 | 2017-11-11T00:02:07.000Z | 2022-03-29T06:54:19.000Z | /*****************************************************************************
*
* demo program - part of CLIPP (command line interfaces for modern C++)
*
* released under MIT license
*
* (c) 2017-2018 André Müller; foss@andremueller-online.de
*
******************************************************************... | 28.452555 | 86 | 0.491534 | afranchuk |
41780564bbf49892598f3708aef43749eaedd17a | 1,173 | hpp | C++ | Types/Containers/GpBytesArray.hpp | ITBear/GpCore2 | 7ae6d9d93aae55e2b3060077b5bb9d5f07e59ee4 | [
"MIT"
] | null | null | null | Types/Containers/GpBytesArray.hpp | ITBear/GpCore2 | 7ae6d9d93aae55e2b3060077b5bb9d5f07e59ee4 | [
"MIT"
] | 1 | 2020-06-19T18:38:40.000Z | 2020-06-19T18:38:40.000Z | Types/Containers/GpBytesArray.hpp | ITBear/GpCore2 | 7ae6d9d93aae55e2b3060077b5bb9d5f07e59ee4 | [
"MIT"
] | 6 | 2020-06-04T07:32:59.000Z | 2021-05-17T15:41:30.000Z | #pragma once
#include "../../Config/GpConfig.hpp"
#if defined(GP_USE_CONTAINERS)
#include "GpContainersT.hpp"
#include "../../Constexpr/GpConstexprIterator.hpp"
#include "../Pointers/GpRawPtr.hpp"
namespace GPlatform {
using GpBytesArray = GpVector<std::byte>;
class GpBytesArrayUtils
{
CLASS_R... | 24.957447 | 95 | 0.614663 | ITBear |
417b1b70e7606aacc175addf77c75c6a4037f285 | 16,048 | hpp | C++ | sprout/type_traits/std_type_traits.hpp | EzoeRyou/Sprout | 12e12373d0f70543eac5f2ecfbec8f5112765f98 | [
"BSL-1.0"
] | 1 | 2016-09-29T21:55:58.000Z | 2016-09-29T21:55:58.000Z | sprout/type_traits/std_type_traits.hpp | EzoeRyou/Sprout | 12e12373d0f70543eac5f2ecfbec8f5112765f98 | [
"BSL-1.0"
] | null | null | null | sprout/type_traits/std_type_traits.hpp | EzoeRyou/Sprout | 12e12373d0f70543eac5f2ecfbec8f5112765f98 | [
"BSL-1.0"
] | null | null | null | /*=============================================================================
Copyright (c) 2011-2014 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
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.tx... | 33.433333 | 112 | 0.730122 | EzoeRyou |
417c4a8dbd295fa9a54b47e487a667ba1b57d815 | 5,772 | cpp | C++ | src/common/test/test_term_tokenizer.cpp | datavetaren/prologcoin | 8583db7d99a8007f634210aefdfb92bf45596fd3 | [
"MIT"
] | 38 | 2017-06-14T07:13:10.000Z | 2022-02-16T15:41:25.000Z | src/common/test/test_term_tokenizer.cpp | datavetaren/prologcoin | 8583db7d99a8007f634210aefdfb92bf45596fd3 | [
"MIT"
] | 10 | 2017-07-01T11:13:10.000Z | 2021-02-27T05:40:30.000Z | src/common/test/test_term_tokenizer.cpp | datavetaren/prologcoin | 8583db7d99a8007f634210aefdfb92bf45596fd3 | [
"MIT"
] | 7 | 2017-07-05T20:38:51.000Z | 2021-08-02T04:30:46.000Z | #include <iostream>
#include <iomanip>
#include <assert.h>
#include <common/term_tokenizer.hpp>
#include <common/token_chars.hpp>
using namespace prologcoin::common;
static void header( const std::string &str )
{
std::cout << "\n";
std::cout << "--- [" + str + "] " + std::string(60 - str.length(), '-') << "\n... | 33.754386 | 190 | 0.537769 | datavetaren |
41810bee9ee062e7d157e3b6810e18d0ad0ab638 | 41 | cpp | C++ | libwinston/Route.cpp | danie1kr/winston | 18fe865dc59e8315cb1d85c6fa60c4ddeaf83202 | [
"MIT"
] | null | null | null | libwinston/Route.cpp | danie1kr/winston | 18fe865dc59e8315cb1d85c6fa60c4ddeaf83202 | [
"MIT"
] | null | null | null | libwinston/Route.cpp | danie1kr/winston | 18fe865dc59e8315cb1d85c6fa60c4ddeaf83202 | [
"MIT"
] | null | null | null | #include "Route.h"
namespace winston {
} | 10.25 | 19 | 0.707317 | danie1kr |
4181584b4077eb16adf436c1548283fa45fe66fc | 2,530 | cc | C++ | local/Ground.cc | jube/pong | df14055f4185a6b680acb9de685a94ccd6b33946 | [
"MIT"
] | null | null | null | local/Ground.cc | jube/pong | df14055f4185a6b680acb9de685a94ccd6b33946 | [
"MIT"
] | null | null | null | local/Ground.cc | jube/pong | df14055f4185a6b680acb9de685a94ccd6b33946 | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2015, Julien Bernard
*
* 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, pub... | 32.857143 | 84 | 0.706719 | jube |
41868d148862cc4c37bf157b2c06ca6d9b488c22 | 1,002 | cpp | C++ | 14/tests/into.cpp | rapha-opensource/viper | 78f25771c7198ac66b846afde3f38c8b2c1c7cc9 | [
"MIT"
] | 2 | 2018-04-28T19:54:49.000Z | 2021-01-13T17:31:12.000Z | 17/tests/into.cpp | rapha-opensource/viper | 78f25771c7198ac66b846afde3f38c8b2c1c7cc9 | [
"MIT"
] | null | null | null | 17/tests/into.cpp | rapha-opensource/viper | 78f25771c7198ac66b846afde3f38c8b2c1c7cc9 | [
"MIT"
] | null | null | null | #include <vector>
#include "catch.hpp"
#include "../headers/iterator_cast.h"
SCENARIO(" 'into' with only an input container, no transformation", "[into]") {
GIVEN(" a std::vector<char> vc") {
std::vector<char> vc{'a','b','c','d'};
WHEN( " make a string using into<std::string>(vc) " ) {
... | 23.302326 | 89 | 0.474052 | rapha-opensource |
4189e9260add3f96370d11651bb4c773844223d5 | 2,658 | cpp | C++ | contracts/calculator/calc.cpp | koinos/koinos-contract-examples | 27f2bd11b31997ac69d824a5d8a729295072a4c3 | [
"MIT"
] | 1 | 2021-12-21T20:01:36.000Z | 2021-12-21T20:01:36.000Z | contracts/calculator/calc.cpp | koinos/koinos-contract-examples | 27f2bd11b31997ac69d824a5d8a729295072a4c3 | [
"MIT"
] | null | null | null | contracts/calculator/calc.cpp | koinos/koinos-contract-examples | 27f2bd11b31997ac69d824a5d8a729295072a4c3 | [
"MIT"
] | 1 | 2021-11-23T19:10:26.000Z | 2021-11-23T19:10:26.000Z | #include <koinos/system/system_calls.hpp>
#include <koinos/buffer.hpp>
#include <koinos/common.h>
#include <calc.h>
using namespace koinos;
using namespace koinos::contracts;
enum entries : uint32_t
{
add_entry = 1,
sub_entry = 2,
mul_entry = 3,
div_entry = 4
};
class calculator
{
public:
calc::add_... | 21.435484 | 93 | 0.599323 | koinos |
418d9b77a6c64fdf521ccc324cec54c858d1fc4a | 2,233 | cc | C++ | re2c/src/codegen/helpers.cc | adesutherland/crexx | e8d17152c565e9387ee8c33c653b4910b56f5165 | [
"MIT"
] | 8 | 2020-11-08T15:36:14.000Z | 2022-03-27T13:50:07.000Z | re2c/src/codegen/helpers.cc | adesutherland/crexx | e8d17152c565e9387ee8c33c653b4910b56f5165 | [
"MIT"
] | 98 | 2020-11-12T11:49:41.000Z | 2022-03-27T17:24:13.000Z | re2c/src/codegen/helpers.cc | adesutherland/crexx | e8d17152c565e9387ee8c33c653b4910b56f5165 | [
"MIT"
] | 10 | 2021-03-31T13:50:52.000Z | 2021-12-02T03:34:42.000Z | #include <iostream>
#include "src/codegen/helpers.h"
namespace re2c {
static bool is_space(uint32_t c)
{
switch (c) {
case '\t':
case '\f':
case '\v':
case '\n':
case '\r':
case ' ': return true;
default: return false;
}
}
static inline char hex(uint32_t c)
{
static const... | 23.260417 | 99 | 0.467532 | adesutherland |
418df50b16205e781e5fc25d772cd4ffbaf5a2c1 | 311 | cpp | C++ | beginners/easy/014.grade-description/034.rishankahn.grade-description.cpp | Md-Maruf-Sarker/strangers | 6f9eae6c15f1e1c5b6ef2965eb2422a01203f1ad | [
"MIT"
] | 3 | 2022-03-26T17:56:38.000Z | 2022-03-27T10:47:26.000Z | beginners/easy/014.grade-description/034.rishankahn.grade-description.cpp | Md-Maruf-Sarker/strangers | 6f9eae6c15f1e1c5b6ef2965eb2422a01203f1ad | [
"MIT"
] | null | null | null | beginners/easy/014.grade-description/034.rishankahn.grade-description.cpp | Md-Maruf-Sarker/strangers | 6f9eae6c15f1e1c5b6ef2965eb2422a01203f1ad | [
"MIT"
] | 8 | 2022-03-26T18:19:49.000Z | 2022-03-31T18:18:34.000Z | #include <iostream>
using namespace std;
int main() {
char g;
cout<<"Input the grade : ";
cin>>g;
if(g=='E'){
cout<<"Excellent\n";
}
else if(g=='V'){
cout<<"Very Good\n";
}
else if(g=='G'){
cout<<"Good\n";
}
else if(g=='A'){
cout<<"Average\n";
}
else{
cout<<"Fail\n";
}
}
| 12.958333 | 28 | 0.495177 | Md-Maruf-Sarker |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.