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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
201ac9633a6f54a440632ffb74ed43076227c124 | 414 | cpp | C++ | core/Source/OpenDetailTemplatePresenter.cpp | paxbun/dear-my-prof | a1e0032f17d9a62a58673b5dbe2de1446006e528 | [
"MIT"
] | 1 | 2020-01-19T14:14:13.000Z | 2020-01-19T14:14:13.000Z | core/Source/OpenDetailTemplatePresenter.cpp | paxbun/dear-my-prof | a1e0032f17d9a62a58673b5dbe2de1446006e528 | [
"MIT"
] | null | null | null | core/Source/OpenDetailTemplatePresenter.cpp | paxbun/dear-my-prof | a1e0032f17d9a62a58673b5dbe2de1446006e528 | [
"MIT"
] | 1 | 2020-11-18T05:24:38.000Z | 2020-11-18T05:24:38.000Z | // Copyright (c) 2019 Dear My Professor Authors
// Author: paxbun
#include <core/App.hpp>
#include <core/Args.hpp>
#include <core/DetailTemplateView.hpp>
#include <core/HasApp.hpp>
#include <core/OpenDetailTemplatePresenter.hpp>
#include <core/View.hpp>
void OpenDetailTemplatePresenter::Input(std::string const& event... | 29.571429 | 88 | 0.753623 | paxbun |
201df418076caa7b9b294a7cf311c108a5521e2b | 903 | cpp | C++ | LeetCode/ThousandTwo/1015-smallest_1s_div_by_K.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandTwo/1015-smallest_1s_div_by_K.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandTwo/1015-smallest_1s_div_by_K.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 1015. 可被 K 整除的最小整数
给定正整数 K，你需要找出可以被 K 整除的、仅包含数字 1 的最小正整数 N。
返回 N 的长度。如果不存在这样的 N，就返回 -1。
示例 1：
输入：1
输出：1
解释：最小的答案是 N = 1，其长度为 1。
示例 2：
输入：2
输出：-1
解释：不存在可被 2 整除的正整数 N 。
示例 3：
输入：3
输出：3
解释：最小的答案是 N = 111，其长度为 3。
提示：
1 <= K <= 10^5
*/
// https://leetcode-cn.com/problems/smallest-intege... | 16.418182 | 125 | 0.631229 | Ginkgo-Biloba |
20205ee95cfddd6b87856e5d5c0c2f86ede82606 | 4,373 | cpp | C++ | DISELAPILIB/DISXMLWriter.cpp | YbJerry/DISELAPI | fd04b294351c50dcf6d0b6129bccc3fd3b41a024 | [
"Apache-2.0"
] | null | null | null | DISELAPILIB/DISXMLWriter.cpp | YbJerry/DISELAPI | fd04b294351c50dcf6d0b6129bccc3fd3b41a024 | [
"Apache-2.0"
] | null | null | null | DISELAPILIB/DISXMLWriter.cpp | YbJerry/DISELAPI | fd04b294351c50dcf6d0b6129bccc3fd3b41a024 | [
"Apache-2.0"
] | null | null | null | // Copyright[2022][Yijie Wang]
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http ://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to i... | 30.368056 | 111 | 0.732678 | YbJerry |
202207aa76f7e13691e3d5a382b628a8be671f3d | 1,659 | cpp | C++ | examples/charstring-numbers.cpp | davidwed/sqlrelay_rudiments | 6ccffdfc5fa29f8c0226f3edc2aa888aa1008347 | [
"BSD-2-Clause-NetBSD"
] | null | null | null | examples/charstring-numbers.cpp | davidwed/sqlrelay_rudiments | 6ccffdfc5fa29f8c0226f3edc2aa888aa1008347 | [
"BSD-2-Clause-NetBSD"
] | null | null | null | examples/charstring-numbers.cpp | davidwed/sqlrelay_rudiments | 6ccffdfc5fa29f8c0226f3edc2aa888aa1008347 | [
"BSD-2-Clause-NetBSD"
] | null | null | null | #include <rudiments/charstring.h>
#include <rudiments/stdio.h>
int main(int argc, const char **argv) {
// conversion of numbers to strings...
char *intstr=charstring::parseNumber((uint64_t)12345);
char *floatstr=charstring::parseNumber((float)12.345,5,3);
stdoutput.printf("numbers as strings: %s, %s\n",intstr,fl... | 25.523077 | 67 | 0.671489 | davidwed |
20226edacd01b24fac89d23d5ccf4810455a55c3 | 757 | cpp | C++ | Cpp/source/xString/source/util_string.cpp | jesson3264/OpenCL | f6144db4b4414afb5a46f598586e5ece28e27d5c | [
"MIT"
] | null | null | null | Cpp/source/xString/source/util_string.cpp | jesson3264/OpenCL | f6144db4b4414afb5a46f598586e5ece28e27d5c | [
"MIT"
] | null | null | null | Cpp/source/xString/source/util_string.cpp | jesson3264/OpenCL | f6144db4b4414afb5a46f598586e5ece28e27d5c | [
"MIT"
] | null | null | null | #include "util_string.h"
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <functional>
#include <algorithm>
#include <cstdlib>
#include <numeric>
#include <stdarg.h>
using namespace std;
namespace ACE {
string& Trim(string &s) {
return RTrim(LTrim(s))... | 19.410256 | 70 | 0.64465 | jesson3264 |
2023a03de7f88fc72f8717a74fba79f65212f78e | 1,348 | cpp | C++ | Leetcode/Hot100/239_Sliding_Window_Maximum.cpp | ZR-Huang/AlgorithmPractices | 226cecde136531341ce23cdf88529345be1912fc | [
"BSD-3-Clause"
] | 1 | 2019-11-26T11:52:25.000Z | 2019-11-26T11:52:25.000Z | Leetcode/Hot100/239_Sliding_Window_Maximum.cpp | ZR-Huang/AlgorithmPractices | 226cecde136531341ce23cdf88529345be1912fc | [
"BSD-3-Clause"
] | null | null | null | Leetcode/Hot100/239_Sliding_Window_Maximum.cpp | ZR-Huang/AlgorithmPractices | 226cecde136531341ce23cdf88529345be1912fc | [
"BSD-3-Clause"
] | null | null | null | #include <deque>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> maxSlidingWindow(vector<int>& nums, int k) {
// 单调队列
deque<int> q;
vector<int> answer;
int l = 0, r = 0;
while(r < k) {
while(!q.empty() && nums[r] > q.back()) q.pop_back... | 28.680851 | 65 | 0.436944 | ZR-Huang |
20268285516d78a927923304d49123263f68e7d0 | 5,485 | cpp | C++ | src/persistence/SaveFile.cpp | mathieunassar/ghostmodule | 8e9a9e958ec3cfa3494b49211920e3f669a9c8bd | [
"Apache-2.0"
] | 2 | 2019-10-05T06:51:49.000Z | 2020-10-11T11:20:59.000Z | src/persistence/SaveFile.cpp | mathieunassar/ghostmodule | 8e9a9e958ec3cfa3494b49211920e3f669a9c8bd | [
"Apache-2.0"
] | 24 | 2019-06-19T21:33:23.000Z | 2020-10-04T11:36:41.000Z | src/persistence/SaveFile.cpp | mathieunassar/ghostmodule | 8e9a9e958ec3cfa3494b49211920e3f669a9c8bd | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2019 Mathieu Nassar
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | 27.70202 | 106 | 0.702097 | mathieunassar |
202c750de8d8375e3ab1b96cd88700edfe3f1728 | 162 | hpp | C++ | VoidEngine/VoidEngine/FileHandling.hpp | bpgabin/voidengine | 93392a12d61a52d1842d1cb5dab2559638abfb07 | [
"MIT"
] | null | null | null | VoidEngine/VoidEngine/FileHandling.hpp | bpgabin/voidengine | 93392a12d61a52d1842d1cb5dab2559638abfb07 | [
"MIT"
] | null | null | null | VoidEngine/VoidEngine/FileHandling.hpp | bpgabin/voidengine | 93392a12d61a52d1842d1cb5dab2559638abfb07 | [
"MIT"
] | null | null | null | #pragma once
#include <string>
#include "Level.hpp"
class FileHandling
{
public:
int hole = 0;
std::vector<Level*> ReadFile( std::string filename);
}; | 12.461538 | 58 | 0.666667 | bpgabin |
45cc6cc6cdf364b3a05661c3de481a9333253ec1 | 14,647 | cpp | C++ | Body-Shape-Estimation/ShapeUnderClothOptimizer.cpp | maria-korosteleva/Body-Shape-Estimation | 2e0f5a46a9f76aa427a9939c7e27bb5e42550f15 | [
"MIT"
] | 46 | 2019-09-19T02:47:01.000Z | 2022-03-29T16:26:12.000Z | Body-Shape-Estimation/ShapeUnderClothOptimizer.cpp | maria-korosteleva/Body-Shape-Estimation | 2e0f5a46a9f76aa427a9939c7e27bb5e42550f15 | [
"MIT"
] | 7 | 2020-01-12T13:09:07.000Z | 2021-11-02T20:01:00.000Z | Body-Shape-Estimation/ShapeUnderClothOptimizer.cpp | maria-korosteleva/Body-Shape-Estimation | 2e0f5a46a9f76aa427a9939c7e27bb5e42550f15 | [
"MIT"
] | 14 | 2019-09-06T02:30:21.000Z | 2021-11-18T14:23:52.000Z | #include "ShapeUnderClothOptimizer.h"
ShapeUnderClothOptimizer::ShapeUnderClothOptimizer(std::shared_ptr<SMPLWrapper> smpl,
std::shared_ptr<GeneralMesh> input)
: config_()
{
// note: could be nullptr
smpl_ = std::move(smpl);
input_ = std::move(input);
}
ShapeUnderClothOptimizer::~ShapeUnderCloth... | 39.693767 | 129 | 0.682051 | maria-korosteleva |
45d83925ad998381439ada789097a4bfc4d2bbac | 3,457 | hpp | C++ | 10.01_base/2_src/arm/buslatches.hpp | jdersch/QUniBone | d2e10e0763e0f0a4e717d7679eae483a85cd45a4 | [
"BSD-2-Clause"
] | null | null | null | 10.01_base/2_src/arm/buslatches.hpp | jdersch/QUniBone | d2e10e0763e0f0a4e717d7679eae483a85cd45a4 | [
"BSD-2-Clause"
] | null | null | null | 10.01_base/2_src/arm/buslatches.hpp | jdersch/QUniBone | d2e10e0763e0f0a4e717d7679eae483a85cd45a4 | [
"BSD-2-Clause"
] | null | null | null | /* buslatches.hpp: PRU GPIO multiplier latches on QUniBone PCB-
Copyright (c) 2020, Joerg Hoppe
j_hoppe@t-online.de, www.retrocmp.com
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 ... | 32.308411 | 94 | 0.768007 | jdersch |
45e06cab4f7e55f0bcaa8bc4f5831a328a6ebf91 | 4,575 | cpp | C++ | src/utilities/Surface.cpp | AluminiumRat/mtt | 3052f8ad0ffabead05a1033e1d714a61e77d0aa8 | [
"MIT"
] | null | null | null | src/utilities/Surface.cpp | AluminiumRat/mtt | 3052f8ad0ffabead05a1033e1d714a61e77d0aa8 | [
"MIT"
] | null | null | null | src/utilities/Surface.cpp | AluminiumRat/mtt | 3052f8ad0ffabead05a1033e1d714a61e77d0aa8 | [
"MIT"
] | null | null | null | #include <glm/gtx/intersect.hpp>
#include <mtt/utilities/Box.h>
#include <mtt/utilities/Segment.h>
#include <mtt/utilities/Surface.h>
using namespace mtt;
void Surface::_clearVertices() noexcept
{
_vertices.clear();
_bound.invalidate();
}
void Surface::setVertices(const glm::vec3* ptr, size_t number)
{
_clear... | 25.847458 | 79 | 0.579454 | AluminiumRat |
45e07f741193fe0a6d793bd274274fd01a8d5026 | 1,705 | cpp | C++ | SPOJ/TTM - To the moon/2.cpp | tiger0132/code-backup | 9cb4ee5e99bf3c274e34f1e59d398ab52e51ecf7 | [
"MIT"
] | 6 | 2018-12-30T06:16:54.000Z | 2022-03-23T08:03:33.000Z | SPOJ/TTM - To the moon/2.cpp | tiger0132/code-backup | 9cb4ee5e99bf3c274e34f1e59d398ab52e51ecf7 | [
"MIT"
] | null | null | null | SPOJ/TTM - To the moon/2.cpp | tiger0132/code-backup | 9cb4ee5e99bf3c274e34f1e59d398ab52e51ecf7 | [
"MIT"
] | null | null | null | #include <algorithm>
#include <cstdio>
#include <cstring>
typedef long long ll;
const int N = 1e5 + 51;
struct pSGT {
#define L ch][0
#define R ch][1
#define mid (l + r) / 2
static const int M = N << 5;
int ch[M][2], nc;
ll t[M], s[M];
inline int cl(int x) {
return nc++, nc[L] = x[L], nc[R] = x[R], nc[t] = x[t]... | 29.912281 | 79 | 0.451613 | tiger0132 |
45e0be5e6332410371e1d29fce9099e05e1ca6c4 | 11,466 | cc | C++ | src/SinglePPhoreSite.cc | OpenEye-Contrib/Triphic | 7db4bbe3ebff27e222a3f3aacbf625f2f137ec20 | [
"BSD-3-Clause"
] | 8 | 2015-08-07T00:30:09.000Z | 2022-02-11T04:48:14.000Z | src/SinglePPhoreSite.cc | OpenEye-Contrib/Triphic | 7db4bbe3ebff27e222a3f3aacbf625f2f137ec20 | [
"BSD-3-Clause"
] | null | null | null | src/SinglePPhoreSite.cc | OpenEye-Contrib/Triphic | 7db4bbe3ebff27e222a3f3aacbf625f2f137ec20 | [
"BSD-3-Clause"
] | null | null | null | //
// file SinglePPhoreSite.cc
// David Cosgrove
// AstraZeneca
// 10th October 2006.
//
// Implementation of SinglePPhoreSite, a concrete class from BasePPhoreSite.
#include <fstream>
#include "gtpl_defs.H"
#include "stddefs.H"
#include "OverlayTrans.H"
#include "SinglePPhoreSite.H"
using namespace boost;
using nam... | 32.298592 | 94 | 0.498866 | OpenEye-Contrib |
45e1c6432eed06fcfae10f33da80d51d4766297e | 49,020 | cpp | C++ | automated-tests/src/dali-toolkit-styling/utc-Dali-StyleManager.cpp | dalihub/dali-toolk | 980728a7e35b8ddd28f70c090243e8076e21536e | [
"Apache-2.0",
"BSD-3-Clause"
] | 7 | 2016-11-18T10:26:51.000Z | 2021-01-28T13:51:59.000Z | automated-tests/src/dali-toolkit-styling/utc-Dali-StyleManager.cpp | dalihub/dali-toolk | 980728a7e35b8ddd28f70c090243e8076e21536e | [
"Apache-2.0",
"BSD-3-Clause"
] | 13 | 2020-07-15T11:33:03.000Z | 2021-04-09T21:29:23.000Z | automated-tests/src/dali-toolkit-styling/utc-Dali-StyleManager.cpp | dalihub/dali-toolk | 980728a7e35b8ddd28f70c090243e8076e21536e | [
"Apache-2.0",
"BSD-3-Clause"
] | 10 | 2019-05-17T07:15:09.000Z | 2021-05-24T07:28:08.000Z | /*
* Copyright (c) 2020 Samsung Electronics Co., Ltd.
*
* 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 applicabl... | 36.123803 | 171 | 0.725418 | dalihub |
45e235946c89cecadee5a55f28f00fcb4a52cd52 | 12,644 | cpp | C++ | src/osgEarthBuildings/BuildingCatalog.cpp | VTMAK/osgearth-buildings | 84e3f2cfb352bfeae27944ef62b68ffd8fd98a28 | [
"MIT"
] | 3 | 2017-12-05T06:38:28.000Z | 2021-12-07T06:19:39.000Z | src/osgEarthBuildings/BuildingCatalog.cpp | VTMAK/osgearth-buildings | 84e3f2cfb352bfeae27944ef62b68ffd8fd98a28 | [
"MIT"
] | null | null | null | src/osgEarthBuildings/BuildingCatalog.cpp | VTMAK/osgearth-buildings | 84e3f2cfb352bfeae27944ef62b68ffd8fd98a28 | [
"MIT"
] | 3 | 2017-12-03T09:48:04.000Z | 2021-12-07T06:19:41.000Z | /* -*-c++-*- */
/* osgEarth - Dynamic map generation toolkit for OpenSceneGraph
* Copyright 2008-2016 Pelican Mapping
* http://osgearth.org
*
* osgEarth is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundat... | 30.46747 | 121 | 0.533771 | VTMAK |
45e7ac5e6e356192cd502ec93cad75e8098b9610 | 1,188 | cpp | C++ | leetcode/Algorithms/ReverseInteger/solution_2.cpp | hxdone/puzzles | b729bce8a61f77ad7cbb70957e00c5ade9a0a35f | [
"Apache-2.0"
] | 2 | 2015-07-03T03:05:30.000Z | 2015-07-03T03:05:31.000Z | leetcode/Algorithms/ReverseInteger/solution_2.cpp | hxdone/puzzles | b729bce8a61f77ad7cbb70957e00c5ade9a0a35f | [
"Apache-2.0"
] | null | null | null | leetcode/Algorithms/ReverseInteger/solution_2.cpp | hxdone/puzzles | b729bce8a61f77ad7cbb70957e00c5ade9a0a35f | [
"Apache-2.0"
] | null | null | null | // Reversing calculation and comparison to check overflow.
// 8ms solution by hxone
#include <cmath>
#include <iostream>
using namespace std;
class Solution {
public:
int reverse(int x) {
if (x == 0x80000000)
return 0;
bool sign = (x >= 0);
int val = 0;
x = sign?x:-x;
... | 25.826087 | 58 | 0.463805 | hxdone |
45e8a8d2f0bf33a6f0fe092e9aaa8c90c05bc651 | 1,485 | cpp | C++ | Plugins/Physics/PhysX/PhysXMaterial.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 47 | 2015-03-29T09:44:25.000Z | 2020-11-30T10:05:56.000Z | Plugins/Physics/PhysX/PhysXMaterial.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 313 | 2015-01-01T18:16:30.000Z | 2015-11-30T07:54:07.000Z | Plugins/Physics/PhysX/PhysXMaterial.cpp | Another-Game-Engine/AGE | d5d9e98235198fe580a43007914f515437635830 | [
"MIT"
] | 9 | 2015-06-07T13:21:54.000Z | 2020-08-25T09:50:07.000Z | #include "PhysXMaterial.hpp"
#include "PhysXWorld.hpp"
namespace AGE
{
namespace Physics
{
// Constructors
PhysXMaterial::PhysXMaterial(PhysXWorld *world, const std::string &name)
: MaterialInterface(name), material(static_cast<PhysXPhysics *>(world->getPhysics())->getPhysics()->createMaterial(GetDefaultStati... | 22.164179 | 200 | 0.722559 | Another-Game-Engine |
45eadc7d740c4f23e9d787c2e3876ac372be4fa8 | 3,086 | cpp | C++ | Base/PLGui/src/Gui/CursorManager.cpp | ktotheoz/pixellight | 43a661e762034054b47766d7e38d94baf22d2038 | [
"MIT"
] | 83 | 2015-01-08T15:06:14.000Z | 2021-07-20T17:07:00.000Z | Base/PLGui/src/Gui/CursorManager.cpp | PixelLightFoundation/pixellight | 43a661e762034054b47766d7e38d94baf22d2038 | [
"MIT"
] | 27 | 2019-06-18T06:46:07.000Z | 2020-02-02T11:11:28.000Z | Base/PLGui/src/Gui/CursorManager.cpp | naetherm/PixelLight | d7666f5b49020334cbb5debbee11030f34cced56 | [
"MIT"
] | 40 | 2015-02-25T18:24:34.000Z | 2021-03-06T09:01:48.000Z | /*********************************************************\
* File: CursorManager.cpp *
*
* Copyright (C) 2002-2013 The PixelLight Team (http://www.pixellight.org/)
*
* This file is part of PixelLight.
*
* Permission is hereby granted, free of charge, to any person obtaining a co... | 30.554455 | 97 | 0.526572 | ktotheoz |
45f97683a3f504e796ee4ba9741b9f13cbdfe4d7 | 24,310 | cpp | C++ | rpkg_src/gltf.cpp | glacier-modding/RPKG-Tool | 3ed2ba3f49e6eb6b4f03ef32787474d51908b6c0 | [
"BSD-2-Clause"
] | 9 | 2021-06-01T00:58:46.000Z | 2022-02-16T12:44:15.000Z | rpkg_src/gltf.cpp | glacier-modding/RPKG-Tool | 3ed2ba3f49e6eb6b4f03ef32787474d51908b6c0 | [
"BSD-2-Clause"
] | 33 | 2021-06-02T17:55:16.000Z | 2022-02-27T15:03:06.000Z | rpkg_src/gltf.cpp | glacier-modding/RPKG-Tool | 3ed2ba3f49e6eb6b4f03ef32787474d51908b6c0 | [
"BSD-2-Clause"
] | 17 | 2021-06-01T01:05:45.000Z | 2022-01-30T12:19:53.000Z | #include "gltf.h"
#include "file.h"
#include "util.h"
#include <GLTFSDK/BufferBuilder.h>
#include <GLTFSDK/IStreamWriter.h>
#include <GLTFSDK/GLBResourceWriter.h>
#include <GLTFSDK/Serialize.h>
#include <iostream>
#include <sstream>
#include <fstream>
#include <filesystem>
#include <sstream>
#include <assert.h>
using ... | 38.404423 | 231 | 0.618593 | glacier-modding |
45f97ccea119ad9e81ea2e719d44fc10ac3b5648 | 7,152 | cpp | C++ | src/tuio/tuio.cpp | dancasimiro/qtuiotouch | d51ef843cf4c947239c368861e7652bbc5d7c5ec | [
"MIT"
] | 4 | 2015-08-21T00:08:16.000Z | 2022-02-03T14:57:07.000Z | src/tuio/tuio.cpp | dancasimiro/qtuiotouch | d51ef843cf4c947239c368861e7652bbc5d7c5ec | [
"MIT"
] | null | null | null | src/tuio/tuio.cpp | dancasimiro/qtuiotouch | d51ef843cf4c947239c368861e7652bbc5d7c5ec | [
"MIT"
] | 3 | 2017-11-22T09:33:03.000Z | 2020-11-20T12:12:11.000Z | /// UNCLASSIFIED
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include "tuio/tuio.hpp"
#include <algorithm>
#include <boost/bind.hpp>
namespace tuio {
position_type::position_type()
: x(0.0f)
, y(0.0f)
, z(0.0f)
{
}
angle_type::angle_type()
: a(0.0f)
, b(0.0f)
, c... | 35.058824 | 127 | 0.548238 | dancasimiro |
45fa21ec7396bb835ee44dbbc60e4250e201d108 | 1,162 | cpp | C++ | third/qcustomplotdemo/frmexample/frmsimpleitem.cpp | alexwang815/QWidgetDemo | 293a8d9c40d686397829c5d415fc531b6956883e | [
"MulanPSL-1.0"
] | 36 | 2020-04-27T06:56:30.000Z | 2022-03-16T02:05:38.000Z | third/qcustomplotdemo/frmexample/frmsimpleitem.cpp | alexwang815/QWidgetDemo | 293a8d9c40d686397829c5d415fc531b6956883e | [
"MulanPSL-1.0"
] | null | null | null | third/qcustomplotdemo/frmexample/frmsimpleitem.cpp | alexwang815/QWidgetDemo | 293a8d9c40d686397829c5d415fc531b6956883e | [
"MulanPSL-1.0"
] | 15 | 2021-11-01T14:42:53.000Z | 2022-03-23T07:27:00.000Z | #include "frmsimpleitem.h"
#include "ui_frmsimpleitem.h"
#include "qdebug.h"
frmSimpleItem::frmSimpleItem(QWidget *parent) : QWidget(parent), ui(new Ui::frmSimpleItem)
{
ui->setupUi(this);
this->initForm();
}
frmSimpleItem::~frmSimpleItem()
{
delete ui;
}
void frmSimpleItem::initForm()
{
ui->customP... | 33.2 | 90 | 0.702238 | alexwang815 |
45ff7afb0dab184331112744f9a25f2d1a29a66f | 4,139 | cpp | C++ | X si O/main.cpp | Stefan-Radu/Projects | 60a320f01ebedd9126eabe8e01d54e4b1d05ce02 | [
"MIT"
] | null | null | null | X si O/main.cpp | Stefan-Radu/Projects | 60a320f01ebedd9126eabe8e01d54e4b1d05ce02 | [
"MIT"
] | null | null | null | X si O/main.cpp | Stefan-Radu/Projects | 60a320f01ebedd9126eabe8e01d54e4b1d05ce02 | [
"MIT"
] | null | null | null | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <cstring>
using namespace std;
int i,j,turn=1,x,coin,y,nr=0,p;
char v[10][10],chr;
bool ok,win,play;
void ver();
int main()
{
play=true;
while(play){
cout<<"Press any key to flip the coin!"<<'\n';
srand(time(0));
... | 20.59204 | 80 | 0.239188 | Stefan-Radu |
3400543c3e8530acdfd3ba16584b22ab4456fab7 | 3,611 | cpp | C++ | src/modules/BaseModule.cpp | teaserrr/RabbitIoT | 87d45e75c99b2b1ca659700bcf0dd9879b486ff2 | [
"MIT"
] | null | null | null | src/modules/BaseModule.cpp | teaserrr/RabbitIoT | 87d45e75c99b2b1ca659700bcf0dd9879b486ff2 | [
"MIT"
] | null | null | null | src/modules/BaseModule.cpp | teaserrr/RabbitIoT | 87d45e75c99b2b1ca659700bcf0dd9879b486ff2 | [
"MIT"
] | null | null | null | #include "BaseModule.h"
#include <Arduino.h>
BaseModule::BaseModule(const char* id, unsigned long loopDelay, const char* mqttPath)
: BaseModule(id, loopDelay, mqttPath, NULL, NULL) {
}
BaseModule::BaseModule(const char* id, unsigned long loopDelay, const char* mqttPath, ModuleSetup setupFunc, ModuleLoop loopFunc)... | 26.748148 | 131 | 0.661867 | teaserrr |
34014d37156c378b19e1b4e712a8b4ec10119b80 | 1,049 | cpp | C++ | test/training_data/plag_original_codes/01_003.cpp | xryuseix/SA-Plag | 167f7a2b2fa81ff00fd5263772a74c2c5c61941d | [
"MIT"
] | 13 | 2021-01-20T19:53:16.000Z | 2021-11-14T16:30:32.000Z | test/training_data/plag_original_codes/01_003.cpp | xryuseix/SA-Plag | 167f7a2b2fa81ff00fd5263772a74c2c5c61941d | [
"MIT"
] | null | null | null | test/training_data/plag_original_codes/01_003.cpp | xryuseix/SA-Plag | 167f7a2b2fa81ff00fd5263772a74c2c5c61941d | [
"MIT"
] | null | null | null | // 引用元 : https://atcoder.jp/contests/agc035/submissions/6378695
// 得点 : 700
// コード長 : 943
// 実行時間 : 38
#include<cstdio>
using namespace std;
int tot,m,n,TT;
int wz[234234],rdt[234234],rd[234234],pd[234234],b[234234],sz[234234],dfn[234234];
void cnct(int x,int y)
{
rd[++tot]=x,rdt[tot]=wz[y],wz[y]=tot;
rd[+... | 16.650794 | 83 | 0.454719 | xryuseix |
34025247df18d6d56bdfd7294bd2d4234cdcc070 | 2,662 | cpp | C++ | SDK/Extras/Textify3DMF/Source/TypeHandlers/Geometries/Marker.cpp | h-haris/Quesa | a438ab824291ce6936a88dfae4fd0482dcba1247 | [
"BSD-3-Clause"
] | 24 | 2019-10-28T07:01:48.000Z | 2022-03-04T16:10:39.000Z | SDK/Extras/Textify3DMF/Source/TypeHandlers/Geometries/Marker.cpp | h-haris/Quesa | a438ab824291ce6936a88dfae4fd0482dcba1247 | [
"BSD-3-Clause"
] | 8 | 2020-04-22T19:42:45.000Z | 2021-04-30T16:28:32.000Z | SDK/Extras/Textify3DMF/Source/TypeHandlers/Geometries/Marker.cpp | h-haris/Quesa | a438ab824291ce6936a88dfae4fd0482dcba1247 | [
"BSD-3-Clause"
] | 6 | 2019-09-22T14:44:15.000Z | 2021-04-01T20:04:29.000Z | /*
* Marker.cpp
* Textify3DMF
*
* Created by James Walker on 4/14/12.
* Copyright (c) 2012 James W. Walker.
*
* This software is provided 'as-is', without any express or implied warranty.
* In no event will the authors be held liable for any damages arising from the
* use of this software.
*
* Permis... | 31.317647 | 80 | 0.669797 | h-haris |
340398dca0ce1715956c7e14500937867a7a6a3e | 637 | cpp | C++ | 13-data_structure/06-stack.cpp | stevenokm/cpp_tutorial | 0cbc0917bcee8c503a3b9318e945a6ec662ac402 | [
"MIT"
] | 1 | 2021-09-23T00:35:43.000Z | 2021-09-23T00:35:43.000Z | 13-data_structure/06-stack.cpp | stevenokm/cpp_tutorial | 0cbc0917bcee8c503a3b9318e945a6ec662ac402 | [
"MIT"
] | null | null | null | 13-data_structure/06-stack.cpp | stevenokm/cpp_tutorial | 0cbc0917bcee8c503a3b9318e945a6ec662ac402 | [
"MIT"
] | 2 | 2021-08-30T05:34:42.000Z | 2021-09-21T14:11:22.000Z | #include <iostream>
#include <stack>
int main()
{
std::stack<int> s;
s.push(100);
std::cout << "size: " << s.size() << " ";
std::cout << "front: " << s.top() << "\n";
s.push(200);
std::cout << "size: " << s.size() << " ";
std::cout << "front: " << s.top() << "\n";
s.push(300);
st... | 21.965517 | 46 | 0.392465 | stevenokm |
34088164bd1fd1986e7a4603128744249912097a | 3,883 | cpp | C++ | src/toolchain/compiler/linker_lld/linker_lld.cpp | blitz3d-ng/blitz3d-ng | adc829fb76e2c63612b50c725c0944b2b6b0ddaf | [
"Zlib"
] | 53 | 2017-08-10T10:52:34.000Z | 2021-12-09T18:03:30.000Z | src/toolchain/compiler/linker_lld/linker_lld.cpp | kfprimm/blitz3d | adc829fb76e2c63612b50c725c0944b2b6b0ddaf | [
"Zlib"
] | 21 | 2017-05-03T20:28:28.000Z | 2022-03-25T12:11:00.000Z | src/toolchain/compiler/linker_lld/linker_lld.cpp | kfprimm/blitz3d | adc829fb76e2c63612b50c725c0944b2b6b0ddaf | [
"Zlib"
] | 8 | 2017-04-23T02:09:24.000Z | 2022-02-01T21:17:27.000Z | #include "linker_lld.h"
#include <lld/Common/Driver.h>
#include <iostream>
Linker_LLD::Linker_LLD( const std::string &home ):home(home){
}
void Linker_LLD::createExe( const std::string &exeFile ){
// auto test = llvm::object::createBinary("output.o");
std::vector<const char *> args;
std::string toolchain=home+"/... | 29.195489 | 77 | 0.684265 | blitz3d-ng |
340a3eaee939954886e92fd0f78a48e5e37f3988 | 1,401 | cpp | C++ | graph/EulerTour.cpp | Mayank-PEC/C-Plus-Plus | f7687651815d7de59838a5de47e7133a40f81960 | [
"MIT"
] | null | null | null | graph/EulerTour.cpp | Mayank-PEC/C-Plus-Plus | f7687651815d7de59838a5de47e7133a40f81960 | [
"MIT"
] | null | null | null | graph/EulerTour.cpp | Mayank-PEC/C-Plus-Plus | f7687651815d7de59838a5de47e7133a40f81960 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vec(x) vector<x>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define umpii unordered_map<int,int>
#define mem(a,b) memset(a, b, sizeof a)
#define prec(n) fixed<<setprecision(n)
#def... | 17.5125 | 76 | 0.511777 | Mayank-PEC |
340d4772ab21807bf9f334f113657c7b4936b033 | 3,075 | cpp | C++ | tests/dimensions/common.cpp | RomainBrault/Gem | 0eff3cb034a0faaca894316b72f4b005e72e0f5d | [
"MIT"
] | null | null | null | tests/dimensions/common.cpp | RomainBrault/Gem | 0eff3cb034a0faaca894316b72f4b005e72e0f5d | [
"MIT"
] | null | null | null | tests/dimensions/common.cpp | RomainBrault/Gem | 0eff3cb034a0faaca894316b72f4b005e72e0f5d | [
"MIT"
] | null | null | null | #include <cstdlib>
#include <boost/hana/assert.hpp>
#include <gem/gem.hpp>
using namespace gem;
using namespace boost::hana;
auto main(void) -> int
{
{
Dimension d {2_u};
BOOST_HANA_CONSTEXPR_CHECK(has_common<decltype(d),
Dimension<unsigned int, 2, 2, 2>>::value);
BOOST_HANA_... | 23.473282 | 59 | 0.572033 | RomainBrault |
341598a149994e64fef487b2efd0fa8edcb7b3e8 | 346 | cpp | C++ | 2.基本语言/28用迭代器遍历string类型数据.cpp | xuesongzh/cpp-basis | 2be3c5349edfa9a8f5937ba7eae013769c27449d | [
"Apache-2.0"
] | null | null | null | 2.基本语言/28用迭代器遍历string类型数据.cpp | xuesongzh/cpp-basis | 2be3c5349edfa9a8f5937ba7eae013769c27449d | [
"Apache-2.0"
] | null | null | null | 2.基本语言/28用迭代器遍历string类型数据.cpp | xuesongzh/cpp-basis | 2be3c5349edfa9a8f5937ba7eae013769c27449d | [
"Apache-2.0"
] | null | null | null | #include <cctype>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
string str("jisuanjizuochegnyuanli");
for (auto iter = str.begin(); iter != str.end(); iter++) {
*iter = std::toupper((*iter));
}
cout << str << endl;
system(... | 18.210526 | 62 | 0.598266 | xuesongzh |
34176c32b4584780e8cf8483f8d16945e2aed483 | 15,205 | cc | C++ | prologin.cc | Ekdohibs/prologin2014 | a65bcb46be5f20162312539dd1d987e75f79bf89 | [
"CC0-1.0"
] | null | null | null | prologin.cc | Ekdohibs/prologin2014 | a65bcb46be5f20162312539dd1d987e75f79bf89 | [
"CC0-1.0"
] | null | null | null | prologin.cc | Ekdohibs/prologin2014 | a65bcb46be5f20162312539dd1d987e75f79bf89 | [
"CC0-1.0"
] | null | null | null | // Main file
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include "prologin.hh"
#include "max_flow.hh"
#include "chemin.hh"
#include "common.hh"
#include <time.h>
using namespace std;
/*
+------------------------------+
| Fonctionnement du champion |
+------------------------------+
... | 28.420561 | 210 | 0.585728 | Ekdohibs |
34198a1e2d4276dc3401d8a4e96a0b6a9d0bce2e | 358 | hpp | C++ | include/eepp/audio.hpp | dogtwelve/eepp | dd672ff0e108ae1e08449ca918dc144018fb4ba4 | [
"MIT"
] | null | null | null | include/eepp/audio.hpp | dogtwelve/eepp | dd672ff0e108ae1e08449ca918dc144018fb4ba4 | [
"MIT"
] | null | null | null | include/eepp/audio.hpp | dogtwelve/eepp | dd672ff0e108ae1e08449ca918dc144018fb4ba4 | [
"MIT"
] | null | null | null | #ifndef EEPP_AUDIO_HPP
#define EEPP_AUDIO_HPP
#include <eepp/audio/caudiodevice.hpp>
#include <eepp/audio/caudiolistener.hpp>
#include <eepp/audio/csound.hpp>
#include <eepp/audio/csoundbuffer.hpp>
#include <eepp/audio/csoundstream.hpp>
#include <eepp/audio/cmusic.hpp>
#include <eepp/audio/tsoundloader.hpp>
#include <... | 25.571429 | 40 | 0.793296 | dogtwelve |
341bdda024f0c6a594067c46db8219029f062d75 | 1,396 | cpp | C++ | src/examplesearch/ui/tab_log.cpp | lilithean/XtalOpt | 9ebc125e6014b27e72a04fb62c8820c7b9670c61 | [
"BSD-3-Clause"
] | 23 | 2017-09-01T04:35:02.000Z | 2022-01-16T13:51:17.000Z | src/examplesearch/ui/tab_log.cpp | lilithean/XtalOpt | 9ebc125e6014b27e72a04fb62c8820c7b9670c61 | [
"BSD-3-Clause"
] | 20 | 2017-08-29T15:29:46.000Z | 2022-01-20T09:10:59.000Z | src/examplesearch/ui/tab_log.cpp | lilithean/XtalOpt | 9ebc125e6014b27e72a04fb62c8820c7b9670c61 | [
"BSD-3-Clause"
] | 21 | 2017-06-15T03:11:34.000Z | 2022-02-28T05:20:44.000Z | /**********************************************************************
ExampleSearch -- A tool for analysing a matrix-substrate docking problem
Copyright (C) 2012 by David C. Lonie
This source code is released under the New BSD License, (the "License").
Unless required by applicable law or agreed to in writ... | 25.851852 | 75 | 0.664756 | lilithean |
341d31ebdba941b2e3873e55d641bf2f4cb51354 | 124 | cc | C++ | build/x86/python/m5/internal/param_I8259.i_init.cc | billionshang/gem5 | 18cc4294f32315595f865d07d1f33434e92b06b2 | [
"BSD-3-Clause"
] | null | null | null | build/x86/python/m5/internal/param_I8259.i_init.cc | billionshang/gem5 | 18cc4294f32315595f865d07d1f33434e92b06b2 | [
"BSD-3-Clause"
] | 1 | 2020-08-20T05:53:30.000Z | 2020-08-20T05:53:30.000Z | build/X86_MESI_Two_Level/python/m5/internal/param_I8259.i_init.cc | hoho20000000/gem5-fy | b59f6feed22896d6752331652c4d8a41a4ca4435 | [
"BSD-3-Clause"
] | null | null | null | #include "sim/init.hh"
extern "C" {
void init_param_I8259();
}
EmbeddedSwig embed_swig_param_I8259(init_param_I8259);
| 15.5 | 54 | 0.75 | billionshang |
341fd5230c58f21768146434c27c13ae769eca18 | 516 | cpp | C++ | src/DaybreakClient/OglRenderer/OglError.cpp | smacdo/Daybreak | 9c93d80273b9d0043d204e3cd388be4d5b54f631 | [
"Apache-2.0"
] | null | null | null | src/DaybreakClient/OglRenderer/OglError.cpp | smacdo/Daybreak | 9c93d80273b9d0043d204e3cd388be4d5b54f631 | [
"Apache-2.0"
] | null | null | null | src/DaybreakClient/OglRenderer/OglError.cpp | smacdo/Daybreak | 9c93d80273b9d0043d204e3cd388be4d5b54f631 | [
"Apache-2.0"
] | null | null | null | #include "stdafx.h"
#include "OglError.h"
#include <string>
#include <exception>
#include <glad\glad.h>
using namespace Daybreak::OpenGlRenderer;
//---------------------------------------------------------------------------------------------------------------------
void Daybreak::OpenGlRenderer::glCheckForErrorsImp... | 24.571429 | 119 | 0.540698 | smacdo |
3421ca06c2181abf097ea4c3fb0d160ce8be83e7 | 1,860 | cpp | C++ | CodeForces/Registration_system.cpp | sharmakarish/CPP-Questions-and-Solutions | a2cbcb7b7de4df2849af352af763a0904f834e56 | [
"MIT"
] | 42 | 2021-09-26T18:02:52.000Z | 2022-03-15T01:52:15.000Z | CodeForces/Registration_system.cpp | sharmakarish/CPP-Questions-and-Solutions | a2cbcb7b7de4df2849af352af763a0904f834e56 | [
"MIT"
] | 404 | 2021-09-24T19:55:10.000Z | 2021-11-03T05:47:47.000Z | CodeForces/Registration_system.cpp | sharmakarish/CPP-Questions-and-Solutions | a2cbcb7b7de4df2849af352af763a0904f834e56 | [
"MIT"
] | 140 | 2021-09-22T20:50:04.000Z | 2022-01-22T16:59:09.000Z |
//C.Registration system
// que link --> https://codeforces.com/problemset/problem/4/C
/*A new e-mail service "Berlandesk" is going to be opened in Berland in the near future. The site administration wants
to launch their project as soon as possible, that's why they ask you to help. You're suggested to implement the pr... | 41.333333 | 163 | 0.654839 | sharmakarish |
34261bf7dae6730dd407ae794b87246d8abb60d4 | 1,613 | cpp | C++ | husky-sql/utils/save_to_hdfs.cpp | Alice3150/husky-sql | 40dc95b5543c079bb4ab070fca2ac2a287514333 | [
"Apache-2.0"
] | null | null | null | husky-sql/utils/save_to_hdfs.cpp | Alice3150/husky-sql | 40dc95b5543c079bb4ab070fca2ac2a287514333 | [
"Apache-2.0"
] | null | null | null | husky-sql/utils/save_to_hdfs.cpp | Alice3150/husky-sql | 40dc95b5543c079bb4ab070fca2ac2a287514333 | [
"Apache-2.0"
] | null | null | null | #include "husky-sql/utils/save_to_hdfs.hpp"
#include "io/hdfs_manager.hpp"
#include <vector>
#include <memory>
#include <sstream>
namespace husky {
namespace sql {
void save_to_hdfs(ObjList<RowKV>& records, const std::string& output_path) {
// get path and namenode info
std::string protocol = "... | 41.358974 | 115 | 0.613763 | Alice3150 |
34264245f37e4731c0f85b4cdb2f31730d70c70e | 581 | hpp | C++ | src/common/STRING.hpp | hilnius/cappella | 555a920330e615793b238d72255274ca7c558467 | [
"MIT"
] | null | null | null | src/common/STRING.hpp | hilnius/cappella | 555a920330e615793b238d72255274ca7c558467 | [
"MIT"
] | null | null | null | src/common/STRING.hpp | hilnius/cappella | 555a920330e615793b238d72255274ca7c558467 | [
"MIT"
] | null | null | null | #ifndef STRING_H_INCLUDED
#define STRING_H_INCLUDED
#include "common/JSONSerializable.hpp"
#include <string>
template<int T>
class STRING: public JSONSerializable
{
public:
STRING(std::string value = "") { p_value = value; }
virtual ~STRING() {}
virtual std::string toJSON(std::vector<std::string> wante... | 23.24 | 137 | 0.690189 | hilnius |
342c715b37e220ababa5ccbd24707ea2ee78f629 | 6,822 | cpp | C++ | src/handlers/Account.cpp | EndlessOpenSource/etheos | 01b4729b21c787e321fe27eb4ccf8ceb38032656 | [
"Zlib"
] | 5 | 2019-12-15T19:58:52.000Z | 2021-01-05T03:23:28.000Z | src/handlers/Account.cpp | EndlessOpenSource/etheos | 01b4729b21c787e321fe27eb4ccf8ceb38032656 | [
"Zlib"
] | 12 | 2019-12-10T21:47:57.000Z | 2020-11-06T06:01:52.000Z | src/handlers/Account.cpp | ethanmoffat/etheos | 15911c34d978fab10c60c4653e75b7e2bd0eafa2 | [
"Zlib"
] | 4 | 2021-06-23T07:55:42.000Z | 2022-02-07T08:34:09.000Z |
/* $Id$
* EOSERV is released under the zlib license.
* See LICENSE.txt for more info.
*/
#include "handlers.hpp"
#include "../config.hpp"
#include "../eoclient.hpp"
#include "../eoserver.hpp"
#include "../packet.hpp"
#include "../player.hpp"
#include "../world.hpp"
#include "../extra/seose_compat.hpp"
#include "... | 30.868778 | 140 | 0.726327 | EndlessOpenSource |
3437ab8599b3dcffe970669faeae337917912521 | 5,462 | hpp | C++ | code/LangBase/Process/BuildAstVisitor.hpp | goodcodedev/lang-base | 875ca9cf65ea3fb8f1741bf3d2b54fce4bcd0b79 | [
"MIT"
] | null | null | null | code/LangBase/Process/BuildAstVisitor.hpp | goodcodedev/lang-base | 875ca9cf65ea3fb8f1741bf3d2b54fce4bcd0b79 | [
"MIT"
] | null | null | null | code/LangBase/Process/BuildAstVisitor.hpp | goodcodedev/lang-base | 875ca9cf65ea3fb8f1741bf3d2b54fce4bcd0b79 | [
"MIT"
] | null | null | null | #include "../DescrVisitor.hpp"
#include "../LangData.hpp"
#include "../Ast.hpp"
namespace LangBase {
class BuildAstVisitor : public DescrVisitor {
public:
LData *langData;
BuildAstVisitor(LData *langData) : langData(langData) {}
void visitEnum(EnumNode *node) {
AstEnum* astEnum = langData->ensureE... | 41.378788 | 89 | 0.558587 | goodcodedev |
343831fc60feebc101d9439fd755cde8c4db5647 | 1,329 | cpp | C++ | Lyfe_Game/Source/Lyfe_Game/Private/NPC_Cell.cpp | GameAboutThings/Lyfe | 320a8e27586c327707f36e9a268c84d6d77c6da4 | [
"Unlicense"
] | 2 | 2018-04-30T09:58:48.000Z | 2018-05-14T10:13:42.000Z | Lyfe_Game/Source/Lyfe_Game/Private/NPC_Cell.cpp | GameAboutThings/Lyfe | 320a8e27586c327707f36e9a268c84d6d77c6da4 | [
"Unlicense"
] | null | null | null | Lyfe_Game/Source/Lyfe_Game/Private/NPC_Cell.cpp | GameAboutThings/Lyfe | 320a8e27586c327707f36e9a268c84d6d77c6da4 | [
"Unlicense"
] | null | null | null | // Fill out your copyright notice in the Description page of Project Settings.
#include "NPC_Cell.h"
// Sets default values
ANPC_Cell::ANPC_Cell()
{
// Set this actor to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCanEverTick = true;
}
// Called... | 33.225 | 115 | 0.292701 | GameAboutThings |
343b24a177eaec12e3f6612e520c4d07cfb12a0b | 3,573 | hpp | C++ | src/Utils.hpp | abhishekpanigrahi1996/warplda | 3f7ac254fed4fb92bae278253dc4da8a0c7d6906 | [
"MIT"
] | 168 | 2016-05-31T04:12:49.000Z | 2021-07-30T11:38:34.000Z | src/Utils.hpp | abhishekpanigrahi1996/warplda | 3f7ac254fed4fb92bae278253dc4da8a0c7d6906 | [
"MIT"
] | 10 | 2016-06-07T10:11:01.000Z | 2021-04-09T13:03:21.000Z | src/Utils.hpp | abhishekpanigrahi1996/warplda | 3f7ac254fed4fb92bae278253dc4da8a0c7d6906 | [
"MIT"
] | 61 | 2016-05-31T04:12:54.000Z | 2020-11-16T14:38:51.000Z | #pragma once
//#include <mpi.h>
#include <vector>
#include <string>
#include <sstream>
#include <fstream>
#include <iostream>
//#include <gzstream.h>
#include <unistd.h>
inline uint32_t logceil(uint32_t n)
{
for (uint32_t i = 0; i < 31; i++)
if ((1U << i) >= n)
return i;
return -1;
}
inline unsigned int Divup... | 18.045455 | 74 | 0.637 | abhishekpanigrahi1996 |
4522ee12f85f69d572c0c921cf48b9c25956bbed | 6,552 | cpp | C++ | src/meta/meta_bulk_load_ingestion_context.cpp | WHBANG/rdsn | 47fd85c29bd446495388e1ab3a46bd741c99c443 | [
"MIT"
] | null | null | null | src/meta/meta_bulk_load_ingestion_context.cpp | WHBANG/rdsn | 47fd85c29bd446495388e1ab3a46bd741c99c443 | [
"MIT"
] | null | null | null | src/meta/meta_bulk_load_ingestion_context.cpp | WHBANG/rdsn | 47fd85c29bd446495388e1ab3a46bd741c99c443 | [
"MIT"
] | null | null | null | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... | 33.428571 | 100 | 0.682387 | WHBANG |
4524d5b62a4481df568774061d444047024fb6f2 | 63 | cpp | C++ | MLtool/Core/Core.cpp | NCIC-PARALLEL/Graphine-LIB | c241cc4fd9071b82c97d5f46cdc5af348e7e54c2 | [
"BSD-3-Clause"
] | 207 | 2021-07-22T09:45:59.000Z | 2021-07-26T07:59:24.000Z | MLtool/Core/Core.cpp | PAA-NCIC/HPML | c241cc4fd9071b82c97d5f46cdc5af348e7e54c2 | [
"BSD-3-Clause"
] | null | null | null | MLtool/Core/Core.cpp | PAA-NCIC/HPML | c241cc4fd9071b82c97d5f46cdc5af348e7e54c2 | [
"BSD-3-Clause"
] | 37 | 2021-07-22T09:46:06.000Z | 2021-07-25T10:21:37.000Z | /*
ID: septicmk
LANG: C++
TASK: Core.cpp
*/
#include "Core.h"
| 7.875 | 17 | 0.603175 | NCIC-PARALLEL |
4525e149167e94bba130cac567e1329cea411bc8 | 34,813 | cpp | C++ | esp/services/ws_sql/SQL2ECL/HPCCSQLTreeWalker.cpp | JamesDeFabia/wssql | 43d9ca734395b53dee14ba7e78469795167d1402 | [
"Apache-2.0"
] | null | null | null | esp/services/ws_sql/SQL2ECL/HPCCSQLTreeWalker.cpp | JamesDeFabia/wssql | 43d9ca734395b53dee14ba7e78469795167d1402 | [
"Apache-2.0"
] | null | null | null | esp/services/ws_sql/SQL2ECL/HPCCSQLTreeWalker.cpp | JamesDeFabia/wssql | 43d9ca734395b53dee14ba7e78469795167d1402 | [
"Apache-2.0"
] | null | null | null | /*##############################################################################
HPCC SYSTEMS software Copyright (C) 2014 HPCC Systems.
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.a... | 38.509956 | 146 | 0.504036 | JamesDeFabia |
452ad5d94e379b7622c1e4590857ca132ee0e82d | 5,911 | cpp | C++ | arch/common/dbt/mc/x86/encoding/arith.cpp | tspink/captive | 9db853df410e06ddb6384dc5e319b92f90483065 | [
"MIT"
] | 24 | 2017-01-02T18:46:34.000Z | 2022-01-10T09:37:58.000Z | arch/common/dbt/mc/x86/encoding/arith.cpp | tspink/captive | 9db853df410e06ddb6384dc5e319b92f90483065 | [
"MIT"
] | 4 | 2019-09-19T17:48:03.000Z | 2020-09-17T11:01:29.000Z | arch/common/dbt/mc/x86/encoding/arith.cpp | tspink/captive | 9db853df410e06ddb6384dc5e319b92f90483065 | [
"MIT"
] | 8 | 2017-04-28T04:53:42.000Z | 2022-01-10T10:11:29.000Z | /* SPDX-License-Identifier: MIT */
#include <dbt/mc/x86/encoder.h>
using namespace captive::arch::dbt::mc::x86;
bool Encoder::encode_add(TranslatedCodeBuffer& tcb, const Instruction *insn)
{
return encode_arithmetic_reg_reg(tcb, 0, insn);
}
bool Encoder::encode_adc(TranslatedCodeBuffer& tcb, const Instruction* ins... | 27.114679 | 107 | 0.690239 | tspink |
45408961dace4833f0b15f53275ad9b8891fe400 | 2,156 | cc | C++ | source/IRTKSimple2/image++/src/irtkNearestNeighborInterpolateImageFunction2D.cc | gordon-n-stevenson/fetalReconstruction | 6a1e4a15bdf92e86439791d836d1b20ede793293 | [
"Zlib",
"Unlicense",
"Intel",
"MIT"
] | null | null | null | source/IRTKSimple2/image++/src/irtkNearestNeighborInterpolateImageFunction2D.cc | gordon-n-stevenson/fetalReconstruction | 6a1e4a15bdf92e86439791d836d1b20ede793293 | [
"Zlib",
"Unlicense",
"Intel",
"MIT"
] | null | null | null | source/IRTKSimple2/image++/src/irtkNearestNeighborInterpolateImageFunction2D.cc | gordon-n-stevenson/fetalReconstruction | 6a1e4a15bdf92e86439791d836d1b20ede793293 | [
"Zlib",
"Unlicense",
"Intel",
"MIT"
] | null | null | null | /*=========================================================================
Library : Image Registration Toolkit (IRTK)
Module : $Id: irtkNearestNeighborInterpolateImageFunction2D.cc 8 2009-03-02 16:12:58Z dr $
Copyright : Imperial College, Department of Computing
Visual Information Processing... | 26.617284 | 108 | 0.630334 | gordon-n-stevenson |
4540f963ab25d86d0e6d05c7b79231147cd371d7 | 5,979 | cpp | C++ | KmsLib/OpenCL/Program.cpp | martindubois/KmsBase | b8138c4b332eaf9aa4110e41114e9939093aed95 | [
"Apache-2.0"
] | null | null | null | KmsLib/OpenCL/Program.cpp | martindubois/KmsBase | b8138c4b332eaf9aa4110e41114e9939093aed95 | [
"Apache-2.0"
] | null | null | null | KmsLib/OpenCL/Program.cpp | martindubois/KmsBase | b8138c4b332eaf9aa4110e41114e9939093aed95 | [
"Apache-2.0"
] | null | null | null |
// Author / Auteur : KMS - Martin Dubois, ing.
// Product / Produit : KmsBase
// File / Fichier : KmsLib/OpenCL/Program.cpp
// Includes
/////////////////////////////////////////////////////////////////////////////
#include <KmsBase.h>
// ===== C ==================================================================
#... | 26.223684 | 156 | 0.58187 | martindubois |
4541dd54c717cd7db975826ac05a2d5379067296 | 2,329 | cpp | C++ | Server/BackEndMonitoringServer/src/CLogicalDiskInfoMonitoring.cpp | ITA-Dnipro/BackEndMonitoring | 2962b6e14e47c789daaf6f6c5e200c8ec419bc7e | [
"MIT"
] | null | null | null | Server/BackEndMonitoringServer/src/CLogicalDiskInfoMonitoring.cpp | ITA-Dnipro/BackEndMonitoring | 2962b6e14e47c789daaf6f6c5e200c8ec419bc7e | [
"MIT"
] | 44 | 2021-01-11T18:26:25.000Z | 2021-02-28T13:22:12.000Z | Server/BackEndMonitoringServer/src/CLogicalDiskInfoMonitoring.cpp | ITA-Dnipro/BackEndMonitoring | 2962b6e14e47c789daaf6f6c5e200c8ec419bc7e | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "CThreadSafeVariable.h"
#include "CJSONFormatSaver.h"
#include "CContainerOfLogicalDisk.h"
#include "CLogicalDiskInfo.h"
#include "CJSONFormatterLogicalDisk.h"
#include "CLogicalDiskInfoMonitoring.h"
#include "CEvent.h"
#include "CLogger/include/Log.h"
#include "CLogger/include/Log.h"
CL... | 23.29 | 69 | 0.756977 | ITA-Dnipro |
45422f2e483b066034093a7b203688966ccadddd | 543 | cpp | C++ | Problem Set Volumes/Volume 6/621 - Secret Research.cpp | Md-Shamim-Ahmmed/UVA-Online-Judge-Problems-Solution | 2334edb153a134aebb883b57d8b4faf0cb859331 | [
"MIT"
] | null | null | null | Problem Set Volumes/Volume 6/621 - Secret Research.cpp | Md-Shamim-Ahmmed/UVA-Online-Judge-Problems-Solution | 2334edb153a134aebb883b57d8b4faf0cb859331 | [
"MIT"
] | null | null | null | Problem Set Volumes/Volume 6/621 - Secret Research.cpp | Md-Shamim-Ahmmed/UVA-Online-Judge-Problems-Solution | 2334edb153a134aebb883b57d8b4faf0cb859331 | [
"MIT"
] | null | null | null | #include <cstring>
#include<iostream>
using namespace std;
void answer(string, int);
int main() {
int test_case;
cin >> test_case;
while (test_case--) {
string str;
cin >> str;
answer(str, str.size());
}
return 0;
}
void answer(string s, int len)
{
if (s == "1" || s == "4" || s == "78")
cout << "+\n";
... | 17.516129 | 52 | 0.473297 | Md-Shamim-Ahmmed |
45466a07500dbfe13410201bfdfb4ad7d7a7f595 | 955 | cpp | C++ | 26. Binary_search/main.cpp | mrlinuxbiswas/Data-Structures-College | 1a1ebbfc98ad2b39f01fc7a6c21a9a93c81147bf | [
"MIT"
] | null | null | null | 26. Binary_search/main.cpp | mrlinuxbiswas/Data-Structures-College | 1a1ebbfc98ad2b39f01fc7a6c21a9a93c81147bf | [
"MIT"
] | null | null | null | 26. Binary_search/main.cpp | mrlinuxbiswas/Data-Structures-College | 1a1ebbfc98ad2b39f01fc7a6c21a9a93c81147bf | [
"MIT"
] | null | null | null | //Binary search
#include <stdio.h>
int binarysearch(int a[], int n, int search)
{
int low=0,high=n-1,mid;
while(low<=high)
{
mid=(low+high)/2;
if(search>a[mid])
{
low=mid+1;
}
else if(search<a[mid])
{
high=mid-1;... | 18.72549 | 62 | 0.442932 | mrlinuxbiswas |
4546f151cb276f43cc17fa6ccad44a06fbd5d59c | 5,443 | cpp | C++ | Corba/OBLearn/src/3.pi/CRILogger_impl.cpp | codeworkscn/learn-cpp | c72b2330934bdead2489509cd89343e666e631b4 | [
"Apache-2.0"
] | null | null | null | Corba/OBLearn/src/3.pi/CRILogger_impl.cpp | codeworkscn/learn-cpp | c72b2330934bdead2489509cd89343e666e631b4 | [
"Apache-2.0"
] | null | null | null | Corba/OBLearn/src/3.pi/CRILogger_impl.cpp | codeworkscn/learn-cpp | c72b2330934bdead2489509cd89343e666e631b4 | [
"Apache-2.0"
] | null | null | null | // **********************************************************************
//
// Copyright (c) 2002
// IONA Technologies, Inc.
// Waltham, MA, USA
//
// All Rights Reserved
//
// **********************************************************************
#include <OB/CORBA.h>
#include <OB/PortableInterceptor.h>
#include <C... | 22.399177 | 80 | 0.586258 | codeworkscn |
454934b1025fbe5e7cb53753b22cf104a3fa23ed | 400 | hpp | C++ | libs/gfxtk_vulkan/src/gfxtk/backend/vulkan/PrimitiveTopology.hpp | NostalgicGhoul/gfxtk | 6662d6d1b285e20806ecfef3cdcb620d6605e478 | [
"BSD-2-Clause"
] | null | null | null | libs/gfxtk_vulkan/src/gfxtk/backend/vulkan/PrimitiveTopology.hpp | NostalgicGhoul/gfxtk | 6662d6d1b285e20806ecfef3cdcb620d6605e478 | [
"BSD-2-Clause"
] | null | null | null | libs/gfxtk_vulkan/src/gfxtk/backend/vulkan/PrimitiveTopology.hpp | NostalgicGhoul/gfxtk | 6662d6d1b285e20806ecfef3cdcb620d6605e478 | [
"BSD-2-Clause"
] | null | null | null | #ifndef GFXTK_BACKEND_VULKAN_PRIMITIVETOPOLOGY_HPP
#define GFXTK_BACKEND_VULKAN_PRIMITIVETOPOLOGY_HPP
#include <vulkan/vulkan.h>
#include <gfxtk/PrimitiveTopology.hpp>
namespace gfxtk::backend {
struct PrimitiveTopology {
static VkPrimitiveTopology convertToVkPrimitiveTopology(gfxtk::PrimitiveTopology pri... | 26.666667 | 108 | 0.8275 | NostalgicGhoul |
4549e12a832414305814971b367f5017994bc6dc | 6,294 | cpp | C++ | LilEngie/src/Core/Graphics/Renderer.cpp | Nordaj/LilEngie2 | 212820b95468bdad9ed57b24223619960a20ee06 | [
"MIT"
] | 1 | 2019-12-14T21:25:04.000Z | 2019-12-14T21:25:04.000Z | LilEngie/src/Core/Graphics/Renderer.cpp | Nordaj/LilEngie2 | 212820b95468bdad9ed57b24223619960a20ee06 | [
"MIT"
] | null | null | null | LilEngie/src/Core/Graphics/Renderer.cpp | Nordaj/LilEngie2 | 212820b95468bdad9ed57b24223619960a20ee06 | [
"MIT"
] | null | null | null | #define STB_IMAGE_IMPLEMENTATION
#include <stb/stb_image.h>
#include <Vendor/imgui/imgui.h>
#include <Core/Platform/Graphics/IGraphics.h>
#include <Core/Debug/Log.h>
#include <Core/Debug/DebugTimer.h>
#include <Core/Resources/ResourceManager.h>
#include <Core/Resources/Types/MeshResource.h>
#include <Core/Graph... | 24.585938 | 91 | 0.666349 | Nordaj |
454ed1e3bcb7a0a1b91467f2b8f6f69ad6909a30 | 1,891 | cpp | C++ | p2042.cpp | sjnov11/Baekjoon-Online-Judge | a95df8a62e181d86a97d0e8969d139a3dae2be74 | [
"MIT"
] | null | null | null | p2042.cpp | sjnov11/Baekjoon-Online-Judge | a95df8a62e181d86a97d0e8969d139a3dae2be74 | [
"MIT"
] | null | null | null | p2042.cpp | sjnov11/Baekjoon-Online-Judge | a95df8a62e181d86a97d0e8969d139a3dae2be74 | [
"MIT"
] | null | null | null | #include <iostream>
#include <map>
#include <vector>
#include <math.h>
using namespace std;
long long buildSegTree(vector<long long> &arr, vector<long long> &seg_tree, int node, int start, int end) {
if (start == end) {
return seg_tree[node] = arr[start];
}
else {
return seg_tree[node] = buildSegTree(arr, seg_... | 25.554054 | 162 | 0.571126 | sjnov11 |
4555abea94ac253bf7548e115c1cf343b972ba1d | 3,572 | cpp | C++ | matlab_functions/MatlabEXR/MatlabEXR/exrwrite.cpp | HajimeTaira/2D-3D-Semantics | e0c6ea4948a24de7b995e54f17647831fd362015 | [
"Apache-2.0"
] | 1 | 2019-12-27T06:11:14.000Z | 2019-12-27T06:11:14.000Z | matlab_functions/MatlabEXR/MatlabEXR/exrwrite.cpp | HajimeTaira/2D-3D-Semantics | e0c6ea4948a24de7b995e54f17647831fd362015 | [
"Apache-2.0"
] | null | null | null | matlab_functions/MatlabEXR/MatlabEXR/exrwrite.cpp | HajimeTaira/2D-3D-Semantics | e0c6ea4948a24de7b995e54f17647831fd362015 | [
"Apache-2.0"
] | null | null | null | /*
* MATLAB MEX function for writing EXR images.
*
* Only supports EXR images with half-precision floating-point data.
*
*/
#include "ImathBox.h"
#include "ImfRgba.h"
#include "ImfRgbaFile.h"
#include "ImfArray.h"
#include "ImfChannelList.h"
#include "ImfPixelType.h"
#include "Iex.h"
#include "mex.h"
#include... | 21.389222 | 78 | 0.618981 | HajimeTaira |
45586075a966167968bbe985051ea08c8ec8dd6a | 1,878 | cc | C++ | examples/caller/callUserService.cc | YuzeZhang/zRPC | de79fb499bfe28be7963cdf2102aed44b1e115cf | [
"MIT"
] | 1 | 2021-04-17T14:45:00.000Z | 2021-04-17T14:45:00.000Z | examples/caller/callUserService.cc | YuzeZhang/zRPC | de79fb499bfe28be7963cdf2102aed44b1e115cf | [
"MIT"
] | null | null | null | examples/caller/callUserService.cc | YuzeZhang/zRPC | de79fb499bfe28be7963cdf2102aed44b1e115cf | [
"MIT"
] | null | null | null | #include "zrpcApplication.h"
#include "user.pb.h"
#include <iostream>
int main(int argc, char **argv)
{
// 整个程序启动后，想使用zrpc框架来享受rpc服务调用，一定需要先调用框架的初始化函数（只初始化一次）
ZrpcApplication::Init(argc, argv);
// 演示调用远程发布的rpc方法Login
chat::UserServiceRpc_Stub stub(new ZrpcChannel());
// rpc方法的请求参数
chat::Login... | 26.828571 | 121 | 0.600639 | YuzeZhang |
455a2a0245e938423a200e05349ef06c9de87358 | 877 | cpp | C++ | SRC/nowcoder/wannafly23/C.cpp | YouDad/ACM | ac26e0b360267943af32692629d6c34e739ee70d | [
"MIT"
] | 2 | 2018-07-27T08:09:48.000Z | 2018-09-26T16:36:37.000Z | SRC/nowcoder/wannafly23/C.cpp | YouDad/ACM | ac26e0b360267943af32692629d6c34e739ee70d | [
"MIT"
] | null | null | null | SRC/nowcoder/wannafly23/C.cpp | YouDad/ACM | ac26e0b360267943af32692629d6c34e739ee70d | [
"MIT"
] | null | null | null | //https://www.nowcoder.com/acm/contest/161/C
#include<stdio.h>
const int mod=1e9+7,maxn=500005;
long long f[maxn],g[maxn],r[maxn],p[maxn];
int m[maxn],n,L,M,sum;
void solve(){
f[0]=1;g[0]=0;sum=0;
for(int i=1;i<=n;i++){
sum+=m[i];
for(int j=sum;~j;j--){
g[j]=g[j]*(mod+1-p[i])%mod;
... | 27.40625 | 54 | 0.432155 | YouDad |
45673d4340e2eeb8de9c140ae55c6883b1eb82eb | 296 | cpp | C++ | server/src/server.cpp | joaquinbf/TPFinalPortal | 27eed2d1c52297b810a4ad30a54f3267083b9c42 | [
"Apache-2.0"
] | null | null | null | server/src/server.cpp | joaquinbf/TPFinalPortal | 27eed2d1c52297b810a4ad30a54f3267083b9c42 | [
"Apache-2.0"
] | null | null | null | server/src/server.cpp | joaquinbf/TPFinalPortal | 27eed2d1c52297b810a4ad30a54f3267083b9c42 | [
"Apache-2.0"
] | null | null | null | #include "../include/server.h"
Server::Server(const char *port):
port(port) {
}
int Server::main() {
Accepter accepter(this->port);
accepter.start();
const char QUIT = 'q';
while (std::cin.get() != QUIT) {
}
accepter.stop();
accepter.join();
return 0;
}
| 14.095238 | 36 | 0.564189 | joaquinbf |
456c8b9a817dd4d7541b429540adcbbb3295ce18 | 1,631 | cpp | C++ | luogu/P5490.cpp | delphi122/knowledge_planet | e86cb8f9aa47ef8918cde0e814984a6535023c21 | [
"Apache-2.0"
] | 1 | 2020-07-24T03:07:08.000Z | 2020-07-24T03:07:08.000Z | luogu/P5490.cpp | delphi122/knowledge_planet | e86cb8f9aa47ef8918cde0e814984a6535023c21 | [
"Apache-2.0"
] | null | null | null | luogu/P5490.cpp | delphi122/knowledge_planet | e86cb8f9aa47ef8918cde0e814984a6535023c21 | [
"Apache-2.0"
] | null | null | null | //
// Created by yangtao on 19-12-6.
//
#include <cstdio>
#include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
inline int ls(int n ) {return n << 1;}
inline int rs(int n ) {return n << 1 | 1;}
struct L {
int x;
int y1, y2;
int state;
bool operator<(c... | 22.652778 | 60 | 0.455549 | delphi122 |
456d4d4b17d8c65f66f6b57517897b554a617967 | 263 | hpp | C++ | store.models/src/ioc/service_provider.hpp | once-ler/Store-cpp | 27d65057b2984c61a4b8be9d96d8fa6d70de1fb7 | [
"BSD-3-Clause"
] | 3 | 2019-08-18T19:14:02.000Z | 2019-09-20T05:38:58.000Z | store.models/src/ioc/service_provider.hpp | once-ler/Store-cpp | 27d65057b2984c61a4b8be9d96d8fa6d70de1fb7 | [
"BSD-3-Clause"
] | null | null | null | store.models/src/ioc/service_provider.hpp | once-ler/Store-cpp | 27d65057b2984c61a4b8be9d96d8fa6d70de1fb7 | [
"BSD-3-Clause"
] | 1 | 2019-09-20T05:39:01.000Z | 2019-09-20T05:39:01.000Z | #pragma once
#include "store.models/src/ioc/simple_container.hpp"
#include "store.common/src/singleton.hpp"
using namespace store::common;
namespace store {
namespace ioc {
auto ServiceProvider = Singleton<SimpleContainer>::Instance();
}
}
| 20.230769 | 67 | 0.714829 | once-ler |
456e08db1174a5156883a43b9d4efb30cf431c27 | 7,722 | cpp | C++ | CodeSnippets/stringRotation.cpp | Teabeans/CPP_Learn | a767dd323d67fab5c2baffb5aa6dd3f1e6baa35a | [
"MIT"
] | 1 | 2019-01-31T23:42:59.000Z | 2019-01-31T23:42:59.000Z | CodeSnippets/stringRotation.cpp | Teabeans/CPP_Learn | a767dd323d67fab5c2baffb5aa6dd3f1e6baa35a | [
"MIT"
] | null | null | null | CodeSnippets/stringRotation.cpp | Teabeans/CPP_Learn | a767dd323d67fab5c2baffb5aa6dd3f1e6baa35a | [
"MIT"
] | 1 | 2020-03-04T18:09:15.000Z | 2020-03-04T18:09:15.000Z | //-----------------------------------------------------------------------------|
// Authorship
//-----------------------------------------------------------------------------|
//
// Tim Lum
// twhlum@gmail.com
// Created: 2018.08.28
// Modified: 2018.08.29
//
/*
1.9 - StringRotation() - P.91
Assume you have a method ... | 31.390244 | 82 | 0.554908 | Teabeans |
45753089e2c6ecbe7ab8a03df461dc2d95305064 | 14,874 | cpp | C++ | src/main.cpp | CedricGuillemet/WFCTiles | 9bc4ab7a1d7c1264678ce7d0000d74178001b97d | [
"MIT"
] | null | null | null | src/main.cpp | CedricGuillemet/WFCTiles | 9bc4ab7a1d7c1264678ce7d0000d74178001b97d | [
"MIT"
] | null | null | null | src/main.cpp | CedricGuillemet/WFCTiles | 9bc4ab7a1d7c1264678ce7d0000d74178001b97d | [
"MIT"
] | null | null | null | #include <stdio.h>
#ifndef _MSC_VER
#include <unistd.h>
#endif
#include <string>
#include <vector>
#include <map>
#define STB_IMAGE_IMPLEMENTATION
#include "stb_image.h"
#define STB_IMAGE_WRITE_IMPLEMENTATION
#include "stb_image_write.h"
#include "Parameters.h"
#include <chrono>
typedef uint32_t Color;
typedef uint32_... | 28.439771 | 115 | 0.555869 | CedricGuillemet |
457841a0322a713e4de0ae12843dbc5bffab04ba | 1,101 | cpp | C++ | ext/mxx/test/test_scatter.cpp | tuan1225/parconnect_sc16 | bcd6f99101685d746cf30e22fa3c3f63ddd950c9 | [
"Apache-2.0"
] | 76 | 2015-09-28T22:06:07.000Z | 2022-03-25T17:47:34.000Z | ext/mxx/test/test_scatter.cpp | tuan1225/parconnect_sc16 | bcd6f99101685d746cf30e22fa3c3f63ddd950c9 | [
"Apache-2.0"
] | 23 | 2015-10-29T17:35:51.000Z | 2021-09-07T09:56:56.000Z | ext/mxx/test/test_scatter.cpp | tuan1225/parconnect_sc16 | bcd6f99101685d746cf30e22fa3c3f63ddd950c9 | [
"Apache-2.0"
] | 20 | 2015-10-29T17:18:01.000Z | 2021-05-12T16:41:20.000Z | /*
* Copyright 2015 Georgia Institute of Technology
*
* 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 applicab... | 24.466667 | 75 | 0.612171 | tuan1225 |
45791bcfe25b1d322e7251504c71f11ef0c14e01 | 4,344 | cpp | C++ | VMAReceiver.cpp | markos/transport | 14671631a7291359a4c1235f513ee4d54d089296 | [
"MIT"
] | null | null | null | VMAReceiver.cpp | markos/transport | 14671631a7291359a4c1235f513ee4d54d089296 | [
"MIT"
] | null | null | null | VMAReceiver.cpp | markos/transport | 14671631a7291359a4c1235f513ee4d54d089296 | [
"MIT"
] | null | null | null | #include <cassert>
#include <string>
#include <iostream>
#include <chrono>
#include <vector>
#include <thread>
#include <system_error>
#include <sys/socket.h>
#include <sys/epoll.h>
#include <arpa/inet.h>
#include <mellanox/vma_extra.h>
#include "common.h"
#include "utils.h"
#include "VMAReceiver.h"
using namespace ... | 31.028571 | 107 | 0.631906 | markos |
45818d7e7dc24d66cc57e3a2bf819e650574fe0a | 1,632 | cpp | C++ | prototype/plugins/image_blur.cpp | glshort/MapReady | c9065400a64c87be46418ab32e3a251ca2f55fd5 | [
"BSD-3-Clause"
] | 3 | 2017-12-31T05:33:28.000Z | 2021-07-28T01:51:22.000Z | prototype/plugins/image_blur.cpp | glshort/MapReady | c9065400a64c87be46418ab32e3a251ca2f55fd5 | [
"BSD-3-Clause"
] | null | null | null | prototype/plugins/image_blur.cpp | glshort/MapReady | c9065400a64c87be46418ab32e3a251ca2f55fd5 | [
"BSD-3-Clause"
] | 7 | 2017-04-26T18:18:33.000Z | 2020-05-15T08:01:09.000Z | /* ASF plugin: see static_type at bottom of file for author and purpose */
#include "asf/plugin.h"
#include "asf/image.h"
#include <math.h>
/* Plugin name */
#define self plugin_image_blur
class self : public asf::plugin_pixel_kernel {
asf::parameter_int *radius; /* Blurring radius, in pixels */
public:
ASF_plugin_... | 27.2 | 81 | 0.650123 | glshort |
45890ebf1c336c9994033550487fa7d808000a74 | 2,124 | cpp | C++ | examples/metal/invoke_on.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | examples/metal/invoke_on.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | examples/metal/invoke_on.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | // Copyright Carl Philipp Reh 2009 - 2018.
// 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)
//! [metal_invoke_on]
// In the following example, we are going to create a function that can
// t... | 16.857143 | 79 | 0.704802 | pmiddend |
458d3782a2130af08b637ba6d8ace39fa1dd831d | 329 | cpp | C++ | tests/arbitrage/arbitrage_tests.cpp | Avm07/Mindswap-limit-order-smart-contracts | 7059b8e1e9153c7a9269ee856d5b979ac82b513d | [
"MIT"
] | 3 | 2021-02-22T12:37:51.000Z | 2021-03-07T01:23:27.000Z | tests/arbitrage/arbitrage_tests.cpp | Avm07/Mindswap-limit-order-smart-contracts | 7059b8e1e9153c7a9269ee856d5b979ac82b513d | [
"MIT"
] | null | null | null | tests/arbitrage/arbitrage_tests.cpp | Avm07/Mindswap-limit-order-smart-contracts | 7059b8e1e9153c7a9269ee856d5b979ac82b513d | [
"MIT"
] | 1 | 2021-02-22T12:37:56.000Z | 2021-02-22T12:37:56.000Z | #include <arbitrage/suites/order_trade_tests.hpp>
#include <arbitrage/suites/pair_trade_tests.hpp>
#include <arbitrage/suites/close_tests.hpp>
#include <arbitrage/suites/on_transfer_tests.hpp>
#include <arbitrage/suites/open_tests.hpp>
#include <arbitrage/suites/validate_tests.hpp>
#include <arbitrage/suites/withdraw_t... | 47 | 49 | 0.832827 | Avm07 |
45937275c92b74472daffafd4b365c5fd0bb236d | 485 | cc | C++ | boj/cpp/2845.cc | maxtortime/algorithm | 6185b1b61e12bfbc5a3e87917f878e7a7902ea2f | [
"MIT"
] | 1 | 2017-10-29T14:58:13.000Z | 2017-10-29T14:58:13.000Z | boj/cpp/2845.cc | maxtortime/algorithm | 6185b1b61e12bfbc5a3e87917f878e7a7902ea2f | [
"MIT"
] | null | null | null | boj/cpp/2845.cc | maxtortime/algorithm | 6185b1b61e12bfbc5a3e87917f878e7a7902ea2f | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
// Writing your code...
int L, P;
int counts[5] = {};
cin >> L >> P;
int count = L * P;
for (int i = 0; i < 5; ++i) {
cin >> counts[i];
count... | 17.962963 | 41 | 0.447423 | maxtortime |
4593b9e3cc733a697d9c3388107a420d385c4560 | 3,496 | cc | C++ | kv/server/scheduler_client.cc | yunxiao3/eraft | d68d5dbe7007c4d9cac3238af4e6e78e48d9cb5f | [
"MIT"
] | 58 | 2021-05-20T12:56:54.000Z | 2022-03-28T03:45:25.000Z | kv/server/scheduler_client.cc | yunxiao3/eraft | d68d5dbe7007c4d9cac3238af4e6e78e48d9cb5f | [
"MIT"
] | 1 | 2022-01-25T04:40:20.000Z | 2022-01-28T05:43:30.000Z | kv/server/scheduler_client.cc | yunxiao3/eraft | d68d5dbe7007c4d9cac3238af4e6e78e48d9cb5f | [
"MIT"
] | 15 | 2021-05-20T12:56:57.000Z | 2022-03-14T20:35:58.000Z | // MIT License
// Copyright (c) 2021 eraft dev group
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify,... | 39.727273 | 80 | 0.716247 | yunxiao3 |
45965770b0ed846691d064d66d08a0612ec919ea | 1,534 | cc | C++ | busylib/base/poller_epoll.cc | busyluo/busylib | 98d6071ab78b5694683fcaf61ad9e8b687039a73 | [
"MIT"
] | 2 | 2019-05-27T07:54:34.000Z | 2019-07-31T09:28:57.000Z | busylib/base/poller_epoll.cc | busyluo/busylib | 98d6071ab78b5694683fcaf61ad9e8b687039a73 | [
"MIT"
] | null | null | null | busylib/base/poller_epoll.cc | busyluo/busylib | 98d6071ab78b5694683fcaf61ad9e8b687039a73 | [
"MIT"
] | null | null | null | #include <poll.h>
#include <sys/epoll.h>
#include <cstring>
#include <iostream>
#include "event.h"
#include "poller_epoll.h"
namespace busylib
{
PollerEpoll::PollerEpoll() { epollfd_ = epoll_create1(EPOLL_CLOEXEC); }
void PollerEpoll::addEvent(Event *ev)
{
struct epoll_event epollEvent;
epollEvent.events = ev->e... | 26 | 71 | 0.612125 | busyluo |
45971dc39c8296a8c94c05542561e6b46cb6ba41 | 638 | cpp | C++ | Lectures/Lec1/main.cpp | amirnn/Engineering-Mathematics | 99dd270dba8ca3357259afb9195a9136b33510d8 | [
"MIT"
] | null | null | null | Lectures/Lec1/main.cpp | amirnn/Engineering-Mathematics | 99dd270dba8ca3357259afb9195a9136b33510d8 | [
"MIT"
] | null | null | null | Lectures/Lec1/main.cpp | amirnn/Engineering-Mathematics | 99dd270dba8ca3357259afb9195a9136b33510d8 | [
"MIT"
] | null | null | null | #include <eigen3/Eigen/Dense>
#include <iostream>
int main(int argc, char const *argv[])
{
unsigned numberOfDays{20};
Eigen::Matrix3f model;
model << .5, .5, .25,
.25, 0, .25,
.25, .5, .5;
std::cout << "The model matrix is:\n" << model << std::endl;
Eigen::Vector3f tod... | 24.538462 | 116 | 0.514107 | amirnn |
4599a9548e25191d1275ad453f567be4131cc39a | 1,474 | cpp | C++ | url_schemes.cpp | Sonnix1/Qqsp | 77ce918e8c2f2bdde8ef389adca9e6b69624f572 | [
"MIT"
] | null | null | null | url_schemes.cpp | Sonnix1/Qqsp | 77ce918e8c2f2bdde8ef389adca9e6b69624f572 | [
"MIT"
] | null | null | null | url_schemes.cpp | Sonnix1/Qqsp | 77ce918e8c2f2bdde8ef389adca9e6b69624f572 | [
"MIT"
] | 1 | 2020-10-17T05:22:45.000Z | 2020-10-17T05:22:45.000Z | #include "url_schemes.h"
#include <QWebEngineUrlScheme>
static const QByteArray QspWebEngineUrlSchemeName = QByteArrayLiteral("qsp");
static const QByteArray QspExecWebEngineUrlSchemeName = QByteArrayLiteral("exec");
void register_url_schemes()
{
QWebEngineUrlScheme QspWebEngineUrlScheme(QspWebEngineUrlSchemeNam... | 54.592593 | 86 | 0.693351 | Sonnix1 |
45a7099d71ce8bf4e4e1574ba3d4012e9362e576 | 2,025 | cpp | C++ | test/tscreen.cpp | drypot/san-2.x | 44e626793b1dc50826ba0f276d5cc69b7c9ca923 | [
"MIT"
] | 5 | 2019-12-27T07:30:03.000Z | 2020-10-13T01:08:55.000Z | test/tscreen.cpp | drypot/san-2.x | 44e626793b1dc50826ba0f276d5cc69b7c9ca923 | [
"MIT"
] | null | null | null | test/tscreen.cpp | drypot/san-2.x | 44e626793b1dc50826ba0f276d5cc69b7c9ca923 | [
"MIT"
] | 1 | 2020-07-27T22:36:40.000Z | 2020-07-27T22:36:40.000Z | /*
95.10.10
*/
#include <pub\config.hpp>
#include <pub\common.hpp>
#pragma hdrstop
#include <vio\textwin.hpp>
#include <key\key.hpp>
void Pause()
{
KeyWaitMake();
KeyDiscard();
}
void TestVio()
{
Pause();
VioFill(0);
Pause();
VioFill(0xAA);
Pause();
}
void TestTe... | 15.225564 | 53 | 0.500741 | drypot |
45ae5c2b7b95335c8404bd5997a3b9f08fd9ed77 | 18,621 | cpp | C++ | source/project_test/test22/test22_main.cpp | bluebackblue/brownie | 917fcc71e5b0a807c0a8dab22a9ca7f3b0d60917 | [
"MIT"
] | null | null | null | source/project_test/test22/test22_main.cpp | bluebackblue/brownie | 917fcc71e5b0a807c0a8dab22a9ca7f3b0d60917 | [
"MIT"
] | null | null | null | source/project_test/test22/test22_main.cpp | bluebackblue/brownie | 917fcc71e5b0a807c0a8dab22a9ca7f3b0d60917 | [
"MIT"
] | null | null | null |
/**
* Copyright (c) blueback
* Released under the MIT License
* https://github.com/bluebackblue/brownie/blob/master/LICENSE.txt
* http://bbbproject.sakura.ne.jp/wordpress/mitlicense
* @brief テスト。
*/
/** include
*/
#pragma warning(push)
#pragma warning(disable:4464)
#include "../entry.h"
#pragm... | 29.232339 | 210 | 0.688953 | bluebackblue |
45b04683935b0377f788a7379e6eeba97f3bab2f | 1,265 | cpp | C++ | Source/SteamBaseImpl.cpp | Nothing4You/OpenSteamClient | 47369326b2f0773e2cfbb407d1257a43b38ddf49 | [
"MIT"
] | 24 | 2015-02-16T10:05:19.000Z | 2022-02-06T10:22:34.000Z | Source/SteamBaseImpl.cpp | Nothing4You/OpenSteamClient | 47369326b2f0773e2cfbb407d1257a43b38ddf49 | [
"MIT"
] | 6 | 2015-08-14T08:37:58.000Z | 2018-06-18T11:17:46.000Z | Source/SteamBaseImpl.cpp | Nothing4You/OpenSteamClient | 47369326b2f0773e2cfbb407d1257a43b38ddf49 | [
"MIT"
] | 6 | 2015-04-02T13:58:21.000Z | 2021-05-05T11:37:48.000Z | #include "SteamBaseImpl.hpp"
#include "Messages/MsgProto.hpp"
#include "Protobufs/steammessages_clientserver.pb.h"
namespace Sc
{
SteamBaseImpl::SteamBaseImpl(SteamClient::Impl *client)
{
m_client = client;
m_steamId = 0;
m_loggedIn = false;
m_sessionId = 0;
m_client->OnMessage.Add([this](const MessageEve... | 18.602941 | 64 | 0.704348 | Nothing4You |
45b16483011d5103a9e4b54ab03237424dca9984 | 5,787 | cpp | C++ | mlir/qir_qrt/qir-qis-ms-compat.cpp | amirebrahimi/qcor | 1345cc04e7871105e1a251a1714dd9ce19a5f646 | [
"BSD-3-Clause"
] | null | null | null | mlir/qir_qrt/qir-qis-ms-compat.cpp | amirebrahimi/qcor | 1345cc04e7871105e1a251a1714dd9ce19a5f646 | [
"BSD-3-Clause"
] | null | null | null | mlir/qir_qrt/qir-qis-ms-compat.cpp | amirebrahimi/qcor | 1345cc04e7871105e1a251a1714dd9ce19a5f646 | [
"BSD-3-Clause"
] | null | null | null | #include "qir-qrt.hpp"
#include "qir-qrt-ms-compat.hpp"
#include <iostream>
// QRT QIS (quantum instructions) implementation for MSFT Compatability
extern "C" {
void __quantum__qis__exp__body(Array *paulis, double angle, Array *qubits) {
// TODO
if (verbose)
std::cout << "CALL: " << __PRETTY_FUNCTION__ << "\n"... | 28.092233 | 79 | 0.63107 | amirebrahimi |
45b30184163949ae2af23320e18fe923c464bcf1 | 6,211 | hh | C++ | hackt_docker/hackt/src/AST/formal.hh | broken-wheel/hacktist | 36e832ae7dd38b27bca9be7d0889d06054dc2806 | [
"MIT"
] | null | null | null | hackt_docker/hackt/src/AST/formal.hh | broken-wheel/hacktist | 36e832ae7dd38b27bca9be7d0889d06054dc2806 | [
"MIT"
] | null | null | null | hackt_docker/hackt/src/AST/formal.hh | broken-wheel/hacktist | 36e832ae7dd38b27bca9be7d0889d06054dc2806 | [
"MIT"
] | null | null | null | /**
\file "AST/formal.hh"
Definition-formal-related parser classes for HAC.
$Id: formal.hh,v 1.4 2009/10/02 01:56:33 fang Exp $
This file used to be the following before it was renamed:
Id: art_parser_formal.h,v 1.14.40.1 2005/12/11 00:45:07 fang Exp
*/
#ifndef __HAC_AST_FORMAL_H__
#define __HAC_AST_FORMAL_H__... | 25.35102 | 79 | 0.674771 | broken-wheel |
45c25fa22846c297c22181c6dd8df70cf9db0d2c | 464 | hpp | C++ | board.hpp | zoembrown/snake | dfd367568c297225be0decfb9821633f05eb2695 | [
"MIT"
] | null | null | null | board.hpp | zoembrown/snake | dfd367568c297225be0decfb9821633f05eb2695 | [
"MIT"
] | null | null | null | board.hpp | zoembrown/snake | dfd367568c297225be0decfb9821633f05eb2695 | [
"MIT"
] | null | null | null | #ifndef board_hpp
#define board_hpp
#include "apple.hpp"
#include "snake.hpp"
#include <iostream>
#include <ncurses.h>
#include <unistd.h>
#include <vector>
class Board{
private:
int height;
int width;
std::vector<std::vector<char> > board_lst;
public:
Board();
~Board();
//void update(Snake our_hero);... | 15.466667 | 44 | 0.69181 | zoembrown |
45c28ea19f6d98b9e90d339aa5bf61573fb13cdd | 325 | cpp | C++ | 762.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 8 | 2018-10-31T11:00:19.000Z | 2020-07-31T05:25:06.000Z | 762.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | null | null | null | 762.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 2 | 2018-05-31T11:29:22.000Z | 2019-09-11T06:34:40.000Z | class Solution {
public:
int countPrimeSetBits(int l, int r) {
set<int> p= {2, 3, 5, 7, 11, 13, 17, 19};
int ans = 0;
for (int i = l; i <= r; i++) {
int sb = 0;
for (int n = i; n; n >>= 1) sb += n & 1;
ans += p.count(sb);
}
return ans;
... | 23.214286 | 52 | 0.384615 | zfang399 |
45c5c3f1e4cfe3bdb3f6a2ab81eef750610175e6 | 1,012 | cpp | C++ | test/unit-tests/event/controller_device_event_test.cpp | twantonie/centurion | 198b80f9e8a29da2ae7d3c15e48ffa1a046165c3 | [
"MIT"
] | 126 | 2020-12-05T00:05:56.000Z | 2022-03-30T15:15:03.000Z | test/unit-tests/event/controller_device_event_test.cpp | twantonie/centurion | 198b80f9e8a29da2ae7d3c15e48ffa1a046165c3 | [
"MIT"
] | 46 | 2020-12-27T14:25:22.000Z | 2022-01-26T13:58:11.000Z | test/unit-tests/event/controller_device_event_test.cpp | twantonie/centurion | 198b80f9e8a29da2ae7d3c15e48ffa1a046165c3 | [
"MIT"
] | 13 | 2021-01-20T20:50:18.000Z | 2022-03-25T06:59:03.000Z | #include <gtest/gtest.h>
#include "events/event.hpp"
TEST(ControllerDeviceEvent, Defaults)
{
cen::controller_device_event event;
ASSERT_GT(event.time(), 0u);
ASSERT_EQ(cen::event_type::controller_device_added, event.type());
}
TEST(ControllerDeviceEvent, Constructors)
{
ASSERT_NO_THROW(cen::controller_device... | 21.531915 | 68 | 0.755929 | twantonie |
45c67372983fc12e5175a1253f954dcd46fb980c | 619 | cpp | C++ | SerialPrograms/Source/CommonFramework/Globals.cpp | ercdndrs/Arduino-Source | c0490f0f06aaa38759aa8f11def9e1349e551679 | [
"MIT"
] | null | null | null | SerialPrograms/Source/CommonFramework/Globals.cpp | ercdndrs/Arduino-Source | c0490f0f06aaa38759aa8f11def9e1349e551679 | [
"MIT"
] | null | null | null | SerialPrograms/Source/CommonFramework/Globals.cpp | ercdndrs/Arduino-Source | c0490f0f06aaa38759aa8f11def9e1349e551679 | [
"MIT"
] | null | null | null | /* Globals
*
* From: https://github.com/PokemonAutomation/Arduino-Source
*
*/
#include "Globals.h"
namespace PokemonAutomation{
const QString VERSION = "v0.6.6";
const QString DISCORD_LINK = "discord.gg/PokemonAutomation";
const QString DISCORD_LINK_URL = "https://discord.gg/cQ4gWxN";
const QStr... | 24.76 | 84 | 0.722132 | ercdndrs |
68f7b5d69dd35438aaa22a5409e9bae7f68db03e | 1,624 | cpp | C++ | Training/39.comehome.cpp | felikjunvianto/kfile-usaco-submissions | d4afdc0cbde7e19f09afc70c4b02d4bc5992696d | [
"MIT"
] | null | null | null | Training/39.comehome.cpp | felikjunvianto/kfile-usaco-submissions | d4afdc0cbde7e19f09afc70c4b02d4bc5992696d | [
"MIT"
] | null | null | null | Training/39.comehome.cpp | felikjunvianto/kfile-usaco-submissions | d4afdc0cbde7e19f09afc70c4b02d4bc5992696d | [
"MIT"
] | null | null | null | /*
ID: felikju1
PROG: comehome
LANG: C++
*/
#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
b... | 18.883721 | 85 | 0.576355 | felikjunvianto |
68f82d945ebf81ebbbe044f84c6dd9404f273b6f | 3,617 | cpp | C++ | remodet_repository_wdh_part/src/caffe/mask/kps_label_layer.cpp | UrwLee/Remo_experience | a59d5b9d6d009524672e415c77d056bc9dd88c72 | [
"MIT"
] | null | null | null | remodet_repository_wdh_part/src/caffe/mask/kps_label_layer.cpp | UrwLee/Remo_experience | a59d5b9d6d009524672e415c77d056bc9dd88c72 | [
"MIT"
] | null | null | null | remodet_repository_wdh_part/src/caffe/mask/kps_label_layer.cpp | UrwLee/Remo_experience | a59d5b9d6d009524672e415c77d056bc9dd88c72 | [
"MIT"
] | null | null | null | #include <vector>
#include "caffe/mask/kps_label_layer.hpp"
namespace caffe {
template <typename Dtype>
KpsLabelLayer<Dtype>::KpsLabelLayer(const LayerParameter& param): Layer<Dtype>(param) {
const KpsGenParameter& kps_gen_param = this->layer_param_.kps_gen_param();
resized_height_ = kps_gen_param.resized_height(... | 32.585586 | 95 | 0.543821 | UrwLee |
ec02d56bb25dcfef6ef5573e2aa8729cb9f990f7 | 340 | cpp | C++ | trees/interviewbit/Root to leaf/Min Depth Of Binary Tree.cpp | ankithans/dsa | 32aeeff1b4eeebcc8c18fdb1b95ee1dd123f8443 | [
"MIT"
] | 1 | 2021-09-16T07:01:46.000Z | 2021-09-16T07:01:46.000Z | trees/interviewbit/Root to leaf/Min Depth Of Binary Tree.cpp | ankithans/dsa | 32aeeff1b4eeebcc8c18fdb1b95ee1dd123f8443 | [
"MIT"
] | null | null | null | trees/interviewbit/Root to leaf/Min Depth Of Binary Tree.cpp | ankithans/dsa | 32aeeff1b4eeebcc8c18fdb1b95ee1dd123f8443 | [
"MIT"
] | 1 | 2021-10-19T06:48:48.000Z | 2021-10-19T06:48:48.000Z | int minDepthHelper(TreeNode* root, int depth) {
if(!root) return INT_MAX;
if(!root->left && !root->right) return depth+1;
int left = minDepthHelper(root->left, depth);
int right = minDepthHelper(root->right, depth);
return min(left, right) + 1;
}
int Solution::minDepth(TreeNode* A) {
return minD... | 30.909091 | 51 | 0.664706 | ankithans |
ec08ce8e1e0d8ffe892f28d3087bccd1cc153264 | 563 | hpp | C++ | sources/CastlesStrategy/Server/Map/Route.hpp | KonstantinTomashevich/castles-strategy | 5e57119ba7701e0f1f9c8d84ffb45abb6ad33a21 | [
"MIT"
] | null | null | null | sources/CastlesStrategy/Server/Map/Route.hpp | KonstantinTomashevich/castles-strategy | 5e57119ba7701e0f1f9c8d84ffb45abb6ad33a21 | [
"MIT"
] | null | null | null | sources/CastlesStrategy/Server/Map/Route.hpp | KonstantinTomashevich/castles-strategy | 5e57119ba7701e0f1f9c8d84ffb45abb6ad33a21 | [
"MIT"
] | null | null | null | #pragma once
#include <Urho3D/Container/Vector.h>
#include <Urho3D/Math/Vector2.h>
#include <Urho3D/Resource/XMLElement.h>
namespace CastlesStrategy
{
class Route
{
public:
explicit Route (const Urho3D::PODVector <Urho3D::Vector2> &waypoints);
Route (const Route &another);
virtual ~Route ();
const Urh... | 24.478261 | 74 | 0.724689 | KonstantinTomashevich |
ec15f7cb0e0f335bb6def39e040b0a2b3e0dd5fc | 326 | cpp | C++ | src/main/cpp/pistis/concurrent/BlockingMode.cpp | tomault/pistis-concurrent | ce3206feb3ca42468e35f6d276cd1871c0f9133f | [
"Apache-2.0"
] | null | null | null | src/main/cpp/pistis/concurrent/BlockingMode.cpp | tomault/pistis-concurrent | ce3206feb3ca42468e35f6d276cd1871c0f9133f | [
"Apache-2.0"
] | null | null | null | src/main/cpp/pistis/concurrent/BlockingMode.cpp | tomault/pistis-concurrent | ce3206feb3ca42468e35f6d276cd1871c0f9133f | [
"Apache-2.0"
] | null | null | null | #include "BlockingMode.hpp"
using namespace pistis::concurrent;
std::ostream& operator<<(std::ostream& out, BlockingMode mode) {
if (mode == BlockingMode::BLOCK) {
return out << "BLOCK";
} else if (mode == BlockingMode::DONT_BLOCK) {
return out << "DONT_BLOCK";
} else {
return out << "**UNKNOWN**";
... | 23.285714 | 64 | 0.634969 | tomault |
ec182992741a57bf6e8f68ee81762b2607202c12 | 1,370 | hpp | C++ | test/test-util-avx512.hpp | tgonzalez89-intel/hexl | 352e9ed14cb615defa33e4768d156eea3413361a | [
"Apache-2.0"
] | 136 | 2021-03-26T15:24:31.000Z | 2022-03-30T07:50:15.000Z | test/test-util-avx512.hpp | tgonzalez89-intel/hexl | 352e9ed14cb615defa33e4768d156eea3413361a | [
"Apache-2.0"
] | 24 | 2021-04-03T06:10:47.000Z | 2022-03-24T03:34:50.000Z | test/test-util-avx512.hpp | tgonzalez89-intel/hexl | 352e9ed14cb615defa33e4768d156eea3413361a | [
"Apache-2.0"
] | 27 | 2021-04-01T07:50:11.000Z | 2022-03-22T00:54:23.000Z | // Copyright (C) 2020-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#pragma once
#include <limits>
#include <vector>
#include "hexl/logging/logging.hpp"
#include "hexl/util/check.hpp"
#include "test-util.hpp"
#include "util/avx512-util.hpp"
namespace intel {
namespace hexl {
#ifdef HEXL_HAS_AVX512D... | 29.148936 | 80 | 0.733577 | tgonzalez89-intel |
ec1adca9f8d3fc9ba82a4a36eee930b973a7ff67 | 16,571 | cpp | C++ | Master-Code/spike/info/ctwmcmc/ctwmcmc_mx.cpp | joaodornas/random-code | 8db8cbccab674c4b77efaed86086dc6a99e5b9a1 | [
"Apache-2.0"
] | 1 | 2021-01-13T05:01:59.000Z | 2021-01-13T05:01:59.000Z | Master-Code/spike/info/ctwmcmc/ctwmcmc_mx.cpp | joaodornas/random-code | 8db8cbccab674c4b77efaed86086dc6a99e5b9a1 | [
"Apache-2.0"
] | null | null | null | Master-Code/spike/info/ctwmcmc/ctwmcmc_mx.cpp | joaodornas/random-code | 8db8cbccab674c4b77efaed86086dc6a99e5b9a1 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2010, Weill Medical College of Cornell University
* All rights reserved.
*
* This software is distributed WITHOUT ANY WARRANTY
* under license "license.txt" included with distribution and
* at http://neurodatabase.org/src/license.
*/
/** @file
* @brief Supports ctwmcmc method gateway routin... | 36.5 | 142 | 0.683544 | joaodornas |
ec1aff86793fc1fd1ac972dc059d68d86d1a2795 | 94 | cpp | C++ | tests/test_class/derived.cpp | inlinechan/stags | 9c1ce3ad4bf5d387c0b41482192d3d05ee96ef3a | [
"BSD-2-Clause"
] | null | null | null | tests/test_class/derived.cpp | inlinechan/stags | 9c1ce3ad4bf5d387c0b41482192d3d05ee96ef3a | [
"BSD-2-Clause"
] | 1 | 2016-01-08T08:12:19.000Z | 2016-01-08T08:12:19.000Z | tests/test_modified/derived.cpp | inlinechan/stags | 9c1ce3ad4bf5d387c0b41482192d3d05ee96ef3a | [
"BSD-2-Clause"
] | null | null | null | #include "derived.h"
void Derived::method1(const char* param)
{
Base::method1(param);
}
| 11.75 | 40 | 0.670213 | inlinechan |
ec1b282d965c6f460a7b749a62ee46e8b3574262 | 22,338 | cpp | C++ | src/text/Font.cpp | KeinR/Nafy | b576a08b028cff00a7cb02331699dc8b2fecf3bf | [
"MIT"
] | null | null | null | src/text/Font.cpp | KeinR/Nafy | b576a08b028cff00a7cb02331699dc8b2fecf3bf | [
"MIT"
] | null | null | null | src/text/Font.cpp | KeinR/Nafy | b576a08b028cff00a7cb02331699dc8b2fecf3bf | [
"MIT"
] | null | null | null | #include "Font.h"
#include <iostream>
#include <cmath>
// Our own custom implementation of a newline,
// because fonts generally represent newlines as
// nul characters
constexpr unsigned int newline = -1;
// Round 26.6 fractional pixels off to 32 bit integers
inline static int rto32(int v26_6) {
return (v26_6 >... | 39.327465 | 202 | 0.567195 | KeinR |
ec1b86ed7474c261586590812c7e7d00358e8d88 | 991 | cpp | C++ | c++/gray_code.cpp | SongZhao/leetcode | 4a2b4f554e91f6a2167b336f8a69b80fa9f3f920 | [
"Apache-2.0"
] | null | null | null | c++/gray_code.cpp | SongZhao/leetcode | 4a2b4f554e91f6a2167b336f8a69b80fa9f3f920 | [
"Apache-2.0"
] | null | null | null | c++/gray_code.cpp | SongZhao/leetcode | 4a2b4f554e91f6a2167b336f8a69b80fa9f3f920 | [
"Apache-2.0"
] | null | null | null | /*
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.
For example, given n = 2, return [0,1,3,2]. Its gray code sequence ... | 22.522727 | 154 | 0.63774 | SongZhao |
ec1c452f6c42cecc97bac0d00ef2c2ba1ec1aef1 | 2,795 | hxx | C++ | include/collision_solves.hxx | ShpakovNikita/Clorine-5 | e7c04decf531e31136639e9df20788f6d979b494 | [
"MIT"
] | 2 | 2018-08-08T07:38:59.000Z | 2018-08-21T19:02:47.000Z | include/collision_solves.hxx | ShpakovNikita/Chlorine-5 | e7c04decf531e31136639e9df20788f6d979b494 | [
"MIT"
] | null | null | null | include/collision_solves.hxx | ShpakovNikita/Chlorine-5 | e7c04decf531e31136639e9df20788f6d979b494 | [
"MIT"
] | null | null | null | /*
* Collision solve algorithms. They are supplied outside the CHL engine.
*/
#pragma once
#include "engine.hxx"
#include "game_functions.hxx"
void solve_dynamic_to_dynamic_collision_fast(CHL::instance* one,
CHL::instance* two,
... | 25.409091 | 72 | 0.472272 | ShpakovNikita |
ec21e96001719d7101de0f53b55d66458e108dde | 656 | cpp | C++ | Giga_v1/KDInterThreadData.cpp | KORRDET/Giga-Project | 7716776da7bda7eb9a0f9827ca499b5995cbdbab | [
"MIT"
] | null | null | null | Giga_v1/KDInterThreadData.cpp | KORRDET/Giga-Project | 7716776da7bda7eb9a0f9827ca499b5995cbdbab | [
"MIT"
] | null | null | null | Giga_v1/KDInterThreadData.cpp | KORRDET/Giga-Project | 7716776da7bda7eb9a0f9827ca499b5995cbdbab | [
"MIT"
] | null | null | null | #include <Arduino.h>
#include "KDInterThreadData.hpp"
#include "KDSharedObjects.hpp"
void KDInterThreadData::read(VectorXY_t *vector ,unsigned long *timeStamp)
{
if(isHold)
{
*vector = pastVector;
*timeStamp = pastTimeStamp;
return;
}
isHold = true;
*vector = {(int)this->x,(int)t... | 21.866667 | 74 | 0.635671 | KORRDET |
ec23efc85308e13bec5dcc9f9532edef72860079 | 711 | hpp | C++ | vendor/sll/include/sll/matrix_pds_tridiag.hpp | gyselax/gyselalibxx | 5f9b4b1e20050f87e2a9f05d510bedf0f9a15b34 | [
"MIT"
] | 3 | 2022-02-28T08:47:07.000Z | 2022-03-01T10:29:08.000Z | vendor/sll/include/sll/matrix_pds_tridiag.hpp | gyselax/gyselalibxx | 5f9b4b1e20050f87e2a9f05d510bedf0f9a15b34 | [
"MIT"
] | null | null | null | vendor/sll/include/sll/matrix_pds_tridiag.hpp | gyselax/gyselalibxx | 5f9b4b1e20050f87e2a9f05d510bedf0f9a15b34 | [
"MIT"
] | null | null | null | #ifndef MATRIX_PDS_BANDED_H
#define MATRIX_PDS_BANDED_H
#include <memory>
#include "sll/matrix.hpp"
class Matrix_PDS_Tridiag : public Matrix
{
/*
* Represents a real symmetric positive definite matrix
* stored in a block format
* */
public:
Matrix_PDS_Tridiag(int n);
virtual double get_ele... | 26.333333 | 96 | 0.724332 | gyselax |
ec252ec362a900c08f344ebb26f318fb1efb157e | 1,160 | cpp | C++ | source/AsioExpress/ClientServer/RoundRobinServer.cpp | suhao/asioexpress | 2f3453465934afdcdf4a575a2d933d86929b23c7 | [
"BSL-1.0"
] | null | null | null | source/AsioExpress/ClientServer/RoundRobinServer.cpp | suhao/asioexpress | 2f3453465934afdcdf4a575a2d933d86929b23c7 | [
"BSL-1.0"
] | null | null | null | source/AsioExpress/ClientServer/RoundRobinServer.cpp | suhao/asioexpress | 2f3453465934afdcdf4a575a2d933d86929b23c7 | [
"BSL-1.0"
] | null | null | null | // Copyright Ross MacGregor 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)
#include "AsioExpress/pch.hpp"
#include "AsioExpress/ClientServer/RoundRobinServer.hpp"
namespace Asio... | 24.680851 | 70 | 0.667241 | suhao |
ec274b3ba08cf25f4038ed8844d8653fe5fb99aa | 11,602 | hpp | C++ | subprojects/ufjfmltk-core/include/ufjfmltk/core/Sampling.hpp | DCC-UFJF/UFJF-MLTK | bb0696a5ec41e8a2b89be2a2d4e35b39fdcb85f2 | [
"MIT"
] | null | null | null | subprojects/ufjfmltk-core/include/ufjfmltk/core/Sampling.hpp | DCC-UFJF/UFJF-MLTK | bb0696a5ec41e8a2b89be2a2d4e35b39fdcb85f2 | [
"MIT"
] | null | null | null | subprojects/ufjfmltk-core/include/ufjfmltk/core/Sampling.hpp | DCC-UFJF/UFJF-MLTK | bb0696a5ec41e8a2b89be2a2d4e35b39fdcb85f2 | [
"MIT"
] | null | null | null |
#pragma once
#include "Data.hpp"
#include "DistanceMetric.hpp"
#include <random>
namespace mltk{
template < typename T >
class DSM{
size_t seed{};
size_t n_dims{}, k{};
double alpha{};
Point<double> labels;
std::vector<std::vector<size_t>> subspaces;
public:
... | 39.063973 | 137 | 0.492846 | DCC-UFJF |
ec2ea14094c6eb7dc7fd775ff1a6f49d29b659f1 | 692 | cpp | C++ | example/simple/discard.cpp | HungMingWu/xynet | 2b1680764b87546a4b64ab295062630a8b54cc29 | [
"MIT"
] | 71 | 2020-05-01T01:50:03.000Z | 2022-03-31T14:45:33.000Z | example/simple/discard.cpp | HungMingWu/xynet | 2b1680764b87546a4b64ab295062630a8b54cc29 | [
"MIT"
] | 4 | 2020-05-07T21:27:31.000Z | 2020-10-03T05:37:43.000Z | example/simple/discard.cpp | HungMingWu/xynet | 2b1680764b87546a4b64ab295062630a8b54cc29 | [
"MIT"
] | 13 | 2020-05-06T04:16:54.000Z | 2022-03-04T13:00:36.000Z | #include "common/server.h"
#include "xynet/buffer.h"
#include <span>
using namespace std;
using namespace xynet;
inline constexpr static const uint16_t DISCARD_PORT = 2009;
inline constexpr static const size_t NULL_BUFFER_SIZE = 4096;
auto get_null_buffer_span()
{
static array<byte, NULL_BUFFER_SIZE> null_buffe... | 19.771429 | 63 | 0.702312 | HungMingWu |
ec308f13166f6c2ef9cac571a604097b0cbccdbe | 2,562 | cpp | C++ | test/strong_typedef/operations.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | test/strong_typedef/operations.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | test/strong_typedef/operations.cpp | pmiddend/fcppt | 9f437acbb10258e6df6982a550213a05815eb2be | [
"BSL-1.0"
] | null | null | null | // Copyright Carl Philipp Reh 2009 - 2018.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <fcppt/make_strong_typedef.hpp>
#include <fcppt/strong_typedef_impl.hpp>
#include <fcppt/... | 9.249097 | 61 | 0.587822 | pmiddend |
ec35b0df07cd0287aa7e2c7c2339e35e6b288a34 | 502 | cpp | C++ | Algorithm/0303 (Easy)Range Sum Query - Immutable/Brute-Force.cpp | ZexinLi0w0/LeetCode | cf3988620ccdcc3d54b9beafd04c517c96f01bb9 | [
"MIT"
] | 1 | 2020-12-03T10:10:15.000Z | 2020-12-03T10:10:15.000Z | Algorithm/0303 (Easy)Range Sum Query - Immutable/Brute-Force.cpp | ZexinLi0w0/LeetCode | cf3988620ccdcc3d54b9beafd04c517c96f01bb9 | [
"MIT"
] | null | null | null | Algorithm/0303 (Easy)Range Sum Query - Immutable/Brute-Force.cpp | ZexinLi0w0/LeetCode | cf3988620ccdcc3d54b9beafd04c517c96f01bb9 | [
"MIT"
] | null | null | null | class NumArray {
private:
vector<int> num;
public:
NumArray(vector<int>& nums) {
for(int i = 0; i < nums.size(); i++)
this->num.push_back(nums[i]);
}
int sumRange(int i, int j) {
int sum = 0;
for(int pos = i; pos <= j; pos++)
sum += this->num[pos... | 20.916667 | 64 | 0.523904 | ZexinLi0w0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.