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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1f514034e9d0344acd0c573e8b3bc1addaaba1d8 | 1,308 | cpp | C++ | graphs/cycle_detection_using_dsu.cpp | Ashish2030/C-_Language_Code | 50b143124690249e5dbd4eaaddfb8a3dadf48f1f | [
"MIT"
] | 7 | 2021-05-05T00:14:39.000Z | 2021-05-16T07:10:06.000Z | graphs/cycle_detection_using_dsu.cpp | Ashish2030/C-_Language_Code | 50b143124690249e5dbd4eaaddfb8a3dadf48f1f | [
"MIT"
] | null | null | null | graphs/cycle_detection_using_dsu.cpp | Ashish2030/C-_Language_Code | 50b143124690249e5dbd4eaaddfb8a3dadf48f1f | [
"MIT"
] | 4 | 2021-05-17T07:54:57.000Z | 2021-06-29T15:36:54.000Z | #include<iostream>
#include<map>
#include<list>
#include<cstring>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;
class dsu{
vector<int>part;
public:
dsu(int n){
part.resize(n);
for(int i=0;i<n;i++){
part[i]=i;
}
... | 16.35 | 56 | 0.474006 | Ashish2030 |
1f56078dc315f07ce8c8a983d0fc31ce267fd54a | 1,968 | cpp | C++ | Graphics2D/Source/DDraw1DrawList.cpp | TaylorClark/PrimeTime | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | [
"MIT"
] | null | null | null | Graphics2D/Source/DDraw1DrawList.cpp | TaylorClark/PrimeTime | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | [
"MIT"
] | null | null | null | Graphics2D/Source/DDraw1DrawList.cpp | TaylorClark/PrimeTime | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | [
"MIT"
] | null | null | null | #include "..\PrivateInclude\DDraw1DrawList.h"
/// Test if the rectangle intersects any of the dirty rectangles
bool DDraw1DrawList::IntersectsDirtyRects( const Box2i& destRect ) const
{
// Go through each dirty rectangle and test for intersection
for( std::list<Box2i>::const_iterator iterRect = m_DirtyRects.begin()... | 26.958904 | 133 | 0.740346 | TaylorClark |
1f5c713e1791b673ed007f8bac5fb3134b7643f3 | 2,027 | cpp | C++ | binary.tree.cpp | lucasfrct/intro-C-PlusPlus | 4f0ca777c655c00ce8c4e2e3e1ddab7dc6fd2b57 | [
"MIT"
] | null | null | null | binary.tree.cpp | lucasfrct/intro-C-PlusPlus | 4f0ca777c655c00ce8c4e2e3e1ddab7dc6fd2b57 | [
"MIT"
] | null | null | null | binary.tree.cpp | lucasfrct/intro-C-PlusPlus | 4f0ca777c655c00ce8c4e2e3e1ddab7dc6fd2b57 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
class Node
{
private:
Node *left, *right;
int key;
public:
Node(int key)
{
this->key = key;
this->left = NULL;
this->right = NULL;
}
int getKey()
{
return this->key;
}
Node* getLeft()
{
return t... | 16.216 | 55 | 0.443019 | lucasfrct |
1f5cd7d826074a1caeb9fd00d225e1f0eaabad62 | 1,094 | cpp | C++ | Netcode/Graphics/DX12/DX12Texture.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | Netcode/Graphics/DX12/DX12Texture.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | Netcode/Graphics/DX12/DX12Texture.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | #include "DX12Texture.h"
#include <Netcode/Graphics/ResourceEnums.h>
namespace Netcode::Graphics::DX12 {
TextureImpl::TextureImpl(DirectX::ScratchImage && tData) : textureData{ std::move(tData) } { }
ResourceDimension TextureImpl::GetDimension() const {
switch(textureData.GetMetadata().dimension) {
case Direc... | 28.051282 | 95 | 0.761426 | tyekx |
48f824644beec0164416cd3e0b96bef31a14d756 | 158 | cpp | C++ | notebooks/funcs1.cpp | itachi4869/sta-663-2021 | 6f7a50f4a95207a26b01afa4439d992d767a1387 | [
"MIT"
] | null | null | null | notebooks/funcs1.cpp | itachi4869/sta-663-2021 | 6f7a50f4a95207a26b01afa4439d992d767a1387 | [
"MIT"
] | null | null | null | notebooks/funcs1.cpp | itachi4869/sta-663-2021 | 6f7a50f4a95207a26b01afa4439d992d767a1387 | [
"MIT"
] | null | null | null | #include <pybind11/pybind11.h>
namespace py = pybind11;
int add(int a, int b) {
return a + b;
}
void init_f1(py::module &m) {
m.def("add", &add);
}
| 14.363636 | 30 | 0.601266 | itachi4869 |
5b01e9f8a7ecf5aa9af4bd4b721f5a604bf0f518 | 1,343 | cpp | C++ | Vic2ToHoI4Tests/HoI4WorldTests/Regions/RegionsTests.cpp | CarbonY26/Vic2ToHoI4 | af3684d6aaaafea81aaadfb64a21a2b696f618e1 | [
"MIT"
] | 25 | 2018-12-10T03:41:49.000Z | 2021-10-04T10:42:36.000Z | Vic2ToHoI4Tests/HoI4WorldTests/Regions/RegionsTests.cpp | CarbonY26/Vic2ToHoI4 | af3684d6aaaafea81aaadfb64a21a2b696f618e1 | [
"MIT"
] | 739 | 2018-12-13T02:01:20.000Z | 2022-03-28T02:57:13.000Z | Vic2ToHoI4Tests/HoI4WorldTests/Regions/RegionsTests.cpp | IhateTrains/Vic2ToHoI4 | 5ad7f7c259f7495a10e043ade052d3b18a8951dc | [
"MIT"
] | 43 | 2018-12-10T03:41:58.000Z | 2022-03-22T23:55:41.000Z | #include "HOI4World/Regions/Regions.h"
#include "HOI4World/Regions/RegionsFactory.h"
#include "gtest/gtest.h"
TEST(HoI4World_Regions_RegionsTests, ProvinceInUnmappedRegionsReturnsNullptr)
{
const auto regions = HoI4::Regions::Factory().getRegions();
EXPECT_EQ(std::nullopt, regions->getRegion(0));
}
TEST(HoI4Wor... | 25.826923 | 77 | 0.787789 | CarbonY26 |
5b090d1d235ea99090453fb502d25c409a36e385 | 437 | cpp | C++ | src/ooni/tcp_connect.cpp | alessandro40/libight | de434be18791844076603b50167c436a768e830e | [
"BSD-2-Clause"
] | null | null | null | src/ooni/tcp_connect.cpp | alessandro40/libight | de434be18791844076603b50167c436a768e830e | [
"BSD-2-Clause"
] | null | null | null | src/ooni/tcp_connect.cpp | alessandro40/libight | de434be18791844076603b50167c436a768e830e | [
"BSD-2-Clause"
] | null | null | null | #include <ight/ooni/tcp_connect.hpp>
using namespace ight::common::settings;
using namespace ight::ooni::tcp_connect;
void
TCPConnect::main(std::string input, Settings options,
std::function<void(ReportEntry)>&& cb)
{
options["host"] = input;
have_entry = cb;
client = connect(options, [th... | 25.705882 | 71 | 0.652174 | alessandro40 |
5b0b2b772b7a54dc8872b0c5c97e82516bea0976 | 6,858 | cpp | C++ | extras/usd/examples/usdDancingCubesExample/fileFormat.cpp | chen2qu/USD | 2bbedce05f61f37e7461b0319609f9ceeb91725e | [
"AML"
] | 88 | 2018-07-13T01:22:00.000Z | 2022-01-16T22:15:27.000Z | extras/usd/examples/usdDancingCubesExample/fileFormat.cpp | chen2qu/USD | 2bbedce05f61f37e7461b0319609f9ceeb91725e | [
"AML"
] | 1 | 2022-01-14T21:25:56.000Z | 2022-01-14T21:25:56.000Z | extras/usd/examples/usdDancingCubesExample/fileFormat.cpp | chen2qu/USD | 2bbedce05f61f37e7461b0319609f9ceeb91725e | [
"AML"
] | 26 | 2018-06-06T03:39:22.000Z | 2021-08-28T23:02:42.000Z | //
// Copyright 2019 Pixar
//
// Licensed under the Apache License, Version 2.0 (the "Apache License")
// with the following modification; you may not use this file except in
// compliance with the Apache License and the following modification to it:
// Section 6. Trademarks. is deleted and replaced with:
//
// 6. Trad... | 34.989796 | 86 | 0.729805 | chen2qu |
5b0bc75ab024c51e45cbebf36350bfb7371fa7f8 | 1,110 | cpp | C++ | 5. Longest Palindromic Substring/main.cpp | majianfei/leetcode | d79ad7dd8c07e9f816b5727d1d98eb55c719cb6d | [
"MIT"
] | null | null | null | 5. Longest Palindromic Substring/main.cpp | majianfei/leetcode | d79ad7dd8c07e9f816b5727d1d98eb55c719cb6d | [
"MIT"
] | null | null | null | 5. Longest Palindromic Substring/main.cpp | majianfei/leetcode | d79ad7dd8c07e9f816b5727d1d98eb55c719cb6d | [
"MIT"
] | null | null | null | #include <iostream>
//TODO,优化
/**
* Runtime: 200 ms, faster than 24.74% of C++ online submissions for Longest Palindromic Substring.
* Memory Usage: 186.7 MB, less than 8.03% of C++ online submissions for Longest Palindromic Substring.
*/
class Solution {
public:
string longestPalindrome(string s) {
... | 30.833333 | 104 | 0.405405 | majianfei |
5b1657def1ed0ccf941d0cba721f2570ed1536dc | 7,816 | cpp | C++ | test/test_FMinus.cpp | skmuduli92/libprop | 982753ee446a44aef2bfa92c944a3ce20c4a45ad | [
"BSD-3-Clause"
] | null | null | null | test/test_FMinus.cpp | skmuduli92/libprop | 982753ee446a44aef2bfa92c944a3ce20c4a45ad | [
"BSD-3-Clause"
] | null | null | null | test/test_FMinus.cpp | skmuduli92/libprop | 982753ee446a44aef2bfa92c944a3ce20c4a45ad | [
"BSD-3-Clause"
] | 2 | 2020-10-06T15:26:51.000Z | 2020-10-11T12:55:00.000Z |
#include <gtest/gtest.h>
#include "formula.h"
#include "parse_util.h"
#include "formula_util.h"
#include "trace.h"
#include "formula_util.h"
using namespace HyperPLTL;
using namespace std;
PHyperProp propertyOnceMinusOperator() {
PVarMap varmap = std::make_shared<VarMap>();
varmap->addIntVar("x");
varmap->ad... | 29.94636 | 87 | 0.670164 | skmuduli92 |
5b16a4ac2415ecf7c2f5d50a7f5f5b7738fafef7 | 9,075 | cpp | C++ | listeners/GPII_RFIDListener/src/Diagnostic.cpp | colinbdclark/windows | 3eb9e8c4bda54bc583af7309998ab202370bde23 | [
"BSD-3-Clause"
] | null | null | null | listeners/GPII_RFIDListener/src/Diagnostic.cpp | colinbdclark/windows | 3eb9e8c4bda54bc583af7309998ab202370bde23 | [
"BSD-3-Clause"
] | null | null | null | listeners/GPII_RFIDListener/src/Diagnostic.cpp | colinbdclark/windows | 3eb9e8c4bda54bc583af7309998ab202370bde23 | [
"BSD-3-Clause"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
//
// Diagnostic.cpp
//
// Copyright 2014 OpenDirective Ltd.
//
// Licensed under the New BSD license. You may not use this file except in
// compliance with this License.
//
// You may obtain a copy of the License at
// https://github.com/... | 30.555556 | 98 | 0.53168 | colinbdclark |
5b1889c5959378c5db3f7e2f15ab2b20ed176b81 | 2,291 | cpp | C++ | YorozuyaGSLib/source/US__AbstractThreadDetail.cpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | YorozuyaGSLib/source/US__AbstractThreadDetail.cpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | YorozuyaGSLib/source/US__AbstractThreadDetail.cpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | #include <US__AbstractThreadDetail.hpp>
#include <common/ATFCore.hpp>
START_ATF_NAMESPACE
namespace US
{
namespace Detail
{
Info::US__AbstractThreadctor_AbstractThread2_ptr US__AbstractThreadctor_AbstractThread2_next(nullptr);
Info::US__AbstractThreadctor_A... | 46.755102 | 122 | 0.647316 | lemkova |
5b1f73ee50254763be96b6984639258706861a64 | 3,640 | cpp | C++ | Boggle/code_1.cpp | Jatin-Goyal5/Data-Structures-and-Algorithms | f6bd0f77e5640c2e0568f3fffc4694758e77af96 | [
"MIT"
] | 27 | 2019-01-31T10:22:29.000Z | 2021-08-29T08:25:12.000Z | Boggle/code_1.cpp | Jatin-Goyal5/Data-Structures-and-Algorithms | f6bd0f77e5640c2e0568f3fffc4694758e77af96 | [
"MIT"
] | 6 | 2020-09-30T19:01:49.000Z | 2020-12-17T15:10:54.000Z | Boggle/code_1.cpp | Jatin-Goyal5/Data-Structures-and-Algorithms | f6bd0f77e5640c2e0568f3fffc4694758e77af96 | [
"MIT"
] | 27 | 2019-09-21T14:19:32.000Z | 2021-09-15T03:06:41.000Z | //
// code_1.cpp
// Algorithm
//
// Created by Mohd Shoaib Rayeen on 23/11/18.
// Copyright © 2018 Shoaib Rayeen. All rights reserved.
//
#include <iostream>
using namespace std;
#define char_int(c) ((int)c - (int)'A')
#define SIZE (26)
#define M 3
#define N 3
struct TrieNode {
TrieNode *Child[SIZE];
... | 28.4375 | 97 | 0.467308 | Jatin-Goyal5 |
5b1fc763f2b4d71d72ca122a57c98b9e2f695e8a | 1,821 | hpp | C++ | src/hex_pathfinding.hpp | cbeck88/HexWarfare | 94a70b1889afc2fbd990892ed66be874ac70d1b4 | [
"Apache-2.0"
] | null | null | null | src/hex_pathfinding.hpp | cbeck88/HexWarfare | 94a70b1889afc2fbd990892ed66be874ac70d1b4 | [
"Apache-2.0"
] | null | null | null | src/hex_pathfinding.hpp | cbeck88/HexWarfare | 94a70b1889afc2fbd990892ed66be874ac70d1b4 | [
"Apache-2.0"
] | null | null | null | /*
Copyright 2014 Kristina Simpson <sweet.kristas@gmail.com>
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or ... | 34.358491 | 153 | 0.772103 | cbeck88 |
5b21786e54a5cf1abf566e8988f8e7e8d35cf6a7 | 542 | cpp | C++ | Example/signals2_09/main.cpp | KwangjoJeong/Boost | 29c4e2422feded66a689e3aef73086c5cf95b6fe | [
"MIT"
] | null | null | null | Example/signals2_09/main.cpp | KwangjoJeong/Boost | 29c4e2422feded66a689e3aef73086c5cf95b6fe | [
"MIT"
] | null | null | null | Example/signals2_09/main.cpp | KwangjoJeong/Boost | 29c4e2422feded66a689e3aef73086c5cf95b6fe | [
"MIT"
] | null | null | null | #include <boost/signals2.hpp>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace boost::signals2;
template <typename T>
struct return_all
{
typedef T result_type;
template <typename InputIterator>
T operator()(InputIterator first, InputIterator last) const
{
return T(first, last);... | 20.074074 | 61 | 0.654982 | KwangjoJeong |
5b22f927d629a0595735e30fa52ce74c0d7fcbd7 | 2,201 | cpp | C++ | 44_DigitsInSequence/DigitsInSequence.cpp | NoMoreWaiting/CodingInterviewChinese2 | 458b2fb52b91a6601fd9b70dd3b973d30c2f3f52 | [
"BSD-3-Clause"
] | null | null | null | 44_DigitsInSequence/DigitsInSequence.cpp | NoMoreWaiting/CodingInterviewChinese2 | 458b2fb52b91a6601fd9b70dd3b973d30c2f3f52 | [
"BSD-3-Clause"
] | null | null | null | 44_DigitsInSequence/DigitsInSequence.cpp | NoMoreWaiting/CodingInterviewChinese2 | 458b2fb52b91a6601fd9b70dd3b973d30c2f3f52 | [
"BSD-3-Clause"
] | null | null | null | /*******************************************************************
Copyright(c) 2016, Harry He
All rights reserved.
Distributed under the BSD license.
(See accompanying file LICENSE.txt at
https://github.com/zhedahht/CodingInterviewChinese2/blob/master/LICENSE.txt)
***************************************************... | 22.690722 | 76 | 0.569741 | NoMoreWaiting |
5b240a57d34a46dc1bec99d97e7f964d1405ae3d | 2,761 | cpp | C++ | src/Utils/String.cpp | vincentdelpech/biorbd | 0d7968e75e182f067a4d4c24cc15fa9a331ca792 | [
"MIT"
] | null | null | null | src/Utils/String.cpp | vincentdelpech/biorbd | 0d7968e75e182f067a4d4c24cc15fa9a331ca792 | [
"MIT"
] | null | null | null | src/Utils/String.cpp | vincentdelpech/biorbd | 0d7968e75e182f067a4d4c24cc15fa9a331ca792 | [
"MIT"
] | null | null | null | #define BIORBD_API_EXPORTS
#include "Utils/String.h"
#include <map>
#include <algorithm>
#include <vector>
#include <boost/lexical_cast.hpp>
#include "Utils/Error.h"
biorbd::utils::String::String()
: std::string("")
{
}
biorbd::utils::String::String(const char *c)
: std::string(c)
{
}
biorbd::utils::Strin... | 25.330275 | 105 | 0.648678 | vincentdelpech |
5b24ce8aae34b943b10c84e33e9fb73e4a00f68e | 16,480 | hh | C++ | dune/gdt/interpolations/boundary.hh | pymor/dune-gdt | fabc279a79e7362181701866ce26133ec40a05e0 | [
"BSD-2-Clause"
] | 4 | 2018-10-12T21:46:08.000Z | 2020-08-01T18:54:02.000Z | dune/gdt/interpolations/boundary.hh | dune-community/dune-gdt | fabc279a79e7362181701866ce26133ec40a05e0 | [
"BSD-2-Clause"
] | 154 | 2016-02-16T13:50:54.000Z | 2021-12-13T11:04:29.000Z | dune/gdt/interpolations/boundary.hh | dune-community/dune-gdt | fabc279a79e7362181701866ce26133ec40a05e0 | [
"BSD-2-Clause"
] | 5 | 2016-03-02T10:11:20.000Z | 2020-02-08T03:56:24.000Z | // This file is part of the dune-gdt project:
// https://github.com/dune-community/dune-gdt
// Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.
// License: Dual licensed as BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
// or GPL-2.0+ (http://opensource.org/lice... | 48.328446 | 120 | 0.694782 | pymor |
5b2686e34d63b86fc5a4ba61e692695f64e1e914 | 6,000 | cpp | C++ | test/marker.cpp | fizyr/dr_marker | 039cdff23516749c5830acdce7f7be5ba71cae02 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | test/marker.cpp | fizyr/dr_marker | 039cdff23516749c5830acdce7f7be5ba71cae02 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | test/marker.cpp | fizyr/dr_marker | 039cdff23516749c5830acdce7f7be5ba71cae02 | [
"Apache-2.0",
"BSD-3-Clause"
] | 1 | 2018-06-06T10:07:13.000Z | 2018-06-06T10:07:13.000Z | /**
* Copyright 2014-2018 Fizyr BV. https://fizyr.com
*
* 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... | 32.258065 | 83 | 0.716833 | fizyr |
5b275307317bec0185acada3bc496e71c96d3347 | 32,316 | cpp | C++ | src/Services/PickerService/PickerService.cpp | irov/Mengine | b76e9f8037325dd826d4f2f17893ac2b236edad8 | [
"MIT"
] | 39 | 2016-04-21T03:25:26.000Z | 2022-01-19T14:16:38.000Z | src/Services/PickerService/PickerService.cpp | irov/Mengine | b76e9f8037325dd826d4f2f17893ac2b236edad8 | [
"MIT"
] | 23 | 2016-06-28T13:03:17.000Z | 2022-02-02T10:11:54.000Z | src/Services/PickerService/PickerService.cpp | irov/Mengine | b76e9f8037325dd826d4f2f17893ac2b236edad8 | [
"MIT"
] | 14 | 2016-06-22T20:45:37.000Z | 2021-07-05T12:25:19.000Z | #include "PickerService.h"
#include "Interface/InputServiceInterface.h"
#include "Interface/ApplicationInterface.h"
#include "Interface/EnumeratorServiceInterface.h"
#include "Kernel/Arrow.h"
#include "Kernel/Scene.h"
#include "Kernel/VectorAuxScope.h"
#include "Kernel/Logger.h"
#include "Kernel/VectorAuxScope.h"
#in... | 30.089385 | 172 | 0.453398 | irov |
5b2a210b884266a9629387e4c463dc844adb3705 | 1,182 | cpp | C++ | examples/twiscanner/main.cpp | 2ni/aprico | 0b421a1dcf523474d17df06ab5467ef5c369a6cd | [
"MIT"
] | 1 | 2021-03-02T19:54:04.000Z | 2021-03-02T19:54:04.000Z | examples/twiscanner/main.cpp | 2ni/aprico | 0b421a1dcf523474d17df06ab5467ef5c369a6cd | [
"MIT"
] | null | null | null | examples/twiscanner/main.cpp | 2ni/aprico | 0b421a1dcf523474d17df06ab5467ef5c369a6cd | [
"MIT"
] | null | null | null | #include <util/delay.h>
#include <avr/io.h>
#include "uart.h"
#include "twi.h"
#include "mcu.h"
int main(void) {
mcu_init();
twi_init();
DL("start scanning");
for (uint8_t addr = 0; addr<128; addr+=1) {
// DF("0x%02x: %s\n", addr, twi_start(addr) ? "-" : "yes");
if (!twi_start(addr)) {
DF("0x%... | 22.730769 | 79 | 0.551607 | 2ni |
5b334ef7343ddfff5c1f6c39173f40733da94898 | 536 | cpp | C++ | Inheritance/hierarchical.cpp | git-elliot/competitive_programming_codes | b8b5646ae5074b453e7f1af982af174b9c4138e1 | [
"MIT"
] | 1 | 2021-06-20T17:28:54.000Z | 2021-06-20T17:28:54.000Z | Inheritance/hierarchical.cpp | git-elliot/competitive_programming_codes | b8b5646ae5074b453e7f1af982af174b9c4138e1 | [
"MIT"
] | null | null | null | Inheritance/hierarchical.cpp | git-elliot/competitive_programming_codes | b8b5646ae5074b453e7f1af982af174b9c4138e1 | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
//Hierarchical inheritance is defined as the process of deriving more than one class from a base class.
class Shape{
public:
int a = 10;
int b = 20;
};
class Rectange : public Shape{
public:
int area(){
return a*b;
}
};
class Triangle : public Sh... | 18.482759 | 103 | 0.602612 | git-elliot |
5b35e72d4a64ecc037629c4f870702465262d8e3 | 156 | cpp | C++ | examples/core/static/application/main.cpp | smeualex/cmake-examples | d443a5d9359565f474f56f0251a511544b2168eb | [
"MIT"
] | 979 | 2019-03-10T15:31:09.000Z | 2022-03-26T03:58:49.000Z | examples/core/static/application/main.cpp | smeualex/cmake-examples | d443a5d9359565f474f56f0251a511544b2168eb | [
"MIT"
] | 9 | 2019-03-11T13:05:08.000Z | 2021-09-27T21:27:07.000Z | examples/core/static/application/main.cpp | smeualex/cmake-examples | d443a5d9359565f474f56f0251a511544b2168eb | [
"MIT"
] | 56 | 2019-03-11T07:05:54.000Z | 2022-02-23T14:00:59.000Z | #include <iostream>
#include "calculator-static/calculator.h"
int main(int argc, char** argv)
{
std::cout << calc::square(4) << "\n";
return 0;
}
| 15.6 | 41 | 0.621795 | smeualex |
5b376114194c63acba15113fcd514aec00167d28 | 492 | hpp | C++ | FootCommander.hpp | Revertigo/wargame-b | 8cd4591586b275923c38047c480a61529cc199dc | [
"MIT"
] | null | null | null | FootCommander.hpp | Revertigo/wargame-b | 8cd4591586b275923c38047c480a61529cc199dc | [
"MIT"
] | null | null | null | FootCommander.hpp | Revertigo/wargame-b | 8cd4591586b275923c38047c480a61529cc199dc | [
"MIT"
] | null | null | null | //
// Created by osboxes on 5/19/20.
//
#ifndef WARGAME_A_FOOTCOMMANDER_HPP
#define WARGAME_A_FOOTCOMMANDER_HPP
#include "FootSoldier.hpp"
class FootCommander : public FootSoldier {
using FootSoldier::FootSoldier;
static const int DMG = 20;
static const int HP = 150;
protected:
void act(pair<int, in... | 19.68 | 76 | 0.721545 | Revertigo |
5b38ab5fa55a82fcad14eb97c0489a7ae842c601 | 14,132 | cpp | C++ | test/input_cases/csp_financial_defaults.cpp | JordanMalan/ssc | cadb7a9f3183d63c600b5c33f53abced35b6b319 | [
"BSD-3-Clause"
] | 61 | 2017-08-09T15:10:59.000Z | 2022-02-15T21:45:31.000Z | test/input_cases/csp_financial_defaults.cpp | JordanMalan/ssc | cadb7a9f3183d63c600b5c33f53abced35b6b319 | [
"BSD-3-Clause"
] | 462 | 2017-07-31T21:26:46.000Z | 2022-03-30T22:53:50.000Z | test/input_cases/csp_financial_defaults.cpp | JordanMalan/ssc | cadb7a9f3183d63c600b5c33f53abced35b6b319 | [
"BSD-3-Clause"
] | 73 | 2017-08-24T17:39:31.000Z | 2022-03-28T08:37:47.000Z | #include "../input_cases/code_generator_utilities.h"
/**
* Default parameters for the PPA singleowner (utility) financial model
*/
ssc_data_t singleowner_defaults()
{
ssc_data_t data = ssc_data_create();
ssc_data_set_number(data, "analysis_period", 25);
ssc_number_t p_federal_tax_rate[1] = { 21 };
ss... | 54.563707 | 88 | 0.755095 | JordanMalan |
5b46ab1a6aff59cd4e94dd3da52da4c678152257 | 1,801 | hh | C++ | src/server/world/world.hh | TheBenPerson/Game | 824b2240e95529b735b4d8055a541c77102bb5dc | [
"MIT"
] | null | null | null | src/server/world/world.hh | TheBenPerson/Game | 824b2240e95529b735b4d8055a541c77102bb5dc | [
"MIT"
] | null | null | null | src/server/world/world.hh | TheBenPerson/Game | 824b2240e95529b735b4d8055a541c77102bb5dc | [
"MIT"
] | null | null | null | /*
*
* Game Development Build
* https://github.com/TheBenPerson/Game
*
* Copyright (C) 2016-2018 Ben Stockett <thebenstockett@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Soft... | 26.880597 | 81 | 0.738479 | TheBenPerson |
5b4808b262aef707ea7a7c1d8ebef6dda219df62 | 518 | cpp | C++ | CodeForces/fair_playoff.cpp | PieroNarciso/cprogramming | d3a53ce2afce6f853e0b7cc394190d5be6427902 | [
"MIT"
] | 2 | 2021-05-22T17:47:01.000Z | 2021-05-27T17:10:58.000Z | CodeForces/fair_playoff.cpp | PieroNarciso/cprogramming | d3a53ce2afce6f853e0b7cc394190d5be6427902 | [
"MIT"
] | null | null | null | CodeForces/fair_playoff.cpp | PieroNarciso/cprogramming | d3a53ce2afce6f853e0b7cc394190d5be6427902 | [
"MIT"
] | null | null | null | // https://codeforces.com/contest/1535/problem/A
#include <bits/stdc++.h>
using namespace std;
int s1, s2, s3, s4;
void solve() {
cin >> s1 >> s2 >> s3 >> s4;
int maxFirst = max(s1, s2);
int maxSec = max(s3, s4);
if ((maxFirst > s3 || maxFirst > s4) && (maxSec > s1 || maxSec > s2)) {
cout << "YES" << endl;
} ... | 17.862069 | 72 | 0.557915 | PieroNarciso |
5b49d4572a0c31abe9a58c95e07b28d9644d623f | 1,017 | hpp | C++ | include/boost/simd/function/definition/divfix.hpp | yaeldarmon/boost.simd | 561316cc54bdc6353ca78f3b6d7e9120acd11144 | [
"BSL-1.0"
] | null | null | null | include/boost/simd/function/definition/divfix.hpp | yaeldarmon/boost.simd | 561316cc54bdc6353ca78f3b6d7e9120acd11144 | [
"BSL-1.0"
] | null | null | null | include/boost/simd/function/definition/divfix.hpp | yaeldarmon/boost.simd | 561316cc54bdc6353ca78f3b6d7e9120acd11144 | [
"BSL-1.0"
] | null | null | null | //==================================================================================================
/*!
@file
@copyright 2016 NumScale SAS
@copyright 2016 J.T.Lapreste
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*... | 26.763158 | 100 | 0.621436 | yaeldarmon |
5b4ad5e9c00c8c56a79d05f88a8e6c79b366f86b | 485 | c++ | C++ | Hackerrank/Pairs [Medium].c++ | ammar-sayed-taha/problem-solving | 9677a738c0cc30078f6450f40fcc26ba2a379a8b | [
"MIT"
] | 1 | 2020-02-20T00:04:54.000Z | 2020-02-20T00:04:54.000Z | Hackerrank/Pairs [Medium].c++ | ammar-sayed-taha/Problem-Solving | c3ef98b8b0ebfbcc31d45990822b81a9dc549fe8 | [
"MIT"
] | null | null | null | Hackerrank/Pairs [Medium].c++ | ammar-sayed-taha/Problem-Solving | c3ef98b8b0ebfbcc31d45990822b81a9dc549fe8 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the pairs function below.
int pairs(int k, vector<int> arr) {
sort(arr.begin(), arr.end()); // O(nlgn)
int counter=0;
for(auto i = 0; i < arr.size(); i++){ // O(n)
for(auto j=i+1; j<arr.size(); j++){ ... | 20.208333 | 51 | 0.503093 | ammar-sayed-taha |
5b5fa1086a789e5a089b07233585014982484c16 | 5,098 | hpp | C++ | viennacl/ocl/device_utils.hpp | yuchengs/viennacl-dev | 99f250fdb729de01ff5e9aebbed7b2ed3b1d8dfa | [
"MIT"
] | 224 | 2015-02-15T21:50:13.000Z | 2022-01-14T18:27:03.000Z | viennacl/ocl/device_utils.hpp | yuchengs/viennacl-dev | 99f250fdb729de01ff5e9aebbed7b2ed3b1d8dfa | [
"MIT"
] | 189 | 2015-01-09T17:08:04.000Z | 2021-06-04T06:23:22.000Z | viennacl/ocl/device_utils.hpp | yuchengs/viennacl-dev | 99f250fdb729de01ff5e9aebbed7b2ed3b1d8dfa | [
"MIT"
] | 84 | 2015-01-15T14:06:13.000Z | 2022-01-23T14:51:17.000Z | #ifndef VIENNACL_OCL_DEVICE_UTILS_HPP_
#define VIENNACL_OCL_DEVICE_UTILS_HPP_
/* =========================================================================
Copyright (c) 2010-2016, Institute for Microelectronics,
Institute for Analysis and Scientific Computing,
... | 26.414508 | 161 | 0.624166 | yuchengs |
5b6157f723c18eed98ad8e405446ae2b433f388a | 868 | cpp | C++ | .LHP/.Lop10/.O.L.P/.T.Vinh/OL3/DAUXE/DAUXE/DAUXE.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/.Lop10/.O.L.P/.T.Vinh/OL3/DAUXE/DAUXE/DAUXE.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/.Lop10/.O.L.P/.T.Vinh/OL3/DAUXE/DAUXE/DAUXE.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | #include "pch.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#pragma warning(disable:4996)
#define maxN 101
#define maxL 121
#define empty '.'
#define block 'X'
typedef int maxn, maxl;
maxn n, L;
std::vector <maxl> a;
void Add(maxl &x) {
x = x - L + 1;
while (x > 0) {
a.push_... | 14 | 72 | 0.535714 | sxweetlollipop2912 |
5b617b02df27c604edcbef53d1e78a5e445ff04b | 1,546 | cpp | C++ | new folder/55.cpp | bprithiraj/DSA-CPsolvedproblemscode | 4b3765e4afb26016fade1f1e526b36934583c668 | [
"Apache-2.0"
] | null | null | null | new folder/55.cpp | bprithiraj/DSA-CPsolvedproblemscode | 4b3765e4afb26016fade1f1e526b36934583c668 | [
"Apache-2.0"
] | null | null | null | new folder/55.cpp | bprithiraj/DSA-CPsolvedproblemscode | 4b3765e4afb26016fade1f1e526b36934583c668 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 13.327586 | 52 | 0.487063 | bprithiraj |
5b6d3b36244ff88ef2574a5109f44e7677af00aa | 1,355 | cpp | C++ | Broccoli/src/Broccoli/Renderer/Buffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | 1 | 2021-08-03T01:38:41.000Z | 2021-08-03T01:38:41.000Z | Broccoli/src/Broccoli/Renderer/Buffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | null | null | null | Broccoli/src/Broccoli/Renderer/Buffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | null | null | null | #include "brclpch.h"
#include "Buffer.h"
#include "Renderer.h"
#include "Platform/OpenGL/OpenGLBuffer.h"
namespace brcl
{
std::unique_ptr<VertexBuffer> VertexBuffer::Create(uint32_t size)
{
switch (renderer::GetAPI())
{
case RendererAPI::API::None: BRCL_CORE_ASSERT(false, "RendererAPI::None is currently no... | 29.456522 | 123 | 0.732841 | tross2552 |
5b6fa607acf172b32aca9f7f553df46ba37ad09c | 2,195 | cpp | C++ | SerialTesting/SerialHelper.cpp | jj9146/Arduino | bfee6d42067b342eb51cbe42bb3c2020f9c9c858 | [
"MIT"
] | null | null | null | SerialTesting/SerialHelper.cpp | jj9146/Arduino | bfee6d42067b342eb51cbe42bb3c2020f9c9c858 | [
"MIT"
] | null | null | null | SerialTesting/SerialHelper.cpp | jj9146/Arduino | bfee6d42067b342eb51cbe42bb3c2020f9c9c858 | [
"MIT"
] | null | null | null | /*
SerialHelper.cpp - Library for auto-magically determining
if a board is being powered by the USB port, and will halt
all attempts to connect to and send data over COM when
there is no computer/device to listen or respond.
*** For Arduino Nano boards ***
* NOTE: Requires a 10k resistor soldered between P... | 30.486111 | 100 | 0.69795 | jj9146 |
ac93d08e920e7e3262ff43b035551fa9a6aaa854 | 5,889 | cpp | C++ | examples/chess/src/chess.cpp | KazDragon/munin | ca5ae77cf5f75f6604fddd1a39393fa6acb88769 | [
"MIT"
] | 6 | 2017-07-15T10:16:20.000Z | 2021-06-14T10:02:37.000Z | examples/chess/src/chess.cpp | KazDragon/munin | ca5ae77cf5f75f6604fddd1a39393fa6acb88769 | [
"MIT"
] | 243 | 2017-05-01T19:27:07.000Z | 2021-09-01T09:32:49.000Z | examples/chess/src/chess.cpp | KazDragon/munin | ca5ae77cf5f75f6604fddd1a39393fa6acb88769 | [
"MIT"
] | 2 | 2019-07-16T00:29:43.000Z | 2020-09-19T09:49:00.000Z | #include <munin/button.hpp>
#include <munin/compass_layout.hpp>
#include <munin/filled_box.hpp>
#include <munin/grid_layout.hpp>
#include <munin/image.hpp>
#include <munin/scroll_pane.hpp>
#include <munin/text_area.hpp>
#include <munin/view.hpp>
#include <munin/window.hpp>
#include <terminalpp/canvas.hpp>
#include <ter... | 30.994737 | 142 | 0.533707 | KazDragon |
ac96cdfc0f02aabe82becbdefc53c58933372f17 | 6,091 | cc | C++ | tests/unit/rdma/test_rdma_collection_handle.extended.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 26 | 2019-11-26T08:36:15.000Z | 2022-02-15T17:13:21.000Z | tests/unit/rdma/test_rdma_collection_handle.extended.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 1,215 | 2019-09-09T14:31:33.000Z | 2022-03-30T20:20:14.000Z | tests/unit/rdma/test_rdma_collection_handle.extended.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 12 | 2019-09-08T00:03:05.000Z | 2022-02-23T21:28:35.000Z | /*
//@HEADER
// *****************************************************************************
//
// test_rdma_collection_handle.extended.cc
// DARMA/vt => Virtual Transport
//
// Copyright 2019-2021 National Technology & Engineering Solutions of Sandia, LLC
// (NTESS). Under the ... | 31.076531 | 83 | 0.66902 | rbuch |
ac9dd0541a5ed85c2fb5017510845e234dbc75a0 | 991 | cpp | C++ | RTCSDK/service/biz_service_factory.cpp | tyouritsugun/janus-client-cplus | f478ddcf62d12f1b0efe213dd695ec022e793070 | [
"MIT"
] | 1 | 2020-12-18T09:11:05.000Z | 2020-12-18T09:11:05.000Z | RTCSDK/service/biz_service_factory.cpp | tyouritsugun/janus-client-cplus | f478ddcf62d12f1b0efe213dd695ec022e793070 | [
"MIT"
] | null | null | null | RTCSDK/service/biz_service_factory.cpp | tyouritsugun/janus-client-cplus | f478ddcf62d12f1b0efe213dd695ec022e793070 | [
"MIT"
] | 1 | 2021-08-11T01:09:22.000Z | 2021-08-11T01:09:22.000Z | /**
* This file is part of janus_client project.
* Author: Jackie Ou
* Created: 2020-10-01
**/
#include "biz_service_factory.h"
#include "notification_service.h"
namespace core {
BizServiceFactory::BizServiceFactory(const std::shared_ptr<IUnifiedFactory>& unifiedFactory)
: _unifiedFactory(unifiedFactor... | 19.82 | 109 | 0.691221 | tyouritsugun |
acb3de12b891c8be8153746689eb3fa6c051b985 | 1,514 | hpp | C++ | cpp/map_key_iterator.hpp | frobware/cmd-key-happy | cd64bba07dc729f2701b0fc1e603d04d2dbc64e9 | [
"MIT"
] | 35 | 2015-09-24T23:04:03.000Z | 2022-03-09T16:31:16.000Z | cpp/map_key_iterator.hpp | frobware/cmd-key-happy | cd64bba07dc729f2701b0fc1e603d04d2dbc64e9 | [
"MIT"
] | 4 | 2016-05-17T20:25:14.000Z | 2019-06-05T16:14:34.000Z | cpp/map_key_iterator.hpp | frobware/cmd-key-happy | cd64bba07dc729f2701b0fc1e603d04d2dbc64e9 | [
"MIT"
] | 8 | 2015-12-08T01:18:58.000Z | 2020-07-24T21:53:34.000Z | #pragma once
// This class/idea/idiom taken from a reply on stackoverflow (but I
// cannot find the original author). XXX Add missing attribution for
// this code.
#include <map>
#include <iterator>
namespace frobware {
template<typename map_type>
class key_iterator : public map_type::iterator
{
public:
typedef... | 23.65625 | 84 | 0.76288 | frobware |
acbff0d2bc6fd0d2b2a9c66d92ffb8ec3b355c0a | 1,226 | cpp | C++ | OGDF/_examples/layout/orthogonal/main.cpp | shahnidhi/MetaCarvel | f3bea5fdbbecec4c9becc6bbdc9585a939eb5481 | [
"MIT"
] | 13 | 2017-12-21T03:35:41.000Z | 2022-01-31T13:45:25.000Z | OGDF/_examples/layout/orthogonal/main.cpp | shahnidhi/MetaCarvel | f3bea5fdbbecec4c9becc6bbdc9585a939eb5481 | [
"MIT"
] | 7 | 2017-09-13T01:31:24.000Z | 2021-12-14T00:31:50.000Z | OGDF/_examples/layout/orthogonal/main.cpp | shahnidhi/MetaCarvel | f3bea5fdbbecec4c9becc6bbdc9585a939eb5481 | [
"MIT"
] | 15 | 2017-09-07T18:28:55.000Z | 2022-01-18T14:17:43.000Z | #include <ogdf/planarity/PlanarizationLayout.h>
#include <ogdf/planarity/SubgraphPlanarizer.h>
#include <ogdf/planarity/VariableEmbeddingInserter.h>
#include <ogdf/planarity/FastPlanarSubgraph.h>
#include <ogdf/orthogonal/OrthoLayout.h>
#include <ogdf/planarity/EmbedderMinDepthMaxFaceLayers.h>
#include <ogdf/fileformat... | 24.52 | 72 | 0.777325 | shahnidhi |
acc1aeab0c888abdc127e061373d13a39f347805 | 10,148 | cpp | C++ | sdk/chustd/ImageFormat.cpp | hadrien-psydk/pngoptimizer | d92946e63a57a4562af0feaa9e4cfd8628373777 | [
"Zlib"
] | 90 | 2016-08-23T00:13:04.000Z | 2022-02-22T09:40:46.000Z | sdk/chustd/ImageFormat.cpp | hadrien-psydk/pngoptimizer | d92946e63a57a4562af0feaa9e4cfd8628373777 | [
"Zlib"
] | 25 | 2016-09-01T07:09:03.000Z | 2022-01-31T16:18:57.000Z | sdk/chustd/ImageFormat.cpp | hadrien-psydk/pngoptimizer | d92946e63a57a4562af0feaa9e4cfd8628373777 | [
"Zlib"
] | 17 | 2017-05-03T17:49:25.000Z | 2021-12-28T06:47:56.000Z | ///////////////////////////////////////////////////////////////////////////////
// This file is part of the chustd library
// Copyright (C) ChuTeam
// For conditions of distribution and use, see copyright notice in chustd.h
///////////////////////////////////////////////////////////////////////////////
#include "stdaf... | 20.134921 | 101 | 0.582184 | hadrien-psydk |
acc251772bb370a154ff6840dedcb61bdce121e9 | 2,801 | cpp | C++ | tools/light-directions/main.cpp | bradparks/Restore__3d_model_from_pics_2d_multiple_images | 58f935130693e6eba2db133ce8dec3fd6a3d3dd0 | [
"MIT"
] | 21 | 2018-07-17T02:35:43.000Z | 2022-02-25T00:45:09.000Z | tools/light-directions/main.cpp | bradparks/Restore__3d_model_from_pics_2d_multiple_images | 58f935130693e6eba2db133ce8dec3fd6a3d3dd0 | [
"MIT"
] | null | null | null | tools/light-directions/main.cpp | bradparks/Restore__3d_model_from_pics_2d_multiple_images | 58f935130693e6eba2db133ce8dec3fd6a3d3dd0 | [
"MIT"
] | 11 | 2018-09-06T17:29:36.000Z | 2022-01-29T12:20:59.000Z | // Copyright (c) 2015-2016, Kai Wolf
//
// 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... | 36.376623 | 80 | 0.697251 | bradparks |
acc3b189afe63eedffa6fa7e2d92c221cb77349a | 48,337 | cc | C++ | supersonic/cursor/core/aggregate_groups.cc | IssamElbaytam/supersonic | 062a48ddcb501844b25a8ae51bd777fcf7ac1721 | [
"Apache-2.0"
] | 201 | 2015-03-18T21:55:00.000Z | 2022-03-03T01:48:26.000Z | supersonic/cursor/core/aggregate_groups.cc | edisona/supersonic | 062a48ddcb501844b25a8ae51bd777fcf7ac1721 | [
"Apache-2.0"
] | 6 | 2015-03-19T16:47:19.000Z | 2020-10-05T09:38:26.000Z | supersonic/cursor/core/aggregate_groups.cc | edisona/supersonic | 062a48ddcb501844b25a8ae51bd777fcf7ac1721 | [
"Apache-2.0"
] | 54 | 2015-03-19T16:31:57.000Z | 2021-12-31T10:14:57.000Z | // Copyright 2010 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable... | 41.669828 | 80 | 0.701781 | IssamElbaytam |
acc5d6b6567be09ad8389cda0ec835b7f7bc50ab | 23,914 | cpp | C++ | src/states/main-state.cpp | xterminal86/nrogue | 1d4e578b3d854b8e4d41f5ba1477de9b2c9e864f | [
"MIT"
] | 7 | 2019-03-05T05:32:13.000Z | 2022-01-10T10:06:47.000Z | src/states/main-state.cpp | xterminal86/nrogue | 1d4e578b3d854b8e4d41f5ba1477de9b2c9e864f | [
"MIT"
] | 2 | 2020-01-19T16:43:51.000Z | 2021-12-16T14:54:56.000Z | src/states/main-state.cpp | xterminal86/nrogue | 1d4e578b3d854b8e4d41f5ba1477de9b2c9e864f | [
"MIT"
] | null | null | null | #include "main-state.h"
#include "application.h"
#include "map.h"
#include "printer.h"
#include "stairs-component.h"
#include "target-state.h"
#include "spells-processor.h"
void MainState::Init()
{
_playerRef = &Application::Instance().PlayerInstance;
}
void MainState::HandleInput()
{
//
// Otherwise we could ... | 26.308031 | 146 | 0.59116 | xterminal86 |
acc80e24d55eaff214a28394fc1b5439f3009647 | 2,417 | hpp | C++ | src/game/level/tiled.hpp | lowkey42/MagnumOpus | 87897b16192323b40064119402c74e014a48caf3 | [
"MIT"
] | 5 | 2020-03-13T23:16:33.000Z | 2022-03-20T19:16:46.000Z | src/game/level/tiled.hpp | lowkey42/MagnumOpus | 87897b16192323b40064119402c74e014a48caf3 | [
"MIT"
] | 24 | 2015-04-20T20:26:23.000Z | 2015-11-20T22:39:38.000Z | src/game/level/tiled.hpp | lowkey42/medienprojekt | 87897b16192323b40064119402c74e014a48caf3 | [
"MIT"
] | 1 | 2022-03-08T03:11:21.000Z | 2022-03-08T03:11:21.000Z | /**************************************************************************\
* load & save JSON files from Tiled editor *
* ___ *
* /\/\ __ _ __ _ _ __ _ _ _ __ ___ /___\_ __ _ _ ___ *
* / \ / _... | 26.855556 | 76 | 0.456765 | lowkey42 |
acc80f97c25dec5002e4fe818cfc940e628f317e | 10,729 | cpp | C++ | src/storage-client.cpp | corehacker/ch-storage-client | d5621b0d5e6f16b9c517d4d048a209dde8169b61 | [
"MIT"
] | null | null | null | src/storage-client.cpp | corehacker/ch-storage-client | d5621b0d5e6f16b9c517d4d048a209dde8169b61 | [
"MIT"
] | null | null | null | src/storage-client.cpp | corehacker/ch-storage-client | d5621b0d5e6f16b9c517d4d048a209dde8169b61 | [
"MIT"
] | null | null | null | /*******************************************************************************
*
* BSD 2-Clause License
*
* Copyright (c) 2017, Sandeep Prakash
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following condition... | 28.919137 | 90 | 0.651412 | corehacker |
acc8a54f4767d35c69483b333b5d6c042883d19e | 5,003 | cpp | C++ | test/CompilationTests/LambdaTests/MakePromise/RValue.cpp | rocky01/promise | 638415a117207a4cae9181e04114e1d7575a9689 | [
"MIT"
] | 2 | 2018-10-15T18:27:50.000Z | 2019-04-16T18:34:59.000Z | test/CompilationTests/LambdaTests/MakePromise/RValue.cpp | rocky01/promise | 638415a117207a4cae9181e04114e1d7575a9689 | [
"MIT"
] | null | null | null | test/CompilationTests/LambdaTests/MakePromise/RValue.cpp | rocky01/promise | 638415a117207a4cae9181e04114e1d7575a9689 | [
"MIT"
] | null | null | null | #include "gtest/gtest.h"
#include "gmock/gmock.h"
#include "Promise.hpp"
using namespace prm;
/***
*
* 1. make_promise function.
*
* We have types:
* ExeT
* ExeVoid
*
* ResolveT
* ResolveVoid
* ResolveUndefined
*
* RejectT
* RejectVoid
* RejectUndefined
*
* There are the following combinations availia... | 23.82381 | 81 | 0.678193 | rocky01 |
accadd5dba17414263f9529f7f8f55df3cdbe57a | 1,445 | cc | C++ | src/envoy/http/grpc_metadata_scrubber/filter.cc | CorrelatedLabs/esp-v2 | 9fa93040d70f98087b3586a88a0764b9f5ec544c | [
"Apache-2.0"
] | 163 | 2019-12-18T18:40:50.000Z | 2022-03-17T03:34:22.000Z | src/envoy/http/grpc_metadata_scrubber/filter.cc | CorrelatedLabs/esp-v2 | 9fa93040d70f98087b3586a88a0764b9f5ec544c | [
"Apache-2.0"
] | 669 | 2019-12-19T00:36:12.000Z | 2022-03-30T20:27:52.000Z | src/envoy/http/grpc_metadata_scrubber/filter.cc | CorrelatedLabs/esp-v2 | 9fa93040d70f98087b3586a88a0764b9f5ec544c | [
"Apache-2.0"
] | 177 | 2019-12-19T00:35:51.000Z | 2022-03-24T10:22:23.000Z | // Copyright 2020 Google LLC
//
// 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 w... | 31.413043 | 75 | 0.737716 | CorrelatedLabs |
acd61f4db9e2ad2931692a24e7686ac496b734a9 | 969 | hpp | C++ | include/mcnla/isvd/integrator.hpp | emfomy/mcnla | 9f9717f4d6449bbd467c186651856d6212035667 | [
"MIT"
] | null | null | null | include/mcnla/isvd/integrator.hpp | emfomy/mcnla | 9f9717f4d6449bbd467c186651856d6212035667 | [
"MIT"
] | null | null | null | include/mcnla/isvd/integrator.hpp | emfomy/mcnla | 9f9717f4d6449bbd467c186651856d6212035667 | [
"MIT"
] | null | null | null | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/// @file include/mcnla/isvd/integrator.hpp
/// @brief The iSVD integrator header.
///
/// @author Mu Yang <<emfomy@gmail.com>>
///
#ifndef MCNLA_ISVD_INTEGRATOR_HPP_
#define MCNLA_ISV... | 35.888889 | 128 | 0.705882 | emfomy |
acdb388131cb6a63f8247b8982f33554a75e71df | 449 | hpp | C++ | library/ATF/CCheckSumGuildConverter.hpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | library/ATF/CCheckSumGuildConverter.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | library/ATF/CCheckSumGuildConverter.hpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <CCheckSumBaseConverter.hpp>
#include <CCheckSumGuildData.hpp>
START_ATF_NAMESPACE
struct CCheckSumGuildConverter : CCheckSumBaseConverter
{
publi... | 28.0625 | 108 | 0.768374 | lemkova |
acdf191c7bcfb35a6ab7f1fd2e1f2abea29d6b4d | 2,147 | cpp | C++ | src/operators/opLess.cpp | athanor/athanor | 0e7a654c360be05dc6f6e50427b2ee3df92c1aaf | [
"BSD-3-Clause"
] | 4 | 2018-08-31T09:44:52.000Z | 2021-03-01T19:10:00.000Z | src/operators/opLess.cpp | athanor/athanor | 0e7a654c360be05dc6f6e50427b2ee3df92c1aaf | [
"BSD-3-Clause"
] | 21 | 2019-12-29T08:33:34.000Z | 2020-11-22T16:38:37.000Z | src/operators/opLess.cpp | athanor/athanor | 0e7a654c360be05dc6f6e50427b2ee3df92c1aaf | [
"BSD-3-Clause"
] | null | null | null | #include "operators/opLess.h"
#include "operators/simpleOperator.hpp"
using namespace std;
void OpLess::reevaluateImpl(IntView& leftView, IntView& rightView, bool, bool) {
Int diff = (rightView.value - 1) - leftView.value;
violation = abs(min<Int>(diff, 0));
}
void OpLess::updateVarViolationsImpl(const Violati... | 32.044776 | 80 | 0.63251 | athanor |
ace3f5b4bcba607dd8c0c08bbfa5d5dbc03dd891 | 2,711 | hpp | C++ | filelib/include/ini/INI_Tokenizer.hpp | radj307/307lib | 16c5052481b2414ee68beeb7746c006461e8160f | [
"MIT"
] | 1 | 2021-12-09T20:01:21.000Z | 2021-12-09T20:01:21.000Z | filelib/include/ini/INI_Tokenizer.hpp | radj307/307lib | 16c5052481b2414ee68beeb7746c006461e8160f | [
"MIT"
] | null | null | null | filelib/include/ini/INI_Tokenizer.hpp | radj307/307lib | 16c5052481b2414ee68beeb7746c006461e8160f | [
"MIT"
] | null | null | null | #pragma once
#include <TokenReduxDefaultDefs.hpp>
namespace file::ini::tokenizer {
using namespace token::DefaultDefs;
/**
* @struct INITokenizer
* @brief Tokenizes the contents of an INI config file.
*/
struct INITokenizer : token::base::TokenizerBase<LEXEME, LexemeDict, ::token::DefaultDefs::TokenType, Tok... | 41.707692 | 175 | 0.665806 | radj307 |
ace4859641d2c085e8fd73a2fa2df95442aa6b3c | 1,496 | cpp | C++ | asps/modbus/pdu/message/message_service.cpp | activesys/asps | 36cc90a192d13df8669f9743f80a0662fe888d16 | [
"MIT"
] | null | null | null | asps/modbus/pdu/message/message_service.cpp | activesys/asps | 36cc90a192d13df8669f9743f80a0662fe888d16 | [
"MIT"
] | null | null | null | asps/modbus/pdu/message/message_service.cpp | activesys/asps | 36cc90a192d13df8669f9743f80a0662fe888d16 | [
"MIT"
] | null | null | null | // Copyright (c) 2021 The asps Authors. All rights reserved.
// Use of this source code is governed by a MIT license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
//
// Modbus PDU Message Service.
#include <asps/modbus/pdu/message/message_service.hpp>
#include <asps/modbus/p... | 31.829787 | 83 | 0.707888 | activesys |
ace55a95143f50865e1aed308f8888bebc014257 | 1,577 | hpp | C++ | include/helpFunctions.hpp | ekildishev/lab-01-parser | 03b9bf4480ceb2285f2650249f4edeb30ae469ef | [
"MIT"
] | 2 | 2019-12-07T11:53:40.000Z | 2020-09-28T17:47:20.000Z | include/helpFunctions.hpp | ekildishev/lab-01-parser | 03b9bf4480ceb2285f2650249f4edeb30ae469ef | [
"MIT"
] | null | null | null | include/helpFunctions.hpp | ekildishev/lab-01-parser | 03b9bf4480ceb2285f2650249f4edeb30ae469ef | [
"MIT"
] | null | null | null | // Copyright 2018 Your Name <your_email>
#pragma once
#include <iostream>
#include <sstream>
bool isSpace(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
int findEnd(const std::string &s, int start, char openSym, char closeSym) {
unsigned int i = 0;
unsigned int openC = 1;
unsigned ... | 23.191176 | 75 | 0.54851 | ekildishev |
ace7200352adb1e3e4c032c952d31007c6ad6491 | 4,610 | hpp | C++ | tests/widgets/ExampleColorWidget.hpp | noisecode3/DPF | 86a621bfd86922a49ce593fec2a618a1e0cc6ef3 | [
"0BSD"
] | 372 | 2015-02-09T15:05:16.000Z | 2022-03-30T15:35:17.000Z | tests/widgets/ExampleColorWidget.hpp | noisecode3/DPF | 86a621bfd86922a49ce593fec2a618a1e0cc6ef3 | [
"0BSD"
] | 324 | 2015-10-05T14:30:41.000Z | 2022-03-30T07:06:04.000Z | tests/widgets/ExampleColorWidget.hpp | noisecode3/DPF | 86a621bfd86922a49ce593fec2a618a1e0cc6ef3 | [
"0BSD"
] | 89 | 2015-02-20T11:26:50.000Z | 2022-02-11T00:07:27.000Z | /*
* DISTRHO Plugin Framework (DPF)
* Copyright (C) 2012-2021 Filipe Coelho <falktx@falktx.com>
*
* Permission to use, copy, modify, and/or distribute this software for any purpose with
* or without fee is hereby granted, provided that the above copyright notice and this
* permission notice appear in all copies.
... | 25.611111 | 90 | 0.556182 | noisecode3 |
acef454a33829800d8af20ea3d9e6a04a72644ae | 94 | cc | C++ | cc/Neat/Bit/Sequence.cc | ma16/rpio | 2e9e5f6794ebe8d60d62e0c65a14edd80f0194ec | [
"BSD-2-Clause"
] | 1 | 2020-06-07T14:50:44.000Z | 2020-06-07T14:50:44.000Z | cc/Neat/Bit/Sequence.cc | ma16/rpio | 2e9e5f6794ebe8d60d62e0c65a14edd80f0194ec | [
"BSD-2-Clause"
] | null | null | null | cc/Neat/Bit/Sequence.cc | ma16/rpio | 2e9e5f6794ebe8d60d62e0c65a14edd80f0194ec | [
"BSD-2-Clause"
] | null | null | null | // BSD 2-Clause License, see github.com/ma16/rpio
#include "Sequence.h"
// empty on purpose
| 15.666667 | 49 | 0.712766 | ma16 |
acf2ccbda43fc2317dd3b4cb2642161227aafc8f | 1,955 | hpp | C++ | src/lib/lossy_cast.hpp | dey4ss/hyrise | c304b9ced36044e303eb8a4d68a05fc7edc04819 | [
"MIT"
] | 1 | 2019-12-30T13:23:30.000Z | 2019-12-30T13:23:30.000Z | src/lib/lossy_cast.hpp | dey4ss/hyrise | c304b9ced36044e303eb8a4d68a05fc7edc04819 | [
"MIT"
] | 11 | 2019-12-02T20:47:52.000Z | 2020-02-04T23:19:31.000Z | src/lib/lossy_cast.hpp | dey4ss/hyrise | c304b9ced36044e303eb8a4d68a05fc7edc04819 | [
"MIT"
] | 1 | 2020-11-17T19:18:58.000Z | 2020-11-17T19:18:58.000Z | #pragma once
#include <optional>
#include <string>
#include <type_traits>
#include <boost/lexical_cast.hpp>
#include <boost/variant.hpp>
#include "resolve_type.hpp"
namespace opossum {
/**
* Contrary to the functions in lossless_cast.hpp, converts from an AllTypeVariant to any target, even if accuracy/data
* is ... | 34.910714 | 119 | 0.685934 | dey4ss |
acf5d0d8f5329aaae342414fd903983e792ee2c4 | 254 | cpp | C++ | LeetCode/Problems/Algorithms/#476_NumberComplement_sol5_bit_manipulation_O(1)_time_O(1)_extra_space.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | 1 | 2022-01-26T14:50:07.000Z | 2022-01-26T14:50:07.000Z | LeetCode/Problems/Algorithms/#476_NumberComplement_sol5_bit_manipulation_O(1)_time_O(1)_extra_space.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | LeetCode/Problems/Algorithms/#476_NumberComplement_sol5_bit_manipulation_O(1)_time_O(1)_extra_space.cpp | Tudor67/Competitive-Programming | ae4dc6ed8bf76451775bf4f740c16394913f3ff1 | [
"MIT"
] | null | null | null | class Solution {
public:
int findComplement(int num) {
int msb = 31 - __builtin_clz((unsigned int)num);
int fullMask = ((1U << (msb + 1)) - 1);
int numComplement = fullMask ^ num;
return numComplement;
}
}; | 28.222222 | 57 | 0.555118 | Tudor67 |
acf81a09adee92346a866c739f451b3cc7006bf2 | 5,884 | cc | C++ | tree/TrieTree.cc | raining888/leetcode | e9e8ac51d49e0c5f1450a6b76ba9777b89f7e25b | [
"MIT"
] | null | null | null | tree/TrieTree.cc | raining888/leetcode | e9e8ac51d49e0c5f1450a6b76ba9777b89f7e25b | [
"MIT"
] | null | null | null | tree/TrieTree.cc | raining888/leetcode | e9e8ac51d49e0c5f1450a6b76ba9777b89f7e25b | [
"MIT"
] | null | null | null | #include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <string.h>
using namespace std;
class TrieTree
{
public:
class Node
{
public:
int pass; // 标记该节点有多少个相同前缀的节点
int end; //标记该节点加入过多少次，或者说有多少个以该节点结尾的单词
unordered_map<int, Node*> nexts;
... | 21.873606 | 78 | 0.406526 | raining888 |
acf8e33715d26fbff11bf57300d429ec1ec3965c | 2,786 | cpp | C++ | src/components/improviser.cpp | jan-van-bergen/Synth | cc6fee6376974a3cc2e86899ab2859a5f1fb7e33 | [
"MIT"
] | 17 | 2021-03-22T14:17:16.000Z | 2022-02-22T20:58:27.000Z | src/components/improviser.cpp | jan-van-bergen/Synth | cc6fee6376974a3cc2e86899ab2859a5f1fb7e33 | [
"MIT"
] | null | null | null | src/components/improviser.cpp | jan-van-bergen/Synth | cc6fee6376974a3cc2e86899ab2859a5f1fb7e33 | [
"MIT"
] | 1 | 2021-11-17T18:00:55.000Z | 2021-11-17T18:00:55.000Z | #include "improviser.h"
#include "synth/synth.h"
void ImproviserComponent::update(Synth const & synth) {
constexpr auto transfer = util::generate_lookup_table<float, 7 * 7>([](int index) -> float {
constexpr float matrix[7 * 7] = {
1.0f, 2.0f, 2.0f, 3.0f, 5.0f, 1.0f, 1.0f,
1.0f, 1.0f, 2.0f, 1.0f, 5.0f, 3.0f,... | 27.048544 | 112 | 0.609835 | jan-van-bergen |
acff9a03c40bfd96d0dc41ce22181ba72f6ae208 | 348 | cpp | C++ | 2017-08-03/I.cpp | tangjz/Three-Investigators | 46dc9b2f0fbb4fe89b075a81feaacc33feeb1b52 | [
"MIT"
] | 3 | 2018-04-02T06:00:51.000Z | 2018-05-29T04:46:29.000Z | 2017-08-03/I.cpp | tangjz/Three-Investigators | 46dc9b2f0fbb4fe89b075a81feaacc33feeb1b52 | [
"MIT"
] | 2 | 2018-03-31T17:54:30.000Z | 2018-05-02T11:31:06.000Z | 2017-08-03/I.cpp | tangjz/Three-Investigators | 46dc9b2f0fbb4fe89b075a81feaacc33feeb1b52 | [
"MIT"
] | 2 | 2018-10-07T00:08:06.000Z | 2021-06-28T11:02:59.000Z | #include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
int T;
int N, cnt[2];
int main()
{
int t, i, x;
scanf("%d", &T);
for(t = 0;t < T;t += 1)
{
cnt[0] = cnt[1] = 0;
scanf("%d", &N);
for(i = 0;i < N;i += 1)
{
scanf("%d", &x);
cnt[x & 1] += 1;
}
printf("2 %d\n", cnt[0] >= ... | 12.888889 | 41 | 0.462644 | tangjz |
4a07244eeeb593544fc963b05a5583d3de6dbb77 | 1,758 | cpp | C++ | tests/Geometry/XSRay2Test.cpp | Sibras/ShiftLib | 83e1ab9605aca6535af836ad1e68bf3c3049d976 | [
"Apache-2.0"
] | null | null | null | tests/Geometry/XSRay2Test.cpp | Sibras/ShiftLib | 83e1ab9605aca6535af836ad1e68bf3c3049d976 | [
"Apache-2.0"
] | null | null | null | tests/Geometry/XSRay2Test.cpp | Sibras/ShiftLib | 83e1ab9605aca6535af836ad1e68bf3c3049d976 | [
"Apache-2.0"
] | null | null | null | /**
* Copyright Matthew Oliver
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to i... | 35.16 | 116 | 0.710466 | Sibras |
4a0e8d4bb60b0ec8f6211aaa2ff7184f24e140bd | 561 | cpp | C++ | src/tema cu WHILE/Aplicatii 4/ex4.cpp | andrew-miroiu/Cpp-projects | d0917a7f78aef929c25dc9b019e910951c2050ac | [
"MIT"
] | 2 | 2021-11-27T18:29:32.000Z | 2021-11-28T14:35:47.000Z | src/tema cu WHILE/Aplicatii 4/ex4.cpp | andrew-miroiu/Cpp-projects | d0917a7f78aef929c25dc9b019e910951c2050ac | [
"MIT"
] | null | null | null | src/tema cu WHILE/Aplicatii 4/ex4.cpp | andrew-miroiu/Cpp-projects | d0917a7f78aef929c25dc9b019e910951c2050ac | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
int main()
{
/* 4. Se citeşte de la tastatură un număr natural x de cel mult 9 cifre. Se cere să se calculeze
produsul cifrelor impare. Exemplu: dacă x =6543 atunci produsul cifrelor impare este 3*5=15*/
int x,p=1;
cout<<"Scrie un nr. de macimum 9 cifre= ";
... | 17 | 100 | 0.516934 | andrew-miroiu |
4a115e8ec19668860f858a4965ca76d1679f0649 | 615 | hpp | C++ | model/player.hpp | travnick/SlipperTanks | 33334cf0994402e7ba0e8de54f75a86835e0bae0 | [
"Apache-2.0"
] | 1 | 2015-01-11T11:03:18.000Z | 2015-01-11T11:03:18.000Z | model/player.hpp | travnick/SlipperTanks | 33334cf0994402e7ba0e8de54f75a86835e0bae0 | [
"Apache-2.0"
] | null | null | null | model/player.hpp | travnick/SlipperTanks | 33334cf0994402e7ba0e8de54f75a86835e0bae0 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include <string>
class QVector3D;
struct InputEvents;
class Node;
class Player
{
public:
Player();
~Player();
const std::string &getRequiredModelName() const;
void setAttachedNode(Node *attachedModel);
const Node &getAttachedNode() const;
Node &getAttachedNode();
void mo... | 18.636364 | 82 | 0.715447 | travnick |
4a1179ee7ae693a959bcea83b3a3d08e4fb0fc89 | 251 | cpp | C++ | lzham_assert.cpp | pg9182/tf2lzham | c11a1f50ebc85f9290ede436a1f8e2f34b646be0 | [
"MIT"
] | null | null | null | lzham_assert.cpp | pg9182/tf2lzham | c11a1f50ebc85f9290ede436a1f8e2f34b646be0 | [
"MIT"
] | null | null | null | lzham_assert.cpp | pg9182/tf2lzham | c11a1f50ebc85f9290ede436a1f8e2f34b646be0 | [
"MIT"
] | null | null | null | // File: lzham_assert.cpp
// See Copyright Notice and license at the end of lzham.h
#include "lzham_core.h"
void lzham_assert(const char* pExp, const char* pFile, unsigned line)
{
printf("%s(%u): Assertion failed: \"%s\"\n", pFile, line, pExp);
}
| 27.888889 | 69 | 0.693227 | pg9182 |
4a11b18559df526fb7ed452752e4b5ef3820c186 | 8,879 | cpp | C++ | src/client/input/InputPicker.cpp | arthurmco/familyline | 849eee40cff266af9a3f848395ed139b7ce66197 | [
"MIT"
] | 6 | 2018-05-11T23:16:02.000Z | 2019-06-13T01:35:07.000Z | src/client/input/InputPicker.cpp | arthurmco/familyline | 849eee40cff266af9a3f848395ed139b7ce66197 | [
"MIT"
] | 33 | 2018-05-11T14:12:22.000Z | 2022-03-12T00:55:25.000Z | src/client/input/InputPicker.cpp | arthurmco/familyline | 849eee40cff266af9a3f848395ed139b7ce66197 | [
"MIT"
] | 1 | 2018-12-06T23:39:55.000Z | 2018-12-06T23:39:55.000Z | #include <algorithm>
#include <client/input/InputPicker.hpp>
#include <common/logic/logic_service.hpp>
#include <glm/gtc/matrix_transform.hpp>
using namespace familyline::input;
using namespace familyline::graphics;
using namespace familyline::logic;
InputPicker::InputPicker(
Terrain* terrain, Window* win, SceneM... | 31.485816 | 99 | 0.580696 | arthurmco |
4a17238b90fd000f50b87eb59d7902c34bb96e19 | 965 | cpp | C++ | source/data_model/python/src/identity/object_id.cpp | OliverSchmitz/lue | da097e8c1de30724bfe7667cc04344b6535b40cd | [
"MIT"
] | 2 | 2021-02-26T22:45:56.000Z | 2021-05-02T10:28:48.000Z | source/data_model/python/src/identity/object_id.cpp | OliverSchmitz/lue | da097e8c1de30724bfe7667cc04344b6535b40cd | [
"MIT"
] | 262 | 2016-08-11T10:12:02.000Z | 2020-10-13T18:09:16.000Z | source/data_model/python/src/identity/object_id.cpp | computationalgeography/lue | 71993169bae67a9863d7bd7646d207405dc6f767 | [
"MIT"
] | 1 | 2020-03-11T09:49:41.000Z | 2020-03-11T09:49:41.000Z | #include "../python_extension.hpp"
#include "lue/info/identity/object_id.hpp"
#include <pybind11/pybind11.h>
namespace py = pybind11;
using namespace pybind11::literals;
namespace lue {
namespace data_model {
void init_object_id(
py::module& module)
{
py::class_<ObjectID, same_shape::Value>(
modul... | 24.125 | 74 | 0.700518 | OliverSchmitz |
4a1b0ba12f4518aaea6263a719ea6417392d33ea | 1,902 | cpp | C++ | code/qttoolkit/importer/code/clip.cpp | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 67 | 2015-03-30T19:56:16.000Z | 2022-03-11T13:52:17.000Z | code/qttoolkit/importer/code/clip.cpp | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 5 | 2015-04-15T17:17:33.000Z | 2016-02-11T00:40:17.000Z | code/qttoolkit/importer/code/clip.cpp | gscept/nebula-trifid | e7c0a0acb05eedad9ed37a72c1bdf2d658511b42 | [
"BSD-2-Clause"
] | 34 | 2015-03-30T15:08:00.000Z | 2021-09-23T05:55:10.000Z | #include "clip.h"
namespace Importer
{
//------------------------------------------------------------------------------
/**
*/
Clip::Clip()
{
// empty
}
//------------------------------------------------------------------------------
/**
*/
Clip::~Clip()
{
// empty
}
//---------------------------------------------... | 17.135135 | 80 | 0.302839 | gscept |
4a1e2ead9d37ec79e2588268a92d9b2197f121fc | 9,289 | cpp | C++ | Source/Plugin/MySql/Src/DatabaseStatementMySql.cpp | DragonJoker/DatabaseConnector | 502b136588b46119c2a0f4ed6b6623c0cc6715c2 | [
"MIT"
] | 2 | 2018-03-01T01:14:38.000Z | 2019-10-27T13:29:18.000Z | Source/Plugin/MySql/Src/DatabaseStatementMySql.cpp | DragonJoker/DatabaseConnector | 502b136588b46119c2a0f4ed6b6623c0cc6715c2 | [
"MIT"
] | null | null | null | Source/Plugin/MySql/Src/DatabaseStatementMySql.cpp | DragonJoker/DatabaseConnector | 502b136588b46119c2a0f4ed6b6623c0cc6715c2 | [
"MIT"
] | null | null | null | /************************************************************************//**
* @file DatabaseStatementMySql.cpp
* @author Sylvain Doremus
* @version 1.0
* @date 3/20/2014 2:47:39 PM
*
*
* @brief CDatabaseStatementMySql class definition.
*
* @details Describes a statement for MYSQL database.
*
*************************... | 28.937695 | 203 | 0.704597 | DragonJoker |
4a233bd65d10e1ffce66653b3d1f088b61feafc9 | 1,864 | cpp | C++ | Room.cpp | guyou/T-watch-2020 | e68fb1c3171157bb943c1ebf8351f1d66411980a | [
"BSD-3-Clause"
] | 74 | 2020-09-29T17:27:03.000Z | 2022-03-31T08:04:13.000Z | Room.cpp | guyou/T-watch-2020 | e68fb1c3171157bb943c1ebf8351f1d66411980a | [
"BSD-3-Clause"
] | 36 | 2020-09-30T19:33:16.000Z | 2021-04-18T03:31:32.000Z | Room.cpp | guyou/T-watch-2020 | e68fb1c3171157bb943c1ebf8351f1d66411980a | [
"BSD-3-Clause"
] | 23 | 2020-10-09T07:41:09.000Z | 2021-12-06T10:13:35.000Z | /*
# Maze Generator
### Date: 28 March 2018
### Author: Pisica Alin
*/
#include "config.h"
#include "DudleyWatch.h"
#include "Room.h"
using namespace std;
Room::Room(int i, int j, int rw) {
this->x = i;
this->y = j;
this->roomWidth = rw;
walls[0] = true;
walls[1] = true;
walls[2] = true;
walls[3] = tru... | 18.828283 | 65 | 0.574571 | guyou |
4a2542f273d1a78e7a1b2055cf15342bb19ca5ec | 6,574 | cpp | C++ | Unix/tests/micxx/test_array.cpp | Beguiled/omi | 1c824681ee86f32314f430db972e5d3938f10fd4 | [
"MIT"
] | 165 | 2016-08-18T22:06:39.000Z | 2019-05-05T11:09:37.000Z | Unix/tests/micxx/test_array.cpp | snchennapragada/omi | 4fa565207d3445d1f44bfc7b890f9ea5ea7b41d0 | [
"MIT"
] | 409 | 2016-08-18T20:52:56.000Z | 2019-05-06T10:03:11.000Z | Unix/tests/micxx/test_array.cpp | snchennapragada/omi | 4fa565207d3445d1f44bfc7b890f9ea5ea7b41d0 | [
"MIT"
] | 72 | 2016-08-23T02:30:08.000Z | 2019-04-30T22:57:03.000Z | /*
**==============================================================================
**
** Copyright (c) Microsoft Corporation. All rights reserved. See file LICENSE
** for license information.
**
**==============================================================================
*/
#include <ut/ut.h>
#include <micxx/arra... | 19.278592 | 80 | 0.635686 | Beguiled |
4a266040bbee1fab1478724187f55db0d23f53f4 | 4,382 | cpp | C++ | cpp/cpp_typecheck_enum_type.cpp | holao09/esbmc | 659c006a45e9aaf8539b12484e2ec2b093cc6f02 | [
"BSD-3-Clause"
] | null | null | null | cpp/cpp_typecheck_enum_type.cpp | holao09/esbmc | 659c006a45e9aaf8539b12484e2ec2b093cc6f02 | [
"BSD-3-Clause"
] | null | null | null | cpp/cpp_typecheck_enum_type.cpp | holao09/esbmc | 659c006a45e9aaf8539b12484e2ec2b093cc6f02 | [
"BSD-3-Clause"
] | null | null | null | /*******************************************************************\
Module: C++ Language Type Checking
Author: Daniel Kroening, kroening@kroening.com
\*******************************************************************/
#include <i2string.h>
#include <arith_tools.h>
#include <ansi-c/c_qualifiers.h>
#include "cp... | 23.945355 | 74 | 0.620949 | holao09 |
4a27d81860c96ee4d46eaac5afc22be73258a520 | 3,692 | cpp | C++ | src/gameobject/script.cpp | LePtitDev/gamengin | f0b2c966a96df5b56eb50fd0fb79eb14a68b859a | [
"BSD-3-Clause"
] | null | null | null | src/gameobject/script.cpp | LePtitDev/gamengin | f0b2c966a96df5b56eb50fd0fb79eb14a68b859a | [
"BSD-3-Clause"
] | null | null | null | src/gameobject/script.cpp | LePtitDev/gamengin | f0b2c966a96df5b56eb50fd0fb79eb14a68b859a | [
"BSD-3-Clause"
] | null | null | null | #include "script.h"
#include "gameobject.h"
#include "../assets/assets.h"
ScriptComponent::ScriptComponent(GameObject *parent) :
Component(parent),
started(false)
{
script.loadLibScript();
}
const char * ScriptComponent::getScriptName() const {
return scriptName.c_str();
}
bool ScriptComponent::assig... | 32.964286 | 90 | 0.637866 | LePtitDev |
4a289bd2736decc8b8c7543b4098a3ffbf5db92e | 1,389 | hpp | C++ | header/FemaleCharacter.hpp | digladieux/TP5_SMA | 450153930410982c79dc79c5694885268fd4a04d | [
"Apache-2.0"
] | null | null | null | header/FemaleCharacter.hpp | digladieux/TP5_SMA | 450153930410982c79dc79c5694885268fd4a04d | [
"Apache-2.0"
] | null | null | null | header/FemaleCharacter.hpp | digladieux/TP5_SMA | 450153930410982c79dc79c5694885268fd4a04d | [
"Apache-2.0"
] | null | null | null | /**
* \file FemaleCharacter.hpp
* \author Gladieux Cunha Dimitri & Gonzales Florian
* \brief Fichier d'en-tete du fichier source FemaleCharacter.cpp
* \date 2018-12-03
*/
#ifndef FEMALE_CHARACTER_HPP
#define FEMALE_CHARACTER_HPP
#include "Character.hpp"
#include "Date.hpp"
/**
* \class FemaleChar... | 33.071429 | 151 | 0.726422 | digladieux |
4a2bb6a43126d867175c93d1ee451c82a38743a7 | 17,490 | cpp | C++ | src/pola/scene/mesh/MD2MeshLoader.cpp | lij0511/pandora | 5988618f29d2f1ba418ef54a02e227903c1e7108 | [
"Apache-2.0"
] | null | null | null | src/pola/scene/mesh/MD2MeshLoader.cpp | lij0511/pandora | 5988618f29d2f1ba418ef54a02e227903c1e7108 | [
"Apache-2.0"
] | null | null | null | src/pola/scene/mesh/MD2MeshLoader.cpp | lij0511/pandora | 5988618f29d2f1ba418ef54a02e227903c1e7108 | [
"Apache-2.0"
] | null | null | null | /*
* MD2MeshLoader.cpp
*
* Created on: 2016年5月21日
* Author: lijing
*/
#include <stdint.h>
//#define USE_MD2_MESH
#include "pola/log/Log.h"
#include "pola/scene/mesh/MD2MeshLoader.h"
#include "pola/scene/mesh/Mesh.h"
#ifdef USE_MD2_MESH
#include "pola/scene/mesh/MD2AnimatedMesh.h"
#endif
#include <string.... | 34.702381 | 150 | 0.671755 | lij0511 |
4a2f142e7fedc3ecb35677a84f21e77c4584a8bf | 6,418 | cpp | C++ | main.cpp | SebMenozzi/NN | d9a5bd1a13cc4112711ad0483a6b9b94de80de46 | [
"MIT"
] | null | null | null | main.cpp | SebMenozzi/NN | d9a5bd1a13cc4112711ad0483a6b9b94de80de46 | [
"MIT"
] | null | null | null | main.cpp | SebMenozzi/NN | d9a5bd1a13cc4112711ad0483a6b9b94de80de46 | [
"MIT"
] | null | null | null | #include <iostream>
#include <math.h>
#include "matrix.h"
#include "NN.h"
// nombre de neurones en hidden layer
#define nb_neurons_hidden_layer 3
// nombre d'itération
#define epoch 2000
// capacité d'apprentissage
#define learning_rate 0.7
// GLOBAL
// donnée entrante d'input pour XOR
const int training_data[4][2] =... | 33.778947 | 184 | 0.636179 | SebMenozzi |
4a303890d6bfe4bcb7ea0879e59e2fff4af81c00 | 673 | cpp | C++ | Array6/Array6/Source.cpp | DipeshKazi/C-Repository | b58f26a1bdb2a159b3a1d025fea2f0d4b2d70823 | [
"MIT"
] | null | null | null | Array6/Array6/Source.cpp | DipeshKazi/C-Repository | b58f26a1bdb2a159b3a1d025fea2f0d4b2d70823 | [
"MIT"
] | null | null | null | Array6/Array6/Source.cpp | DipeshKazi/C-Repository | b58f26a1bdb2a159b3a1d025fea2f0d4b2d70823 | [
"MIT"
] | null | null | null | #include <iostream>
int addition[] = { 23, 6, 47, 35, 2, 14 };
int n, result = 0;
int high = 0;
int odd = 0;
int even = 0;
int main() {
//Avarage
int average = 0.0;
for (n = 0; n < 6; ++n)
{
result = addition[n] + result;
average = result / 6;
}
std::cout << "Average of Number "<< average << std::end... | 12.942308 | 58 | 0.511144 | DipeshKazi |
4a333d1023d1ad880c887a985d7a962128604a34 | 2,102 | hpp | C++ | DFNs/Executors/StereoReconstruction/StereoReconstructionExecutor.hpp | H2020-InFuse/cdff | e55fd48f9a909d0c274c3dfa4fe2704bc5071542 | [
"BSD-2-Clause"
] | 7 | 2019-02-26T15:09:50.000Z | 2021-09-30T07:39:01.000Z | DFNs/Executors/StereoReconstruction/StereoReconstructionExecutor.hpp | H2020-InFuse/cdff | e55fd48f9a909d0c274c3dfa4fe2704bc5071542 | [
"BSD-2-Clause"
] | null | null | null | DFNs/Executors/StereoReconstruction/StereoReconstructionExecutor.hpp | H2020-InFuse/cdff | e55fd48f9a909d0c274c3dfa4fe2704bc5071542 | [
"BSD-2-Clause"
] | 1 | 2020-12-06T12:09:05.000Z | 2020-12-06T12:09:05.000Z | /**
* @addtogroup DFNs
* @{
*/
#ifndef STEREORECONSTRUCTION_EXECUTOR_HPP
#define STEREORECONSTRUCTION_EXECUTOR_HPP
#include "DFNCommonInterface.hpp"
#include <StereoReconstruction/StereoReconstructionInterface.hpp>
#include <Types/CPP/PointCloud.hpp>
#include <Types/CPP/Frame.hpp>
namespace CDFF
{
namespace DFN
{... | 42.04 | 172 | 0.797336 | H2020-InFuse |
4a3420319bbb2383e61ff1c277b92243071423dc | 9,890 | cpp | C++ | src/ukf.cpp | grygoryant/CarND-Unscented-Kalman-Filter-Project | c0519637544de1d31ff02712be632e622d66ef34 | [
"MIT"
] | null | null | null | src/ukf.cpp | grygoryant/CarND-Unscented-Kalman-Filter-Project | c0519637544de1d31ff02712be632e622d66ef34 | [
"MIT"
] | null | null | null | src/ukf.cpp | grygoryant/CarND-Unscented-Kalman-Filter-Project | c0519637544de1d31ff02712be632e622d66ef34 | [
"MIT"
] | null | null | null | #include "ukf.h"
#include "Eigen/Dense"
#include <iostream>
/**
* Initializes Unscented Kalman filter
* This is scaffolding, do not modify
*/
UKF::UKF() {
// if this is false, laser measurements will be ignored (except during init)
use_laser_ = true;
// if this is false, radar measurements will be ignored (e... | 28.257143 | 100 | 0.649646 | grygoryant |
6653f1069ceef9716aa05f73235434f7710e31da | 19,579 | hpp | C++ | libraries/chain/include/evt/chain/contracts/evt_contract_utils.hpp | everitoken/evt | 3fbc2d0fd43421d81e1c88fa91d41ea97477e9ea | [
"Apache-2.0"
] | 1,411 | 2018-04-23T03:57:30.000Z | 2022-02-13T10:34:22.000Z | libraries/chain/include/evt/chain/contracts/evt_contract_utils.hpp | baby636/evt | 3fbc2d0fd43421d81e1c88fa91d41ea97477e9ea | [
"Apache-2.0"
] | 27 | 2018-06-11T10:34:42.000Z | 2019-07-27T08:50:02.000Z | libraries/chain/include/evt/chain/contracts/evt_contract_utils.hpp | baby636/evt | 3fbc2d0fd43421d81e1c88fa91d41ea97477e9ea | [
"Apache-2.0"
] | 364 | 2018-06-09T12:11:53.000Z | 2020-12-15T03:26:48.000Z | /**
* @file
* @copyright defined in evt/LICENSE.txt
*/
#pragma once
namespace evt { namespace chain { namespace contracts {
/**
* Implements addmeta, paycharge, paybonus, prodvote, updsched, addscript and updscript actions
*/
namespace internal {
bool
check_involved_node(const group_def& group, const group::... | 38.847222 | 155 | 0.597579 | everitoken |
6664d56200c6f7ed14b7b4598c2b608bcad854dd | 2,566 | cpp | C++ | graph-source-code/194-C/4785501.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/194-C/4785501.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | graph-source-code/194-C/4785501.cpp | AmrARaouf/algorithm-detection | 59f3028d2298804870b32729415d71eec6116557 | [
"MIT"
] | null | null | null | //Language: MS C++
#include <stdio.h>
#include <vector>
#include <list>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int T = 0;
typedef vector < vector < int > > table;
int x[4] = { 0 , 0 , -1 , 1 };
int y[4] = { -1 , 1 , 0 , 0 };
table time ( 52 , vector < int > ( ... | 27.891304 | 116 | 0.336321 | AmrARaouf |
666eeb467cce11b8f562f7f89184a0bc279cd124 | 2,675 | hpp | C++ | include/svgpp/adapter/line.hpp | RichardCory/svgpp | 801e0142c61c88cf2898da157fb96dc04af1b8b0 | [
"BSL-1.0"
] | 428 | 2015-01-05T17:13:54.000Z | 2022-03-31T08:25:47.000Z | include/svgpp/adapter/line.hpp | andrew2015/svgpp | 1d2f15ab5e1ae89e74604da08f65723f06c28b3b | [
"BSL-1.0"
] | 61 | 2015-01-08T14:32:27.000Z | 2021-12-06T16:55:11.000Z | include/svgpp/adapter/line.hpp | andrew2015/svgpp | 1d2f15ab5e1ae89e74604da08f65723f06c28b3b | [
"BSL-1.0"
] | 90 | 2015-05-19T04:56:46.000Z | 2022-03-26T16:42:50.000Z | // Copyright Oleg Maximenko 2014.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// See http://github.com/svgpp/svgpp for library home page.
#pragma once
#include <svgpp/definitions.hpp>
#include <svgpp/det... | 36.148649 | 104 | 0.730841 | RichardCory |
667204f549368ec413d937251deae01f07e52a66 | 329 | cpp | C++ | pico_json/example.cpp | minamaged113/training | 29984f4d22967625b87281bb2247246b1b0033a7 | [
"MIT"
] | 46 | 2019-07-02T05:10:47.000Z | 2022-03-19T16:29:19.000Z | pico_json/example.cpp | minamaged113/training | 29984f4d22967625b87281bb2247246b1b0033a7 | [
"MIT"
] | 62 | 2019-09-24T17:57:07.000Z | 2022-03-28T15:35:45.000Z | pico_json/example.cpp | minamaged113/training | 29984f4d22967625b87281bb2247246b1b0033a7 | [
"MIT"
] | 33 | 2019-09-19T19:29:37.000Z | 2022-03-17T05:28:06.000Z | #include "picojson/picojson.h"
int main(void) {
const char* json = "{\"a\":1}";
picojson::value v;
std::string err;
const char* json_end = picojson::parse(v, json, json + strlen(json), &err);
if (! err.empty()) {
std::cerr << err << std::endl;
}
std::cout << "Json parsed ok!" << std::endl;
retu... | 19.352941 | 77 | 0.571429 | minamaged113 |
667c0041468b36c82a086ff95801b3f7aa5ce408 | 8,207 | cpp | C++ | src/libsnw_util/slot_allocator.cpp | Sojourn/snw | e2c5a2bfbf5ad721c01a681c4e094aa35f8c010f | [
"MIT"
] | null | null | null | src/libsnw_util/slot_allocator.cpp | Sojourn/snw | e2c5a2bfbf5ad721c01a681c4e094aa35f8c010f | [
"MIT"
] | null | null | null | src/libsnw_util/slot_allocator.cpp | Sojourn/snw | e2c5a2bfbf5ad721c01a681c4e094aa35f8c010f | [
"MIT"
] | null | null | null | #include <algorithm>
#include <cassert>
#include <iostream>
#include "align.h"
#include "slot_allocator.h"
snw::slot_allocator::slot_allocator(size_t capacity)
: capacity_(capacity)
, size_(0)
, height_(0)
{
size_t branch_count = 0;
size_t leaf_count = 0;
// compute the tree layout
{
... | 30.737828 | 107 | 0.540271 | Sojourn |
667c6c9b39a404741e3f5d8efeb2d55bdead5198 | 2,103 | cpp | C++ | 15.cpp | TwoFX/aoc2021 | 0c6f4f1642c2efdc55d7cec5ef214803859b07cd | [
"Apache-2.0"
] | 1 | 2021-12-17T11:07:15.000Z | 2021-12-17T11:07:15.000Z | 15.cpp | TwoFX/aoc2021 | 0c6f4f1642c2efdc55d7cec5ef214803859b07cd | [
"Apache-2.0"
] | null | null | null | 15.cpp | TwoFX/aoc2021 | 0c6f4f1642c2efdc55d7cec5ef214803859b07cd | [
"Apache-2.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(a) begin(a), end(a)
#define has(a, b) (a.find(b) != a.end())
#define fora(i, n) for(int i = 0; i < n; i++)
#define forb(i, n) for(int i = 1; i <= n; i++)
#define forc(a, b) for(const auto &a : b)... | 23.629213 | 114 | 0.527342 | TwoFX |
667ef198f1d97292a1674d2f8d27b80e0ae99630 | 2,100 | cpp | C++ | project/examples/baselib/src/baselib.cpp | qigao/cmake-template | cd1b7f8995bba7e672f3ca35463ecc129ea7bcbc | [
"MIT"
] | null | null | null | project/examples/baselib/src/baselib.cpp | qigao/cmake-template | cd1b7f8995bba7e672f3ca35463ecc129ea7bcbc | [
"MIT"
] | 23 | 2022-03-08T11:24:35.000Z | 2022-03-23T04:14:31.000Z | project/examples/baselib/src/baselib.cpp | qigao/project-cpp-template | cd1b7f8995bba7e672f3ca35463ecc129ea7bcbc | [
"MIT"
] | null | null | null |
#include "version.h"
#include <baselib.h>
#include <fstream>
#include <iostream>
#include <zmq.hpp>
#include <zmq_addon.hpp>
namespace baselib {
void printInfo()
{
zmq::context_t ctx;
zmq::socket_t sock1(ctx, zmq::socket_type::push);
zmq::socket_t sock2(ctx, zmq::socket_type::pull);
sock1.bind("tcp://127.0.... | 31.343284 | 77 | 0.579524 | qigao |
667f4c8c0389e26678257aa84c2aef335fecde5b | 1,643 | cpp | C++ | src/behaviors/charge.cpp | Datorsmurf/liang | 0fc2f142429894f349399189eb16737ae71c2460 | [
"MIT"
] | 1 | 2021-12-27T09:43:26.000Z | 2021-12-27T09:43:26.000Z | src/behaviors/charge.cpp | Datorsmurf/liang | 0fc2f142429894f349399189eb16737ae71c2460 | [
"MIT"
] | null | null | null | src/behaviors/charge.cpp | Datorsmurf/liang | 0fc2f142429894f349399189eb16737ae71c2460 | [
"MIT"
] | null | null | null | #include "charge.h"
#include "Controller.h"
#include "Logger.h"
#include "definitions.h"
Charge::Charge(Controller *controller_, LOGGER *logger_, BATTERY *battery_, MowerModel* mowerModel_) {
controller = controller_;
logger = logger_;
battery = battery_;
mowerModel = mowerModel_;
}
void Charge::sta... | 25.671875 | 102 | 0.606817 | Datorsmurf |
668b22422cdc87542273663c4cb0b4a7c53dc990 | 1,006 | cpp | C++ | CSE 225L Data Structures and Algorithms/Resources/Codes Previous/Spring-2019-CSE225 1/LAB MID/main(1).cpp | diptu/Teaching | 20655bb2c688ae29566b0a914df4a3e5936a2f61 | [
"MIT"
] | null | null | null | CSE 225L Data Structures and Algorithms/Resources/Codes Previous/Spring-2019-CSE225 1/LAB MID/main(1).cpp | diptu/Teaching | 20655bb2c688ae29566b0a914df4a3e5936a2f61 | [
"MIT"
] | null | null | null | CSE 225L Data Structures and Algorithms/Resources/Codes Previous/Spring-2019-CSE225 1/LAB MID/main(1).cpp | diptu/Teaching | 20655bb2c688ae29566b0a914df4a3e5936a2f61 | [
"MIT"
] | null | null | null | #include <iostream>
#include "stack.cpp"
#include "queue.cpp"
using namespace std;
QueueLL Reverse (int k) {
QueueLL<char> qq ;
for(int i = k ; i > 0 ; i-- ) {
qq.insertAtEnd(q.getValue(i))
}
for (int i = k ; q.hasNext () ; i++ ) {
qq.enqueue(q.getValue(i)) ;
}
return qq ;
}
i... | 16.766667 | 43 | 0.445328 | diptu |
668b330b93d84dd01a682426fbe99ced2598a426 | 1,210 | cpp | C++ | vanilla/34-find_first_and_last_position_of_element_in_sorted_array.cpp | Junlin-Yin/myLeetCode | 8a33605d3d0de9faa82b5092a8e9f56b342c463f | [
"MIT"
] | null | null | null | vanilla/34-find_first_and_last_position_of_element_in_sorted_array.cpp | Junlin-Yin/myLeetCode | 8a33605d3d0de9faa82b5092a8e9f56b342c463f | [
"MIT"
] | null | null | null | vanilla/34-find_first_and_last_position_of_element_in_sorted_array.cpp | Junlin-Yin/myLeetCode | 8a33605d3d0de9faa82b5092a8e9f56b342c463f | [
"MIT"
] | null | null | null | class Solution {
public:
//找到非降序数组中首个大于（等于）目标数的下标，以下两种均可
//注意r的初始赋值、迭代式和循环条件中的取等情况
int binarySearch(vector<int>& nums, int target, bool allow_eq){
int l = 0, r = nums.size() - 1, mid;
while(l <= r){
mid = (l + r) >> 1;
if((eq && nums[mid] < target) || (!eq && ... | 37.8125 | 89 | 0.428926 | Junlin-Yin |
668f0e3d40e90a9d5d1b759b8223cc378ad9c16d | 2,685 | hpp | C++ | third_party/gfootball_engine/src/framework/scheduler.hpp | Jonas1711/football | 6a20dcb832da71d4e97e094e4afa060533aa7dcc | [
"Apache-2.0"
] | 2 | 2021-03-16T06:46:38.000Z | 2021-09-14T02:01:16.000Z | third_party/gfootball_engine/src/framework/scheduler.hpp | Jonas1711/football | 6a20dcb832da71d4e97e094e4afa060533aa7dcc | [
"Apache-2.0"
] | null | null | null | third_party/gfootball_engine/src/framework/scheduler.hpp | Jonas1711/football | 6a20dcb832da71d4e97e094e4afa060533aa7dcc | [
"Apache-2.0"
] | 4 | 2020-07-30T17:02:42.000Z | 2022-01-03T19:32:53.000Z | // Copyright 2019 Google LLC & Bastiaan Konings
// 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 o... | 30.168539 | 132 | 0.707263 | Jonas1711 |
66968babd49c7d9ec889fb929f4d1d532124cfce | 1,151 | cpp | C++ | Dynamic Programming/goldmine.cpp | Ajax-07/Java-Questions-and-Solutions | 816c0b7900340ddc438cb8091fbe64f7b56232cc | [
"MIT"
] | null | null | null | Dynamic Programming/goldmine.cpp | Ajax-07/Java-Questions-and-Solutions | 816c0b7900340ddc438cb8091fbe64f7b56232cc | [
"MIT"
] | null | null | null | Dynamic Programming/goldmine.cpp | Ajax-07/Java-Questions-and-Solutions | 816c0b7900340ddc438cb8091fbe64f7b56232cc | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
int maxGold(int n, int m, vector<vector<int>> arr){
int ans = 0;
if(n==1){
for(int j=0; j<m; j++)
ans += arr[0][j];
return ans;
}
int dp[n][m];
for(int i=n-1; i>=0; i--)
dp[i][m-1] = arr[i][m-1];
ans=IN... | 20.553571 | 81 | 0.414422 | Ajax-07 |
6699f1c26ec120757725350b3486fceea61819c9 | 489 | cpp | C++ | chapter2/LinkList/practice/Search_K.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | chapter2/LinkList/practice/Search_K.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | chapter2/LinkList/practice/Search_K.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
/**
* 2.3节 21题
* 思路：定义p,q 两个指针 相差k，当p指向尾结点时，q指向倒数第k个结点
*/
typedef struct LNode
{
int data;
LNode *Link;
} LNode, *LinkList;
int Search_X(LinkList L, int k)
{
LNode *p = L->Link, *q;
int count = 0;
while ... | 13.971429 | 40 | 0.564417 | verfallen |
66a1909d52bf9cd1f3642a73ab453ebaa4e5ef9f | 3,384 | cpp | C++ | src/cube/src/syntax/cubepl/CubePL0Driver.cpp | OpenCMISS-Dependencies/cube | bb425e6f75ee5dbdf665fa94b241b48deee11505 | [
"Cube"
] | null | null | null | src/cube/src/syntax/cubepl/CubePL0Driver.cpp | OpenCMISS-Dependencies/cube | bb425e6f75ee5dbdf665fa94b241b48deee11505 | [
"Cube"
] | null | null | null | src/cube/src/syntax/cubepl/CubePL0Driver.cpp | OpenCMISS-Dependencies/cube | bb425e6f75ee5dbdf665fa94b241b48deee11505 | [
"Cube"
] | 2 | 2016-09-19T00:16:05.000Z | 2021-03-29T22:06:45.000Z | /****************************************************************************
** CUBE http://www.scalasca.org/ **
*****************************************************************************
** Copyright (c) 1998-2016 **
** Fors... | 28.677966 | 114 | 0.568262 | OpenCMISS-Dependencies |
66a4b30447dfe20b2fab17a11a44a32c5e02122c | 2,381 | cpp | C++ | src/kitchen.cpp | skvark/JuveFood | fed694f93ca2998a3cf77f0d83e246bb272ffcbf | [
"MIT"
] | 1 | 2015-02-05T20:00:04.000Z | 2015-02-05T20:00:04.000Z | src/kitchen.cpp | skvark/JuveFood | fed694f93ca2998a3cf77f0d83e246bb272ffcbf | [
"MIT"
] | null | null | null | src/kitchen.cpp | skvark/JuveFood | fed694f93ca2998a3cf77f0d83e246bb272ffcbf | [
"MIT"
] | 1 | 2019-07-03T12:13:37.000Z | 2019-07-03T12:13:37.000Z | #include "kitchen.h"
#include <QDebug>
Kitchen::Kitchen(unsigned int kitchenId,
unsigned int kitchenInfoId,
unsigned int openInfoId,
unsigned int menuTypeId,
QString name,
QString shortName):
kitchenId_(kitchenId),
... | 29.7625 | 89 | 0.636287 | skvark |
66abaeb0cd6e5f14cecc43cc598ea64f44436c40 | 2,501 | cpp | C++ | Game/Source/EntityManager.cpp | Hydeon-git/Project2_RPG | bed3f6ba412b4f533d6b8c9e401182259fcb43e5 | [
"MIT"
] | 4 | 2021-02-23T20:18:27.000Z | 2021-04-17T22:43:01.000Z | Game/Source/EntityManager.cpp | Hydeon-git/Project2_RPG | bed3f6ba412b4f533d6b8c9e401182259fcb43e5 | [
"MIT"
] | 1 | 2021-02-25T11:10:11.000Z | 2021-02-25T11:10:11.000Z | Game/Source/EntityManager.cpp | Hydeon-git/Project2_RPG | bed3f6ba412b4f533d6b8c9e401182259fcb43e5 | [
"MIT"
] | null | null | null | #include "EntityManager.h"
#include "Player.h"
#include "Enemy.h"
#include "FlyingEnemy.h"
#include "NPC1.h"
#include "NPC2.h"
#include "NPC3.h"
#include "NPC4.h"
#include "NPC5.h"
#include "Enemy1.h"
#include "Enemy2.h"
#include "Enemy3.h"
#include "ModuleParticles.h"
#include "App.h"
#include "Scene.h"
#include "De... | 18.804511 | 65 | 0.664534 | Hydeon-git |
66ad1a5b992e32cff0acc9c3e7c85a7e33d4ea7e | 3,189 | cpp | C++ | src/interrupts.cpp | kshitej/HobOs | 21cbe04a882389d402f936eaf0e1dd4c15a140be | [
"0BSD"
] | 9 | 2016-07-07T18:12:27.000Z | 2022-03-11T06:41:38.000Z | src/interrupts.cpp | solson/spideros | a9c34f3aec10283d5623e821d70c2d9fb5fce843 | [
"0BSD"
] | null | null | null | src/interrupts.cpp | solson/spideros | a9c34f3aec10283d5623e821d70c2d9fb5fce843 | [
"0BSD"
] | null | null | null | #include "assert.h"
#include "interrupts.h"
#include "display.h"
#include "idt.h"
#include "ports.h"
// TODO: Deal with the magic numbers in this file.
namespace interrupts {
template<int n>
[[gnu::naked]] void interrupt() {
asm volatile("cli");
asm volatile("push %0" : : "i"(n));
asm volatile("jmp interruptCo... | 29.803738 | 79 | 0.691753 | kshitej |
66ad2f5ba38ad343a121298d8006a45e31af7c9a | 685 | cpp | C++ | source/Gui/Animation/AnimationHandler.cpp | tillpp/GraphIDE | f88f1ca02a8f9f09fe965b69651ea45fbb1b5d1e | [
"MIT"
] | 2 | 2021-10-10T00:28:03.000Z | 2021-11-11T20:33:40.000Z | source/Gui/Animation/AnimationHandler.cpp | tillpp/GraphIDE | f88f1ca02a8f9f09fe965b69651ea45fbb1b5d1e | [
"MIT"
] | null | null | null | source/Gui/Animation/AnimationHandler.cpp | tillpp/GraphIDE | f88f1ca02a8f9f09fe965b69651ea45fbb1b5d1e | [
"MIT"
] | null | null | null | #include "AnimationHandler.h"
AnimationHandler::AnimationHandler(GuiComponent& g)
:gui(g)
{
}
AnimationHandler::~AnimationHandler()
{
}
Animation* AnimationHandler::createAnimation(std::string name){
if(animations.find(name)!=animations.end()){
return nullptr;
}
Animation* rv = new Animation(&gui,name);
anima... | 20.757576 | 63 | 0.748905 | tillpp |
66b6221709d6fcd49595b7cdf6de8571f5e71e64 | 5,543 | cpp | C++ | src/terrTriDomain.cpp | mnentwig/glTest5 | 004804482fb5bb72c8f32f50464b7feb8cfa12c3 | [
"MIT"
] | null | null | null | src/terrTriDomain.cpp | mnentwig/glTest5 | 004804482fb5bb72c8f32f50464b7feb8cfa12c3 | [
"MIT"
] | null | null | null | src/terrTriDomain.cpp | mnentwig/glTest5 | 004804482fb5bb72c8f32f50464b7feb8cfa12c3 | [
"MIT"
] | null | null | null | #include "terrTriDomain.h"
#include "terrTri.h"
#include <vector>
#include <algorithm> // std::find
#include <glm/vec2.hpp>
#define GLM_ENABLE_EXPERIMENTAL
#include <glm/gtx/intersect.hpp>
#include "geomUtils2d.hpp"
#include <iostream>
terrTriDomain::terrTriDomain(){
this->state_closed = false;
}
void terrTriDoma... | 31.674286 | 121 | 0.611041 | mnentwig |
66b97549d02ce38d4f084c32d7a3ed8d59be8601 | 6,363 | cpp | C++ | packages/monte_carlo/collision/native/test/tstAceLaw11NuclearScatteringEnergyDistribution.cpp | lkersting/SCR-2123 | 06ae3d92998664a520dc6a271809a5aeffe18f72 | [
"BSD-3-Clause"
] | null | null | null | packages/monte_carlo/collision/native/test/tstAceLaw11NuclearScatteringEnergyDistribution.cpp | lkersting/SCR-2123 | 06ae3d92998664a520dc6a271809a5aeffe18f72 | [
"BSD-3-Clause"
] | null | null | null | packages/monte_carlo/collision/native/test/tstAceLaw11NuclearScatteringEnergyDistribution.cpp | lkersting/SCR-2123 | 06ae3d92998664a520dc6a271809a5aeffe18f72 | [
"BSD-3-Clause"
] | null | null | null | //---------------------------------------------------------------------------//
//!
//! \file tstAceLaw5NuclearScatteringEnergyDistribution.cpp
//! \author Eli Moll
//! \brief Ace law 11 neutron scattering energy distribution unit tests
//!
//--------------------------------------------------------------------------... | 33.666667 | 116 | 0.534811 | lkersting |
66bb25af7ec30d134182e4e14368aa4fccf40ea0 | 4,249 | cpp | C++ | VectorTest/Vec3SSE.cpp | albinopapa/VectorTest | bf520ca561a70ef90c3820a797ce60f669693219 | [
"MIT"
] | null | null | null | VectorTest/Vec3SSE.cpp | albinopapa/VectorTest | bf520ca561a70ef90c3820a797ce60f669693219 | [
"MIT"
] | null | null | null | VectorTest/Vec3SSE.cpp | albinopapa/VectorTest | bf520ca561a70ef90c3820a797ce60f669693219 | [
"MIT"
] | null | null | null | #include "Vec3SSE.h"
using namespace SSE_Utils::Float4_Utils;
Vec3SSE::Vec3SSE()
:
v(ZeroPS)
{}
Vec3SSE::Vec3SSE(float S)
:
v(_mm_set1_ps(S)) // Set all elements to S (S, S, S, S)
{
// Zero out the last element as it won't be used (v, v, v, 0.0f)
//FLOAT4 t = _mm_shuffle_ps(v, _mm_setzero_ps(), _MM_SHUFFLE(0, ... | 18.393939 | 77 | 0.646976 | albinopapa |
66bc9546b85d0c4f77b87c79cf4bce72b7965ec1 | 234 | c++ | C++ | 10.1.character.c++ | Sambitcr-7/DSA-C- | f3c80f54fa6160a99f39a934f330cdf40711de50 | [
"Apache-2.0"
] | null | null | null | 10.1.character.c++ | Sambitcr-7/DSA-C- | f3c80f54fa6160a99f39a934f330cdf40711de50 | [
"Apache-2.0"
] | null | null | null | 10.1.character.c++ | Sambitcr-7/DSA-C- | f3c80f54fa6160a99f39a934f330cdf40711de50 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
using namespace std;
int main()
{
char arr[100] = "apple";
int i=0;
while(arr[i]!='\0')
{
cout<<arr[i]<<endl;
i++;
}
return 0;
}
| 9.75 | 29 | 0.380342 | Sambitcr-7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.