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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
9b1b8a6e960b7afb64ef84d4db3d32492dcc9c5a | 485 | cpp | C++ | 454-4sum-ii/454-4sum-ii.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | 2 | 2022-01-02T19:15:00.000Z | 2022-01-05T21:12:24.000Z | 454-4sum-ii/454-4sum-ii.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | null | null | null | 454-4sum-ii/454-4sum-ii.cpp | Ananyaas/LeetCodeDaily | e134e20ac02f26dc40881c376656d3294be0df2c | [
"MIT"
] | 1 | 2022-03-11T17:11:07.000Z | 2022-03-11T17:11:07.000Z | class Solution {
public:
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
unordered_map<int,int> map;
int n=nums1.size();
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
map[nums1[i]+nums2[j]]++;
... | 21.086957 | 102 | 0.45567 | Ananyaas |
9b1cc0e6d210ef67489957cfd9288829a31c4cda | 886 | cpp | C++ | Domain.cpp | Thaylo/Finite-Difference-Method-FDM-from-scratch | 97c57a82e289e548701b33e0d15e6282838cfc54 | [
"MIT"
] | null | null | null | Domain.cpp | Thaylo/Finite-Difference-Method-FDM-from-scratch | 97c57a82e289e548701b33e0d15e6282838cfc54 | [
"MIT"
] | null | null | null | Domain.cpp | Thaylo/Finite-Difference-Method-FDM-from-scratch | 97c57a82e289e548701b33e0d15e6282838cfc54 | [
"MIT"
] | null | null | null | #include "Domain.h"
#include <iostream>
using namespace std;
Domain::Domain()
{
this->x_initial = 0;
this->x_end = 0;
this->y_initial = 0;
this->y_end = 0;
}
Domain::Domain(
double x_initial,
double x_end,
double y_initial,
double y_end)
{
this->x_initial = x_initial;
this->x_end = x_... | 15.275862 | 46 | 0.651242 | Thaylo |
9b299765f270b6bd677212b61727f220c3bf506e | 1,042 | hpp | C++ | src/util.hpp | mikeowens/mod_ruby | c8eb18038e666af0ae7a7609fd328100d29d34b7 | [
"ECL-2.0",
"Apache-2.0"
] | 3 | 2015-02-15T09:30:42.000Z | 2015-08-18T01:41:31.000Z | src/util.hpp | mikeowens/mod_ruby | c8eb18038e666af0ae7a7609fd328100d29d34b7 | [
"ECL-2.0",
"Apache-2.0"
] | 5 | 2016-01-15T13:40:36.000Z | 2019-03-02T05:23:01.000Z | src/util.hpp | mikeowens/mod_ruby | c8eb18038e666af0ae7a7609fd328100d29d34b7 | [
"ECL-2.0",
"Apache-2.0"
] | 3 | 2016-07-31T03:42:14.000Z | 2019-02-15T19:57:21.000Z | #ifndef MODRUBY_UTIL_DECL
#define MODRUBY_UTIL_DECL
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
namespace modruby
{
/// Converts a string to lowercase
std::string to_lower(std::string x);
/// Converts a string to lowercase
std::string to_upper(std::string x);
/// URL encodes a string
... | 22.170213 | 86 | 0.68618 | mikeowens |
9b2a6d555808a6d87e8900e79c7006dfdec68474 | 605 | cpp | C++ | Kattis/mosquito/13642049_AC_0ms_0kB.cpp | BakaErii/ACM_Collection | d368b15c7f1c84472424d5e61e5ebc667f589025 | [
"WTFPL"
] | null | null | null | Kattis/mosquito/13642049_AC_0ms_0kB.cpp | BakaErii/ACM_Collection | d368b15c7f1c84472424d5e61e5ebc667f589025 | [
"WTFPL"
] | null | null | null | Kattis/mosquito/13642049_AC_0ms_0kB.cpp | BakaErii/ACM_Collection | d368b15c7f1c84472424d5e61e5ebc667f589025 | [
"WTFPL"
] | null | null | null | #include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
int i;
int M, P, ... | 16.805556 | 69 | 0.558678 | BakaErii |
9b2dbe28347f5afacd750a8d26309a5b3d10d953 | 159 | hpp | C++ | include/desalt/static_control.hpp | dechimal/desalt | 29f2bbe9e41850ddd4ebff39958747e504e3a6a3 | [
"WTFPL"
] | 10 | 2015-03-05T08:28:29.000Z | 2020-10-21T09:52:52.000Z | include/desalt/static_control.hpp | dechimal/desalt | 29f2bbe9e41850ddd4ebff39958747e504e3a6a3 | [
"WTFPL"
] | null | null | null | include/desalt/static_control.hpp | dechimal/desalt | 29f2bbe9e41850ddd4ebff39958747e504e3a6a3 | [
"WTFPL"
] | null | null | null | #if !defined DESALT_STATIC_CONTROL_HPP_INCLUDED_
#define DESALT_STATIC_CONTROL_HPP_INCLUDED_
#include <desalt/static_control/static_control.hpp>
#endif
| 22.714286 | 51 | 0.842767 | dechimal |
9b2e2ade2b1dd52ebc3995463a1d1c4f25a09044 | 1,787 | cpp | C++ | gameplay/src/Joint.cpp | j4m3z0r/GamePlay | 02ca734e5734d2fbc9d00a7eff65ed2656f26975 | [
"Apache-2.0",
"Unlicense"
] | 1 | 2021-09-02T01:45:24.000Z | 2021-09-02T01:45:24.000Z | gameplay/src/Joint.cpp | j4m3z0r/GamePlay | 02ca734e5734d2fbc9d00a7eff65ed2656f26975 | [
"Apache-2.0",
"Unlicense"
] | null | null | null | gameplay/src/Joint.cpp | j4m3z0r/GamePlay | 02ca734e5734d2fbc9d00a7eff65ed2656f26975 | [
"Apache-2.0",
"Unlicense"
] | null | null | null | #include "Base.h"
#include "Joint.h"
#include "MeshSkin.h"
namespace gameplay
{
Joint::Joint(const char* id)
: Node(id), _jointMatrixDirty(true), _skinCount(0)
{
}
Joint::~Joint()
{
}
Joint* Joint::create(const char* id)
{
return new Joint(id);
}
Node* Joint::cloneSingleNode(NodeCloneC... | 23.207792 | 79 | 0.630106 | j4m3z0r |
9b3107a2054f08f1176088124fa92c86036abbc4 | 572 | cpp | C++ | Algorithm/Problem49/main.cpp | zsef123/ModernCppChallengeStudy | 058c0a6c5e41758f53336e554f29b497c9881fae | [
"MIT"
] | null | null | null | Algorithm/Problem49/main.cpp | zsef123/ModernCppChallengeStudy | 058c0a6c5e41758f53336e554f29b497c9881fae | [
"MIT"
] | null | null | null | Algorithm/Problem49/main.cpp | zsef123/ModernCppChallengeStudy | 058c0a6c5e41758f53336e554f29b497c9881fae | [
"MIT"
] | null | null | null | #include <gsl/gsl>
#include <vector>
#include <unordered_map>
#include <iostream>
#include <string>
auto text_histogram(std::string txt) {
std::unordered_map<char, int> map;
for (auto s : txt) {
if (std::isalpha(s))
map[s]++;
}
int total = 0;
for (auto m : map)
total... | 20.428571 | 58 | 0.543706 | zsef123 |
9b3156e28bd7d1af9ab662ac781309174bd22343 | 884 | cpp | C++ | src/examples/10_module/04_arrays_pointers/arrays_pointers.cpp | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-artgonzalezacc-1 | d181e35624c01b704fd373416ce943c26f7e5f0d | [
"MIT"
] | 1 | 2021-03-09T04:19:07.000Z | 2021-03-09T04:19:07.000Z | src/examples/10_module/04_arrays_pointers/arrays_pointers.cpp | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-artgonzalezacc-1 | d181e35624c01b704fd373416ce943c26f7e5f0d | [
"MIT"
] | null | null | null | src/examples/10_module/04_arrays_pointers/arrays_pointers.cpp | acc-cosc-1337-spring-2021/acc-cosc-1337-spring-2021-artgonzalezacc-1 | d181e35624c01b704fd373416ce943c26f7e5f0d | [
"MIT"
] | null | null | null | //cpp
#include "arrays_pointers.h"
using std::cout;
void arrays_and_pointers()
{
const int SIZE = 3;
int nums[SIZE]{3, 6, 1};
cout<<nums<<"\n";
int* ptr = nums;
cout<<*ptr<<"\n";
*ptr++;
cout<<*ptr<<"\n";
*ptr++;
cout<<*ptr<<"\n";
*ptr--;
cout<<*ptr<<"\n";
}
void populat... | 17 | 58 | 0.454751 | acc-cosc-1337-spring-2021 |
9b357bc542f91c232d560ba9d30d87ab0d79a661 | 7,475 | cpp | C++ | src/patternMatch/PatternMatch.cpp | sroehling/ChartPatternRecognitionLib | d9bd25c0fc5a8942bb98c74c42ab52db80f680c1 | [
"MIT"
] | 9 | 2019-07-15T19:10:07.000Z | 2021-12-14T12:16:18.000Z | src/patternMatch/PatternMatch.cpp | sroehling/ChartPatternRecognitionLib | d9bd25c0fc5a8942bb98c74c42ab52db80f680c1 | [
"MIT"
] | null | null | null | src/patternMatch/PatternMatch.cpp | sroehling/ChartPatternRecognitionLib | d9bd25c0fc5a8942bb98c74c42ab52db80f680c1 | [
"MIT"
] | 2 | 2020-05-23T03:25:25.000Z | 2021-11-19T16:41:44.000Z | /*
* PatternMatch.cpp
*
* Created on: Jun 10, 2014
* Author: sroehling
*/
#include "PatternMatch.h"
#include "MathHelper.h"
void PatternMatch::initMatchSegment()
{
PeriodValCltn::iterator matchSegBegin = segments().front()->perValSegment()->segBegin();
PeriodValCltn::iterator matchSegEnd = segments().ba... | 25.511945 | 122 | 0.737525 | sroehling |
9b358e42193e6f0b218ec280f53968b15c6546d4 | 3,885 | hpp | C++ | cpp-sources/lib/dsiterpp/time-iter.hpp | DAlexis/dsiterpp | 01c447fd5b3243cc365b789f013c703d020ee1e3 | [
"MIT"
] | null | null | null | cpp-sources/lib/dsiterpp/time-iter.hpp | DAlexis/dsiterpp | 01c447fd5b3243cc365b789f013c703d020ee1e3 | [
"MIT"
] | null | null | null | cpp-sources/lib/dsiterpp/time-iter.hpp | DAlexis/dsiterpp | 01c447fd5b3243cc365b789f013c703d020ee1e3 | [
"MIT"
] | null | null | null | #ifndef TIME_ITER_HPP
#define TIME_ITER_HPP
#include "utils.hpp"
#include <vector>
#include <functional>
#include <limits>
#include <cstddef>
#include <cmath>
namespace dsiterpp {
class IErrorEstimator;
class IVariable;
class IRHS;
class IIntegrator;
class IBifurcator;
struct StepAdjustmentParameters
{
bool is... | 22.456647 | 83 | 0.714543 | DAlexis |
9b3f14488623cc27b4c30720a93d9137f7e4f7ac | 1,627 | cpp | C++ | src/UbComposition.cpp | cadet/UberCode | 19d70134774dfae607b18b5185ad93e5b2cf7cfe | [
"Apache-2.0"
] | 1 | 2016-10-31T13:05:30.000Z | 2016-10-31T13:05:30.000Z | src/UbComposition.cpp | cadet/UberCode | 19d70134774dfae607b18b5185ad93e5b2cf7cfe | [
"Apache-2.0"
] | null | null | null | src/UbComposition.cpp | cadet/UberCode | 19d70134774dfae607b18b5185ad93e5b2cf7cfe | [
"Apache-2.0"
] | null | null | null | /*
CADET - Center for Advances in Digital Entertainment Technologies
Copyright 2011 Fachhochschule Salzburg GmbH
http://www.cadet.at
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://... | 27.116667 | 100 | 0.732637 | cadet |
9b40a9f9da7f3685a076296ed0750c0b6d6ccd1f | 2,873 | hpp | C++ | ros2/src/cinematography/include/actor_detection.hpp | nightduck/AirSim | 2ba7124ceff7607f23463f483cd3e2cbe026d0ca | [
"MIT"
] | null | null | null | ros2/src/cinematography/include/actor_detection.hpp | nightduck/AirSim | 2ba7124ceff7607f23463f483cd3e2cbe026d0ca | [
"MIT"
] | 14 | 2021-02-25T22:32:34.000Z | 2021-08-20T17:17:12.000Z | ros2/src/cinematography/include/actor_detection.hpp | nightduck/AirSim | 2ba7124ceff7607f23463f483cd3e2cbe026d0ca | [
"MIT"
] | null | null | null | #include "rclcpp/rclcpp.hpp"
#include "cinematography_msgs/msg/gimbal_angle_quat_cmd.hpp"
#include "geometry_msgs/msg/quaternion.hpp"
#include <tf2_ros/buffer.h>
#include <tf2_ros/transform_listener.h>
#include <tf2_geometry_msgs/tf2_geometry_msgs.h>
#include <tf2/LinearMath/Quaternion.h>
#include <tf2/LinearMath/Vecto... | 31.922222 | 188 | 0.748695 | nightduck |
9b468d7f560f6bb0bd327ebde33ee0bbb4353608 | 507 | cpp | C++ | search_algorithms/binary_search_iterative.cpp | sky-lynx/Algorithms | 95592a73dcd1dc04be7df3ce3157e63230fac27b | [
"MIT"
] | null | null | null | search_algorithms/binary_search_iterative.cpp | sky-lynx/Algorithms | 95592a73dcd1dc04be7df3ce3157e63230fac27b | [
"MIT"
] | null | null | null | search_algorithms/binary_search_iterative.cpp | sky-lynx/Algorithms | 95592a73dcd1dc04be7df3ce3157e63230fac27b | [
"MIT"
] | null | null | null | // return position index, else return -1
# include <iostream>
using namespace std;
int searcher(int* arr, int key, int l, int r)
{
int m;
while(l != r)
{
m = (l + r) / 2;
if(arr[m] == key)
return m;
else if(arr[m] > key)
r = m-1;
else
l = m+1;
}
return -1;
}
int main(void... | 14.911765 | 52 | 0.532544 | sky-lynx |
9b46f5bed65cecf3853bcb79e93dc41aafc13274 | 549 | cpp | C++ | src/Nazara/Shader/Ast/AstStatementVisitorExcept.cpp | jayrulez/NazaraEngine | e0310cd141f3cc11dbe8abfd5bfedf6b61de1a99 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | src/Nazara/Shader/Ast/AstStatementVisitorExcept.cpp | jayrulez/NazaraEngine | e0310cd141f3cc11dbe8abfd5bfedf6b61de1a99 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | src/Nazara/Shader/Ast/AstStatementVisitorExcept.cpp | jayrulez/NazaraEngine | e0310cd141f3cc11dbe8abfd5bfedf6b61de1a99 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | // Copyright (C) 2022 Jérôme "Lynix" Leclercq (lynix680@gmail.com)
// This file is part of the "Nazara Engine - Shader module"
// For conditions of distribution and use, see copyright notice in Config.hpp
#include <Nazara/Shader/Ast/AstStatementVisitorExcept.hpp>
#include <Nazara/Shader/Debug.hpp>
namespace Nz::Shade... | 34.3125 | 107 | 0.752277 | jayrulez |
9b4fff8cd6f7cb7ec77e744b15d964d80278e56f | 104,971 | cpp | C++ | source/Genesis/Engine/Logo/streak.cpp | paradoxnj/Genesis3D | 272fc6aa2580de4ee223274ea04a101199c535a1 | [
"Condor-1.1",
"Unlicense"
] | 3 | 2020-04-29T03:17:50.000Z | 2021-05-26T19:53:46.000Z | source/Genesis/Engine/Logo/streak.cpp | paradoxnj/Genesis3D | 272fc6aa2580de4ee223274ea04a101199c535a1 | [
"Condor-1.1",
"Unlicense"
] | 1 | 2020-04-29T03:12:47.000Z | 2020-04-29T03:12:47.000Z | source/Genesis/Engine/Logo/streak.cpp | paradoxnj/Genesis3D | 272fc6aa2580de4ee223274ea04a101199c535a1 | [
"Condor-1.1",
"Unlicense"
] | null | null | null | /****************************************************************************************/
/* STREAK.C */
/* */
/* Author: ... | 116.634444 | 120 | 0.645921 | paradoxnj |
9b5338cd6648932abb498565c48fb840368aa2a6 | 510 | cpp | C++ | CsUserInterface/Source/CsUI/Public/Utility/CsUIPopulateEnumMapFromSettings.cpp | closedsum/core | c3cae44a177b9684585043a275130f9c7b67fef0 | [
"Unlicense"
] | 2 | 2019-03-17T10:43:53.000Z | 2021-04-20T21:24:19.000Z | CsUserInterface/Source/CsUI/Public/Utility/CsUIPopulateEnumMapFromSettings.cpp | closedsum/core | c3cae44a177b9684585043a275130f9c7b67fef0 | [
"Unlicense"
] | null | null | null | CsUserInterface/Source/CsUI/Public/Utility/CsUIPopulateEnumMapFromSettings.cpp | closedsum/core | c3cae44a177b9684585043a275130f9c7b67fef0 | [
"Unlicense"
] | null | null | null | // Copyright 2017-2021 Closed Sum Games, LLC. All Rights Reserved.
#include "Utility/CsUIPopulateEnumMapFromSettings.h"
// Data
#include "Data/CsUIGetDataRootSet.h"
// Utility
#include "Utility/CsPopulateEnumMapFromSettings.h"
const FCsUIDataRootSet* FCsUIPopulateEnumMapFromSettings::GetDataRootSet(const FString& Con... | 42.5 | 158 | 0.835294 | closedsum |
9b53af415899b1c20357324a2f14f283079dbe06 | 4,037 | cpp | C++ | src/Button.cpp | rorywebdev/A-Pathfinding | c96cdce7eb4c38bdd0828e2db59fdbc401c86624 | [
"MIT"
] | 2 | 2019-08-10T13:57:05.000Z | 2021-06-18T09:16:02.000Z | src/Button.cpp | rorywebdev/A-Pathfinding | c96cdce7eb4c38bdd0828e2db59fdbc401c86624 | [
"MIT"
] | null | null | null | src/Button.cpp | rorywebdev/A-Pathfinding | c96cdce7eb4c38bdd0828e2db59fdbc401c86624 | [
"MIT"
] | null | null | null | #include "Button.h"
// Rory Clark
// https://rorywebdev.com
// 2016
// Button Class used for UI elements
// Allows custom colouring, text and has built in transitions
// Validation for actual clicks can differ from holding down to a simple return when actually activated
Button::Button(SDL_Renderer* _render, std::str... | 25.550633 | 169 | 0.67352 | rorywebdev |
9b5766dafc5d5d6de6776834e338cfb8ef5cd145 | 255 | hpp | C++ | tau/TauEngine/include/shader/EShader.hpp | hyfloac/TauEngine | 1559b2a6e6d1887b8ee02932fe0aa6e5b9d5652c | [
"MIT"
] | 1 | 2020-04-22T04:07:01.000Z | 2020-04-22T04:07:01.000Z | tau/TauEngine/include/shader/EShader.hpp | hyfloac/TauEngine | 1559b2a6e6d1887b8ee02932fe0aa6e5b9d5652c | [
"MIT"
] | null | null | null | tau/TauEngine/include/shader/EShader.hpp | hyfloac/TauEngine | 1559b2a6e6d1887b8ee02932fe0aa6e5b9d5652c | [
"MIT"
] | null | null | null | #pragma once
namespace EShader {
enum class Stage
{
Vertex = 1,
TessellationControl,
Hull = TessellationControl,
TessellationEvaluation,
Domain = TessellationEvaluation,
Geometry,
Pixel,
Fragment = Pixel,
Compute
};
}
| 15 | 36 | 0.67451 | hyfloac |
9b5999934b7b0701ebfdff35973373e35c20b9cc | 8,347 | hpp | C++ | libraries/chain/include/graphene/chain/das33_object.hpp | powerchain-ltd/greenpower-blockchain | ff04c37f2de11677c3a34889fdede1256a3e5e02 | [
"MIT"
] | 1 | 2021-07-26T02:42:01.000Z | 2021-07-26T02:42:01.000Z | libraries/chain/include/graphene/chain/das33_object.hpp | green-powerchain-ltd/greenpower-blockchain | ff04c37f2de11677c3a34889fdede1256a3e5e02 | [
"MIT"
] | null | null | null | libraries/chain/include/graphene/chain/das33_object.hpp | green-powerchain-ltd/greenpower-blockchain | ff04c37f2de11677c3a34889fdede1256a3e5e02 | [
"MIT"
] | null | null | null | /*
* MIT License
*
* Copyright (c) 2018 Tech Solutions Malta 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 us... | 37.599099 | 135 | 0.574338 | powerchain-ltd |
9b5f698d8b27939f9a9224133498f7d7e5eb8e40 | 466 | cpp | C++ | C++/length-of-last-word.cpp | xenron/sandbox-dev-lintcode | 114145723af43eafc84ff602ad3ac7b353a9fc38 | [
"MIT"
] | 695 | 2015-04-18T16:11:56.000Z | 2022-03-11T13:28:44.000Z | C++/length-of-last-word.cpp | Abd-Elrazek/LintCode | 8f6ee0ff38cb7cf8bf9fca800243823931604155 | [
"MIT"
] | 4 | 2015-07-04T13:07:35.000Z | 2020-08-11T11:32:29.000Z | C++/length-of-last-word.cpp | Abd-Elrazek/LintCode | 8f6ee0ff38cb7cf8bf9fca800243823931604155 | [
"MIT"
] | 338 | 2015-04-28T04:39:03.000Z | 2022-03-16T03:00:15.000Z | // Time: O(n)
// Space: O(1)
class Solution {
public:
/**
* @param s A string
* @return the length of last word
*/
int lengthOfLastWord(string& s) {
int counter = 0;
for (int i = s.length() - 1; i >= 0; --i) {
if(s[i] == ' ') {
if (counter > 0) {
... | 19.416667 | 51 | 0.360515 | xenron |
9b61ff6d6b50e9b0b3de18b2fb2077bbc4b846d1 | 1,146 | cpp | C++ | TrainingWithBook/GRAPH/Tree/Summ of subtree.cpp | andzh1/Competitive-programming | babb9494e03fe0feb2130e50887996d0ffc92c4e | [
"MIT"
] | null | null | null | TrainingWithBook/GRAPH/Tree/Summ of subtree.cpp | andzh1/Competitive-programming | babb9494e03fe0feb2130e50887996d0ffc92c4e | [
"MIT"
] | null | null | null | TrainingWithBook/GRAPH/Tree/Summ of subtree.cpp | andzh1/Competitive-programming | babb9494e03fe0feb2130e50887996d0ffc92c4e | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int getSummOfSubtree(int root, int parentOfRoot, vector <int> tree[], int values[]) //We have to count summ of values in all vertices of subtree with root "root". In vertex i values[i] is located
{
int summ = values[root];
for(auto nextVertex: tree[root]){
... | 39.517241 | 201 | 0.637871 | andzh1 |
9b631eb64ef9fd5eb5137ffaaa6937e3dbbc3c65 | 18,077 | cpp | C++ | exo/src/ui.cpp | btheobald/compa2 | aa9d5b966fb4c6a4e836e481d9df1bd297de3140 | [
"MIT"
] | 2 | 2016-02-11T20:01:26.000Z | 2016-11-30T16:16:02.000Z | exo/src/ui.cpp | btheobald/compa2 | aa9d5b966fb4c6a4e836e481d9df1bd297de3140 | [
"MIT"
] | null | null | null | exo/src/ui.cpp | btheobald/compa2 | aa9d5b966fb4c6a4e836e481d9df1bd297de3140 | [
"MIT"
] | null | null | null | // Interface include
#include "ui.hpp"
// External library includes
#include <AntTweakBar.h> // AntTweakBar
#include <GL/glu.h> // GLU
// Standard library includes
#include <iostream>
// Render access pointer
render* g_RenderAP;
// GUI pointers
TwBar* simGUI;
TwBar* bodyGUI;
TwBar* ssGUI;
TwBar* errorGUI;
std... | 35.584646 | 179 | 0.667035 | btheobald |
9b63c14fd26a257969d6a82736ff8f15bc9b9003 | 5,055 | cpp | C++ | WRK-V1.2/csharp/scc/compilerhost.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | WRK-V1.2/csharp/scc/compilerhost.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | WRK-V1.2/csharp/scc/compilerhost.cpp | intj-t/openvmsft | 0d17fbce8607ab2b880be976c2e86d8cfc3e83bb | [
"Intel"
] | null | null | null | // ==++==
//
//
// Copyright (c) 2006 Microsoft Corporation. All rights reserved.
//
// The use and distribution terms for this software are contained in the file
// named license.txt, which can be found in the root of this distribution.
// By using this software in any fashion, you are agreeing to b... | 29.561404 | 134 | 0.6273 | intj-t |
9b68f72a5d5597edde1a55d13a7a3ca28c76abd6 | 1,010 | hpp | C++ | src/OffensiveFlag.hpp | frederic-tingaud-sonarsource/xania | 0cf7bcbd72a0fc4acb3a9d33ba8f325833aeacc9 | [
"BSD-2-Clause"
] | null | null | null | src/OffensiveFlag.hpp | frederic-tingaud-sonarsource/xania | 0cf7bcbd72a0fc4acb3a9d33ba8f325833aeacc9 | [
"BSD-2-Clause"
] | null | null | null | src/OffensiveFlag.hpp | frederic-tingaud-sonarsource/xania | 0cf7bcbd72a0fc4acb3a9d33ba8f325833aeacc9 | [
"BSD-2-Clause"
] | null | null | null | /*************************************************************************/
/* Xania (M)ulti(U)ser(D)ungeon server source code */
/* (C) 2021 Xania Development Team */
/* See merc.h and README for original copyrights */
/***************... | 24.634146 | 75 | 0.461386 | frederic-tingaud-sonarsource |
9b6d86e4342bc1feb22ab1d15613faa0e01bc9a6 | 6,566 | cpp | C++ | parser/MpqManager.cpp | coolzoom/namigator | 722a9f9e71ac5091acfad6ad53d203e1f1ffcf49 | [
"MIT"
] | null | null | null | parser/MpqManager.cpp | coolzoom/namigator | 722a9f9e71ac5091acfad6ad53d203e1f1ffcf49 | [
"MIT"
] | null | null | null | parser/MpqManager.cpp | coolzoom/namigator | 722a9f9e71ac5091acfad6ad53d203e1f1ffcf49 | [
"MIT"
] | null | null | null | #include "MpqManager.hpp"
#include "DBC.hpp"
#include "StormLib.h"
#include "utility/Exception.hpp"
#include <algorithm>
#include <cctype>
#include <cstdint>
#include <filesystem>
#include <iostream>
#include <sstream>
#include <unordered_map>
#include <vector>
namespace fs = std::filesystem;
namespace
{
std::uint3... | 27.472803 | 80 | 0.582242 | coolzoom |
9b6df99c459912b1203b184b6b92ae7b7f695eba | 67 | hxx | C++ | Src/Common/C3_BUILD_VERSION_HASH_PART.hxx | grzryc/C3 | 17d071469a023e512867a1776be3177f7da30edb | [
"BSD-3-Clause"
] | 1 | 2019-09-06T01:43:27.000Z | 2019-09-06T01:43:27.000Z | Src/Common/C3_BUILD_VERSION_HASH_PART.hxx | hl0rey/C3 | 6326f8144490c06f09352ea2854bdd7728e451c0 | [
"BSD-3-Clause"
] | null | null | null | Src/Common/C3_BUILD_VERSION_HASH_PART.hxx | hl0rey/C3 | 6326f8144490c06f09352ea2854bdd7728e451c0 | [
"BSD-3-Clause"
] | 1 | 2020-07-09T01:06:23.000Z | 2020-07-09T01:06:23.000Z | #include "StdAfx.h"
#define C3_BUILD_VERSION "C3-1.0.manual-build"
| 22.333333 | 46 | 0.761194 | grzryc |
9b7632ef4822f0a68ddf45a654335209b543e113 | 4,050 | cpp | C++ | Sources/MouCaGraphicEngine/source/SceneSynchronizer.cpp | Rominitch/MouCaLab | d8c24de479b1bc11509df8456e0071d394fbeab9 | [
"Unlicense"
] | null | null | null | Sources/MouCaGraphicEngine/source/SceneSynchronizer.cpp | Rominitch/MouCaLab | d8c24de479b1bc11509df8456e0071d394fbeab9 | [
"Unlicense"
] | null | null | null | Sources/MouCaGraphicEngine/source/SceneSynchronizer.cpp | Rominitch/MouCaLab | d8c24de479b1bc11509df8456e0071d394fbeab9 | [
"Unlicense"
] | null | null | null | #include "Dependencies.h"
/*
#include <LibRT/include/RTGeometry.h>
#include <LibRT/include/RTLight.h>
#include <LibRT/include/RTMassiveInstance.h>
#include <LibRT/include/RTScene.h>
#include <LibVulkan/include/VKDeviceContext.h>
#include <LibVulkan/include/VKLightBuffer.h>
#include <LibVulkan/include/VKRenderer.h>
/... | 27.931034 | 119 | 0.684444 | Rominitch |
f928e00e9b8eb706e0ebcefa326f0cb180a92f08 | 579 | cpp | C++ | sample/EmscriptenSimpleDemo/main.cpp | tsumehashi/ucnoid | 881e3f7c95aee1c41ca644cd922c564a8585e5d4 | [
"MIT"
] | 6 | 2020-04-20T13:57:24.000Z | 2020-07-23T06:01:12.000Z | sample/EmscriptenSimpleDemo/main.cpp | tsumehashi/ucnoid | 881e3f7c95aee1c41ca644cd922c564a8585e5d4 | [
"MIT"
] | null | null | null | sample/EmscriptenSimpleDemo/main.cpp | tsumehashi/ucnoid | 881e3f7c95aee1c41ca644cd922c564a8585e5d4 | [
"MIT"
] | null | null | null | #include <iostream>
#include <ucnoid/BodyLoader>
#include <ucnoid/Body>
#include <ucnoid/Link>
int main(int argc, char* argv[])
{
std::cout << "EmscriptenSimpleDemo" << std::endl;
std::string modelfile = "SR1-2D.wrl";
cnoid::BodyLoader loader;
cnoid::Body* body = loader.load(modelfile);
body->calc... | 25.173913 | 66 | 0.576857 | tsumehashi |
f93097f5c25d6708a385cb073c5e38b447d7f07f | 405 | cpp | C++ | test/type_traits/remove_reference_test.cpp | chrisxjzhu/ctd | 6d5f011241a8078f18ccebd5f20eeb23f3da653d | [
"MIT"
] | null | null | null | test/type_traits/remove_reference_test.cpp | chrisxjzhu/ctd | 6d5f011241a8078f18ccebd5f20eeb23f3da653d | [
"MIT"
] | null | null | null | test/type_traits/remove_reference_test.cpp | chrisxjzhu/ctd | 6d5f011241a8078f18ccebd5f20eeb23f3da653d | [
"MIT"
] | null | null | null | #define CATCH_CONFIG_MAIN
#include "catch.hpp"
#include <ctd/type_traits/remove_reference.hpp>
#include <ctd/type_traits/is_same.hpp>
TEST_CASE("remove_reference", "[remove_reference]")
{
REQUIRE((ctd::is_same<int, ctd::remove_reference<int>::type>()));
REQUIRE((ctd::is_same<int, ctd::remove_reference<int&>::... | 31.153846 | 71 | 0.711111 | chrisxjzhu |
f93c0385632712eff337d41980f2b8694d6091b0 | 1,119 | cpp | C++ | a569.cpp | puyuliao/ZJ-d879 | bead48e0a500f21bc78f745992f137706d15abf8 | [
"MIT"
] | null | null | null | a569.cpp | puyuliao/ZJ-d879 | bead48e0a500f21bc78f745992f137706d15abf8 | [
"MIT"
] | null | null | null | a569.cpp | puyuliao/ZJ-d879 | bead48e0a500f21bc78f745992f137706d15abf8 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdint.h>
#define MAXN 10000001
char in[100000];
int a[10001];
int atop = 0;
int prime[2000000];
int ptop;
unsigned int bs[MAXN>>5]={0xc0000000};
int cnt;
inline bool test(int n){
int p = n&31;
p = 1 << (31-p);
return (bs[n>>5]&p)!=0;
}
inline void settrue(int n){
... | 17.215385 | 55 | 0.478105 | puyuliao |
f93db54eb1b14e6622929a53e72e7f7a98a77d2a | 657 | cpp | C++ | ETICV1C10/E31.cpp | GydaRagnarsdottir/Thinking-In-Cpp-2.-Edition-Exercises-on-Visual-Studio- | 41a9ba6e90547ee8b531deeb5591fa0bf5bf7c13 | [
"MIT"
] | null | null | null | ETICV1C10/E31.cpp | GydaRagnarsdottir/Thinking-In-Cpp-2.-Edition-Exercises-on-Visual-Studio- | 41a9ba6e90547ee8b531deeb5591fa0bf5bf7c13 | [
"MIT"
] | null | null | null | ETICV1C10/E31.cpp | GydaRagnarsdottir/Thinking-In-Cpp-2.-Edition-Exercises-on-Visual-Studio- | 41a9ba6e90547ee8b531deeb5591fa0bf5bf7c13 | [
"MIT"
] | null | null | null | //Create a class that represents a printer connection, and
//that only allows you to have one printer.
#include <iostream>
#include <string>
using namespace std;
class PrinterConnection {
static PrinterConnection pc;
string ptIPaddress;
PrinterConnection(string ip):ptIPaddress(ip){}
PrinterConnection(con... | 26.28 | 59 | 0.719939 | GydaRagnarsdottir |
f942023286e98daec6a7ecd1c1a0e96ea2c82da7 | 88,974 | cpp | C++ | dwarf/SB/Game/zNPCSpawner.cpp | stravant/bfbbdecomp | 2126be355a6bb8171b850f829c1f2731c8b5de08 | [
"OLDAP-2.7"
] | 1 | 2021-01-05T11:28:55.000Z | 2021-01-05T11:28:55.000Z | dwarf/SB/Game/zNPCSpawner.cpp | sonich2401/bfbbdecomp | 5f58b62505f8929a72ccf2aa118a1539eb3a5bd6 | [
"OLDAP-2.7"
] | null | null | null | dwarf/SB/Game/zNPCSpawner.cpp | sonich2401/bfbbdecomp | 5f58b62505f8929a72ccf2aa118a1539eb3a5bd6 | [
"OLDAP-2.7"
] | 1 | 2022-03-30T15:15:08.000Z | 2022-03-30T15:15:08.000Z | typedef struct xEnvAsset;
typedef struct xEntShadow;
typedef struct xBase;
typedef struct xVec2;
typedef struct RwObjectHasFrame;
typedef struct RpSector;
typedef struct RwTexCoords;
typedef struct RxPipelineNode;
typedef enum en_SM_WAVE_STAT;
typedef struct zNPCSpawner;
typedef struct zNPCCommon;
typedef struct xEnt;
... | 21.034043 | 96 | 0.761627 | stravant |
f9432f1e2c38e27af44990620dcffb22804e721a | 1,301 | cpp | C++ | week08/1210.cpp | taki-d/ProgrammingChallenges | e3c133ac1bda5ebd38a22c3baf6be66ec3bebfab | [
"MIT"
] | null | null | null | week08/1210.cpp | taki-d/ProgrammingChallenges | e3c133ac1bda5ebd38a22c3baf6be66ec3bebfab | [
"MIT"
] | null | null | null | week08/1210.cpp | taki-d/ProgrammingChallenges | e3c133ac1bda5ebd38a22c3baf6be66ec3bebfab | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
vector<int> eratosthenes(int N){
vector<bool> is_prime_number(N+1);
for (int i = 0; i <= N; ++i) {
is_prime_number[i] = true;
}
vector<int> prime_num;
prime_num.push_back(1);
for (int i = 2; i <= N; ++i) {
if(is_prime_number[i]){
... | 21.683333 | 73 | 0.456572 | taki-d |
f946d778bc308cf7fae3bb4c313420fa1df6e9a3 | 23,573 | cpp | C++ | camera/QCamera2/util/QCameraPerfTranslator.cpp | derp-sdm660-common/device_asus_sdm660-common | f3106f346f4362859ab24d73428131ff916741e0 | [
"Apache-2.0"
] | 2 | 2021-06-12T11:18:28.000Z | 2021-06-22T20:53:12.000Z | camera/QCamera2/util/QCameraPerfTranslator.cpp | derp-sdm660-common/device_asus_sdm660-common | f3106f346f4362859ab24d73428131ff916741e0 | [
"Apache-2.0"
] | null | null | null | camera/QCamera2/util/QCameraPerfTranslator.cpp | derp-sdm660-common/device_asus_sdm660-common | f3106f346f4362859ab24d73428131ff916741e0 | [
"Apache-2.0"
] | 5 | 2020-09-29T14:15:31.000Z | 2021-11-06T23:21:39.000Z | /* Copyright (c) 2019, The Linux Foundation. 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.299486 | 158 | 0.587028 | derp-sdm660-common |
f9483fd3a99d4859d40e487e0df540143bb4ea84 | 9,442 | cpp | C++ | tests/utests/proposal/proposal_vote_evaluator_tests.cpp | scorum/scorum | 1da00651f2fa14bcf8292da34e1cbee06250ae78 | [
"MIT"
] | 53 | 2017-10-28T22:10:35.000Z | 2022-02-18T02:20:48.000Z | tests/utests/proposal/proposal_vote_evaluator_tests.cpp | Scorum/Scorum | fb4aa0b0960119b97828865d7a5b4d0409af7876 | [
"MIT"
] | 38 | 2017-11-25T09:06:51.000Z | 2018-10-31T09:17:22.000Z | tests/utests/proposal/proposal_vote_evaluator_tests.cpp | Scorum/Scorum | fb4aa0b0960119b97828865d7a5b4d0409af7876 | [
"MIT"
] | 27 | 2018-01-08T19:43:35.000Z | 2022-01-14T10:50:42.000Z | #include <boost/test/unit_test.hpp>
#include <scorum/chain/data_service_factory.hpp>
#include <scorum/chain/services/account.hpp>
#include <scorum/chain/services/proposal.hpp>
#include <scorum/chain/services/proposal_executor.hpp>
#include <scorum/chain/services/registration_committee.hpp>
#include <scorum/chain/serv... | 40.698276 | 119 | 0.752595 | scorum |
f94b5fa2ad64f4693bbed68192009e03cd9b17ee | 2,439 | cpp | C++ | SUU-Runtime/source/Runtime-Platform/Linux/Main.cpp | SUU-Lab/SUU-Studio | 164c2805f9feeeb7f77c7a34e083c0cb9d4fab30 | [
"MIT"
] | null | null | null | SUU-Runtime/source/Runtime-Platform/Linux/Main.cpp | SUU-Lab/SUU-Studio | 164c2805f9feeeb7f77c7a34e083c0cb9d4fab30 | [
"MIT"
] | null | null | null | SUU-Runtime/source/Runtime-Platform/Linux/Main.cpp | SUU-Lab/SUU-Studio | 164c2805f9feeeb7f77c7a34e083c0cb9d4fab30 | [
"MIT"
] | null | null | null | #include <SUU-Runtime/SUU-Runtime.hpp>
#include <SUU-Runtime/Remote/Hello.hpp>
#include <SUU-Runtime/Remote/RuntimeCapture.hpp>
#include <X11/Xlib.h>
#include <X11/Xutil.h>
#include <iostream>
#include <thread>
int main(int, const char*[])
{
std::cout << suu::PlatformName() << std::endl;
remote::SayHello("SUU... | 25.673684 | 95 | 0.533005 | SUU-Lab |
f9589a8fc0060707d5b576ce986b14ae72e81611 | 2,461 | cpp | C++ | DebugView++Lib/FileReader.cpp | MarkGoldberg/DebugViewPP | 7fbd244dcbf25db969f8118c9a9b2931b814f99b | [
"BSL-1.0"
] | null | null | null | DebugView++Lib/FileReader.cpp | MarkGoldberg/DebugViewPP | 7fbd244dcbf25db969f8118c9a9b2931b814f99b | [
"BSL-1.0"
] | null | null | null | DebugView++Lib/FileReader.cpp | MarkGoldberg/DebugViewPP | 7fbd244dcbf25db969f8118c9a9b2931b814f99b | [
"BSL-1.0"
] | null | null | null | // (C) Copyright Gert-Jan de Vos and Jan Wilmans 2013.
// 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)
// Repository at: https://github.com/djeedjay/DebugViewPP/
#include "stdafx.h"
#include <boost/filesystem.... | 20.680672 | 141 | 0.703779 | MarkGoldberg |
f9632be1b3efb9b873a724c7462ca21831807c5b | 12,839 | cpp | C++ | TabGraph/src/Parser/OBJ.cpp | Gpinchon/TabGraph | 29eae2d9982b6ce3e4ff43c707c87c2f57ab39bb | [
"Apache-2.0"
] | 1 | 2020-08-28T09:35:18.000Z | 2020-08-28T09:35:18.000Z | TabGraph/src/Parser/OBJ.cpp | Gpinchon/TabGraph | 29eae2d9982b6ce3e4ff43c707c87c2f57ab39bb | [
"Apache-2.0"
] | null | null | null | TabGraph/src/Parser/OBJ.cpp | Gpinchon/TabGraph | 29eae2d9982b6ce3e4ff43c707c87c2f57ab39bb | [
"Apache-2.0"
] | 1 | 2020-10-08T11:21:13.000Z | 2020-10-08T11:21:13.000Z | /*
* @Author: gpinchon
* @Date: 2020-08-17 14:43:37
* @Last Modified by: gpinchon
* @Last Modified time: 2021-06-10 22:09:47
*/
/*
* @Author: gpinchon
* @Date: 2019-02-22 16:13:28
* @Last Modified by: gpinchon
* @Last Modified time: 2020-06-09 17:11:29
*/
#include <Assets/Asset.hpp>
#include <Ass... | 32.836317 | 158 | 0.565776 | Gpinchon |
f96a784c1e7da28a4d22be0f05121e1a85de1fca | 1,250 | cc | C++ | 0145_Binary_Tree_Postorder_Traversal/0145.cc | LuciusKyle/LeetCode | 66c9090e5244b10eca0be50398764da2b4b48a6c | [
"Apache-2.0"
] | null | null | null | 0145_Binary_Tree_Postorder_Traversal/0145.cc | LuciusKyle/LeetCode | 66c9090e5244b10eca0be50398764da2b4b48a6c | [
"Apache-2.0"
] | null | null | null | 0145_Binary_Tree_Postorder_Traversal/0145.cc | LuciusKyle/LeetCode | 66c9090e5244b10eca0be50398764da2b4b48a6c | [
"Apache-2.0"
] | null | null | null |
#include <vector>
using std::vector;
// Definition for a binary tree node.
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};
class Solution {
public:
vector<int> preorderTraversal(TreeNode *root) {
vector<int> rtn;
preorderTr... | 24.509804 | 61 | 0.6672 | LuciusKyle |
f970d220573d5e19e9b4d060ac31499135f26243 | 16,290 | cpp | C++ | lab_control_center/src/commonroad_classes/DynamicObstacle.cpp | Durrrr95/cpm_lab | e2e6f4ace4ebc01e8ddd87e2f4acf13e6ffdcc67 | [
"MIT"
] | 9 | 2020-06-24T11:22:15.000Z | 2022-01-13T14:14:13.000Z | lab_control_center/src/commonroad_classes/DynamicObstacle.cpp | Durrrr95/cpm_lab | e2e6f4ace4ebc01e8ddd87e2f4acf13e6ffdcc67 | [
"MIT"
] | 1 | 2021-05-10T13:48:04.000Z | 2021-05-10T13:48:04.000Z | lab_control_center/src/commonroad_classes/DynamicObstacle.cpp | Durrrr95/cpm_lab | e2e6f4ace4ebc01e8ddd87e2f4acf13e6ffdcc67 | [
"MIT"
] | 2 | 2021-11-08T11:59:29.000Z | 2022-03-15T13:50:54.000Z | #include "commonroad_classes/DynamicObstacle.hpp"
/**
* \file DynamicObstacle.cpp
* \ingroup lcc_commonroad
*/
DynamicObstacle::DynamicObstacle(
const xmlpp::Node* node,
std::function<void (int, const DrawingContext&, double, double, double, double)> _draw_lanelet_refs
)
{
//Check if node is of typ... | 36.2 | 190 | 0.628177 | Durrrr95 |
f9786c82805d36d8b95596ea4f5b45477ba1ab87 | 512 | cc | C++ | apf/apfMixedVectorField.cc | Thomas-Ulrich/core | 1c7bc7ff994c3570ab22b96d37be0c4c993e5940 | [
"BSD-3-Clause"
] | 138 | 2015-01-05T15:50:20.000Z | 2022-02-25T01:09:58.000Z | apf/apfMixedVectorField.cc | Thomas-Ulrich/core | 1c7bc7ff994c3570ab22b96d37be0c4c993e5940 | [
"BSD-3-Clause"
] | 337 | 2015-08-07T18:24:58.000Z | 2022-03-31T14:39:03.000Z | apf/apfMixedVectorField.cc | Thomas-Ulrich/core | 1c7bc7ff994c3570ab22b96d37be0c4c993e5940 | [
"BSD-3-Clause"
] | 70 | 2015-01-17T00:58:41.000Z | 2022-02-13T04:58:20.000Z | /*
* Copyright 2011 Scientific Computation Research Center
*
* This work is open source software, licensed under the terms of the
* BSD license as described in the LICENSE file in the top-level directory.
*/
#include "apfMixedVectorField.h"
#include "apfMixedVectorElement.h"
#include "apfVectorElement.h"
namespa... | 20.48 | 75 | 0.761719 | Thomas-Ulrich |
f9798f898db7902a254d7c3782f602ca88cd9e79 | 2,604 | hpp | C++ | include/tci/conversions/get_pointer.hpp | AartOdding/type_conversion_iterator | 67e58edf2da4d30c65fbb0646299721fe86893d1 | [
"MIT"
] | null | null | null | include/tci/conversions/get_pointer.hpp | AartOdding/type_conversion_iterator | 67e58edf2da4d30c65fbb0646299721fe86893d1 | [
"MIT"
] | null | null | null | include/tci/conversions/get_pointer.hpp | AartOdding/type_conversion_iterator | 67e58edf2da4d30c65fbb0646299721fe86893d1 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
namespace tci
{
namespace conversions
{
template<typename T>
struct get_pointer
{
using input_type = T;
using output_type = T*;
static output_type convert(input_type& input)
{
retu... | 23.044248 | 83 | 0.464286 | AartOdding |
f989d3495bf98969624f98f8e5266acd4755b1a3 | 3,183 | cpp | C++ | TDD/src/tdd.cpp | sjk7/iobuffer | 45ab7a4752d4ce5f4b95808f5a54280cbfa4e416 | [
"MIT"
] | null | null | null | TDD/src/tdd.cpp | sjk7/iobuffer | 45ab7a4752d4ce5f4b95808f5a54280cbfa4e416 | [
"MIT"
] | null | null | null | TDD/src/tdd.cpp | sjk7/iobuffer | 45ab7a4752d4ce5f4b95808f5a54280cbfa4e416 | [
"MIT"
] | null | null | null |
#define DEBUG_BUF_PERF_ 111
#include "../../include/iobuffer/my_iobuffer.hpp"
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
typedef my::detail::counted_buffer<char> counted_buf_t;
typedef my::detail::span<char> span_t;
typedef my::detail::span<const char> const_span_t;
template<class... | 24.484615 | 60 | 0.640276 | sjk7 |
f9919d0c2363855d458aaf179fd633f56ac1ebdc | 3,226 | cpp | C++ | src/fileio.cpp | Kvalme/libfileio | 545ce54157b729dbffeab22f1435c51b3382dc27 | [
"Zlib"
] | 1 | 2016-06-23T12:29:48.000Z | 2016-06-23T12:29:48.000Z | src/fileio.cpp | Kvalme/libfileio | 545ce54157b729dbffeab22f1435c51b3382dc27 | [
"Zlib"
] | null | null | null | src/fileio.cpp | Kvalme/libfileio | 545ce54157b729dbffeab22f1435c51b3382dc27 | [
"Zlib"
] | null | null | null | /*************************************************************************
* libfileio - filesystem abstraction interface
*
* Copyright (c) 2010 Denis Biryukov <denis.birukov@gmail.com>
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable fo... | 33.604167 | 122 | 0.66398 | Kvalme |
f9939b02738ab113e0329664b6647360f0f0035e | 1,721 | cpp | C++ | 5_Concurrency/1_Introduction/3_SingleThread/1_singlethreaded.cpp | ptiwari0664/UdacityCplusplusNanoDegree | e937990ed310e01783d335688bfde9c377a71051 | [
"MIT"
] | 1 | 2020-05-07T18:13:27.000Z | 2020-05-07T18:13:27.000Z | 5_Concurrency/1_Introduction/3_SingleThread/1_singlethreaded.cpp | ptiwari0664/UdacityCplusplusNanoDegree | e937990ed310e01783d335688bfde9c377a71051 | [
"MIT"
] | null | null | null | 5_Concurrency/1_Introduction/3_SingleThread/1_singlethreaded.cpp | ptiwari0664/UdacityCplusplusNanoDegree | e937990ed310e01783d335688bfde9c377a71051 | [
"MIT"
] | null | null | null | #include <iostream>
#include <thread>
void threadFunction()
{
std::this_thread::sleep_for(std::chrono::milliseconds(50)); // simulate work
std::cout << "Finished work 1 in thread\n";
std::this_thread::sleep_for(std::chrono::milliseconds(50));
std::cout << "Finished work 2 in thread\n";
}
int main(... | 33.745098 | 84 | 0.497385 | ptiwari0664 |
f9969a2575d84c2efcf3063b8d1386db9d33a8be | 602 | cpp | C++ | DEM/Low/src/Physics/StaticMeshShape.cpp | niello/deusexmachina | 2f698054fe82d8b40a0a0e58b86d64ffed0de06c | [
"MIT"
] | 15 | 2019-05-07T11:26:13.000Z | 2022-01-12T18:26:45.000Z | DEM/Low/src/Physics/StaticMeshShape.cpp | niello/deusexmachina | 2f698054fe82d8b40a0a0e58b86d64ffed0de06c | [
"MIT"
] | 16 | 2021-10-04T17:15:31.000Z | 2022-03-20T09:34:29.000Z | DEM/Low/src/Physics/StaticMeshShape.cpp | niello/deusexmachina | 2f698054fe82d8b40a0a0e58b86d64ffed0de06c | [
"MIT"
] | 2 | 2019-04-28T23:27:48.000Z | 2019-05-07T11:26:18.000Z | #include "StaticMeshShape.h"
namespace Physics
{
/*
bool CStaticMeshShape::Setup(btBvhTriangleMeshShape* pShape)
{
if (!pShape)
{
State = Resources::Rsrc_Failed;
FAIL;
}
pBtShape = pShape;
State = Resources::Rsrc_Loaded;
OK;
}
//---------------------------------------------------------------------
void CS... | 17.2 | 76 | 0.523256 | niello |
f9a0bcebe732428b1077eb5791eac5df205d0200 | 1,316 | hpp | C++ | Cpp/include/fost/coerce/nullable.hpp | KayEss/fost-base | 05ac1b6a1fb672c61ba6502efea86f9c5207e28f | [
"BSL-1.0"
] | 2 | 2016-05-25T22:17:38.000Z | 2019-04-02T08:34:17.000Z | Cpp/include/fost/coerce/nullable.hpp | KayEss/fost-base | 05ac1b6a1fb672c61ba6502efea86f9c5207e28f | [
"BSL-1.0"
] | 5 | 2018-07-13T10:43:05.000Z | 2019-09-02T14:54:42.000Z | Cpp/include/fost/coerce/nullable.hpp | KayEss/fost-base | 05ac1b6a1fb672c61ba6502efea86f9c5207e28f | [
"BSL-1.0"
] | 1 | 2020-10-22T20:44:24.000Z | 2020-10-22T20:44:24.000Z | /**
Copyright 2008-2020 Red Anchor Trading Co. Ltd.
Distributed under the Boost Software License, Version 1.0.
See <http://www.boost.org/LICENSE_1_0.txt>
*/
#ifndef FOST_COERCE_NULLABLE_HPP
#define FOST_COERCE_NULLABLE_HPP
#pragma once
#include <fost/nullable.hpp>
#include <fost/coerce.hpp>
#include <... | 23.087719 | 63 | 0.56383 | KayEss |
e2ff1e2612f3831d68adb20777d206eca987d616 | 790 | cpp | C++ | o09e3min/min.cpp | czers/oi-tasks | b862cd33bd2230c7cea135333056954388ba9502 | [
"Unlicense"
] | null | null | null | o09e3min/min.cpp | czers/oi-tasks | b862cd33bd2230c7cea135333056954388ba9502 | [
"Unlicense"
] | null | null | null | o09e3min/min.cpp | czers/oi-tasks | b862cd33bd2230c7cea135333056954388ba9502 | [
"Unlicense"
] | null | null | null | #include <cstdio>
int main()
{
int n;
scanf("%d\n", &n);
n--;
bool minus[n];
for (int i = 0; i < n; i++)
{
char c;
scanf("%c\n", &c);
if (c == '-')
minus[i] = true;
else
minus[i] = false;
}
bool isOpen = false;
for (int i = 0; ... | 19.268293 | 54 | 0.353165 | czers |
390ed764083e9dcb3bc471be272022e2ee9882af | 6,019 | cpp | C++ | XOffice/src/XOffice/src/XOfficeFrmSerializeSvr.cpp | qianxj/XExplorer | 00e326da03ffcaa21115a2345275452607c6bab5 | [
"MIT"
] | null | null | null | XOffice/src/XOffice/src/XOfficeFrmSerializeSvr.cpp | qianxj/XExplorer | 00e326da03ffcaa21115a2345275452607c6bab5 | [
"MIT"
] | null | null | null | XOffice/src/XOffice/src/XOfficeFrmSerializeSvr.cpp | qianxj/XExplorer | 00e326da03ffcaa21115a2345275452607c6bab5 | [
"MIT"
] | null | null | null | #include "StdAfx.h"
#include "..\include\XOfficeFrmSerializeSvr.hpp"
#include "XOfficeFrmDataSvr.hpp"
#include "xframe.h"
namespace Hxsoft{ namespace XFrame{ namespace XOffice
{
XOfficeFrmSerializeSvr::XOfficeFrmSerializeSvr(void)
{
}
XOfficeFrmSerializeSvr::~XOfficeFrmSerializeSvr(void)
{
}
int XOfficeFrmSer... | 30.095 | 125 | 0.700449 | qianxj |
3919ba10775b3949d3c7a6e8c611f0b40c24b324 | 1,657 | cpp | C++ | Solutions.cpp/2564/r6_trucks.cpp | TianTcl/KU01-challenge | 5a0069840e26d9a8cf8fa592679341154fcb3a15 | [
"MIT"
] | 2 | 2021-10-30T06:27:48.000Z | 2021-10-30T08:14:50.000Z | Solutions.cpp/2564/r6_trucks.cpp | TianTcl/KU01-challenge | 5a0069840e26d9a8cf8fa592679341154fcb3a15 | [
"MIT"
] | null | null | null | Solutions.cpp/2564/r6_trucks.cpp | TianTcl/KU01-challenge | 5a0069840e26d9a8cf8fa592679341154fcb3a15 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define show(x) cerr << #x << " : " << x << '\n'
#define loop(z) for(int i=0;i!=z;i++)
#define all(y) y.begin(),y.end()
#define in(v) cin >> v;
#define out(v) cout << v << '\n';
#define st first
#define nd second
using namespace std;
typedef long long ll;
typedef double db;
typedef f... | 20.974684 | 62 | 0.512372 | TianTcl |
391c575929b48b5c27f3a005c1b061608eb146cc | 3,288 | cpp | C++ | Benchmarks/vadd/vadd_3_double_buffer/src/vadd.cpp | LemonAndRabbit/rodinia-hls | 097e8cf572a9ab04403c4eb0cfdb042f233f4aea | [
"BSD-2-Clause"
] | null | null | null | Benchmarks/vadd/vadd_3_double_buffer/src/vadd.cpp | LemonAndRabbit/rodinia-hls | 097e8cf572a9ab04403c4eb0cfdb042f233f4aea | [
"BSD-2-Clause"
] | null | null | null | Benchmarks/vadd/vadd_3_double_buffer/src/vadd.cpp | LemonAndRabbit/rodinia-hls | 097e8cf572a9ab04403c4eb0cfdb042f233f4aea | [
"BSD-2-Clause"
] | null | null | null | /**
* A naive implemention of vector add algorithm on FPGA
* by Ye Zhifan 2021.2.8
*/
#include "vadd.h"
#define TILE_SIZE 256
extern "C"{
void load(int flag, float buffer_A[TILE_SIZE], float buffer_B[TILE_SIZE], int offset, float vector_A[VECTOR_LENGTH],
float vector_B[VECTOR_LENGTH]){
... | 37.793103 | 120 | 0.604927 | LemonAndRabbit |
392171eeff3bf6cb8347bf9a4a4945e7d86dfec4 | 3,670 | cpp | C++ | modules/engine/src/Render/Vertex.cpp | litty-studios/randar | 95daae57b1ec7d87194cdbcf6e3946b4ed9fc79b | [
"MIT"
] | 1 | 2016-11-12T02:43:29.000Z | 2016-11-12T02:43:29.000Z | modules/engine/src/Render/Vertex.cpp | litty-studios/randar | 95daae57b1ec7d87194cdbcf6e3946b4ed9fc79b | [
"MIT"
] | null | null | null | modules/engine/src/Render/Vertex.cpp | litty-studios/randar | 95daae57b1ec7d87194cdbcf6e3946b4ed9fc79b | [
"MIT"
] | null | null | null | #include <randar/Render/Vertex.hpp>
// Constructors.
randar::Vertex::Vertex(const randar::Vector3& p, const Color& c)
: position(p),
color(c)
{
}
randar::Vertex::Vertex(float x, float y, float z)
: randar::Vertex::Vertex(randar::Vector3(x, y, z))
{
}
randar::Vertex::Vertex(
float x,
float y,
float z,... | 22.654321 | 88 | 0.645232 | litty-studios |
39246c66cf5f39c2e3c351c99ea193b4cec9d05b | 1,337 | hpp | C++ | simpleQtDrag/drag.hpp | zlum/simple | b5eaf45ad814ec6a2236828ce2ae78b16193bfc1 | [
"MIT"
] | null | null | null | simpleQtDrag/drag.hpp | zlum/simple | b5eaf45ad814ec6a2236828ce2ae78b16193bfc1 | [
"MIT"
] | null | null | null | simpleQtDrag/drag.hpp | zlum/simple | b5eaf45ad814ec6a2236828ce2ae78b16193bfc1 | [
"MIT"
] | null | null | null | #ifndef DRAG_HPP
#define DRAG_HPP
#include <iostream>
#include <string>
#include <QDebug>
#include <QFile>
#include <QString>
#include <QTextStream>
#include <QLabel>
#include <QMimeData>
#include <QDrag>
#include <QMouseEvent>
#include <QApplication>
class Drag: public QLabel
{
Q_OBJECT
public:
Drag(QWidge... | 19.376812 | 78 | 0.561705 | zlum |
3925981d05bc383ea1ab12dad04705f78d7d94f1 | 289 | hpp | C++ | include/VBE/config.hpp | Towerthousand/VBE | ae36d4b5d063f11061e7f8eef0145bc3e9d3f2f7 | [
"MIT"
] | 8 | 2015-01-02T19:21:02.000Z | 2021-12-22T15:02:24.000Z | include/VBE/config.hpp | Towerthousand/VBE | ae36d4b5d063f11061e7f8eef0145bc3e9d3f2f7 | [
"MIT"
] | null | null | null | include/VBE/config.hpp | Towerthousand/VBE | ae36d4b5d063f11061e7f8eef0145bc3e9d3f2f7 | [
"MIT"
] | 1 | 2020-12-29T15:20:35.000Z | 2020-12-29T15:20:35.000Z |
#if defined(ANDROID)
#define VBE_GLES2
#define VBE_SYSTEM_ANDROID
#else
#define VBE_SYSTEM_SDL2
#endif
#if defined(WINDOWS)
#define VBE_SYSTEM_WINDOWS
#else
#define VBE_SYSTEM_UNIX
#endif
#if !defined(NDEBUG) && !defined(QT_NO_DEBUG)
#define VBE_DEBUG
//FIXME
#define VBE_DETAIL
#endif
| 14.45 | 45 | 0.792388 | Towerthousand |
39295143b0f3b42bed037b22d76121f607a02d22 | 1,888 | hpp | C++ | src/pumipic_kktypes.hpp | xyuan/pumi-pic | 7bd355ecdf19cbb809bed87d1003f23fbbca7122 | [
"BSD-3-Clause"
] | 1 | 2020-09-23T11:04:28.000Z | 2020-09-23T11:04:28.000Z | src/pumipic_kktypes.hpp | xyuan/pumi-pic | 7bd355ecdf19cbb809bed87d1003f23fbbca7122 | [
"BSD-3-Clause"
] | null | null | null | src/pumipic_kktypes.hpp | xyuan/pumi-pic | 7bd355ecdf19cbb809bed87d1003f23fbbca7122 | [
"BSD-3-Clause"
] | null | null | null | #ifndef PUMIPIC_KKTYPES_H
#define PUMIPIC_KKTYPES_H
#include <Kokkos_Core.hpp>
#include <SellCSigma.h>
#include <psTypes.h>
#include <chrono>
#include <thread>
namespace pumipic {
using particle_structs::fp_t;
using particle_structs::lid_t;
using particle_structs::Vector3d;
typedef Kokkos::DefaultExecutionSpace exe... | 26.971429 | 71 | 0.677436 | xyuan |
392aad78e37be09feea070e9027568680e569c45 | 1,766 | cpp | C++ | ewk/unittest/utc_blink_ewk_policy_decision_response_headers_get_func.cpp | Jabawack/chromium-efl | 6d3a3accc8afba0aa0eff6461eb5c83138172e6e | [
"BSD-3-Clause"
] | 9 | 2015-04-09T20:22:08.000Z | 2021-03-17T08:34:56.000Z | ewk/unittest/utc_blink_ewk_policy_decision_response_headers_get_func.cpp | Jabawack/chromium-efl | 6d3a3accc8afba0aa0eff6461eb5c83138172e6e | [
"BSD-3-Clause"
] | 2 | 2015-02-04T13:41:12.000Z | 2015-05-25T14:00:40.000Z | ewk/unittest/utc_blink_ewk_policy_decision_response_headers_get_func.cpp | isabella232/chromium-efl | db2d09aba6498fb09bbea1f8440d071c4b0fde78 | [
"BSD-3-Clause"
] | 14 | 2015-02-12T16:20:47.000Z | 2022-01-20T10:36:26.000Z | // Copyright 2014 Samsung Electronics. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "utc_blink_ewk_base.h"
class utc_blink_ewk_policy_decision_response_headers_get : public utc_blink_ewk_base
{
protected:
void PostSetUp()
{
... | 32.703704 | 141 | 0.774632 | Jabawack |
3931b7f7da383237f1ca8d2f95b88b8372848c6d | 38,572 | cpp | C++ | src/test/cpp/Balau/Application/InjectorTest.cpp | borasoftware/balau | 8bb82e9cbf7aa8193880eda1de5cbca4db1e1c14 | [
"Apache-2.0"
] | 6 | 2018-12-30T15:09:26.000Z | 2020-04-20T09:27:59.000Z | src/test/cpp/Balau/Application/InjectorTest.cpp | borasoftware/balau | 8bb82e9cbf7aa8193880eda1de5cbca4db1e1c14 | [
"Apache-2.0"
] | null | null | null | src/test/cpp/Balau/Application/InjectorTest.cpp | borasoftware/balau | 8bb82e9cbf7aa8193880eda1de5cbca4db1e1c14 | [
"Apache-2.0"
] | 2 | 2019-11-12T08:07:16.000Z | 2019-11-29T11:19:47.000Z | // @formatter:off
//
// Balau core C++ library
//
// Copyright (C) 2008 Bora Software (contact@borasoftware.com)
//
// 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.apach... | 27.201693 | 115 | 0.686068 | borasoftware |
39367678a38dad94edb66d1b833569c1b06024a0 | 817 | hpp | C++ | ket/include/ket/control_io.hpp | naoki-yoshioka/bracket | 6eff40e6ee5768744974e9d79bf6ff892bd67390 | [
"MIT"
] | 2 | 2021-02-26T21:50:37.000Z | 2022-01-26T07:35:14.000Z | ket/include/ket/control_io.hpp | naoki-yoshioka/braket | d4fbf1b19691e71dbc6fa62d8a66c7c61b6c4d68 | [
"MIT"
] | 50 | 2018-06-05T12:23:57.000Z | 2022-03-05T15:04:30.000Z | ket/include/ket/control_io.hpp | naoki-yoshioka/bracket | 6eff40e6ee5768744974e9d79bf6ff892bd67390 | [
"MIT"
] | null | null | null | #ifndef KET_CONTROL_IO_HPP
# define KET_CONTROL_IO_HPP
# include <istream>
# include <ostream>
# include <ket/control.hpp>
namespace ket
{
template <
typename Character, typename CharacterTraits, typename Qubit>
inline std::basic_ostream<Character, CharacterTraits>& operator<<(
std::basic_ostream<Charac... | 28.172414 | 68 | 0.749082 | naoki-yoshioka |
393bac48f8d81b456de76c949e93e776307c4275 | 622 | cpp | C++ | android-28/android/graphics/RegionIterator.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 12 | 2020-03-26T02:38:56.000Z | 2022-03-14T08:17:26.000Z | android-28/android/graphics/RegionIterator.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 1 | 2021-01-27T06:07:45.000Z | 2021-11-13T19:19:43.000Z | android-30/android/graphics/RegionIterator.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 3 | 2021-02-02T12:34:55.000Z | 2022-03-08T07:45:57.000Z | #include "./Rect.hpp"
#include "./Region.hpp"
#include "./RegionIterator.hpp"
namespace android::graphics
{
// Fields
// QJniObject forward
RegionIterator::RegionIterator(QJniObject obj) : JObject(obj) {}
// Constructors
RegionIterator::RegionIterator(android::graphics::Region arg0)
: JObject(
"android.g... | 20.064516 | 66 | 0.691318 | YJBeetle |
39402998387d29a9fe9ca608670f2a139bbabb46 | 8,078 | cpp | C++ | src/ui/src/server_setup_dialog.cpp | kicsyromy/spring-player | 799ff87abd565d94a44bb63588d403dd5155a5d4 | [
"MIT"
] | null | null | null | src/ui/src/server_setup_dialog.cpp | kicsyromy/spring-player | 799ff87abd565d94a44bb63588d403dd5155a5d4 | [
"MIT"
] | null | null | null | src/ui/src/server_setup_dialog.cpp | kicsyromy/spring-player | 799ff87abd565d94a44bb63588d403dd5155a5d4 | [
"MIT"
] | null | null | null | #include <glib/gi18n.h>
#include <granite.h>
#include <gtk/gtk.h>
#include <libspring_logger.h>
#include "ui/server_setup_dialog.h"
#include "utility/async_queue.h"
#include "utility/global.h"
#include "utility/gtk_helpers.h"
using namespace spring;
using namespace spring::player;
using namespace spring::player::ui... | 39.793103 | 100 | 0.687546 | kicsyromy |
39424b98eb5f304651c33e930199b06082badc10 | 1,135 | cc | C++ | leetcode/1297.cc | vihowe/Algorithm | 276ae0ce46d565bbb3038935f63467fff95f3260 | [
"MIT"
] | null | null | null | leetcode/1297.cc | vihowe/Algorithm | 276ae0ce46d565bbb3038935f63467fff95f3260 | [
"MIT"
] | null | null | null | leetcode/1297.cc | vihowe/Algorithm | 276ae0ce46d565bbb3038935f63467fff95f3260 | [
"MIT"
] | null | null | null | /*
* @Author: vihowe
* @Date: 2022-03-03 13:05:26
* @LastEditTime: 2022-03-03 13:35:38
* @FilePath: /Algorithm/leetcode/1297.cc
*/
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <iostream>
class Solution {
public:
int maxFreq(std::string &s, int maxLetters, int mi... | 19.568966 | 71 | 0.518062 | vihowe |
394991201de04ff366bd8ad82d6245bd8d2f3109 | 1,536 | cpp | C++ | simple_switch/control_plane/p4_util.cpp | LencigGaer/scion-int-p4 | f099b002cfb315cdd34efb7d91aa0e399517ffee | [
"MIT"
] | null | null | null | simple_switch/control_plane/p4_util.cpp | LencigGaer/scion-int-p4 | f099b002cfb315cdd34efb7d91aa0e399517ffee | [
"MIT"
] | null | null | null | simple_switch/control_plane/p4_util.cpp | LencigGaer/scion-int-p4 | f099b002cfb315cdd34efb7d91aa0e399517ffee | [
"MIT"
] | 1 | 2022-03-04T09:10:49.000Z | 2022-03-04T09:10:49.000Z | /// \file
/// Utility function for loading P4 compiler artifacts.
#include "p4_util.h"
#include <google/protobuf/message.h>
#include <google/protobuf/text_format.h>
#include <google/protobuf/io/zero_copy_stream_impl.h>
#include <fcntl.h>
#include <unistd.h>
#include <cstdlib>
#include <fstream>
#include <functional>... | 27.927273 | 85 | 0.661458 | LencigGaer |
3949d735543dd8082c4ea78b527b35720f99d5cb | 2,132 | cpp | C++ | src/logi/instance/debug_report_callback_impl.cpp | PrimozLavric/VulkanRenderer | 6d95b8ec4b0133ce46b4b4e550d20ef17f77b2c4 | [
"BSD-2-Clause"
] | 6 | 2021-04-06T02:37:55.000Z | 2021-11-24T06:14:04.000Z | src/logi/instance/debug_report_callback_impl.cpp | PrimozLavric/Logi | 6d95b8ec4b0133ce46b4b4e550d20ef17f77b2c4 | [
"BSD-2-Clause"
] | null | null | null | src/logi/instance/debug_report_callback_impl.cpp | PrimozLavric/Logi | 6d95b8ec4b0133ce46b4b4e550d20ef17f77b2c4 | [
"BSD-2-Clause"
] | null | null | null | /**
* Project Logi source code
* Copyright (C) 2019 Primoz Lavric
*
* This program 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, or
* (at your option) any later... | 38.071429 | 118 | 0.716229 | PrimozLavric |
394a9f919e3986542e326238a5c9bcafbefeb59a | 12,376 | hpp | C++ | Explit/Explit/json/json-forwards.hpp | patrykkolodziej/Explit | 155a35e4b8951764e6bedb8847d3196561a4255c | [
"MIT"
] | 18 | 2019-05-09T10:24:53.000Z | 2021-05-17T04:39:47.000Z | Explit/Explit/json/json-forwards.hpp | danielkrupinski/Expl | 74124b67361cd29dd34389d692e43df86f83d072 | [
"MIT"
] | 6 | 2019-05-09T16:26:01.000Z | 2019-05-14T11:30:18.000Z | Explit/Explit/json/json-forwards.hpp | patrykkolodziej/Explit | 155a35e4b8951764e6bedb8847d3196561a4255c | [
"MIT"
] | 8 | 2019-05-08T17:28:24.000Z | 2021-03-25T09:52:44.000Z | #pragma once
/// Json-cpp amalgamated forward header (http://jsoncpp.sourceforge.net/).
/// It is intended to be used with #include "json/json-forwards.h"
/// This header provides forward declaration for all JsonCpp types.
// //////////////////////////////////////////////////////////////////////
// Beginning of ... | 35.665706 | 85 | 0.679945 | patrykkolodziej |
394ad17ad9b87469d03606b2d4cddbf82d371239 | 3,204 | hpp | C++ | includes/server.hpp | K1ngmar/Plebserv | c23596eb3c3b729d19f1f1016eb7403926a5493d | [
"MIT"
] | 5 | 2021-05-17T19:25:26.000Z | 2022-02-16T12:06:42.000Z | includes/server.hpp | K1ngmar/Plebserv | c23596eb3c3b729d19f1f1016eb7403926a5493d | [
"MIT"
] | 1 | 2021-12-24T12:43:36.000Z | 2021-12-24T12:43:36.000Z | includes/server.hpp | K1ngmar/Plebserv | c23596eb3c3b729d19f1f1016eb7403926a5493d | [
"MIT"
] | 6 | 2021-05-17T19:14:53.000Z | 2022-01-26T11:03:27.000Z | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* _ (`-. ('-. .-. .-') .-') ('-. _ .-') (`-. */
/* ( (OO ) _( OO)\ ( OO ) ( OO ). _( OO)( \( -O ) _(OO )_ */
/* _.` \ ,--. (,----... | 34.085106 | 87 | 0.466604 | K1ngmar |
394af326fd4ce520a761a1e9c0026a286a4df0eb | 41 | hpp | C++ | src/boost_mpl_aux__joint_iter.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 10 | 2018-03-17T00:58:42.000Z | 2021-07-06T02:48:49.000Z | src/boost_mpl_aux__joint_iter.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 2 | 2021-03-26T15:17:35.000Z | 2021-05-20T23:55:08.000Z | src/boost_mpl_aux__joint_iter.hpp | miathedev/BoostForArduino | 919621dcd0c157094bed4df752b583ba6ea6409e | [
"BSL-1.0"
] | 4 | 2019-05-28T21:06:37.000Z | 2021-07-06T03:06:52.000Z | #include <boost/mpl/aux_/joint_iter.hpp>
| 20.5 | 40 | 0.780488 | miathedev |
39511f565a9e063c952bdf0eae2495d0e3bfe3d0 | 4,141 | cc | C++ | threadpipe.cc | mlkazar/lwt | 2c081a483efbe048325bd91382423017d43ae1c0 | [
"MIT"
] | null | null | null | threadpipe.cc | mlkazar/lwt | 2c081a483efbe048325bd91382423017d43ae1c0 | [
"MIT"
] | null | null | null | threadpipe.cc | mlkazar/lwt | 2c081a483efbe048325bd91382423017d43ae1c0 | [
"MIT"
] | null | null | null | #include <string.h>
#include <stdio.h>
#include "threadpipe.h"
int32_t
ThreadPipe::write(const char *bufferp, int32_t count)
{
int32_t endPos;
int32_t tcount;
int32_t bytesThisTime;
int32_t bytesCopied;
bytesCopied = 0;
_lock.take();
while(count > 0) {
/* if other side indicated ... | 25.88125 | 91 | 0.530548 | mlkazar |
395336e7e1f53c60d69cb3ecb322871025c422e5 | 1,411 | cpp | C++ | data structures/queue-linkedList.cpp | MohanedAshraf/competitive-programming | 234dc6113b39462c64a2719cd1071f3d99655508 | [
"MIT"
] | 1 | 2021-08-12T14:53:37.000Z | 2021-08-12T14:53:37.000Z | data structures/queue-linkedList.cpp | MohanedAshraf/competitive-programming | 234dc6113b39462c64a2719cd1071f3d99655508 | [
"MIT"
] | null | null | null | data structures/queue-linkedList.cpp | MohanedAshraf/competitive-programming | 234dc6113b39462c64a2719cd1071f3d99655508 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
struct node
{
int data;
node * next;
node( int d ) : data{ d }, next{ nullptr } { }
};
class Queue
{
// head > 0 > 0 > tail > null
private:
node * head ;
node * tail ;
public:
Queue()
{
head = NULL;
tail = NULL;
}
... | 12.944954 | 50 | 0.422395 | MohanedAshraf |
396298102b647e0c17273e81f8f1b9d4c49a5862 | 1,672 | cc | C++ | Linux.C/src/xlog.cc | Akasakar/codeforces.com | ba9689adf185d4d9412cdfaad51a0ecba2c7839e | [
"MIT"
] | null | null | null | Linux.C/src/xlog.cc | Akasakar/codeforces.com | ba9689adf185d4d9412cdfaad51a0ecba2c7839e | [
"MIT"
] | null | null | null | Linux.C/src/xlog.cc | Akasakar/codeforces.com | ba9689adf185d4d9412cdfaad51a0ecba2c7839e | [
"MIT"
] | null | null | null | #include <cstdio>
#include "../inc/xlog.h"
namespace test_log
{
Log LogWarning;
Log LogError;
Log::Log()
{
file_stream = stderr;
status = 0;
_log_debug_("init file stream [%p] by stderr.\n", file_stream);
}
Log::~Log()
{
if(file_stream != stderr || file_st... | 22.90411 | 71 | 0.481459 | Akasakar |
396860a12a10c09a12a0ea31598ad307c025b6f3 | 2,931 | cpp | C++ | gtest/gtest_message_queue.cpp | plenluno/libnode | 9dea4f2390422e70544186df3f5c032cb4a7db08 | [
"BSD-2-Clause",
"MIT"
] | 255 | 2015-01-06T15:11:26.000Z | 2022-03-30T20:52:58.000Z | gtest/gtest_message_queue.cpp | plenluno/libnode | 9dea4f2390422e70544186df3f5c032cb4a7db08 | [
"BSD-2-Clause",
"MIT"
] | 2 | 2018-12-18T22:50:25.000Z | 2019-01-09T16:57:11.000Z | gtest/gtest_message_queue.cpp | plenluno/libnode | 9dea4f2390422e70544186df3f5c032cb4a7db08 | [
"BSD-2-Clause",
"MIT"
] | 36 | 2015-03-28T03:23:57.000Z | 2022-01-16T12:51:30.000Z | // Copyright (c) 2013 Plenluno All rights reserved.
#include <gtest/gtest.h>
#include <libnode/node.h>
#include <libnode/message_queue.h>
#include <libj/status.h>
#include <libj/thread.h>
namespace libj {
namespace node {
class GTestMsgQueueOnMessage : LIBJ_JS_FUNCTION(GTestMsgQueueOnMessage)
public:
GTestMsgQ... | 23.829268 | 75 | 0.637666 | plenluno |
396ee82c659aa84e2bdde15459d799c0cd4fe5f9 | 481 | hpp | C++ | aifm/inc/stack.hpp | asarthas/AIFM | aaf7113cb3ba58381174e8b86bdd7a0f1fd1acc4 | [
"MIT"
] | 49 | 2020-11-01T00:14:40.000Z | 2022-03-26T07:28:12.000Z | aifm/inc/stack.hpp | asarthas/AIFM | aaf7113cb3ba58381174e8b86bdd7a0f1fd1acc4 | [
"MIT"
] | 12 | 2020-12-15T08:30:19.000Z | 2022-03-13T03:54:24.000Z | aifm/inc/stack.hpp | asarthas/AIFM | aaf7113cb3ba58381174e8b86bdd7a0f1fd1acc4 | [
"MIT"
] | 19 | 2020-12-24T22:32:22.000Z | 2022-03-30T01:33:43.000Z | #pragma once
#include "list.hpp"
namespace far_memory {
template <typename T> class Stack {
private:
Stack(const DerefScope &scope);
List<T> list_;
friend class FarMemManager;
public:
bool empty() const;
uint64_t size() const;
const T &ctop(const DerefScope &scope) const;
T &top(const DerefScope &scop... | 19.24 | 52 | 0.715177 | asarthas |
396ff8f658493886d0e4400965600077c57f10a6 | 1,649 | cpp | C++ | Network/Select.cpp | deb0ch/R-Type | 8bb37cd5ec318efb97119afb87d4996f6bb7644e | [
"WTFPL"
] | 5 | 2016-03-15T20:14:10.000Z | 2020-10-30T23:56:24.000Z | Network/Select.cpp | deb0ch/R-Type | 8bb37cd5ec318efb97119afb87d4996f6bb7644e | [
"WTFPL"
] | 3 | 2018-12-19T19:12:44.000Z | 2020-04-02T13:07:00.000Z | Network/Select.cpp | deb0ch/R-Type | 8bb37cd5ec318efb97119afb87d4996f6bb7644e | [
"WTFPL"
] | 2 | 2016-04-11T19:29:28.000Z | 2021-11-26T20:53:22.000Z | #include <errno.h>
#include "SelectException.hh"
#include "Select.hh"
Select::Select(const int to, const int tu)
{
this->_reads = NULL;
this->_writes = NULL;
this->_to = new struct timeval();
this->_to->tv_sec = to;
this->_to->tv_usec = tu;
this->maxFd = 0;
}
Select::Select()
{
this->_reads = NULL;
t... | 17.177083 | 95 | 0.633111 | deb0ch |
39759a8246c80842f6593c2003d8dfd2b927896c | 4,627 | hpp | C++ | CodeRed/Interface/GpuGraphicsCommandList.hpp | LinkClinton/Code-Red | 491621144aba559f068c7f91d71e3d0d7c87761e | [
"MIT"
] | 34 | 2019-09-11T09:12:16.000Z | 2022-02-13T12:50:25.000Z | CodeRed/Interface/GpuGraphicsCommandList.hpp | LinkClinton/Code-Red | 491621144aba559f068c7f91d71e3d0d7c87761e | [
"MIT"
] | 7 | 2019-09-22T14:21:26.000Z | 2020-03-24T10:36:20.000Z | CodeRed/Interface/GpuGraphicsCommandList.hpp | LinkClinton/Code-Red | 491621144aba559f068c7f91d71e3d0d7c87761e | [
"MIT"
] | 6 | 2019-10-21T18:05:55.000Z | 2021-04-22T05:07:30.000Z | #pragma once
#include "../Shared/Information/TextureBufferCopyInfo.hpp"
#include "../Shared/Information/TextureResolveInfo.hpp"
#include "../Shared/Information/TextureCopyInfo.hpp"
#include "../Shared/Enum/ResourceLayout.hpp"
#include "../Shared/Enum/IndexType.hpp"
#include "../Shared/Constant32Bits.hpp"
#include "../... | 28.386503 | 61 | 0.744543 | LinkClinton |
3975c169a8f5790707e0179f9a8503ace321f50e | 3,330 | cpp | C++ | src/rfx/experement.cpp | JKot-Coder/RedRaven | b0f9a679c39e0d87bee60c7f4f202ca1a795eaa9 | [
"BSD-3-Clause"
] | null | null | null | src/rfx/experement.cpp | JKot-Coder/RedRaven | b0f9a679c39e0d87bee60c7f4f202ca1a795eaa9 | [
"BSD-3-Clause"
] | null | null | null | src/rfx/experement.cpp | JKot-Coder/RedRaven | b0f9a679c39e0d87bee60c7f4f202ca1a795eaa9 | [
"BSD-3-Clause"
] | null | null | null | #include "experement.hpp"
#include <slang.h>
#include "core/FileSystem.hpp"
#include "core/IncludeSystem.hpp"
#include "core/SourceLocation.hpp"
#include "compiler/DiagnosticCore.hpp"
#include "compiler/Preprocessor.hpp"
#include "compiler/Token.hpp"
void test2()
{
RR::Rfx::PathInfo pathInfo;
const auto& f... | 33.979592 | 226 | 0.705105 | JKot-Coder |
3977aa337cdf3caf0d3381624141057688e24bb7 | 379 | cpp | C++ | solutions/1226/20110417T145700Z-3543307.cpp | Mistereo/timus-solutions | 062540304c33312b75e0e8713c4b36c80fb220ab | [
"MIT"
] | 11 | 2019-10-29T15:34:53.000Z | 2022-03-14T14:45:09.000Z | solutions/1226/20110416T191347Z-3541472.cpp | Mistereo/timus-solutions | 062540304c33312b75e0e8713c4b36c80fb220ab | [
"MIT"
] | null | null | null | solutions/1226/20110416T191347Z-3541472.cpp | Mistereo/timus-solutions | 062540304c33312b75e0e8713c4b36c80fb220ab | [
"MIT"
] | 6 | 2018-06-30T12:06:55.000Z | 2021-03-20T08:46:33.000Z | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string s;
char c='0';
int asd=scanf("%c",&c);
while(asd!=EOF) {
if((c>='a' && c<= 'z') || (c>='A' && c<= 'Z'))
s+=c;
else {
cout << string(s.rbegin(),s.rend()) << c;
s="";
}
asd = scanf("%c",&c)... | 18.95 | 49 | 0.477573 | Mistereo |
397a1385f1d6277e3aeaac692c68d0717fafe9e3 | 1,199 | cpp | C++ | Codeforces/Rounds/Educational Codeforces Round 115 (Rated for Div. 2)/B.cpp | MaGnsio/CP-Problems | a7f518a20ba470f554b6d54a414b84043bf209c5 | [
"Unlicense"
] | 3 | 2020-11-01T06:31:30.000Z | 2022-02-21T20:37:51.000Z | Codeforces/Rounds/Educational Codeforces Round 115 (Rated for Div. 2)/B.cpp | MaGnsio/CP-Problems | a7f518a20ba470f554b6d54a414b84043bf209c5 | [
"Unlicense"
] | null | null | null | Codeforces/Rounds/Educational Codeforces Round 115 (Rated for Div. 2)/B.cpp | MaGnsio/CP-Problems | a7f518a20ba470f554b6d54a414b84043bf209c5 | [
"Unlicense"
] | 1 | 2021-05-05T18:56:31.000Z | 2021-05-05T18:56:31.000Z | /**
* author: MaGnsi0
* created: 11.10.2021 22:55:52
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(5));
... | 25.510638 | 58 | 0.282736 | MaGnsio |
397d9d72e806cb3c39600bcf0fdcbd2d8a824370 | 15,623 | cpp | C++ | cognitics/src/ModelKit/TunnelFeatureGenerator.cpp | mikedig/cdb-productivity-api | e2bedaa550a8afa780c01f864d72e0aebd87dd5a | [
"MIT"
] | null | null | null | cognitics/src/ModelKit/TunnelFeatureGenerator.cpp | mikedig/cdb-productivity-api | e2bedaa550a8afa780c01f864d72e0aebd87dd5a | [
"MIT"
] | null | null | null | cognitics/src/ModelKit/TunnelFeatureGenerator.cpp | mikedig/cdb-productivity-api | e2bedaa550a8afa780c01f864d72e0aebd87dd5a | [
"MIT"
] | null | null | null | /*************************************************************************
Copyright (c) 2020 Cognitics, Inc.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without... | 36.502336 | 276 | 0.66863 | mikedig |
397dbee9251409f738a8e527c74e2bc135667c05 | 17,925 | cpp | C++ | CormanLispIDE/src/browser.cpp | foss-santanu/cormanlisp | 6ff68633ed730dbd1500f06639dd093513b4278e | [
"OpenSSL",
"MIT"
] | 608 | 2015-01-05T04:12:42.000Z | 2022-02-24T16:41:37.000Z | CormanLispIDE/src/browser.cpp | foss-santanu/cormanlisp | 6ff68633ed730dbd1500f06639dd093513b4278e | [
"OpenSSL",
"MIT"
] | 67 | 2015-01-08T04:47:00.000Z | 2021-08-05T19:56:22.000Z | CormanLispIDE/src/browser.cpp | foss-santanu/cormanlisp | 6ff68633ed730dbd1500f06639dd093513b4278e | [
"OpenSSL",
"MIT"
] | 94 | 2015-01-05T15:11:12.000Z | 2022-02-25T17:03:22.000Z | // -------------------------------
// Copyright (c) Corman Technologies Inc.
// See LICENSE.txt for license information.
// -------------------------------
#include "stdafx.h"
#include <docobj.h>
#include "browser.h"
#include "WebBrowser.h"
#include "afxdisp.h"
#include "../resource.h"
#include "clsid... | 25.246479 | 98 | 0.634421 | foss-santanu |
397f3051f425c84006e494a89bb1940cb066fd23 | 794 | hpp | C++ | lib/inc/facter/facts/zfs/zfs_resolver.hpp | whopper/cfacter | f489f62e19a161e2d909199aebd896e323dac0e8 | [
"Apache-2.0"
] | null | null | null | lib/inc/facter/facts/zfs/zfs_resolver.hpp | whopper/cfacter | f489f62e19a161e2d909199aebd896e323dac0e8 | [
"Apache-2.0"
] | null | null | null | lib/inc/facter/facts/zfs/zfs_resolver.hpp | whopper/cfacter | f489f62e19a161e2d909199aebd896e323dac0e8 | [
"Apache-2.0"
] | null | null | null | /**
* @file
* Declares the Zfs fact resolver.
*/
#pragma once
#include "../resolver.hpp"
#include <string>
#include <map>
namespace facter { namespace facts { namespace zfs {
/**
* Responsible for resolving ZFS facts.
*/
struct zfs_resolver : resolver
{
/**
* Constructs the ... | 20.894737 | 71 | 0.566751 | whopper |
30299a4d535ed972c912b5a54779f57b0b2bb1ec | 271 | cpp | C++ | Ejercicios_II_Unidad/Modulacion/main.cpp | MerlinMenocal/cpp | 7b30a1664bf2abc646be68102f1ad4b8f6bcb0a7 | [
"MIT"
] | null | null | null | Ejercicios_II_Unidad/Modulacion/main.cpp | MerlinMenocal/cpp | 7b30a1664bf2abc646be68102f1ad4b8f6bcb0a7 | [
"MIT"
] | null | null | null | Ejercicios_II_Unidad/Modulacion/main.cpp | MerlinMenocal/cpp | 7b30a1664bf2abc646be68102f1ad4b8f6bcb0a7 | [
"MIT"
] | null | null | null | #include <iostream>
#include"seguridad.h"
#include "menu.h"
using namespace std;
/*int sumar(int a, int b){
return a + b;
} */
int main(int argc, char** argv) {
bool acceso = login();
if (acceso==true)
{
menu();
}
//cout<<sumar(5,7);
return 0;
}
| 11.291667 | 33 | 0.575646 | MerlinMenocal |
303114d517ba04e2753b679a89959fdeb3d99f4a | 584 | cpp | C++ | tests/integration_tests/1_configure_and_exit/main.cpp | mfranceschi/InjectMe | a5d47917207d500cb693cc188f1fba191441640e | [
"MIT"
] | null | null | null | tests/integration_tests/1_configure_and_exit/main.cpp | mfranceschi/InjectMe | a5d47917207d500cb693cc188f1fba191441640e | [
"MIT"
] | 10 | 2021-08-02T22:59:44.000Z | 2021-08-28T22:44:44.000Z | tests/integration_tests/1_configure_and_exit/main.cpp | mfranceschi/InjectMe | a5d47917207d500cb693cc188f1fba191441640e | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include "InjectMe.hpp"
void configureInjector() {
using namespace mf::InjectMe;
auto injectMeConfig = Config::getInstance();
injectMeConfig
->add<std::string>([]() {
std::cout << "Called the string provider function." << std::endl;
return new std::s... | 20.857143 | 73 | 0.601027 | mfranceschi |
303a792638d485b66e3a8ebaf4b206133a9c1c81 | 3,018 | cpp | C++ | Practice/2018/2018.5.15/BZOJ4552.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | 4 | 2017-10-31T14:25:18.000Z | 2018-06-10T16:10:17.000Z | Practice/2018/2018.5.15/BZOJ4552.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | null | null | null | Practice/2018/2018.5.15/BZOJ4552.cpp | SYCstudio/OI | 6e9bfc17dbd4b43467af9b19aa2aed41e28972fa | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define mem(Arr,x) memset(Arr,x,sizeof(Arr))
#define lson (now<<1)
#define rson (lson|1)
const int maxN=101000;
const int inf=2147483647;
class SegmentData
{
public:
int sum[2];
... | 19.22293 | 71 | 0.582836 | SYCstudio |
303c07c3c101aab596ffe35a07825908fa2f4c6e | 4,741 | cpp | C++ | source/util.cpp | zhiayang/peirce-alpha | 49931a234ba173ed7ea4bdcca9949f28d64d7b4f | [
"Apache-2.0"
] | 1 | 2021-05-03T22:51:13.000Z | 2021-05-03T22:51:13.000Z | source/util.cpp | zhiayang/peirce-alpha | 49931a234ba173ed7ea4bdcca9949f28d64d7b4f | [
"Apache-2.0"
] | 1 | 2021-05-03T22:52:59.000Z | 2021-05-10T15:31:26.000Z | source/util.cpp | zhiayang/peirce-alpha | 49931a234ba173ed7ea4bdcca9949f28d64d7b4f | [
"Apache-2.0"
] | null | null | null | // util.cpp
// Copyright (c) 2021, zhiayang
// Licensed under the Apache License Version 2.0.
#include <time.h>
#include <chrono>
#include <string>
#include <random>
#include "defs.h"
#include "utf8proc/utf8proc.h"
namespace lg
{
constexpr bool ENABLE_DEBUG = false;
#if defined(__EMSCRIPTEN__)
constexpr bool USE_... | 25.766304 | 117 | 0.666104 | zhiayang |
303efea0302358bd9944215887ef46aca4cc6e4b | 3,344 | cpp | C++ | server/logger.cpp | ReddyArunreddy/BeastLounge | ae848cb604d1cac785d6345252de5007377f2ee1 | [
"BSL-1.0"
] | 71 | 2018-10-15T06:53:17.000Z | 2022-02-19T17:28:04.000Z | server/logger.cpp | ReddyArunreddy/BeastLounge | ae848cb604d1cac785d6345252de5007377f2ee1 | [
"BSL-1.0"
] | 22 | 2018-11-10T23:46:28.000Z | 2021-05-05T18:12:48.000Z | server/logger.cpp | ReddyArunreddy/BeastLounge | ae848cb604d1cac785d6345252de5007377f2ee1 | [
"BSL-1.0"
] | 26 | 2018-10-16T06:36:56.000Z | 2021-07-21T14:19:01.000Z | //
// Copyright (c) 2018-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// 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)
//
// Official repository: https://github.com/vinniefalco/BeastLounge
//
#include "l... | 21.031447 | 80 | 0.486842 | ReddyArunreddy |
303f579ce76b057208054acbbed166967b17cdff | 371,313 | cpp | C++ | chipyard.TestHarness.LargeBoomAndRocketConfig/chipyard.TestHarness.LargeBoomAndRocketConfig/VTestHarness__166.cpp | vargandhi/ime-congs | 963be79b7b319d8e74edae09df7bdf3330371401 | [
"BSD-3-Clause"
] | null | null | null | chipyard.TestHarness.LargeBoomAndRocketConfig/chipyard.TestHarness.LargeBoomAndRocketConfig/VTestHarness__166.cpp | vargandhi/ime-congs | 963be79b7b319d8e74edae09df7bdf3330371401 | [
"BSD-3-Clause"
] | null | null | null | chipyard.TestHarness.LargeBoomAndRocketConfig/chipyard.TestHarness.LargeBoomAndRocketConfig/VTestHarness__166.cpp | vargandhi/ime-congs | 963be79b7b319d8e74edae09df7bdf3330371401 | [
"BSD-3-Clause"
] | null | null | null | // Verilated -*- C++ -*-
// DESCRIPTION: Verilator output: Design implementation internals
// See VTestHarness.h for the primary calling header
#include "VTestHarness.h"
#include "VTestHarness__Syms.h"
#include "verilated_dpi.h"
VL_INLINE_OPT void VTestHarness::_sequent__TOP__9594(VTestHarness__Syms* __restrict vlSy... | 109.499558 | 292 | 0.767754 | vargandhi |
3045211a324c69938e662564e822449c7ce24248 | 1,497 | cpp | C++ | src/GraphMatrices.cpp | theoden8/graphs | ce4ef913e116c0c5092a41c422385a725a09cd1e | [
"MIT"
] | 1 | 2019-10-16T18:18:03.000Z | 2019-10-16T18:18:03.000Z | src/GraphMatrices.cpp | theoden8/graphs | ce4ef913e116c0c5092a41c422385a725a09cd1e | [
"MIT"
] | null | null | null | src/GraphMatrices.cpp | theoden8/graphs | ce4ef913e116c0c5092a41c422385a725a09cd1e | [
"MIT"
] | null | null | null | #include "Graph.hpp"
#include "Debug.hpp"
Graph::mat_t <bool> Graph::adj_matrix() const {
mat_t <bool> adj(Size(), list_t<bool>(Size(), 0));
for(size_t i = 0; i < Size(); ++i)
for(size_t j = 0; j < Size(); ++j)
adj[i][j] = ((*this)[i] >> (*this)[j]) ? true : false;
return adj;
}
Graph Graph::from_adj_matrix(m... | 27.218182 | 80 | 0.569138 | theoden8 |
3046eccb4ce4465c881d1377b71d1235e83f32e5 | 5,136 | cpp | C++ | Source/ComponentImageUI.cpp | project-3-bcn-2019/Project-Atlas | 16ae881cec41d17a168d10f2f9cd2cf9207b2855 | [
"MIT"
] | 1 | 2019-02-21T13:35:35.000Z | 2019-02-21T13:35:35.000Z | Source/ComponentImageUI.cpp | project-3-bcn-2019/Kuroko-Engine | 16ae881cec41d17a168d10f2f9cd2cf9207b2855 | [
"MIT"
] | 1 | 2019-03-01T15:18:28.000Z | 2019-03-01T15:18:28.000Z | Source/ComponentImageUI.cpp | project-3-bcn-2019/Project-Atlas | 16ae881cec41d17a168d10f2f9cd2cf9207b2855 | [
"MIT"
] | null | null | null | #include "ComponentImageUI.h"
#include "Application.h"
#include "GameObject.h"
#include "glew-2.1.0\include\GL\glew.h"
#include "MathGeoLib/Math/float4x4.h"
#include "MathGeoLib/Math/Quat.h"
#include "ComponentRectTransform.h"
#include "ResourceTexture.h"
#include "Material.h"
#include "ModuleResourcesManager.h"
#incl... | 24.574163 | 216 | 0.709307 | project-3-bcn-2019 |
304aaf60927301a1b531376b0fbb20ea7884372e | 664 | cpp | C++ | zadania-z/Z05.cpp | Xeoth/projekty-liceum | b2547d2b6aa7de89b5a13a8e34b724a56779762f | [
"MIT"
] | null | null | null | zadania-z/Z05.cpp | Xeoth/projekty-liceum | b2547d2b6aa7de89b5a13a8e34b724a56779762f | [
"MIT"
] | null | null | null | zadania-z/Z05.cpp | Xeoth/projekty-liceum | b2547d2b6aa7de89b5a13a8e34b724a56779762f | [
"MIT"
] | null | null | null | #include <iostream>
#include <cmath>
using namespace std;
int main() {
//Pytamy użytkownka o długości przyprostokątnych
float przypr1, przypr2;
cout << "Podaj dlugosc pierwszej przyprostokatnej" << endl;
cin >> przypr1;
cout << "Podaj dlugosc drugiej przyprostokatnej" << endl;
cin >> przypr2;
... | 28.869565 | 79 | 0.646084 | Xeoth |
304ad5a18a660d1cb159b318dc506325d046b72e | 748 | cpp | C++ | src/IActionInterface.cpp | yoshinoToylogic/bulletsharp | 79558f9e78b68f1d218d64234645848661a54e01 | [
"MIT"
] | null | null | null | src/IActionInterface.cpp | yoshinoToylogic/bulletsharp | 79558f9e78b68f1d218d64234645848661a54e01 | [
"MIT"
] | null | null | null | src/IActionInterface.cpp | yoshinoToylogic/bulletsharp | 79558f9e78b68f1d218d64234645848661a54e01 | [
"MIT"
] | null | null | null | #include "StdAfx.h"
#include "IActionInterface.h"
#include "CollisionWorld.h"
#ifndef DISABLE_DEBUGDRAW
#include "DebugDraw.h"
#endif
ActionInterfaceWrapper::ActionInterfaceWrapper(IActionInterface^ actionInterface, CollisionWorld^ collisionWorld)
{
_actionInterface = actionInterface;
_collisionWorld = c... | 25.793103 | 114 | 0.799465 | yoshinoToylogic |
304bdcec89b42ebb7679d7382377e952c7288510 | 334 | cpp | C++ | SimpleDemo/MainWindow.cpp | JennyGH/duilib | a2964281a097a68b03cf4f802abe83643626c6e8 | [
"BSD-2-Clause",
"MIT"
] | null | null | null | SimpleDemo/MainWindow.cpp | JennyGH/duilib | a2964281a097a68b03cf4f802abe83643626c6e8 | [
"BSD-2-Clause",
"MIT"
] | null | null | null | SimpleDemo/MainWindow.cpp | JennyGH/duilib | a2964281a097a68b03cf4f802abe83643626c6e8 | [
"BSD-2-Clause",
"MIT"
] | null | null | null | #include "MainWindow.h"
MainWindow::MainWindow()
{
}
MainWindow::~MainWindow()
{
}
DuiLib::CDuiString MainWindow::GetSkinFolder()
{
return _T("");
}
DuiLib::CDuiString MainWindow::GetSkinFile()
{
return _T("SimpleDemo.xml");
}
LPCTSTR MainWindow::GetWindowClassName(void) const
{
return _T("SimpleDemoMa... | 13.36 | 50 | 0.703593 | JennyGH |
304f0adbc98199b427f92cd2a4841ccbfe889b25 | 2,289 | cpp | C++ | 10722.cpp | felikjunvianto/kfile-uvaoj-submissions | 5bd8b3b413ca8523abe412b0a0545f766f70ce63 | [
"MIT"
] | null | null | null | 10722.cpp | felikjunvianto/kfile-uvaoj-submissions | 5bd8b3b413ca8523abe412b0a0545f766f70ce63 | [
"MIT"
] | null | null | null | 10722.cpp | felikjunvianto/kfile-uvaoj-submissions | 5bd8b3b413ca8523abe412b0a0545f766f70ce63 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define fi first
#define se second
#define pb push_back
#define mp ma... | 21.194444 | 124 | 0.554827 | felikjunvianto |
3053bb336f5269929d45f1e03ec79032f73750f7 | 133 | cpp | C++ | tiny_cnn/src/SoftMax_LayerQL.cpp | 6clc/tiny_cnn | 53b1af3f4ee8765ebc4f5853b87b221c42102786 | [
"MIT"
] | null | null | null | tiny_cnn/src/SoftMax_LayerQL.cpp | 6clc/tiny_cnn | 53b1af3f4ee8765ebc4f5853b87b221c42102786 | [
"MIT"
] | null | null | null | tiny_cnn/src/SoftMax_LayerQL.cpp | 6clc/tiny_cnn | 53b1af3f4ee8765ebc4f5853b87b221c42102786 | [
"MIT"
] | null | null | null | #include "SoftMax_LayerQL.h"
//
//
//SoftMax_LayerQL::SoftMax_LayerQL()
//{
//}
//
//
//SoftMax_LayerQL::~SoftMax_LayerQL()
//{
//}
| 10.230769 | 37 | 0.62406 | 6clc |
3055288f988baeed24182c89bc3320f331e90790 | 2,269 | cpp | C++ | atto/tests/opengl/4-panorama-mesh/camera.cpp | ubikoo/libfish | 7f0b5e06b2bf1d6ff490ddfda9cc7aab69cdbf39 | [
"MIT"
] | null | null | null | atto/tests/opengl/4-panorama-mesh/camera.cpp | ubikoo/libfish | 7f0b5e06b2bf1d6ff490ddfda9cc7aab69cdbf39 | [
"MIT"
] | null | null | null | atto/tests/opengl/4-panorama-mesh/camera.cpp | ubikoo/libfish | 7f0b5e06b2bf1d6ff490ddfda9cc7aab69cdbf39 | [
"MIT"
] | null | null | null | /*
* camera.cpp
*
* Copyright (c) 2020 Carlos Braga
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the MIT License.
*
* See accompanying LICENSE.md or https://opensource.org/licenses/MIT.
*/
#include "atto/opengl/opengl.hpp"
#include "camera.hpp"
using namespa... | 24.138298 | 79 | 0.596739 | ubikoo |
3055686171c4f6fc80650b17e6cc1f85e1744ef5 | 713 | cpp | C++ | SnakePredictor/Screens/BaseScreen.cpp | DanielMcAssey/SnakePredictor | 2e0c24b51df3089e8fa3bb1a354beec5f8ebfcb2 | [
"MIT"
] | null | null | null | SnakePredictor/Screens/BaseScreen.cpp | DanielMcAssey/SnakePredictor | 2e0c24b51df3089e8fa3bb1a354beec5f8ebfcb2 | [
"MIT"
] | null | null | null | SnakePredictor/Screens/BaseScreen.cpp | DanielMcAssey/SnakePredictor | 2e0c24b51df3089e8fa3bb1a354beec5f8ebfcb2 | [
"MIT"
] | null | null | null | /*
// This file is part of SnakePredictor
//
// (c) Daniel McAssey <hello@glokon.me>
//
// For the full copyright and license information, please view the LICENSE
// file that was distributed with this source code.
*/
#include "stdafx.h"
#include "../stdafx.h"
#include "BaseScreen.h"
BaseScreen::BaseScreen(String _n... | 12.963636 | 79 | 0.708275 | DanielMcAssey |
3057feada84c277ae8cd58613bc24917ea46ee00 | 2,605 | cpp | C++ | Engine/HeightfieldBuffer/HeightfieldBufferSetManager.cpp | OGRECave/scape | 9c95ec7b6d8372a7a2a4eb6b96dcb5f2219e2bf2 | [
"BSD-2-Clause"
] | 48 | 2018-06-18T01:38:41.000Z | 2022-03-25T10:29:27.000Z | Engine/HeightfieldBuffer/HeightfieldBufferSetManager.cpp | OGRECave/scape | 9c95ec7b6d8372a7a2a4eb6b96dcb5f2219e2bf2 | [
"BSD-2-Clause"
] | 32 | 2018-07-23T14:17:23.000Z | 2020-11-02T23:28:48.000Z | Engine/HeightfieldBuffer/HeightfieldBufferSetManager.cpp | OGRECave/scape | 9c95ec7b6d8372a7a2a4eb6b96dcb5f2219e2bf2 | [
"BSD-2-Clause"
] | 7 | 2018-07-23T09:34:06.000Z | 2022-02-15T09:54:16.000Z | /**
* Giliam de Carpentier, Copyright (c) 2007.
* Licensed under the Simplified BSD license.
* See Docs/ScapeLicense.txt for details.
*/
#include "ScapeEngineStableHeaders.h"
#include "HeightfieldBuffer.h"
#include "HeightfieldBufferSetManager.h"
using namespace ScapeEngine;
HeightfieldBufferSetManager::Heightfi... | 31.385542 | 107 | 0.678695 | OGRECave |
305974d732fa2786e0f287b0ae5995830e0efcd1 | 19,575 | cpp | C++ | src/qt/hivedialog.cpp | shadow-42/ring | bb59dd53dcc3ff5781fd535e58b3ef46b9c8b0ab | [
"MIT"
] | 8 | 2020-03-15T07:15:51.000Z | 2021-03-17T03:28:38.000Z | src/qt/hivedialog.cpp | shadow-42/ring | bb59dd53dcc3ff5781fd535e58b3ef46b9c8b0ab | [
"MIT"
] | 2 | 2020-04-02T07:29:21.000Z | 2021-02-14T06:15:48.000Z | src/qt/hivedialog.cpp | shadow-42/ring | bb59dd53dcc3ff5781fd535e58b3ef46b9c8b0ab | [
"MIT"
] | 13 | 2020-03-14T21:28:51.000Z | 2021-12-20T23:04:12.000Z | // Copyright (c) 2011-2017 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
// Ring-fork: Hive
#include <wallet/wallet.h>
#include <wallet/fees.h>
#include <qt/hivedialog.h>
#include <qt/forms/ui_hiv... | 40.195072 | 288 | 0.681277 | shadow-42 |
305a3396898028a7f7cc642814235bdf3e6b5ca8 | 1,344 | cpp | C++ | daily_challenge/October_LeetCoding_Challenge_2021/leftMostColumnWithAtleastOne.cpp | archit-1997/LeetCode | 7c0f74da0836d3b0855f09bae8960f81a384f3f3 | [
"MIT"
] | 1 | 2021-01-27T16:37:36.000Z | 2021-01-27T16:37:36.000Z | daily_challenge/October_LeetCoding_Challenge_2021/leftMostColumnWithAtleastOne.cpp | archit-1997/LeetCode | 7c0f74da0836d3b0855f09bae8960f81a384f3f3 | [
"MIT"
] | null | null | null | daily_challenge/October_LeetCoding_Challenge_2021/leftMostColumnWithAtleastOne.cpp | archit-1997/LeetCode | 7c0f74da0836d3b0855f09bae8960f81a384f3f3 | [
"MIT"
] | null | null | null | /**
* @author : archit
* @GitHub : archit-1997
* @Email : architsingh456@gmail.com
* @file : leftMostColumnWithAtleastOne.cpp
* @created : Monday Oct 04, 2021 22:58:00 IST
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define P pair<int,int>
void init(){
freo... | 22.779661 | 59 | 0.485863 | archit-1997 |
305a850f732094add7725c7eec364fe3102586bb | 1,392 | cpp | C++ | algorithms/cpp/Problems 1001-1100/_1020_NumberOfEnclaves.cpp | shivamacs/LeetCode | f8f8b4e9872c47fbaaf9196c422f7e04986e6c3a | [
"MIT"
] | null | null | null | algorithms/cpp/Problems 1001-1100/_1020_NumberOfEnclaves.cpp | shivamacs/LeetCode | f8f8b4e9872c47fbaaf9196c422f7e04986e6c3a | [
"MIT"
] | null | null | null | algorithms/cpp/Problems 1001-1100/_1020_NumberOfEnclaves.cpp | shivamacs/LeetCode | f8f8b4e9872c47fbaaf9196c422f7e04986e6c3a | [
"MIT"
] | null | null | null | /* Source - https://leetcode.com/problems/number-of-enclaves/
Author - Shivam Arora
*/
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
void dfs(vector<vector<int>>& A, int x, int y) {
A[x][y] = 0;
for(int i = 0; i < dirs.size(); i++) ... | 24 | 101 | 0.418822 | shivamacs |
3060319b095e96d398ad4e3a22c1b7e6c46e30b0 | 7,410 | hpp | C++ | example-AndroidGestureIFTTT/src/RingBufferV.hpp | GoldsmithsEAVI/ofxRapidLib | ce9eec2deb71e4903dc3e807755cc6997d8c3fbd | [
"BSD-3-Clause"
] | 24 | 2017-12-06T17:10:10.000Z | 2021-07-27T20:54:46.000Z | src/RingBufferV.hpp | frantic0/BitalinoRapidMix | b59862ceaf33994abd22fedfb6d88b85103c7764 | [
"BSD-2-Clause"
] | 10 | 2017-07-12T11:31:28.000Z | 2021-03-09T10:30:35.000Z | src/RingBufferV.hpp | frantic0/BitalinoRapidMix | b59862ceaf33994abd22fedfb6d88b85103c7764 | [
"BSD-2-Clause"
] | 3 | 2018-01-17T19:03:28.000Z | 2021-05-27T18:48:47.000Z | /*
* RingBufferV.hpp
*/
#ifndef RingBufferV_HPP
#define RingBufferV_HPP
#include <iostream>
#include <atomic>
#include <string>
#include <unistd.h>
#include <string.h> // memcpy
#include <cstring>
#include <vector>
// Vector implementation of RingBuffer for better resizing + allowing later implementation of own no... | 28.282443 | 174 | 0.62726 | GoldsmithsEAVI |
3063e79a90e32e50521f445818dde9c916c523c8 | 14,087 | cpp | C++ | src/Uri.cpp | shaqsnake/uriparser | 76e74e5f2ceae67079e0dca76dd381be6a21978c | [
"MIT"
] | null | null | null | src/Uri.cpp | shaqsnake/uriparser | 76e74e5f2ceae67079e0dca76dd381be6a21978c | [
"MIT"
] | 14 | 2019-07-02T07:56:15.000Z | 2019-07-25T07:34:30.000Z | src/Uri.cpp | shaqsnake/uriparser | 76e74e5f2ceae67079e0dca76dd381be6a21978c | [
"MIT"
] | null | null | null | // Copyright (c) 2019 shaqsnake. All rights reserved.
/**
* @Author: shaqsnake
* @Email: shaqsnake@gmail.com
* @Date: 2019-06-27 09:17:12
* @LastEditTime: 2019-07-25 11:12:15
* @Description: An implementation of class uri::Uri.
*/
#include "UriPattern.hpp"
#include "UriPctCoder.hpp"
#include <iostream>
#include <... | 28.516194 | 80 | 0.586569 | shaqsnake |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.