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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ffdd43ba4229406425d2e3a80e059cf7bbfec4b7 | 3,314 | hpp | C++ | include/obzerver/circular_buffer.hpp | AutonomyLab/obzerver | 71d95f82946f76119b8b8fe9c34be6976477504d | [
"Apache-2.0"
] | 6 | 2016-10-15T04:34:47.000Z | 2019-03-06T19:05:49.000Z | include/obzerver/circular_buffer.hpp | AutonomyLab/obzerver | 71d95f82946f76119b8b8fe9c34be6976477504d | [
"Apache-2.0"
] | null | null | null | include/obzerver/circular_buffer.hpp | AutonomyLab/obzerver | 71d95f82946f76119b8b8fe9c34be6976477504d | [
"Apache-2.0"
] | 8 | 2016-01-25T08:10:35.000Z | 2018-08-14T14:36:36.000Z | #ifndef CIRCULAR_BUFFER
#define CIRCULAR_BUFFER
#include <deque>
#include <cassert>
#include <stdexcept>
template<typename T>
class CircularBuffer {
private:
std::size_t max_sz;
std::deque<T> buffer;
T dummy;
public:
typedef typename std::deque<T>::iterator iterator;
typedef typename std::deque<T>::const_i... | 20.842767 | 87 | 0.655401 | AutonomyLab |
ffdf843818650242f9ad83c8930e2f1463e83753 | 8,350 | cpp | C++ | CLR/Libraries/SPOT/spot_native.cpp | PervasiveDigital/netmf-interpreter | 03d84fe76e0b666ebec62d17d69c55c45940bc40 | [
"Apache-2.0"
] | 529 | 2015-03-10T00:17:45.000Z | 2022-03-17T02:21:19.000Z | CLR/Libraries/SPOT/spot_native.cpp | PervasiveDigital/netmf-interpreter | 03d84fe76e0b666ebec62d17d69c55c45940bc40 | [
"Apache-2.0"
] | 495 | 2015-03-10T22:02:46.000Z | 2019-05-16T13:05:00.000Z | CLR/Libraries/SPOT/spot_native.cpp | PervasiveDigital/netmf-interpreter | 03d84fe76e0b666ebec62d17d69c55c45940bc40 | [
"Apache-2.0"
] | 332 | 2015-03-10T08:04:36.000Z | 2022-03-29T04:18:36.000Z | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) Microsoft Corporation. All rights reserved.
///////////////////////////////////////////////////////... | 59.219858 | 228 | 0.823593 | PervasiveDigital |
ffe6215f6158e9e5feee0db60bcb07f9a633d762 | 5,073 | cpp | C++ | src/settings/tabtexteditor.cpp | nameisalreadytakenexception/PairStormIDE | 7c41dc91611f9a9db62c8c9ac0373e0fe33fec59 | [
"MIT"
] | 4 | 2019-07-23T13:00:58.000Z | 2021-09-24T19:03:01.000Z | src/settings/tabtexteditor.cpp | nameisalreadytakenexception/PairStormIDE | 7c41dc91611f9a9db62c8c9ac0373e0fe33fec59 | [
"MIT"
] | 4 | 2019-07-23T12:33:11.000Z | 2019-08-20T11:39:16.000Z | src/settings/tabtexteditor.cpp | nameisalreadytakenexception/PairStormIDE | 7c41dc91611f9a9db62c8c9ac0373e0fe33fec59 | [
"MIT"
] | 1 | 2019-11-02T15:07:13.000Z | 2019-11-02T15:07:13.000Z | #include "tabtexteditor.h"
#include <QHBoxLayout>
#include <QSettings>
#include <QTreeWidget>
#include <QComboBox>
#include <QLabel>
#include <QTextEdit>
#include <QFontDatabase>
#include <QDebug>
TabTextEditor::TabTextEditor(QWidget *parent)
: QWidget(parent)
{
QHBoxLayout *mainLayout = new QHBoxLayout;
... | 27.421622 | 112 | 0.673172 | nameisalreadytakenexception |
ffe7f0058b6fdb18e002ad15b54f65af93137360 | 2,921 | cpp | C++ | Source/PsDataPlugin/Private/Collection/PsDataBlueprintArrayProxy.cpp | mjukel/PsData | d0f11c82f23b18d32fe30dab259b16329d385a77 | [
"MIT"
] | null | null | null | Source/PsDataPlugin/Private/Collection/PsDataBlueprintArrayProxy.cpp | mjukel/PsData | d0f11c82f23b18d32fe30dab259b16329d385a77 | [
"MIT"
] | null | null | null | Source/PsDataPlugin/Private/Collection/PsDataBlueprintArrayProxy.cpp | mjukel/PsData | d0f11c82f23b18d32fe30dab259b16329d385a77 | [
"MIT"
] | null | null | null | // Copyright 2015-2019 Mail.Ru Group. All Rights Reserved.
#include "Collection/PsDataBlueprintArrayProxy.h"
#include "PsDataCore.h"
UPsDataBlueprintArrayProxy::UPsDataBlueprintArrayProxy(const class FObjectInitializer& ObjectInitializer)
: Super(ObjectInitializer)
, Proxy()
{
}
void UPsDataBlueprintArrayProxy::I... | 27.046296 | 109 | 0.747004 | mjukel |
ffeb91d8f68140d4b114a02de42c1f35cdcbe3da | 342 | cpp | C++ | src/Elba/Framework/Module.cpp | nicholasammann/kotor-builder | ab0e042c09974a024a9884c6f9e34cf85ad63eeb | [
"MIT"
] | 1 | 2018-10-01T19:34:57.000Z | 2018-10-01T19:34:57.000Z | src/Elba/Framework/Module.cpp | nicholasammann/kotor-builder | ab0e042c09974a024a9884c6f9e34cf85ad63eeb | [
"MIT"
] | 9 | 2018-09-09T16:07:22.000Z | 2018-11-06T20:34:30.000Z | src/Elba/Framework/Module.cpp | nicholasammann/kotor-builder | ab0e042c09974a024a9884c6f9e34cf85ad63eeb | [
"MIT"
] | null | null | null | /**
* \file Module.cpp
* \author Nicholas Ammann
* \date 2/24/2018
* \brief Member function definitions for Module.
*/
#include "Elba/Framework/Module.hpp"
#include "Elba/Engine.hpp"
namespace Elba
{
Module::Module(Engine* engine)
: mEngine(engine)
{
}
Engine* Module::GetEngine() const
{
return mEngine;
}
} // ... | 14.25 | 48 | 0.69883 | nicholasammann |
ffec787f0a1d49c22e8916aa92fe2f5ccf4d5121 | 2,152 | cc | C++ | example/provider_demo.cc | yvanwang/workflow-polaris | 06f296fcaa1a55941b2dde07952daca2186c6396 | [
"Apache-2.0"
] | null | null | null | example/provider_demo.cc | yvanwang/workflow-polaris | 06f296fcaa1a55941b2dde07952daca2186c6396 | [
"Apache-2.0"
] | null | null | null | example/provider_demo.cc | yvanwang/workflow-polaris | 06f296fcaa1a55941b2dde07952daca2186c6396 | [
"Apache-2.0"
] | null | null | null | #include <signal.h>
#include <unistd.h>
#include <string>
#include "PolarisManager.h"
#include "workflow/WFFacilities.h"
#include "workflow/WFHttpServer.h"
using namespace polaris;
static WFFacilities::WaitGroup register_wait_group(1);
static WFFacilities::WaitGroup deregister_wait_group(1);
void sig_handler(int sig... | 26.243902 | 66 | 0.677509 | yvanwang |
ffef2641ed1653fa4b7ff0f624ae14d9d4961d90 | 3,220 | cpp | C++ | src/app/ChunkedWriteCallback.cpp | jcps07/connectedhomeip | 8ce48a73258899a9cfd61bec7a7f085b02eeeffd | [
"Apache-2.0"
] | 4 | 2020-09-11T04:32:44.000Z | 2022-03-11T09:06:07.000Z | src/app/ChunkedWriteCallback.cpp | jcps07/connectedhomeip | 8ce48a73258899a9cfd61bec7a7f085b02eeeffd | [
"Apache-2.0"
] | null | null | null | src/app/ChunkedWriteCallback.cpp | jcps07/connectedhomeip | 8ce48a73258899a9cfd61bec7a7f085b02eeeffd | [
"Apache-2.0"
] | null | null | null | /*
*
* Copyright (c) 2022 Project CHIP Authors
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE... | 35.777778 | 131 | 0.692547 | jcps07 |
ffefd8a66300792ef85f319b274397da3b2bb2a2 | 6,773 | hpp | C++ | include/jsoncons/tag_type.hpp | watkinsr/jsoncons | c7ab614fe86670a423941b11704a02ad71d745a1 | [
"BSL-1.0"
] | 507 | 2015-01-05T18:50:55.000Z | 2022-03-30T16:50:10.000Z | include/jsoncons/tag_type.hpp | watkinsr/jsoncons | c7ab614fe86670a423941b11704a02ad71d745a1 | [
"BSL-1.0"
] | 272 | 2015-01-20T13:09:19.000Z | 2022-03-28T18:00:37.000Z | include/jsoncons/tag_type.hpp | watkinsr/jsoncons | c7ab614fe86670a423941b11704a02ad71d745a1 | [
"BSL-1.0"
] | 140 | 2015-01-14T01:11:37.000Z | 2022-03-29T08:35:35.000Z | // Copyright 2019 Daniel Parker
// Distributed under the Boost license, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
// See https://github.com/danielaparker/jsoncons for latest version
#ifndef JSONCONS_TAG_TYPE_HPP
#define JSONCONS_TAG_TYPE_HPP
#include <ost... | 27.53252 | 123 | 0.635021 | watkinsr |
fff180f167ae669863138a6ae22163ed55574659 | 1,395 | cpp | C++ | codeforces/1474C.cpp | sgrade/cpptest | 84ade6ec03ea394d4a4489c7559d12b4799c0b62 | [
"MIT"
] | null | null | null | codeforces/1474C.cpp | sgrade/cpptest | 84ade6ec03ea394d4a4489c7559d12b4799c0b62 | [
"MIT"
] | null | null | null | codeforces/1474C.cpp | sgrade/cpptest | 84ade6ec03ea394d4a4489c7559d12b4799c0b62 | [
"MIT"
] | null | null | null | // C. Array Destruction
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
vector<int> check (int n, vector<int> v, int x){
multiset<int> s(v.begin(), v.end());
vector<int> output;
for (int i = 0; i < n; ++i){
auto last_element = s.end();
--las... | 21.136364 | 72 | 0.423656 | sgrade |
fff4056b5411431d941ae56a6b1649a5d7dfa9c7 | 776 | cc | C++ | code30/cpp/20190722/new.cc | stdbilly/CS_Note | a8a87e135a525d53c283a4c70fb942c9ca59a758 | [
"MIT"
] | 2 | 2020-12-09T09:55:51.000Z | 2021-01-08T11:38:22.000Z | code30/cpp/20190722/new.cc | stdbilly/CS_Note | a8a87e135a525d53c283a4c70fb942c9ca59a758 | [
"MIT"
] | null | null | null | code30/cpp/20190722/new.cc | stdbilly/CS_Note | a8a87e135a525d53c283a4c70fb942c9ca59a758 | [
"MIT"
] | null | null | null | ///
/// @file new.cc
/// @author lemon(haohb13@gmail.com)
/// @date 2019-07-22 15:59:19
///
#include <stdlib.h>
#include <string.h>
#include <iostream>
using std::cout;
using std::endl;
void test0()
{
int * pint = (int *)malloc(sizeof(int));//系统调用
*pint = 10;
int * pint2 = (int *)malloc(sizeof(int)... | 14.641509 | 48 | 0.600515 | stdbilly |
fffaeab0f9214ae1ada25cc4a6433a2a946e2476 | 664 | cpp | C++ | src/StatusPage.cpp | openMSX/wxcatapult | 388428af2b0767853f5b8a09540b1c61c64afda8 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 12 | 2015-06-29T21:58:33.000Z | 2020-11-02T10:46:08.000Z | src/StatusPage.cpp | openMSX/wxcatapult | 388428af2b0767853f5b8a09540b1c61c64afda8 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 41 | 2015-06-24T12:42:26.000Z | 2021-08-29T22:03:23.000Z | src/StatusPage.cpp | openMSX/wxcatapult | 388428af2b0767853f5b8a09540b1c61c64afda8 | [
"Naumen",
"Condor-1.1",
"MS-PL"
] | 4 | 2019-02-02T16:02:17.000Z | 2022-02-15T03:05:17.000Z | #include "StatusPage.h"
#include "wxCatapultApp.h"
#include <wx/textctrl.h>
#include <wx/wxprec.h>
#include <wx/xrc/xmlres.h>
IMPLEMENT_CLASS(StatusPage, wxPanel)
BEGIN_EVENT_TABLE(StatusPage, wxPanel)
END_EVENT_TABLE()
StatusPage::StatusPage(wxWindow* parent)
{
wxXmlResource::Get()->LoadPanel(this, parent, wxT("Sta... | 22.896552 | 66 | 0.753012 | openMSX |
fffbd1d909ef2d2ceb5e31495cdefebbdbb2c697 | 982 | cpp | C++ | Matrix/Make Matrix Beautiful.cpp | pkunjam/Data-Structures-and-Algorithms | 0730bb95347cc824207b5304787b34f4de29ff86 | [
"MIT"
] | 1 | 2020-07-21T20:13:07.000Z | 2020-07-21T20:13:07.000Z | Matrix/Make Matrix Beautiful.cpp | pkunjam/Data-Structures-and-Algorithms | 0730bb95347cc824207b5304787b34f4de29ff86 | [
"MIT"
] | null | null | null | Matrix/Make Matrix Beautiful.cpp | pkunjam/Data-Structures-and-Algorithms | 0730bb95347cc824207b5304787b34f4de29ff86 | [
"MIT"
] | null | null | null | // { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
int findMinOpeartion(int matrix[][100], int n);
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int mat[n][100];
for(int i=0;i<n;i++)for(int j=0;j<n;j++)cin>>mat[i][j];
cout << findMinO... | 17.854545 | 63 | 0.467413 | pkunjam |
080316fcccd0df886566843a74fe008800d32c28 | 4,875 | cpp | C++ | arduino/opencr_fw/opencr_fw_arduino/src/sketch/turtlebot3/turtlebot_waffle/turtlebot3_core/turtlebot3_motor_driver.cpp | ipa-jba/OpenCR | 09bf34f5f9ebc1253e03ac789cf820dcc46eb99d | [
"Apache-2.0"
] | null | null | null | arduino/opencr_fw/opencr_fw_arduino/src/sketch/turtlebot3/turtlebot_waffle/turtlebot3_core/turtlebot3_motor_driver.cpp | ipa-jba/OpenCR | 09bf34f5f9ebc1253e03ac789cf820dcc46eb99d | [
"Apache-2.0"
] | null | null | null | arduino/opencr_fw/opencr_fw_arduino/src/sketch/turtlebot3/turtlebot_waffle/turtlebot3_core/turtlebot3_motor_driver.cpp | ipa-jba/OpenCR | 09bf34f5f9ebc1253e03ac789cf820dcc46eb99d | [
"Apache-2.0"
] | 2 | 2018-02-19T15:35:17.000Z | 2020-01-22T15:56:35.000Z | /*******************************************************************************
* Copyright 2016 ROBOTIS 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.o... | 29.36747 | 136 | 0.728205 | ipa-jba |
0803660a7850e933b19b482782cefcf96d0ecc30 | 4,780 | cpp | C++ | src/server_sctp_helper_one_to_many.cpp | z4pu/tcp_to_tls | b5e4923d2da2a220d14f08c5f6dd5b726ac9d962 | [
"MIT"
] | 2 | 2020-05-17T17:16:48.000Z | 2020-08-02T13:03:00.000Z | src/server_sctp_helper_one_to_many.cpp | z4pu/tcp_to_tls | b5e4923d2da2a220d14f08c5f6dd5b726ac9d962 | [
"MIT"
] | 1 | 2019-12-25T02:41:30.000Z | 2021-10-13T11:18:26.000Z | src/server_sctp_helper_one_to_many.cpp | z4pu/tcp_to_tls | b5e4923d2da2a220d14f08c5f6dd5b726ac9d962 | [
"MIT"
] | null | null | null | #include "server_sctp_helper_one_to_many.hpp"
#include "common.hpp"
#include "common_sctp.hpp"
extern "C" {
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <netinet/in.h>
#include <netinet/sctp.h>
#include <sys/un.h>
#include <arpa/inet.h>
}
extern "C" {
#inc... | 28.622754 | 111 | 0.590795 | z4pu |
080beaccce222e476f7c25b3eb8598f0c292e76f | 396 | cpp | C++ | inverted_pattern.cpp | VivekWesley/CPP_BASICS | 536d4e3b6c94e13ab5263f38c3a2e80f077b2d29 | [
"MIT"
] | null | null | null | inverted_pattern.cpp | VivekWesley/CPP_BASICS | 536d4e3b6c94e13ab5263f38c3a2e80f077b2d29 | [
"MIT"
] | null | null | null | inverted_pattern.cpp | VivekWesley/CPP_BASICS | 536d4e3b6c94e13ab5263f38c3a2e80f077b2d29 | [
"MIT"
] | 1 | 2022-01-17T09:27:19.000Z | 2022-01-17T09:27:19.000Z | // inverted pattern
// SAMPLE OUTPUT:
//enter a number
// 5
// 1 2 3 4 5
// 1 2 3 4
// 1 2 3
// 1 2
// 1
#include <Iostream>
using namespace std;
int main()
{
int n;
cout << "enter a number" << endl;
cin >> n;
for (int i = n; i >= 1; i--)
{
for (int j = 1; j <= i; j++)
{
... | 12.774194 | 37 | 0.414141 | VivekWesley |
080ce021e8672bfe696250b6d49b6a293a77521d | 483 | hpp | C++ | convolution/inverse-fast-walsh-hadamard-transform.hpp | dutinmeow/library | 3501f36656795f432ac816941ec7e9548dc3d6ef | [
"MIT"
] | 7 | 2022-01-23T07:58:19.000Z | 2022-02-25T04:11:12.000Z | convolution/inverse-fast-walsh-hadamard-transform.hpp | dutinmeow/library | 3501f36656795f432ac816941ec7e9548dc3d6ef | [
"MIT"
] | null | null | null | convolution/inverse-fast-walsh-hadamard-transform.hpp | dutinmeow/library | 3501f36656795f432ac816941ec7e9548dc3d6ef | [
"MIT"
] | null | null | null | #include "convolution/fast-walsh-hadamard-transform.hpp"
#pragma region inverse_fast_walsh_hadamard_transform
namespace conv {
template<typename T>
void inverse_fast_walsh_hadamard_transform(vector<T> &a) {
fast_walsh_hadamard_transform<T>(a);
if constexpr (is_integral<T>::value) {
int n = a.size();
for (... | 23 | 59 | 0.6853 | dutinmeow |
0812b74c7d6108587a20dcd174578936a17cefca | 2,039 | hh | C++ | include/attribute_info.hh | AnthonyCalandra/bytecode-scanner | e2638a7063447bc947f0bc11d841d536735407ec | [
"MIT"
] | 8 | 2019-07-21T20:15:46.000Z | 2021-06-15T12:28:12.000Z | include/attribute_info.hh | AnthonyCalandra/bytecode-scanner | e2638a7063447bc947f0bc11d841d536735407ec | [
"MIT"
] | null | null | null | include/attribute_info.hh | AnthonyCalandra/bytecode-scanner | e2638a7063447bc947f0bc11d841d536735407ec | [
"MIT"
] | 1 | 2020-09-24T08:28:04.000Z | 2020-09-24T08:28:04.000Z | /**
* Copyright 2019 Anthony Calandra
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this software
* and associated documentation files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use, copy, modify, merge, publish,
* di... | 41.612245 | 103 | 0.793526 | AnthonyCalandra |
08166686aa59551d0148d54d79afc652387de7c3 | 5,351 | cpp | C++ | test/streamutils_test.cpp | Skemba/alt-integration-cpp | d9871d56746aabee2f7678af7004cfbc1e17213b | [
"MIT"
] | null | null | null | test/streamutils_test.cpp | Skemba/alt-integration-cpp | d9871d56746aabee2f7678af7004cfbc1e17213b | [
"MIT"
] | null | null | null | test/streamutils_test.cpp | Skemba/alt-integration-cpp | d9871d56746aabee2f7678af7004cfbc1e17213b | [
"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.
#include <gtest/gtest.h>
#include <vector>
#include <veriblock/read_stream.hpp>
#include <veriblock/write_strea... | 32.041916 | 78 | 0.646608 | Skemba |
081c38183c60b4e042c8bb56d2c281f49d96fc37 | 1,282 | cpp | C++ | source/vector/Sort/quickSortRand.cpp | Tridu33/myclionarch | d4e41b3465a62a83cbf6c7119401c05009f4b636 | [
"MIT"
] | null | null | null | source/vector/Sort/quickSortRand.cpp | Tridu33/myclionarch | d4e41b3465a62a83cbf6c7119401c05009f4b636 | [
"MIT"
] | null | null | null | source/vector/Sort/quickSortRand.cpp | Tridu33/myclionarch | d4e41b3465a62a83cbf6c7119401c05009f4b636 | [
"MIT"
] | null | null | null | //
// Created by tridu33 on 9/27/2021.
//
#include "quickSortRand.h"
#include <stdlib.h> /* srand, rand */
using namespace std;
#include <bits/stdc++.h>
class Solution {
public:
int partition(vector<int> & nums,int l,int r){
int pivot = nums[r];
int s = l,e = r-1;
while(s<=e){
... | 26.163265 | 57 | 0.517941 | Tridu33 |
081dd4e6fd71f785dc42d66e92cc7772d4578452 | 5,067 | cpp | C++ | Alfred/src/ApiHttp.cpp | rhymu8354/Alfred | 225c16ed578ebc8221021a8a164c52d17f89fdf7 | [
"MIT"
] | null | null | null | Alfred/src/ApiHttp.cpp | rhymu8354/Alfred | 225c16ed578ebc8221021a8a164c52d17f89fdf7 | [
"MIT"
] | null | null | null | Alfred/src/ApiHttp.cpp | rhymu8354/Alfred | 225c16ed578ebc8221021a8a164c52d17f89fdf7 | [
"MIT"
] | null | null | null | /**
* @file ApiHttp.cpp
*
* This module contains the implementation of functions which implement an
* Application Programming Interface (API) to the service via Hypertext
* Transfer Protocol (HTTP).
*/
#include "ApiHttp.hpp"
#include <functional>
#include <Json/Value.hpp>
#include <memory>
#include <unordered_... | 33.78 | 98 | 0.548056 | rhymu8354 |
082e473f456f5e141cd6a0116c0031c4c200b167 | 20,158 | hpp | C++ | project/include/Alter/PipelineLayout.hpp | helixd2s/ZEON | b4b6394fa15e7a8ebeaa336d8bf6f45e2d096d46 | [
"MIT"
] | null | null | null | project/include/Alter/PipelineLayout.hpp | helixd2s/ZEON | b4b6394fa15e7a8ebeaa336d8bf6f45e2d096d46 | [
"MIT"
] | null | null | null | project/include/Alter/PipelineLayout.hpp | helixd2s/ZEON | b4b6394fa15e7a8ebeaa336d8bf6f45e2d096d46 | [
"MIT"
] | null | null | null | #pragma once
//
#ifdef __cplusplus
#include "./Core.hpp"
#include "./Instance.hpp"
#include "./Device.hpp"
//#include "./Resource.hpp"
//
struct DescriptorBindings {
std::vector<vk::DescriptorSetLayoutBinding> bindings = {};
std::vector<vk::DescriptorBindingFlags> bindingFlags = {};
};
//
namespace ANAMED {... | 50.269327 | 283 | 0.710239 | helixd2s |
082e88e0210a7b20e595672aec799aae86ffaaba | 4,555 | hh | C++ | nox/src/nox/netapps/user_event_log/log_entry.hh | ayjazz/OESS | deadc504d287febc7cbd7251ddb102bb5c8b1f04 | [
"Apache-2.0"
] | 28 | 2015-02-04T13:59:25.000Z | 2021-12-29T03:44:47.000Z | nox/src/nox/netapps/user_event_log/log_entry.hh | ayjazz/OESS | deadc504d287febc7cbd7251ddb102bb5c8b1f04 | [
"Apache-2.0"
] | 552 | 2015-01-05T18:25:54.000Z | 2022-03-16T18:51:13.000Z | nox/src/nox/netapps/user_event_log/log_entry.hh | ayjazz/OESS | deadc504d287febc7cbd7251ddb102bb5c8b1f04 | [
"Apache-2.0"
] | 25 | 2015-02-04T18:48:20.000Z | 2020-06-18T15:51:05.000Z | #ifndef __LOG_ENTRY_HH__
#define __LOG_ENTRY_HH__
#include "bindings_storage/bindings_storage.hh"
#include "data/datatypes.hh"
namespace vigil {
namespace applications {
// This class represents a single log message, along with the
// information that will be used to insert high-level names into
// the log mess... | 38.931624 | 82 | 0.67618 | ayjazz |
082f26d3515c0123deff69d5d7e57c2fc65a60f6 | 1,074 | cc | C++ | opi/emacs/windows/ppid.cc | Ahzed11/mozart2 | 4806504b103e11be723e7813be8f69e4d85875cf | [
"BSD-2-Clause"
] | 379 | 2015-01-02T20:27:33.000Z | 2022-03-26T23:18:17.000Z | opi/emacs/windows/ppid.cc | Ahzed11/mozart2 | 4806504b103e11be723e7813be8f69e4d85875cf | [
"BSD-2-Clause"
] | 81 | 2015-01-08T13:18:52.000Z | 2021-12-21T14:02:21.000Z | opi/emacs/windows/ppid.cc | Ahzed11/mozart2 | 4806504b103e11be723e7813be8f69e4d85875cf | [
"BSD-2-Clause"
] | 75 | 2015-01-06T09:08:20.000Z | 2021-12-17T09:40:18.000Z | /*
* Authors:
* Leif Kornstaedt <kornstae@ps.uni-sb.de>
* Ralf Scheidhauer <scheidhr@dfki.de>
*
* Copyright:
* Leif Kornstaedt, 1999
* Ralf Scheidhauer, 1999
*
* Last change:
* $Date$ by $Author$
* $Revision$
*
* This file is part of Mozart, an implementation of Oz 3:
* http://... | 22.375 | 75 | 0.673184 | Ahzed11 |
083038068bcca8bc777a3c88fbc7fccdfdc8ee6a | 499 | cpp | C++ | Test/AOJ/TopologicalSort.test.cpp | maguroplusia/Library | 02e0e277986833fe1c12e20b3677a553b7b27346 | [
"CC0-1.0"
] | null | null | null | Test/AOJ/TopologicalSort.test.cpp | maguroplusia/Library | 02e0e277986833fe1c12e20b3677a553b7b27346 | [
"CC0-1.0"
] | null | null | null | Test/AOJ/TopologicalSort.test.cpp | maguroplusia/Library | 02e0e277986833fe1c12e20b3677a553b7b27346 | [
"CC0-1.0"
] | null | null | null | #define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/4/GRL_4_B"
#define IGNORE
#include<bits/stdc++.h>
using namespace std;
#include"../../Other/Template.cpp"
#include"../../Graph/TopologicalSort.cpp"
int main() {
cin >> N;
int M;
cin >> M;
for(int i = 0;i < M;i++) {
int s,... | 20.791667 | 82 | 0.543086 | maguroplusia |
083ee3a067734900431b9592bbe07a9cb0e228e8 | 1,106 | cpp | C++ | src/0811.cpp | killf/leetcode_cpp | d1f308a9c3da55ae5416ea28ec2e7a3146533ae9 | [
"MIT"
] | null | null | null | src/0811.cpp | killf/leetcode_cpp | d1f308a9c3da55ae5416ea28ec2e7a3146533ae9 | [
"MIT"
] | null | null | null | src/0811.cpp | killf/leetcode_cpp | d1f308a9c3da55ae5416ea28ec2e7a3146533ae9 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <hash_map>
#include <map>
#include <sstream>
#include <type_traits>
#include <algorithm>
#include <stack>
#include <queue>
#include <bitset>
#include <set>
using namespace std;
vector<string> get_all_domains(const string &s) {
vector<... | 20.481481 | 59 | 0.608499 | killf |
08418781039ecfbe9969e0d77b1797ab3e97ddb7 | 6,048 | cpp | C++ | OREData/ored/portfolio/portfolio.cpp | paul-giltinan/Engine | 49b6e142905ca2cce93c2ae46e9ac69380d9f7a1 | [
"BSD-3-Clause"
] | null | null | null | OREData/ored/portfolio/portfolio.cpp | paul-giltinan/Engine | 49b6e142905ca2cce93c2ae46e9ac69380d9f7a1 | [
"BSD-3-Clause"
] | null | null | null | OREData/ored/portfolio/portfolio.cpp | paul-giltinan/Engine | 49b6e142905ca2cce93c2ae46e9ac69380d9f7a1 | [
"BSD-3-Clause"
] | null | null | null | /*
Copyright (C) 2016 Quaternion Risk Management Ltd
All rights reserved.
This file is part of ORE, a free-software/open-source library
for transparent pricing and risk analysis - http://opensourcerisk.org
ORE is free software: you can redistribute it and/or modify it
under the terms of the Modified BSD License... | 32.691892 | 113 | 0.604828 | paul-giltinan |
0842862027183166d682912b5a9e1784c0fe6cad | 2,753 | cpp | C++ | src/test/boost_utils/serial_port_test.cpp | PolarGoose/UtilsH | 2b94d4244149f9612d0c3e0f1552cfd1315e5f68 | [
"MIT"
] | 1 | 2021-07-20T14:35:56.000Z | 2021-07-20T14:35:56.000Z | src/test/boost_utils/serial_port_test.cpp | PolarGoose/UtilsH | 2b94d4244149f9612d0c3e0f1552cfd1315e5f68 | [
"MIT"
] | null | null | null | src/test/boost_utils/serial_port_test.cpp | PolarGoose/UtilsH | 2b94d4244149f9612d0c3e0f1552cfd1315e5f68 | [
"MIT"
] | null | null | null | #include "utils/socat_loopback_serial_port.h"
#include "utils_h/boost_utils/serial_port.h"
#include "utils_h/concurrency/waiting_queue.h"
#include <boost/range/irange.hpp>
#include <gtest/gtest.h>
using namespace utils_h;
using namespace concurrency;
using namespace boost_utils;
using namespace testing;
using namespac... | 29.287234 | 111 | 0.714493 | PolarGoose |
0845952a10053f9eb70bcec6dc242ec42431bac7 | 9,225 | hpp | C++ | include/Newtonsoft/Json/Converters/DataTableConverter.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/Newtonsoft/Json/Converters/DataTableConverter.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | null | null | null | include/Newtonsoft/Json/Converters/DataTableConverter.hpp | v0idp/virtuoso-codegen | 6f560f04822c67f092d438a3f484249072c1d21d | [
"Unlicense"
] | 1 | 2022-03-30T21:07:35.000Z | 2022-03-30T21:07:35.000Z | // Autogenerated from CppHeaderCreator
// Created by Sc2ad
// =========================================================================
#pragma once
// Begin includes
#include "beatsaber-hook/shared/utils/typedefs.h"
#include "beatsaber-hook/shared/utils/byref.hpp"
// Including type: Newtonsoft.Json.JsonConverter
#incl... | 64.0625 | 307 | 0.755881 | v0idp |
36b0b125724a6a8ac343a481f545cb27ac2b9d55 | 5,224 | hpp | C++ | include/CQLDriver/Common/ColumnTypes/Time.hpp | cpv-project/cpv-cql-driver | 66eebfd4e9ec75dc49cd4a7073a51a830236807a | [
"MIT"
] | 41 | 2018-01-23T09:27:32.000Z | 2021-02-15T15:49:07.000Z | include/CQLDriver/Common/ColumnTypes/Time.hpp | cpv-project/cpv-cql-driver | 66eebfd4e9ec75dc49cd4a7073a51a830236807a | [
"MIT"
] | 20 | 2018-01-25T04:25:48.000Z | 2019-03-09T02:49:41.000Z | include/CQLDriver/Common/ColumnTypes/Time.hpp | cpv-project/cpv-cql-driver | 66eebfd4e9ec75dc49cd4a7073a51a830236807a | [
"MIT"
] | 5 | 2018-04-10T12:19:13.000Z | 2020-02-17T03:30:50.000Z | #pragma once
#include <iomanip>
#include "./ColumnDefinitions.hpp"
#include "./DateTimeBase.hpp"
namespace cql {
/**
* An 8 byte two's complement long representing nanoseconds since midnignt.
* Valid values are in the range 0 to 86'3999'9999'9999
*/
class Time : private DateTimeBase {
public:
using DateTime... | 34.596026 | 88 | 0.675919 | cpv-project |
36b1aa71d1ee62fe7612ccf769e9f37e5b58a0a3 | 384 | cpp | C++ | A. Stones on the Table.cpp | Samim-Arefin/Codeforce-Problem-Solution | 7219ee6173faaa9e06231d4cd3e9ba292ae27ce3 | [
"MIT"
] | null | null | null | A. Stones on the Table.cpp | Samim-Arefin/Codeforce-Problem-Solution | 7219ee6173faaa9e06231d4cd3e9ba292ae27ce3 | [
"MIT"
] | null | null | null | A. Stones on the Table.cpp | Samim-Arefin/Codeforce-Problem-Solution | 7219ee6173faaa9e06231d4cd3e9ba292ae27ce3 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int main()
{
int size;
while (cin >> size)
{
string str;
for (int i = 0; i < size; i++)
{
char ch;
cin >> ch;
str.push_back(ch);
}
int count = 0;
for (int i = 0; i <size - 1; i++)
{
for (int j = i; j <= i; j++)
{
if (str[j] == str[j + 1])
... | 13.714286 | 35 | 0.445313 | Samim-Arefin |
36b47ab98d0731781ad2664a6d4a671a6300dfe6 | 707 | hpp | C++ | include/RED4ext/Scripting/Natives/Generated/game/ui/UnlockableProgram.hpp | WSSDude420/RED4ext.SDK | eaca8bdf7b92c48422b18431ed8cd0876f53bdb3 | [
"MIT"
] | null | null | null | include/RED4ext/Scripting/Natives/Generated/game/ui/UnlockableProgram.hpp | WSSDude420/RED4ext.SDK | eaca8bdf7b92c48422b18431ed8cd0876f53bdb3 | [
"MIT"
] | null | null | null | include/RED4ext/Scripting/Natives/Generated/game/ui/UnlockableProgram.hpp | WSSDude420/RED4ext.SDK | eaca8bdf7b92c48422b18431ed8cd0876f53bdb3 | [
"MIT"
] | null | null | null | #pragma once
// This file is generated from the Game's Reflection data
#include <cstdint>
#include <RED4ext/Common.hpp>
#include <RED4ext/CName.hpp>
#include <RED4ext/NativeTypes.hpp>
namespace RED4ext
{
namespace game::ui {
struct UnlockableProgram
{
static constexpr const char* NAME = "gameuiUnlockableProgram... | 23.566667 | 66 | 0.697313 | WSSDude420 |
36b4806dc61fbbd50418c375f355a2cbaf74d2a0 | 11,034 | cpp | C++ | src/tests/Interop/COM/NativeClients/Dispatch/Client.cpp | AustinWise/runtime | 0df6dac02c71ca400e81c62d6cd18366dec519c4 | [
"MIT"
] | 1 | 2021-09-08T07:08:49.000Z | 2021-09-08T07:08:49.000Z | src/tests/Interop/COM/NativeClients/Dispatch/Client.cpp | mknotzer/runtime | 2b2eb5ad72cd22c7ce0364efa836e3372cecc092 | [
"MIT"
] | null | null | null | src/tests/Interop/COM/NativeClients/Dispatch/Client.cpp | mknotzer/runtime | 2b2eb5ad72cd22c7ce0364efa836e3372cecc092 | [
"MIT"
] | 2 | 2021-05-17T22:12:46.000Z | 2021-05-19T06:21:16.000Z | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
#include "ClientTests.h"
#include <memory>
void Validate_Numeric_In_ReturnByRef();
void Validate_Float_In_ReturnAndUpdateByRef();
void Validate_Double_In_ReturnAndUpdateByRef();
vo... | 27.044118 | 135 | 0.642741 | AustinWise |
36c0d750124fa417c4cb5eb3691658d7aaa511ad | 1,867 | cpp | C++ | src/c/schemas/ModioQueuedModUpload.cpp | nlspartanNL/SDK | 291f1e5869210baedbb5447f8f7388f50ec93950 | [
"MIT"
] | 1 | 2018-10-05T15:59:04.000Z | 2018-10-05T15:59:04.000Z | src/c/schemas/ModioQueuedModUpload.cpp | nlspartanNL/SDK | 291f1e5869210baedbb5447f8f7388f50ec93950 | [
"MIT"
] | null | null | null | src/c/schemas/ModioQueuedModUpload.cpp | nlspartanNL/SDK | 291f1e5869210baedbb5447f8f7388f50ec93950 | [
"MIT"
] | 1 | 2020-11-06T01:42:10.000Z | 2020-11-06T01:42:10.000Z | #include "c/schemas/ModioQueuedModfileUpload.h"
extern "C"
{
void modioInitQueuedModfileUpload(ModioQueuedModfileUpload* queued_modfile_upload, nlohmann::json queued_modfile_upload_json)
{
queued_modfile_upload->state = 0;
if(modio::hasKey(queued_modfile_upload_json, "state"))
queued_modfile_upload->... | 39.723404 | 127 | 0.759507 | nlspartanNL |
36cc78ba0d78273057473ace90f77d999ab85a18 | 1,667 | cpp | C++ | src/math/beta_distribution.cpp | anuranbaka/Vulcan | 56339f77f6cf64b5fda876445a33e72cd15ce028 | [
"MIT"
] | 3 | 2020-03-05T23:56:14.000Z | 2021-02-17T19:06:50.000Z | src/math/beta_distribution.cpp | anuranbaka/Vulcan | 56339f77f6cf64b5fda876445a33e72cd15ce028 | [
"MIT"
] | 1 | 2021-03-07T01:23:47.000Z | 2021-03-07T01:23:47.000Z | src/math/beta_distribution.cpp | anuranbaka/Vulcan | 56339f77f6cf64b5fda876445a33e72cd15ce028 | [
"MIT"
] | 1 | 2021-03-03T07:54:16.000Z | 2021-03-03T07:54:16.000Z | /* Copyright (C) 2010-2019, The Regents of The University of Michigan.
All rights reserved.
This software was developed as part of the The Vulcan project in the Intelligent Robotics Lab
under the direction of Benjamin Kuipers, kuipers@umich.edu. Use of this code is governed by an
MIT-style License that can be foun... | 20.580247 | 95 | 0.671866 | anuranbaka |
36ce5a4e30f29ea685c39d972b15f9df4e4279a2 | 637 | cpp | C++ | File Handlers/CHK/Sections/CHKSectionTECS.cpp | poiuyqwert/SCMS | 8aa5f90a8f4caf1db489614fdbd5fb2decf783d7 | [
"MIT"
] | null | null | null | File Handlers/CHK/Sections/CHKSectionTECS.cpp | poiuyqwert/SCMS | 8aa5f90a8f4caf1db489614fdbd5fb2decf783d7 | [
"MIT"
] | null | null | null | File Handlers/CHK/Sections/CHKSectionTECS.cpp | poiuyqwert/SCMS | 8aa5f90a8f4caf1db489614fdbd5fb2decf783d7 | [
"MIT"
] | null | null | null | //
// CHKSectionTECS.cpp
// SCMS
//
// Created by Zach Zahos on 2016-01-04.
//
//
#include "CHKSectionTECS.h"
#include <string>
const CHKRequirements CHKSectionTECS::Requirements = {CHKVer::VanillaHybrid, CHKGameMode::UseMapSettings};
CHKSectionTECS::CHKSectionTECS(CHK *chk)
: CHKSection(chk)
{
#warning COMPLEX ... | 22.75 | 106 | 0.733124 | poiuyqwert |
36d078ed379ae6ed4740bb4c58bf1e6e18544f18 | 1,380 | cpp | C++ | random/random.cpp | fjanisze/UnnamedGame | 572e9c504a2242f77d375ad220b3c881cffc8ce2 | [
"MIT"
] | null | null | null | random/random.cpp | fjanisze/UnnamedGame | 572e9c504a2242f77d375ad220b3c881cffc8ce2 | [
"MIT"
] | null | null | null | random/random.cpp | fjanisze/UnnamedGame | 572e9c504a2242f77d375ad220b3c881cffc8ce2 | [
"MIT"
] | null | null | null | #include "random.hpp"
#include "../logger/logger.hpp"
#include <limits>
namespace random_engine
{
random::random():
eng(rd()),
dist(std::numeric_limits<llong>::min(),
std::numeric_limits<llong>::max())
{
LOG3("Starting the game random engine.");
llong_randoms.reserve(random_numbers_limis);
... | 25.090909 | 90 | 0.667391 | fjanisze |
36d3bc77c953af9b6ee032afc175f8acb5f2ab53 | 5,925 | inl | C++ | External/gli/core/image.inl | SuperflyJon/VulkanPlayground | 891b88227b66fc1e933ff77c1603e5d685d89047 | [
"MIT"
] | 2 | 2021-01-25T16:59:56.000Z | 2021-02-14T21:11:05.000Z | External/gli/core/image.inl | SuperflyJon/VulkanPlayground | 891b88227b66fc1e933ff77c1603e5d685d89047 | [
"MIT"
] | null | null | null | External/gli/core/image.inl | SuperflyJon/VulkanPlayground | 891b88227b66fc1e933ff77c1603e5d685d89047 | [
"MIT"
] | 1 | 2021-04-23T10:20:53.000Z | 2021-04-23T10:20:53.000Z | namespace gli{
namespace detail
{
inline size_t texel_linear_aAdressing
(
extent1d const& Extent,
extent1d const& TexelCoord
)
{
GLI_ASSERT(glm::all(glm::lessThan(TexelCoord, Extent)));
return static_cast<size_t>(TexelCoord.x);
}
inline size_t texel_linear_adressing
(
extent2d const& Extent,
extent... | 23.511905 | 126 | 0.700591 | SuperflyJon |
36d8eab4e8d10f87e5ec91b0cdea644557f797fc | 384 | cpp | C++ | src/pin.cpp | glehmann/gpedal | 6226fe2ff275e910f49f44f2b644569ab71a8910 | [
"Apache-2.0"
] | null | null | null | src/pin.cpp | glehmann/gpedal | 6226fe2ff275e910f49f44f2b644569ab71a8910 | [
"Apache-2.0"
] | null | null | null | src/pin.cpp | glehmann/gpedal | 6226fe2ff275e910f49f44f2b644569ab71a8910 | [
"Apache-2.0"
] | 1 | 2021-04-03T18:00:58.000Z | 2021-04-03T18:00:58.000Z | #include "pin.h"
#include <Arduino.h>
#include <Wire.h>
void pin_setup() {
// no need for 12 bits resolution - the usual 10 bits is more than enough
// and much more stable
analogReadResolution(10);
// activate other boards and power button led
pinMode(PIN_STATUS, OUTPUT);
digitalWrite(PIN_STAT... | 25.6 | 77 | 0.679688 | glehmann |
36d9b8d45aaf7eb16cb6f8e35d253d3dba4a3d02 | 2,007 | cpp | C++ | bfloat/arithmetic/bfloat_subtract.cpp | mrdcvlsc/bignum | 7e3b03069495e7f2151d25d5f62c35075f9b6a7f | [
"MIT"
] | 8 | 2020-11-17T02:12:14.000Z | 2021-08-09T02:02:13.000Z | bfloat/arithmetic/bfloat_subtract.cpp | mrdcvlsc/bignum | 7e3b03069495e7f2151d25d5f62c35075f9b6a7f | [
"MIT"
] | 2 | 2020-12-03T05:43:51.000Z | 2021-01-16T14:15:25.000Z | bfloat/arithmetic/bfloat_subtract.cpp | mrdcvlsc/bignum | 7e3b03069495e7f2151d25d5f62c35075f9b6a7f | [
"MIT"
] | 2 | 2021-01-13T05:23:27.000Z | 2021-02-10T04:38:32.000Z | #ifndef BFLOAT_SUBTRACT_HPP
#define BFLOAT_SUBTRACT_HPP
#include <iostream>
#include "../bfloat.hpp"
namespace apa
{
bfloat bfloat::operator-(const bfloat& rhs) const
{
bfloat difference = *this;
difference-=rhs;
return difference;
}
bfloat& bfloat::operator-=(const bfloat& rh... | 25.0875 | 71 | 0.433981 | mrdcvlsc |
36dcb324fd4507aa05b0170714674ba05f46bd79 | 1,497 | cpp | C++ | Game/src/RenderList.cpp | realn/exptor3D | 85bafa0a4c59eb15102756046805e4f9b23245c2 | [
"MIT"
] | null | null | null | Game/src/RenderList.cpp | realn/exptor3D | 85bafa0a4c59eb15102756046805e4f9b23245c2 | [
"MIT"
] | null | null | null | Game/src/RenderList.cpp | realn/exptor3D | 85bafa0a4c59eb15102756046805e4f9b23245c2 | [
"MIT"
] | null | null | null | #include "RenderList.h"
CRenderList::CRenderList( gfx::TextureRepository& texManager, gfx::ModelManager& modelManager ) :
TexManager( texManager ),
ModelManager( modelManager )
{
}
void CRenderList::Add( IRenderable* pObj )
{
if( std::find( List.cbegin(), List.cend(), pObj ) == List.cend() )
{
List.push_back( p... | 18.7125 | 97 | 0.625251 | realn |
36e32eef0c078316a8af99b2a49b199a5329a7f0 | 293 | hpp | C++ | src/Elliptic/DiscontinuousGalerkin/DiscontinuousGalerkin.hpp | trami18/spectre | 6b1f6497bf2e26d1474bfadf143b3321942c40b4 | [
"MIT"
] | 2 | 2021-04-11T04:07:42.000Z | 2021-04-11T05:07:54.000Z | src/Elliptic/DiscontinuousGalerkin/DiscontinuousGalerkin.hpp | trami18/spectre | 6b1f6497bf2e26d1474bfadf143b3321942c40b4 | [
"MIT"
] | 1 | 2022-03-25T18:26:16.000Z | 2022-03-25T19:30:39.000Z | src/Elliptic/DiscontinuousGalerkin/DiscontinuousGalerkin.hpp | isaaclegred/spectre | 5765da85dad680cad992daccd479376c67458a8c | [
"MIT"
] | null | null | null | // Distributed under the MIT License.
// See LICENSE.txt for details.
/// \file
/// Documents the elliptic::dg namespace
#pragma once
namespace elliptic {
/// Functionality related to discontinuous Galerkin discretizations of elliptic
/// equations
namespace dg {}
} // namespace elliptic
| 20.928571 | 79 | 0.74744 | trami18 |
36e4da6036375fbb6bfe5c6a9f7f5ac8407dcd79 | 53 | tpp | C++ | examples/imp1/ns1.tpp | kobbled/vscode-tpp-extension | fc787694845b913ff09ce1abc4eb92142a7f6e7d | [
"MIT"
] | 1 | 2021-12-20T20:48:10.000Z | 2021-12-20T20:48:10.000Z | examples/imp1/ns1.tpp | kobbled/vscode-tpp-extension | fc787694845b913ff09ce1abc4eb92142a7f6e7d | [
"MIT"
] | null | null | null | examples/imp1/ns1.tpp | kobbled/vscode-tpp-extension | fc787694845b913ff09ce1abc4eb92142a7f6e7d | [
"MIT"
] | 2 | 2021-07-12T07:02:19.000Z | 2021-09-30T14:09:09.000Z | namespace ns1
CONST1 := 3.14
CONST2 := 2.7182
end | 13.25 | 18 | 0.660377 | kobbled |
36e774e1b7301cb17816e80c8474b1e555717e5c | 467 | cpp | C++ | Difficulty 1/friday.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | Difficulty 1/friday.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | Difficulty 1/friday.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main() {
int T, D, M, month, day, ft;
cin >> T;
for(int i = 0; i < T; i++) {
cin >> D >> M;
day = 0;
ft = 0;
for (int j = 0; j < M; j++) {
cin >> month;
for (int k = 0; k < month; k++) {
i... | 20.304348 | 46 | 0.308351 | BrynjarGeir |
36ee6774b09b5d7f2134dcd1c83c9be0a8bca458 | 1,870 | cpp | C++ | DP/adding.cpp | zyzkevin/C-Programming-and-Algorithms | be9642b62a3285341990c25bdc3c124c4dd8c38b | [
"MIT"
] | null | null | null | DP/adding.cpp | zyzkevin/C-Programming-and-Algorithms | be9642b62a3285341990c25bdc3c124c4dd8c38b | [
"MIT"
] | null | null | null | DP/adding.cpp | zyzkevin/C-Programming-and-Algorithms | be9642b62a3285341990c25bdc3c124c4dd8c38b | [
"MIT"
] | null | null | null | /*
张雨泽1900094801
B:最佳加法表达式
2020/05/19
*/
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
string sum (string a, string b)
{
string tmp;
int flag = 0;
int al = a.length(), bl = b.length();
for (int i = al - 1, j = bl - 1; i >= 0 || j >= 0; i--, j--)
{
//moving a... | 23.974359 | 119 | 0.409626 | zyzkevin |
36f8dcaeb7b0a04c3aaf8e1df43f84e428f2274c | 7,010 | cpp | C++ | src/effects/Echo.cpp | gspeedtech/Audacity | 570c5651c5934469c18dad25db03f05076f91225 | [
"CC-BY-3.0"
] | 16 | 2015-01-26T18:58:26.000Z | 2017-11-12T05:42:58.000Z | src/effects/Echo.cpp | gspeedtech/Audacity | 570c5651c5934469c18dad25db03f05076f91225 | [
"CC-BY-3.0"
] | null | null | null | src/effects/Echo.cpp | gspeedtech/Audacity | 570c5651c5934469c18dad25db03f05076f91225 | [
"CC-BY-3.0"
] | 7 | 2015-04-13T20:01:00.000Z | 2021-07-05T09:28:22.000Z | /**********************************************************************
Audacity: A Digital Audio Editor
Echo.cpp
Dominic Mazzoni
Vaughan Johnson (dialog)
*******************************************************************//**
\class EffectEcho
\brief An Effect that causes an echo, variable delay and volum... | 24.256055 | 90 | 0.592582 | gspeedtech |
36ff9ab5c339f1f7e1f85d60a823fdcd31e43b1d | 993 | cpp | C++ | android-31/android/text/method/DialerKeyListener.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 12 | 2020-03-26T02:38:56.000Z | 2022-03-14T08:17:26.000Z | android-31/android/text/method/DialerKeyListener.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 1 | 2021-01-27T06:07:45.000Z | 2021-11-13T19:19:43.000Z | android-29/android/text/method/DialerKeyListener.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 3 | 2021-02-02T12:34:55.000Z | 2022-03-08T07:45:57.000Z | #include "../../../JCharArray.hpp"
#include "../../view/KeyEvent.hpp"
#include "./DialerKeyListener.hpp"
namespace android::text::method
{
// Fields
JCharArray DialerKeyListener::CHARACTERS()
{
return getStaticObjectField(
"android.text.method.DialerKeyListener",
"CHARACTERS",
"[C"
);
}
// QJniObje... | 22.066667 | 104 | 0.703927 | YJBeetle |
36ffc20c676389be161a2dce23b468ebdaac2f6e | 6,337 | cpp | C++ | Engine/Code/Engine/Renderer/DepthStencilState.cpp | cugone/Abrams2019 | 0b94c43275069275bbbeadfa773c336fa1947882 | [
"MIT"
] | 1 | 2020-07-14T06:58:50.000Z | 2020-07-14T06:58:50.000Z | Engine/Code/Engine/Renderer/DepthStencilState.cpp | cugone/Abrams2019 | 0b94c43275069275bbbeadfa773c336fa1947882 | [
"MIT"
] | 1 | 2020-04-06T06:52:11.000Z | 2020-04-06T06:52:19.000Z | Engine/Code/Engine/Renderer/DepthStencilState.cpp | cugone/Abrams2019 | 0b94c43275069275bbbeadfa773c336fa1947882 | [
"MIT"
] | 2 | 2019-05-01T21:49:33.000Z | 2021-04-01T08:22:21.000Z | #include "Engine/Renderer/DepthStencilState.hpp"
#include "Engine/Core/BuildConfig.hpp"
#include "Engine/Core/ErrorWarningAssert.hpp"
#include "Engine/RHI/RHIDevice.hpp"
#include "Engine/Renderer/DirectX/DX11.hpp"
#include <string>
void DepthStencilState::SetDebugName([[maybe_unused]] const std::string& name) const ... | 49.507813 | 138 | 0.738678 | cugone |
36ffedf6cde7d04d5bb17f40b53e19333b8acbba | 1,850 | hpp | C++ | samples/boost.asio/drink_shop/drink_shop_transaction.hpp | roamingunner/cmake-template | c4254d261eb945ae7fdff83f28b1bab999f72e8c | [
"Apache-2.0"
] | null | null | null | samples/boost.asio/drink_shop/drink_shop_transaction.hpp | roamingunner/cmake-template | c4254d261eb945ae7fdff83f28b1bab999f72e8c | [
"Apache-2.0"
] | null | null | null | samples/boost.asio/drink_shop/drink_shop_transaction.hpp | roamingunner/cmake-template | c4254d261eb945ae7fdff83f28b1bab999f72e8c | [
"Apache-2.0"
] | null | null | null | #ifndef _DRINK_SHOP_TRANSACTION_H_
#define _DRINK_SHOP_TRANSACTION_H_
#include <stdint.h>
#include <string>
#include <vector>
#include <ctime>
#include <iostream>
#include "aixlog.hpp"
using namespace std;
class transacation
{
private:
/* data */
uint32_t tid_;
uint32_t rid_;
string type_;
string ... | 28.030303 | 119 | 0.571351 | roamingunner |
3c07fbe9cc3a2dd20b02684c5b17544b9c39e8a8 | 15,993 | cpp | C++ | android-31/android/view/accessibility/AccessibilityNodeInfo_AccessibilityAction.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 12 | 2020-03-26T02:38:56.000Z | 2022-03-14T08:17:26.000Z | android-31/android/view/accessibility/AccessibilityNodeInfo_AccessibilityAction.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 1 | 2021-01-27T06:07:45.000Z | 2021-11-13T19:19:43.000Z | android-31/android/view/accessibility/AccessibilityNodeInfo_AccessibilityAction.cpp | YJBeetle/QtAndroidAPI | 1468b5dc6eafaf7709f0b00ba1a6ec2b70684266 | [
"Apache-2.0"
] | 3 | 2021-02-02T12:34:55.000Z | 2022-03-08T07:45:57.000Z | #include "../../os/Parcel.hpp"
#include "../../../JString.hpp"
#include "../../../JObject.hpp"
#include "../../../JString.hpp"
#include "./AccessibilityNodeInfo_AccessibilityAction.hpp"
namespace android::view::accessibility
{
// Fields
android::view::accessibility::AccessibilityNodeInfo_AccessibilityAction Accessib... | 40.183417 | 157 | 0.823173 | YJBeetle |
3c0cf4b14de368379a8db1b865d4ad9324ca4b51 | 5,516 | cpp | C++ | libs/fnd/type_traits/test/src/unit_test_fnd_type_traits_remove_constref.cpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 4 | 2018-06-10T13:35:32.000Z | 2021-06-03T14:27:41.000Z | libs/fnd/type_traits/test/src/unit_test_fnd_type_traits_remove_constref.cpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 566 | 2017-01-31T05:36:09.000Z | 2022-02-09T05:04:37.000Z | libs/fnd/type_traits/test/src/unit_test_fnd_type_traits_remove_constref.cpp | myoukaku/bksge | 0f8b60e475a3f1709723906e4796b5e60decf06e | [
"MIT"
] | 1 | 2018-07-05T04:40:53.000Z | 2018-07-05T04:40:53.000Z | /**
* @file unit_test_fnd_type_traits_remove_constref.cpp
*
* @brief remove_constref のテスト
*
* @author myoukaku
*/
#include <bksge/fnd/type_traits/remove_constref.hpp>
#include <bksge/fnd/type_traits/is_same.hpp>
#include <gtest/gtest.h>
#include "type_traits_test_utility.hpp"
#define BKSGE_REMOVE_... | 58.063158 | 93 | 0.646664 | myoukaku |
3c0e885823d5d53c963b8be7ce8392377be53e1b | 4,013 | cpp | C++ | src/Engine/Scene.cpp | fgagamedev/voID | 37cd56fe2878d036c36dafcf595e48ed85408d02 | [
"MIT"
] | null | null | null | src/Engine/Scene.cpp | fgagamedev/voID | 37cd56fe2878d036c36dafcf595e48ed85408d02 | [
"MIT"
] | null | null | null | src/Engine/Scene.cpp | fgagamedev/voID | 37cd56fe2878d036c36dafcf595e48ed85408d02 | [
"MIT"
] | null | null | null | /**
@file Scene.cpp
@brief Methods that manages all scenes in the game.
@copyright LGPL. MIT License.
*/
#include "Engine/Scene.hpp"
#include "Log/log.hpp"
// Constructor
Scene::Scene() {}
Scene::~Scene() {}
/**
@brief That function is for start the scene of the game.
*/
void Scene::Start() {
/... | 26.753333 | 124 | 0.646898 | fgagamedev |
3c1284f50c80fd96a1e7cafd8ec9a1abdc8af140 | 1,734 | cpp | C++ | part-01/2_22_search-a-2d-matrix-ii_DNC.cpp | abhijeetbodas2001/DSA | ff244dea639a4a5c203e21df3efa47ff079f452a | [
"MIT"
] | null | null | null | part-01/2_22_search-a-2d-matrix-ii_DNC.cpp | abhijeetbodas2001/DSA | ff244dea639a4a5c203e21df3efa47ff079f452a | [
"MIT"
] | null | null | null | part-01/2_22_search-a-2d-matrix-ii_DNC.cpp | abhijeetbodas2001/DSA | ff244dea639a4a5c203e21df3efa47ff079f452a | [
"MIT"
] | null | null | null | // Problem: https://leetcode.com/problems/search-a-2d-matrix-ii/
// Recursive binary (3/4 -ary?) search
// Be super-careful with boundaries!
class Solution {
private:
bool searchInSubmatrix(vector<vector<int>>& matrix, int top, int right, int bottom, int left, int target) {
// Searches for target in submat... | 36.893617 | 109 | 0.641292 | abhijeetbodas2001 |
3c1864c3caff41d766817db973b450ba55085c0c | 759 | cpp | C++ | leetcode/problemset-algorithms/binary-reversal.cpp | riteshkumar99/coding-for-placement | b45f90f662808bf4bf038ff98a016d49b9d71f71 | [
"MIT"
] | null | null | null | leetcode/problemset-algorithms/binary-reversal.cpp | riteshkumar99/coding-for-placement | b45f90f662808bf4bf038ff98a016d49b9d71f71 | [
"MIT"
] | null | null | null | leetcode/problemset-algorithms/binary-reversal.cpp | riteshkumar99/coding-for-placement | b45f90f662808bf4bf038ff98a016d49b9d71f71 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <bitset>
using namespace std;
string BinaryReversal(string str) {
long num = stol(str);
long result = 0;
if(num < (1u<<8)) {
const bitset<8> b(num);
for(int i = 0; i<8; i++) {
if(b[i]) {
result += (1 << (7-i));
}
}
} else if... | 18.512195 | 36 | 0.457181 | riteshkumar99 |
3c19af5f78d5e910e731f3b4dace0b8588aad747 | 1,498 | hpp | C++ | support/boost/fusion/container/map/detail/extract_keys.hpp | rogard/boost_sandbox_statistics | 16aacbc716a31a9f7bb6c535b1c90dc343282a23 | [
"BSL-1.0"
] | null | null | null | support/boost/fusion/container/map/detail/extract_keys.hpp | rogard/boost_sandbox_statistics | 16aacbc716a31a9f7bb6c535b1c90dc343282a23 | [
"BSL-1.0"
] | null | null | null | support/boost/fusion/container/map/detail/extract_keys.hpp | rogard/boost_sandbox_statistics | 16aacbc716a31a9f7bb6c535b1c90dc343282a23 | [
"BSL-1.0"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
// extract_keys.hpp //
// //
// Copyright 2010 Erwann Rogard. Distributed under the Boost //
... | 34.045455 | 79 | 0.506676 | rogard |
3c1aaf2d73e3fa5ae1a520e194dbb2379c077604 | 270 | cpp | C++ | tests/SplitArrayLargestSumTest.cpp | yanzhe-chen/LeetCode | d82f0b9721ea613ab216c78e7286671d0e9e4187 | [
"MIT"
] | 43 | 2015-10-10T12:59:52.000Z | 2018-07-11T18:07:00.000Z | tests/SplitArrayLargestSumTest.cpp | yanzhe-chen/LeetCode | d82f0b9721ea613ab216c78e7286671d0e9e4187 | [
"MIT"
] | null | null | null | tests/SplitArrayLargestSumTest.cpp | yanzhe-chen/LeetCode | d82f0b9721ea613ab216c78e7286671d0e9e4187 | [
"MIT"
] | 11 | 2015-10-10T14:41:11.000Z | 2018-07-28T06:03:16.000Z | #include "catch.hpp"
#include "SplitArrayLargestSum.hpp"
TEST_CASE("Split Array Largest Sum") {
SplitArrayLargestSum s;
SECTION("Sample test") {
vector<int> nums{7, 2, 5, 10, 8};
int m = 2;
REQUIRE(s.splitArray(nums, m) == 18);
}
}
| 20.769231 | 45 | 0.596296 | yanzhe-chen |
3c1e2638ba6f16c528bd1973d3e45b45d3073989 | 915 | cpp | C++ | 5.Inheritance/i-Design/Q4/Truck.cpp | Concept-Team/e-box-UTA018 | a6caf487c9f27a5ca30a00847ed49a163049f67e | [
"MIT"
] | 26 | 2021-03-17T03:15:22.000Z | 2021-06-09T13:29:41.000Z | 5.Inheritance/i-Design/Q4/Truck.cpp | Servatom/e-box-UTA018 | a6caf487c9f27a5ca30a00847ed49a163049f67e | [
"MIT"
] | 6 | 2021-03-16T19:04:05.000Z | 2021-06-03T13:41:04.000Z | 5.Inheritance/i-Design/Q4/Truck.cpp | Concept-Team/e-box-UTA018 | a6caf487c9f27a5ca30a00847ed49a163049f67e | [
"MIT"
] | 42 | 2021-03-17T03:16:22.000Z | 2021-06-14T21:11:20.000Z | #include<iostream>
#include<string>
using namespace std;
#include "FourWheeler.h"
#include "Vehicle.h"
class Truck: public FourWheeler, public Vehicle{
private:
int cargoCapacity;
string size;
public:
Truck(){}
Truck(string m,int y,string manu,string gt,string ... | 29.516129 | 119 | 0.523497 | Concept-Team |
3c229528c16576f5b1651c766e18a2874c6ac269 | 1,215 | cpp | C++ | Binary Search/MedianOfArray.cpp | dk-verma/Interviewbit | b1a9bfe45a6238f5ca864773133730c856619704 | [
"MIT"
] | null | null | null | Binary Search/MedianOfArray.cpp | dk-verma/Interviewbit | b1a9bfe45a6238f5ca864773133730c856619704 | [
"MIT"
] | null | null | null | Binary Search/MedianOfArray.cpp | dk-verma/Interviewbit | b1a9bfe45a6238f5ca864773133730c856619704 | [
"MIT"
] | null | null | null | /*
There are two sorted arrays A and B of size m and n respectively.
Find the median of the two sorted arrays ( The median of the array formed by merging both the arrays ).
The overall run time complexity should be O(log (m+n)).
- Sample Input
A : [1 4 5]
B : [2 3]
- Sample Output
3
*/
double Solution::findMedianSorte... | 28.928571 | 103 | 0.555556 | dk-verma |
3c26f467eeab4581042dc20724467379335d0bd1 | 7,158 | cpp | C++ | packages/dScene/dMaterialNodeInfo.cpp | wivlaro/newton-dynamics | 2bafd29aea919f237e56784510db1cb8011d0f40 | [
"Zlib"
] | null | null | null | packages/dScene/dMaterialNodeInfo.cpp | wivlaro/newton-dynamics | 2bafd29aea919f237e56784510db1cb8011d0f40 | [
"Zlib"
] | null | null | null | packages/dScene/dMaterialNodeInfo.cpp | wivlaro/newton-dynamics | 2bafd29aea919f237e56784510db1cb8011d0f40 | [
"Zlib"
] | null | null | null | /////////////////////////////////////////////////////////////////////////////
// Name: dMaterialNodeInfo.h
// Purpose:
// Author: Julio Jerez
// Modified by:
// Created: 22/05/2010 08:02:08
// RCS-ID:
// Copyright: Copyright (c) <2010> <Newton Game Dynamics>
// License:
// Th... | 33.448598 | 95 | 0.687203 | wivlaro |
3c27a6803599d840ce0c329a159b1a9663f37f03 | 3,347 | cpp | C++ | trees/BinaryTree.cpp | JOSUERV99/DataStructuresFromScratch | 99724659fd70a5717346dcc93fddb51ee69d4846 | [
"MIT"
] | 1 | 2020-11-22T04:48:53.000Z | 2020-11-22T04:48:53.000Z | trees/BinaryTree.cpp | JOSUERV99/DataStructuresFromScratch | 99724659fd70a5717346dcc93fddb51ee69d4846 | [
"MIT"
] | null | null | null | trees/BinaryTree.cpp | JOSUERV99/DataStructuresFromScratch | 99724659fd70a5717346dcc93fddb51ee69d4846 | [
"MIT"
] | null | null | null | #ifndef __BT__
#include"BinaryTree.h"
#endif
#ifndef __LL__
#include"../canonical/LinkedList.h"
#endif
#ifndef __TN__
#include"../nodes/TreeNode.h"
#endif
template <class T>
int BinaryTree<T>::size() {
return nodesAmount;
}
template <class T>
void BinaryTree<T>::remove(T value) {
_remove(this->root, value);
}... | 18.698324 | 91 | 0.639976 | JOSUERV99 |
3c2e24a33581a9d61cc002352c0a0ee1b73c55b6 | 1,032 | cpp | C++ | src/math.cpp | AnttiVainio/Ray-tracer | 0843aeb490b14417d47b844ebaa4174617833568 | [
"Unlicense"
] | null | null | null | src/math.cpp | AnttiVainio/Ray-tracer | 0843aeb490b14417d47b844ebaa4174617833568 | [
"Unlicense"
] | null | null | null | src/math.cpp | AnttiVainio/Ray-tracer | 0843aeb490b14417d47b844ebaa4174617833568 | [
"Unlicense"
] | null | null | null | /** math.cpp **/
#include <cmath>
float clampi(const int value, const int min, const int max) {
if(value < min) return min;
else if(value > max) return max;
else return value;
}
float clampf(const float value, const float min, const float max) {
if(value < min) return min;
else if(value > max) return max;
else... | 25.8 | 90 | 0.643411 | AnttiVainio |
3c2f76aed48ae929f69cc8cce2578b324b81d5f4 | 4,549 | cpp | C++ | dali-toolkit/internal/text/color-segmentation.cpp | zyndor/dali-toolkit | 9e3fd659c4d25706ab65345bc7c562ac27248325 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | dali-toolkit/internal/text/color-segmentation.cpp | zyndor/dali-toolkit | 9e3fd659c4d25706ab65345bc7c562ac27248325 | [
"Apache-2.0",
"BSD-3-Clause"
] | 1 | 2020-10-19T15:47:43.000Z | 2020-10-19T15:47:43.000Z | dali-toolkit/internal/text/color-segmentation.cpp | zyndor/dali-toolkit | 9e3fd659c4d25706ab65345bc7c562ac27248325 | [
"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.492857 | 191 | 0.659925 | zyndor |
3c312619085b24fa40f523785a0851f23a99d672 | 735 | cpp | C++ | jni/exnihilope/items/tools/HammerBase.cpp | SmartDEVTeam/ExNihiloPE | 8a3636ff72456a6ae156f23ea79d871fa3721754 | [
"Apache-2.0"
] | 5 | 2017-03-02T18:58:02.000Z | 2017-07-14T06:26:52.000Z | jni/exnihilope/items/tools/HammerBase.cpp | Virtualoso/ExNihiloPE | 8a3636ff72456a6ae156f23ea79d871fa3721754 | [
"Apache-2.0"
] | 3 | 2017-03-06T19:37:43.000Z | 2017-06-09T17:48:39.000Z | jni/exnihilope/items/tools/HammerBase.cpp | Virtualoso/ExNihiloPE | 8a3636ff72456a6ae156f23ea79d871fa3721754 | [
"Apache-2.0"
] | 5 | 2017-03-05T03:50:19.000Z | 2017-06-12T09:57:31.000Z | #include "HammerBase.h"
#include "../ENItems.h"
#include "database/HammerDatabase.h"
#include "../../registries/HammerRegistry.h"
HammerBase::HammerBase(const std::string& name, int id, int maxUses, Item::Tier material)
: ToolItem(name, id, 0.0F, material, {}) {
setMaxDamage(maxUses);
miningLevel = material.harv... | 27.222222 | 89 | 0.757823 | SmartDEVTeam |
3c39917678cf0fe690056f0f0246befd7a865b6c | 2,571 | cpp | C++ | Equinox/MeshComponent.cpp | jowie94/EquinoxEngine | 45f5efaa00e35a264bf3537ec3bdfe8b221325bf | [
"MIT"
] | null | null | null | Equinox/MeshComponent.cpp | jowie94/EquinoxEngine | 45f5efaa00e35a264bf3537ec3bdfe8b221325bf | [
"MIT"
] | null | null | null | Equinox/MeshComponent.cpp | jowie94/EquinoxEngine | 45f5efaa00e35a264bf3537ec3bdfe8b221325bf | [
"MIT"
] | 1 | 2018-10-16T20:12:59.000Z | 2018-10-16T20:12:59.000Z | #include "MeshComponent.h"
#include "GameObject.h"
#include <GL/glew.h>
#include "IMGUI/imgui.h"
#include "ProgramManager.h"
MeshComponent::MeshComponent()
{
_programManager = App->GetModule<ProgramManager>();
_shaderUnlit = _programManager->GetProgramByName("Unlit");
}
MeshComponent::~MeshComponent()
{
}
void ... | 27.351064 | 83 | 0.74718 | jowie94 |
3c3dcaadef89a8378ca111b478ca84babc1a94a4 | 303 | cpp | C++ | soj/1967.cpp | huangshenno1/project_euler | 8a3c91fd11bcb6a6a830e963b1d5aed3f5ff787d | [
"MIT"
] | null | null | null | soj/1967.cpp | huangshenno1/project_euler | 8a3c91fd11bcb6a6a830e963b1d5aed3f5ff787d | [
"MIT"
] | null | null | null | soj/1967.cpp | huangshenno1/project_euler | 8a3c91fd11bcb6a6a830e963b1d5aed3f5ff787d | [
"MIT"
] | null | null | null | #include <stdio.h>
int main()
{
double a,b,c,d,e;
scanf("%lf%lf%lf%lf%lf",&a,&b,&c,&d,&e);
while (a||b||c||d||e)
{
double s=a+b+c+d+e;
if (s<0&&s>-0.001)
s=0;
printf("%.3lf\n",s);
scanf("%lf%lf%lf%lf%lf",&a,&b,&c,&d,&e);
}
return 0;
} | 18.9375 | 48 | 0.40264 | huangshenno1 |
3c3e0a8e63feabc4fbe6d4270570a5552f451fa6 | 1,116 | cpp | C++ | test/test_shared_ptr.cpp | jb--/luaponte | 06bfe551bce23e411e75895797b8bb84bb662ed2 | [
"BSL-1.0"
] | 3 | 2015-08-30T10:02:10.000Z | 2018-08-27T06:54:44.000Z | test/test_shared_ptr.cpp | halmd-org/luaponte | 165328485954a51524a0b1aec27518861c6be719 | [
"BSL-1.0"
] | null | null | null | test/test_shared_ptr.cpp | halmd-org/luaponte | 165328485954a51524a0b1aec27518861c6be719 | [
"BSL-1.0"
] | null | null | null | // Luaponte library
// Copyright (c) 2012 Peter Colberg
// Luaponte is based on Luabind, a library, inspired by and similar to
// Boost.Python, that helps you create bindings between C++ and Lua,
// Copyright (c) 2003-2010 Daniel Wallin and Arvid Norberg.
// Use, modification and distribution is subject to the Boost... | 19.928571 | 79 | 0.625448 | jb-- |
3c3ef6207336367e931eeb52c2fb1d47207557f9 | 591 | cxx | C++ | source/boomhs/skybox.cxx | bjadamson/BoomHS | 60b5d8ddc2490ec57e8f530ba7ce3135221e2ec4 | [
"MIT"
] | 2 | 2016-07-22T10:09:21.000Z | 2017-09-16T06:50:01.000Z | source/boomhs/skybox.cxx | bjadamson/BoomHS | 60b5d8ddc2490ec57e8f530ba7ce3135221e2ec4 | [
"MIT"
] | 14 | 2016-08-13T22:45:56.000Z | 2018-12-16T03:56:36.000Z | source/boomhs/skybox.cxx | bjadamson/BoomHS | 60b5d8ddc2490ec57e8f530ba7ce3135221e2ec4 | [
"MIT"
] | null | null | null | #include <boomhs/frame_time.hpp>
#include <boomhs/math.hpp>
#include <boomhs/skybox.hpp>
#include <opengl/shader.hpp>
#include <opengl/texture.hpp>
#include <cassert>
namespace boomhs
{
static constexpr float SKYBOX_SCALE_SIZE = 1000.0f;
/////////////////////////////////////////////////////////////////////////////... | 19.7 | 99 | 0.604061 | bjadamson |
3c3faedcaa1fef265e6932d968441b1a43936539 | 18,259 | cpp | C++ | Grbl_Esp32/src/Motors/Dynamixel2.cpp | ghjklzx/ESP32-E-support | 03e081d3f6df613ff1f215ba311bec3fb7baa8ed | [
"MIT"
] | null | null | null | Grbl_Esp32/src/Motors/Dynamixel2.cpp | ghjklzx/ESP32-E-support | 03e081d3f6df613ff1f215ba311bec3fb7baa8ed | [
"MIT"
] | null | null | null | Grbl_Esp32/src/Motors/Dynamixel2.cpp | ghjklzx/ESP32-E-support | 03e081d3f6df613ff1f215ba311bec3fb7baa8ed | [
"MIT"
] | null | null | null | /*
Dynamixel2.cpp
This allows an Dynamixel sero to be used like any other motor. Servos
do have limitation in travel and speed, so you do need to respect that.
Protocol 2
Part of Grbl_ESP32
2020 - Bart Dring
https://emanual.robotis.com/docs/en/dxl/protocol2/
Grbl_ESP32 is free soft... | 41.216704 | 147 | 0.589189 | ghjklzx |
3c47a2f5710b42cd42e747b2c78939397130f039 | 2,249 | cpp | C++ | part-17-vulkan-android/main/src/application/vulkan/vulkan-context.cpp | tanzle-aames/a-simple-triangle | 3cf7d76e8e8a3b5d42c6db35d3cbfef91b139ab0 | [
"MIT"
] | 52 | 2019-11-30T04:45:02.000Z | 2022-03-10T17:17:57.000Z | part-19-vulkan-windows/main/src/application/vulkan/vulkan-context.cpp | eugenebokhan/a-simple-triangle | 3cf7d76e8e8a3b5d42c6db35d3cbfef91b139ab0 | [
"MIT"
] | null | null | null | part-19-vulkan-windows/main/src/application/vulkan/vulkan-context.cpp | eugenebokhan/a-simple-triangle | 3cf7d76e8e8a3b5d42c6db35d3cbfef91b139ab0 | [
"MIT"
] | 10 | 2020-03-30T16:18:30.000Z | 2022-01-30T14:53:45.000Z | #include "vulkan-context.hpp"
#include "../../core/graphics-wrapper.hpp"
#include "../../core/log.hpp"
#include "vulkan-common.hpp"
using ast::VulkanContext;
namespace
{
vk::UniqueInstance createInstance()
{
vk::ApplicationInfo applicationInfo{
"A Simple Triangle", // Application name... | 38.118644 | 88 | 0.59671 | tanzle-aames |
3c4a1565dc866cd5a9fad9faed0d4aa721d1d50c | 1,270 | hpp | C++ | src/channel_access/server/cas/async.hpp | delta-accelerator/channel_access.server | 21a7707da1f3421ed38773095e577f48b798daac | [
"MIT"
] | null | null | null | src/channel_access/server/cas/async.hpp | delta-accelerator/channel_access.server | 21a7707da1f3421ed38773095e577f48b798daac | [
"MIT"
] | null | null | null | src/channel_access/server/cas/async.hpp | delta-accelerator/channel_access.server | 21a7707da1f3421ed38773095e577f48b798daac | [
"MIT"
] | null | null | null | #ifndef INCLUDE_GUARD_89374487_8D33_448E_B992_AA6B5C8548A5
#define INCLUDE_GUARD_89374487_8D33_448E_B992_AA6B5C8548A5
#include <Python.h>
#include <casdef.h>
namespace cas {
/** Create the AsyncContext type.
* Returns new reference.
*/
PyObject* create_async_context_type();
/** Destroy the AsyncContext type.
*/
... | 20.819672 | 80 | 0.740945 | delta-accelerator |
3c4e3c8e5c4edeccd4edbed3badcff012df59271 | 115 | cpp | C++ | hts_CutTrim/src/hts_CutTrim.cpp | s4hts/HTStream | 7dffe3ed890996b3e83676d8a25fbbb3a85b81ff | [
"Apache-2.0"
] | 19 | 2020-06-01T17:25:37.000Z | 2022-03-17T04:54:03.000Z | hts_CutTrim/src/hts_CutTrim.cpp | ibest/HTStream | b2d7b408de79e643f560214536985e25a7153510 | [
"Apache-2.0"
] | 167 | 2016-07-31T23:34:59.000Z | 2020-05-31T15:07:16.000Z | hts_CutTrim/src/hts_CutTrim.cpp | ibest/HTStream | b2d7b408de79e643f560214536985e25a7153510 | [
"Apache-2.0"
] | 7 | 2017-06-08T17:10:26.000Z | 2020-04-03T20:54:55.000Z | #include "hts_CutTrim.h"
int main(int argc, char** argv)
{
CutTrim ct;
return ct.main_func(argc, argv);
}
| 14.375 | 36 | 0.652174 | s4hts |
3c4eaadf9318c2cb43717d624b112de0116a76fe | 1,082 | cpp | C++ | 洛谷/线性表/P1540.cpp | codehuanglei/- | 933a55b5c5a49163f12e0c39b4edfa9c4f01678f | [
"MIT"
] | null | null | null | 洛谷/线性表/P1540.cpp | codehuanglei/- | 933a55b5c5a49163f12e0c39b4edfa9c4f01678f | [
"MIT"
] | null | null | null | 洛谷/线性表/P1540.cpp | codehuanglei/- | 933a55b5c5a49163f12e0c39b4edfa9c4f01678f | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll m, n;
queue<int> q1;
bool findNum = false;
int main(){
cin >> m >> n;
int cnt = 0;
for(int i = 1; i <= n; i++){
int num;
cin >> num;
if(q1.empty()){
q1.push(num);
cnt++;
}else{
... | 25.162791 | 63 | 0.357671 | codehuanglei |
3c4ee5d7c6e46a12a88f062cdc33832ade97488e | 1,106 | cpp | C++ | Array/easy/628_Maximum_Product_of_Three_Numbers/MaxProductOfThree.cpp | quq99/Leetcode_notes | eb3bee5ed161a0feb4ce1d48b682c000c95b4be3 | [
"MIT"
] | 1 | 2019-05-16T23:18:17.000Z | 2019-05-16T23:18:17.000Z | Array/easy/628_Maximum_Product_of_Three_Numbers/MaxProductOfThree.cpp | quq99/Leetcode_notes | eb3bee5ed161a0feb4ce1d48b682c000c95b4be3 | [
"MIT"
] | null | null | null | Array/easy/628_Maximum_Product_of_Three_Numbers/MaxProductOfThree.cpp | quq99/Leetcode_notes | eb3bee5ed161a0feb4ce1d48b682c000c95b4be3 | [
"MIT"
] | null | null | null | // MaxProductOfThree
#include<vector>
#include<algorithm>
using std::max;
using std::vector;
class MaxProductOfThree {
public:
int maximumProduct(vector<int>& nums) {
int max1 = INT_MIN; // biggest
int max2 = INT_MIN; // second biggest
int max3 = INT_MIN; // third bigge... | 25.72093 | 55 | 0.382459 | quq99 |
3c4f3dea70e05232404797bf0e045771f477d4f6 | 1,207 | hpp | C++ | afin/contiglist.hpp | kemendle/Fast-Plast | 2ed15a87192ea3423915cccba3fc0d970c8c672e | [
"MIT"
] | 31 | 2016-08-15T20:54:16.000Z | 2021-11-22T08:16:06.000Z | afin/contiglist.hpp | kemendle/Fast-Plast | 2ed15a87192ea3423915cccba3fc0d970c8c672e | [
"MIT"
] | 46 | 2016-08-16T19:25:11.000Z | 2021-04-12T13:05:03.000Z | afin/contiglist.hpp | kemendle/Fast-Plast | 2ed15a87192ea3423915cccba3fc0d970c8c672e | [
"MIT"
] | 20 | 2016-08-19T16:05:00.000Z | 2021-11-22T08:16:10.000Z |
#ifndef CONTIGLIST_HPP
#define CONTIGLIST_HPP
#include "contig.hpp"
#include <vector>
#include <string>
class Contiglist{
private:
Readlist *reads;
std::vector<Contig> contigs;
std::vector<Contig> contigs_fused;
std::string outfile;
public:
Contiglist( Readlist *reads, std::string contigsfi... | 24.632653 | 134 | 0.70174 | kemendle |
3c54ad8053a919f340a1c52f08a27d3a9f3a5ac5 | 7,074 | cpp | C++ | components/CalEPD/models/color/gdew075c64.cpp | markbirss/cale-idf | a2271062504907a57333ea9615c115fbda809e19 | [
"Apache-2.0"
] | 148 | 2020-05-21T23:14:27.000Z | 2022-03-23T14:26:45.000Z | components/CalEPD/models/color/gdew075c64.cpp | markbirss/cale-idf | a2271062504907a57333ea9615c115fbda809e19 | [
"Apache-2.0"
] | 48 | 2020-05-19T07:23:48.000Z | 2022-03-19T11:04:02.000Z | components/CalEPD/models/color/gdew075c64.cpp | markbirss/cale-idf | a2271062504907a57333ea9615c115fbda809e19 | [
"Apache-2.0"
] | 17 | 2020-09-15T18:04:45.000Z | 2022-03-16T20:26:34.000Z | #include "gdew075c64.h"
#include <stdio.h>
#include <stdlib.h>
#include "esp_log.h"
#include "freertos/task.h"
// Controller: GD7965 (EK79655)
// Specification: https://www.scribd.com/document/448888338/GDEW075C64-V1-0-Specification
// 0x07 (2nd) VGH=20V,VGL=-20V
// 0x3f (1st) VDH= 15V
// 0x3f (2nd) VDH=-15V
DRAM_ATTR... | 26.69434 | 131 | 0.612666 | markbirss |
3c5c8b9a09a4e522bf82789b1cd6bd172f1da236 | 14,683 | cc | C++ | src/arch/x86/32/encoder.cc | nash-project/nashalib | 730a2d9ae6acfba3c51d6c0e50a315fe55065bf1 | [
"MIT"
] | 3 | 2022-03-12T03:09:16.000Z | 2022-03-18T22:12:15.000Z | src/arch/x86/32/encoder.cc | nash-project/nashalib | 730a2d9ae6acfba3c51d6c0e50a315fe55065bf1 | [
"MIT"
] | 2 | 2022-03-18T22:12:39.000Z | 2022-03-18T22:13:26.000Z | src/arch/x86/32/encoder.cc | nash-project/nashalib | 730a2d9ae6acfba3c51d6c0e50a315fe55065bf1 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <nashalib/arch/x86/32/encoder.hpp>
#include <nashalib/registers.hpp>
#include <nashalib/arch/x86/32/opcodes.hpp>
#include <nashalib/endianess.hpp>
#include <seegul/seegul.h>
#include <fstream>
#include <iostream>
#include <nashalib... | 30.781971 | 133 | 0.551318 | nash-project |
3c5d6912528fd82c5f138fd6ae4d3d10b2a92d73 | 1,253 | cpp | C++ | src/geometry/2d-geometry/intersection-of-a-polygon-and-a-circle.cpp | Nisiyama-Suzune/LMR | 16325b9efcb71240111ac12ea55c0cb45b0c5834 | [
"MIT"
] | 48 | 2018-08-15T11:58:28.000Z | 2022-02-08T23:38:29.000Z | src/geometry/2d-geometry/intersection-of-a-polygon-and-a-circle.cpp | Nisiyama-Suzune/LMR | 16325b9efcb71240111ac12ea55c0cb45b0c5834 | [
"MIT"
] | null | null | null | src/geometry/2d-geometry/intersection-of-a-polygon-and-a-circle.cpp | Nisiyama-Suzune/LMR | 16325b9efcb71240111ac12ea55c0cb45b0c5834 | [
"MIT"
] | 8 | 2019-07-18T10:27:50.000Z | 2021-06-08T13:03:47.000Z | struct polygon_circle_intersect {
double sector_area (cp a, cp b, const double &r) {
double c = (2.0 * r * r - dis2 (a, b)) / (2.0 * r * r);
return r * r * acos (c) / 2.0; }
double area (cp a, cp b, const double &r) {
double dA = dot (a, a), dB = dot (b, b), dC = point_to_segment (point (), line (a, b));
if (... | 54.478261 | 97 | 0.501197 | Nisiyama-Suzune |
3c63ffae83532be57e2ddce56cb40b9a827c8100 | 6,271 | cpp | C++ | jswinrt/Function.cpp | proog128/jswin | 3c288ef2ad4b815a01c0931a1757cf10e44ccc1d | [
"BSD-2-Clause-FreeBSD"
] | 41 | 2015-02-07T07:25:21.000Z | 2022-03-25T00:33:48.000Z | jswinrt/Function.cpp | proog128/jswin | 3c288ef2ad4b815a01c0931a1757cf10e44ccc1d | [
"BSD-2-Clause-FreeBSD"
] | 2 | 2015-10-16T17:17:23.000Z | 2021-07-21T18:28:51.000Z | jswinrt/Function.cpp | proog128/jswin | 3c288ef2ad4b815a01c0931a1757cf10e44ccc1d | [
"BSD-2-Clause-FreeBSD"
] | 16 | 2015-04-21T18:08:22.000Z | 2022-03-25T00:33:35.000Z | #include "Function.h"
#include <vector>
#include "V8SafeCall.h"
#include "V8ArrayBufferUtils.h"
#include "V8StringUtils.h"
v8::Persistent<v8::FunctionTemplate> Function::V8Constructor;
Function::Function(const std::string& signature, CallingConvention callingConvention, void* address)
: signature(signature), ca... | 28.121076 | 138 | 0.595758 | proog128 |
3c666f3f4cc828d67ddf481d84fb87d7495c43e3 | 2,314 | cpp | C++ | csgocheat/hooks/c_net_channel_.cpp | garryhvh420/e_xyz | 668d8c8c2b7ccfc3bae9e321b1a50379a5e33ec9 | [
"Apache-2.0"
] | null | null | null | csgocheat/hooks/c_net_channel_.cpp | garryhvh420/e_xyz | 668d8c8c2b7ccfc3bae9e321b1a50379a5e33ec9 | [
"Apache-2.0"
] | null | null | null | csgocheat/hooks/c_net_channel_.cpp | garryhvh420/e_xyz | 668d8c8c2b7ccfc3bae9e321b1a50379a5e33ec9 | [
"Apache-2.0"
] | null | null | null | #include "c_net_channel_.h"
#include "../hacks/c_fake_ping.h"
void c_net_channel_::hook()
{
//static uint32_t dummy[1] = { reinterpret_cast<uint32_t>(c_net_channel::get_vtable()) };
//hk = std::make_unique<c_hook<uint32_t>>(dummy);
//_process_packet = hk->apply<process_packet_t>(39, process_packet);
//_send_netms... | 37.322581 | 143 | 0.763613 | garryhvh420 |
3c67aa40f0ca8954c224bd434f6c799c4eaff358 | 567 | hpp | C++ | include/ShaderAST/Expr/ExprModulo.hpp | Praetonus/ShaderWriter | 1c5b3961e3e1b91cb7158406998519853a4add07 | [
"MIT"
] | null | null | null | include/ShaderAST/Expr/ExprModulo.hpp | Praetonus/ShaderWriter | 1c5b3961e3e1b91cb7158406998519853a4add07 | [
"MIT"
] | null | null | null | include/ShaderAST/Expr/ExprModulo.hpp | Praetonus/ShaderWriter | 1c5b3961e3e1b91cb7158406998519853a4add07 | [
"MIT"
] | null | null | null | /*
See LICENSE file in root folder
*/
#ifndef ___AST_ExprModulo_H___
#define ___AST_ExprModulo_H___
#pragma once
#include "ExprBinary.hpp"
namespace ast::expr
{
class Modulo
: public Binary
{
public:
Modulo( type::TypePtr type
, ExprPtr lhs
, ExprPtr rhs );
void accept( VisitorPtr vis )override;
};
... | 16.2 | 54 | 0.677249 | Praetonus |
3c6ca5a41bf813e01f68cb2e362c85df5ecf4498 | 2,239 | hxx | C++ | src/ana_tools/VALORModelClassifier.hxx | TWLord/DUNEPrismTools | bde52eb1331ac10ba81cdf1bf63488707bfe5496 | [
"MIT"
] | null | null | null | src/ana_tools/VALORModelClassifier.hxx | TWLord/DUNEPrismTools | bde52eb1331ac10ba81cdf1bf63488707bfe5496 | [
"MIT"
] | null | null | null | src/ana_tools/VALORModelClassifier.hxx | TWLord/DUNEPrismTools | bde52eb1331ac10ba81cdf1bf63488707bfe5496 | [
"MIT"
] | 3 | 2018-01-09T20:57:33.000Z | 2019-11-24T03:48:28.000Z | #ifndef VALORMODELCLASSIFIER_HXX_SEEN
#define VALORMODELCLASSIFIER_HXX_SEEN
#include "InteractionModel.hxx"
#include "DepositsSummaryTreeReader.hxx"
#include <iostream>
#include <utility>
#include <vector>
namespace VALORModel {
enum class TrueClass;
}
#define VARLIST \
X(kNu_QE_1, 0.082) \
X(kNu_Q... | 25.157303 | 89 | 0.618133 | TWLord |
3c6e69d522fae6dc64880fef1e166002fe57e6b9 | 3,522 | cpp | C++ | src/classify/classifier/naive_bayes.cpp | Lolik111/meta | c7019401185cdfa15e1193aad821894c35a83e3f | [
"MIT"
] | 615 | 2015-01-31T17:14:03.000Z | 2022-03-27T03:03:02.000Z | src/classify/classifier/naive_bayes.cpp | Lolik111/meta | c7019401185cdfa15e1193aad821894c35a83e3f | [
"MIT"
] | 167 | 2015-01-20T17:48:16.000Z | 2021-12-20T00:15:29.000Z | src/classify/classifier/naive_bayes.cpp | Lolik111/meta | c7019401185cdfa15e1193aad821894c35a83e3f | [
"MIT"
] | 264 | 2015-01-30T00:08:01.000Z | 2022-03-02T17:19:11.000Z | /**
* @file naive_bayes.cpp
* @author Sean Massung
*/
#include <cassert>
#include "cpptoml.h"
#include "meta/classify/classifier/naive_bayes.h"
#include "meta/io/packed.h"
namespace meta
{
namespace classify
{
const util::string_view naive_bayes::id = "naive-bayes";
const constexpr double naive_bayes::default_alp... | 26.681818 | 79 | 0.619818 | Lolik111 |
3c6ee7e3835ea14158d1ac3828fec0766f523859 | 1,062 | hh | C++ | core/inc/com/centreon/broker/extcmd/internal.hh | sdelafond/centreon-broker | 21178d98ed8a061ca71317d23c2026dbc4edaca2 | [
"Apache-2.0"
] | null | null | null | core/inc/com/centreon/broker/extcmd/internal.hh | sdelafond/centreon-broker | 21178d98ed8a061ca71317d23c2026dbc4edaca2 | [
"Apache-2.0"
] | null | null | null | core/inc/com/centreon/broker/extcmd/internal.hh | sdelafond/centreon-broker | 21178d98ed8a061ca71317d23c2026dbc4edaca2 | [
"Apache-2.0"
] | null | null | null | /*
** Copyright 2013 Centreon
**
** 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 in ... | 24.136364 | 75 | 0.70339 | sdelafond |
3c70cb43d6f7be322c897075afdf7bac89b7bfb9 | 478 | cpp | C++ | Char_2D-Arrays/all_Substrings.cpp | Talat12/coding-ninjas-cpp-inception | a15a7bada0c8d6ca9e9d9da20c1951114e75b246 | [
"MIT"
] | 2 | 2019-06-11T16:31:52.000Z | 2019-06-20T14:34:18.000Z | Char_2D-Arrays/all_Substrings.cpp | shermisaurus/coding-ninjas-cpp-inception | cb93017a9683a92373f53d787b20a6944383e273 | [
"MIT"
] | null | null | null | Char_2D-Arrays/all_Substrings.cpp | shermisaurus/coding-ninjas-cpp-inception | cb93017a9683a92373f53d787b20a6944383e273 | [
"MIT"
] | 3 | 2020-04-15T00:38:56.000Z | 2020-10-20T06:08:29.000Z | #include <string.h>
void printSubstrings(char str[]){
/* Don't write main().
* Don't read input, it is passed as function argument.
* Print output as specified in the question.
*/
int n = strlen(str);
for(int len = 1; len <= n; len++)
{
for(int i = 0; i <= n - len; i++) //set starting index
{
... | 20.782609 | 58 | 0.5 | Talat12 |
3c713b53f2d308dff9809bb38c214a8b000003c9 | 1,191 | hpp | C++ | include/HttpClient.hpp | RalfOGit/libgoecharger | 368ce3ccf032a07b717bdad25f2626e5eade2230 | [
"MIT"
] | null | null | null | include/HttpClient.hpp | RalfOGit/libgoecharger | 368ce3ccf032a07b717bdad25f2626e5eade2230 | [
"MIT"
] | null | null | null | include/HttpClient.hpp | RalfOGit/libgoecharger | 368ce3ccf032a07b717bdad25f2626e5eade2230 | [
"MIT"
] | null | null | null | #ifndef __LIBGOECHARGER_HTTPCLIENT_HPP__
#define __LIBGOECHARGER_HTTPCLIENT_HPP__
#include <string>
namespace libgoecharger {
/**
* Class implementing a very basic http client.
*/
class HttpClient {
public:
HttpClient(void);
int sendHttpGetRequest(const std::st... | 36.090909 | 131 | 0.686818 | RalfOGit |
3c724e815381eaf03606a39e232d267780539161 | 941 | cpp | C++ | cpp/atcoder/abc052.cpp | KeiichiHirobe/algorithms | 8de082dab33054f3e433330a2cf5d06bd770bd04 | [
"Apache-2.0"
] | null | null | null | cpp/atcoder/abc052.cpp | KeiichiHirobe/algorithms | 8de082dab33054f3e433330a2cf5d06bd770bd04 | [
"Apache-2.0"
] | null | null | null | cpp/atcoder/abc052.cpp | KeiichiHirobe/algorithms | 8de082dab33054f3e433330a2cf5d06bd770bd04 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
vector<pair<long long, long long> > prime_factorize(long long N)
{
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a)
{
if (N % a != 0)
continue;
long long ex ... | 18.096154 | 64 | 0.435707 | KeiichiHirobe |
3c739564d1f0fcae776fbb80b48b5e7be4bc8c87 | 3,704 | cpp | C++ | aws-cpp-sdk-cloudsearch/source/model/DocumentSuggesterOptions.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 2 | 2019-03-11T15:50:55.000Z | 2020-02-27T11:40:27.000Z | aws-cpp-sdk-cloudsearch/source/model/DocumentSuggesterOptions.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 18 | 2018-05-15T16:41:07.000Z | 2018-05-21T00:46:30.000Z | aws-cpp-sdk-cloudsearch/source/model/DocumentSuggesterOptions.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 1 | 2019-01-18T13:03:55.000Z | 2019-01-18T13:03:55.000Z | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... | 31.65812 | 163 | 0.733531 | curiousjgeorge |
3c73bbc35edf39505a5a6b411298da53c0325fe9 | 1,552 | hpp | C++ | calamity/src/event/internal/dispatcher.hpp | ClayCore/calamity | ddc9226648e4457531db33c27d67229f6f538455 | [
"BSD-3-Clause"
] | 1 | 2021-07-30T07:37:14.000Z | 2021-07-30T07:37:14.000Z | calamity/src/event/internal/dispatcher.hpp | ClayCore/calamity | ddc9226648e4457531db33c27d67229f6f538455 | [
"BSD-3-Clause"
] | null | null | null | calamity/src/event/internal/dispatcher.hpp | ClayCore/calamity | ddc9226648e4457531db33c27d67229f6f538455 | [
"BSD-3-Clause"
] | null | null | null | #pragma once
#include "event.hpp"
#include "listener.hpp"
namespace Calamity::EventSystem
{
class BaseDispatcher
{
// Constructors //
// ---------------------- //
public:
BaseDispatcher();
BaseDispatcher(Ref<BaseListener>& listener);
virtual ~BaseDispat... | 28.218182 | 90 | 0.516753 | ClayCore |
3c77b489f4e96f20c925811acbeebcc5cc2b5143 | 14,791 | cpp | C++ | aws-cpp-sdk-route53/source/Route53Errors.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 2 | 2019-03-11T15:50:55.000Z | 2020-02-27T11:40:27.000Z | aws-cpp-sdk-route53/source/Route53Errors.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 18 | 2018-05-15T16:41:07.000Z | 2018-05-21T00:46:30.000Z | aws-cpp-sdk-route53/source/Route53Errors.cpp | curiousjgeorge/aws-sdk-cpp | 09b65deba03cfbef9a1e5d5986aa4de71bc03cd8 | [
"Apache-2.0"
] | 1 | 2019-01-18T13:03:55.000Z | 2019-01-18T13:03:55.000Z | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... | 50.481229 | 149 | 0.806234 | curiousjgeorge |
3c7bc997967043880a0651a17560520b98852b2d | 5,397 | hh | C++ | src/corbaExample/src/cpp/Exception.hh | jahlborn/rmiio | 58c05f29e6dbc44c0f18c9a2247aff113d487c71 | [
"Apache-2.0"
] | 7 | 2016-04-05T15:58:01.000Z | 2020-10-30T18:38:05.000Z | src/corbaExample/src/cpp/Exception.hh | jahlborn/rmiio | 58c05f29e6dbc44c0f18c9a2247aff113d487c71 | [
"Apache-2.0"
] | 2 | 2016-07-04T01:32:56.000Z | 2020-12-11T02:54:56.000Z | src/corbaExample/src/cpp/Exception.hh | jahlborn/rmiio | 58c05f29e6dbc44c0f18c9a2247aff113d487c71 | [
"Apache-2.0"
] | 6 | 2016-04-05T15:58:16.000Z | 2020-04-27T21:45:47.000Z | // This file is generated by omniidl (C++ backend)- omniORB_4_1. Do not edit.
#ifndef __Exception_hh__
#define __Exception_hh__
#ifndef __CORBA_H_EXTERNAL_GUARD__
#include <omniORB4/CORBA.h>
#endif
#ifndef USE_stub_in_nt_dll
# define USE_stub_in_nt_dll_NOT_DEFINED_Exception
#endif
#ifndef USE_core_stub_in_nt_dll
# ... | 21.248031 | 121 | 0.753011 | jahlborn |
3c84d57cd85e58a9908b30b4bddfa64d26c7276f | 806 | cpp | C++ | source/419.cpp | narikbi/LeetCode | 835215c21d1bd6820b20c253026bcb6f889ed3fc | [
"MIT"
] | 2 | 2017-02-28T11:39:13.000Z | 2019-12-07T17:23:20.000Z | source/419.cpp | narikbi/LeetCode | 835215c21d1bd6820b20c253026bcb6f889ed3fc | [
"MIT"
] | null | null | null | source/419.cpp | narikbi/LeetCode | 835215c21d1bd6820b20c253026bcb6f889ed3fc | [
"MIT"
] | null | null | null | //
// 419.cpp
// LeetCode
//
// Created by Narikbi on 15.02.17.
// Copyright © 2017 app.leetcode.kz. All rights reserved.
//
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <deque>
#include <queue>
#include <set>
using namespace std;
int countBattleships(v... | 19.190476 | 58 | 0.51861 | narikbi |
3c84de4c76c7ddfcb7da0b8105f517d26dcd8567 | 3,276 | hpp | C++ | kernel/pci.hpp | hapo31/My-MikanOS | a21720980a0c1557320ca321f446451819529c54 | [
"Apache-2.0"
] | null | null | null | kernel/pci.hpp | hapo31/My-MikanOS | a21720980a0c1557320ca321f446451819529c54 | [
"Apache-2.0"
] | null | null | null | kernel/pci.hpp | hapo31/My-MikanOS | a21720980a0c1557320ca321f446451819529c54 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include <stdint.h>
#include <array>
#include "error.hpp"
namespace pci {
class ClassCode {
public:
ClassCode() = default;
ClassCode(uint32_t reg) {
base = (reg >> 24) & 0xffu;
sub = (reg >> 16) & 0xffu;
interface = (reg >> 8) & 0xffu;
}
uint8_t base, sub, interface;
bool Matc... | 26.208 | 75 | 0.693834 | hapo31 |
3c89628a3db25c2d06783adcfb0d07140b78c985 | 2,435 | cpp | C++ | glfw-ftgl/main.cpp | Wandao123/ising_model | 36c1beafaffb4dd03cb7658d951a9e049532fc74 | [
"MIT"
] | 3 | 2019-10-24T07:25:30.000Z | 2020-07-14T10:42:02.000Z | glfw-ftgl/main.cpp | Wandao123/ising_model | 36c1beafaffb4dd03cb7658d951a9e049532fc74 | [
"MIT"
] | null | null | null | glfw-ftgl/main.cpp | Wandao123/ising_model | 36c1beafaffb4dd03cb7658d951a9e049532fc74 | [
"MIT"
] | null | null | null | //#include <iostream>
#include <cstdlib>
#include "ising_model.h"
IsingModel isingModel(std::pow(IsingModel::SideLength, 2) * (2.e0 + 0.5 * IsingModel::SideLength));
static bool IsUpdating = false;
void idle()
{
if (IsUpdating)
isingModel.Update();
}
void display(GLFWwindow* window)
{
glClearColor... | 21.936937 | 100 | 0.663655 | Wandao123 |
3c8eab51d9c2005d051f2aca370bea1a25eeac88 | 1,406 | cpp | C++ | Interviewbit/SubstringConcatenation.cpp | acheiveer/CPP-Questions-and-Solutions | 17097bfb25a75568122ce313d571cb473d55fdf3 | [
"MIT"
] | 42 | 2021-09-26T18:02:52.000Z | 2022-03-15T01:52:15.000Z | Interviewbit/SubstringConcatenation.cpp | acheiveer/CPP-Questions-and-Solutions | 17097bfb25a75568122ce313d571cb473d55fdf3 | [
"MIT"
] | 404 | 2021-09-24T19:55:10.000Z | 2021-11-03T05:47:47.000Z | Interviewbit/SubstringConcatenation.cpp | acheiveer/CPP-Questions-and-Solutions | 17097bfb25a75568122ce313d571cb473d55fdf3 | [
"MIT"
] | 140 | 2021-09-22T20:50:04.000Z | 2022-01-22T16:59:09.000Z | /**
Instead of Dynamic programming approach i sticked to hashing approach
- Create a map for all the string in list of string array with count/frequency
- No start iterating strings with L(length of each string) as the addition in each
- Maintain the count of string appread in the substring from (that ... | 31.954545 | 107 | 0.565434 | acheiveer |
3c91f3078dba773e033d0fd5a28a2c446aaccd55 | 4,392 | cpp | C++ | CentipedeGame_gageoconnor/Game Components/CentipedeHead.cpp | Shaditto/centipede-teal | f078b11eaecddae17709dc9f917348b7b0733d56 | [
"MIT"
] | null | null | null | CentipedeGame_gageoconnor/Game Components/CentipedeHead.cpp | Shaditto/centipede-teal | f078b11eaecddae17709dc9f917348b7b0733d56 | [
"MIT"
] | null | null | null | CentipedeGame_gageoconnor/Game Components/CentipedeHead.cpp | Shaditto/centipede-teal | f078b11eaecddae17709dc9f917348b7b0733d56 | [
"MIT"
] | 1 | 2019-11-13T19:26:34.000Z | 2019-11-13T19:26:34.000Z | /* CentipedeHead.cpp - Gage O'Connor, October 2017 */
#include "CentipedeHead.h"
#include "Centipede_HeadFactory.h"
#include "Centipede_SegmentFactory.h"
#include "Head_MoveFSM.h"
CentipedeHead::CentipedeHead()
: SCORE(Score::Centipede_Head),
pHead(this),
MAX_HEALTH(1)
{
// Initialize remaining variables
h... | 24 | 170 | 0.722905 | Shaditto |
3c9230e97fdd1595a8a6f61d4a63f8e2da5626d6 | 8,692 | hpp | C++ | test_nodejs/input.hpp | hirakuni45/test | 04254eab7d2398408aa0015194d4c21011f9bd7a | [
"BSD-3-Clause"
] | 6 | 2016-03-07T02:40:09.000Z | 2021-07-25T11:07:01.000Z | test_nodejs/input.hpp | hirakuni45/test | 04254eab7d2398408aa0015194d4c21011f9bd7a | [
"BSD-3-Clause"
] | 2 | 2021-11-16T17:51:01.000Z | 2021-11-16T17:51:42.000Z | test_nodejs/input.hpp | hirakuni45/test | 04254eab7d2398408aa0015194d4c21011f9bd7a | [
"BSD-3-Clause"
] | 1 | 2021-01-17T23:03:33.000Z | 2021-01-17T23:03:33.000Z | #pragma once
//=====================================================================//
/*! @file
@brief input クラス @n
数値、文字列などの入力クラス @n
%b ---> ２進の数値 @n
%o ---> ８進の数値 @n
%d ---> １０進の数値 @n
%x ---> １６進の数値 @n
%f ---> 浮動小数点数（float、double） @n
%c ---> １文字のキャラクター @n
%% ---> '%' のキャラクター
... | 20.794258 | 85 | 0.358951 | hirakuni45 |
3ca10d77aea8b434ee92f83ecace2f977fc44f32 | 7,504 | cpp | C++ | tests/database_test.cpp | bloodeagle40234/LineairDB | b0e1f601b0459c71f2c58471849340e6da3f830a | [
"Apache-2.0",
"BSD-2-Clause"
] | 83 | 2020-04-28T05:44:32.000Z | 2022-03-27T10:40:55.000Z | tests/database_test.cpp | bloodeagle40234/LineairDB | b0e1f601b0459c71f2c58471849340e6da3f830a | [
"Apache-2.0",
"BSD-2-Clause"
] | 170 | 2020-04-28T08:32:25.000Z | 2022-03-28T23:07:24.000Z | tests/database_test.cpp | bloodeagle40234/LineairDB | b0e1f601b0459c71f2c58471849340e6da3f830a | [
"Apache-2.0",
"BSD-2-Clause"
] | 10 | 2020-04-28T07:12:48.000Z | 2022-03-27T07:05:10.000Z | /*
* Copyright (C) 2020 Nippon Telegraph and Telephone Corporation.
* 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... | 37.148515 | 80 | 0.515592 | bloodeagle40234 |
3ca630f1d3291a21b30b6fc523bac10db7f12f33 | 961 | inl | C++ | include/inline/P2P_Endpoint.inl | AR0EN/communication | 7bcc319df0c83746dad6ea51e4ec5ff5b6d68e8d | [
"MIT"
] | 3 | 2021-12-28T06:15:16.000Z | 2022-01-09T12:26:16.000Z | include/inline/P2P_Endpoint.inl | AR0EN/communication | 7bcc319df0c83746dad6ea51e4ec5ff5b6d68e8d | [
"MIT"
] | 15 | 2021-12-17T13:30:08.000Z | 2022-01-09T13:41:34.000Z | include/inline/P2P_Endpoint.inl | AR0EN/communication | 7bcc319df0c83746dad6ea51e4ec5ff5b6d68e8d | [
"MIT"
] | null | null | null | #include "P2P_Endpoint.hpp"
namespace comm {
inline bool P2P_Endpoint::send(std::unique_ptr<Packet>& pPacket) {
if (pPacket) {
if (!mTxQueue.enqueue(pPacket)) {
LOGE("Tx Queue is full!\n");
}
return true;
} else {
LOGE("[%s][%d] Tx packet must not be empt... | 25.289474 | 96 | 0.57232 | AR0EN |
3ca63945a6e59ff6281ab40189045b93a67f60e6 | 773 | cpp | C++ | code/2020/21_virtual.cpp | watchpoints/daily-interview | 2a9848ed1290211952aea995dc312bc7e84b221e | [
"Apache-2.0"
] | 2 | 2021-07-21T04:19:46.000Z | 2021-07-21T04:19:52.000Z | code/2020/21_virtual.cpp | watchpoints/daily-interview | 2a9848ed1290211952aea995dc312bc7e84b221e | [
"Apache-2.0"
] | 27 | 2021-03-14T04:28:48.000Z | 2021-12-08T10:39:22.000Z | code/2020/21_virtual.cpp | watchpoints/daily-interview | 2a9848ed1290211952aea995dc312bc7e84b221e | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <typeinfo>
using namespace std;
class Base
{
public:
Base(int a = 1)
{
ma = a;
}
virtual void show()
{
cout<<"base::show"<<endl;
}
void show(int b)
{
cout<<"base show 2"<<endl;
}
private:
int ma;
};
class Derive : public Base
{
public:
Derive(int b = 2):Base(b)
{
mb = ... | 12.467742 | 48 | 0.542044 | watchpoints |
3ca6a8fe7f099d2cb5afef1da51ef6496e39b368 | 523 | cpp | C++ | cpp/sqrt.cpp | chaohan/code-samples | 0ae7da954a36547362924003d56a8bece845802c | [
"MIT"
] | null | null | null | cpp/sqrt.cpp | chaohan/code-samples | 0ae7da954a36547362924003d56a8bece845802c | [
"MIT"
] | null | null | null | cpp/sqrt.cpp | chaohan/code-samples | 0ae7da954a36547362924003d56a8bece845802c | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int mySqrt(int x)
{
if (x<2) {return x;}
int j = x,k;
while (true)
{
k = (j+x/j)/2;
if (j<=k) {return j;}
else {j=k;}
}
return j;
}
int main()
{
... | 18.678571 | 36 | 0.374761 | chaohan |
3cb13eb8e634f7c6748db39cbcf9c8087cc73ae7 | 1,550 | cpp | C++ | SkeletalAnimation/SkeletalAnimation/Re/Graphics/Gui/GuiText.cpp | Risist/Project-skeletal-animation | 1f39d572521bfa0fef7ce9aebf32152608e3dc33 | [
"MIT"
] | null | null | null | SkeletalAnimation/SkeletalAnimation/Re/Graphics/Gui/GuiText.cpp | Risist/Project-skeletal-animation | 1f39d572521bfa0fef7ce9aebf32152608e3dc33 | [
"MIT"
] | null | null | null | SkeletalAnimation/SkeletalAnimation/Re/Graphics/Gui/GuiText.cpp | Risist/Project-skeletal-animation | 1f39d572521bfa0fef7ce9aebf32152608e3dc33 | [
"MIT"
] | null | null | null | /// Code from ReEngine library
/// all rights belongs to Risist (Maciej Dominiak) (risistt@gmail.com)
#include <Re\Graphics\Gui\GuiText.h>
#include <Re\Graphics\ResourceManager.h>
namespace Gui
{
Text::Text()
{
txt.setFont(res.fonts[1]);
txt.setFillColor(Color::White);
txt.setCharacterSize(25u);
}
void Tex... | 24.603175 | 83 | 0.673548 | Risist |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.