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 108 | 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 67k ⌀ | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8be613f577fd369a92cf747a51ff5fc0ac3c9ded | 678 | hpp | C++ | include/sprout/preprocessor/u16str.hpp | thinkoid/Sprout | a5a5944bb1779d3bb685087c58c20a4e18df2f39 | [
"BSL-1.0"
] | 4 | 2021-12-29T22:17:40.000Z | 2022-03-23T11:53:44.000Z | dsp/lib/sprout/sprout/preprocessor/u16str.hpp | TheSlowGrowth/TapeLooper | ee8d8dccc27e39a6f6f6f435847e4d5e1b97c264 | [
"MIT"
] | 16 | 2021-10-31T21:41:09.000Z | 2022-01-22T10:51:34.000Z | include/sprout/preprocessor/u16str.hpp | thinkoid/Sprout | a5a5944bb1779d3bb685087c58c20a4e18df2f39 | [
"BSL-1.0"
] | null | null | null | /*=============================================================================
Copyright (c) 2011-2019 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.txt)
==... | 33.9 | 79 | 0.60767 | thinkoid |
8bf4ae03c6a823d072c08f0afd8d61fbadebcccc | 13,444 | cpp | C++ | ssc/cmod_pv6parmod.cpp | gjsoto/ssc | 70ef4fdafb9afe0418a9c552485a7116a1b3a743 | [
"BSD-3-Clause"
] | 61 | 2017-08-09T15:10:59.000Z | 2022-02-15T21:45:31.000Z | ssc/cmod_pv6parmod.cpp | gjsoto/ssc | 70ef4fdafb9afe0418a9c552485a7116a1b3a743 | [
"BSD-3-Clause"
] | 462 | 2017-07-31T21:26:46.000Z | 2022-03-30T22:53:50.000Z | ssc/cmod_pv6parmod.cpp | gjsoto/ssc | 70ef4fdafb9afe0418a9c552485a7116a1b3a743 | [
"BSD-3-Clause"
] | 73 | 2017-08-24T17:39:31.000Z | 2022-03-28T08:37:47.000Z | /**
BSD-3-Clause
Copyright 2019 Alliance for Sustainable Energy, LLC
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 conditions
and the... | 73.065217 | 280 | 0.484677 | gjsoto |
8bf637641a08b16fe882aa46ed76f6273956e075 | 1,374 | cpp | C++ | DataFormats/Math/test/crossV4_t.cpp | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 852 | 2015-01-11T21:03:51.000Z | 2022-03-25T21:14:00.000Z | DataFormats/Math/test/crossV4_t.cpp | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 30,371 | 2015-01-02T00:14:40.000Z | 2022-03-31T23:26:05.000Z | DataFormats/Math/test/crossV4_t.cpp | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 3,240 | 2015-01-02T05:53:18.000Z | 2022-03-31T17:24:21.000Z | #include <iostream>
#include "DataFormats/Math/interface/SSEVec.h"
int main() {
#ifdef CMS_USE_SSE
{
mathSSE::Vec4<float> yAxis(-0.0144846, 0.932024, -0.362108);
mathSSE::Vec4<float> zAxis(-0.204951, 0.351689, 0.913406);
auto xAxis = ::cross(yAxis, zAxis);
const mathSSE::Vec4<float> correctXAxis(0.... | 33.512195 | 115 | 0.617904 | ckamtsikis |
8bf69f8423f32cfb609cfdb6b7f59e56fe348989 | 324 | cc | C++ | leetcode/1164-missing-number-in-arithmetic-progression.cc | Magic07/online-judge-solutions | 02a289dd7eb52d7eafabc97bd1a043213b65f70a | [
"MIT"
] | null | null | null | leetcode/1164-missing-number-in-arithmetic-progression.cc | Magic07/online-judge-solutions | 02a289dd7eb52d7eafabc97bd1a043213b65f70a | [
"MIT"
] | null | null | null | leetcode/1164-missing-number-in-arithmetic-progression.cc | Magic07/online-judge-solutions | 02a289dd7eb52d7eafabc97bd1a043213b65f70a | [
"MIT"
] | null | null | null | class Solution {
public:
int missingNumber(vector<int>& arr) {
int diff=abs(arr[arr.size()-1]-arr[0])/arr.size();
if(arr[0]>arr[1]){
diff=0-diff;
}
for(int i=0;i<arr.size();i++){
if(arr[i]!=arr[0]+diff*i){
return arr[0]+diff*i;
}
}
return 0;
... | 21.6 | 56 | 0.469136 | Magic07 |
8bfc7e95107e1db49c1a3c010f370e23e3a56f3f | 3,138 | hpp | C++ | Inc/Inner/ImplHudNode.hpp | MJYCo-Ltd/Map | 48ccc120a3c2cd3080fb046da72c7588b1faebc0 | [
"MIT"
] | 7 | 2021-11-25T02:12:09.000Z | 2022-03-20T12:48:18.000Z | Inc/Inner/ImplHudNode.hpp | MJYCo-Ltd/Map | 48ccc120a3c2cd3080fb046da72c7588b1faebc0 | [
"MIT"
] | 1 | 2022-03-25T20:47:21.000Z | 2022-03-29T02:02:44.000Z | Inc/Inner/ImplHudNode.hpp | MJYCo-Ltd/Map | 48ccc120a3c2cd3080fb046da72c7588b1faebc0 | [
"MIT"
] | 2 | 2021-12-07T06:22:47.000Z | 2021-12-30T05:54:04.000Z | #ifndef IMPL_HUD_NODE_H
#define IMPL_HUD_NODE_H
#include <osgEarth/Controls>
#include <Inner/ImplSceneNode.hpp>
/**
* 实现IHudNode所有的接口
*/
template <typename T>
class ImplHudNode:public ImplSceneNode<T>
{
public:
CONSTRUCTOR(ImplHudNode,ImplSceneNode<T>)
protected:
void SetControlNode(osgEarth::Controls::Con... | 35.659091 | 122 | 0.620459 | MJYCo-Ltd |
8bff2df37bf13bddbad8bdcf563fab3550a4754a | 1,948 | cpp | C++ | libraries/Crypto/SHA384.cpp | rweather/arduinolibs | 662329f1fd1ba57d1312253dfe81ff0e0e2ec706 | [
"MIT"
] | 356 | 2015-01-11T15:34:14.000Z | 2022-03-30T13:57:24.000Z | libraries/Crypto/SHA384.cpp | rweather/arduinolibs | 662329f1fd1ba57d1312253dfe81ff0e0e2ec706 | [
"MIT"
] | 57 | 2015-09-25T09:34:37.000Z | 2022-01-30T19:51:50.000Z | libraries/Crypto/SHA384.cpp | rweather/arduinolibs | 662329f1fd1ba57d1312253dfe81ff0e0e2ec706 | [
"MIT"
] | 174 | 2015-01-11T15:42:25.000Z | 2022-03-26T21:46:08.000Z | /*
* Copyright (C) 2015 Southern Storm Software, Pty Ltd.
*
* 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, ... | 31.419355 | 78 | 0.728439 | rweather |
bdd8da38d6159b982615e22b638db9b06612e392 | 223 | cpp | C++ | test/unit-tests/array_models/interface/i_array_state_subscription_test.cpp | so931/poseidonos | 2aa82f26bfbd0d0aee21cd0574779a655634f08c | [
"BSD-3-Clause"
] | 38 | 2021-04-06T03:20:55.000Z | 2022-03-02T09:33:28.000Z | test/unit-tests/array_models/interface/i_array_state_subscription_test.cpp | so931/poseidonos | 2aa82f26bfbd0d0aee21cd0574779a655634f08c | [
"BSD-3-Clause"
] | 19 | 2021-04-08T02:27:44.000Z | 2022-03-23T00:59:04.000Z | test/unit-tests/array_models/interface/i_array_state_subscription_test.cpp | so931/poseidonos | 2aa82f26bfbd0d0aee21cd0574779a655634f08c | [
"BSD-3-Clause"
] | 28 | 2021-04-08T04:39:18.000Z | 2022-03-24T05:56:00.000Z | #include "src/array_models/interface/i_array_state_subscription.h"
#include <gtest/gtest.h>
namespace pos
{
TEST(IArrayStateSubscription, Register_)
{
}
TEST(IArrayStateSubscription, Unregister_)
{
}
} // namespace pos
| 13.9375 | 66 | 0.780269 | so931 |
bddb33ff331e58560b240663f7ed3c75f8e633f3 | 955 | cpp | C++ | Rubbish/ht6/ht6/6588.cpp | albarkan/school.tests | 07861b884f1bc6ccf852ac60074afaeeccf40ef2 | [
"Apache-2.0"
] | null | null | null | Rubbish/ht6/ht6/6588.cpp | albarkan/school.tests | 07861b884f1bc6ccf852ac60074afaeeccf40ef2 | [
"Apache-2.0"
] | null | null | null | Rubbish/ht6/ht6/6588.cpp | albarkan/school.tests | 07861b884f1bc6ccf852ac60074afaeeccf40ef2 | [
"Apache-2.0"
] | null | null | null |
/* Дан целочисленный массив из 30 элементов. Элементы массива могут принимать целые значения от 0 до 10000 включительно. Опишите на естественном языке или на
// одном из языков программирования алгоритм, позволяющий найти и вывести произведение двузначных элементов массива, с суммой цифр не кратной 6. Гарантируется,... | 31.833333 | 423 | 0.628272 | albarkan |
bddcb6b4bca10f4244aea6e556ec8fd0b2b3e1da | 6,687 | cxx | C++ | src-plugins/libs/vtkInria/Examples/CompareImageManager/CompareImageManager.cxx | ocommowi/medInria-public | 9074e40c886881666e7a52c53309d8d28e35c0e6 | [
"BSD-4-Clause"
] | null | null | null | src-plugins/libs/vtkInria/Examples/CompareImageManager/CompareImageManager.cxx | ocommowi/medInria-public | 9074e40c886881666e7a52c53309d8d28e35c0e6 | [
"BSD-4-Clause"
] | null | null | null | src-plugins/libs/vtkInria/Examples/CompareImageManager/CompareImageManager.cxx | ocommowi/medInria-public | 9074e40c886881666e7a52c53309d8d28e35c0e6 | [
"BSD-4-Clause"
] | null | null | null | /*=========================================================================
medInria
Copyright (c) INRIA 2013. All rights reserved.
See LICENSE.txt for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE.
====... | 29.073913 | 112 | 0.701959 | ocommowi |
bddd56037c47e9677b2602fdb4e9233b0568a832 | 29,999 | cc | C++ | TimingAnalyzer/plugins/CommonUtils.cc | kmcdermo/Timing | f2f41e24350e14daf795f6551aa52a0687cda3f2 | [
"MIT"
] | 2 | 2017-10-19T12:28:53.000Z | 2019-05-22T14:36:05.000Z | TimingAnalyzer/plugins/CommonUtils.cc | kmcdermo/Timing | f2f41e24350e14daf795f6551aa52a0687cda3f2 | [
"MIT"
] | null | null | null | TimingAnalyzer/plugins/CommonUtils.cc | kmcdermo/Timing | f2f41e24350e14daf795f6551aa52a0687cda3f2 | [
"MIT"
] | 6 | 2017-09-13T13:16:10.000Z | 2019-01-28T17:39:51.000Z | #include "Timing/TimingAnalyzer/plugins/CommonUtils.hh"
#include "DataFormats/EcalDetId/interface/EcalSubdetector.h"
namespace oot
{
///////////////////////////
// Object Prep Functions //
///////////////////////////
void ReadInTriggerNames(const std::string & inputPaths, std::vector<std::string> & pathNames,... | 37.173482 | 176 | 0.560985 | kmcdermo |
bdde2152b74138579d8da71f7595eb4d4ae8c05c | 527 | hpp | C++ | include/mgcpp/expressions/placeholder.hpp | MGfoundation/mgcpp | 66c072191e58871637bcb3b76701a79a4ae89779 | [
"BSL-1.0"
] | 48 | 2018-01-02T03:47:18.000Z | 2021-09-09T05:55:45.000Z | include/mgcpp/expressions/placeholder.hpp | MGfoundation/mgcpp | 66c072191e58871637bcb3b76701a79a4ae89779 | [
"BSL-1.0"
] | 24 | 2017-12-27T18:03:13.000Z | 2018-07-02T09:00:30.000Z | include/mgcpp/expressions/placeholder.hpp | MGfoundation/mgcpp | 66c072191e58871637bcb3b76701a79a4ae89779 | [
"BSL-1.0"
] | 6 | 2018-01-14T14:06:10.000Z | 2018-10-16T08:43:01.000Z | #ifndef PLACEHOLDER_HPP
#define PLACEHOLDER_HPP
#include <mgcpp/expressions/forward.hpp>
namespace mgcpp {
struct placeholder_node_type;
template <size_t PlaceholderID, typename ResultType>
using placeholder_node = generic_expr<placeholder_node_type,
PlaceholderID,
... | 27.736842 | 76 | 0.582543 | MGfoundation |
bddfc32b9fb917c116a4db07b56e45c23dd2481f | 1,622 | hpp | C++ | rsked/inetcheck.hpp | farlies/rsked | cd2004bed454578f4d2ac25996dc1ced98d4fa58 | [
"Apache-2.0"
] | null | null | null | rsked/inetcheck.hpp | farlies/rsked | cd2004bed454578f4d2ac25996dc1ced98d4fa58 | [
"Apache-2.0"
] | null | null | null | rsked/inetcheck.hpp | farlies/rsked | cd2004bed454578f4d2ac25996dc1ced98d4fa58 | [
"Apache-2.0"
] | 1 | 2020-10-04T22:14:55.000Z | 2020-10-04T22:14:55.000Z | #pragma once
/// You may optionally configure this in rsked.json like:
/// { ...
/// "Inet_checker" : {
/// "enabled" : true,
/// "status_path" : "/run/user/1000/netstat",
/// "refresh" : 60
/// }, ...
///
/// Without configuration, it will be enabled with reasonable defaults.
///
/* Par... | 30.037037 | 77 | 0.673243 | farlies |
bde11ce8b7ac613af0e4ce53a540b02c23a7f684 | 604 | hpp | C++ | third_party/boost/simd/arch/common/detail/scalar/exponential.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | 6 | 2018-02-25T22:23:33.000Z | 2021-01-15T15:13:12.000Z | third_party/boost/simd/arch/common/detail/scalar/exponential.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | null | null | null | third_party/boost/simd/arch/common/detail/scalar/exponential.hpp | SylvainCorlay/pythran | 908ec070d837baf77d828d01c3e35e2f4bfa2bfa | [
"BSD-3-Clause"
] | 7 | 2017-12-12T12:36:31.000Z | 2020-02-10T14:27:07.000Z | //==================================================================================================
/*!
@file
@copyright 2016 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*/
//===========================... | 33.555556 | 100 | 0.541391 | SylvainCorlay |
bde11d680c6a77f55fe61b2aa3ffaef6d459c452 | 1,026 | cpp | C++ | L-Value_vs_R-Value.cpp | WarlonZeng/Data-Structures-Algorithms | 87df91ec7f8867d9affbd713b12a86f39ba4a7b1 | [
"MIT"
] | 1 | 2016-09-07T04:31:48.000Z | 2016-09-07T04:31:48.000Z | L-Value_vs_R-Value.cpp | WarlonZeng/Data-Structures-Algorithms | 87df91ec7f8867d9affbd713b12a86f39ba4a7b1 | [
"MIT"
] | null | null | null | L-Value_vs_R-Value.cpp | WarlonZeng/Data-Structures-Algorithms | 87df91ec7f8867d9affbd713b12a86f39ba4a7b1 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
template <class Something>
void testMe(Something& val) {
cout << "This is an lval!\n";
}
template <class Something>
void testMe(const Something&& val) {
cout << "This is an rval!\n";
}
int& dummyRef(int& thing) {
return thing;
}
int dummy(int& thing) {
return thing;
}
s... | 17.389831 | 66 | 0.6423 | WarlonZeng |
bde24956c5faa172c8cdfd4cba1977b538e2f62f | 5,687 | hpp | C++ | include/cynodelic/metaflags/detail/string_parsing_helper.hpp | cynodelic/metaflags | 171f09800910a1c20ce8732441e27f33d8d2ce4f | [
"BSL-1.0"
] | null | null | null | include/cynodelic/metaflags/detail/string_parsing_helper.hpp | cynodelic/metaflags | 171f09800910a1c20ce8732441e27f33d8d2ce4f | [
"BSL-1.0"
] | null | null | null | include/cynodelic/metaflags/detail/string_parsing_helper.hpp | cynodelic/metaflags | 171f09800910a1c20ce8732441e27f33d8d2ce4f | [
"BSL-1.0"
] | null | null | null | // Copyright (c) 2019 Álvaro Ceballos
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt
#ifndef CYNODELIC_METAFLAGS_DETAIL_STRING_PARSING_HELPER_HPP
#define CYNODELIC_METAFLAGS_DETAIL_STRING_PARSING_HELPER_HPP
#include <cstd... | 27.080952 | 203 | 0.697204 | cynodelic |
bde28cbdddddd64c2e0c9ccc289e5c8dd12c653b | 197 | c++ | C++ | Jcoord.c++ | SRTCpp/Code | 67c311566cee7b3e5cd8440ac2f7531f1737e293 | [
"Apache-2.0"
] | 1 | 2018-09-24T21:58:03.000Z | 2018-09-24T21:58:03.000Z | Jcoord.c++ | SRTCpp/Code | 67c311566cee7b3e5cd8440ac2f7531f1737e293 | [
"Apache-2.0"
] | null | null | null | Jcoord.c++ | SRTCpp/Code | 67c311566cee7b3e5cd8440ac2f7531f1737e293 | [
"Apache-2.0"
] | null | null | null | #include "Jcoord.h"
coord::coord()
{
x=0; y=0; z=0;
}
coord::coord(int a, int b, int c)
{
x=a; y=b; z=c;
}
int& coord::A()
{
if (a==X) return x;
if (a==Y) return y;
if (a==Z) return z;
}
| 10.368421 | 33 | 0.507614 | SRTCpp |
bde72c91c21ae01c7ea1dc19aa70757e68f5aa59 | 126 | cpp | C++ | Phoebe-core/src/ph/app/Settings.cpp | JRBonilla/Slate | 9bcb3befced30d8f9ffb2dcce0a0209ba76093e4 | [
"MIT"
] | 1 | 2017-02-26T23:37:37.000Z | 2017-02-26T23:37:37.000Z | Phoebe-core/src/ph/app/Settings.cpp | JRBonilla/Slate | 9bcb3befced30d8f9ffb2dcce0a0209ba76093e4 | [
"MIT"
] | null | null | null | Phoebe-core/src/ph/app/Settings.cpp | JRBonilla/Slate | 9bcb3befced30d8f9ffb2dcce0a0209ba76093e4 | [
"MIT"
] | null | null | null | #include "Settings.h"
namespace ph {
Settings::Settings() {
}
void Settings::Load() {
}
void Settings::Save() {
}
} | 9 | 24 | 0.595238 | JRBonilla |
bdef93891bfc25d82a7ea8e684f766fdaaf1f01b | 1,230 | cpp | C++ | src/main/java/Subsystems/Lift/LiftStringPot.cpp | frc4646/2018-competition-code | 6fd8288c1789849ab3054de6186f2040161588a8 | [
"MIT"
] | 1 | 2018-01-31T20:23:38.000Z | 2018-01-31T20:23:38.000Z | src/main/java/Subsystems/Lift/LiftStringPot.cpp | frc4646/2018-competition-code | 6fd8288c1789849ab3054de6186f2040161588a8 | [
"MIT"
] | null | null | null | src/main/java/Subsystems/Lift/LiftStringPot.cpp | frc4646/2018-competition-code | 6fd8288c1789849ab3054de6186f2040161588a8 | [
"MIT"
] | null | null | null | #include "LiftStringPot.h"
#include <RobotMap.h>
#include <Config.h>
LiftStringPot::LiftStringPot(int pin) : Subsystem("LiftStringPot"), LiftStringPotPin(pin) {
//LiftStringPotPin = new AnalogInput(pin);
}
void LiftStringPot::InitDefaultCommand() {}
double LiftStringPot::GetHeight() {
#ifdef PRACTICE_BOT
double he... | 20.163934 | 91 | 0.711382 | frc4646 |
bdefb7a6a45c426b85062b43b3fc490da76dcaca | 1,576 | cpp | C++ | deform_control/external_libs/OpenSceneGraph-2.8.5/src/osgWrappers/osgWidget/StyleInterface.cpp | UM-ARM-Lab/mab_ms | f199f05b88060182cfbb47706bd1ff3479032c43 | [
"BSD-2-Clause"
] | 3 | 2018-08-20T12:12:43.000Z | 2021-06-06T09:43:27.000Z | deform_control/external_libs/OpenSceneGraph-2.8.5/src/osgWrappers/osgWidget/StyleInterface.cpp | UM-ARM-Lab/mab_ms | f199f05b88060182cfbb47706bd1ff3479032c43 | [
"BSD-2-Clause"
] | null | null | null | deform_control/external_libs/OpenSceneGraph-2.8.5/src/osgWrappers/osgWidget/StyleInterface.cpp | UM-ARM-Lab/mab_ms | f199f05b88060182cfbb47706bd1ff3479032c43 | [
"BSD-2-Clause"
] | 1 | 2022-03-31T03:12:23.000Z | 2022-03-31T03:12:23.000Z | // ***************************************************************************
//
// Generated automatically by genwrapper.
// Please DO NOT EDIT this file!
//
// ***************************************************************************
#include <osgIntrospection/ReflectionMacros>
#include <osgIntrospection/Type... | 29.735849 | 78 | 0.574873 | UM-ARM-Lab |
bdf137723168827fdd28582d70cf8bb08743ef79 | 5,425 | cpp | C++ | pyspk/src/pyspk_GL/OpenGL/GLLineTrailRenderer.cpp | chromia/pyspk | b13f2b4f3c651376747003761ea88590a6014eda | [
"Zlib"
] | null | null | null | pyspk/src/pyspk_GL/OpenGL/GLLineTrailRenderer.cpp | chromia/pyspk | b13f2b4f3c651376747003761ea88590a6014eda | [
"Zlib"
] | null | null | null | pyspk/src/pyspk_GL/OpenGL/GLLineTrailRenderer.cpp | chromia/pyspk | b13f2b4f3c651376747003761ea88590a6014eda | [
"Zlib"
] | null | null | null | // generate by pypp <https://github.com/mugwort-rc/pypp>
// original source code: SPK_GLLineTrailRenderer.h
#include <RenderingAPIs/OpenGL/SPK_GLLineTrailRenderer.h>
#include <Core/SPK_Group.h>
#include <boost/python.hpp>
class GLLineTrailRendererWrapper :
public SPK::GL::GLLineTrailRenderer,
pub... | 44.467213 | 167 | 0.65235 | chromia |
bdf1f361639e5dc85e7bd8746cb23b34c63be69f | 2,675 | cpp | C++ | Photon/Plugins/PhilipsHue/src/HueLight.cpp | rlisle/ProjectIoT | abdb7efa36657fcd942626975d2156ef5d02c8bc | [
"MIT"
] | null | null | null | Photon/Plugins/PhilipsHue/src/HueLight.cpp | rlisle/ProjectIoT | abdb7efa36657fcd942626975d2156ef5d02c8bc | [
"MIT"
] | null | null | null | Photon/Plugins/PhilipsHue/src/HueLight.cpp | rlisle/ProjectIoT | abdb7efa36657fcd942626975d2156ef5d02c8bc | [
"MIT"
] | null | null | null | /******************************************************************
HueLight plugin
Features:
- Control Philips Hue light.
http://www.github.com/rlisle/Patriot
Example code used from https://www.digikey.com/en/maker/blogs/2019/how-to-post-data-using-the-particle-photon
Written by Ron Lisle
BSD license, check l... | 23.883929 | 109 | 0.565607 | rlisle |
bdf71b4724a3c469b097fd77df4739bb67b89d75 | 482 | cpp | C++ | Arrays/169. Majority Element/Solution-sorting.cpp | VarunSAthreya/LeetCode-Solutions | aeab92df5bca208c2442ffdb1487fe5e3aadb3de | [
"MIT"
] | 1 | 2021-11-24T16:20:32.000Z | 2021-11-24T16:20:32.000Z | Arrays/169. Majority Element/Solution-sorting.cpp | VarunSAthreya/LeetCode-Solutions | aeab92df5bca208c2442ffdb1487fe5e3aadb3de | [
"MIT"
] | null | null | null | Arrays/169. Majority Element/Solution-sorting.cpp | VarunSAthreya/LeetCode-Solutions | aeab92df5bca208c2442ffdb1487fe5e3aadb3de | [
"MIT"
] | 3 | 2021-09-03T15:14:12.000Z | 2022-03-07T04:04:32.000Z | class Solution
{
public:
int majorityElement(vector<int> &nums)
{
sort(nums.begin(), nums.end());
int ele = nums[0], count = 0;
for (auto i : nums)
{
if (i == ele)
{
count++;
if (count > (nums.size() / 2))
... | 18.538462 | 46 | 0.319502 | VarunSAthreya |
bdfa451f5aa3b83e21d923b2c5a222cb3a852e1e | 2,371 | cpp | C++ | Source/Engine/src/util/CommandLine.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | null | null | null | Source/Engine/src/util/CommandLine.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | null | null | null | Source/Engine/src/util/CommandLine.cpp | DatZach/Swift | b0c6f9c87e8c8dfe8a19dedc4dd57081fa5cdef7 | [
"MIT"
] | 1 | 2021-10-30T20:43:01.000Z | 2021-10-30T20:43:01.000Z | /*
* cmdline.cpp
* Command Line
*/
#include <algorithm>
#include <Util/CommandLine.hpp>
#ifdef WINDOWS
#include <Windows.h>
#include <io.h>
#include <fcntl.h>
#endif
namespace Util
{
CommandLine::CommandLine(int argc, char* argv[])
: flags()
{
for(int i = 1; i < argc; ++i)
{
// Parse arguments starting... | 20.982301 | 84 | 0.645719 | DatZach |
bdfc91c31dd3374b65f1939a4bae784cab8236ff | 916 | cpp | C++ | _includes/leet755/leet755.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | null | null | null | _includes/leet755/leet755.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | 8 | 2019-12-19T04:46:05.000Z | 2022-02-26T03:45:22.000Z | _includes/leet755/leet755.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> pourWater(vector<int>& heights, int count, int pos) {
int n = (int)heights.size();
for (int k = 0; k < count; k++) {
// drop to x
int minIndex = pos, minHeight = heights[pos];
int i = pos;
while (i - 1 >= 0 && heights[i] >= heights[i -... | 26.941176 | 69 | 0.394105 | mingdaz |
bdfce103ac76a7718ceeac654f2a674bb924bd68 | 12,678 | cc | C++ | crypto/openssl/bignum.cc | stablecc/scclib | cedcb3b37a814d3a393e128db7aa9753f518cbaf | [
"BSD-3-Clause"
] | null | null | null | crypto/openssl/bignum.cc | stablecc/scclib | cedcb3b37a814d3a393e128db7aa9753f518cbaf | [
"BSD-3-Clause"
] | 10 | 2022-02-27T18:52:11.000Z | 2022-03-21T14:11:35.000Z | crypto/openssl/bignum.cc | stablecc/scclib | cedcb3b37a814d3a393e128db7aa9753f518cbaf | [
"BSD-3-Clause"
] | null | null | null | /*
BSD 3-Clause License
Copyright (c) 2022, Stable Cloud Computing, Inc.
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 conditions ... | 20.614634 | 113 | 0.638508 | stablecc |
da04c1d17590550cf7078410bfa145ac5faaf168 | 2,784 | cpp | C++ | framework/egl/egluUnique.cpp | iabernikhin/VK-GL-CTS | a3338eb2ded98b5befda64f9325db0d219095a00 | [
"Apache-2.0"
] | 354 | 2017-01-24T17:12:38.000Z | 2022-03-30T07:40:19.000Z | framework/egl/egluUnique.cpp | iabernikhin/VK-GL-CTS | a3338eb2ded98b5befda64f9325db0d219095a00 | [
"Apache-2.0"
] | 275 | 2017-01-24T20:10:36.000Z | 2022-03-24T16:24:50.000Z | framework/egl/egluUnique.cpp | iabernikhin/VK-GL-CTS | a3338eb2ded98b5befda64f9325db0d219095a00 | [
"Apache-2.0"
] | 190 | 2017-01-24T18:02:04.000Z | 2022-03-27T13:11:23.000Z | /*-------------------------------------------------------------------------
* drawElements Quality Program Tester Core
* ----------------------------------------
*
* Copyright 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file exce... | 23.794872 | 137 | 0.691451 | iabernikhin |
da06759d52886e8a3a347a2d69bc62b1c0c27bd3 | 657 | cpp | C++ | Raven.CppClient/ConflictSolver.cpp | maximburyak/ravendb-cpp-client | ab284d00bc659e8438c829f1b4a39aa78c31fa88 | [
"MIT"
] | 3 | 2019-04-24T02:34:53.000Z | 2019-08-01T08:22:26.000Z | Raven.CppClient/ConflictSolver.cpp | maximburyak/ravendb-cpp-client | ab284d00bc659e8438c829f1b4a39aa78c31fa88 | [
"MIT"
] | 2 | 2019-03-21T09:00:02.000Z | 2021-02-28T23:49:26.000Z | Raven.CppClient/ConflictSolver.cpp | maximburyak/ravendb-cpp-client | ab284d00bc659e8438c829f1b4a39aa78c31fa88 | [
"MIT"
] | 3 | 2019-03-04T11:58:54.000Z | 2021-03-01T00:25:49.000Z | #include "stdafx.h"
#include "ConflictSolver.h"
#include "json_utils.h"
namespace ravendb::client::serverwide
{
void to_json(nlohmann::json& j, const ConflictSolver& cs)
{
using ravendb::client::impl::utils::json_utils::set_val_to_json;
set_val_to_json(j, "ResolveByCollection", cs.resolve_by_collection);
set_... | 29.863636 | 72 | 0.767123 | maximburyak |
da08643228212a407c42fbff89abfd63a7200535 | 1,415 | cc | C++ | src/abc075/d.cc | nryotaro/at_c | 8d7d3aecb4e3c768aefdf0ceaeefb269ca9ab34c | [
"MIT"
] | null | null | null | src/abc075/d.cc | nryotaro/at_c | 8d7d3aecb4e3c768aefdf0ceaeefb269ca9ab34c | [
"MIT"
] | null | null | null | src/abc075/d.cc | nryotaro/at_c | 8d7d3aecb4e3c768aefdf0ceaeefb269ca9ab34c | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MX = pow(10, 9) + 1;
ll res = -1;
void dfs(int pointer, int n, int k, int comb, vector<ll> &x, vector<ll> &y,
vector<int> &a) {
if((int)a.size() == comb) {
ll ax, bx, ay, by;
ax = ay = -1 * MX;
bx = by = MX;
... | 22.460317 | 75 | 0.374558 | nryotaro |
da0a9246a213e0dd5f4d8895848e991a9e6470e9 | 1,523 | cpp | C++ | solutions/binary_tree_maximum_path_sum.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | solutions/binary_tree_maximum_path_sum.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | solutions/binary_tree_maximum_path_sum.cpp | kmykoh97/My-Leetcode | 0ffdea16c3025805873aafb6feffacaf3411a258 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <vector>
#include <map>
#include <string>
#include <stack>
using namespace std;
// Given a non-empty binary tree, find the maximum path sum.
// For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections.... | 20.581081 | 229 | 0.560079 | kmykoh97 |
da0cad0e4928c0e3f3fa039f4da396520876082b | 11,900 | cc | C++ | CalibCalorimetry/EcalLaserAnalyzer/test/MusEcal/src/MECanvasHolder.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 852 | 2015-01-11T21:03:51.000Z | 2022-03-25T21:14:00.000Z | CalibCalorimetry/EcalLaserAnalyzer/test/MusEcal/src/MECanvasHolder.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 30,371 | 2015-01-02T00:14:40.000Z | 2022-03-31T23:26:05.000Z | CalibCalorimetry/EcalLaserAnalyzer/test/MusEcal/src/MECanvasHolder.cc | ckamtsikis/cmssw | ea19fe642bb7537cbf58451dcf73aa5fd1b66250 | [
"Apache-2.0"
] | 3,240 | 2015-01-02T05:53:18.000Z | 2022-03-31T17:24:21.000Z | #include <cstdlib>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <assert.h>
using namespace std;
#include <math.h>
#include <TStyle.h>
#include "TImage.h"
#include "TAttImage.h"
#include "MECanvasHolder.hh"
ClassImp(MECanvasHolder);
MECanvasHolder::MECanvasHolder()
: fCanvas(0), fWelcomePav... | 26.801802 | 136 | 0.628908 | ckamtsikis |
da15175ead432a169cc30b1e65f514ecb19d4f07 | 1,516 | cpp | C++ | Graphs/FloydWarshall.cpp | mayukhsen1301/algos | 60db47ad9e7dc28271c1ce32ca705a771e682cda | [
"MIT"
] | 687 | 2015-02-23T17:31:00.000Z | 2022-03-27T02:57:23.000Z | Graphs/FloydWarshall.cpp | mayukhsen1301/algos | 60db47ad9e7dc28271c1ce32ca705a771e682cda | [
"MIT"
] | 9 | 2018-08-27T06:41:24.000Z | 2020-12-17T13:39:07.000Z | Graphs/FloydWarshall.cpp | mayukhsen1301/algos | 60db47ad9e7dc28271c1ce32ca705a771e682cda | [
"MIT"
] | 253 | 2015-03-16T00:42:18.000Z | 2022-03-23T06:01:36.000Z | /**************************************************************************************
Floyd-Warshall algorithm finding shortest distance between all
pairs of vertices in graph. Works in O(N^3)
Based on problem 95 from informatics.mccme.ru
http://informatics.mccme.ru/mod/statements/view.php?id=... | 24.063492 | 88 | 0.435356 | mayukhsen1301 |
da1964b39b65de793fa7b7f9e46652c840abb7e0 | 3,560 | cpp | C++ | riscv-sim/src/RISCVSTypeInstruction.cpp | tomli380576/riscv-console | a0129af4e41ecdde752f40c7b239c9bd98c1e049 | [
"BSD-3-Clause"
] | 9 | 2021-01-12T13:18:26.000Z | 2022-03-10T20:20:45.000Z | riscv-sim/src/RISCVSTypeInstruction.cpp | helloparthshah/riscv-console | 5b20edc4f54c8edf2f2f4e6769e2f02676eaf994 | [
"BSD-3-Clause"
] | 16 | 2021-01-17T04:17:21.000Z | 2021-11-12T17:46:54.000Z | riscv-sim/src/RISCVSTypeInstruction.cpp | helloparthshah/riscv-console | 5b20edc4f54c8edf2f2f4e6769e2f02676eaf994 | [
"BSD-3-Clause"
] | 21 | 2021-01-13T00:50:13.000Z | 2022-03-14T21:30:53.000Z | #include "RISCVSTypeInstruction.h"
class CRISCVSBInstruction : public CRISCVSTypeInstruction{
public:
CRISCVSBInstruction(uint32_t addr, uint32_t raw, std::shared_ptr< CHardwareRegister< uint32_t > > pc, std::vector< std::shared_ptr< CHardwareRegister< uint32_t > > > ®s, std::shared_ptr< CMemoryDevice >... | 44.5 | 270 | 0.665449 | tomli380576 |
da19a3b2024a92ac77b016b91b425d389397fbdb | 2,689 | cpp | C++ | test/tstKokkosToolsDistributedAnnotations.cpp | dalg24/ArborX | d298c924ce93902a285168de5dc5003e4d761627 | [
"BSD-3-Clause"
] | null | null | null | test/tstKokkosToolsDistributedAnnotations.cpp | dalg24/ArborX | d298c924ce93902a285168de5dc5003e4d761627 | [
"BSD-3-Clause"
] | null | null | null | test/tstKokkosToolsDistributedAnnotations.cpp | dalg24/ArborX | d298c924ce93902a285168de5dc5003e4d761627 | [
"BSD-3-Clause"
] | null | null | null | /****************************************************************************
* Copyright (c) 2012-2020 by the ArborX authors *
* All rights reserved. *
* *
* This ... | 33.6125 | 80 | 0.518408 | dalg24 |
da1abc7efe31b4d8f3ca42ca3161429bbd16e6de | 5,890 | cpp | C++ | swig/share/c++/examples/testsort.cpp | rdmenezes/exodusdb | f732e366b74ff4697890ec0682bc3697b8cb0bfb | [
"MIT"
] | 4 | 2021-01-23T14:36:34.000Z | 2021-06-07T10:02:28.000Z | swig/share/c++/examples/testsort.cpp | rdmenezes/exodusdb | f732e366b74ff4697890ec0682bc3697b8cb0bfb | [
"MIT"
] | 1 | 2019-08-04T19:15:56.000Z | 2019-08-04T19:15:56.000Z | swig/share/c++/examples/testsort.cpp | rdmenezes/exodusdb | f732e366b74ff4697890ec0682bc3697b8cb0bfb | [
"MIT"
] | 1 | 2022-01-29T22:41:01.000Z | 2022-01-29T22:41:01.000Z |
#include <exodus/program.h>
//for the sake of multivalue gurus new to exodus programming this is written
//with multivalue-mimicking "everything is a global function" syntax
//instead of exodus's OO-style syntax "xxx.yyy().zzz()"
var filename="myclients";
programinit()
function main() {
if (not connect())
... | 33.657143 | 124 | 0.509847 | rdmenezes |
da1ccb7d0d83491a7f8b46dc942db55c704031d0 | 1,565 | cpp | C++ | example/visitation_example.cpp | friendlyanon/cpp_enum_set | 248a98ee768def5b4a32d3719d6ee46863377114 | [
"MIT"
] | 21 | 2021-05-25T07:59:08.000Z | 2021-06-04T01:54:23.000Z | example/visitation_example.cpp | friendlyanon/cpp_enum_set | 248a98ee768def5b4a32d3719d6ee46863377114 | [
"MIT"
] | 11 | 2021-05-25T09:28:51.000Z | 2021-07-01T09:59:15.000Z | example/visitation_example.cpp | friendlyanon/cpp_enum_set | 248a98ee768def5b4a32d3719d6ee46863377114 | [
"MIT"
] | 2 | 2021-05-25T11:52:04.000Z | 2021-06-02T16:17:24.000Z | #include <enum_set/type_set.hpp>
#include <iostream>
#include <string>
#include <vector>
// Define an option as a "strong enum".
struct option
{
class A;
class B;
class C;
};
// Define a set of options as a `type_set`.
using option_set =
enum_set::type_set<
option::A,
option::B,
... | 22.681159 | 79 | 0.631949 | friendlyanon |
da223609230c4b427f3999b12afb8fe315af639f | 8,366 | cpp | C++ | hackathon/MK/Deep_Learning_Handler/Deep_Learning_Handler_plugin.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | 1 | 2021-12-27T19:14:03.000Z | 2021-12-27T19:14:03.000Z | hackathon/MK/Deep_Learning_Handler/Deep_Learning_Handler_plugin.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | null | null | null | hackathon/MK/Deep_Learning_Handler/Deep_Learning_Handler_plugin.cpp | zzhmark/vaa3d_tools | 3ca418add85a59ac7e805d55a600b78330d7e53d | [
"MIT"
] | null | null | null | /* Deep_Learning_Handler_plugin.cpp
* This is a test plugin, you can use it as a demo.
* 2017-11-29 : by YourName
*/
#include "v3d_message.h"
#include <vector>
#include "Deep_Learning_Handler_plugin.h"
#include <iostream>
#include <qfileinfo.h>
#include <qdir.h>
#include <v3d_interface.h>
#include <string>
#include... | 37.348214 | 159 | 0.51267 | zzhmark |
da24fdf648a483e505b23713c32ba5fca72e66bd | 800 | cpp | C++ | MirageENGiNE_Engine/src/util/txtfile.cpp | Harha/MirageEngine | 6d0634385f514bbfce08cfacc8d743ce78c461fc | [
"MIT"
] | 1 | 2017-05-27T23:23:28.000Z | 2017-05-27T23:23:28.000Z | MirageENGiNE_Engine/src/util/txtfile.cpp | Harha/MirageEngine | 6d0634385f514bbfce08cfacc8d743ce78c461fc | [
"MIT"
] | null | null | null | MirageENGiNE_Engine/src/util/txtfile.cpp | Harha/MirageEngine | 6d0634385f514bbfce08cfacc8d743ce78c461fc | [
"MIT"
] | null | null | null | #include "txtfile.h"
// std includes
#include <fstream>
// mirage includes
#include "macros.h"
#include "strutil.h"
namespace mirage
{
TxtFile::TxtFile(const std::string & filePath) :
m_filePath(filePath),
m_lines()
{
// Read the file into memory
std::ifstream file(m_filePath);
if (file.is_open() == fa... | 17.777778 | 111 | 0.66625 | Harha |
da25843555203655458f0226be20436cd630a792 | 32,935 | hpp | C++ | include/Crafterra/Terrain/FieldMap.hpp | AsPJT/CrafterraProterozoic | d0531d2052b1bb5c10b6763f74034e6e3c678d1f | [
"CC0-1.0"
] | null | null | null | include/Crafterra/Terrain/FieldMap.hpp | AsPJT/CrafterraProterozoic | d0531d2052b1bb5c10b6763f74034e6e3c678d1f | [
"CC0-1.0"
] | null | null | null | include/Crafterra/Terrain/FieldMap.hpp | AsPJT/CrafterraProterozoic | d0531d2052b1bb5c10b6763f74034e6e3c678d1f | [
"CC0-1.0"
] | null | null | null | /*##########################################################################################
Crafterra Library 🌏
[Planning and Production]
2017-2022 Kasugaccho
2018-2022 As Project
[Contact Us]
wanotaitei@gmail.com
https://github.com/AsPJT/Crafterra
[License]
Distributed under the CC0 1.0.
https://creat... | 53.120968 | 343 | 0.717565 | AsPJT |
da25e8acda7ed97bfb7da32eb8ede58be0b2bb07 | 993 | cpp | C++ | pbinfo/anagrame-pfv/anagrame-pfv.cpp | cristicretu/cplusplus | 87f5980271431b11ae1b8c14ce6d2c620a404488 | [
"MIT"
] | 1 | 2022-01-27T17:13:08.000Z | 2022-01-27T17:13:08.000Z | pbinfo/anagrame-pfv/anagrame-pfv.cpp | cristicretu/cplusplus | 87f5980271431b11ae1b8c14ce6d2c620a404488 | [
"MIT"
] | null | null | null | pbinfo/anagrame-pfv/anagrame-pfv.cpp | cristicretu/cplusplus | 87f5980271431b11ae1b8c14ce6d2c620a404488 | [
"MIT"
] | null | null | null | #include <cstring>
#include <iostream>
char s[12];
char vocale[] = "aeiou";
int n, st[12], p[12];
void afis() {
for (int i = 1; i <= n; ++i) {
std::cout << s[st[i]];
}
std::cout << '\n';
}
bool valid(int k) {
if (strchr("aeiou", s[st[k]]) && st[k] != k - 1) return false;
return true;
}
void bkt(int k... | 15.515625 | 64 | 0.380665 | cristicretu |
da2785de81a97e7d470bbcaa04b0d76c76b27def | 216 | cpp | C++ | src/engine/network/NetAdr.cpp | BlackPhrase/V-Engine | ee9a9c63a380732dace75bcc1e398cabc444feba | [
"MIT"
] | 1 | 2018-06-22T15:46:42.000Z | 2018-06-22T15:46:42.000Z | src/engine/network/NetAdr.cpp | BlackPhrase/V-Engine | ee9a9c63a380732dace75bcc1e398cabc444feba | [
"MIT"
] | 3 | 2018-05-13T14:15:53.000Z | 2018-05-29T08:06:26.000Z | src/engine/network/NetAdr.cpp | BlackPhrase/V-Engine | ee9a9c63a380732dace75bcc1e398cabc444feba | [
"MIT"
] | null | null | null | #include "NetAdr.hpp"
CNetAdr::CNetAdr() = default;
CNetAdr::~CNetAdr() = default;
bool CNetAdr::IsLocal() const
{
return false; // TODO
};
INetAdr::Type CNetAdr::GetType() const
{
return INetAdr::Type::Temp;
}; | 15.428571 | 38 | 0.680556 | BlackPhrase |
da2d7f858984a4d3bb09ca8e485fe1599bea7ded | 3,568 | cc | C++ | tensorflow/contrib/lite/kernels/comparisons_test.cc | tucaiyong/tensorflow | 3cc3c87f375f1bc292bd58db4928b810ac888bc6 | [
"Apache-2.0"
] | 14 | 2018-12-06T06:51:33.000Z | 2021-03-23T11:29:24.000Z | tensorflow/contrib/lite/kernels/comparisons_test.cc | tucaiyong/tensorflow | 3cc3c87f375f1bc292bd58db4928b810ac888bc6 | [
"Apache-2.0"
] | 10 | 2018-02-04T18:41:52.000Z | 2018-05-02T09:00:46.000Z | tensorflow/contrib/lite/kernels/comparisons_test.cc | tucaiyong/tensorflow | 3cc3c87f375f1bc292bd58db4928b810ac888bc6 | [
"Apache-2.0"
] | 4 | 2018-01-17T14:22:49.000Z | 2018-02-27T15:06:41.000Z | /* Copyright 2018 The TensorFlow 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-2.0
Unless required by applicable law or a... | 36.040404 | 80 | 0.679933 | tucaiyong |
da2f05c8568cedef9b8239d008a65fe6d59c854b | 13,126 | cpp | C++ | hmi/sweetie_bot_joint_trajectory_editor/src/joint_trajectory_data.cpp | sweetie-bot-project/sweetie_bot | f15f9cb01f2763d0b9d62624a400a01961609762 | [
"BSD-3-Clause"
] | 9 | 2019-08-11T17:40:11.000Z | 2022-01-17T00:50:24.000Z | hmi/sweetie_bot_joint_trajectory_editor/src/joint_trajectory_data.cpp | sweetie-bot-project/sweetie_bot | f15f9cb01f2763d0b9d62624a400a01961609762 | [
"BSD-3-Clause"
] | null | null | null | hmi/sweetie_bot_joint_trajectory_editor/src/joint_trajectory_data.cpp | sweetie-bot-project/sweetie_bot | f15f9cb01f2763d0b9d62624a400a01961609762 | [
"BSD-3-Clause"
] | 2 | 2019-12-23T05:06:34.000Z | 2020-07-14T10:07:33.000Z | #include "joint_trajectory_data.h"
#include <cmath>
#include <functional>
#include <exception>
using namespace std;
namespace sweetie_bot {
namespace hmi {
unsigned int JointTrajectoryData::crc(const std::vector<double>& positions)
{
size_t crc = 0;
std::hash<double> hash_fn;
for(auto it = positions.begin(); ... | 35.475676 | 199 | 0.707984 | sweetie-bot-project |
da2f0f734ad4a71704a2ff8b6a9a922fcd6df66f | 4,459 | cpp | C++ | PGTProject/Source/PGTProject/Private/GameTickManager.cpp | dylanpiera/IVGT6 | b5696222d53a0d3a8369b8c5eb9e35c03e8afab8 | [
"MIT"
] | null | null | null | PGTProject/Source/PGTProject/Private/GameTickManager.cpp | dylanpiera/IVGT6 | b5696222d53a0d3a8369b8c5eb9e35c03e8afab8 | [
"MIT"
] | null | null | null | PGTProject/Source/PGTProject/Private/GameTickManager.cpp | dylanpiera/IVGT6 | b5696222d53a0d3a8369b8c5eb9e35c03e8afab8 | [
"MIT"
] | null | null | null |
#include "GameTickManager.h"
#include "Engine/World.h"
#include "Engine/Engine.h"
#include "ActiveState.h"
#include "BuildingState.h"
#include <iostream>
#include "Utility.h"
#include "Runtime/Engine/Classes/Kismet/GameplayStatics.h"
// Sets default values
AGameTickManager::AGameTickManager()
{
// Set this actor t... | 22.634518 | 115 | 0.708679 | dylanpiera |
da3d9dc9ff9da2beb3fdccc4071f0cb40b44972f | 1,846 | cc | C++ | lib/tensor/opdefs/tensor_shape.cc | cezheng/runtime | 0866034bbc9bbe3ac513abf249edcaae13319909 | [
"Apache-2.0"
] | 2 | 2021-08-09T21:26:39.000Z | 2021-11-17T10:57:43.000Z | lib/tensor/opdefs/tensor_shape.cc | cezheng/runtime | 0866034bbc9bbe3ac513abf249edcaae13319909 | [
"Apache-2.0"
] | null | null | null | lib/tensor/opdefs/tensor_shape.cc | cezheng/runtime | 0866034bbc9bbe3ac513abf249edcaae13319909 | [
"Apache-2.0"
] | 1 | 2020-08-03T20:23:58.000Z | 2020-08-03T20:23:58.000Z | // Copyright 2020 The TensorFlow Runtime 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 ... | 34.185185 | 80 | 0.557421 | cezheng |
da4579210b5f46d2fa3acbed37d3cd2521540aec | 882 | cpp | C++ | FrameWorkCode/eddis.cpp | ayushbits/udaan-post-editing | 499303a641598978d89cf0210776e80d98d2212a | [
"BSD-3-Clause"
] | 1 | 2022-01-25T19:27:55.000Z | 2022-01-25T19:27:55.000Z | FrameWorkCode/eddis.cpp | ayushbits/udaan-post-editing | 499303a641598978d89cf0210776e80d98d2212a | [
"BSD-3-Clause"
] | null | null | null | FrameWorkCode/eddis.cpp | ayushbits/udaan-post-editing | 499303a641598978d89cf0210776e80d98d2212a | [
"BSD-3-Clause"
] | null | null | null | #include <cassert>
#include <string>
#include <vector>
#include "eddis.h"
size_t eddis :: min(size_t x, size_t y, size_t z)
{
if (x < y)
return x < z ? x : z;
else
return y < z ? y : z;
}
size_t eddis::editDist(const string& A, const string& B)
{
size_t NA = A.size();
... | 21 | 67 | 0.408163 | ayushbits |
da4620def666b28d1fe5f0079b55004008292c2e | 2,704 | cpp | C++ | chapter_5_meta_programming/ex_1_type_traits.cpp | joshlk/discovering_modern_cpp_peter_gottschling_exercises | ebd6a0f48d36ee85b7fac30a123038728ad9ffc2 | [
"MIT"
] | null | null | null | chapter_5_meta_programming/ex_1_type_traits.cpp | joshlk/discovering_modern_cpp_peter_gottschling_exercises | ebd6a0f48d36ee85b7fac30a123038728ad9ffc2 | [
"MIT"
] | null | null | null | chapter_5_meta_programming/ex_1_type_traits.cpp | joshlk/discovering_modern_cpp_peter_gottschling_exercises | ebd6a0f48d36ee85b7fac30a123038728ad9ffc2 | [
"MIT"
] | null | null | null | //
// Created by Josh Levy-Kramer on 02/04/2020.
//
#include <iostream>
#include <typeinfo>
// ---- remove_reference
// Overload for a normal type, type reference and rvalue type reference
template <typename T>
struct remove_reference {
using type = T;
};
template <typename T>
struct remove_reference<T&> {
u... | 29.075269 | 91 | 0.610577 | joshlk |
da47bb180c38a09c8d2c906289d0f5daabb813e5 | 1,931 | hpp | C++ | include/ast/ExpressionTypeNode.hpp | aviralg/tastr | 184e6324de86831c1e4162112d446f537ad8f50c | [
"Apache-2.0"
] | 1 | 2021-03-25T04:05:35.000Z | 2021-03-25T04:05:35.000Z | include/ast/ExpressionTypeNode.hpp | aviralg/tastr | 184e6324de86831c1e4162112d446f537ad8f50c | [
"Apache-2.0"
] | null | null | null | include/ast/ExpressionTypeNode.hpp | aviralg/tastr | 184e6324de86831c1e4162112d446f537ad8f50c | [
"Apache-2.0"
] | null | null | null | #ifndef TASTR_AST_EXPRESSION_TYPE_NODE_HPP
#define TASTR_AST_EXPRESSION_TYPE_NODE_HPP
#include "ast/KeywordNode.hpp"
#include "ast/TypeNode.hpp"
namespace tastr {
namespace ast {
class ExpressionTypeNode final: public TypeNode {
public:
explicit ExpressionTypeNode(KeywordNodeUPtr keyword)
: TypeNode(),... | 26.094595 | 80 | 0.681512 | aviralg |
da4b930b5e24547a4d15259ed86d2718a1c5cd3e | 24,270 | cpp | C++ | src/main/cpp/Robot.cpp | FRC830/2022Robot | 32d3db27190cf48d5885832e1b734ddf8fdcc048 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/Robot.cpp | FRC830/2022Robot | 32d3db27190cf48d5885832e1b734ddf8fdcc048 | [
"BSD-3-Clause"
] | null | null | null | src/main/cpp/Robot.cpp | FRC830/2022Robot | 32d3db27190cf48d5885832e1b734ddf8fdcc048 | [
"BSD-3-Clause"
] | null | null | null | // Copyright (c) FIRST and other WPILib contributors.
// Open Source Software; you can modify and/or share it under the terms of
// the WPILib BSD license file in the root directory of this project.
#include "Robot.h"
#include <iostream>
#include <math.h>
using namespace std;
void Robot::RobotInit() {
PlaceShuffl... | 32.48996 | 196 | 0.693943 | FRC830 |
da4fc46853af53398f362ade68d409801ac40d54 | 1,965 | cpp | C++ | mod/wrd/ast/exprs/getExpr.cpp | kniz/wrd | a8c9e8bd2f7b240ff64a3b80e7ebc7aff2775ba6 | [
"MIT"
] | 1 | 2019-02-02T07:07:32.000Z | 2019-02-02T07:07:32.000Z | mod/wrd/ast/exprs/getExpr.cpp | kniz/wrd | a8c9e8bd2f7b240ff64a3b80e7ebc7aff2775ba6 | [
"MIT"
] | 25 | 2016-09-23T16:36:19.000Z | 2019-02-12T14:14:32.000Z | mod/wrd/ast/exprs/getExpr.cpp | kniz/World | 13b0c8c7fdc6280efcb2135dc3902754a34e6d06 | [
"MIT"
] | null | null | null | #include "getExpr.hpp"
#include "../../loader/interpreter/tverification.hpp"
#include "../../loader/interpreter/verification.inl"
#include "../../loader/interpreter/verifier.hpp"
#include "../../frame/thread.hpp"
#include "../node.inl"
namespace wrd {
WRD_DEF_ME(getExpr)
const node& me::getFrom() const {
... | 30.230769 | 101 | 0.582697 | kniz |
da546e7ff22adfeb0f5082b616cbd9c2032fac3d | 4,060 | cpp | C++ | teleop_and_haptics/sss/Source/MyVolumesWidget.cpp | atp42/jks-ros-pkg | 367fc00f2a9699f33d05c7957d319a80337f1ed4 | [
"FTL"
] | 3 | 2017-02-02T13:27:45.000Z | 2018-06-17T11:52:13.000Z | teleop_and_haptics/sss/Source/MyVolumesWidget.cpp | salisbury-robotics/jks-ros-pkg | 367fc00f2a9699f33d05c7957d319a80337f1ed4 | [
"FTL"
] | null | null | null | teleop_and_haptics/sss/Source/MyVolumesWidget.cpp | salisbury-robotics/jks-ros-pkg | 367fc00f2a9699f33d05c7957d319a80337f1ed4 | [
"FTL"
] | null | null | null | #include "MyVolumesWidget.h"
#include <QtGui>
MyVolumesWidget::MyVolumesWidget(MyVolumesModel *model, QWidget *parent) :
QWidget(parent)
{
m_volumesModel = model;
int first = 1; // index of the first "real" volume (0 is a dummy)
QBoxLayout *layout = new QHBoxLayout(this);
// construct the left si... | 33.00813 | 91 | 0.65936 | atp42 |
da5877105526619ca73d5088738be3b076b79c7b | 73 | hh | C++ | dependencies/include/pimpl_ptr.hh | Wedrew/rpclib | eff0f0c7270ca8c17d46edf5ebc4ee97e4b2444f | [
"MIT"
] | 1,316 | 2016-07-03T10:01:37.000Z | 2022-03-31T18:40:35.000Z | dependencies/include/pimpl_ptr.hh | Wedrew/rpclib | eff0f0c7270ca8c17d46edf5ebc4ee97e4b2444f | [
"MIT"
] | 239 | 2016-06-29T07:16:26.000Z | 2022-03-23T09:21:15.000Z | dependencies/include/pimpl_ptr.hh | Wedrew/rpclib | eff0f0c7270ca8c17d46edf5ebc4ee97e4b2444f | [
"MIT"
] | 315 | 2016-08-24T13:08:20.000Z | 2022-03-29T10:59:08.000Z | #ifndef PIMPL_PTR_HH_
#define PIMPL_PTR_HH_
#endif /* PIMPL_PTR_HH_ */
| 12.166667 | 26 | 0.767123 | Wedrew |
da601ca52d43594f01ab3b5b7d423f4843df7771 | 425 | cpp | C++ | dynamic/4811.cpp | SiverPineValley/algo | 29c75c6b226fdb15a3b6695e763ee49d4871094e | [
"Apache-2.0"
] | null | null | null | dynamic/4811.cpp | SiverPineValley/algo | 29c75c6b226fdb15a3b6695e763ee49d4871094e | [
"Apache-2.0"
] | null | null | null | dynamic/4811.cpp | SiverPineValley/algo | 29c75c6b226fdb15a3b6695e763ee49d4871094e | [
"Apache-2.0"
] | null | null | null | // 알약
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int t, i, j;
cin >> t;
vector<vector<long long>> a(31,vector<long long> (31));
for(i = 1; i <= 30; i++)
a[0][i] = 1;
for(i = 1; i <= 30; i++)
{
for(j = 0; j <= 30 - i; j++)
{
if(j == 0) a[i][j] = a[i-1][1];
else a[i][j]... | 15.178571 | 56 | 0.449412 | SiverPineValley |
da651f99e46e19ddd884a3bb312b7c74a2eb2cd4 | 427 | hpp | C++ | NWNXLib/API/Mac/API/IncrMerger.hpp | Qowyn/unified | 149d0b7670a9d156e64555fe0bd7715423db4c2a | [
"MIT"
] | null | null | null | NWNXLib/API/Mac/API/IncrMerger.hpp | Qowyn/unified | 149d0b7670a9d156e64555fe0bd7715423db4c2a | [
"MIT"
] | null | null | null | NWNXLib/API/Mac/API/IncrMerger.hpp | Qowyn/unified | 149d0b7670a9d156e64555fe0bd7715423db4c2a | [
"MIT"
] | null | null | null | #pragma once
#include <cstdint>
#include "SorterFile.hpp"
#include "unknown_sqlite_int64.hpp"
namespace NWNXLib {
namespace API {
// Forward class declarations (defined in the source file)
struct MergeEngine;
struct SortSubtask;
struct IncrMerger
{
SortSubtask* pTask;
MergeEngine* pMerger;
sqlite_int6... | 14.233333 | 58 | 0.721311 | Qowyn |
da69a96972a8e31e7d55fef320e0885d8fce8583 | 879 | cpp | C++ | Leetcode/C++/Delete a given Node when a node is given.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 289 | 2021-05-15T22:56:03.000Z | 2022-03-28T23:13:25.000Z | Leetcode/C++/Delete a given Node when a node is given.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 1,812 | 2021-05-09T13:49:58.000Z | 2022-01-15T19:27:17.000Z | Leetcode/C++/Delete a given Node when a node is given.cpp | abdzitter/Daily-Coding-DS-ALGO-Practice | 26ddbf7a3673608039a07d26d812fce31b69871a | [
"MIT"
] | 663 | 2021-05-09T16:57:58.000Z | 2022-03-27T14:15:07.000Z |
// Problem Link : https://leetcode.com/problems/delete-node-in-a-linked-list/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
//copy the no... | 23.756757 | 129 | 0.577929 | abdzitter |
da6a4b71e2d7c27b5f5705ae22199d15008bb1d6 | 4,108 | hpp | C++ | Misc/APE Scripts/ShepardTone.hpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 34 | 2017-04-19T18:26:02.000Z | 2022-02-15T17:47:26.000Z | Misc/APE Scripts/ShepardTone.hpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 307 | 2017-05-04T21:45:01.000Z | 2022-02-03T00:59:01.000Z | Misc/APE Scripts/ShepardTone.hpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 4 | 2017-09-05T17:04:31.000Z | 2021-12-15T21:24:28.000Z | #include "../../../../RS-MET/Misc/APE Scripts/rapt_for_ape.cpp"
// relative path from "Audio Programming Environment/includes"
#include <effect.h> // or maybe we should use generator.h?
//=================================================================================================
// The core DSP object
templat... | 27.756757 | 99 | 0.542113 | RobinSchmidt |
da6a5d89591ce71da2a1488e769d888696c4add6 | 9,277 | cpp | C++ | src/core/btrc/core/volume/bvh.cpp | AirGuanZ/Btrc | 8865eb1506f96fb0230fb394b9fadb1e38f2b9d8 | [
"MIT"
] | 17 | 2022-02-03T09:35:14.000Z | 2022-03-28T04:27:05.000Z | src/core/btrc/core/volume/bvh.cpp | AirGuanZ/Btrc | 8865eb1506f96fb0230fb394b9fadb1e38f2b9d8 | [
"MIT"
] | 1 | 2022-02-09T15:11:55.000Z | 2022-02-09T15:11:55.000Z | src/core/btrc/core/volume/bvh.cpp | AirGuanZ/Btrc | 8865eb1506f96fb0230fb394b9fadb1e38f2b9d8 | [
"MIT"
] | null | null | null | #include <bvh/bvh.hpp>
#include <bvh/leaf_collapser.hpp>
#include <bvh/locally_ordered_clustering_builder.hpp>
#include <bvh/parallel_reinsertion_optimizer.hpp>
#include <btrc/core/volume/bvh.h>
#include <btrc/utils/enumerate.h>
BTRC_BEGIN
namespace
{
constexpr int TRAVERSAL_STACK_SIZE = 16;
bvh::Vector3<f... | 28.283537 | 128 | 0.514067 | AirGuanZ |
da718d0199de3de971410d10c487de0b34a802ee | 6,879 | cxx | C++ | ZDC/ZDCrec/AliZDCRecoParamPbPb.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 52 | 2016-12-11T13:04:01.000Z | 2022-03-11T11:49:35.000Z | ZDC/ZDCrec/AliZDCRecoParamPbPb.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 1,388 | 2016-11-01T10:27:36.000Z | 2022-03-30T15:26:09.000Z | ZDC/ZDCrec/AliZDCRecoParamPbPb.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 275 | 2016-06-21T20:24:05.000Z | 2022-03-31T13:06:19.000Z | /**************************************************************************
* Copyright(c) 2007-2009, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors ... | 39.763006 | 154 | 0.661579 | AllaMaevskaya |
da7555f9e196ed7ce8379f7f07916457df86e790 | 992 | cpp | C++ | libs/ncurses_lib/libncurses.cpp | elivet/Nibbler | 9e2e07d9e3fa3dc86a8e25a6db419359fa0e0e8a | [
"Apache-2.0"
] | null | null | null | libs/ncurses_lib/libncurses.cpp | elivet/Nibbler | 9e2e07d9e3fa3dc86a8e25a6db419359fa0e0e8a | [
"Apache-2.0"
] | null | null | null | libs/ncurses_lib/libncurses.cpp | elivet/Nibbler | 9e2e07d9e3fa3dc86a8e25a6db419359fa0e0e8a | [
"Apache-2.0"
] | null | null | null | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* libncurses.cpp :+: :+: :+: ... | 49.6 | 80 | 0.157258 | elivet |
da7f9db3fbf4bb584c0f68caedc692302ca0bcb9 | 181 | cpp | C++ | test/simple_consumer.cpp | mmha/gltfpp | 9e9e2fe5f8da374838a5b6b03d97963bed87956d | [
"BSL-1.0"
] | 25 | 2017-05-03T04:09:50.000Z | 2021-06-06T04:23:54.000Z | test/simple_consumer.cpp | mmha/gltfpp | 9e9e2fe5f8da374838a5b6b03d97963bed87956d | [
"BSL-1.0"
] | 9 | 2017-06-02T16:53:11.000Z | 2017-06-02T18:05:45.000Z | test/simple_consumer.cpp | mmha/gltfpp | 9e9e2fe5f8da374838a5b6b03d97963bed87956d | [
"BSL-1.0"
] | 5 | 2017-06-01T14:38:11.000Z | 2019-09-18T07:04:15.000Z | #include <cstdio>
#include <gltfpp.h>
int main(int argc, char **argv) {
gltfpp::glTF g;
nlohmann::json j(argv[1]);
from_json(j, g);
printf("%s", g.asset.copyright->c_str());
}
| 18.1 | 42 | 0.640884 | mmha |
da816a5740ebbd66adff15d7f6c185d906b311e1 | 41,955 | cpp | C++ | tests/tests.cpp | leopoldcambier/spaND_public | fc344dc1ff4b36832aad3f86adb4a23111c67366 | [
"MIT"
] | 6 | 2019-05-06T21:17:07.000Z | 2022-02-11T14:56:30.000Z | tests/tests.cpp | leopoldcambier/spaND_public | fc344dc1ff4b36832aad3f86adb4a23111c67366 | [
"MIT"
] | null | null | null | tests/tests.cpp | leopoldcambier/spaND_public | fc344dc1ff4b36832aad3f86adb4a23111c67366 | [
"MIT"
] | 1 | 2019-06-23T12:04:28.000Z | 2019-06-23T12:04:28.000Z | #include <gtest/gtest.h>
#include <iostream>
#include <assert.h>
#include <algorithm>
#include <random>
#include "spaND.h"
#include "mmio.hpp"
#include "cxxopts.hpp"
#include <Eigen/SparseCholesky>
using namespace std;
using namespace Eigen;
using namespace spaND;
bool VERB = false;
int N_THREADS = 4;
int RUN_MANY ... | 38.526171 | 150 | 0.420307 | leopoldcambier |
da81b258e5dc04a7f321af81e570619d695af003 | 2,531 | cpp | C++ | COMToys/src/MfcModule.cpp | skst/Timekeeper | 4aba38fe891cd8681f2ef290d47a147e2fef5f29 | [
"MIT"
] | 4 | 2021-05-28T03:27:21.000Z | 2022-02-17T02:09:16.000Z | COMToys/src/MfcModule.cpp | skst/Timekeeper | 4aba38fe891cd8681f2ef290d47a147e2fef5f29 | [
"MIT"
] | 2 | 2021-05-03T20:00:53.000Z | 2021-10-31T16:05:39.000Z | COMToys/src/MfcModule.cpp | skst/Timekeeper | 4aba38fe891cd8681f2ef290d47a147e2fef5f29 | [
"MIT"
] | null | null | null | ////////////////////////////////////////////////////////////////
// ComToys(TM) Copyright 1999 Paul DiLascia
// If this code works, it was written by Paul DiLascia.
// If not, I don't know who wrote it.
//
#include "StdAfx.h"
#include "COMtoys/ComToys.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
... | 26.642105 | 88 | 0.657053 | skst |
da849d94b46b8367d17b45f3d35438e7a47dc893 | 2,101 | cc | C++ | riscos/libs/tbx/tbx/showfullobject.cc | riscoscloverleaf/chatcube | a7184ef76108f90a74a88d3183a3d21c1249a0f5 | [
"MIT"
] | null | null | null | riscos/libs/tbx/tbx/showfullobject.cc | riscoscloverleaf/chatcube | a7184ef76108f90a74a88d3183a3d21c1249a0f5 | [
"MIT"
] | null | null | null | riscos/libs/tbx/tbx/showfullobject.cc | riscoscloverleaf/chatcube | a7184ef76108f90a74a88d3183a3d21c1249a0f5 | [
"MIT"
] | null | null | null | /*
* tbx RISC OS toolbox library
*
* Copyright (C) 2010-2012 Alan Buckley All Rights Reserved.
*
* 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 withou... | 26.2625 | 81 | 0.712994 | riscoscloverleaf |
da8713d45b134a834101c7b33493fbe16708ffaf | 2,927 | cpp | C++ | DialogTools/GetisOrdChoiceDlg.cpp | chenyoujie/GeoDa | 87504344512bd0da2ccadfb160ecd1e918a52f06 | [
"BSL-1.0"
] | null | null | null | DialogTools/GetisOrdChoiceDlg.cpp | chenyoujie/GeoDa | 87504344512bd0da2ccadfb160ecd1e918a52f06 | [
"BSL-1.0"
] | null | null | null | DialogTools/GetisOrdChoiceDlg.cpp | chenyoujie/GeoDa | 87504344512bd0da2ccadfb160ecd1e918a52f06 | [
"BSL-1.0"
] | null | null | null | /**
* GeoDa TM, Copyright (C) 2011-2015 by Luc Anselin - all rights reserved
*
* This file is part of GeoDa.
*
* GeoDa is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, o... | 31.138298 | 80 | 0.74479 | chenyoujie |
da8861ca0bda2567c52addb0dd5eb903b58a28dc | 1,285 | cpp | C++ | practice/algorithms/graph-theory/floyd-city-of-blinding-lights/floyd-city-of-blinding-lights.cpp | zeyuanxy/HackerRank | 5194a4af780ece396501c215996685d1be529e73 | [
"MIT"
] | 4 | 2017-01-18T17:51:58.000Z | 2019-10-20T12:14:37.000Z | practice/algorithms/graph-theory/floyd-city-of-blinding-lights/floyd-city-of-blinding-lights.cpp | zeyuanxy/HackerRank | 5194a4af780ece396501c215996685d1be529e73 | [
"MIT"
] | null | null | null | practice/algorithms/graph-theory/floyd-city-of-blinding-lights/floyd-city-of-blinding-lights.cpp | zeyuanxy/HackerRank | 5194a4af780ece396501c215996685d1be529e73 | [
"MIT"
] | 8 | 2016-03-14T17:16:59.000Z | 2021-06-26T10:11:33.000Z | /*
* @Author: Zeyuan Shang
* @Date: 2015-12-28 01:30:58
* @Last Modified by: Zeyuan Shang
* @Last Modified time: 2015-12-28 01:31:04
*/
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> build_graph(int N, int M)
{
vector<vector<int>> graph(N, vector<int>(N, -1));
int x, y, r... | 22.155172 | 67 | 0.435019 | zeyuanxy |
da893fc9e70304f1ab28d7209ee1b5c92a4589df | 2,252 | cpp | C++ | tutorial/message/message_server.cpp | TencentOpen/Pebble | 0f32f94db47b3bc1955ac2843bfa10372eeba1fb | [
"BSD-2-Clause"
] | 233 | 2016-05-12T02:28:44.000Z | 2020-08-24T18:11:49.000Z | tutorial/message/message_server.cpp | TencentOpen/Pebble | 0f32f94db47b3bc1955ac2843bfa10372eeba1fb | [
"BSD-2-Clause"
] | 1 | 2016-06-07T04:18:16.000Z | 2016-06-07T06:09:08.000Z | tutorial/message/message_server.cpp | TencentOpen/Pebble | 0f32f94db47b3bc1955ac2843bfa10372eeba1fb | [
"BSD-2-Clause"
] | 116 | 2016-05-24T10:55:49.000Z | 2019-11-24T06:57:08.000Z | /*
* Tencent is pleased to support the open source community by making Pebble available.
* Copyright (C) 2016 THL A29 Limited, a Tencent company. All rights reserved.
* Licensed under the MIT License (the "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the Lic... | 30.849315 | 100 | 0.667407 | TencentOpen |
da89c8934244a95ce9a950cdd8a37b003bbea530 | 333 | cpp | C++ | ProjectEuler/fibonacci.cpp | MFathirIrhas/ProgrammingChallenges | 8c67bd71212a1941e5bcc0463095285859afa04d | [
"MIT"
] | 3 | 2020-10-19T10:03:20.000Z | 2021-12-18T20:39:31.000Z | ProjectEuler/fibonacci.cpp | MFathirIrhas/ProgrammingChallenges | 8c67bd71212a1941e5bcc0463095285859afa04d | [
"MIT"
] | null | null | null | ProjectEuler/fibonacci.cpp | MFathirIrhas/ProgrammingChallenges | 8c67bd71212a1941e5bcc0463095285859afa04d | [
"MIT"
] | null | null | null | /*
Sum all even numbers of fibonacci until 4000000
*/
#include <iostream>
using namespace std;
int main(){
int a = 0;
int b = 1;
int c;
int sum = 0;
do{
c = a + b;
a = b;
b = c;
if(b % 2 == 0) //check if number is even
sum += b;
}while(b <= 4000000);
cout << sum; //return sum of all even number... | 12.807692 | 48 | 0.564565 | MFathirIrhas |
da8b2b9b1f99c12410a7203831d68d71b6fb9666 | 2,235 | cpp | C++ | scripts/matterport/render_uv/src/mesh_transformer/mesh_transformer.cpp | lukasHoel/stylemesh | a5e570d759fae0c08216154f51307b93894d2f98 | [
"MIT"
] | 53 | 2021-12-19T18:38:57.000Z | 2022-03-30T16:25:34.000Z | scripts/matterport/render_uv/src/mesh_transformer/mesh_transformer.cpp | lukasHoel/stylemesh | a5e570d759fae0c08216154f51307b93894d2f98 | [
"MIT"
] | null | null | null | scripts/matterport/render_uv/src/mesh_transformer/mesh_transformer.cpp | lukasHoel/stylemesh | a5e570d759fae0c08216154f51307b93894d2f98 | [
"MIT"
] | null | null | null | #include "mesh_transformer.h"
Mesh_Transformer::Mesh_Transformer(Mesh& mesh, Segmentation_Provider& sp):
m_mesh(mesh), m_sp(sp) { }
Mesh_Transformer::~Mesh_Transformer() = default;
void Mesh_Transformer::splitMeshAtObject(int objectId) {
std::vector<unsigned int> newIndices;
... | 37.25 | 138 | 0.624161 | lukasHoel |
da9851cebef7ce2a96a6a97705266be324bf4867 | 9,422 | hpp | C++ | cartesian_trajectory_controller/include/cartesian_trajectory_controller/cartesian_trajectory_controller.hpp | christianlandgraf/Universal_Robots_ROS_controllers_cartesian | 987e4539af011292b5b34c7f891fe9f274e00ddd | [
"Apache-2.0"
] | 12 | 2021-06-09T15:05:28.000Z | 2022-02-16T11:14:16.000Z | cartesian_trajectory_controller/include/cartesian_trajectory_controller/cartesian_trajectory_controller.hpp | christianlandgraf/Universal_Robots_ROS_controllers_cartesian | 987e4539af011292b5b34c7f891fe9f274e00ddd | [
"Apache-2.0"
] | 7 | 2021-08-03T10:06:13.000Z | 2022-03-25T22:58:28.000Z | cartesian_trajectory_controller/include/cartesian_trajectory_controller/cartesian_trajectory_controller.hpp | christianlandgraf/Universal_Robots_ROS_controllers_cartesian | 987e4539af011292b5b34c7f891fe9f274e00ddd | [
"Apache-2.0"
] | 5 | 2021-06-21T06:21:52.000Z | 2022-03-02T14:52:40.000Z | // -- BEGIN LICENSE BLOCK ----------------------------------------------
// Copyright 2020 FZI Forschungszentrum Informatik
// Created on behalf of Universal Robots A/S
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may ob... | 34.639706 | 120 | 0.674061 | christianlandgraf |
da98c63af88cc4832c59e649e342539bbdde2ab3 | 3,285 | cpp | C++ | src/main.cpp | gustavosinbandera1/mongoose_os_esp32_http_server | 97a491e606b0508dbee37bf0ecdb91ae46e903be | [
"Apache-2.0"
] | null | null | null | src/main.cpp | gustavosinbandera1/mongoose_os_esp32_http_server | 97a491e606b0508dbee37bf0ecdb91ae46e903be | [
"Apache-2.0"
] | null | null | null | src/main.cpp | gustavosinbandera1/mongoose_os_esp32_http_server | 97a491e606b0508dbee37bf0ecdb91ae46e903be | [
"Apache-2.0"
] | null | null | null | #include "mgos.h"
#include "mgos_mqtt.h"
#include "mgos_wifi.h"
static void timer_cb(void *arg) {
static bool s_tick_tock = false;
LOG(LL_INFO,
("%s uptime: %.2lf, RAM: %lu, %lu free", (s_tick_tock ? "Tick" : "Tock"),
mgos_uptime(), (unsigned long) mgos_get_heap_size(),
(unsigned long) mgos_get... | 33.865979 | 80 | 0.625571 | gustavosinbandera1 |
da98d8d237a88d751487f8800bd19f444849a5c6 | 5,066 | cpp | C++ | Source/SprueEngine/Libs/igl/streamlines.cpp | Qt-Widgets/TexGraph | 8fe72cea1afcf5e235c810003bf4ee062bb3fc13 | [
"MIT"
] | 199 | 2018-02-26T20:56:21.000Z | 2022-03-16T06:09:52.000Z | Source/SprueEngine/Libs/igl/streamlines.cpp | Qt-Widgets/TexGraph | 8fe72cea1afcf5e235c810003bf4ee062bb3fc13 | [
"MIT"
] | 10 | 2018-03-20T02:49:58.000Z | 2021-12-29T01:13:22.000Z | Source/SprueEngine/Libs/igl/streamlines.cpp | Qt-Widgets/TexGraph | 8fe72cea1afcf5e235c810003bf4ee062bb3fc13 | [
"MIT"
] | 41 | 2018-02-28T01:33:37.000Z | 2021-12-29T16:06:19.000Z | // This file is part of libigl, a simple c++ geometry processing library.
//
// Copyright (C) 2016 Francisca Gil Ureta <gilureta@cs.nyu.edu>
//
// This Source Code Form is subject to the terms of the Mozilla Public License
// v. 2.0. If a copy of the MPL was not distributed with this file, You can
// obtain one at http... | 30.335329 | 115 | 0.543229 | Qt-Widgets |
da9ec50f1712432130d279a175473549476d285c | 290 | cpp | C++ | leetcode/07-Bit/JD0501E-InsertIntoBits/InsertIntoBits.cpp | BinRay/Learning | 36a2380a9686e6922632e6b85ddb3d1f0903b37a | [
"MIT"
] | null | null | null | leetcode/07-Bit/JD0501E-InsertIntoBits/InsertIntoBits.cpp | BinRay/Learning | 36a2380a9686e6922632e6b85ddb3d1f0903b37a | [
"MIT"
] | null | null | null | leetcode/07-Bit/JD0501E-InsertIntoBits/InsertIntoBits.cpp | BinRay/Learning | 36a2380a9686e6922632e6b85ddb3d1f0903b37a | [
"MIT"
] | null | null | null | class Solution {
public:
int insertBits(int N, int M, int i, int j) {
bitset<32> b_N( N );
bitset<32> b_M( M );
for ( int x = i, y = 0 ; x <= j; x++, y++ ){
b_N[x] = b_M[y];
}
return b_N.to_ulong();
}
}; | 20.714286 | 52 | 0.382759 | BinRay |
daa42ce41c7c0f1609cce10fa965e61ed6e45023 | 411 | cpp | C++ | Uncategorized/Summing A Sequence.cpp | andy-liuu/personal-DMOJ-Solutions | 42e08a32e84ea733f2c7fb3781b9652c26d70b59 | [
"MIT"
] | null | null | null | Uncategorized/Summing A Sequence.cpp | andy-liuu/personal-DMOJ-Solutions | 42e08a32e84ea733f2c7fb3781b9652c26d70b59 | [
"MIT"
] | null | null | null | Uncategorized/Summing A Sequence.cpp | andy-liuu/personal-DMOJ-Solutions | 42e08a32e84ea733f2c7fb3781b9652c26d70b59 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
long long n;
int main(){
//set up inputs and dp arrays
cin>>n;
long long items[n+1];
for(int i = 1;i<=n;i++){
cin>>items[i];
}
long long dp[n+1] = {};
dp[1] = items[1];
for(int q = 2;q<=n;q++){
dp[q] = max(... | 18.681818 | 74 | 0.459854 | andy-liuu |
daa6251b9f3e3e75b293b7c66562ed3f62e501a7 | 1,049 | hpp | C++ | src/scenes/highscore.hpp | Pfeifenjoy/Theseus | 9b427c16deaaacfff2e174e3dd133feed9724d3b | [
"MIT"
] | 6 | 2016-10-28T15:39:09.000Z | 2019-04-16T09:00:03.000Z | src/scenes/highscore.hpp | Pfeifenjoy/Theseus | 9b427c16deaaacfff2e174e3dd133feed9724d3b | [
"MIT"
] | null | null | null | src/scenes/highscore.hpp | Pfeifenjoy/Theseus | 9b427c16deaaacfff2e174e3dd133feed9724d3b | [
"MIT"
] | 6 | 2017-02-22T17:25:32.000Z | 2021-02-03T19:17:06.000Z | /**
* @author Dominic Steinhauser
*/
#ifndef _THESEUS_GAME_HIGHSCORE_H
#define _THESEUS_GAME_HIGHSCORE_H
#include "../engine/scene.hpp"
#include "../gameobjects/textfield.hpp"
#include <memory>
#include <vector>
#include <string>
namespace theseus
{
namespace scenes
{
class Highscore
: public engine::Scene
... | 20.98 | 108 | 0.505243 | Pfeifenjoy |
daa652bebe679c616aa8e046a2b8f83d4b59e5f8 | 400 | hpp | C++ | src/Application.hpp | Thomas-Zorroche/Oryon | 54237355055b262110346b33023d3cab63124fc0 | [
"MIT"
] | null | null | null | src/Application.hpp | Thomas-Zorroche/Oryon | 54237355055b262110346b33023d3cab63124fc0 | [
"MIT"
] | null | null | null | src/Application.hpp | Thomas-Zorroche/Oryon | 54237355055b262110346b33023d3cab63124fc0 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
#include "Window.hpp"
#include "Editor/Editor.hpp"
#include "Events/Event.hpp"
namespace oryon
{
class Application
{
public:
Application(int argc, char** argv);
Window& getWindow() { return * _window; }
void run();
void onEvent(Event& e);
private:
std::unique_ptr<... | 12.5 | 44 | 0.6725 | Thomas-Zorroche |
daa7b48131608c28dadc74dc66c423d09fde1596 | 614 | cpp | C++ | Source.cpp | usamashafiq/print_right_triangle | 78f7ae74ed2672235648793ba4ffc9f3d679a5ea | [
"MIT"
] | null | null | null | Source.cpp | usamashafiq/print_right_triangle | 78f7ae74ed2672235648793ba4ffc9f3d679a5ea | [
"MIT"
] | null | null | null | Source.cpp | usamashafiq/print_right_triangle | 78f7ae74ed2672235648793ba4ffc9f3d679a5ea | [
"MIT"
] | null | null | null | #include<iostream>
#include<conio.h>
using namespace std;
void print_right_triangle(int, char = '*');
void main() {
int a;
char c,q;
cout << "Enter a size " << endl;
cin >> a;
cout << "you want to enter char ans in (Y/N) " << endl;
cin >> c;
if (c == 'y'||c=='Y') {
cout << "Enter a char '@,#,$... | 14.97561 | 59 | 0.486971 | usamashafiq |
daaa486a8d57cd530b323a1ffb7865177cae4357 | 3,168 | cpp | C++ | UnitTest/LibTest/sdl_test.cpp | rocketman123456/RocketEngine | ede1670d70c4689a5dc8543ca5351e8f23fcb840 | [
"Apache-2.0"
] | null | null | null | UnitTest/LibTest/sdl_test.cpp | rocketman123456/RocketEngine | ede1670d70c4689a5dc8543ca5351e8f23fcb840 | [
"Apache-2.0"
] | null | null | null | UnitTest/LibTest/sdl_test.cpp | rocketman123456/RocketEngine | ede1670d70c4689a5dc8543ca5351e8f23fcb840 | [
"Apache-2.0"
] | null | null | null | #include <stdio.h>
#include <stdint.h>
#include <assert.h>
#include <iostream>
#include <iomanip>
#define SDL_MAIN_HANDLED
#include <SDL2/SDL.h>
#include <glad/glad.h>
#include <SDL2/SDL_opengl.h>
//#include <GL/gl.h>
typedef int32_t i32;
typedef uint32_t u32;
typedef int32_t b32;
#define WinWidth 1280
#define WinH... | 34.064516 | 148 | 0.591856 | rocketman123456 |
daab8cab39a6a8016de0c4dc9b727ff4756cbae1 | 6,616 | cxx | C++ | Libraries/ITK/Testing/Segmentation/MIDASIrregularVolumeEditor/itkMIDASRegionOfInterestCalculatorTest.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 13 | 2018-07-28T13:36:38.000Z | 2021-11-01T19:17:39.000Z | Libraries/ITK/Testing/Segmentation/MIDASIrregularVolumeEditor/itkMIDASRegionOfInterestCalculatorTest.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | null | null | null | Libraries/ITK/Testing/Segmentation/MIDASIrregularVolumeEditor/itkMIDASRegionOfInterestCalculatorTest.cxx | NifTK/NifTK | 2358b333c89ff1bba1c232eecbbcdc8003305dfe | [
"BSD-3-Clause"
] | 10 | 2018-08-20T07:06:00.000Z | 2021-07-07T07:55:27.000Z | /*=============================================================================
NifTK: A software platform for medical image computing.
Copyright (c) University College London (UCL). All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY o... | 32.273171 | 124 | 0.60792 | NifTK |
daacc621b1123920e28327f57cac176717cd58d1 | 48 | cpp | C++ | Engine.cpp | KarmaiSAYIn/recapp | c1a968214b4cf1b4d8befd1c72bedf64e1fc0813 | [
"BSD-3-Clause"
] | null | null | null | Engine.cpp | KarmaiSAYIn/recapp | c1a968214b4cf1b4d8befd1c72bedf64e1fc0813 | [
"BSD-3-Clause"
] | null | null | null | Engine.cpp | KarmaiSAYIn/recapp | c1a968214b4cf1b4d8befd1c72bedf64e1fc0813 | [
"BSD-3-Clause"
] | null | null | null | #define OLC_PGE_APPLICATION
#include "Engine.h"
| 16 | 27 | 0.8125 | KarmaiSAYIn |
dab09ead5983335ab8305127b36caf33624c85fc | 1,499 | cc | C++ | third_party/accessibility/base/string_utils_unittest.cc | onix39/engine | ec66a45a3a7d5b9dfc2e0feab8965db7a91027cc | [
"BSD-3-Clause"
] | 12 | 2018-12-07T05:15:45.000Z | 2019-12-26T01:15:34.000Z | third_party/accessibility/base/string_utils_unittest.cc | onix39/engine | ec66a45a3a7d5b9dfc2e0feab8965db7a91027cc | [
"BSD-3-Clause"
] | 155 | 2020-11-30T09:16:59.000Z | 2022-03-29T09:40:55.000Z | third_party/accessibility/base/string_utils_unittest.cc | onix39/engine | ec66a45a3a7d5b9dfc2e0feab8965db7a91027cc | [
"BSD-3-Clause"
] | 22 | 2020-11-25T10:58:46.000Z | 2022-01-25T09:45:25.000Z | // Copyright 2013 The Flutter Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "string_utils.h"
#include <cerrno>
#include <cstddef>
#include "base/logging.h"
#include "gtest/gtest.h"
namespace base {
TEST(StringUtilsTest... | 25.40678 | 73 | 0.70447 | onix39 |
dab0bfa6f03f9278a999b2e413f4be4e110e997b | 384 | hpp | C++ | graphics/Axis.hpp | theoden8/plot | ff69782d43b45bf5f4f95ee3f79a08fd9ce0bed3 | [
"WTFPL"
] | null | null | null | graphics/Axis.hpp | theoden8/plot | ff69782d43b45bf5f4f95ee3f79a08fd9ce0bed3 | [
"WTFPL"
] | null | null | null | graphics/Axis.hpp | theoden8/plot | ff69782d43b45bf5f4f95ee3f79a08fd9ce0bed3 | [
"WTFPL"
] | null | null | null | #pragma once
#include "Types.hpp"
struct axis {
real_t
winsize,
gridsize,
shift,
thickness;
real_t
lborder,
rborder;
private:
void reborder();
public:
axis(real_t winsize, real_t thickness, real_t shift = 0.);
real_t bold() const;
void set_grid(real_t diff);
void set_shift(real_t diff);
void set_s... | 16 | 59 | 0.713542 | theoden8 |
dab460b8aaae2d1c00ac6597cc64bb2e60790632 | 5,273 | cpp | C++ | Server/Tools/Supervisor/src/SupervisorReceiver.cpp | wayfinder/Wayfinder-Server | a688546589f246ee12a8a167a568a9c4c4ef8151 | [
"BSD-3-Clause"
] | 4 | 2015-08-17T20:12:22.000Z | 2020-05-30T19:53:26.000Z | Server/Tools/Supervisor/src/SupervisorReceiver.cpp | wayfinder/Wayfinder-Server | a688546589f246ee12a8a167a568a9c4c4ef8151 | [
"BSD-3-Clause"
] | null | null | null | Server/Tools/Supervisor/src/SupervisorReceiver.cpp | wayfinder/Wayfinder-Server | a688546589f246ee12a8a167a568a9c4c4ef8151 | [
"BSD-3-Clause"
] | null | null | null | /*
Copyright (c) 1999 - 2010, Vodafone Group Services Ltd
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 condit... | 38.772059 | 755 | 0.617296 | wayfinder |
dab86dea5b681cbeba3cdc98e98de5cd25567755 | 682 | cpp | C++ | source/SexyAppFramework/FModSoundInstance.cpp | alula/CircleShootApp | 6a15f2de91f0bbe3d030d8ec971e9c961275f5eb | [
"MIT"
] | 8 | 2022-03-17T22:15:59.000Z | 2022-03-23T20:59:38.000Z | source/SexyAppFramework/FModSoundInstance.cpp | alula/CircleShootApp | 6a15f2de91f0bbe3d030d8ec971e9c961275f5eb | [
"MIT"
] | null | null | null | source/SexyAppFramework/FModSoundInstance.cpp | alula/CircleShootApp | 6a15f2de91f0bbe3d030d8ec971e9c961275f5eb | [
"MIT"
] | null | null | null | #include "FModSoundInstance.h"
#include "FModLoader.h"
using namespace Sexy;
FModSoundInstance::FModSoundInstance()
{
mStream = NULL;
mChannelNum = 0;
}
FModSoundInstance::~FModSoundInstance()
{
Release();
}
void FModSoundInstance::Release()
{
}
void FModSoundInstance::SetVolume(double theVolume)
{
}
void FM... | 13.372549 | 60 | 0.741935 | alula |
dab8bade4524f62efde33035a7c18b38a05d091a | 1,300 | cc | C++ | libmat/test/src/test_reItr_all.cc | stiegerc/winterface | b6d501df1d0c015f2cd7126ac6b4e746d541c80c | [
"BSD-2-Clause"
] | 2 | 2020-10-06T09:14:23.000Z | 2020-11-25T06:08:54.000Z | libmat/test/src/test_reItr_all.cc | stiegerc/Winterface | b6d501df1d0c015f2cd7126ac6b4e746d541c80c | [
"BSD-2-Clause"
] | 1 | 2020-12-23T04:20:33.000Z | 2020-12-23T04:20:33.000Z | libmat/test/src/test_reItr_all.cc | stiegerc/Winterface | b6d501df1d0c015f2cd7126ac6b4e746d541c80c | [
"BSD-2-Clause"
] | 1 | 2020-07-14T13:53:32.000Z | 2020-07-14T13:53:32.000Z | // 2014-2019, ETH Zurich, Integrated Systems Laboratory
// Authors: Christian Stieger
#include "testTools.h"
#include "test_cpxItr_all.h"
#include "test_cpxItr_all.cc"
using namespace lm__;
// tests
template<>
void test_cpxItr_all<0>::test_all_dereference() {
// c_reItr
{
// lambda to generate const random ran... | 19.402985 | 57 | 0.636154 | stiegerc |
dabd5194efb503198df7e08bf34029a2b7e72213 | 8,699 | cpp | C++ | addglopeningbalance.cpp | bizjust/bizjust-erp | d3291e212bf89ab6e753194127b3951afcd02548 | [
"MIT"
] | 1 | 2022-02-16T13:02:43.000Z | 2022-02-16T13:02:43.000Z | addglopeningbalance.cpp | bizjust/bizjust-erp | d3291e212bf89ab6e753194127b3951afcd02548 | [
"MIT"
] | null | null | null | addglopeningbalance.cpp | bizjust/bizjust-erp | d3291e212bf89ab6e753194127b3951afcd02548 | [
"MIT"
] | null | null | null | #include "addglopeningbalance.h"
#include "ui_addglopeningbalance.h"
AddGLOpeningBalance::AddGLOpeningBalance(QWidget *parent) :
QWidget(parent),
ui(new Ui::AddGLOpeningBalance)
{
ui->setupUi(this);
loadform();
}
AddGLOpeningBalance::~AddGLOpeningBalance()
{
delete ui;
}
void AddGLOpeningBalance... | 33.457692 | 232 | 0.604667 | bizjust |
dabf957435d7070c4e57a7989218521f406dc7b4 | 789 | cpp | C++ | src/apps/icon-o-matic/shape/commands/ReversePathCommand.cpp | Kirishikesan/haiku | 835565c55830f2dab01e6e332cc7e2d9c015b51e | [
"MIT"
] | 1,338 | 2015-01-03T20:06:56.000Z | 2022-03-26T13:49:54.000Z | src/apps/icon-o-matic/shape/commands/ReversePathCommand.cpp | Kirishikesan/haiku | 835565c55830f2dab01e6e332cc7e2d9c015b51e | [
"MIT"
] | 15 | 2015-01-17T22:19:32.000Z | 2021-12-20T12:35:00.000Z | src/apps/icon-o-matic/shape/commands/ReversePathCommand.cpp | Kirishikesan/haiku | 835565c55830f2dab01e6e332cc7e2d9c015b51e | [
"MIT"
] | 350 | 2015-01-08T14:15:27.000Z | 2022-03-21T18:14:35.000Z | /*
* Copyright 2006, Haiku. All rights reserved.
* Distributed under the terms of the MIT License.
*
* Authors:
* Stephan Aßmus <superstippi@gmx.de>
*/
#include "ReversePathCommand.h"
#include <stdio.h>
#include <Catalog.h>
#include <Locale.h>
#include "VectorPath.h"
#undef B_TRANSLATION_CONTEXT
#define B_... | 14.089286 | 59 | 0.730038 | Kirishikesan |
dac0f574f5bd7dc4f5546df185453a394d9ba17e | 27,800 | cpp | C++ | externals/source/testdog/pack/src/html_reporter.cpp | skarab/coffee-master | 6c3ff71b7f15735e41c9859b6db981b94414c783 | [
"MIT"
] | null | null | null | externals/source/testdog/pack/src/html_reporter.cpp | skarab/coffee-master | 6c3ff71b7f15735e41c9859b6db981b94414c783 | [
"MIT"
] | null | null | null | externals/source/testdog/pack/src/html_reporter.cpp | skarab/coffee-master | 6c3ff71b7f15735e41c9859b6db981b94414c783 | [
"MIT"
] | null | null | null | //---------------------------------------------------------------------------
// PROJECT : TEST-DOG
// FILENAME : html_reporter.hpp
// DESCRIPTION : Concrete HTML reporting class.
// COPYRIGHT : Andy Thomas (C)
//---------------------------------------------------------------------------
//--------... | 31.698974 | 81 | 0.523921 | skarab |
dac18c98d7b653007725ef7b0622af146c8360f6 | 1,099 | hpp | C++ | include/gtfs/read_csv.hpp | mapbox/nepomuk | 8771482edb9b16bb0f5a152c15681c57eb3bb6b6 | [
"MIT"
] | 22 | 2017-05-12T11:52:26.000Z | 2021-12-06T06:05:08.000Z | include/gtfs/read_csv.hpp | mapbox/nepomuk | 8771482edb9b16bb0f5a152c15681c57eb3bb6b6 | [
"MIT"
] | 49 | 2017-05-11T16:13:58.000Z | 2017-12-13T11:19:17.000Z | include/gtfs/read_csv.hpp | mapbox/nepomuk | 8771482edb9b16bb0f5a152c15681c57eb3bb6b6 | [
"MIT"
] | 7 | 2017-11-19T12:04:26.000Z | 2021-12-06T06:14:25.000Z | #ifndef NEPOMUK_GTFS_READ_CSV_HPP_
#define NEPOMUK_GTFS_READ_CSV_HPP_
#include <boost/filesystem/path.hpp>
#include <boost/optional.hpp>
#include <string>
#include "gtfs/dataset.hpp"
namespace nepomuk
{
namespace gtfs
{
struct CSVDiscSource
{
boost::filesystem::path agency;
boost::filesystem::path calendar;... | 26.166667 | 61 | 0.745223 | mapbox |
dac5c782a1224e35b42b94abfa4e19ce81d22180 | 1,362 | cpp | C++ | code/2D_misc_code/math2d.cpp | darketmaster/misc_code | 46b66284e756a02ded677035a994d87b1e1cff69 | [
"MIT"
] | null | null | null | code/2D_misc_code/math2d.cpp | darketmaster/misc_code | 46b66284e756a02ded677035a994d87b1e1cff69 | [
"MIT"
] | null | null | null | code/2D_misc_code/math2d.cpp | darketmaster/misc_code | 46b66284e756a02ded677035a994d87b1e1cff69 | [
"MIT"
] | null | null | null | #define ALLEGRO_INCLUDE_MATH_H
#include "allegro.h"
#include "math2d.h"
#include "math.h"
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
void correct_angle(float *ang)
{
if(*ang >= 360.0) while(*ang >= 360.0) *ang -= 360.0;
else
if(*ang < 0.0) while(*ang < 0.0) *ang += 360.0;
}
... | 20.636364 | 73 | 0.571219 | darketmaster |
dac60771e185d510189f139a26d01a41a909b797 | 14,725 | inl | C++ | image/include/storm/image/Image.inl | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | 17 | 2019-02-12T14:40:06.000Z | 2021-12-21T12:54:17.000Z | image/include/storm/image/Image.inl | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | null | null | null | image/include/storm/image/Image.inl | Arthapz/StormKit | 7c8dead874734d04b97776287b25bf2ebe9be617 | [
"MIT"
] | 2 | 2019-02-21T10:07:42.000Z | 2020-05-08T19:49:10.000Z | // Copyright (C) 2021 Arthur LAURENT <arthur.laurent4@gmail.com>
// This file is subject to the license terms in the LICENSE file
// found in the top-level of this distribution
#pragma once
#include "Image.hpp"
namespace storm::image {
/////////////////////////////////////
///////////////////////////////////... | 37.659847 | 100 | 0.469134 | Arthapz |
dacde3c23dc3777e5404cccc19a89b390708c63a | 7,150 | cxx | C++ | vtr/toro/TO_Output/TO_OutputEmailMetrics.cxx | haojunliu/OpenFPGA | b0c4f27077f698aae59bbcbd3ca002f22ba2a5a1 | [
"BSD-2-Clause"
] | 31 | 2016-02-15T02:57:28.000Z | 2021-06-02T10:40:25.000Z | vtr/toro/TO_Output/TO_OutputEmailMetrics.cxx | haojunliu/OpenFPGA | b0c4f27077f698aae59bbcbd3ca002f22ba2a5a1 | [
"BSD-2-Clause"
] | null | null | null | vtr/toro/TO_Output/TO_OutputEmailMetrics.cxx | haojunliu/OpenFPGA | b0c4f27077f698aae59bbcbd3ca002f22ba2a5a1 | [
"BSD-2-Clause"
] | 6 | 2017-02-08T21:51:51.000Z | 2021-06-02T10:40:40.000Z | //===========================================================================//
// Purpose : Supporting methods for the TO_Output_c post-processor class.
// These methods support formatting and sending a metrics email.
//
// Private methods include:
// - SendMetricsEmail_
// - Bu... | 38.235294 | 106 | 0.50042 | haojunliu |
dad1354450c609a7e177b5f64d9da1cb1be2bde3 | 545 | cpp | C++ | GeeksForGeeks/DS/1. Linked List/5.search-an-element-in-a-linked-list-iterative-and-recursive.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 36 | 2019-12-27T08:23:08.000Z | 2022-01-24T20:35:47.000Z | GeeksForGeeks/DS/1. Linked List/5.search-an-element-in-a-linked-list-iterative-and-recursive.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 10 | 2019-11-13T02:55:18.000Z | 2021-10-13T23:28:09.000Z | GeeksForGeeks/DS/1. Linked List/5.search-an-element-in-a-linked-list-iterative-and-recursive.cpp | Ashwanigupta9125/code-DS-ALGO | 49f6cf7d0c682da669db23619aef3f80697b352b | [
"MIT"
] | 53 | 2020-08-15T11:08:40.000Z | 2021-10-09T15:51:38.000Z | // http://geeksquiz.com/search-an-element-in-a-linked-list-iterative-and-recursive
#include "linkedList.h"
bool search(node *head, int x){
if(head == NULL)
return 0;
if(head->data == x)
return true;
return search(head->next, x);
}
int main(){
node* head = NULL;
int x = 21;
/* Use push() to... | 19.464286 | 82 | 0.572477 | Ashwanigupta9125 |
dad4144fd8a60c44e5f8ac9649ebbfc262a21ff1 | 5,970 | cpp | C++ | IRLib/Decoder.cpp | rizwanullah/IRLib | d06bea379e62f0db7276d3be3488b5af8ce8c369 | [
"Apache-2.0"
] | null | null | null | IRLib/Decoder.cpp | rizwanullah/IRLib | d06bea379e62f0db7276d3be3488b5af8ce8c369 | [
"Apache-2.0"
] | null | null | null | IRLib/Decoder.cpp | rizwanullah/IRLib | d06bea379e62f0db7276d3be3488b5af8ce8c369 | [
"Apache-2.0"
] | null | null | null | #include "Decoder.h"
#include "json.hpp"
#include "Common.h"
using json = nlohmann::json;
Decoder::Decoder() {}
std::string Decoder::decode(std::string encodedIrJsonStr) {
json encodedIrJson;
REMOTE_COMMON remoteCommon;
std::string encodedIrData;
//memset(&remoteCommon, 0, sizeof(remoteCommon));
... | 44.552239 | 145 | 0.672362 | rizwanullah |
dad944fc138dd5b3cbcdc751f6a2c80231622cde | 278 | cc | C++ | sem3/jnp1/playlist/SequenceMode.cc | abrams27/mimuw | ad8b01b63c05d7903aab29fd145845cf97ac32d9 | [
"MIT"
] | 3 | 2021-10-07T18:19:37.000Z | 2021-10-07T19:02:14.000Z | sem3/jnp1/playlist/SequenceMode.cc | abrams27/mimuw | ad8b01b63c05d7903aab29fd145845cf97ac32d9 | [
"MIT"
] | null | null | null | sem3/jnp1/playlist/SequenceMode.cc | abrams27/mimuw | ad8b01b63c05d7903aab29fd145845cf97ac32d9 | [
"MIT"
] | 3 | 2021-12-02T11:09:09.000Z | 2022-01-25T21:31:23.000Z | #include "SequenceMode.h"
std::shared_ptr<std::vector<size_t>> SequenceMode::get_order(size_t size) {
auto order = std::make_shared<std::vector<size_t>>();
for (size_t i = 0; i < size; i++) {
order->push_back(i);
}
return order;
}
SequenceMode::SequenceMode() {}
| 21.384615 | 75 | 0.661871 | abrams27 |
dae53245f62fea7a54ed6926505324621f29f39b | 1,056 | cpp | C++ | roman-to-integer.cpp | isanchez-aguilar/LeetCode-Solutions | 094c15b672efa6ca2581f187579303c8b94390a3 | [
"MIT"
] | null | null | null | roman-to-integer.cpp | isanchez-aguilar/LeetCode-Solutions | 094c15b672efa6ca2581f187579303c8b94390a3 | [
"MIT"
] | null | null | null | roman-to-integer.cpp | isanchez-aguilar/LeetCode-Solutions | 094c15b672efa6ca2581f187579303c8b94390a3 | [
"MIT"
] | null | null | null | class Solution {
public:
static int getValueOfChar(char c) {
if (c == 'I')
return 1;
if (c == 'V')
return 5;
if (c == 'X')
return 10;
if (c == 'L')
return 50;
if (c == 'C')
return 100;
if (c == 'D')
return 500;
return 1000;
... | 17.311475 | 51 | 0.482008 | isanchez-aguilar |
daea7fa9d026ab64bc6657d418427ad9b130ff80 | 1,291 | cpp | C++ | src/modelFactory/FindSCMain.cpp | toebs88/SCAM | 0b5a8f1c57593da40e85d0b8ce6a6cf5616379ca | [
"MIT"
] | 3 | 2018-08-31T21:35:27.000Z | 2018-10-29T04:06:46.000Z | src/modelFactory/FindSCMain.cpp | toebs88/SCAM | 0b5a8f1c57593da40e85d0b8ce6a6cf5616379ca | [
"MIT"
] | 1 | 2018-04-20T12:38:22.000Z | 2018-04-20T12:38:55.000Z | src/modelFactory/FindSCMain.cpp | toebs88/SCAM | 0b5a8f1c57593da40e85d0b8ce6a6cf5616379ca | [
"MIT"
] | null | null | null | #include <iostream>
#include "FindSCMain.h"
namespace SCAM {
FindSCMain::FindSCMain(clang::TranslationUnitDecl *tuDecl):
pass(0),
scMainFound(false),
_scmainFunctionDecl(NULL){
assert (!(tuDecl == NULL));
//Find sc_main
TraverseDecl(tuDecl);
//Is... | 28.688889 | 115 | 0.570875 | toebs88 |
daf21b6cc2dad19ff68ccdb7b99cafead549e91a | 8,908 | cpp | C++ | modules/xfeatures2d/src/pct_signatures_sqfd.cpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 7,158 | 2016-07-04T22:19:27.000Z | 2022-03-31T07:54:32.000Z | modules/xfeatures2d/src/pct_signatures_sqfd.cpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 2,184 | 2016-07-05T12:04:14.000Z | 2022-03-30T19:10:12.000Z | modules/xfeatures2d/src/pct_signatures_sqfd.cpp | Nondzu/opencv_contrib | 0b0616a25d4239ee81fda965818b49b721620f56 | [
"BSD-3-Clause"
] | 5,535 | 2016-07-06T12:01:10.000Z | 2022-03-31T03:13:24.000Z | /*
By downloading, copying, installing or using the software you agree to this license.
If you do not agree to this license, do not download, install,
copy or use the software.
License Agreement
For Open Source Computer Vision Library
(3-clause BSD Licen... | 39.591111 | 140 | 0.591828 | Nondzu |
daf3166dce0501452596e89e418449bde63c9607 | 5,965 | cpp | C++ | StartDialog.cpp | KaikiasVind/CellBadger | c21adf5feec7766decfd4d89a110364d4bdfbc46 | [
"MIT"
] | null | null | null | StartDialog.cpp | KaikiasVind/CellBadger | c21adf5feec7766decfd4d89a110364d4bdfbc46 | [
"MIT"
] | null | null | null | StartDialog.cpp | KaikiasVind/CellBadger | c21adf5feec7766decfd4d89a110364d4bdfbc46 | [
"MIT"
] | null | null | null | #include "StartDialog.h"
#include "ui_StartDialog.h"
#include <QStringList>
#include <QFileDialog>
#include <QDir>
#include <QDebug>
#include <QPushButton>
#include <QLabel>
#include <QObject>
#include <QAction>
#include <QMouseEvent>
#include "Utils/Helper.h"
using Helper::chopFileName;
using Helper::openFileDialog... | 25.063025 | 125 | 0.677284 | KaikiasVind |
daf428e5daade87c6e23122d7d74215de7f98183 | 719 | cpp | C++ | Rogue.cpp | Kahsyaj/TacticalRPGProject | 689c2131e4ec0e5ccc272e630b9483880ecbafc3 | [
"MIT"
] | null | null | null | Rogue.cpp | Kahsyaj/TacticalRPGProject | 689c2131e4ec0e5ccc272e630b9483880ecbafc3 | [
"MIT"
] | null | null | null | Rogue.cpp | Kahsyaj/TacticalRPGProject | 689c2131e4ec0e5ccc272e630b9483880ecbafc3 | [
"MIT"
] | null | null | null | #include "Rogue.h"
#include "IronArmor.h"
#include "SilverDagger.h"
#include "SilverSword.h"
#include "YewStick.h"
#include "Inventory.h"
//Constructor
//No drop defined
Rogue::Rogue(int lvl) : Monster("Rogue", new int[2]{HP*lvl, HP*lvl}, new int[2]{MANA*lvl, MANA*lvl},
lvl, GOLD*lvl, STRENGTH*lvl, AGILITY*lv... | 29.958333 | 101 | 0.687065 | Kahsyaj |
dafb238d7c9ae5709f90ff437c60dd5c5e2410bd | 309 | hpp | C++ | firmware/VersickerungsSensor/src/Display/Pages/Elements/Mixins/FilteredDistanceMixin.hpp | Finomnis/VersickerungsSensor | 90b02acc9c57b71c38a874760008780dce1abc8f | [
"MIT"
] | null | null | null | firmware/VersickerungsSensor/src/Display/Pages/Elements/Mixins/FilteredDistanceMixin.hpp | Finomnis/VersickerungsSensor | 90b02acc9c57b71c38a874760008780dce1abc8f | [
"MIT"
] | null | null | null | firmware/VersickerungsSensor/src/Display/Pages/Elements/Mixins/FilteredDistanceMixin.hpp | Finomnis/VersickerungsSensor | 90b02acc9c57b71c38a874760008780dce1abc8f | [
"MIT"
] | null | null | null | #pragma once
#include "../../../../utils/ValueWatcher.hpp"
namespace Pages::Elements::Mixins
{
class FilteredDistanceMixin
{
protected:
FilteredDistanceMixin();
ValueWatcher<float> &filtered_distance();
private:
ValueWatcher<float> filtered_distance_value;
};
}
| 18.176471 | 52 | 0.653722 | Finomnis |
daff34c6e49f7ce10c7b45518a1edd7a3d66be09 | 5,256 | cpp | C++ | traj_visualization_plugin/src/trajectory_display.cpp | YanzhouWang/rsp_final_project | c58c3efbf507cdd54abf860f7519006bc077c9f0 | [
"MIT"
] | null | null | null | traj_visualization_plugin/src/trajectory_display.cpp | YanzhouWang/rsp_final_project | c58c3efbf507cdd54abf860f7519006bc077c9f0 | [
"MIT"
] | null | null | null | traj_visualization_plugin/src/trajectory_display.cpp | YanzhouWang/rsp_final_project | c58c3efbf507cdd54abf860f7519006bc077c9f0 | [
"MIT"
] | null | null | null | #include <traj_visualization_plugin/trajectory_display.hpp>
namespace trajectory_display_ns{
trajectory_display::trajectory_display(){
description_property_=new rviz::StringProperty("Robot Description","robot_description",
"The name of the ROS parameter where the URDF for the robot is loaded",
... | 38.364964 | 115 | 0.709285 | YanzhouWang |