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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
710333d9b59b7b7c45ae70aa97ed0921c00c7e97 | 1,332 | cpp | C++ | src/fps_ros_bridge/fps_tracker_client_node.cpp | Lab-RoCoCo/fps_mapper | 376e557c8f5012e05187fe85ee3f4044f99f944a | [
"BSD-3-Clause"
] | 1 | 2017-12-01T14:57:16.000Z | 2017-12-01T14:57:16.000Z | src/fps_ros_bridge/fps_tracker_client_node.cpp | Lab-RoCoCo/fps_mapper | 376e557c8f5012e05187fe85ee3f4044f99f944a | [
"BSD-3-Clause"
] | null | null | null | src/fps_ros_bridge/fps_tracker_client_node.cpp | Lab-RoCoCo/fps_mapper | 376e557c8f5012e05187fe85ee3f4044f99f944a | [
"BSD-3-Clause"
] | null | null | null | #include "fps_mapper/RichPointMsg.h"
#include "fps_mapper/StampedCloudMsg.h"
#include <ros/ros.h>
#include "txt_io/message_writer.h"
#include "tf/transform_listener.h"
#include "fps_ros_msgs.h"
using namespace fps_mapper;
using namespace std;
txt_io::MessageWriter writer;
tf::TransformListener* _listener = 0;
voi... | 27.183673 | 155 | 0.70045 | Lab-RoCoCo |
710d1f47b82a57c1befddff0bda5eb106beeeb1a | 240 | cpp | C++ | bitwise/bitwiseQs4.cpp | rrishabhj/ALGORITHM | a5204575b2e7417b5f5e1243687179294fdca290 | [
"MIT"
] | null | null | null | bitwise/bitwiseQs4.cpp | rrishabhj/ALGORITHM | a5204575b2e7417b5f5e1243687179294fdca290 | [
"MIT"
] | null | null | null | bitwise/bitwiseQs4.cpp | rrishabhj/ALGORITHM | a5204575b2e7417b5f5e1243687179294fdca290 | [
"MIT"
] | null | null | null | /* Detect if two integers have opposite signs */
#include<iostream>
#include<stdio.h>
using namespace std;
bool checkOppositeSign(int a, int b){
return ( (a^b) < 0);
}
int main()
{
cout<<checkOppositeSign(3,-4)<<endl;
return(0);
}
| 15 | 48 | 0.666667 | rrishabhj |
711020af09a3f06b18191dc1e7c0b122afa1cf7f | 4,088 | cpp | C++ | src/plugin/xlog/xlog.cpp | willenchou/xservers | 0f8b262571ed7c0465d90ef807a9a540e97de379 | [
"Apache-2.0"
] | 11 | 2016-12-11T02:17:58.000Z | 2021-11-24T03:27:01.000Z | src/plugin/xlog/xlog.cpp | willenchou/xservers | 0f8b262571ed7c0465d90ef807a9a540e97de379 | [
"Apache-2.0"
] | null | null | null | src/plugin/xlog/xlog.cpp | willenchou/xservers | 0f8b262571ed7c0465d90ef807a9a540e97de379 | [
"Apache-2.0"
] | 2 | 2016-12-11T10:48:00.000Z | 2021-07-10T07:10:55.000Z | #include "xlog.h"
#ifdef OS_WIN
#include <windows.h>
#endif
#include <include/xservice_intf.h>
namespace x {
LogService* _logService = new LogService();
LogIocService* _logIocService = new LogIocService();
LogMngService* _logMngService = new LogMngService();
LogService::LogService(){
isSync_ = true;
level_ = LOG_L... | 18.497738 | 85 | 0.670254 | willenchou |
7111a51a8969653c67e938d64d7a78de970f5b35 | 3,297 | cpp | C++ | src/obproxy/prometheus/ob_prometheus_utils.cpp | stutiredboy/obproxy | b5f98a6e1c45e6a878376df49b9c10b4249d3626 | [
"Apache-2.0"
] | 74 | 2021-05-31T15:23:49.000Z | 2022-03-12T04:46:39.000Z | src/obproxy/prometheus/ob_prometheus_utils.cpp | stutiredboy/obproxy | b5f98a6e1c45e6a878376df49b9c10b4249d3626 | [
"Apache-2.0"
] | 16 | 2021-05-31T15:26:38.000Z | 2022-03-30T06:02:43.000Z | src/obproxy/prometheus/ob_prometheus_utils.cpp | stutiredboy/obproxy | b5f98a6e1c45e6a878376df49b9c10b4249d3626 | [
"Apache-2.0"
] | 64 | 2021-05-31T15:25:36.000Z | 2022-02-23T08:43:58.000Z | /**
* Copyright (c) 2021 OceanBase
* OceanBase Database Proxy(ODP) is licensed under Mulan PubL v2.
* You can use this software according to the terms and conditions of the Mulan PubL v2.
* You may obtain a copy of Mulan PubL v2 at:
* http://license.coscl.org.cn/MulanPubL-2.0
* THIS SOFTWARE IS PROVIDED ... | 28.669565 | 98 | 0.680619 | stutiredboy |
7115d1c31aa36071e9a5e88a4f00c823330369a0 | 3,636 | cpp | C++ | src/Button.cpp | 18/PasswordManager | 85a6fb03f1fea6a8494a13ccce5550ab9b414811 | [
"Apache-2.0"
] | 1 | 2018-12-06T00:45:23.000Z | 2018-12-06T00:45:23.000Z | src/Button.cpp | 18/PasswordManager | 85a6fb03f1fea6a8494a13ccce5550ab9b414811 | [
"Apache-2.0"
] | null | null | null | src/Button.cpp | 18/PasswordManager | 85a6fb03f1fea6a8494a13ccce5550ab9b414811 | [
"Apache-2.0"
] | null | null | null | // Copyright 2018 Krystian Stasiowski
#include "Button.h"
Button::Button(unsigned x, unsigned y, Color textcolor, Color backgroundcolor, Color selectedtextcolor, Color selectedbackgroundcolor, Color activatedtextcolor, const std::string& text, const std::string& selectedtext, const std::string& activatedtext, const s... | 24.734694 | 393 | 0.671617 | 18 |
711a1142d59343cc79012d7dee410650f9de72a6 | 369 | cpp | C++ | leetcode/338. Counting Bits/s1.cpp | joycse06/LeetCode-1 | ad105bd8c5de4a659c2bbe6b19f400b926c82d93 | [
"Fair"
] | 787 | 2017-05-12T05:19:57.000Z | 2022-03-30T12:19:52.000Z | leetcode/338. Counting Bits/s1.cpp | aerlokesh494/LeetCode | 0f2cbb28d5a9825b51a8d3b3a0ae0c30d7ff155f | [
"Fair"
] | 8 | 2020-03-16T05:55:38.000Z | 2022-03-09T17:19:17.000Z | leetcode/338. Counting Bits/s1.cpp | aerlokesh494/LeetCode | 0f2cbb28d5a9825b51a8d3b3a0ae0c30d7ff155f | [
"Fair"
] | 247 | 2017-04-30T15:07:50.000Z | 2022-03-30T09:58:57.000Z | // OJ: https://leetcode.com/problems/counting-bits
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(1)
class Solution {
public:
vector<int> countBits(int num) {
vector<int> ans(num + 1);
for (int i = 1; i <= num; i *= 2) {
ans[i] = 1;
for (int j = 1; j < i && i + j <= num; ++j) ans[i + j... | 24.6 | 79 | 0.520325 | joycse06 |
711ac4d152e37cfec06cbed271607d3fe49f4d05 | 161 | hpp | C++ | osc-seq-cpp/src/filesystem/filesystem.hpp | Acaruso/osc-seq-cpp | 14d2d5ce0fdad8d183e19781a279f9442db9c79f | [
"MIT"
] | null | null | null | osc-seq-cpp/src/filesystem/filesystem.hpp | Acaruso/osc-seq-cpp | 14d2d5ce0fdad8d183e19781a279f9442db9c79f | [
"MIT"
] | null | null | null | osc-seq-cpp/src/filesystem/filesystem.hpp | Acaruso/osc-seq-cpp | 14d2d5ce0fdad8d183e19781a279f9442db9c79f | [
"MIT"
] | null | null | null | #pragma once
#include "../store/store.hpp"
#include <string>
void save_file(std::string path, Store& store);
void open_file(std::string path, Store& store);
| 16.1 | 47 | 0.714286 | Acaruso |
7120d2b8ad8f6661da8a204eac1f2483f0a485c1 | 1,449 | cpp | C++ | primary/grmath.cpp | Wiladams/nd | 9575e050c18225a138255a39de6c50954db2e731 | [
"MIT"
] | 11 | 2020-04-25T02:37:13.000Z | 2021-08-08T13:08:36.000Z | primary/grmath.cpp | Wiladams/nd | 9575e050c18225a138255a39de6c50954db2e731 | [
"MIT"
] | null | null | null | primary/grmath.cpp | Wiladams/nd | 9575e050c18225a138255a39de6c50954db2e731 | [
"MIT"
] | null | null | null | #include "grmath.h"
vec3 random_in_unit_disk() {
while (true) {
auto p = vec3(random_double_range(-1, 1), random_double_range(-1, 1), 0);
if (p.lengthSquared() >= 1) continue;
return p;
}
}
vec3 random_unit_vector() {
auto a = random_double_range(0, 2 * maths::Pi);
auto z = ran... | 33.697674 | 129 | 0.585921 | Wiladams |
71255f887615f6b95557818672f14a96ac2dd586 | 5,904 | hpp | C++ | include/Simple-Utility/functional.hpp | DNKpp/Simple-Utility | db2d6cb1cc3849704f18272f8ce2d2bc05ad06a7 | [
"BSL-1.0"
] | null | null | null | include/Simple-Utility/functional.hpp | DNKpp/Simple-Utility | db2d6cb1cc3849704f18272f8ce2d2bc05ad06a7 | [
"BSL-1.0"
] | 8 | 2021-12-30T22:07:39.000Z | 2022-02-04T21:13:53.000Z | include/Simple-Utility/functional.hpp | DNKpp/Simple-Utility | db2d6cb1cc3849704f18272f8ce2d2bc05ad06a7 | [
"BSL-1.0"
] | 1 | 2020-08-19T13:02:58.000Z | 2020-08-19T13:02:58.000Z | // Copyright Dominic Koepke 2019 - 2022.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// https://www.boost.org/LICENSE_1_0.txt)
#ifndef SL_UTILITY_FUNCTIONAL_HPP
#define SL_UTILITY_FUNCTIONAL_HPP
#pragma once
#include <concept... | 23.902834 | 114 | 0.664634 | DNKpp |
712ba4926cb9a14eb7070608306e25d84e34ba23 | 1,708 | cpp | C++ | UI/TutorialHUD/Widget_KeyInput/Widget_KeyInputItem.cpp | Bornsoul/Revenger_JoyContinue | 599716970ca87a493bf3a959b36de0b330b318f1 | [
"MIT"
] | null | null | null | UI/TutorialHUD/Widget_KeyInput/Widget_KeyInputItem.cpp | Bornsoul/Revenger_JoyContinue | 599716970ca87a493bf3a959b36de0b330b318f1 | [
"MIT"
] | null | null | null | UI/TutorialHUD/Widget_KeyInput/Widget_KeyInputItem.cpp | Bornsoul/Revenger_JoyContinue | 599716970ca87a493bf3a959b36de0b330b318f1 | [
"MIT"
] | null | null | null | // Fill out your copyright notice in the Description page of Project Settings.
#include "Widget_KeyInputItem.h"
#include "Components/TextBlock.h"
#include "Components/Image.h"
void UWidget_KeyInputItem::NativeConstruct()
{
Super::NativeConstruct();
m_pKeyText = Cast<UTextBlock>(GetWidgetFromName(TEXT("KeyText")));... | 19.860465 | 85 | 0.719555 | Bornsoul |
7133ba40787d62c5e2c79058379ec01cab13c57b | 8,259 | cpp | C++ | MEX/src/cpp/vision/features/feature_channels/hog_extractor.cpp | umariqb/3D_Pose_Estimation_CVPR2016 | 83f6bf36aa68366ea8fa078eea6d91427e28503b | [
"BSD-3-Clause"
] | 47 | 2016-07-25T00:48:59.000Z | 2021-02-17T09:19:03.000Z | MEX/src/cpp/vision/features/feature_channels/hog_extractor.cpp | umariqb/3D_Pose_Estimation_CVPR2016 | 83f6bf36aa68366ea8fa078eea6d91427e28503b | [
"BSD-3-Clause"
] | 5 | 2016-09-17T19:40:46.000Z | 2018-11-07T06:49:02.000Z | MEX/src/cpp/vision/features/feature_channels/hog_extractor.cpp | iqbalu/3D_Pose_Estimation_CVPR2016 | 83f6bf36aa68366ea8fa078eea6d91427e28503b | [
"BSD-3-Clause"
] | 35 | 2016-07-21T09:13:15.000Z | 2019-05-13T14:11:37.000Z | /*
* hog_extractor.cpp
*
* Created on: Mar 22, 2012
* Author: Juergen Gall, mdantone
*/
#include <deque>
#include "opencv2/imgproc/imgproc.hpp"
#include "opencv2/highgui/highgui.hpp"
#include "hog_extractor.h"
#include "cpp/vision/min_max_filter.hpp"
using namespace std;
using namespace cv;
namespace vi... | 26.053628 | 93 | 0.61097 | umariqb |
7136d585e28bc662454d5dffa282fa54b103b441 | 729 | cpp | C++ | tests/functionality/structures/matrices/dense/mathematical.cpp | szymonmaszke/numpp | 9149c9d81f70a6ce833fdd1d2f0f2b584e2ac4d9 | [
"MIT"
] | 10 | 2018-06-06T01:51:17.000Z | 2021-01-02T15:17:00.000Z | tests/functionality/structures/matrices/dense/mathematical.cpp | vyzyv/numpp | 9149c9d81f70a6ce833fdd1d2f0f2b584e2ac4d9 | [
"MIT"
] | 2 | 2018-11-28T12:15:46.000Z | 2018-12-16T00:03:38.000Z | tests/functionality/structures/matrices/dense/mathematical.cpp | szymonmaszke/numpp | 9149c9d81f70a6ce833fdd1d2f0f2b584e2ac4d9 | [
"MIT"
] | 2 | 2017-08-06T13:58:27.000Z | 2018-04-06T06:45:22.000Z | #include "../../../../utilities/catch.hpp"
#include "numpp/structures/matrices/dense.hpp"
TEST_CASE(
"dense matrix functions tests",
"[mathemathical][matrix][dense][constexpr]"
){
constexpr numpp::matrix::dense<double, 4, 5> matrix{
1.2, -4.5, 12412.3, 12512., 294.2352,
2, 5.35, -412.3, 12, 0,
-34, 0, 0, 0,... | 27 | 54 | 0.615912 | szymonmaszke |
713835ea7ab96a01ba37edae5b5b3ff5d5a60123 | 3,382 | cpp | C++ | cppLib/code/dep/G3D/source/Stopwatch.cpp | DrYaling/ProcedureContentGenerationForUnity | 3c4f1e70b01e4fe2b9f847324b60b15016b9a740 | [
"MIT"
] | 3 | 2019-05-14T07:19:59.000Z | 2019-05-14T08:08:25.000Z | cppLib/code/dep/G3D/source/Stopwatch.cpp | DrYaling/ProcedureContentGenerationForUnity | 3c4f1e70b01e4fe2b9f847324b60b15016b9a740 | [
"MIT"
] | null | null | null | cppLib/code/dep/G3D/source/Stopwatch.cpp | DrYaling/ProcedureContentGenerationForUnity | 3c4f1e70b01e4fe2b9f847324b60b15016b9a740 | [
"MIT"
] | 1 | 2018-08-08T07:39:16.000Z | 2018-08-08T07:39:16.000Z | /**
@file Stopwatch.cpp
@maintainer Morgan McGuire, http://graphics.cs.williams.edu
@created 2005-10-05
@edited 2009-03-14
Copyright 2000-2009, Morgan McGuire.
All rights reserved.
*/
#include "G3D/Stopwatch.h"
#include "G3D/System.h"
namespace G3D {
Stopwatch::Stopwatch(const std::string& myName) :
... | 27.950413 | 94 | 0.591366 | DrYaling |
7142ada1847c6a703e24bcca79e470d6ff2ef011 | 15,222 | cpp | C++ | dali/internal/text/text-abstraction/bidirectional-support-impl.cpp | Coquinho/dali-adaptor | a8006aea66b316a5eb710e634db30f566acda144 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | dali/internal/text/text-abstraction/bidirectional-support-impl.cpp | Coquinho/dali-adaptor | a8006aea66b316a5eb710e634db30f566acda144 | [
"Apache-2.0",
"BSD-3-Clause"
] | 2 | 2020-10-19T13:45:40.000Z | 2020-12-10T20:21:03.000Z | dali/internal/text/text-abstraction/bidirectional-support-impl.cpp | expertisesolutions/dali-adaptor | 810bf4dea833ea7dfbd2a0c82193bc0b3b155011 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | /*
* Copyright (c) 2015 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 applicable... | 32.25 | 178 | 0.6509 | Coquinho |
71440bf8a627282b7f74ca76ec1ae778b3dcbc9e | 3,127 | cpp | C++ | src/bindings/c++/iccp-c++.cpp | Geof23/sail | d09e5abe212cbc7f40ff61713a5f75a254e52764 | [
"BSD-3-Clause-Clear",
"MIT"
] | null | null | null | src/bindings/c++/iccp-c++.cpp | Geof23/sail | d09e5abe212cbc7f40ff61713a5f75a254e52764 | [
"BSD-3-Clause-Clear",
"MIT"
] | null | null | null | src/bindings/c++/iccp-c++.cpp | Geof23/sail | d09e5abe212cbc7f40ff61713a5f75a254e52764 | [
"BSD-3-Clause-Clear",
"MIT"
] | null | null | null | /* This file is part of SAIL (https://github.com/smoked-herring/sail)
Copyright (c) 2020 Dmitry Baryshev
The MIT License
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 with... | 20.846667 | 96 | 0.653342 | Geof23 |
7145f113cf2ab526df1efd2d7d5ed5574f7ca300 | 811 | cpp | C++ | c++/leetcode/0572-Subtree_of_Another_Tree-E.cpp | levendlee/leetcode | 35e274cb4046f6ec7112cd56babd8fb7d437b844 | [
"Apache-2.0"
] | 1 | 2020-03-02T10:56:22.000Z | 2020-03-02T10:56:22.000Z | c++/leetcode/0572-Subtree_of_Another_Tree-E.cpp | levendlee/leetcode | 35e274cb4046f6ec7112cd56babd8fb7d437b844 | [
"Apache-2.0"
] | null | null | null | c++/leetcode/0572-Subtree_of_Another_Tree-E.cpp | levendlee/leetcode | 35e274cb4046f6ec7112cd56babd8fb7d437b844 | [
"Apache-2.0"
] | null | null | null | // 572 Subtree of Another Tree
// https://leetcode.com/problems/subtree-of-another-tree
// version: 1; create time: 2019-12-30 11:34:15;
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL)... | 27.965517 | 90 | 0.556104 | levendlee |
7149ff58d8822b0bd35b5efa19c3277a1bf648c8 | 1,270 | cpp | C++ | memory/intrusive_ptr.cpp | xujungp02/boost_guide | 328516455d334506f824402455a17afc606ca3bc | [
"Apache-2.0"
] | 355 | 2015-03-06T12:03:51.000Z | 2022-03-28T04:15:00.000Z | memory/intrusive_ptr.cpp | lak123456/boost_guide | 1886ec8014838717222484f0fe872ecebc324e91 | [
"Apache-2.0"
] | 1 | 2017-10-04T18:14:17.000Z | 2017-10-09T02:38:12.000Z | memory/intrusive_ptr.cpp | lak123456/boost_guide | 1886ec8014838717222484f0fe872ecebc324e91 | [
"Apache-2.0"
] | 202 | 2015-03-23T16:16:45.000Z | 2022-03-28T07:55:48.000Z | // Copyright (c) 2015
// Author: Chrono Law
#include <std.hpp>
using namespace std;
#include <boost/smart_ptr.hpp>
using namespace boost;
//////////////////////////////////////////
struct counted_data
{
// ...
int m_count = 0;
~counted_data()
{
cout << "dtor" << endl;
}
};
void intrusive... | 17.162162 | 66 | 0.540945 | xujungp02 |
7155d64874e7ce4b6e55b4aa18f88e7c4c6615dd | 2,490 | cpp | C++ | Arrays/create.cpp | rajeshkumarblr/datastructures | ca5ebbb44d65272ead8e20cda5f9fee2c326c58a | [
"MIT"
] | null | null | null | Arrays/create.cpp | rajeshkumarblr/datastructures | ca5ebbb44d65272ead8e20cda5f9fee2c326c58a | [
"MIT"
] | null | null | null | Arrays/create.cpp | rajeshkumarblr/datastructures | ca5ebbb44d65272ead8e20cda5f9fee2c326c58a | [
"MIT"
] | null | null | null | #include <iostream>
#include <time.h>
#include <stdlib.h>
#include "arrayops.h"
#include "dsutils.h"
using namespace std;
void allocateArray(int size) {
if (arr) {
delete[] arr;
}
arr = new int[size];
n = size;
}
void createArray(int st, int end, int incr) {
int size = (end - st) / incr + 1;... | 23.271028 | 101 | 0.583936 | rajeshkumarblr |
71562197278abdecea7b48012d7d31c61d099bc2 | 228 | cpp | C++ | lib/libc/tests/ctype/isalpha.cpp | otaviopace/ananas | 849925915b0888543712a8ca625318cd7bca8dd9 | [
"Zlib"
] | 52 | 2015-11-27T13:56:00.000Z | 2021-12-01T16:33:58.000Z | lib/libc/tests/ctype/isalpha.cpp | otaviopace/ananas | 849925915b0888543712a8ca625318cd7bca8dd9 | [
"Zlib"
] | 4 | 2017-06-26T17:59:51.000Z | 2021-09-26T17:30:32.000Z | lib/libc/tests/ctype/isalpha.cpp | otaviopace/ananas | 849925915b0888543712a8ca625318cd7bca8dd9 | [
"Zlib"
] | 8 | 2016-08-26T09:42:27.000Z | 2021-12-04T00:21:05.000Z | #include <gtest/gtest.h>
#include <ctype.h>
TEST(ctype, isalpha)
{
EXPECT_TRUE(isalpha('a'));
EXPECT_TRUE(isalpha('z'));
EXPECT_FALSE(isalpha(' '));
EXPECT_FALSE(isalpha('1'));
EXPECT_FALSE(isalpha('@'));
}
| 19 | 31 | 0.627193 | otaviopace |
7157aa8407ffc5d2453a56d06f3a30aa281ae1f5 | 6,608 | cc | C++ | src/kernel/arch/x86/architecture.cc | cmejj/How-to-Make-a-Computer-Operating-System | eb30f8802fac9f0f1c28d3a96bb3d402bdfc4687 | [
"Apache-2.0"
] | 16,500 | 2015-01-01T00:47:42.000Z | 2022-03-31T17:12:02.000Z | src/kernel/arch/x86/architecture.cc | yongpingkan/How-to-Make-a-Computer-Operating-System | eb30f8802fac9f0f1c28d3a96bb3d402bdfc4687 | [
"Apache-2.0"
] | 66 | 2015-01-08T15:22:11.000Z | 2021-12-16T09:04:37.000Z | src/kernel/arch/x86/architecture.cc | yongpingkan/How-to-Make-a-Computer-Operating-System | eb30f8802fac9f0f1c28d3a96bb3d402bdfc4687 | [
"Apache-2.0"
] | 3,814 | 2015-01-01T12:42:31.000Z | 2022-03-31T14:26:50.000Z | #include <os.h>
#include <x86.h>
/* Stack pointer */
extern u32 * stack_ptr;
/* Current cpu name */
static char cpu_name[512] = "x86-noname";
/* Detect the type of processor */
char* Architecture::detect(){
cpu_vendor_name(cpu_name);
return cpu_name;
}
/* Start and initialize the architecture */
void Architectu... | 19.550296 | 82 | 0.615466 | cmejj |
715d14a0dcd1f93c08d98a5dd3b4c9ee626e05f3 | 2,021 | cpp | C++ | 3rdparty/openbw/bwapi/bwapi/TestAIModule/Source/InterceptorTest.cpp | ratiotile/StardustDevEnvironment | 15c512b81579d8bd663db3fa8e0847d4c27f17e8 | [
"MIT"
] | 8 | 2020-09-29T17:11:15.000Z | 2022-01-29T20:41:33.000Z | 3rdparty/openbw/bwapi/bwapi/TestAIModule/Source/InterceptorTest.cpp | ratiotile/StardustDevEnvironment | 15c512b81579d8bd663db3fa8e0847d4c27f17e8 | [
"MIT"
] | 1 | 2021-03-08T17:43:05.000Z | 2021-03-09T06:35:04.000Z | 3rdparty/openbw/bwapi/bwapi/TestAIModule/Source/InterceptorTest.cpp | ratiotile/StardustDevEnvironment | 15c512b81579d8bd663db3fa8e0847d4c27f17e8 | [
"MIT"
] | 1 | 2021-03-01T04:31:30.000Z | 2021-03-01T04:31:30.000Z | #include "InterceptorTest.h"
using namespace std;
using namespace BWAPI;
void InterceptorTest::onStart()
{
BWAssert(Broodwar->isMultiplayer()==false);
BWAssert(Broodwar->isReplay()==false);
Broodwar->enableFlag(Flag::UserInput);
Broodwar->sendText("show me the money");
int correctCarrierCount = 2;
int corre... | 34.844828 | 141 | 0.682335 | ratiotile |
7160834b20fd537d7941549a1efb729d579636fc | 6,444 | cpp | C++ | src/NetProtocol/Protocols/nCiosDiscovery.cpp | Vladimir-Lin/QtNetProtocol | 907cc8b5acf96a04d89eb8e68faede77c4a2df1b | [
"MIT"
] | null | null | null | src/NetProtocol/Protocols/nCiosDiscovery.cpp | Vladimir-Lin/QtNetProtocol | 907cc8b5acf96a04d89eb8e68faede77c4a2df1b | [
"MIT"
] | null | null | null | src/NetProtocol/Protocols/nCiosDiscovery.cpp | Vladimir-Lin/QtNetProtocol | 907cc8b5acf96a04d89eb8e68faede77c4a2df1b | [
"MIT"
] | null | null | null | #include <netprotocol.h>
N::CiosDiscovery:: CiosDiscovery (void)
: UdpDiscovery ( )
, neighbors (NULL)
{
setParameter ( "Myself" , false ) ;
}
N::CiosDiscovery::~CiosDiscovery (void)
{
if ( NotNull(neighbors) ) {
if ( neighbors->Used <= 0 ) {
delete neighbor... | 51.552 | 78 | 0.257294 | Vladimir-Lin |
7163ce0e902b4bbefe1d7e45af385505e51aacab | 852 | cpp | C++ | src/fig00-test.cpp | carlos-urena/figs-gen | d9161efedddb13a7e067e8efe56bccc904c8e065 | [
"MIT"
] | null | null | null | src/fig00-test.cpp | carlos-urena/figs-gen | d9161efedddb13a7e067e8efe56bccc904c8e065 | [
"MIT"
] | null | null | null | src/fig00-test.cpp | carlos-urena/figs-gen | d9161efedddb13a7e067e8efe56bccc904c8e065 | [
"MIT"
] | null | null | null |
#include <iostream>
#include <vec_mat.h>
int main( int argc, char *argv[] )
{
using namespace std ;
cout
<< "\\documentclass[border=1mm]{standalone}" << endl
<< "\\input{../src/header.tex}" << endl ;
const char * tex = R"tex(
\tikzisometrico
\begin{tikzpicture}[scale=1.4,isometricXYZ]
... | 26.625 | 100 | 0.543427 | carlos-urena |
716900084d66edb7864f1780ed8737da398ed885 | 34,154 | cpp | C++ | src/mechanisms.cpp | opendnssec/pkcs11-testing | cac56d02daadf333485c2376058db912dc37053a | [
"BSD-1-Clause"
] | 14 | 2015-10-19T01:35:58.000Z | 2020-10-09T09:49:04.000Z | src/mechanisms.cpp | opendnssec/pkcs11-testing | cac56d02daadf333485c2376058db912dc37053a | [
"BSD-1-Clause"
] | null | null | null | src/mechanisms.cpp | opendnssec/pkcs11-testing | cac56d02daadf333485c2376058db912dc37053a | [
"BSD-1-Clause"
] | 3 | 2016-01-17T17:26:30.000Z | 2022-02-08T09:46:11.000Z | /* $Id$ */
/*
* Copyright (c) 2010 .SE (The Internet Infrastructure 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:
* 1. Redistributions of source code must retain the above... | 25.583521 | 130 | 0.703988 | opendnssec |
716c8ceaca06b28f5179b8b5441c557e982f619f | 2,213 | cpp | C++ | Windows/src/Code_highlighting.cpp | SongZihui-sudo/easyhtmleditor | 6ac122e0f6cff16da98adb74da2e3a2dba153748 | [
"MIT"
] | 1 | 2022-01-23T14:49:51.000Z | 2022-01-23T14:49:51.000Z | Windows/src/Code_highlighting.cpp | SongZihui-sudo/easyhtmleditor | 6ac122e0f6cff16da98adb74da2e3a2dba153748 | [
"MIT"
] | 9 | 2022-02-11T13:09:29.000Z | 2022-03-14T12:13:39.000Z | Windows/src/Code_highlighting.cpp | SongZihui-sudo/easyhtmleditor | 6ac122e0f6cff16da98adb74da2e3a2dba153748 | [
"MIT"
] | null | null | null | #include "../include/Code_highlighting.h"
#include "../include/EasyCodingEditor.h"
using namespace cht;
using namespace edt;
edt::easyhtmleditor e1;
//设置颜色
void Code_highlighting::Set_color(int wr,int wg,int wb,int br,int bg,int bb){
printf("\033[38;2;%d;%d;%dm\033[48;2;%d;%d;%dm",wr,wg,wb,br,bg,bb);
/... | 24.318681 | 77 | 0.621329 | SongZihui-sudo |
7175c2c3c49bf787331bffc1580fe566c969736d | 340 | cpp | C++ | Linked List/Circular Linked List/Implementation.cpp | shouryagupta21/Fork_CPP | 8f5baed045ef430cca19d871c8854abc3b6ad44f | [
"MIT"
] | 8 | 2021-02-14T13:13:27.000Z | 2022-01-08T23:58:32.000Z | Linked List/Circular Linked List/Implementation.cpp | shouryagupta21/Fork_CPP | 8f5baed045ef430cca19d871c8854abc3b6ad44f | [
"MIT"
] | 17 | 2021-02-28T17:03:50.000Z | 2021-10-19T13:02:03.000Z | Linked List/Circular Linked List/Implementation.cpp | shouryagupta21/Fork_CPP | 8f5baed045ef430cca19d871c8854abc3b6ad44f | [
"MIT"
] | 15 | 2021-03-01T03:54:29.000Z | 2021-10-19T18:29:00.000Z | #include <bits/stdc++.h>
using namespace std;
struct Node{
int data;
Node* next;
Node(int d){
data=d;
next=NULL;
}
};
int main()
{
Node *head=new Node(10);
head->next=new Node(5);
head->next->next=new Node(20);
head->next->next->next=new Node(15);
head->next->next->next->next=... | 15.454545 | 37 | 0.576471 | shouryagupta21 |
71820553d922ccffc2c5735d4282b3e3c8facc08 | 1,560 | cpp | C++ | tests/core/gui/widgets/PanelTests.cpp | Kubaaa96/IdleRomanEmpire | c41365babaccd309dd78e953a333b39d8045913a | [
"MIT"
] | null | null | null | tests/core/gui/widgets/PanelTests.cpp | Kubaaa96/IdleRomanEmpire | c41365babaccd309dd78e953a333b39d8045913a | [
"MIT"
] | 29 | 2020-10-21T07:34:55.000Z | 2021-01-12T15:15:53.000Z | tests/core/gui/widgets/PanelTests.cpp | Kubaaa96/IdleRomanEmpire | c41365babaccd309dd78e953a333b39d8045913a | [
"MIT"
] | 1 | 2020-10-19T19:30:40.000Z | 2020-10-19T19:30:40.000Z | #include <catch2/catch.hpp>
#include "core/gui/widgets/Panel.h"
#include "core/gui/widgets/VerticalLayout.h"
#include "core/gui/widgets/Button.h"
#include "TestsUtils.h"
TEST_CASE("[Panel]")
{
auto vLayout = ire::core::gui::VerticalLayout::create({ 200, 200 });
auto button = ire::core::gui::Button::create();
v... | 31.2 | 94 | 0.674359 | Kubaaa96 |
7183a7bcc789f718336e25d0388a553c39091d42 | 3,417 | cpp | C++ | src/simple-2d-polydar.cpp | mdsumner/polydar | 44009e76fdbf36cb71d97253427e8b4000f53ec5 | [
"MIT"
] | 2 | 2020-05-05T07:07:27.000Z | 2020-05-05T07:19:17.000Z | src/simple-2d-polydar.cpp | mdsumner/polydar | 44009e76fdbf36cb71d97253427e8b4000f53ec5 | [
"MIT"
] | null | null | null | src/simple-2d-polydar.cpp | mdsumner/polydar | 44009e76fdbf36cb71d97253427e8b4000f53ec5 | [
"MIT"
] | null | null | null | /**
simple.cpp
Purpose: Example of using polylidar in C++
@author Jeremy Castagno
@version 05/20/19
*/
#include <Rcpp.h>
using namespace Rcpp;
#include <iostream>
#include <sstream> // std::istringstream
#include <vector>
#include <string>
#include <fstream>
#include <iomanip>
#include "include... | 30.508929 | 190 | 0.580334 | mdsumner |
71845503f276eb0333c946c1edf10ba8fc60df38 | 1,016 | cpp | C++ | src/NGFX/Private/Vulkan/vk_pipeline.cpp | PixPh/kaleido3d | 8a8356586f33a1746ebbb0cfe46b7889d0ae94e9 | [
"MIT"
] | 38 | 2019-01-10T03:10:12.000Z | 2021-01-27T03:14:47.000Z | src/NGFX/Private/Vulkan/vk_pipeline.cpp | fuqifacai/kaleido3d | ec77753b516949bed74e959738ef55a0bd670064 | [
"MIT"
] | null | null | null | src/NGFX/Private/Vulkan/vk_pipeline.cpp | fuqifacai/kaleido3d | ec77753b516949bed74e959738ef55a0bd670064 | [
"MIT"
] | 8 | 2019-04-16T07:56:27.000Z | 2020-11-19T02:38:37.000Z | #include "vk_common.h"
namespace vulkan
{
GpuRenderPipeline::GpuRenderPipeline(GpuDevice* device, ngfx::RenderPipelineDesc const& desc)
: GpuPipelineBase(device)
{
create_info_.stageCount;
create_info_.pStages;
create_info_.pVertexInputState;
create_info_.pInputAssemblyState;
create_info_.pTessellationSt... | 24.190476 | 97 | 0.806102 | PixPh |
71898089850d4aaee8c18f2f9f3e84cddecb0816 | 460 | cpp | C++ | HandAugementedReality/HandAugementedReality/Finger.cpp | nemcek/hand-augmented-reality | 6f4c1f23e1d18d35b3cc65bcc109ca06a8023ea6 | [
"MIT"
] | null | null | null | HandAugementedReality/HandAugementedReality/Finger.cpp | nemcek/hand-augmented-reality | 6f4c1f23e1d18d35b3cc65bcc109ca06a8023ea6 | [
"MIT"
] | null | null | null | HandAugementedReality/HandAugementedReality/Finger.cpp | nemcek/hand-augmented-reality | 6f4c1f23e1d18d35b3cc65bcc109ca06a8023ea6 | [
"MIT"
] | 1 | 2021-12-16T03:26:28.000Z | 2021-12-16T03:26:28.000Z | #include "Finger.h"
Finger::Finger()
{
}
Finger::Finger(const Point& finger_tip_point, FingerType type)
{
this->location = Location(finger_tip_point);
this->roi = Rect(Point(location.get().x - width / 2, location.get().y - height / 4), Size(width, height));
this->type = type;
}
/// Extracts finger from image by... | 18.4 | 107 | 0.684783 | nemcek |
718aad9333fdba92b3c5e4fc7de25fdc1906a5cd | 8,951 | hpp | C++ | hwlib/doxyfiles/texts/hwlib-doxygen-#0070-graphics.hpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 46 | 2017-02-15T14:24:14.000Z | 2021-10-01T14:25:57.000Z | hwlib/doxyfiles/texts/hwlib-doxygen-#0070-graphics.hpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 27 | 2017-02-15T15:13:42.000Z | 2021-08-28T15:29:01.000Z | hwlib/doxyfiles/texts/hwlib-doxygen-#0070-graphics.hpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 39 | 2017-05-18T11:51:03.000Z | 2021-09-14T09:07:01.000Z | // ==========================================================================
//
// File : hwlib-doxygen-char-io.hpp
// Part of : C++ hwlib library for close-to-the-hardware OO programming
// Copyright : wouter@voti.nl 2017-2019
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanyin... | 43.451456 | 163 | 0.537594 | TheBlindMick |
718affb17c3349b1fbdd5e5ef593df60654db8a3 | 1,755 | cpp | C++ | 901-1000/928. Minimize Malware Spread II.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 901-1000/928. Minimize Malware Spread II.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 901-1000/928. Minimize Malware Spread II.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | class Solution
{
public:
int minMalwareSpread(vector<vector<int>> &graph, vector<int> &initial)
{
int N = graph.size();
vector<bool> flag(N, false);
vector<vector<int>> connected(N, vector<int>());
vector<vector<int>> edges(N, vector<int>());
for (int i = 0; i < N; ++i)... | 26.19403 | 74 | 0.325356 | erichuang1994 |
718c201296b2b15165e073a60cdff475dc75aad9 | 7,348 | cpp | C++ | mwidgets/src/mediawidget/downloaddialog.cpp | quntax/qpcol | 290e2f0639eaee12fe6190070b3e2c38a8fd1ea7 | [
"BSD-3-Clause"
] | null | null | null | mwidgets/src/mediawidget/downloaddialog.cpp | quntax/qpcol | 290e2f0639eaee12fe6190070b3e2c38a8fd1ea7 | [
"BSD-3-Clause"
] | null | null | null | mwidgets/src/mediawidget/downloaddialog.cpp | quntax/qpcol | 290e2f0639eaee12fe6190070b3e2c38a8fd1ea7 | [
"BSD-3-Clause"
] | null | null | null | #include "downloaddialog.h"
DownloadDialog::DownloadDialog(QWidget * parent) : QDialog(parent)
{
dialogText = QString("Downloading file:\n%1\n\nTarget directory:\n%2\n");
pixmap = QIcon::fromTheme("download").pixmap(QSize(48, 48));
}
DownloadDialog::~DownloadDialog()
{
destroy();
}
// TODO prompt for dir... | 30.238683 | 104 | 0.662221 | quntax |
718f148237aa142c37818bef9b5a428a39a9e747 | 4,292 | cpp | C++ | Editor/src/ImGuiWidgets/Viewport.cpp | FelipeCalin/Hildur | 13e60a357e6f84ac1de842d9a9bd980155968cbc | [
"Apache-2.0"
] | null | null | null | Editor/src/ImGuiWidgets/Viewport.cpp | FelipeCalin/Hildur | 13e60a357e6f84ac1de842d9a9bd980155968cbc | [
"Apache-2.0"
] | null | null | null | Editor/src/ImGuiWidgets/Viewport.cpp | FelipeCalin/Hildur | 13e60a357e6f84ac1de842d9a9bd980155968cbc | [
"Apache-2.0"
] | null | null | null | #include "Viewport.h"
#include <Hildur.h>
#include <ImGui/imgui.h>
#define BIND_EVENT_FN(x) std::bind(&Viewport::x, this, std::placeholders::_1)
namespace Editor {
Viewport::Viewport()
{
}
Viewport::~Viewport()
{
}
void Viewport::Init(uint32_t width, uint32_t height)
{
m_ObjectIDFrameBuffer = Hild... | 30.657143 | 206 | 0.731827 | FelipeCalin |
7190cdfec8b8840ab8a822b73e34a51a587241eb | 5,883 | cpp | C++ | samples/flocking.cpp | jdduke/fpcpp | d9dba8aed135c85383a733fba3537d6afca5ddd7 | [
"MIT"
] | 16 | 2015-08-05T09:31:55.000Z | 2021-04-18T02:23:46.000Z | samples/flocking.cpp | jdduke/fpcpp | d9dba8aed135c85383a733fba3537d6afca5ddd7 | [
"MIT"
] | null | null | null | samples/flocking.cpp | jdduke/fpcpp | d9dba8aed135c85383a733fba3537d6afca5ddd7 | [
"MIT"
] | null | null | null | /////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2012, Jared Duke.
// This code is released under the MIT License.
// www.opensource.org/licenses/mit-license.php
/////////////////////////////////////////////////////////////////////////////
#include <fpcpp.h>
#include <ios... | 29.712121 | 97 | 0.536291 | jdduke |
7193bd769bf53d713ca1f480c94054ab7e371e06 | 683 | cpp | C++ | tools/ifaceed/ifaceed/scripting/querytable.cpp | mamontov-cpp/saddy | f20a0030e18af9e0714fe56c19407fbeacc529a7 | [
"BSD-2-Clause"
] | 58 | 2015-08-09T14:56:35.000Z | 2022-01-15T22:06:58.000Z | tools/ifaceed/ifaceed/scripting/querytable.cpp | mamontov-cpp/saddy-graphics-engine-2d | e25a6637fcc49cb26614bf03b70e5d03a3a436c7 | [
"BSD-2-Clause"
] | 245 | 2015-08-08T08:44:22.000Z | 2022-01-04T09:18:08.000Z | tools/ifaceed/ifaceed/scripting/querytable.cpp | mamontov-cpp/saddy | f20a0030e18af9e0714fe56c19407fbeacc529a7 | [
"BSD-2-Clause"
] | 23 | 2015-12-06T03:57:49.000Z | 2020-10-12T14:15:50.000Z | #include "querytable.h"
#include <QVector>
#include <renderer.h>
#include <db/dbdatabase.h>
#include <db/dbtable.h>
QVector<unsigned long long> scripting::query_table(
const sad::String& table,
const sad::String& type_of_objects
)
{
sad::db::Database* db = sad::Renderer::ref()->database(""... | 22.766667 | 77 | 0.590044 | mamontov-cpp |
7195d91b67b3890eda661e549e9f0936879e9562 | 1,105 | cpp | C++ | thread/example3.cpp | TedLyngmo/lyn_threads | 576230ded5d5f8f0b17aabec870a7201f4f9108e | [
"Unlicense"
] | null | null | null | thread/example3.cpp | TedLyngmo/lyn_threads | 576230ded5d5f8f0b17aabec870a7201f4f9108e | [
"Unlicense"
] | null | null | null | thread/example3.cpp | TedLyngmo/lyn_threads | 576230ded5d5f8f0b17aabec870a7201f4f9108e | [
"Unlicense"
] | null | null | null | #include "lyn/thread.hpp"
#include <chrono>
#include <iostream>
#include <thread>
// event example
lyn::thread::event<true> ev; // true = auto reset
int state = 0;
void a_thread() {
// waits for ev to be signaled
// runs the lambda
// sets ev to non-signaled
bool executed = ev.wait_for(std::chrono::... | 19.385965 | 66 | 0.472398 | TedLyngmo |
71969823bed10163f644eff544d814836e58e2da | 52,395 | cc | C++ | Modules/Registration/src/irtkRegisteredImage.cc | kevin-keraudren/IRTK | ce329b7f58270b6c34665dcfe9a6e941649f3b94 | [
"Apache-2.0"
] | 3 | 2018-10-04T19:32:36.000Z | 2021-09-02T07:37:30.000Z | Modules/Registration/src/irtkRegisteredImage.cc | kevin-keraudren/IRTK | ce329b7f58270b6c34665dcfe9a6e941649f3b94 | [
"Apache-2.0"
] | null | null | null | Modules/Registration/src/irtkRegisteredImage.cc | kevin-keraudren/IRTK | ce329b7f58270b6c34665dcfe9a6e941649f3b94 | [
"Apache-2.0"
] | 4 | 2016-03-17T02:55:00.000Z | 2018-02-03T05:40:05.000Z | /* The Image Registration Toolkit (IRTK)
*
* Copyright 2008-2015 Imperial College London
*
* 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... | 40.334873 | 129 | 0.616776 | kevin-keraudren |
719808bb3bebe7d1d308ff050376afa792945677 | 448 | cc | C++ | phastaIO/phiotimer_empty/phiotimer_empty.cc | polmes/phasta | 38a361e8033072fa0b5376e424dddd3efa5a65d5 | [
"BSD-3-Clause"
] | 49 | 2015-04-16T13:45:34.000Z | 2022-02-07T01:02:49.000Z | phastaIO/phiotimer_empty/phiotimer_empty.cc | polmes/phasta | 38a361e8033072fa0b5376e424dddd3efa5a65d5 | [
"BSD-3-Clause"
] | 21 | 2015-10-06T19:50:43.000Z | 2017-12-17T03:47:51.000Z | phastaIO/phiotimer_empty/phiotimer_empty.cc | polmes/phasta | 38a361e8033072fa0b5376e424dddd3efa5a65d5 | [
"BSD-3-Clause"
] | 38 | 2015-04-21T12:13:40.000Z | 2021-11-12T19:38:00.000Z | #include <phiotimer.h>
void phastaio_time(phastaioTime*) {}
size_t phastaio_time_diff(phastaioTime*, phastaioTime*) {
return 1;
}
void phastaio_addReadBytes(size_t) {}
void phastaio_addWriteBytes(size_t) {}
void phastaio_addReadTime(size_t) {}
void phastaio_addWriteTime(size_t) {}
void phastaio_setfile(int) {}
void p... | 29.866667 | 57 | 0.790179 | polmes |
71a4545a18af8f66eda7bfb88777af13752a4729 | 16,127 | cpp | C++ | tests/tst_seasidefilteredmodel/seasidecache.cpp | LaakkonenJussi/nemo-qml-plugin-contacts | e94e468786000d4c4d403fea1bec8e49e37a471e | [
"BSD-3-Clause"
] | null | null | null | tests/tst_seasidefilteredmodel/seasidecache.cpp | LaakkonenJussi/nemo-qml-plugin-contacts | e94e468786000d4c4d403fea1bec8e49e37a471e | [
"BSD-3-Clause"
] | 3 | 2021-09-29T07:13:48.000Z | 2022-03-31T11:03:07.000Z | tests/tst_seasidefilteredmodel/seasidecache.cpp | LaakkonenJussi/nemo-qml-plugin-contacts | e94e468786000d4c4d403fea1bec8e49e37a471e | [
"BSD-3-Clause"
] | 1 | 2022-03-25T15:33:41.000Z | 2022-03-25T15:33:41.000Z | /*
* Copyright (C) 2013 Jolla Mobile <andrew.den.exter@jollamobile.com>
*
* You may use this file under the terms of the BSD license as follows:
*
* "Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
* * Redistrib... | 27.805172 | 151 | 0.688163 | LaakkonenJussi |
71a5684041c3b8c47eb09591a384c59fd46ce891 | 3,297 | cpp | C++ | Src/Legacy/Math/matrix4.cpp | visualizersdotnl/tpb-06-final | 7bd0b0e3fb954381466b2eb89d5edebef9f39ea7 | [
"MIT"
] | 4 | 2015-12-15T23:04:27.000Z | 2018-01-17T23:09:10.000Z | Src/Legacy/Math/matrix4.cpp | visualizersdotnl/tpb-06-final | 7bd0b0e3fb954381466b2eb89d5edebef9f39ea7 | [
"MIT"
] | null | null | null | Src/Legacy/Math/matrix4.cpp | visualizersdotnl/tpb-06-final | 7bd0b0e3fb954381466b2eb89d5edebef9f39ea7 | [
"MIT"
] | null | null | null |
#include <Shared/assert.h>
#include "matrix4.h"
#include "vector4.h"
#include "misc.h"
Matrix4 Matrix4::IDENTITY;
void Matrix4::Init()
{
IDENTITY.SetIdentity();
}
void Matrix4::SetIdentity()
{
_11 = 1.0f;
_12 = 0.0f;
_13 = 0.0f;
_14 = 0.0f;
_21 = 0.0f;
_22 = 1.0f;
_23 = 0.0f;
_24 = 0.0f;
_31 = 0.0f;
_... | 22.737931 | 96 | 0.575978 | visualizersdotnl |
71a929242d9c405f7e8288708bff8c01d1359c35 | 1,863 | hpp | C++ | FinalExam/PNGio.hpp | MetalheadKen/NTUST-Parallel-Course | 4a4e726a5220eaf7403375b61cf6ce8a7cd9cbb9 | [
"MIT"
] | null | null | null | FinalExam/PNGio.hpp | MetalheadKen/NTUST-Parallel-Course | 4a4e726a5220eaf7403375b61cf6ce8a7cd9cbb9 | [
"MIT"
] | null | null | null | FinalExam/PNGio.hpp | MetalheadKen/NTUST-Parallel-Course | 4a4e726a5220eaf7403375b61cf6ce8a7cd9cbb9 | [
"MIT"
] | null | null | null | #pragma once
#include <png.h>
#include <cstdint>
#include <list>
#include <array>
using std::list;
using std::array;
// struct for PNG image
struct inputImage {
int width, height; // width & height of the image
png_byte depth; // color depth of the image
png_byte colo... | 38.8125 | 197 | 0.721417 | MetalheadKen |
71a9fd975cf1f7c322f09d4adc40cf2502d74143 | 687 | cpp | C++ | 03-Arrays/subarraysum2.cpp | ShreyashRoyzada/C-plus-plus-Algorithms | 9db89faf0a9b9e636aece3e7289f21ab6a1e3748 | [
"MIT"
] | 21 | 2020-10-03T03:57:19.000Z | 2022-03-25T22:41:05.000Z | 03-Arrays/subarraysum2.cpp | ShreyashRoyzada/C-plus-plus-Algorithms | 9db89faf0a9b9e636aece3e7289f21ab6a1e3748 | [
"MIT"
] | 40 | 2020-10-02T07:02:34.000Z | 2021-10-30T16:00:07.000Z | 03-Arrays/subarraysum2.cpp | ShreyashRoyzada/C-plus-plus-Algorithms | 9db89faf0a9b9e636aece3e7289f21ab6a1e3748 | [
"MIT"
] | 90 | 2020-10-02T07:06:22.000Z | 2022-03-25T22:41:17.000Z | #include<iostream>
using namespace std;
int main()
{
int n;cin>>n;
int a[1000];
int currentsum=0;
int maxsum=0;
int left=-1;
int right=-1;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)
{
currentsum=0;
... | 17.615385 | 38 | 0.404658 | ShreyashRoyzada |
71add08d7d3fac9fb11e2cd01e74016a21164d1a | 1,019 | cpp | C++ | PAT/A1155.cpp | iphelf/Programming-Practice | 2a95bb7153957b035427046b250bf7ffc6b00906 | [
"WTFPL"
] | null | null | null | PAT/A1155.cpp | iphelf/Programming-Practice | 2a95bb7153957b035427046b250bf7ffc6b00906 | [
"WTFPL"
] | null | null | null | PAT/A1155.cpp | iphelf/Programming-Practice | 2a95bb7153957b035427046b250bf7ffc6b00906 | [
"WTFPL"
] | null | null | null | #include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
const int MAXN=1e3;
int N,heap[MAXN],path[MAXN],cnt;
void dfs(int o) {
path[cnt++]=heap[o];
int lc=o*2+1,rc=o*2+2;
if(lc>=N && rc>=N)
for(int i=0; i<cnt; i++) printf("%d%c",path[i],i==cnt-1?'\n':' ');
... | 16.983333 | 75 | 0.50736 | iphelf |
71af7319bc7f7b6ab90ddfa8471be6bdba17c46a | 1,248 | cpp | C++ | genomes/scripts/bounds.cpp | whelena/ginkgo | 892b2e9f851f71a491cade6297f74f09f17acf4c | [
"BSD-2-Clause"
] | 40 | 2015-06-15T14:17:15.000Z | 2022-02-24T10:53:41.000Z | genomes/scripts/bounds.cpp | whelena/ginkgo | 892b2e9f851f71a491cade6297f74f09f17acf4c | [
"BSD-2-Clause"
] | 36 | 2016-04-10T07:35:39.000Z | 2022-02-23T17:09:43.000Z | genomes/scripts/bounds.cpp | whelena/ginkgo | 892b2e9f851f71a491cade6297f74f09f17acf4c | [
"BSD-2-Clause"
] | 28 | 2015-07-02T21:14:38.000Z | 2022-03-09T12:35:26.000Z | #include <iostream>
#include <fstream>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]){
ifstream bin_file(argv[1], ios::out);
ofstream outfile(argv[2], ios::out);
if(argc < 3)
{
cout << "Provide input and output files" <... | 18.086957 | 61 | 0.564103 | whelena |
71afbf4202919189fedbc136b0c88992de25bc30 | 10,770 | cpp | C++ | csl/cslbase/tltime.cpp | arthurcnorman/general | 5e8fef0cc7999fa8ab75d8fdf79ad5488047282b | [
"BSD-2-Clause"
] | null | null | null | csl/cslbase/tltime.cpp | arthurcnorman/general | 5e8fef0cc7999fa8ab75d8fdf79ad5488047282b | [
"BSD-2-Clause"
] | null | null | null | csl/cslbase/tltime.cpp | arthurcnorman/general | 5e8fef0cc7999fa8ab75d8fdf79ad5488047282b | [
"BSD-2-Clause"
] | null | null | null | // tltime.c Copyright A C Norman 2019
// Released under the modified BSD license - you can find the terms
// of that easily enough!
// $Id: tltime.cpp 5331 2020-04-25 13:47:28Z arthurcnorman $
// Cygwin and mingw32 both seem to use "emutls" to support the C++11
// keyword "threa... | 36.883562 | 78 | 0.705478 | arthurcnorman |
71b04db4d2e38dcdb2eacb58b34b5fefb1f20b26 | 1,715 | cpp | C++ | gen/src/model/Port.cpp | cpp-openapi/dockerctl | 44da21c32509fb7e44c93551a41ceb14c42c18b1 | [
"Apache-2.0"
] | null | null | null | gen/src/model/Port.cpp | cpp-openapi/dockerctl | 44da21c32509fb7e44c93551a41ceb14c42c18b1 | [
"Apache-2.0"
] | null | null | null | gen/src/model/Port.cpp | cpp-openapi/dockerctl | 44da21c32509fb7e44c93551a41ceb14c42c18b1 | [
"Apache-2.0"
] | null | null | null | /*
* Port.cpp
*
* An open port on a container
*/
#include "Port.h"
using namespace openapi;
// macro should do the same job. Not really
// OPENAP_JSON_CONVERT_FUNCS(Port, IP, PrivatePort, PublicPort, Type)
void Port::ToJSON(Json & j) const
{
// OPENAPI_FOR_EACH(OPENAPI_TO_JSON_MEMBER, __VA_ARGS__)
j.Add... | 35.729167 | 114 | 0.695627 | cpp-openapi |
71b0f782717d87abd9736880fcde2d5e0bfe6ab8 | 640 | cpp | C++ | src/context/StringType.cpp | pougetat/decacompiler | 3181c87fce7c28d742f372300daabeb9f9f8d3c6 | [
"MIT"
] | null | null | null | src/context/StringType.cpp | pougetat/decacompiler | 3181c87fce7c28d742f372300daabeb9f9f8d3c6 | [
"MIT"
] | null | null | null | src/context/StringType.cpp | pougetat/decacompiler | 3181c87fce7c28d742f372300daabeb9f9f8d3c6 | [
"MIT"
] | null | null | null | #include "StringType.h"
bool StringType::IsBooleanType()
{
return false;
}
bool StringType::IsFloatType()
{
return false;
}
bool StringType::IsIntType()
{
return false;
}
bool StringType::IsStringType()
{
return true;
}
bool StringType::IsVoidType()
{
return false;
}
bool StringType::IsClassTy... | 12.54902 | 54 | 0.682813 | pougetat |
71b183e0cbec056814a6fde953c91c890475351d | 15,257 | cpp | C++ | data/112.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | data/112.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | data/112.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | int Rgpz , u7,
nT//a
,M4ElL /*d*/,DhV , xKKv7,
Aev7f
,puj,
E,hI, TGe,oN /*G6Iat*/
, //k
aA, //U6
zWZLO ,//DEw
MTL ,rq ,
a9 //Xt
,vu5
,eHB,v8Y , osHw/*jo*/,
h
,M,IT,//fpe
dq5 ,PEwG, xq, dOu ,
AzCI,
Z3sCV
, sOO
,
LJ ,
WbN5,z ,pzg8
, duU4, QztyO
, oDdEz/*UQ*/, Fndz
, GdVz, OkxM,r,Vzf,
xi//
,Di... | 10.400136 | 81 | 0.457364 | TianyiChen |
71b186d6347bb2f3f565617bd1181323eddfeef8 | 703 | cpp | C++ | kattis/problems/pet.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | 1 | 2020-07-16T01:46:38.000Z | 2020-07-16T01:46:38.000Z | kattis/problems/pet.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | null | null | null | kattis/problems/pet.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | 1 | 2020-05-27T14:30:43.000Z | 2020-05-27T14:30:43.000Z | #include <iostream>
using namespace std;
inline
void use_io_optimizations()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int main()
{
use_io_optimizations();
unsigned int winner_number {0};
unsigned int winner_points {0};
for (unsigned int i {0}; i < 5; ++i)
{
unsigne... | 16.738095 | 58 | 0.517781 | Rkhoiwal |
71b6ff277b32eb4d95b5d037136b872971c94da6 | 270 | cpp | C++ | 2. Search & Sort/07. Alternative Sorting (Easy).cpp | thekalyan001/DMB1-CP | 7ccf41bac7269bff432260c6078cebdb4e0f1483 | [
"Apache-2.0"
] | null | null | null | 2. Search & Sort/07. Alternative Sorting (Easy).cpp | thekalyan001/DMB1-CP | 7ccf41bac7269bff432260c6078cebdb4e0f1483 | [
"Apache-2.0"
] | null | null | null | 2. Search & Sort/07. Alternative Sorting (Easy).cpp | thekalyan001/DMB1-CP | 7ccf41bac7269bff432260c6078cebdb4e0f1483 | [
"Apache-2.0"
] | null | null | null | //https://practice.geeksforgeeks.org/problems/alternative-sorting1311/1/#
vector<int> alternateSort(int arr[], int n)
{
sort(arr,arr+n);int p=0;
vector<int>v(n);
for(int i=0;i<=n/2;i++)
{
v[p++]=arr[n-i-1];
p+1<n?v[p++]=arr[i]:0;
}
return v;
} | 18 | 74 | 0.577778 | thekalyan001 |
71c1dc3f28f132d37fe2134d13e3edb3bcc2207c | 340 | cpp | C++ | Homeworks/2_ImageWarping/project/src/App/Warp.cpp | Qinxin-Yan/USTC_CG-1 | 80dc240bea879f000196986b98efcd0bbf8dec34 | [
"MIT"
] | null | null | null | Homeworks/2_ImageWarping/project/src/App/Warp.cpp | Qinxin-Yan/USTC_CG-1 | 80dc240bea879f000196986b98efcd0bbf8dec34 | [
"MIT"
] | null | null | null | Homeworks/2_ImageWarping/project/src/App/Warp.cpp | Qinxin-Yan/USTC_CG-1 | 80dc240bea879f000196986b98efcd0bbf8dec34 | [
"MIT"
] | null | null | null | #include "Warp.h"
Warp::Warp()
{
}
Warp::~Warp()
{
}
/*void Warp::add_static_point(QPoint P)
{
static_point_list.push_back(P);
}*/
void Warp::add_map_point(map_pair Pair)
{
map_pair_list.push_back(Pair);
}
int Warp::map_pair_length()
{
return map_pair_list.size();
}
map_pair Warp::get_map_pair(int i)
{
return... | 11.724138 | 39 | 0.7 | Qinxin-Yan |
71c399be913f9582063460f586691cee134df776 | 830 | cpp | C++ | Graph(BFS, DFS)/p1890.cpp | vocovoco/Algorithm-Study | ba9d47ae5c28eb5b7810ddef371859b0b101a695 | [
"MIT"
] | 1 | 2017-12-20T12:21:01.000Z | 2017-12-20T12:21:01.000Z | Graph(BFS, DFS)/p1890.cpp | vocovoco/Algorithm-Study | ba9d47ae5c28eb5b7810ddef371859b0b101a695 | [
"MIT"
] | null | null | null | Graph(BFS, DFS)/p1890.cpp | vocovoco/Algorithm-Study | ba9d47ae5c28eb5b7810ddef371859b0b101a695 | [
"MIT"
] | null | null | null | #if 1
#include <stdio.h>
int main() {
int map[101][101] = { 0, };
long long dp[101][101] = { 0, };
int width;
scanf("%d", &width);
for (int i = 1; i <= width; i++) {
for (int j = 1; j <= width; j++) {
scanf("%d", &map[i][j]);
}
}
for (int i = (width * 2 - 1); i > 1; i--) {
int a, b;
if (i > width) ... | 16.27451 | 47 | 0.375904 | vocovoco |
71c67bb0c2829175fbe254522b45edc62e333f8b | 1,289 | cpp | C++ | src/learn/test_libevent.cpp | wohaaitinciu/zpublic | 0e4896b16e774d2f87e1fa80f1b9c5650b85c57e | [
"Unlicense"
] | 50 | 2015-01-07T01:54:54.000Z | 2021-01-15T00:41:48.000Z | src/learn/test_libevent.cpp | sinmx/ZPublic | 0e4896b16e774d2f87e1fa80f1b9c5650b85c57e | [
"Unlicense"
] | 1 | 2015-05-26T07:40:19.000Z | 2015-05-26T07:40:19.000Z | src/learn/test_libevent.cpp | sinmx/ZPublic | 0e4896b16e774d2f87e1fa80f1b9c5650b85c57e | [
"Unlicense"
] | 39 | 2015-01-07T02:03:15.000Z | 2021-01-15T00:41:50.000Z | #include "stdafx.h"
#include "test_libevent.h"
struct timeval lasttime;
int times = 0;
static void timeout_cb(evutil_socket_t fd, short e, void *arg)
{
struct timeval newtime, difference;
struct event *timeout = (event *)arg;
double elapsed;
evutil_gettimeofday(&newtime, NULL);
evutil_timersub(&n... | 23.017857 | 79 | 0.645462 | wohaaitinciu |
71c84e229d9425e488c02b0cfba33e7b477ceb70 | 311 | cpp | C++ | P1134.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | P1134.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | P1134.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | #include <cstdio>
using namespace std;
int n, ans = 1;
int num[4] = {6, 8, 4, 2};
int main() {
scanf("%d",&n);
for(int p = n; p > 0; p /= 5, ans = ans * num[p%4] %10)
for (int i = 1; i <= p%10; i++)
if(i != 5)
ans = ans * i %10;
printf("%d",ans);
return 0;
}
| 22.214286 | 59 | 0.421222 | AndrewWayne |
71d568094ded48d09db22efc6ad39d1f040c6eeb | 382 | cpp | C++ | test/Day1.cpp | schoradt/adventofcode-c | 09b9b5fc22cadc938190f5d83a895b601896d663 | [
"MIT"
] | null | null | null | test/Day1.cpp | schoradt/adventofcode-c | 09b9b5fc22cadc938190f5d83a895b601896d663 | [
"MIT"
] | null | null | null | test/Day1.cpp | schoradt/adventofcode-c | 09b9b5fc22cadc938190f5d83a895b601896d663 | [
"MIT"
] | null | null | null | #define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "doctest.h"
#include "Day1.h"
TEST_CASE("Testing Day 1")
{
Day1 day1;
vector<int> input = day1.parseIntegerLines(day1.loadLinesString("199\n200\n208\n210\n200\n207\n240\n269\n260\n263"));
CHECK_MESSAGE(7 == day1.process1(input), "test process 1");
... | 25.466667 | 121 | 0.717277 | schoradt |
71d7b3bb107ddf1c9f98fcdb0f91391e945d30b0 | 8,659 | cpp | C++ | DlgVolumeCalc.cpp | RDamman/SpeakerWorkshop | 87a38d04197a07a9a7878b3f60d5e0706782163c | [
"OML"
] | 12 | 2019-06-07T10:06:41.000Z | 2021-03-22T22:13:59.000Z | DlgVolumeCalc.cpp | RDamman/SpeakerWorkshop | 87a38d04197a07a9a7878b3f60d5e0706782163c | [
"OML"
] | 1 | 2019-05-09T07:38:12.000Z | 2019-07-10T04:20:55.000Z | DlgVolumeCalc.cpp | RDamman/SpeakerWorkshop | 87a38d04197a07a9a7878b3f60d5e0706782163c | [
"OML"
] | 3 | 2020-09-08T08:27:33.000Z | 2021-05-13T09:25:43.000Z | // DlgVolumeCalc.cpp : implementation file
//
#include "stdafx.h"
#include "audtest.h"
#include "DlgVolumeCalc.h"
#include "Utils.h"
#include "Math.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
// ------------------------------------------------------------------... | 26.975078 | 92 | 0.494861 | RDamman |
71d84de8bc7087a21e5a617b0828c7683b10eb62 | 2,649 | cpp | C++ | Visualizer/Visualizer.cpp | VendorSniper/reg | 825dd4c638ca9be58abd6fcf62989a9c1899b61a | [
"MIT"
] | null | null | null | Visualizer/Visualizer.cpp | VendorSniper/reg | 825dd4c638ca9be58abd6fcf62989a9c1899b61a | [
"MIT"
] | null | null | null | Visualizer/Visualizer.cpp | VendorSniper/reg | 825dd4c638ca9be58abd6fcf62989a9c1899b61a | [
"MIT"
] | null | null | null | #include "Visualizer.h"
reg::Visualizer::Visualizer(vtkImageData *image) {
Initialize(image);
Execute(image);
}
void reg::Visualizer::Execute(vtkImageData *image) {
Wrapper<vtkRenderWindow>::Get()->AddRenderer(Wrapper<vtkRenderer>::Get());
Wrapper<vtkRenderWindowInteractor>::Get()->SetRenderWindow(
... | 44.898305 | 105 | 0.702529 | VendorSniper |
71d885eb80a49039d76e763b48f31c8a840120a0 | 40,544 | cpp | C++ | sbg/src/libpdb/Atomo.cpp | chaconlab/korpm | 5a73b5ab385150b580b2fd3f1b2ad26fa3d55cf3 | [
"MIT"
] | 1 | 2022-01-02T01:48:05.000Z | 2022-01-02T01:48:05.000Z | sbg/src/libpdb/Atomo.cpp | chaconlab/korpm | 5a73b5ab385150b580b2fd3f1b2ad26fa3d55cf3 | [
"MIT"
] | 1 | 2021-11-10T10:50:08.000Z | 2021-11-10T10:50:08.000Z | sbg/src/libpdb/Atomo.cpp | chaconlab/korpm | 5a73b5ab385150b580b2fd3f1b2ad26fa3d55cf3 | [
"MIT"
] | 1 | 2021-12-03T03:29:39.000Z | 2021-12-03T03:29:39.000Z |
/*Implementation of the different methods of the Atom Class*/
#include <stdio.h>
#include "Atomo.h"
using namespace std;
/*Table with the principal elements*/
Element Table_Elements::table_Elements[NUM_ELEMENTS]=
{
// Symbol Symbol group period number weight atomic cov vdw ... | 64.355556 | 212 | 0.540475 | chaconlab |
71e29fe3e2fab124ea2d209703403d9144b07590 | 18,789 | cpp | C++ | Src/media/NiceConnection.cpp | MrsZ/licode-windows | 578a779ddd200a7dbf5e84e0b5b0376c0c39827a | [
"MIT"
] | 60 | 2018-10-23T02:41:46.000Z | 2022-03-16T07:40:52.000Z | Src/media/NiceConnection.cpp | gupar/licode-windows | 578a779ddd200a7dbf5e84e0b5b0376c0c39827a | [
"MIT"
] | 3 | 2018-10-25T11:10:06.000Z | 2020-11-29T09:47:05.000Z | Src/media/NiceConnection.cpp | gupar/licode-windows | 578a779ddd200a7dbf5e84e0b5b0376c0c39827a | [
"MIT"
] | 46 | 2018-10-29T06:56:03.000Z | 2022-02-18T07:07:17.000Z | /*
* NiceConnection.cpp
*/
#include <nice/nice.h>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include "NiceConnection.h"
#include "SdpInfo.h"
using std::memcpy;
// If true (and configured properly below) erizo will generate relay candidates for itself
// MOSTLY USEFUL WHEN ERIZO ITSE... | 35.788571 | 120 | 0.685295 | MrsZ |
71efeb962cdec0a3b8a8e5b183162b74971fbcea | 558 | cpp | C++ | qir/qat/Rules/Patterns/AnyPattern.cpp | troelsfr/qat | 55ba460b6be307fc2ac7e8143bf14d7e117da161 | [
"MIT"
] | null | null | null | qir/qat/Rules/Patterns/AnyPattern.cpp | troelsfr/qat | 55ba460b6be307fc2ac7e8143bf14d7e117da161 | [
"MIT"
] | null | null | null | qir/qat/Rules/Patterns/AnyPattern.cpp | troelsfr/qat | 55ba460b6be307fc2ac7e8143bf14d7e117da161 | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
#include "Rules/IOperandPrototype.hpp"
#include "Rules/Patterns/AnyPattern.hpp"
namespace microsoft
{
namespace quantum
{
AnyPattern::AnyPattern() = default;
AnyPattern::~AnyPattern() = default;
bool AnyPattern::match(Value* inst... | 21.461538 | 66 | 0.68638 | troelsfr |
71f0a2f96e955c70479d6ea2c73fe6650449df67 | 3,076 | cpp | C++ | Code/System/Core/FileSystem/Platform/FileSystem_Win32.cpp | JuanluMorales/KRG | f3a11de469586a4ef0db835af4bc4589e6b70779 | [
"MIT"
] | 419 | 2022-01-27T19:37:43.000Z | 2022-03-31T06:14:22.000Z | Code/System/Core/FileSystem/Platform/FileSystem_Win32.cpp | jagt/KRG | ba20cd8798997b0450491b0cc04dc817c4a4bc76 | [
"MIT"
] | 2 | 2022-01-28T20:35:33.000Z | 2022-03-13T17:42:52.000Z | Code/System/Core/FileSystem/Platform/FileSystem_Win32.cpp | jagt/KRG | ba20cd8798997b0450491b0cc04dc817c4a4bc76 | [
"MIT"
] | 20 | 2022-01-27T20:41:02.000Z | 2022-03-26T16:16:57.000Z | #ifdef _WIN32
#include "../FileSystem.h"
#include "System/Core/Platform/PlatformHelpers_Win32.h"
#include "System/Core/Algorithm/Hash.h"
#include "System/Core/Math/Math.h"
#include <windows.h>
#include <shlwapi.h>
#include <shlobj.h>
#include <shellapi.h>
#include <fstream>
#include "../Time/Timers.h"
#i... | 31.71134 | 143 | 0.516255 | JuanluMorales |
71f37e064e4f31b9d0fed5724c98725d1715ef6f | 2,894 | hpp | C++ | include/nexus/quic/detail/connection_impl.hpp | cbodley/nexus | 6e5b19b6c6c74007a0643c55eb0775eb86e38f9b | [
"BSL-1.0"
] | 6 | 2021-10-31T10:33:30.000Z | 2022-03-25T20:54:58.000Z | include/nexus/quic/detail/connection_impl.hpp | cbodley/nexus | 6e5b19b6c6c74007a0643c55eb0775eb86e38f9b | [
"BSL-1.0"
] | null | null | null | include/nexus/quic/detail/connection_impl.hpp | cbodley/nexus | 6e5b19b6c6c74007a0643c55eb0775eb86e38f9b | [
"BSL-1.0"
] | null | null | null | #pragma once
#include <boost/intrusive/list.hpp>
#include <nexus/quic/detail/connection_state.hpp>
#include <nexus/quic/detail/service.hpp>
#include <nexus/quic/detail/stream_impl.hpp>
#include <nexus/udp.hpp>
struct lsquic_conn;
struct lsquic_stream;
namespace nexus::quic::detail {
struct accept_operation;
struct ... | 32.886364 | 81 | 0.701451 | cbodley |
71f65b43654fd22565096dbb1c2584d29ee356b3 | 104 | hpp | C++ | redvoid/src/Logger.hpp | fictionalist/RED-VOID | 01bacd893f095748d784e494c80a6a9c96481acc | [
"MIT"
] | 1 | 2021-01-04T01:31:34.000Z | 2021-01-04T01:31:34.000Z | redvoid/src/Logger.hpp | fictionalist/RED-VOID | 01bacd893f095748d784e494c80a6a9c96481acc | [
"MIT"
] | null | null | null | redvoid/src/Logger.hpp | fictionalist/RED-VOID | 01bacd893f095748d784e494c80a6a9c96481acc | [
"MIT"
] | 1 | 2021-01-05T00:55:47.000Z | 2021-01-05T00:55:47.000Z | #pragma once
#include <string>
namespace Logger {
bool init();
void log(std::string pattern, ...);
} | 13 | 36 | 0.663462 | fictionalist |
71fa3188959942010b1f365a7c1f2e06b69a368c | 1,148 | hpp | C++ | graphExplorer/graphExplorer/lubySequence.hpp | fq00/lubySequenceEAs | 6a107de687b3c2e159c8486ccc7eb02385c351c6 | [
"MIT"
] | null | null | null | graphExplorer/graphExplorer/lubySequence.hpp | fq00/lubySequenceEAs | 6a107de687b3c2e159c8486ccc7eb02385c351c6 | [
"MIT"
] | null | null | null | graphExplorer/graphExplorer/lubySequence.hpp | fq00/lubySequenceEAs | 6a107de687b3c2e159c8486ccc7eb02385c351c6 | [
"MIT"
] | null | null | null | //
// lubySequence.hpp
// graphExplorer
//
// Created by Francesco Quinzan on 06.09.17.
// Copyright © 2017 Francesco Quinzan. All rights reserved.
//
#ifndef lubySequence_hpp
#define lubySequence_hpp
#include <vector>
#include <limits>
#include <thread>
#include "EA.hpp"
using namespace std;
/* overloaded vect... | 18.819672 | 81 | 0.587979 | fq00 |
9f95c942849cae822a980f8e016e7fb0726c9233 | 2,903 | cpp | C++ | tests/world/test_terrain.cpp | Bycob/world | c6d943f9029c1bb227891507e5c6fe2b94cecfeb | [
"MIT"
] | 16 | 2021-03-14T16:30:32.000Z | 2022-03-18T13:41:53.000Z | tests/world/test_terrain.cpp | Tzian/world | 3ebb33305acd2a751cf44099b07c1e5d47578194 | [
"MIT"
] | 1 | 2020-04-21T12:59:37.000Z | 2020-04-23T17:49:03.000Z | tests/world/test_terrain.cpp | Tzian/world | 3ebb33305acd2a751cf44099b07c1e5d47578194 | [
"MIT"
] | 4 | 2020-03-08T14:04:50.000Z | 2020-12-03T08:51:04.000Z | #include <catch/catch.hpp>
#include <world/core.h>
#include <world/terrain.h>
using namespace world;
TEST_CASE("Terrain - getExactHeightAt", "[terrain]") {
Terrain terrain(2);
terrain(0, 0) = 1;
terrain(0, 1) = 0;
terrain(1, 0) = 0;
terrain(1, 1) = 1;
SECTION("getExactHeightAt trivial coordi... | 31.554348 | 78 | 0.529452 | Bycob |
9f961d3d37347d99a083232bf2ce7b47d1265203 | 13,941 | hpp | C++ | tests/functional/coherence/util/ObservableMapTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-01T21:38:30.000Z | 2021-11-03T01:35:11.000Z | tests/functional/coherence/util/ObservableMapTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 1 | 2020-07-24T17:29:22.000Z | 2020-07-24T18:29:04.000Z | tests/functional/coherence/util/ObservableMapTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-10T18:40:58.000Z | 2022-02-18T01:23:40.000Z | /*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates.
*
* Licensed under the Universal Permissive License v 1.0 as shown at
* http://oss.oracle.com/licenses/upl.
*/
#include "cxxtest/TestSuite.h"
#include "common/TestUtils.hpp"
#include "mock/CommonMocks.hpp"
#include "coherence/lang.ns"
#include "coherenc... | 42.895385 | 94 | 0.604476 | chpatel3 |
9fa0c153fc675b4efb68ca66ef5bc763a8c62a69 | 582 | cpp | C++ | engine/src/awesome/editor/menu_items/save_scene_as_menu_item.cpp | vitodtagliente/AwesomeEngine | eff06dbad1c4a168437f69800629a7e20619051c | [
"MIT"
] | 3 | 2019-08-15T18:57:20.000Z | 2020-01-09T22:19:26.000Z | engine/src/awesome/editor/menu_items/save_scene_as_menu_item.cpp | vitodtagliente/AwesomeEngine | eff06dbad1c4a168437f69800629a7e20619051c | [
"MIT"
] | null | null | null | engine/src/awesome/editor/menu_items/save_scene_as_menu_item.cpp | vitodtagliente/AwesomeEngine | eff06dbad1c4a168437f69800629a7e20619051c | [
"MIT"
] | null | null | null | #include "save_scene_as_menu_item.h"
#include <awesome/data/archive.h>
#include <awesome/asset/asset.h>
#include <awesome/encoding/json.h>
#include <awesome/entity/world.h>
namespace editor
{
void SaveSceneAsMenuItem::render()
{
m_saveFileDialog.render();
}
void SaveSceneAsMenuItem::execute()
{
m_saveFileDi... | 20.785714 | 136 | 0.69244 | vitodtagliente |
9fa77f7f0f4bb47b995986a46df2dc868c12fe62 | 16,389 | cpp | C++ | Source/Lutefisk3D/Graphics/Technique.cpp | Lutefisk3D/lutefisk3d | d2132b82003427511df0167f613905191b006eb5 | [
"Apache-2.0"
] | 2 | 2018-04-14T19:05:23.000Z | 2020-05-10T22:42:12.000Z | Source/Lutefisk3D/Graphics/Technique.cpp | Lutefisk3D/lutefisk3d | d2132b82003427511df0167f613905191b006eb5 | [
"Apache-2.0"
] | 4 | 2015-06-19T22:32:07.000Z | 2017-04-05T06:01:50.000Z | Source/Lutefisk3D/Graphics/Technique.cpp | nemerle/lutefisk3d | d2132b82003427511df0167f613905191b006eb5 | [
"Apache-2.0"
] | 1 | 2015-12-27T15:36:10.000Z | 2015-12-27T15:36:10.000Z | //
// Copyright (c) 2008-2017 the Urho3D project.
//
// 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, m... | 30.981096 | 159 | 0.680273 | Lutefisk3D |
9fab6047b372e0878f52e5aaa59da9c9b6b8641e | 1,777 | cpp | C++ | cpp/A0153/main.cpp | Modnars/LeetCode | 1c91fe9598418e6ed72233260f9cd8d5737fe216 | [
"Apache-2.0"
] | 2 | 2021-11-26T14:06:13.000Z | 2021-11-26T14:34:34.000Z | cpp/A0153/main.cpp | Modnars/LeetCode | 1c91fe9598418e6ed72233260f9cd8d5737fe216 | [
"Apache-2.0"
] | 2 | 2021-11-26T14:06:49.000Z | 2021-11-28T11:28:49.000Z | cpp/A0153/main.cpp | Modnars/LeetCode | 1c91fe9598418e6ed72233260f9cd8d5737fe216 | [
"Apache-2.0"
] | null | null | null | // URL : https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
// Author : Modnar
// Date : 2020/03/14
// Thanks : armeria(@leetcode.cn)
#include <bits/stdc++.h>
/* ************************* */
/**
* 暴力搜索
* 直接遍历，获取最小元素即可。
* 本题存在一个简单优化，当发现某两个值之间发生“递减”，则可直接返回最小值。
*/
// Complexity: Tim... | 26.924242 | 147 | 0.517727 | Modnars |
9fb0b2bd4169c0347f4c5c58708b5fc551f12dbe | 12,100 | cc | C++ | test/common/t__xdrbuf.cc | codesloop/codesloop | d66e51c2d898a72624306f611a90364c76deed06 | [
"BSD-2-Clause"
] | 3 | 2016-05-09T15:29:29.000Z | 2017-11-22T06:16:18.000Z | test/common/t__xdrbuf.cc | codesloop/codesloop | d66e51c2d898a72624306f611a90364c76deed06 | [
"BSD-2-Clause"
] | null | null | null | test/common/t__xdrbuf.cc | codesloop/codesloop | d66e51c2d898a72624306f611a90364c76deed06 | [
"BSD-2-Clause"
] | null | null | null | /*
Copyright (c) 2008,2009,2010, CodeSLoop Team
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaim... | 23.495146 | 105 | 0.594215 | codesloop |
9fb10a609bba3beeed23f82451423f8c42959681 | 1,227 | cpp | C++ | _includes/leet310/leet310_1.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | null | null | null | _includes/leet310/leet310_1.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | 8 | 2019-12-19T04:46:05.000Z | 2022-02-26T03:45:22.000Z | _includes/leet310/leet310_1.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
vector<int> vec[n+1];
int degree[n+1];
for(int i=0;i<=n;i++)
degree[i]=0;
for(int i=0;i<n-1;i++){
int a=edges[i].first;
int b=edges[i... | 24.54 | 74 | 0.354523 | mingdaz |
9fb38af70a117431bbc2af22d78c136261cc0063 | 1,656 | cpp | C++ | src/http/http_request.cpp | Mojiajun/tinyreactor | 94adab8941b1d4cf46297adec9f14d7ce26c44d8 | [
"MIT"
] | 1 | 2020-10-19T07:57:32.000Z | 2020-10-19T07:57:32.000Z | src/http/http_request.cpp | Mojiajun/tinyreactor | 94adab8941b1d4cf46297adec9f14d7ce26c44d8 | [
"MIT"
] | null | null | null | src/http/http_request.cpp | Mojiajun/tinyreactor | 94adab8941b1d4cf46297adec9f14d7ce26c44d8 | [
"MIT"
] | null | null | null | //
// Created by mojiajun on 2020/3/6.
//
#include "http_request.h"
using namespace tinyreactor;
bool HttpRequest::setMethod(const char *start, const char *end) {
assert(method_ == kInvalid);
std::string m(start, end);
if (m == "GET") {
method_ = kGet;
} else if (m == "POST") {
method_... | 25.090909 | 84 | 0.551329 | Mojiajun |
9fb3953228e99b21cb2bf39dc0a6ec9819a8d14a | 7,885 | hpp | C++ | include/veriblock/blockchain/pop/vbk_block_tree.hpp | Dmytro-Kyparenko/alt-integration-cpp | df18abdd4bfeec757c2df47efcaf4020d78880bb | [
"MIT"
] | null | null | null | include/veriblock/blockchain/pop/vbk_block_tree.hpp | Dmytro-Kyparenko/alt-integration-cpp | df18abdd4bfeec757c2df47efcaf4020d78880bb | [
"MIT"
] | null | null | null | include/veriblock/blockchain/pop/vbk_block_tree.hpp | Dmytro-Kyparenko/alt-integration-cpp | df18abdd4bfeec757c2df47efcaf4020d78880bb | [
"MIT"
] | null | null | null | // Copyright (c) 2019-2020 Xenios SEZC
// https://www.veriblock.org
// Distributed under the MIT software license, see the accompanying
// file LICENSE or http://www.opensource.org/licenses/mit-license.php.
#ifndef ALT_INTEGRATION_INCLUDE_VERIBLOCK_BLOCKCHAIN_VBK_BLOCK_TREE_HPP_
#define ALT_INTEGRATION_INCLUDE_VERIBLO... | 36.674419 | 79 | 0.703361 | Dmytro-Kyparenko |
9fc070a77f05979a683d6d8f19821838d8eaadd8 | 402 | hpp | C++ | day10/los.hpp | bcafuk/AoC-2019 | 5ff9b86f8483cd7a6e229d572ae9e34b894eb574 | [
"Zlib"
] | null | null | null | day10/los.hpp | bcafuk/AoC-2019 | 5ff9b86f8483cd7a6e229d572ae9e34b894eb574 | [
"Zlib"
] | null | null | null | day10/los.hpp | bcafuk/AoC-2019 | 5ff9b86f8483cd7a6e229d572ae9e34b894eb574 | [
"Zlib"
] | 2 | 2020-11-02T09:24:35.000Z | 2020-12-02T09:46:27.000Z | #ifndef AOC_2019_DAY10_LOS_HPP
#define AOC_2019_DAY10_LOS_HPP
#include <cstddef>
#include <set>
#include "Location.hpp"
std::set<Location> getVisible(const std::set<Location> &asteroids, const Location &origin, coordinate size);
inline size_t countVisible(const std::set<Location> &asteroids, const Location &origin,... | 25.125 | 108 | 0.776119 | bcafuk |
9fc0ab3bd2d8693cef845cc80c3064733410334d | 445 | cpp | C++ | SKYLINE.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2019-05-23T20:03:40.000Z | 2019-05-23T20:03:40.000Z | SKYLINE.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | null | null | null | SKYLINE.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2021-08-28T16:48:42.000Z | 2021-08-28T16:48:42.000Z | #include<stdio.h>
int arr[1005][1005]={{0}};
void catalan()
{
int i,j;
for(i=0;i<1005;i++)
{
for(j=0;j<=i;j++)
{
if(j==0)
arr[i][j]=1;
else
arr[i][j]=(arr[i][j-1]+arr[i-1][j])%1000000;
}
}
}
int main()
{
catalan();
i... | 15.344828 | 60 | 0.357303 | Akki5 |
9fc1608f0ef16a533eeb38a1a847e6cc9fe70607 | 1,473 | cpp | C++ | 890. Find and Replace Pattern.cpp | rajeev-ranjan-au6/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | 3 | 2020-12-30T00:29:59.000Z | 2021-01-24T22:43:04.000Z | 890. Find and Replace Pattern.cpp | rajeevranjancom/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | null | null | null | 890. Find and Replace Pattern.cpp | rajeevranjancom/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<string> findAndReplacePattern(vector<string>& words, string pattern) {
vector<string>res;
for (auto& s: words) {
if (isValid(s, pattern)) {
res.push_back(s);
}
}
return res;
}
bool isValid(string& a,... | 23.758065 | 81 | 0.395791 | rajeev-ranjan-au6 |
9fc1d4d7fa89f2790b17bd8b59789645edc8221b | 41,199 | cpp | C++ | src/vehicle_status.cpp | PX4/micrortps_agent | f7fee30b4a88d0627b2f92ca141277ace1a13597 | [
"BSD-3-Clause"
] | 3 | 2020-11-14T08:35:19.000Z | 2022-01-25T05:21:14.000Z | src/vehicle_status.cpp | PX4/micrortps_agent | f7fee30b4a88d0627b2f92ca141277ace1a13597 | [
"BSD-3-Clause"
] | 1 | 2021-06-10T11:41:17.000Z | 2021-06-10T11:41:17.000Z | src/vehicle_status.cpp | PX4/micrortps_agent | f7fee30b4a88d0627b2f92ca141277ace1a13597 | [
"BSD-3-Clause"
] | 2 | 2020-10-13T08:16:05.000Z | 2021-06-03T05:57:31.000Z | // Copyright 2016 Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless re... | 26.822266 | 101 | 0.767446 | PX4 |
9fc2c2a7f7a214ab9d6c5787343529ed720c8d07 | 36 | cpp | C++ | Software/CPU/myscrypt/build/cmake-3.12.3/Tests/CompileFeatures/cxx_alignas.cpp | duonglvtnaist/Multi-ROMix-Scrypt-Accelerator | 9cb9d96c72c3e912fb7cfd5a786e50e4844a1ee8 | [
"MIT"
] | 107 | 2021-08-28T20:08:42.000Z | 2022-03-22T08:02:16.000Z | Software/CPU/myscrypt/build/cmake-3.12.3/Tests/CompileFeatures/cxx_alignas.cpp | duonglvtnaist/Multi-ROMix-Scrypt-Accelerator | 9cb9d96c72c3e912fb7cfd5a786e50e4844a1ee8 | [
"MIT"
] | 3 | 2021-09-08T02:18:00.000Z | 2022-03-12T00:39:44.000Z | Software/CPU/myscrypt/build/cmake-3.12.3/Tests/CompileFeatures/cxx_alignas.cpp | duonglvtnaist/Multi-ROMix-Scrypt-Accelerator | 9cb9d96c72c3e912fb7cfd5a786e50e4844a1ee8 | [
"MIT"
] | 16 | 2021-08-30T06:57:36.000Z | 2022-03-22T08:05:52.000Z |
struct S1
{
alignas(8) int n;
};
| 6 | 19 | 0.555556 | duonglvtnaist |
9fc323305aff865969d7b9c2ee63bd7009a1c554 | 4,413 | cpp | C++ | src/wire/wire2lua/lua_source_stream.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 5 | 2016-04-07T19:49:39.000Z | 2021-08-03T05:24:11.000Z | src/wire/wire2lua/lua_source_stream.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | null | null | null | src/wire/wire2lua/lua_source_stream.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 1 | 2020-12-27T11:47:31.000Z | 2020-12-27T11:47:31.000Z | /*
* lua_source_stream.cpp
*
* Created on: Nov 23, 2017
* Author: zmij
*/
#include <wire/idl/generator.hpp>
#include <wire/idl/syntax_error.hpp>
#include <wire/wire2lua/lua_source_stream.hpp>
#include <iomanip>
namespace wire {
namespace idl {
namespace lua {
namespace {
::std::string const autogenerate... | 30.434483 | 109 | 0.469748 | zmij |
9fc4485039011f4bd14e9b94b527b57e8878848e | 3,077 | cpp | C++ | src/GBuffer.cpp | NotCamelCase/JBIC | 6304678696b65f66c560ecea91a52b5a1f528a7c | [
"MIT"
] | 5 | 2015-07-24T14:32:09.000Z | 2021-06-13T18:02:52.000Z | src/GBuffer.cpp | NotCamelCase/JBIC | 6304678696b65f66c560ecea91a52b5a1f528a7c | [
"MIT"
] | null | null | null | src/GBuffer.cpp | NotCamelCase/JBIC | 6304678696b65f66c560ecea91a52b5a1f528a7c | [
"MIT"
] | 1 | 2020-09-03T23:30:41.000Z | 2020-09-03T23:30:41.000Z | #include <GBuffer.h>
#include <Scene.h>
GBuffer::GBuffer(Scene* scene, GLuint texUnit)
: m_texUnitStart(texUnit), m_fbo(0), m_scene(scene)
{
assert(fillGBuffer() && "Error creating GBuffer content!");
}
GBuffer::~GBuffer()
{
glDeleteFramebuffers(1, &m_fbo);
}
bool GBuffer::fillGBuffer()
{
glGenFramebuffers(1, &... | 35.367816 | 130 | 0.809555 | NotCamelCase |
9fc644cb8aa87a0f9107502f02bc0d85ec21aa35 | 1,299 | cpp | C++ | Heap/K_Sorted_Array.cpp | susantabiswas/placementPrep | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | [
"MIT"
] | 19 | 2018-12-02T05:59:44.000Z | 2021-07-24T14:11:54.000Z | Heap/K_Sorted_Array.cpp | susantabiswas/placementPrep | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | [
"MIT"
] | null | null | null | Heap/K_Sorted_Array.cpp | susantabiswas/placementPrep | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | [
"MIT"
] | 13 | 2019-04-25T16:20:00.000Z | 2021-09-06T19:50:04.000Z | //given an array which is k sorted that means all the elements are atmost 'k'
//distance far from where they should be if they would have been sorted
//sort the array
/*
using heap:
take first 'k' elements and then heapify it
now for i = k to n-1 :
pop min from heap and insert arr[i] into heap
do this for th... | 21.65 | 84 | 0.639723 | susantabiswas |
9fcf670e1f4b22da78554e8d65612f76447fca22 | 8,609 | cc | C++ | src/GRPCClient.cc | mkaguilera/mvtx | 9e5e099a11131351b79aadea77ee5920100c352a | [
"BSD-2-Clause"
] | null | null | null | src/GRPCClient.cc | mkaguilera/mvtx | 9e5e099a11131351b79aadea77ee5920100c352a | [
"BSD-2-Clause"
] | null | null | null | src/GRPCClient.cc | mkaguilera/mvtx | 9e5e099a11131351b79aadea77ee5920100c352a | [
"BSD-2-Clause"
] | null | null | null | /*
* GRPCClient.cc
*
* Created on: Jun 7, 2016
* Author: theo
*/
#include <cassert>
#include <unistd.h>
#include "GRPCClient.h"
GRPCClient::RequestHandler::RequestHandler(GRPCClient *grpc_client, const std::string &addr)
: _grpc_client(grpc_client), _addr(addr) {}
GRPCClient::RequestHandler::~RequestH... | 30.856631 | 120 | 0.66988 | mkaguilera |
9fdb09273c63226f542a55c84cc12ba9588c67ce | 2,924 | hpp | C++ | Includes/Rosetta/PlayMode/Managers/CostManager.hpp | Hearthstonepp/Hearthstonepp | ee17ae6de1ee0078dab29d75c0fbe727a14e850e | [
"MIT"
] | 62 | 2017-08-21T14:11:00.000Z | 2018-04-23T16:09:02.000Z | Includes/Rosetta/PlayMode/Managers/CostManager.hpp | Hearthstonepp/Hearthstonepp | ee17ae6de1ee0078dab29d75c0fbe727a14e850e | [
"MIT"
] | 37 | 2017-08-21T11:13:07.000Z | 2018-04-30T08:58:41.000Z | Includes/Rosetta/PlayMode/Managers/CostManager.hpp | Hearthstonepp/Hearthstonepp | ee17ae6de1ee0078dab29d75c0fbe727a14e850e | [
"MIT"
] | 10 | 2017-08-21T03:44:12.000Z | 2018-01-10T22:29:10.000Z | // This code is based on Sabberstone project.
// Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva
// RosettaStone is hearthstone simulator using C++ with reinforcement learning.
// Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon
#ifndef ROSETTASTONE_PLAYMODE_COST_MANAGER_HPP
#define ROSETTA... | 35.228916 | 79 | 0.718194 | Hearthstonepp |
9fe9571953e4d4146a418a8b4c8819d9753e8af5 | 2,374 | hpp | C++ | Aha/Aha/Math/Color.hpp | templateguy/aha | 8965f3dfa318a8ee02e38fa082bbc5c8c6afa100 | [
"MIT"
] | null | null | null | Aha/Aha/Math/Color.hpp | templateguy/aha | 8965f3dfa318a8ee02e38fa082bbc5c8c6afa100 | [
"MIT"
] | null | null | null | Aha/Aha/Math/Color.hpp | templateguy/aha | 8965f3dfa318a8ee02e38fa082bbc5c8c6afa100 | [
"MIT"
] | 1 | 2018-04-27T05:48:41.000Z | 2018-04-27T05:48:41.000Z | //
// Color.hpp
// Aha
//
// Created by Priyanshi Thakur on 01/05/18.
// Copyright © 2018 Saurabh Sinha. All rights reserved.
//
#pragma once
#include "../Math/Vec3.hpp"
#include "../Math/Vec4.hpp"
namespace aha
{
class Color : public Vec4f
{
public:
Color() : Vec4f()
{
... | 21.981481 | 118 | 0.420388 | templateguy |
9ff59d3cac54cd8209ed57751e49f24f08645d63 | 1,263 | cpp | C++ | Evaluate Reverse Polish Notation.cpp | durgirajesh/Leetcode | 18b11cd90e8a5ce33f4029d5b7edf9502273bc76 | [
"MIT"
] | 2 | 2020-06-25T12:46:13.000Z | 2021-07-06T06:34:33.000Z | Evaluate Reverse Polish Notation.cpp | durgirajesh/Leetcode | 18b11cd90e8a5ce33f4029d5b7edf9502273bc76 | [
"MIT"
] | null | null | null | Evaluate Reverse Polish Notation.cpp | durgirajesh/Leetcode | 18b11cd90e8a5ce33f4029d5b7edf9502273bc76 | [
"MIT"
] | null | null | null | class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<long> st;
int n=tokens.size();
for(string str : tokens){
if(str=="+" || str=="-" || str=="*" || str=="/"){
int num1, num2;
if(!st.empty()){
num1... | 28.704545 | 62 | 0.262866 | durgirajesh |
b003e2a6c476dbee85b20b2d39d445b8d735481f | 781 | cpp | C++ | splus.tech/Source.cpp | sehe/splus.tech | c476305ef23253bb268d977aaf5b7f6ac60d9b3f | [
"MIT"
] | 2 | 2020-06-30T16:36:06.000Z | 2021-08-05T11:52:25.000Z | splus.tech/Source.cpp | sehe/splus.tech | c476305ef23253bb268d977aaf5b7f6ac60d9b3f | [
"MIT"
] | null | null | null | splus.tech/Source.cpp | sehe/splus.tech | c476305ef23253bb268d977aaf5b7f6ac60d9b3f | [
"MIT"
] | 1 | 2020-07-07T01:26:34.000Z | 2020-07-07T01:26:34.000Z | #include <string>
#include <iostream>
#include <vector>
#include "WebS.h"
#include <algorithm>
#include "menu.h"
using namespace std;
int main(int argc, char* argv[]) {
if (argc > 1 && argv[1][0] == '/') {
if (argv[1][1] == 's') {
string IP = argv[2];
int port = stoi(argv[3]);
WebS siteserv(IP.c_str(), po... | 18.595238 | 37 | 0.541613 | sehe |
b004e46b025814211cde93694094cc7a960cc93c | 39,694 | cpp | C++ | Source/HeliumRain/UI/Menus/FlareSkirmishSetupMenu.cpp | zhyinty/HeliumRain | 0096b9c9e9d0c0949d18624ea74b4991fdd175a2 | [
"BSD-3-Clause"
] | 646 | 2016-07-18T19:16:35.000Z | 2022-03-27T17:16:57.000Z | Source/HeliumRain/UI/Menus/FlareSkirmishSetupMenu.cpp | zhyinty/HeliumRain | 0096b9c9e9d0c0949d18624ea74b4991fdd175a2 | [
"BSD-3-Clause"
] | 2 | 2020-06-22T07:23:11.000Z | 2020-06-29T07:01:32.000Z | Source/HeliumRain/UI/Menus/FlareSkirmishSetupMenu.cpp | zhyinty/HeliumRain | 0096b9c9e9d0c0949d18624ea74b4991fdd175a2 | [
"BSD-3-Clause"
] | 114 | 2016-07-19T00:52:44.000Z | 2022-01-27T06:09:42.000Z |
#include "HeliumRain/UI/Menus/FlareSkirmishSetupMenu.h"
#include "../../Flare.h"
#include "../../Data/FlareCompanyCatalog.h"
#include "../../Data/FlareSpacecraftCatalog.h"
#include "../../Data/FlareSpacecraftComponentsCatalog.h"
#include "../../Data/FlareCustomizationCatalog.h"
#include "../../Data/FlareOrbitalMap.h"... | 26.114474 | 165 | 0.665617 | zhyinty |
b00fbb2b5fdd0175dcfcb55263d3d40ca7e11b07 | 326 | cpp | C++ | cpp/4353.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 9 | 2021-01-15T13:36:39.000Z | 2022-02-23T03:44:46.000Z | cpp/4353.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 1 | 2021-07-31T17:11:26.000Z | 2021-08-02T01:01:03.000Z | cpp/4353.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;
#define double long double
const double PI = acos(-1);
int main() {
fastio;
cout << fixed << setprecision(3);
for (double D, V; cin >> D >> V && D;) {
const double val = D * D * D - V * 6 / PI;
cout << cbrt(val) << '\n'... | 21.733333 | 45 | 0.592025 | jinhan814 |
b0134943ddeb234b4e3a57a75b3d09037c4e9db3 | 9,060 | cpp | C++ | src/items/value_item_map.cpp | kitsudaiki/libKitsunemimiSakuraParser | 5cc3c2de7717b01b02912c9a2e0dc578877e963d | [
"Apache-2.0"
] | null | null | null | src/items/value_item_map.cpp | kitsudaiki/libKitsunemimiSakuraParser | 5cc3c2de7717b01b02912c9a2e0dc578877e963d | [
"Apache-2.0"
] | 54 | 2020-08-27T21:40:28.000Z | 2021-12-30T20:56:13.000Z | src/items/value_item_map.cpp | kitsudaiki/libKitsunemimiSakuraParser | 5cc3c2de7717b01b02912c9a2e0dc578877e963d | [
"Apache-2.0"
] | null | null | null | /**
* @file value_item_map.h
*
* @author Tobias Anker <tobias.anker@kitsunemimi.moe>
*
* @copyright Apache License Version 2.0
*
* Copyright 2019 Tobias Anker
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with ... | 23.410853 | 98 | 0.620751 | kitsudaiki |
b0180077b6f31c48a6686f5e574a09fc4d7de072 | 577 | cpp | C++ | code/cpp/StringAnagram.cpp | analgorithmaday/analgorithmaday.github.io | d43f98803bc673f61334bff54eed381426ee902e | [
"MIT"
] | null | null | null | code/cpp/StringAnagram.cpp | analgorithmaday/analgorithmaday.github.io | d43f98803bc673f61334bff54eed381426ee902e | [
"MIT"
] | null | null | null | code/cpp/StringAnagram.cpp | analgorithmaday/analgorithmaday.github.io | d43f98803bc673f61334bff54eed381426ee902e | [
"MIT"
] | null | null | null | bool detect_anagram(char* src, char* anagram)
{
int isrc=0, iana=0;
while(*src != '\0') {
char* iter = anagram;
while(*iter != '\0' && *src != ' ') {
if(*src == *iter) {
iana++;
break;
}
iter++;
}
if(*src != ' ')... | 19.233333 | 45 | 0.410745 | analgorithmaday |
b01c6c73dd8f078d4ab0b4d34dc115116ace8f4c | 2,640 | hpp | C++ | sal/memory.hpp | svens/sal.lib | 8dee6a0ace5a5e4e8616f9cff98ea86ee8c4761c | [
"MIT"
] | 3 | 2017-03-21T20:39:25.000Z | 2018-03-27T10:45:45.000Z | sal/memory.hpp | svens/sal.lib | 8dee6a0ace5a5e4e8616f9cff98ea86ee8c4761c | [
"MIT"
] | 49 | 2016-04-17T10:48:35.000Z | 2018-12-29T10:00:55.000Z | sal/memory.hpp | svens/sal.lib | 8dee6a0ace5a5e4e8616f9cff98ea86ee8c4761c | [
"MIT"
] | 1 | 2017-03-21T20:48:24.000Z | 2017-03-21T20:48:24.000Z | #pragma once
/**
* \file sal/memory.hpp
* Iterator and memory pointer helpers.
*/
#include <sal/config.hpp>
#include <iterator>
#include <memory>
__sal_begin
namespace __bits {
template <typename T> constexpr bool is_const_ref_v = false;
template <typename T> constexpr bool is_const_ref_v<const T &> = true;
... | 20.952381 | 78 | 0.708333 | svens |
b01d33fdb12f244bb0018a7e9dee1924b576cfda | 295 | hpp | C++ | lib/Timing.hpp | CraGL/SubdivisionSkinning | c593a7a4e38a49716e9d3981824871a7b6c29324 | [
"Apache-2.0"
] | 19 | 2017-03-29T00:14:00.000Z | 2021-11-27T15:44:44.000Z | lib/Timing.hpp | Myzhencai/SubdivisionSkinning | c593a7a4e38a49716e9d3981824871a7b6c29324 | [
"Apache-2.0"
] | 1 | 2019-05-08T21:48:11.000Z | 2019-05-08T21:48:11.000Z | lib/Timing.hpp | Myzhencai/SubdivisionSkinning | c593a7a4e38a49716e9d3981824871a7b6c29324 | [
"Apache-2.0"
] | 5 | 2017-04-23T17:52:44.000Z | 2020-06-28T18:00:26.000Z | #ifndef __Timing_hpp__
#define __Timing_hpp__
void tic( const char* label = 0 ) ;
void toc( const char* label = 0 ) ;
struct Tick
{
Tick( const char* alabel = 0 ) : label( alabel ) { tic( label ); }
~Tick() { toc( label ); }
const char* label;
};
#endif /* __Timing_hpp__ */
| 18.4375 | 70 | 0.60339 | CraGL |
b02162aa82a4900b6ed9d5d2a109dd088a465dc4 | 945 | cpp | C++ | Word.cpp | dennistrukhin/C-Virtual-machine | 644be1f45c0d2804f93bddbfb4728e3d0c9fee5a | [
"MIT"
] | null | null | null | Word.cpp | dennistrukhin/C-Virtual-machine | 644be1f45c0d2804f93bddbfb4728e3d0c9fee5a | [
"MIT"
] | null | null | null | Word.cpp | dennistrukhin/C-Virtual-machine | 644be1f45c0d2804f93bddbfb4728e3d0c9fee5a | [
"MIT"
] | null | null | null | //
// Created by Dennis Trukhin on 21/04/2018.
//
#include <iostream>
#include "Word.h"
Word::Word(const char * word) {
for (int i = 0; i < 4; i++) {
w[i] = (unsigned char)word[i];
}
}
Word::Word(const unsigned char * word) {
for (int i = 0; i < 4; i++) {
w[i] = word[i];
}
}
unsigned... | 16.875 | 53 | 0.479365 | dennistrukhin |
b026fa1f34f46df9c8d3c941550ec74b12d0c415 | 24 | cpp | C++ | src/render/Renderer.cpp | Vasile2k/Luminica | 13250c6b536b0634e2f4ea95b7b75b0dee18705d | [
"Apache-2.0"
] | null | null | null | src/render/Renderer.cpp | Vasile2k/Luminica | 13250c6b536b0634e2f4ea95b7b75b0dee18705d | [
"Apache-2.0"
] | null | null | null | src/render/Renderer.cpp | Vasile2k/Luminica | 13250c6b536b0634e2f4ea95b7b75b0dee18705d | [
"Apache-2.0"
] | null | null | null | #include "Renderer.hpp"
| 12 | 23 | 0.75 | Vasile2k |
b02b5686a6056ba162952d42e3ab0eba21e908e3 | 220 | hpp | C++ | mlog/string_builder.hpp | Lowdham/mlog | 034134ec2048fb78084f4772275b5f67efeec433 | [
"MIT"
] | 2 | 2021-06-19T04:14:14.000Z | 2021-08-30T15:39:49.000Z | mlog/string_builder.hpp | Lowdham/mlog | 034134ec2048fb78084f4772275b5f67efeec433 | [
"MIT"
] | 1 | 2021-06-21T15:58:19.000Z | 2021-06-22T02:04:39.000Z | mlog/string_builder.hpp | Lowdham/mlog | 034134ec2048fb78084f4772275b5f67efeec433 | [
"MIT"
] | null | null | null | // This file is part of mlog
#ifndef MLOG_STRING_BUILDER_HPP_
#define MLOG_STRING_BUILDER_HPP_
#include "fwd.hpp"
namespace mlog {
//
class StringBuilder {};
} // namespace mlog
#endif // !MLOG_STRING_BUILDER_HPP_ | 15.714286 | 36 | 0.754545 | Lowdham |
b02e04da92fbfad6cc2e8612b93c7612590bc135 | 279 | cpp | C++ | old/main.cpp | melkir/AwesomeScheduler | 852a11dffc4996dc20bd0ef53143f3145cf37935 | [
"MIT"
] | null | null | null | old/main.cpp | melkir/AwesomeScheduler | 852a11dffc4996dc20bd0ef53143f3145cf37935 | [
"MIT"
] | null | null | null | old/main.cpp | melkir/AwesomeScheduler | 852a11dffc4996dc20bd0ef53143f3145cf37935 | [
"MIT"
] | null | null | null | #include "Scheduler.h"
#include "FCFSStrategy.h"
int main() {
FCFSStrategy fcfs;
Scheduler scheduler(fcfs);
scheduler.addProcess("A");
scheduler.addProcess("B");
scheduler.addProcess("C");
scheduler.addProcess("D");
scheduler.run(8);
return 0;
}
| 19.928571 | 30 | 0.65233 | melkir |
b034396b580e32fa8e069f41aeadf742429fa745 | 536 | cpp | C++ | CodeForces/Contest/386/G/code.cpp | sjj118/OI-Code | 964ea6e799d14010f305c7e4aee269d860a781f7 | [
"MIT"
] | null | null | null | CodeForces/Contest/386/G/code.cpp | sjj118/OI-Code | 964ea6e799d14010f305c7e4aee269d860a781f7 | [
"MIT"
] | null | null | null | CodeForces/Contest/386/G/code.cpp | sjj118/OI-Code | 964ea6e799d14010f305c7e4aee269d860a781f7 | [
"MIT"
] | null | null | null | #include<iostream>
#include<cstdio>
#define rg register
#define rep(i,x,y) for(rg int i=(x);i<=(y);++i)
#define per(i,x,y) for(rg int i=(x);i>=(y);--i)
using namespace std;
const int N=2e5+10;
int n,t,k,a[N],v[N];
int main(){
scanf("%d%d%d",&n,&t,&k);
rep(i,2,t+1)scanf("%d",&a[i]);
int mink=0,maxk=n-t;
a[1]=1;
rep... | 20.615385 | 47 | 0.533582 | sjj118 |
b035424cc48f2e0b6b73ed14e5fde247329448fb | 645 | cpp | C++ | src/Text/StringUtils/Base64.cpp | tak2004/RadonFramework | e916627a54a80fac93778d5010c50c09b112259b | [
"Apache-2.0"
] | 3 | 2015-09-15T06:57:50.000Z | 2021-03-16T19:05:02.000Z | src/Text/StringUtils/Base64.cpp | tak2004/RadonFramework | e916627a54a80fac93778d5010c50c09b112259b | [
"Apache-2.0"
] | 2 | 2015-09-26T12:41:10.000Z | 2015-12-08T08:41:37.000Z | src/Text/StringUtils/Base64.cpp | tak2004/RadonFramework | e916627a54a80fac93778d5010c50c09b112259b | [
"Apache-2.0"
] | 1 | 2015-07-09T02:56:34.000Z | 2015-07-09T02:56:34.000Z | #include "RadonFramework/precompiled.hpp"
#include "RadonFramework/Text/StringUtils/Base64.hpp"
#include "RadonFramework/backend/stringcoders/modp_b64.h"
namespace RadonFramework::Text::StringUtils {
RF_Type::String Base64Converter::Encode(const RF_Type::String &Source)
{
std::string str = modp::b64_encode(Source... | 30.714286 | 72 | 0.733333 | tak2004 |
b0402173786ab45d7b6d30e8add62bd93b85462d | 4,907 | cpp | C++ | src/org/apache/poi/hssf/extractor/EventBasedExcelExtractor.cpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | src/org/apache/poi/hssf/extractor/EventBasedExcelExtractor.cpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | src/org/apache/poi/hssf/extractor/EventBasedExcelExtractor.cpp | pebble2015/cpoi | 6dcc0c5e13e3e722b4ef9fd0baffbf62bf71ead6 | [
"Apache-2.0"
] | null | null | null | // Generated from /POI/java/org/apache/poi/hssf/extractor/EventBasedExcelExtractor.java
#include <org/apache/poi/hssf/extractor/EventBasedExcelExtractor.hpp>
#include <java/io/IOException.hpp>
#include <java/lang/IllegalStateException.hpp>
#include <java/lang/NullPointerException.hpp>
#include <java/lang/RuntimeExcept... | 36.619403 | 154 | 0.745058 | pebble2015 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.