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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fadc6088beb47b057ce40cadecc519f28a796338 | 17,597 | hpp | C++ | Tools/RegistersGenerator/GD32VF103/timer1registers.hpp | snorkysnark/CortexLib | 0db035332ebdfbebf21ca36e5e04b78a5a908a49 | [
"MIT"
] | 22 | 2019-09-07T22:38:01.000Z | 2022-01-31T21:35:55.000Z | Tools/RegistersGenerator/GD32VF103/timer1registers.hpp | snorkysnark/CortexLib | 0db035332ebdfbebf21ca36e5e04b78a5a908a49 | [
"MIT"
] | null | null | null | Tools/RegistersGenerator/GD32VF103/timer1registers.hpp | snorkysnark/CortexLib | 0db035332ebdfbebf21ca36e5e04b78a5a908a49 | [
"MIT"
] | 9 | 2019-09-22T11:26:24.000Z | 2022-03-21T10:53:15.000Z | /*******************************************************************************
* Filename : timer1registers.hpp
*
* Details : General-purpose-timers. This header file is auto-generated for
* GD32VF103 device.
*
*
******************************************************************************... | 55.163009 | 131 | 0.752003 | snorkysnark |
fadf3d638870b62169bffeeb16d6e8ee42472800 | 1,361 | cpp | C++ | firmware/examples/SystemTimer/source/low_level_init.cpp | 2721Aperez/SJSU-Dev2 | 87052080d2754803dbd1dae2864bd9024d123086 | [
"Apache-2.0"
] | 1 | 2018-07-07T01:41:34.000Z | 2018-07-07T01:41:34.000Z | firmware/examples/SystemTimer/source/low_level_init.cpp | 2721Aperez/SJSU-Dev2 | 87052080d2754803dbd1dae2864bd9024d123086 | [
"Apache-2.0"
] | null | null | null | firmware/examples/SystemTimer/source/low_level_init.cpp | 2721Aperez/SJSU-Dev2 | 87052080d2754803dbd1dae2864bd9024d123086 | [
"Apache-2.0"
] | 1 | 2018-09-19T01:58:48.000Z | 2018-09-19T01:58:48.000Z | #include <cstdint>
#include "L0_LowLevel/LPC40xx.h"
#include "L0_LowLevel/startup.hpp"
#include "L1_Drivers/pin_configure.hpp"
#include "L2_Utilities/debug_print.hpp"
constexpr uint8_t kGpioFunction = 0b000;
PinConfigure led3(PinConfigure::CreatePinConfigure<1, 15>());
void DemoSystemIsr()
{
// Simply toggle the... | 30.931818 | 80 | 0.706833 | 2721Aperez |
fae26f9b2140fd11256c6f1319374c4e89184154 | 412 | cpp | C++ | Phase 1 Placement Specific/08. Arrays/8.1 Array Introduction/MaxMinElementArray.cpp | priyanshd2510/CPP-DSA | 00f5d1018ae2bd4e3d9c20a8b9d06c8ea862190f | [
"Apache-2.0"
] | 42 | 2021-01-03T17:54:59.000Z | 2022-03-26T15:57:01.000Z | Phase 1 Placement Specific/08. Arrays/8.1 Array Introduction/MaxMinElementArray.cpp | sauhard2701/CPP-DSA | 1e9202c7b6a15e13aff9edd9220f362e0d84abc6 | [
"Apache-2.0"
] | 26 | 2021-04-05T07:54:21.000Z | 2021-12-10T07:35:39.000Z | Phase 1 Placement Specific/08. Arrays/8.1 Array Introduction/MaxMinElementArray.cpp | sauhard2701/CPP-DSA | 1e9202c7b6a15e13aff9edd9220f362e0d84abc6 | [
"Apache-2.0"
] | 56 | 2020-12-24T17:06:33.000Z | 2022-02-06T18:21:33.000Z | #include <iostream>
#include <climits>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
for(int i = 0; i<n; i++)
cin>>arr[i];
int maxNo = INT_MIN;
int minNo = INT_MAX;
for(int i = 0; i<n; i++){
if(arr[i] > maxNo)
maxNo = arr[i];
if(arr[... | 13.733333 | 29 | 0.456311 | priyanshd2510 |
fae4ad2267e1d0a101e2584e2ddf6299a92d0b57 | 804 | cpp | C++ | codeforces/edu/ITMO Academy: pilot course/Binary Search/step 5/b.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | 4 | 2020-10-05T19:24:10.000Z | 2021-07-15T00:45:43.000Z | codeforces/edu/ITMO Academy: pilot course/Binary Search/step 5/b.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | null | null | null | codeforces/edu/ITMO Academy: pilot course/Binary Search/step 5/b.cpp | tysm/cpsols | 262212646203e516d1706edf962290de93762611 | [
"MIT"
] | null | null | null | #include <cpplib/stdinc.hpp>
int calc(int n, int x){
int res = 0;
for(int i=1; i<=n; ++i){
int j = x/i;
if(i*j == x)
j--;
res += min(j, n);
}
return res;
}
bool check(int n, int x){
for(int i=1; i<=n; ++i){
int j = x/i;
if(i*j == x and j <= n)
... | 18.272727 | 57 | 0.390547 | tysm |
fae4c72816b1de6694317dea7012bb62d63394b1 | 1,629 | cpp | C++ | chapter2/LinkList/CLinkList.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | chapter2/LinkList/CLinkList.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | chapter2/LinkList/CLinkList.cpp | verfallen/wang-dao | ac25e16010f675fa3cee9fe07de394d111ff61f5 | [
"MIT"
] | null | null | null | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <iostream>
using namespace std;
/**
* 带头结点的循环单链表
*/
typedef struct LNode
{
int data;
struct LNode *next;
} LNode, *CLinkList;
bool InitList(CLinkList &L);
LNode *GetElem(CLinkList &L, int i);
LNode *LocateElem(CLinkList &L, int e);
bool Empty... | 14.944954 | 45 | 0.594843 | verfallen |
fae882e11e83451304370b08283c38e68994c32b | 8,885 | cc | C++ | src/Solver.cc | ppnathan/HMSHS | ae65c7622cf4b10d710722084d73a2ad8636bc9e | [
"Apache-2.0"
] | null | null | null | src/Solver.cc | ppnathan/HMSHS | ae65c7622cf4b10d710722084d73a2ad8636bc9e | [
"Apache-2.0"
] | null | null | null | src/Solver.cc | ppnathan/HMSHS | ae65c7622cf4b10d710722084d73a2ad8636bc9e | [
"Apache-2.0"
] | null | null | null | #include "Solver.h"
#include "Utilities.h"
#include <list>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
void getBeliefsSet(const Model& currModel, int numBeliefs, BeliefSet& RandomBeliefs) {
ifstream BelSelectionFile;
BelSelectionFile.open("OutFiles_OldS... | 33.912214 | 161 | 0.527293 | ppnathan |
faec7d7ae84a3b7e75dd65e53cdb274ef8b6d90c | 1,024 | hpp | C++ | xcore/include/opencv2/xcore/linalg.hpp | JSharp4273/PHD_opencv_cpp_my_modules | 9d61b3e5a77310832ab2f261a6df38d62ace3e51 | [
"BSD-4-Clause"
] | null | null | null | xcore/include/opencv2/xcore/linalg.hpp | JSharp4273/PHD_opencv_cpp_my_modules | 9d61b3e5a77310832ab2f261a6df38d62ace3e51 | [
"BSD-4-Clause"
] | null | null | null | xcore/include/opencv2/xcore/linalg.hpp | JSharp4273/PHD_opencv_cpp_my_modules | 9d61b3e5a77310832ab2f261a6df38d62ace3e51 | [
"BSD-4-Clause"
] | null | null | null | #ifndef XCORE_LINALG_HPP
#define XCORE_LINALG_HPP
#include "opencv2/core.hpp"
namespace cv
{
namespace linalg
{
///
/// \brief lstsq : compute the solution vector, a, of the equation a * x = y, by the least square method.
/// \param _a : M x N coefficient matrix.
/// If its depth correspond to an intege... | 32 | 115 | 0.688477 | JSharp4273 |
faefa7f06fb75e634db0679822f05d41b32b53cb | 1,081 | cpp | C++ | solutions/461-E-Hamming-Distance/main.cpp | ARW2705/leet-code-solutions | fa551e5b15f5340e5be3b832db39638bcbf0dc78 | [
"MIT"
] | null | null | null | solutions/461-E-Hamming-Distance/main.cpp | ARW2705/leet-code-solutions | fa551e5b15f5340e5be3b832db39638bcbf0dc78 | [
"MIT"
] | null | null | null | solutions/461-E-Hamming-Distance/main.cpp | ARW2705/leet-code-solutions | fa551e5b15f5340e5be3b832db39638bcbf0dc78 | [
"MIT"
] | null | null | null | #include <iostream>
void printResult(int x, int y, int expected, int result) {
std::cout
<< "For x = "
<< x
<< ", y = "
<< y
<< "; Hamming Distance is "
<< result
<< ";\n"
<< (expected == result ? "PASS": "FAIL")
<< "\n";
}
int hammingDistanceWithMods(int x, int y) {
int total ... | 23.5 | 62 | 0.592044 | ARW2705 |
faf27e1f9c9ce0cca1b0348751d455593eb96603 | 1,457 | cpp | C++ | src/utility/Thread.cpp | muhopensores/dmc3-inputs-thing | 2cb97f30c39bbe8d6bbe724f61d932a1fdaa1719 | [
"MIT"
] | 5 | 2021-06-09T23:53:28.000Z | 2022-02-21T06:09:41.000Z | src/utility/Thread.cpp | muhopensores/dmc3-inputs-thing | 2cb97f30c39bbe8d6bbe724f61d932a1fdaa1719 | [
"MIT"
] | 9 | 2021-06-09T23:52:43.000Z | 2021-09-17T14:05:47.000Z | src/utility/Thread.cpp | muhopensores/dmc3-inputs-thing | 2cb97f30c39bbe8d6bbe724f61d932a1fdaa1719 | [
"MIT"
] | null | null | null | #include "Thread.hpp"
#include <TlHelp32.h>
namespace utils {
std::queue<DWORD> SuspendAllOtherThreads(void) {
std::queue <DWORD> threads;
AutoHandle hSnap (
CreateToolhelp32Snapshot (TH32CS_SNAPTHREAD, 0)
);
if (hSnap != INVALID_HANDLE_VALUE)
{
THREADENTRY32 tent = { };
... | 22.415385 | 78 | 0.540151 | muhopensores |
faf6a760300f50b1d92fd28f8de1b83a34dcba77 | 3,714 | cpp | C++ | practice/122-best-time-to-buy-and-sell-stock-ii/LeetCode_122_0144.cpp | manajay/algorithm-list | 828b0baed25a743fdb010427f873b29af9587951 | [
"MIT"
] | null | null | null | practice/122-best-time-to-buy-and-sell-stock-ii/LeetCode_122_0144.cpp | manajay/algorithm-list | 828b0baed25a743fdb010427f873b29af9587951 | [
"MIT"
] | null | null | null | practice/122-best-time-to-buy-and-sell-stock-ii/LeetCode_122_0144.cpp | manajay/algorithm-list | 828b0baed25a743fdb010427f873b29af9587951 | [
"MIT"
] | null | null | null | /**
给定一个数组，它的第 i 个元素是一支给定股票第 i 天的价格。
设计一个算法来计算你所能获取的最大利润。你可以尽可能地完成更多的交易（多次买卖一支股票）。
注意：你不能同时参与多笔交易（你必须在再次购买前出售掉之前的股票）。
示例 1:
输入: [7,1,5,3,6,4]
输出: 7
解释: 在第 2 天（股票价格 = 1）的时候买入，在第 3 天（股票价格 = 5）的时候卖出, 这笔交易所能获得利润 = 5-1 = 4 。
随后，在第 4 天（股票价格 = 3）的时候买入，在第 5 天（股票价格 = 6）的时候卖出, 这笔交易所能获得利润 = 6-3 = 3 。
示例 2:
输入: [1,2,3,4,... | 25.613793 | 118 | 0.534195 | manajay |
fafa1848c9e80a8e818e7618e4d07d9d31b18e81 | 2,353 | hpp | C++ | source/LibFgBase/src/FgAlgs.hpp | maamountki/FaceGenBaseLibrary | 0c647920e913354028ed09fff3293555e84d2b94 | [
"MIT"
] | null | null | null | source/LibFgBase/src/FgAlgs.hpp | maamountki/FaceGenBaseLibrary | 0c647920e913354028ed09fff3293555e84d2b94 | [
"MIT"
] | null | null | null | source/LibFgBase/src/FgAlgs.hpp | maamountki/FaceGenBaseLibrary | 0c647920e913354028ed09fff3293555e84d2b94 | [
"MIT"
] | null | null | null | //
// Copyright (c) 2015 Singular Inversions Inc. (facegen.com)
// Use, modification and distribution is subject to the MIT License,
// see accompanying file LICENSE.txt or facegen.com/base_library_license.txt
//
// Authors: Andrew Beatty
// Created: Feb 21, 2005
//
// General purpose little algorithms that are... | 32.680556 | 106 | 0.690608 | maamountki |
4f022206ba8953f1e7b7bf8a232676ef2ea0530c | 5,153 | cc | C++ | src/writer/msl/generator_impl_intrinsic_test.cc | dorba/tint | f81c1081ea7d27ea55f373c0bfaf651e491da7e6 | [
"Apache-2.0"
] | null | null | null | src/writer/msl/generator_impl_intrinsic_test.cc | dorba/tint | f81c1081ea7d27ea55f373c0bfaf651e491da7e6 | [
"Apache-2.0"
] | null | null | null | src/writer/msl/generator_impl_intrinsic_test.cc | dorba/tint | f81c1081ea7d27ea55f373c0bfaf651e491da7e6 | [
"Apache-2.0"
] | null | null | null | // Copyright 2020 The Tint Authors.
//
// 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 ... | 35.054422 | 80 | 0.671065 | dorba |
4f03336e31665b43a6d8b0ce2e9a97adcedb679b | 6,849 | cpp | C++ | Nanoforge/rfg/xtbl/nodes/ReferenceXtblNode.cpp | Moneyl/RF-Viewer | fd5a53c0d7ed94d9c5c9264e3ed11f2037c2f49a | [
"MIT"
] | 3 | 2020-08-26T17:53:47.000Z | 2020-09-13T07:48:40.000Z | Nanoforge/rfg/xtbl/nodes/ReferenceXtblNode.cpp | Moneyl/RF-Viewer | fd5a53c0d7ed94d9c5c9264e3ed11f2037c2f49a | [
"MIT"
] | 2 | 2020-09-01T06:08:28.000Z | 2020-11-14T02:14:41.000Z | Nanoforge/rfg/xtbl/nodes/ReferenceXtblNode.cpp | Moneyl/RF-Viewer | fd5a53c0d7ed94d9c5c9264e3ed11f2037c2f49a | [
"MIT"
] | null | null | null | #include "XtblNodes.h"
#include "rfg/xtbl/Xtbl.h"
#include "render/imgui/imgui_ext.h"
#include "render/imgui/ImGuiConfig.h"
#include "rfg/xtbl/XtblDescription.h"
#include <tinyxml2/tinyxml2.h>
#include "gui/GuiState.h"
#include <imgui.h>
#include "rfg/xtbl/XtblManager.h"
#include "gui/documents/XtblDocument.h"
#include... | 37.42623 | 148 | 0.631333 | Moneyl |
4f04767e043ce2aecb5c2f21e087eeb82f583b00 | 9,133 | cpp | C++ | src/cards/cards.cpp | Talos10/COMP-345-PROJECT-TEAM-N12 | 8506c089b6e321e36fcef1f919f1b036e39edbe2 | [
"MIT"
] | null | null | null | src/cards/cards.cpp | Talos10/COMP-345-PROJECT-TEAM-N12 | 8506c089b6e321e36fcef1f919f1b036e39edbe2 | [
"MIT"
] | null | null | null | src/cards/cards.cpp | Talos10/COMP-345-PROJECT-TEAM-N12 | 8506c089b6e321e36fcef1f919f1b036e39edbe2 | [
"MIT"
] | null | null | null | #include "cards.h"
#include <ctime>
#include <algorithm>
using namespace std;
// ### This file represents the implementation of the Cards, Hands and Deck classes ###
//---Implementation of the Card class---
// Default constructor of the Card class which initializes a card type
Card::Card() {
type = new Type(stat... | 30.042763 | 127 | 0.634074 | Talos10 |
4f05d6f7601870a9fd980c797cb989a556f7e7b4 | 22,545 | cpp | C++ | src/DataInterface_NPC.cpp | CoderRaka/Game-Server | 3b3c5a5492653be682f0bb841aab047c62981237 | [
"MIT"
] | 85 | 2015-02-05T18:28:15.000Z | 2022-02-16T18:29:21.000Z | src/DataInterface_NPC.cpp | CoderRaka/Game-Server | 3b3c5a5492653be682f0bb841aab047c62981237 | [
"MIT"
] | 8 | 2015-03-10T01:28:22.000Z | 2018-01-19T16:26:57.000Z | src/DataInterface_NPC.cpp | CoderRaka/Game-Server | 3b3c5a5492653be682f0bb841aab047c62981237 | [
"MIT"
] | 70 | 2015-01-08T16:25:11.000Z | 2021-11-11T19:10:00.000Z | #include<winsock2.h>
#include<stdio.h>
#include"DataInterface.h"
uint32 DataInterfaceSpawnpoolId;
void cb_DataInterface_NPC_getNPCList(MYSQL *dbCon, diJob_npcListData_t *job, void *cb, void *param)
{
sint8 queryText[1024];
job->outNpcCount = 0;
job->outNpcList = NULL;
wsprintf(queryText, "SELECT "
"id,creature... | 37.700669 | 137 | 0.671457 | CoderRaka |
4f0fad89c994185877ab01ab930acbd4ec9d6517 | 8,044 | cpp | C++ | logdevice/server/sequencer_boycotting/PerClientNodeStatsAggregator.cpp | ahmad-diaa/LogDevice | d9caf3ede45cbfadac96f1e1670c6ab4acfce136 | [
"BSD-3-Clause"
] | 1 | 2019-12-18T09:07:45.000Z | 2019-12-18T09:07:45.000Z | logdevice/server/sequencer_boycotting/PerClientNodeStatsAggregator.cpp | zhengxiaochuan-3/LogDevice | 01e2302a382db1d87f934e305c8cc74ffc0a24a4 | [
"BSD-3-Clause"
] | null | null | null | logdevice/server/sequencer_boycotting/PerClientNodeStatsAggregator.cpp | zhengxiaochuan-3/LogDevice | 01e2302a382db1d87f934e305c8cc74ffc0a24a4 | [
"BSD-3-Clause"
] | null | null | null | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "logdevice/server/sequencer_boycotting/PerClientNodeStatsAggregator.h"
#inclu... | 34.376068 | 80 | 0.670313 | ahmad-diaa |
4f1079f228af547d6c23c892ed43df13d58f1f6f | 2,519 | hpp | C++ | include/DynamicSystems/Impl/DynamicSystemImpl.hpp | e2e4b6b7/dynsys | 152a56c23ad4df6273cb961dd57a2247ca385390 | [
"MIT"
] | 35 | 2020-09-04T18:37:53.000Z | 2022-03-05T10:33:01.000Z | include/DynamicSystems/Impl/DynamicSystemImpl.hpp | e2e4b6b7/dynsys | 152a56c23ad4df6273cb961dd57a2247ca385390 | [
"MIT"
] | 1 | 2020-03-08T16:54:07.000Z | 2020-03-08T16:54:07.000Z | include/DynamicSystems/Impl/DynamicSystemImpl.hpp | e2e4b6b7/dynsys | 152a56c23ad4df6273cb961dd57a2247ca385390 | [
"MIT"
] | 4 | 2020-09-08T04:46:18.000Z | 2022-02-21T00:52:14.000Z | #pragma once
#include <vector>
#include <string>
#include <array>
#include <utility>
#include "Model/Model.hpp"
#include "DynamicSystems/DynamicSystem.hpp"
namespace DynamicSystems {
template<typename LambdaNewPointAction>
template<typename LambdaDerivatives>
DynamicSystem<LambdaNewPointAction>::DynamicSystem(
... | 35.985714 | 95 | 0.668916 | e2e4b6b7 |
4f1451105d9819443baeb0490861a7185991defe | 14,798 | hh | C++ | src/FGUI/controls/keybinder.hh | numero69/sapphire-csgo-linux | 51fa92b4295692af8026307a574a76cc7c3d3dfc | [
"MIT"
] | 35 | 2019-10-05T15:37:03.000Z | 2021-12-14T23:59:19.000Z | src/FGUI/controls/keybinder.hh | numero69/sapphire-csgo-linux | 51fa92b4295692af8026307a574a76cc7c3d3dfc | [
"MIT"
] | 1 | 2019-10-27T21:12:00.000Z | 2019-10-27T21:12:00.000Z | src/FGUI/controls/keybinder.hh | numero69/sapphire-csgo-linux | 51fa92b4295692af8026307a574a76cc7c3d3dfc | [
"MIT"
] | 17 | 2019-10-06T14:19:37.000Z | 2021-05-08T21:36:25.000Z | /* *
* fgui - an extensive oop gui framework *
* */
#pragma once
// includes
#include <string_view>
// framework includes
#include "element.hh"
namespace fgui {
/*
* NOTE 1: If you don't want to use winapi keycodes, you w... | 43.781065 | 79 | 0.10819 | numero69 |
4f161e41fd260f099cc52faceafdd516ddab460b | 464 | cpp | C++ | src/Renderer/Sprite.cpp | Strife-AI/Strife.Engine | 6b83e762f28acb3f4440d5b7763beccfd08dfc8f | [
"NCSA"
] | 12 | 2020-12-27T22:13:58.000Z | 2021-03-14T09:03:02.000Z | src/Renderer/Sprite.cpp | Strife-AI/Strife.Engine | 6b83e762f28acb3f4440d5b7763beccfd08dfc8f | [
"NCSA"
] | 10 | 2021-01-14T15:14:31.000Z | 2021-05-24T22:01:09.000Z | src/Renderer/Sprite.cpp | Strife-AI/Strife.Engine | 6b83e762f28acb3f4440d5b7763beccfd08dfc8f | [
"NCSA"
] | null | null | null | #include "Sprite.hpp"
#include "Texture.hpp"
Sprite::Sprite(Texture* texture, const Rectangle& bounds)
: _texture(texture),
_bounds(bounds),
_uvBounds(bounds.TopLeft() / texture->Size(), bounds.Size() / texture->Size())
{
}
Sprite::Sprite(Texture* texture, const Rectangle& bounds, const Rectangle& uvBoun... | 24.421053 | 88 | 0.678879 | Strife-AI |
4f1748dbe004911d0a01acf1012e0825ec4efd53 | 4,613 | cpp | C++ | src/adu-shell/src/swupdate_tasks.cpp | alethic/iot-hub-device-update | 751138e2ee7f527472fdf15639634fa46aa30289 | [
"MIT"
] | null | null | null | src/adu-shell/src/swupdate_tasks.cpp | alethic/iot-hub-device-update | 751138e2ee7f527472fdf15639634fa46aa30289 | [
"MIT"
] | null | null | null | src/adu-shell/src/swupdate_tasks.cpp | alethic/iot-hub-device-update | 751138e2ee7f527472fdf15639634fa46aa30289 | [
"MIT"
] | 1 | 2021-09-21T16:16:40.000Z | 2021-09-21T16:16:40.000Z | /**
* @file swupdate_tasks.cpp
* @brief Implements tasks for microsoft/swupdate actions.
*
* @copyright Copyright (c) 2019, Microsoft Corporation.
*/
#include "swupdate_tasks.hpp"
#include "aduc/logging.h"
#include "aduc/process_utils.hpp"
#include "common_tasks.hpp"
#include <unordered_map>
namespace CommonTas... | 27.458333 | 110 | 0.690007 | alethic |
4f1b499af3332bcbd9b5f78dac020ec0a8cbf1b6 | 8,944 | cpp | C++ | vamp/CQChromaVamp.cpp | ag4015/constant-q-cpp | 8bd538cf52b12884f2119d168bfe18f63656c60c | [
"BSD-4-Clause-UC"
] | null | null | null | vamp/CQChromaVamp.cpp | ag4015/constant-q-cpp | 8bd538cf52b12884f2119d168bfe18f63656c60c | [
"BSD-4-Clause-UC"
] | null | null | null | vamp/CQChromaVamp.cpp | ag4015/constant-q-cpp | 8bd538cf52b12884f2119d168bfe18f63656c60c | [
"BSD-4-Clause-UC"
] | null | null | null | /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
/*
Constant-Q library
Copyright (c) 2013-2014 Queen Mary, University of London
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Softwa... | 27.021148 | 217 | 0.679003 | ag4015 |
4f1b552e9aea48d91f8e6388ff60ebc898e047d7 | 6,806 | cpp | C++ | net/http2/http2_connection.cpp | usadson/WebEngine | 73f436535a70c6c9d7f3a5c565650b6152effd8d | [
"BSD-2-Clause"
] | 3 | 2020-03-28T01:36:44.000Z | 2020-06-19T23:55:08.000Z | net/http2/http2_connection.cpp | usadson/WebEngine | 73f436535a70c6c9d7f3a5c565650b6152effd8d | [
"BSD-2-Clause"
] | null | null | null | net/http2/http2_connection.cpp | usadson/WebEngine | 73f436535a70c6c9d7f3a5c565650b6152effd8d | [
"BSD-2-Clause"
] | null | null | null | /**
* Copyright (C) 2020 Tristan. All Rights Reserved.
* This file is licensed under the BSD 2-Clause license.
* See the COPYING file for licensing information.
*/
#include "http2_connection.hpp"
#include <iomanip>
#include <iostream>
#include <sstream>
#include <vector>
#include <cstring>
#include "constants.h... | 31.509259 | 111 | 0.637232 | usadson |
4f1c8d614c46bf10f1a83e18c6f3a8a83650e875 | 9,038 | cpp | C++ | rai/node/dumper.cpp | raicoincommunity/Raicoin | 22dd5f16d299ced2b14f321682153b9e477c1609 | [
"MIT"
] | 94 | 2019-09-25T05:57:44.000Z | 2021-12-30T09:08:06.000Z | rai/node/dumper.cpp | Cryptonoz/Raicoin | 2641cf6b361446d6451f75c885b8be28e54221ba | [
"MIT"
] | 4 | 2020-05-06T10:10:14.000Z | 2021-12-26T09:35:16.000Z | rai/node/dumper.cpp | Cryptonoz/Raicoin | 2641cf6b361446d6451f75c885b8be28e54221ba | [
"MIT"
] | 13 | 2019-09-25T05:57:52.000Z | 2022-02-24T02:09:03.000Z | #include <rai/node/dumper.hpp>
#include <rai/node/node.hpp>
rai::Ptree rai::MessageDumpEntry::Get() const
{
rai::Ptree result;
result.put("direction", send_ ? "send" : "receive");
result.put("transport", transport_);
result.put("endpoint", endpoint_);
result.put("timestamp", std::to_string(timestam... | 26.121387 | 84 | 0.565612 | raicoincommunity |
b7b6b90b2722e1ee81c399bff4a2b8780d58ecca | 1,429 | cpp | C++ | src/morda/widgets/label/text.cpp | igagis/morda | dd7b58f7cb2689d56b7796cc9b6b9302aad1a529 | [
"MIT"
] | 69 | 2016-12-07T05:56:53.000Z | 2020-11-27T20:59:05.000Z | src/morda/widgets/label/text.cpp | igagis/morda | dd7b58f7cb2689d56b7796cc9b6b9302aad1a529 | [
"MIT"
] | 103 | 2015-07-10T14:42:21.000Z | 2020-09-09T16:16:21.000Z | src/morda/widgets/label/text.cpp | igagis/morda | dd7b58f7cb2689d56b7796cc9b6b9302aad1a529 | [
"MIT"
] | 18 | 2016-11-22T14:41:37.000Z | 2020-04-22T18:16:10.000Z | /*
morda - GUI framework
Copyright (C) 2012-2021 Ivan Gagis <igagis@gmail.com>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version... | 29.163265 | 87 | 0.713086 | igagis |
b7bc88fc99bf9c5e5f872fed85e553dd70768ff3 | 2,503 | cpp | C++ | AIO/atlantis the beginning/atlan.cpp | eddiegz/Personal-C | f7869826216e5c665f8f646502141f0dc680e545 | [
"MIT"
] | 3 | 2021-05-15T08:18:09.000Z | 2021-05-17T04:41:57.000Z | AIO/atlantis the beginning/atlan.cpp | eddiegz/Personal-C | f7869826216e5c665f8f646502141f0dc680e545 | [
"MIT"
] | null | null | null | AIO/atlantis the beginning/atlan.cpp | eddiegz/Personal-C | f7869826216e5c665f8f646502141f0dc680e545 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<str>;
using vc = vector<char>;
using vvi = vector<vi>;
using v... | 25.804124 | 85 | 0.585298 | eddiegz |
b7c2d367593defb5d66a8d82c1fa0a0262e0e82f | 7,629 | cc | C++ | Allocator.cc | karlredgate/libservice | 60c632bd72103596f9545c179d582c1536a5e197 | [
"Apache-2.0"
] | 3 | 2015-10-03T19:31:55.000Z | 2019-08-16T18:50:06.000Z | Allocator.cc | karlredgate/libservice | 60c632bd72103596f9545c179d582c1536a5e197 | [
"Apache-2.0"
] | null | null | null | Allocator.cc | karlredgate/libservice | 60c632bd72103596f9545c179d582c1536a5e197 | [
"Apache-2.0"
] | null | null | null |
/** \file Allocator.cc
* \brief
* \todo Limit quantity of pools of a specific size
* \todo stats
*/
#include <sys/user.h>
#include <sys/mman.h>
#include <stdint.h>
#include <stdio.h>
#include <execinfo.h>
#include <exception>
#include <new>
#include <syslog.h>
#include <pthread.h>
#include <tcl.h>
#include "A... | 23.990566 | 99 | 0.577533 | karlredgate |
b7c7fff540c5cd38d9cdbd44f25d081c7ddfbdaa | 45 | cpp | C++ | IHHook/stdafx.cpp | TinManTex/IHHook | c9b43d220c4f9f838956846fef4b4b3fc580bca3 | [
"MIT"
] | 5 | 2020-05-30T20:12:13.000Z | 2021-06-09T11:38:47.000Z | IHHook/stdafx.cpp | ZipfsLaw/IHHook | c9b43d220c4f9f838956846fef4b4b3fc580bca3 | [
"MIT"
] | 1 | 2021-11-29T20:36:04.000Z | 2021-11-29T20:36:56.000Z | IHHook/stdafx.cpp | ZipfsLaw/IHHook | c9b43d220c4f9f838956846fef4b4b3fc580bca3 | [
"MIT"
] | 8 | 2020-05-30T20:13:09.000Z | 2021-12-14T15:01:51.000Z | #include "stdafx.h" //tex to get pch to build | 45 | 45 | 0.711111 | TinManTex |
b7c8f01b4648c8d1c088e94aa862a46e6f29907c | 7,483 | tpp | C++ | src/hypro/parser/antlr4-flowstar/HyproLocationVisitor.tpp | hypro/hypro | 52ae4ffe0a8427977fce8d7979fffb82a1bc28f6 | [
"MIT"
] | 22 | 2016-10-05T12:19:01.000Z | 2022-01-23T09:14:41.000Z | src/hypro/parser/antlr4-flowstar/HyproLocationVisitor.tpp | hypro/hypro | 52ae4ffe0a8427977fce8d7979fffb82a1bc28f6 | [
"MIT"
] | 23 | 2017-05-08T15:02:39.000Z | 2021-11-03T16:43:39.000Z | src/hypro/parser/antlr4-flowstar/HyproLocationVisitor.tpp | hypro/hypro | 52ae4ffe0a8427977fce8d7979fffb82a1bc28f6 | [
"MIT"
] | 12 | 2017-06-07T23:51:09.000Z | 2022-01-04T13:06:21.000Z | #include "HyproLocationVisitor.h"
namespace hypro {
///////////////// Constructor & Destructor
template<typename Number>
HyproLocationVisitor<Number>::HyproLocationVisitor(std::vector<std::string>& varVec) :
vars(varVec)
{ }
template<typename Number>
HyproLocationVisitor<Number>::~HyproLocationVisitor() { }... | 38.178571 | 284 | 0.673527 | hypro |
b7d125ffbaf900f8f9ab19b983a838c061bd0adc | 25,281 | cpp | C++ | src/Mesh/ConformerMeshSegment.cpp | fvicini/gedim | c38cad9c40e7edabb6ea9da94599152d5a6542b0 | [
"MIT"
] | null | null | null | src/Mesh/ConformerMeshSegment.cpp | fvicini/gedim | c38cad9c40e7edabb6ea9da94599152d5a6542b0 | [
"MIT"
] | null | null | null | src/Mesh/ConformerMeshSegment.cpp | fvicini/gedim | c38cad9c40e7edabb6ea9da94599152d5a6542b0 | [
"MIT"
] | null | null | null | #include "ConformerMeshSegment.hpp"
using namespace std;
using namespace Eigen;
namespace Gedim
{
// ***************************************************************************
ConformerMeshSegment::ConformerMeshSegment(const GeometryUtilities& geometryUtilities) :
_geometryUtilities(geometryUtilities)
{
... | 42.849153 | 166 | 0.58985 | fvicini |
b7d66b97193af25fd54fc388731b7654d199f32e | 660 | cpp | C++ | memory_snapshot_impl_unittest.cpp | jyaif/snapshotable_allocator | 711dff8d6414265476bf8eb83eece563c0c183a8 | [
"MIT"
] | null | null | null | memory_snapshot_impl_unittest.cpp | jyaif/snapshotable_allocator | 711dff8d6414265476bf8eb83eece563c0c183a8 | [
"MIT"
] | null | null | null | memory_snapshot_impl_unittest.cpp | jyaif/snapshotable_allocator | 711dff8d6414265476bf8eb83eece563c0c183a8 | [
"MIT"
] | null | null | null | #include "application/memory/memory_snapshot_impl.h"
#include <array>
#include <cassert>
#include <cstring>
#include "third_party/nex_test/src/test.h"
NEX_TEST(Memory, Snapshot) {
std::array<uint8_t, 10000> array;
memset(array.data(), 'x', 10000);
MemorySnapshotImpl msi;
msi.AppendData(array.data() + 1, 199... | 22.758621 | 52 | 0.648485 | jyaif |
b7d66e088e4aaab2088f4fd4000a34be00506ac4 | 1,200 | cpp | C++ | Rectangle.cpp | arvindrajayadav/Good-Robot | c9a0a5f50793acbe7af312fccac48ee035498d1e | [
"MIT"
] | 53 | 2020-08-04T08:38:14.000Z | 2021-12-08T18:06:40.000Z | Rectangle.cpp | arvindrajayadav/Good-Robot | c9a0a5f50793acbe7af312fccac48ee035498d1e | [
"MIT"
] | 2 | 2020-08-15T13:03:26.000Z | 2020-08-15T19:54:22.000Z | Rectangle.cpp | arvindrajayadav/Good-Robot | c9a0a5f50793acbe7af312fccac48ee035498d1e | [
"MIT"
] | 5 | 2020-08-04T09:33:40.000Z | 2021-09-13T04:22:49.000Z | #include "master.h"
#include "Rectangle.h"
using namespace pyrodactyl;
bool pyroRect::Load(rapidxml::xml_node<char> *node, const bool &echo, const std::string &x_name, const std::string &y_name,
const std::string &w_name, const std::string &h_name)
{
return LoadNum(x, x_name, node, echo)
&& LoadNum(y, y_name, nod... | 36.363636 | 123 | 0.710833 | arvindrajayadav |
b7d71ceb36f4f0ce7a10a65f16a68a73ca66f45b | 2,984 | hpp | C++ | tile2ee/ConverterDxt.hpp | Argent77/tile2ee | 513375452121fc36408debda5ec1ef7b79464c3c | [
"MIT"
] | 2 | 2021-05-02T06:46:23.000Z | 2021-08-24T23:24:38.000Z | tile2ee/ConverterDxt.hpp | InfinityTools/tile2ee | 513375452121fc36408debda5ec1ef7b79464c3c | [
"MIT"
] | null | null | null | tile2ee/ConverterDxt.hpp | InfinityTools/tile2ee | 513375452121fc36408debda5ec1ef7b79464c3c | [
"MIT"
] | null | null | null | /*
Copyright (c) 2015 Argent77
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, distribute, sublic... | 38.25641 | 100 | 0.758043 | Argent77 |
b7da36dda6246238c64f3bfff241c5111642a1b6 | 421 | cc | C++ | nofx/nofx_ofMath/nofx_ofWrapDegrees.cc | sepehr-laal/nofx | 7abc9da3d4fc0f5b72c6b3d591a08cf44d00277e | [
"MIT"
] | null | null | null | nofx/nofx_ofMath/nofx_ofWrapDegrees.cc | sepehr-laal/nofx | 7abc9da3d4fc0f5b72c6b3d591a08cf44d00277e | [
"MIT"
] | null | null | null | nofx/nofx_ofMath/nofx_ofWrapDegrees.cc | sepehr-laal/nofx | 7abc9da3d4fc0f5b72c6b3d591a08cf44d00277e | [
"MIT"
] | null | null | null | #include "nofx_ofWrapDegrees.h"
#include "ofMath.h"
namespace nofx
{
namespace Math
{
NAN_METHOD(nofx_ofWrapDegrees)
{
NanReturnValue(ofWrapDegrees(
args[0]->NumberValue(),
args[1]->IsUndefined() ? -180.0f : args[1]->NumberValue(),
args[2]->IsUndefined() ? +180.0f : args... | 23.388889 | 64 | 0.605701 | sepehr-laal |
b7deb83b58708336cab9d236e20b4e5142db4153 | 16,310 | cpp | C++ | Editor/PlayerControlCreator/PlayerControlEventListWidget/PlayerControlEventListWidget.cpp | gregory-vovchok/YEngine | e28552e52588bd90db01dd53e5fc817d0a26d146 | [
"BSD-2-Clause"
] | null | null | null | Editor/PlayerControlCreator/PlayerControlEventListWidget/PlayerControlEventListWidget.cpp | gregory-vovchok/YEngine | e28552e52588bd90db01dd53e5fc817d0a26d146 | [
"BSD-2-Clause"
] | null | null | null | Editor/PlayerControlCreator/PlayerControlEventListWidget/PlayerControlEventListWidget.cpp | gregory-vovchok/YEngine | e28552e52588bd90db01dd53e5fc817d0a26d146 | [
"BSD-2-Clause"
] | 1 | 2020-12-04T08:57:03.000Z | 2020-12-04T08:57:03.000Z | #include "PlayerControlEventListWidget.h"
#include <Editor/Editor/Editor.h>
#include <Engine/Core/Animation/AbstractAnimation/AbstractAnimation.h>
PlayerControlEventListWidget::PlayerControlEventListWidget(QWidget* _parent): QTreeWidget(_parent)
{
setAcceptDrops(true);
setDragEnabled(true);
setDragDropMode(QAbs... | 25.092308 | 126 | 0.698958 | gregory-vovchok |
b7e65d20cbb5dbba9624f4910d376fa7380aad41 | 3,115 | cpp | C++ | Source/Plugins/bsfVulkanRenderAPI/BsVulkanFramebuffer.cpp | pgruenbacher/bsf | 9bbac75ca4cc445cd26b435f74465ad91d3e528e | [
"MIT"
] | 2 | 2019-07-08T17:26:25.000Z | 2019-10-13T19:15:28.000Z | Source/Plugins/bsfVulkanRenderAPI/BsVulkanFramebuffer.cpp | REGoth-project/bsf | e176800d1cb9e71b7be8a28bdae935ed9ddd1de4 | [
"MIT"
] | null | null | null | Source/Plugins/bsfVulkanRenderAPI/BsVulkanFramebuffer.cpp | REGoth-project/bsf | e176800d1cb9e71b7be8a28bdae935ed9ddd1de4 | [
"MIT"
] | 4 | 2019-06-23T09:55:47.000Z | 2019-07-08T17:23:05.000Z | //************************************ bs::framework - Copyright 2018 Marko Pintera **************************************//
//*********** Licensed under the MIT license. See LICENSE.md for full terms. This notice is not to be removed. ***********//
#include "BsVulkanFramebuffer.h"
#include "BsVulkanTexture.h"
#include... | 38.45679 | 124 | 0.740289 | pgruenbacher |
b7e7c27d8f33ea7f07d79ce9966b43f5ba5a078a | 4,985 | cpp | C++ | power-split-5-server-ui/MainPage.xaml.cpp | KR-Studio/power-split | cb9f3d279d9de8dbf48cf7c38727e3b3b06c6126 | [
"BSD-3-Clause"
] | null | null | null | power-split-5-server-ui/MainPage.xaml.cpp | KR-Studio/power-split | cb9f3d279d9de8dbf48cf7c38727e3b3b06c6126 | [
"BSD-3-Clause"
] | null | null | null | power-split-5-server-ui/MainPage.xaml.cpp | KR-Studio/power-split | cb9f3d279d9de8dbf48cf7c38727e3b3b06c6126 | [
"BSD-3-Clause"
] | null | null | null | //
// MainPage.xaml.cpp
// Implementation of the MainPage class.
//
#include "pch.h"
#include "MainPage.xaml.h"
#include <string>
#include <power-split-net/Including.h>
using namespace PowerSplitServer;
using namespace Platform;
using namespace Windows::Foundation;
using namespace Windows::Foundation::Collections;... | 28.649425 | 131 | 0.691274 | KR-Studio |
b7e7d5f263caaf3ff6aac629c524fb4939fe2ca8 | 19,508 | cpp | C++ | signal-composer-binding/signal.cpp | redpesk-common/signal-composer-binding | 92eed99ad927ce6e46bcdee336830d71ee8df41f | [
"Apache-2.0"
] | null | null | null | signal-composer-binding/signal.cpp | redpesk-common/signal-composer-binding | 92eed99ad927ce6e46bcdee336830d71ee8df41f | [
"Apache-2.0"
] | null | null | null | signal-composer-binding/signal.cpp | redpesk-common/signal-composer-binding | 92eed99ad927ce6e46bcdee336830d71ee8df41f | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2015, 2016 "IoT.bzh"
* Author "Romain Forlot" <romain.forlot@iot.bzh>
*
* 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... | 28.520468 | 256 | 0.707761 | redpesk-common |
b7e9e0f957fce2a47976332547b2130560a5e953 | 1,716 | cpp | C++ | lib/sdl/src/SceneGame/event/SceneGameEvent.cpp | Brukols/Epitech-Arcade | 5443d28169e9494f0c77abac23f4139e60b46365 | [
"MIT"
] | null | null | null | lib/sdl/src/SceneGame/event/SceneGameEvent.cpp | Brukols/Epitech-Arcade | 5443d28169e9494f0c77abac23f4139e60b46365 | [
"MIT"
] | null | null | null | lib/sdl/src/SceneGame/event/SceneGameEvent.cpp | Brukols/Epitech-Arcade | 5443d28169e9494f0c77abac23f4139e60b46365 | [
"MIT"
] | null | null | null | /*
** EPITECH PROJECT, 2020
** OOP_arcade_2019
** File description:
** SceneGameEvent
*/
#include "sdl/SceneGame.hpp"
#include "sdl/Utility.hpp"
void arc::SceneGame::eventMenu()
{
_eventMenu();
}
void arc::SceneGame::eventButtons(const arc::Event::Type &type, const arc::Event::Key &key)
{
(void)key;
if (... | 31.2 | 136 | 0.618881 | Brukols |
b7ea70b5795664ad005b23cae12aae2a93c13a05 | 1,315 | cpp | C++ | getrf.cpp | keithalewis/xlllapack | abb8b83ad9dd2af346b51a4b3fa224f5153c0c7f | [
"MIT"
] | 1 | 2020-04-16T12:08:02.000Z | 2020-04-16T12:08:02.000Z | getrf.cpp | keithalewis/xlllapack | abb8b83ad9dd2af346b51a4b3fa224f5153c0c7f | [
"MIT"
] | null | null | null | getrf.cpp | keithalewis/xlllapack | abb8b83ad9dd2af346b51a4b3fa224f5153c0c7f | [
"MIT"
] | null | null | null | // getrf.cpp - compute the LU factorization
// Copyright (c) 2013 KALX, LLC. All rights reserved.
#include "xlllapack.h"
using namespace xll;
static AddInX xai_getrf(
FunctionX(XLL_FP, _T("?xll_getrf"), _T("GETRF"))
.Arg(XLL_FP, _T("Matrix"), _T("is a matrix. "))
.Category(CATEGORY)
.FunctionHelp(_T("Compute the ... | 29.222222 | 74 | 0.658555 | keithalewis |
b7eea7f6e9eef93b32578d08e1956f49a6d07eba | 90,036 | cpp | C++ | src/Microsoft.DotNet.Wpf/src/WpfGfx/core/common/display.cpp | jonfortescue/wpf | 6d35e1a0539cc5cc7a6111a11b781f52cfc71fc2 | [
"MIT"
] | 5,937 | 2018-12-04T16:32:50.000Z | 2022-03-31T09:48:37.000Z | src/Microsoft.DotNet.Wpf/src/WpfGfx/core/common/display.cpp | jonfortescue/wpf | 6d35e1a0539cc5cc7a6111a11b781f52cfc71fc2 | [
"MIT"
] | 4,151 | 2018-12-04T16:38:19.000Z | 2022-03-31T18:41:14.000Z | src/Microsoft.DotNet.Wpf/src/WpfGfx/core/common/display.cpp | jonfortescue/wpf | 6d35e1a0539cc5cc7a6111a11b781f52cfc71fc2 | [
"MIT"
] | 1,084 | 2018-12-04T16:24:21.000Z | 2022-03-30T13:52:03.000Z | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//+-----------------------------------------------------------------------
//
//
// Description:
// See comm... | 29.902358 | 174 | 0.565396 | jonfortescue |
b7f0518c3a5a4b43333a4cc5d0f4ad1c8670c50a | 4,184 | cpp | C++ | freeflow/sys/fd_utils.cpp | flowgrammable/freeflow-legacy | c5cd77495d44fe3a9e48a2e06fbb44f7418d388e | [
"Apache-2.0"
] | 1 | 2017-07-30T04:18:29.000Z | 2017-07-30T04:18:29.000Z | freeflow/sys/fd_utils.cpp | flowgrammable/freeflow-legacy | c5cd77495d44fe3a9e48a2e06fbb44f7418d388e | [
"Apache-2.0"
] | null | null | null | freeflow/sys/fd_utils.cpp | flowgrammable/freeflow-legacy | c5cd77495d44fe3a9e48a2e06fbb44f7418d388e | [
"Apache-2.0"
] | null | null | null | // Copyright (c) 2013-2014 Flowgrammable.org
//
// 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... | 39.847619 | 77 | 0.670172 | flowgrammable |
b7f6de053b19c06e155c9ee0908ac2b5b11b06ff | 1,612 | cpp | C++ | matrices/MatricesCpp/main-EMMANUEL-PC.cpp | justanindieguy/algorithms-in-c | ad4e88062dbf78ce4966be3497d44aea23bbb2dd | [
"MIT"
] | null | null | null | matrices/MatricesCpp/main-EMMANUEL-PC.cpp | justanindieguy/algorithms-in-c | ad4e88062dbf78ce4966be3497d44aea23bbb2dd | [
"MIT"
] | null | null | null | matrices/MatricesCpp/main-EMMANUEL-PC.cpp | justanindieguy/algorithms-in-c | ad4e88062dbf78ce4966be3497d44aea23bbb2dd | [
"MIT"
] | null | null | null | #include <iostream>
class Matrix {
private:
int **array;
int n;
public:
Matrix() {
n = 2;
array = new int*[2];
for (int i = 0; i < n; i++) {
array[i] = new int[n];
}
}
Matrix(int n) {
this->n = n;
array = new int*[n];
for (int ... | 17.714286 | 54 | 0.397022 | justanindieguy |
4d02b650f38c77466f4246b7f31c285e96c87724 | 6,442 | cpp | C++ | UEPrototype/Source/UEPrototype/Private/Core/PlayerTaskManager.cpp | Jaeguins/Prototype | faa6b2626c3cfc187a9f4e44fef641de527fe0ca | [
"MIT"
] | null | null | null | UEPrototype/Source/UEPrototype/Private/Core/PlayerTaskManager.cpp | Jaeguins/Prototype | faa6b2626c3cfc187a9f4e44fef641de527fe0ca | [
"MIT"
] | null | null | null | UEPrototype/Source/UEPrototype/Private/Core/PlayerTaskManager.cpp | Jaeguins/Prototype | faa6b2626c3cfc187a9f4e44fef641de527fe0ca | [
"MIT"
] | null | null | null | // Fill out your copyright notice in the Description page of Project Settings.
#include "PlayerTaskManager.h"
#include "UEPrototype.h"
#include "VPFrameworkLibrary.h"
#include "UObjectIterator.h"
#include "EditorWorldManager.h"
#include "EditorModulesManager.h"
UPlayerTaskManager::UPlayerTaskManager()
{
// DEBUG
... | 20.780645 | 112 | 0.699627 | Jaeguins |
4d0556638a6ca66ecd8b48637c2aa15427a1696b | 1,777 | hpp | C++ | include/vpp/util/allocation.hpp | nyorain/vpp | ccffafa0b59baa633df779274d7743f169d61c06 | [
"BSL-1.0"
] | 308 | 2016-02-23T11:59:20.000Z | 2022-03-14T18:40:24.000Z | include/vpp/util/allocation.hpp | nyorain/vpp | ccffafa0b59baa633df779274d7743f169d61c06 | [
"BSL-1.0"
] | 11 | 2017-01-21T17:33:13.000Z | 2020-08-17T10:33:42.000Z | include/vpp/util/allocation.hpp | nyorain/vpp | ccffafa0b59baa633df779274d7743f169d61c06 | [
"BSL-1.0"
] | 11 | 2016-02-23T10:35:08.000Z | 2021-12-18T16:15:39.000Z | // Copyright (c) 2016-2020 Jan Kelling
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt
#pragma once
#include <cstddef> // std::size_t
#include <cmath> // std::ceil
#include <algorithm> // std::clamp
#include <type_traits> /... | 30.118644 | 80 | 0.707372 | nyorain |
4d08738115e827faa78da32f3528584cf95c3acd | 1,591 | cpp | C++ | benchmarks/Dict/dict_cpp.cpp | Cwc-Lib/Cello | 139e04c3b2cc2c6a68f96637e0c53286ca5792c0 | [
"BSD-2-Clause-FreeBSD"
] | 4,067 | 2015-05-16T22:57:52.000Z | 2022-03-30T05:40:04.000Z | benchmarks/Dict/dict_cpp.cpp | Cwc-Lib/Cello | 139e04c3b2cc2c6a68f96637e0c53286ca5792c0 | [
"BSD-2-Clause-FreeBSD"
] | 59 | 2015-06-17T09:51:27.000Z | 2021-09-24T20:15:21.000Z | benchmarks/Dict/dict_cpp.cpp | Cwc-Lib/Cello | 139e04c3b2cc2c6a68f96637e0c53286ca5792c0 | [
"BSD-2-Clause-FreeBSD"
] | 308 | 2015-05-16T11:33:08.000Z | 2022-03-18T00:26:28.000Z | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <unordered_map>
using namespace std;
struct eqstr {
inline bool operator()(const char *s1, const char *s2) const {
return strcmp(s1, s2) == 0;
}
};
namespace std {
template<>
struct hash<const char *> : public std::unary_... | 24.106061 | 79 | 0.602766 | Cwc-Lib |
4d0bbe020712537309c1bee743a522f29f205604 | 13,818 | cpp | C++ | Source/Beezer/FSUtils/FSUtils.cpp | Teknomancer/beezer | 37dc9029aff5bd42bd38d01c7059ccbea4bb95a7 | [
"BSD-3-Clause"
] | 3 | 2020-08-20T18:57:52.000Z | 2021-12-13T03:11:19.000Z | Source/Beezer/FSUtils/FSUtils.cpp | Teknomancer/beezer | 37dc9029aff5bd42bd38d01c7059ccbea4bb95a7 | [
"BSD-3-Clause"
] | 22 | 2020-02-24T21:40:44.000Z | 2021-04-18T15:07:15.000Z | Source/Beezer/FSUtils/FSUtils.cpp | Teknomancer/beezer | 37dc9029aff5bd42bd38d01c7059ccbea4bb95a7 | [
"BSD-3-Clause"
] | null | null | null | // SPDX-License-Identifier: BSD-3-Clause
// Copyright (c) 2002 Ramshankar (aka Teknomancer).
// All rights reserved.
#include "FSUtils.h"
#include "Shared.h"
#include <Autolock.h>
#include <Directory.h>
#include <Entry.h> // gcc2
#include <File.h>
#include <FindDirectory.h>
#include <Messenger.h>
#include <Path.h>
#i... | 31.121622 | 112 | 0.586047 | Teknomancer |
4d0c4c5768ac59638597f391726595a56aea2d06 | 1,340 | cpp | C++ | codes/Dijkstra.cpp | smmehrab/problem-solving | 4aeab1673f18d3270ee5fc9b64ed6805eacf4af5 | [
"MIT"
] | null | null | null | codes/Dijkstra.cpp | smmehrab/problem-solving | 4aeab1673f18d3270ee5fc9b64ed6805eacf4af5 | [
"MIT"
] | null | null | null | codes/Dijkstra.cpp | smmehrab/problem-solving | 4aeab1673f18d3270ee5fc9b64ed6805eacf4af5 | [
"MIT"
] | null | null | null | /*
************************************************
username : smmehrab
fullname : s.m.mehrabul islam
email : mehrab.24csedu.001@gmail.com
institute : university of dhaka, bangladesh
session : 2017-2018
************************************************
*/
#include<bits/stdc++.h>
using namespa... | 23.928571 | 84 | 0.565672 | smmehrab |
4d0f712eeed247bbbb3508a8095207305844d91e | 12,421 | cpp | C++ | Demobox/Database.cpp | xtrium-lnx/demobox | cd500cffeac430c19522910a89280b7bed480452 | [
"WTFPL"
] | 1 | 2015-02-02T13:09:54.000Z | 2015-02-02T13:09:54.000Z | Demobox/Database.cpp | xtrium-lnx/demobox | cd500cffeac430c19522910a89280b7bed480452 | [
"WTFPL"
] | null | null | null | Demobox/Database.cpp | xtrium-lnx/demobox | cd500cffeac430c19522910a89280b7bed480452 | [
"WTFPL"
] | null | null | null | #include "Database.h"
#include "MediaItemDemo.h"
#include "MediaItemMovie.h"
#include "MediaItemSong.h"
#include "GlTexture.h"
#include <cstdint>
#include <fstream>
#include <iostream>
#include <regex>
#include <Windows.h>
using namespace Demobox;
Database* Database::instance_ = nullptr;
Database::Database()
: ini... | 25.557613 | 123 | 0.691571 | xtrium-lnx |
4d11c2adfccbb1719d753a477f7d0b7eca8a17f3 | 209 | cpp | C++ | BasisOfCProgramLanguage/ElephantDrinkWater.cpp | chtld/Programming-and-Algorithm-Course | 669f266fc97db9050013ffbb388517667de33433 | [
"MIT"
] | 2 | 2019-06-10T11:50:06.000Z | 2019-10-14T08:00:41.000Z | BasisOfCProgramLanguage/ElephantDrinkWater.cpp | chtld/Programming-and-Algorithm-Course | 669f266fc97db9050013ffbb388517667de33433 | [
"MIT"
] | null | null | null | BasisOfCProgramLanguage/ElephantDrinkWater.cpp | chtld/Programming-and-Algorithm-Course | 669f266fc97db9050013ffbb388517667de33433 | [
"MIT"
] | null | null | null | #include <iostream>
int main(){
int water = 20000, h = 0, r = 0;
double pi = 3.14159;
std::cin >> h >> r;
int nWater = (int) water/(pi*r*r*h) + 0.99;
std::cout << nWater << std::endl;
return 0;
}
| 19 | 45 | 0.54067 | chtld |
4d1842650358bae0a315bfe9527ca3bf80bb8944 | 559 | cpp | C++ | Codeforces/CF1034/B.cpp | jinzhengyu1212/Clovers | 0efbb0d87b5c035e548103409c67914a1f776752 | [
"MIT"
] | null | null | null | Codeforces/CF1034/B.cpp | jinzhengyu1212/Clovers | 0efbb0d87b5c035e548103409c67914a1f776752 | [
"MIT"
] | null | null | null | Codeforces/CF1034/B.cpp | jinzhengyu1212/Clovers | 0efbb0d87b5c035e548103409c67914a1f776752 | [
"MIT"
] | null | null | null | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m;
int main(){
scanf("%lld%lld",&n,&m);
if(n>m) swap(n,m);
if(n==1){
ll ans=m-m%6;
if(m%6>=4) ans+=(m%6-3)*2;
printf("%lld\n",ans);
return 0;
}
if(n==2){
if(m<=2){
puts("0");
... | 19.964286 | 38 | 0.39356 | jinzhengyu1212 |
4d246483d249410e9487b3889d13cc831ca74259 | 1,178 | cpp | C++ | bat.cpp | zsmith10/wumpus_game | 6342781efaf55a86628ffaca7aa27e3f6503c729 | [
"MIT"
] | null | null | null | bat.cpp | zsmith10/wumpus_game | 6342781efaf55a86628ffaca7aa27e3f6503c729 | [
"MIT"
] | null | null | null | bat.cpp | zsmith10/wumpus_game | 6342781efaf55a86628ffaca7aa27e3f6503c729 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include "events.h"
#include "bat.h"
Bat::Bat(){
}
Bat::Bat(string type, char symbol, int x_pos,int y_pos):Events(type,symbol,x_pos,y_pos){
this->type = type;
this->symbol = symbol;
this->x_pos = x_pos;
this->y_pos = y_pos;
}
Bat::Bat(const Bat &ol... | 24.040816 | 89 | 0.601019 | zsmith10 |
4d254684a10b731044a5de57916b24fbc65183a5 | 321 | cpp | C++ | Difficulty 2/simon_says.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | Difficulty 2/simon_says.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | Difficulty 2/simon_says.cpp | BrynjarGeir/Kattis | a151972cbae3db04a8e6764d5fa468d0146c862b | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
using namespace std;
int main() {
int T;
string line;
cin >> T;
cin.ignore();
while(T--) {
getline(cin, line);
if(line.find("simon says") == 0) {
line.erase(0,11);
cout << line << endl;
} else cout << endl;
}
... | 18.882353 | 42 | 0.482866 | BrynjarGeir |
4d2674645702449cc011960baeaa0ac1cb2ef2e7 | 624 | cpp | C++ | include/ESP-Main-API-MQTT.cpp | tschaban/Firmware-Basecore-ESP32 | dc4c3e2a2bd72d8f4a301f61ea212610a17c251a | [
"MIT"
] | null | null | null | include/ESP-Main-API-MQTT.cpp | tschaban/Firmware-Basecore-ESP32 | dc4c3e2a2bd72d8f4a301f61ea212610a17c251a | [
"MIT"
] | null | null | null | include/ESP-Main-API-MQTT.cpp | tschaban/Firmware-Basecore-ESP32 | dc4c3e2a2bd72d8f4a301f61ea212610a17c251a | [
"MIT"
] | null | null | null | #ifdef ESP_CONFIG_API_MQTT
#include <ESP-MQTT.h>
ESPMQTT MQTTAPIs[ESP_CONFIG_API_MQTT_MAX_NUMBER];
void initializeMQTTAPIs(void);
void eventsListnerMQTTAPIs(void);
/***** Body ******/
void initializeMQTTAPIs(void) {
for (uint8_t i = 0; i < Device.configuration.noOfMQTTAPIs; i++) {
#ifdef ESP_CONFIG_HARDWARE_LED
... | 22.285714 | 67 | 0.703526 | tschaban |
4d27d0677e8deaf35a4496531b93499698f23dca | 1,018 | hpp | C++ | res/Shader.hpp | patricioHidalgo/OpenGL_Student_Project | 9bae5c9ce05a6d58b4505ee71bd4608db3fd8f29 | [
"MIT"
] | null | null | null | res/Shader.hpp | patricioHidalgo/OpenGL_Student_Project | 9bae5c9ce05a6d58b4505ee71bd4608db3fd8f29 | [
"MIT"
] | null | null | null | res/Shader.hpp | patricioHidalgo/OpenGL_Student_Project | 9bae5c9ce05a6d58b4505ee71bd4608db3fd8f29 | [
"MIT"
] | null | null | null | #pragma once
#include <string>
#include <unordered_map>
#include <glm/glm.hpp>
#include <glm/gtc/type_ptr.hpp>
struct ShaderProgramSource
{
std::string VertexSource;
std::string FragmentSource;
};
class Shader
{
private:
std::string filePath;
unsigned int rendererID;
std::unordered_map<std::string, int> unifor... | 26.789474 | 95 | 0.753438 | patricioHidalgo |
4d2a8c870a0af2641028be20216cbda7adf7b689 | 884 | cpp | C++ | LeetCode Problems/C++/2024. Maximise_the_confusion_of_an_Exam.cpp | snehnakrani14/HactoberFest21 | 1d387ff4efec1f17fe20d42f46490564c5a87b52 | [
"Unlicense"
] | 1 | 2021-10-04T14:39:02.000Z | 2021-10-04T14:39:02.000Z | LeetCode Problems/C++/2024. Maximise_the_confusion_of_an_Exam.cpp | snehnakrani14/HactoberFest21 | 1d387ff4efec1f17fe20d42f46490564c5a87b52 | [
"Unlicense"
] | 1 | 2021-10-06T04:41:55.000Z | 2021-10-06T04:41:55.000Z | LeetCode Problems/C++/2024. Maximise_the_confusion_of_an_Exam.cpp | snehnakrani14/HactoberFest21 | 1d387ff4efec1f17fe20d42f46490564c5a87b52 | [
"Unlicense"
] | 1 | 2021-10-08T12:31:04.000Z | 2021-10-08T12:31:04.000Z |
// Question Link - https://leetcode.com/contest/biweekly-contest-62/problems/maximize-the-confusion-of-an-exam/
class Solution {
public:
int getMaxConsecutive(string s,int k,int ch1,int ch2)
{
int cnt=0;
int j=0;
int maxi=0;
for(int i=0;i<s.size();i++)
{
if(s... | 24.555556 | 111 | 0.437783 | snehnakrani14 |
4d2f765b671f5c8e04d72d478c508f86ff8feb22 | 333 | cpp | C++ | A_Way_Too_Long_Words.cpp | ar1936/CPP | 4c76c2bf5308d8d3b6e295482e3ce4284fbeaf13 | [
"MIT"
] | 1 | 2021-04-20T13:49:56.000Z | 2021-04-20T13:49:56.000Z | A_Way_Too_Long_Words.cpp | ar1936/cpp | 4c76c2bf5308d8d3b6e295482e3ce4284fbeaf13 | [
"MIT"
] | null | null | null | A_Way_Too_Long_Words.cpp | ar1936/cpp | 4c76c2bf5308d8d3b6e295482e3ce4284fbeaf13 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
string s;
cin>>s;
if(s.size()>10)
cout<<s[0]<<s.size()-2<<s[s.size()-1];
else
cout<<s;
cout<<endl;
}
r... | 15.857143 | 51 | 0.393393 | ar1936 |
4d31037fad6f9c0389875d2e52958080e0f11654 | 1,039 | hxx | C++ | src/graphics/square.hxx | AltSysrq/Abendstern | 106e1ad2457f7bfd90080eecf49a33f6079f8e1e | [
"BSD-3-Clause"
] | null | null | null | src/graphics/square.hxx | AltSysrq/Abendstern | 106e1ad2457f7bfd90080eecf49a33f6079f8e1e | [
"BSD-3-Clause"
] | null | null | null | src/graphics/square.hxx | AltSysrq/Abendstern | 106e1ad2457f7bfd90080eecf49a33f6079f8e1e | [
"BSD-3-Clause"
] | 1 | 2022-01-29T11:54:41.000Z | 2022-01-29T11:54:41.000Z | /**
* @file
* @author Jason Lingle
* @brief Contains a simple interface for drawing squares.
*/
/*
* square.hxx
*
* Created on: 25.01.2011
* Author: jason
*/
#ifndef SQUARE_HXX_
#define SQUARE_HXX_
#include <GL/gl.h>
/**
* Contains functions for drawing squares.
* Many graphics draw a simple square... | 23.088889 | 68 | 0.689124 | AltSysrq |
2eba7e8749d3ebfba71cd01382a72a1167c851af | 1,220 | hpp | C++ | core/include/bind/hotkey/tab_ctrl.hpp | pit-ray/win-vind | 7386f6f7528d015ce7f1a5ae230d6e63f9492df9 | [
"MIT"
] | 731 | 2020-05-07T06:22:59.000Z | 2022-03-31T16:36:03.000Z | core/include/bind/hotkey/tab_ctrl.hpp | pit-ray/win-vind | 7386f6f7528d015ce7f1a5ae230d6e63f9492df9 | [
"MIT"
] | 67 | 2020-07-20T19:46:42.000Z | 2022-03-31T15:34:47.000Z | core/include/bind/hotkey/tab_ctrl.hpp | pit-ray/win-vind | 7386f6f7528d015ce7f1a5ae230d6e63f9492df9 | [
"MIT"
] | 15 | 2021-01-29T04:49:11.000Z | 2022-03-04T22:16:31.000Z | #ifndef _TAB_CTRL_HPP
#define _TAB_CTRL_HPP
#include "bind/binded_func_creator.hpp"
namespace vind
{
struct Switch2LeftTab : public BindedFuncCreator<Switch2LeftTab> {
explicit Switch2LeftTab() ;
static void sprocess(unsigned int repeat_num=1) ;
static void sprocess(NTypeLogger& parent_lgr... | 32.105263 | 72 | 0.690984 | pit-ray |
2ebb0c8f6173ae6bf0488ab53dd7b535f92a174f | 2,963 | cpp | C++ | src/ttauri/GUI/pipeline_box_device_shared.cpp | PinkFlufflyLlama/ttauri | 7badcfbe792932ebb912d54d1062d8fc820c40a7 | [
"BSL-1.0"
] | null | null | null | src/ttauri/GUI/pipeline_box_device_shared.cpp | PinkFlufflyLlama/ttauri | 7badcfbe792932ebb912d54d1062d8fc820c40a7 | [
"BSL-1.0"
] | null | null | null | src/ttauri/GUI/pipeline_box_device_shared.cpp | PinkFlufflyLlama/ttauri | 7badcfbe792932ebb912d54d1062d8fc820c40a7 | [
"BSL-1.0"
] | null | null | null | // Copyright Take Vos 2020.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt)
#include "pipeline_box.hpp"
#include "pipeline_box_device_shared.hpp"
#include "gui_device_vulkan.hpp"
#include "../pixel_map.hpp"
#inclu... | 32.206522 | 112 | 0.735066 | PinkFlufflyLlama |
2ebbb3477e85033661f05fdc4c90d661ed736be2 | 270,068 | cpp | C++ | AudioSampleWoodfeel.cpp | HaydenJB/Euclidean-Polyrhythm-Drum-Machine | 56dc0c0e69bdbf287deec757546f42ed04b73b1e | [
"MIT"
] | null | null | null | AudioSampleWoodfeel.cpp | HaydenJB/Euclidean-Polyrhythm-Drum-Machine | 56dc0c0e69bdbf287deec757546f42ed04b73b1e | [
"MIT"
] | null | null | null | AudioSampleWoodfeel.cpp | HaydenJB/Euclidean-Polyrhythm-Drum-Machine | 56dc0c0e69bdbf287deec757546f42ed04b73b1e | [
"MIT"
] | null | null | null | // Audio data converted from WAV file by wav2sketch
#include "AudioSampleWoodfeel.h"
// Converted from WoodFeel.wav, using 44100 Hz, 16 bit PCM encoding
const unsigned int AudioSampleWoodfeel[24257] = {
0x8100BD7E,0x00000000,0x00000000,0xFFF70000,0xFFF1FFFD,0xFFC1FFC8,0xFFD8FFDA,0x0052FFFC,
0x00A600CD,0xFC50FF33,0xD7... | 88.808944 | 88 | 0.898774 | HaydenJB |
2ebf79453021817d2b54528c702ec0535a13a501 | 1,499 | cpp | C++ | sources/Leetcodes/src/3_longest_substring_without_repeating_characters.cpp | mcoder2014/myNotes | 443cf16b1873bb473b7cb6bc1a6ec9c6423333e7 | [
"MIT"
] | 4 | 2020-06-22T13:20:26.000Z | 2020-06-24T08:43:11.000Z | sources/Leetcodes/src/3_longest_substring_without_repeating_characters.cpp | mcoder2014/DataStructureAndAlgorithms | 443cf16b1873bb473b7cb6bc1a6ec9c6423333e7 | [
"MIT"
] | null | null | null | sources/Leetcodes/src/3_longest_substring_without_repeating_characters.cpp | mcoder2014/DataStructureAndAlgorithms | 443cf16b1873bb473b7cb6bc1a6ec9c6423333e7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
class Solution {
public:
int lengthOfLongestSubstring(string s) {
unordered_map<char, int> indices;
int left = 0;
int max_length = 0;
int length = s.length();
for (int i = 0; i < length; i+... | 23.421875 | 75 | 0.48499 | mcoder2014 |
2ec0a44deacde944bad622065d0b2164453faf81 | 287 | cpp | C++ | test/llvm_test_code/xtaint/xtaint18.cpp | janniclas/phasar | 324302ae96795e6f0a065c14d4f7756b1addc2a4 | [
"MIT"
] | 1 | 2022-02-15T07:56:29.000Z | 2022-02-15T07:56:29.000Z | test/llvm_test_code/xtaint/xtaint18.cpp | fabianbs96/phasar | 5b8acd046d8676f72ce0eb85ca20fdb0724de444 | [
"MIT"
] | null | null | null | test/llvm_test_code/xtaint/xtaint18.cpp | fabianbs96/phasar | 5b8acd046d8676f72ce0eb85ca20fdb0724de444 | [
"MIT"
] | null | null | null | void sink([[clang::annotate("psr.sink")]] int) {}
extern int rand();
int foo(int x) {
if (rand())
return 0;
return foo(x);
}
int main([[clang::annotate("psr.source")]] int argc, char *argv[]) {
int x = foo(argc);
// here, the sanitizer cannot be skipped...
sink(x);
}
| 15.944444 | 68 | 0.585366 | janniclas |
2ec0bf156ee7d8f130b370558fd535906deb5ecb | 1,829 | cpp | C++ | platform/rp2040/io/pico_gpio.cpp | PicoG/MicroVireo | ffce8fb7d20bb1accfaebff9d97614e84f78018e | [
"MIT"
] | 1 | 2021-08-24T02:59:30.000Z | 2021-08-24T02:59:30.000Z | platform/rp2040/io/pico_gpio.cpp | PicoG/PicoVireo | ffce8fb7d20bb1accfaebff9d97614e84f78018e | [
"MIT"
] | 1 | 2021-08-19T14:00:55.000Z | 2021-08-19T14:00:55.000Z | platform/rp2040/io/pico_gpio.cpp | PicoG/PicoVireo | ffce8fb7d20bb1accfaebff9d97614e84f78018e | [
"MIT"
] | null | null | null | #include "TypeDefiner.h"
#include "Instruction.h"
#include "pico/stdlib.h"
#ifndef __rp2040__
#error pico_gpio.cpp should only be included in Pico-SDK platform targets
#endif
namespace Vireo {
VIREO_FUNCTION_SIGNATURE2(GpioInit, UInt32, UInt32) {
uint pin = _Param(0);
_Param(1) = _Param(0);
//fprintf(s... | 24.386667 | 86 | 0.678513 | PicoG |
2ec2584fbbf96f5f72e1ec73cbc97da990c976b6 | 631 | cpp | C++ | src/cpp/SbfTport.cpp | james-rank/sbf | f2b3ce8c4a324110a22cb880970d2a34bd22ef27 | [
"MIT"
] | null | null | null | src/cpp/SbfTport.cpp | james-rank/sbf | f2b3ce8c4a324110a22cb880970d2a34bd22ef27 | [
"MIT"
] | null | null | null | src/cpp/SbfTport.cpp | james-rank/sbf | f2b3ce8c4a324110a22cb880970d2a34bd22ef27 | [
"MIT"
] | null | null | null | #include "SbfTport.hpp"
neueda::SbfTport::SbfTport (SbfMw* mw,
const char* name,
uint64_t mask)
: mMw(mw)
{
mValue = sbfTport_create (mw->getHandle(), name, mask);
}
neueda::SbfTport::~SbfTport ()
{
if (getHandle () != NULL)
sbfTport_destroy ... | 18.558824 | 59 | 0.568938 | james-rank |
2ec4c2c0898b0ad89c5b6fd10123bdbb3a26efce | 314 | cpp | C++ | DataStructure/c++/Queue/Reverse a queue using recursion.cpp | Sauradip07/DataStructures-and-Algorithm | d782e2e5cf2caedce7202c4aac43ee0ca3a0c285 | [
"MIT"
] | 17 | 2021-09-13T14:50:29.000Z | 2022-01-07T10:53:35.000Z | DataStructure/c++/Queue/Reverse a queue using recursion.cpp | Manish4Kumar/DataStructures-and-Algorithm | 7f3b156af8b380a0a2785782e6437a6cc5835448 | [
"MIT"
] | 15 | 2021-10-01T04:13:32.000Z | 2021-11-05T07:49:55.000Z | DataStructure/c++/Queue/Reverse a queue using recursion.cpp | Manish4Kumar/DataStructures-and-Algorithm | 7f3b156af8b380a0a2785782e6437a6cc5835448 | [
"MIT"
] | 11 | 2021-09-23T14:37:03.000Z | 2021-11-04T13:22:17.000Z | Q2. Reverse a queue using recursion.
question:- https://practice.geeksforgeeks.org/problems/queue-reversal/1
solution:-
void func(queue<int>&q){
if(q.empty()) return;
int x = q.front();
q.pop();
func(q);
q.push(x);
}
queue<int> rev(queue<int> q)
{
func(q);
return q;
}
| 18.470588 | 75 | 0.585987 | Sauradip07 |
2ec55582fbfa8e3d68e9e959cf0f8092644e103e | 1,049 | cc | C++ | iridium/files/patch-base_process_process__linux.cc | behemoth3663/ports_local | ad57042ae62c907f9340ee696f468fdfeb562a8b | [
"BSD-3-Clause"
] | 1 | 2022-02-08T02:24:08.000Z | 2022-02-08T02:24:08.000Z | iridium/files/patch-base_process_process__linux.cc | behemoth3663/ports_local | ad57042ae62c907f9340ee696f468fdfeb562a8b | [
"BSD-3-Clause"
] | null | null | null | iridium/files/patch-base_process_process__linux.cc | behemoth3663/ports_local | ad57042ae62c907f9340ee696f468fdfeb562a8b | [
"BSD-3-Clause"
] | null | null | null | --- base/process/process_linux.cc.orig 2020-03-16 18:39:41 UTC
+++ base/process/process_linux.cc
@@ -79,6 +79,9 @@ Time Process::CreationTime() const {
internal::VM_STARTTIME)
: internal::ReadProcStatsAndGetFieldAsInt64(
... | 32.78125 | 74 | 0.645377 | behemoth3663 |
2ecbefe32a8297eb9538d20bfeab306abd9e83ad | 3,982 | hpp | C++ | src/main/cpp/lemon/io/sockaddr.hpp | lemonkit/lemon | ad34410586659fc650898b60d7e168797a3d9e5b | [
"MIT"
] | 1 | 2018-01-12T05:13:58.000Z | 2018-01-12T05:13:58.000Z | src/main/cpp/lemon/io/sockaddr.hpp | lemonkit/lemon | ad34410586659fc650898b60d7e168797a3d9e5b | [
"MIT"
] | null | null | null | src/main/cpp/lemon/io/sockaddr.hpp | lemonkit/lemon | ad34410586659fc650898b60d7e168797a3d9e5b | [
"MIT"
] | null | null | null | /**
*
* @file sockaddr
* @brief Copyright (C) 2016 yayanyang All Rights Reserved
* @author yayanyang
* @date 2016/02/18
*/
#ifndef LEMON_IO_SOCKADDR_HPP
#define LEMON_IO_SOCKADDR_HPP
#include <vector>
#include <cerrno>
#include <string>
#include <system_error>
#include <lemon/config.h>
#include <le... | 16.522822 | 101 | 0.587393 | lemonkit |
2ed49a4bd4251cdaa05d48aef4802a52bacef645 | 5,784 | cpp | C++ | Cpp/SDK/CaptureZoneStatusWidget_functions.cpp | MrManiak/Squad-SDK | 742feb5991ae43d6f0cedd2d6b32b949923ca4f9 | [
"Apache-2.0"
] | 1 | 2020-08-15T08:31:55.000Z | 2020-08-15T08:31:55.000Z | Cpp/SDK/CaptureZoneStatusWidget_functions.cpp | MrManiak/Squad-SDK | 742feb5991ae43d6f0cedd2d6b32b949923ca4f9 | [
"Apache-2.0"
] | 2 | 2020-08-15T08:43:56.000Z | 2021-01-15T05:04:48.000Z | Cpp/SDK/CaptureZoneStatusWidget_functions.cpp | MrManiak/Squad-SDK | 742feb5991ae43d6f0cedd2d6b32b949923ca4f9 | [
"Apache-2.0"
] | 2 | 2020-08-10T12:05:42.000Z | 2021-02-12T19:56:10.000Z | // Name: S, Version: b
#include "../SDK.h"
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
/*!!HELPER_DEF!!*/
/*!!DEFINE!!*/
namespace UFT
{
//---------------------------------------------------------------------------
// Functions
//---------------------------------------------------------------------------
// ... | 31.096774 | 196 | 0.770401 | MrManiak |
2ed5c52b8c05b64809dd50138c77b99160f60643 | 538 | cpp | C++ | Broccoli/src/Broccoli/Renderer/Framebuffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | 1 | 2021-08-03T01:38:41.000Z | 2021-08-03T01:38:41.000Z | Broccoli/src/Broccoli/Renderer/Framebuffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | null | null | null | Broccoli/src/Broccoli/Renderer/Framebuffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | null | null | null | #include "brclpch.h"
#include "Framebuffer.h"
#include "Renderer.h"
#include "Platform/OpenGL/OpenGLFramebuffer.h"
namespace brcl
{
std::unique_ptr<Framebuffer> Framebuffer::Create(const FrameBufferSpec& spec)
{
switch (renderer::GetAPI())
{
case RendererAPI::API::None: BRCL_CORE_ASSERT(false, "RendererAP... | 25.619048 | 123 | 0.739777 | tross2552 |
2ed9ff9721e25db27e63b899dd2c937f82aae3c8 | 5,719 | hpp | C++ | time/bench.hpp | davencyw/CCPP | bdcb41fbc99cacb71f7afa7696a16efd13394207 | [
"MIT"
] | null | null | null | time/bench.hpp | davencyw/CCPP | bdcb41fbc99cacb71f7afa7696a16efd13394207 | [
"MIT"
] | null | null | null | time/bench.hpp | davencyw/CCPP | bdcb41fbc99cacb71f7afa7696a16efd13394207 | [
"MIT"
] | null | null | null | /*__DECLARATION__
*
* DESCRIPTION
* ___________________________________________________________
*
* Part of:
* Common CPP Library
* Common c++ library for everyday use. Always in development.
*
* author: david schmidig [david@davencyw.net]
* DAVENCYW CODE [davencyw.net]
* Msc CSE ET... | 22.081081 | 79 | 0.582095 | davencyw |
2edd98a4f74262c04d58b23edced4d3bb363226b | 728 | cpp | C++ | Source/Engine/Renderer/Renderer.cpp | yuvanw/ViceEngine | 7259b53483b3d5a516182c9ded42a3c5219ba66f | [
"MIT"
] | null | null | null | Source/Engine/Renderer/Renderer.cpp | yuvanw/ViceEngine | 7259b53483b3d5a516182c9ded42a3c5219ba66f | [
"MIT"
] | null | null | null | Source/Engine/Renderer/Renderer.cpp | yuvanw/ViceEngine | 7259b53483b3d5a516182c9ded42a3c5219ba66f | [
"MIT"
] | null | null | null | #include "Renderer.h"
#include "Camera/Camera.h"
#include "RHI/RHI.h"
void FRenderer::Init(void* InNativeWindowHandle, const FViewport& InViewport)
{
WindowHandle = InNativeWindowHandle;
FRHI::Init(WindowHandle);
FRHI::SetPointSize(3.0f);
RenderTarget = FFrameBuffer::Default();
Camera = MakeShared<FCamera>();
... | 20.222222 | 77 | 0.758242 | yuvanw |
2eddca2f29218d1d9d75f2008e1d558686de1fdd | 1,371 | cpp | C++ | examples/Misc/Misc.cpp | Reiex/SciPP | 1f8e0e589d8fcdb1f90e39b2215baa26c91407df | [
"MIT"
] | 2 | 2019-11-21T11:10:45.000Z | 2020-04-02T08:24:32.000Z | examples/Misc/Misc.cpp | Reiex/SciPP | 1f8e0e589d8fcdb1f90e39b2215baa26c91407df | [
"MIT"
] | null | null | null | examples/Misc/Misc.cpp | Reiex/SciPP | 1f8e0e589d8fcdb1f90e39b2215baa26c91407df | [
"MIT"
] | null | null | null | #include "Misc.hpp"
namespace
{
uint64_t index(uint32_t w, uint32_t h, uint32_t x, uint32_t y)
{
return 3 * (y * w + x);
}
}
void plotLogisticMap(const std::string& filename, uint32_t w, uint32_t h, float a, float b, uint32_t n)
{
std::vector<uint8_t> image(3*w*h, 0);
for (uint32_t i(0); i < w; ... | 20.772727 | 104 | 0.510576 | Reiex |
2edea9c1479e894bc359b56cfc1985a75f58fc77 | 424 | cpp | C++ | gym/100373/H.cpp | albexl/codeforces-gym-submissions | 2a51905c50fcf5d7f417af81c4c49ca5217d0753 | [
"MIT"
] | 1 | 2021-07-16T19:59:39.000Z | 2021-07-16T19:59:39.000Z | gym/100373/H.cpp | albexl/codeforces-gym-submissions | 2a51905c50fcf5d7f417af81c4c49ca5217d0753 | [
"MIT"
] | null | null | null | gym/100373/H.cpp | albexl/codeforces-gym-submissions | 2a51905c50fcf5d7f417af81c4c49ca5217d0753 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<pii>> graph;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k; cin >> n >> k;
map<int, int> M;
for(int i = 0, x; i < n; ++i)
{
cin >> x, ++M[x];
if(M... | 14.133333 | 34 | 0.566038 | albexl |
2ee4a916d8a94f6b3c7e5bf35717110f4dcf65f8 | 327 | cpp | C++ | statistics.cpp | Excelsus4/TextRPG | dcb4c2fe01175f2c78c9894f3a2b92d83e2d8d20 | [
"MIT"
] | null | null | null | statistics.cpp | Excelsus4/TextRPG | dcb4c2fe01175f2c78c9894f3a2b92d83e2d8d20 | [
"MIT"
] | 7 | 2020-08-25T17:28:36.000Z | 2020-08-27T10:36:16.000Z | statistics.cpp | Excelsus4/TextRPG | dcb4c2fe01175f2c78c9894f3a2b92d83e2d8d20 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "statistics.h"
statistics statistics::operator+(statistics rhs)
{
statistics result;
result.Name = Name;
result.Hp = Hp + rhs.Hp;
result.Attack = Attack + rhs.Attack;
result.Level = Level;
result.Strength = Strength + rhs.Strength;
result.Agility = Agility + rhs.Agility;
return res... | 21.8 | 48 | 0.721713 | Excelsus4 |
2eea0e10c147bc57426ef48560579124be05378e | 549 | cpp | C++ | src/Transcoder/Core/Project.cpp | lriki/Lumino | 1a80430f4a83dbdfbe965b3d5b16064991b3edb0 | [
"MIT"
] | 30 | 2016-01-24T05:35:45.000Z | 2020-03-03T09:54:27.000Z | src/Transcoder/Core/Project.cpp | lriki/Lumino | 1a80430f4a83dbdfbe965b3d5b16064991b3edb0 | [
"MIT"
] | 35 | 2016-04-18T06:14:08.000Z | 2020-02-09T15:51:58.000Z | src/Transcoder/Core/Project.cpp | lriki/Lumino | 1a80430f4a83dbdfbe965b3d5b16064991b3edb0 | [
"MIT"
] | 5 | 2016-04-03T02:52:05.000Z | 2018-01-02T16:53:06.000Z | #include "Project.hpp"
//==============================================================================
// Module
Module::Module(const ln::String& name, const ln::Path& moduleRoot)
: m_name(name)
, m_moduleRoot(moduleRoot) {
}
void Module::addInputFile(const ln::Path& filePath) {
inputFiles.push(ln::mak... | 26.142857 | 80 | 0.489982 | lriki |
2eed72b29b528dfc5f99a299a986f5c5b190ddd9 | 1,764 | cpp | C++ | Changing And Saving Images/GammaCorrection.cpp | ShadyD45/OpenCV-With-CPP | 6632d2d45865e8f3fce055f54e962f03eb2978a2 | [
"MIT"
] | 2 | 2020-09-07T15:24:21.000Z | 2021-01-25T19:39:56.000Z | Changing And Saving Images/GammaCorrection.cpp | ShadyD45/OpenCV-With-CPP | 6632d2d45865e8f3fce055f54e962f03eb2978a2 | [
"MIT"
] | null | null | null | Changing And Saving Images/GammaCorrection.cpp | ShadyD45/OpenCV-With-CPP | 6632d2d45865e8f3fce055f54e962f03eb2978a2 | [
"MIT"
] | null | null | null | // Gamma correction can be used to correct brightness of an image
// By using non-linear transformation between the input valuesand the mapped output values
#include <opencv2/imgcodecs.hpp>
#include <opencv2/highgui.hpp>
#include <iostream>
#include <sstream>
using namespace cv;
using namespace std;
void Help()
{
c... | 22.615385 | 108 | 0.694444 | ShadyD45 |
2eed8e234c92dca5d78eb78d2f10d622ebf75401 | 891 | cpp | C++ | test_frameworks/object/modules/basic/dmzObjectModuleBasicTest.cpp | dmzgroup/dmz | fc2d9ddcb04ed71f4106b8d33539529807b3dea6 | [
"MIT"
] | 2 | 2015-11-05T03:03:43.000Z | 2017-05-15T12:55:39.000Z | test_frameworks/object/modules/basic/dmzObjectModuleBasicTest.cpp | dmzgroup/dmz | fc2d9ddcb04ed71f4106b8d33539529807b3dea6 | [
"MIT"
] | null | null | null | test_frameworks/object/modules/basic/dmzObjectModuleBasicTest.cpp | dmzgroup/dmz | fc2d9ddcb04ed71f4106b8d33539529807b3dea6 | [
"MIT"
] | null | null | null | #include <dmzObjectModule.h>
#include "dmzObjectModuleBasicTest.h"
#include <dmzRuntimeConfig.h>
#include <dmzRuntimePluginFactoryLinkSymbol.h>
dmz::ObjectModuleBasicTest::ObjectModuleBasicTest (
const PluginInfo &Info,
Config &local,
Config &global) :
Plugin (Info),
TimeSlice (Info),
... | 19.8 | 73 | 0.698092 | dmzgroup |
2eeece9d17e4bef14425ffd12a56276e64d4fad8 | 13,684 | cpp | C++ | ScriptHookDotNet/Script.cpp | HazardX/gta4_scripthookdotnet | 927b2830952664b63415234541a6c83592e53679 | [
"MIT"
] | 3 | 2021-11-14T20:59:58.000Z | 2021-12-16T16:41:31.000Z | ScriptHookDotNet/Script.cpp | HazardX/gta4_scripthookdotnet | 927b2830952664b63415234541a6c83592e53679 | [
"MIT"
] | 2 | 2021-11-29T14:41:23.000Z | 2021-11-30T13:13:51.000Z | ScriptHookDotNet/Script.cpp | HazardX/gta4_scripthookdotnet | 927b2830952664b63415234541a6c83592e53679 | [
"MIT"
] | 3 | 2021-11-21T12:41:55.000Z | 2021-12-22T16:17:52.000Z | /*
* Copyright (c) 2009-2011 Hazard (hazard_x@gmx.net / twitter.com/HazardX)
*
* 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
* ... | 29.943107 | 194 | 0.674218 | HazardX |
2efdabb622aeb84db4f5c2d68ade54e8b616a1e8 | 9,606 | cpp | C++ | cc/base/MathUtil.cpp | gergul/MiniBlink | 7a11c52f141d54d5f8e1a9af31867cd120a2c3c4 | [
"Apache-2.0"
] | 8 | 2019-05-05T16:38:05.000Z | 2021-11-09T11:45:38.000Z | cc/base/MathUtil.cpp | gergul/MiniBlink | 7a11c52f141d54d5f8e1a9af31867cd120a2c3c4 | [
"Apache-2.0"
] | null | null | null | cc/base/MathUtil.cpp | gergul/MiniBlink | 7a11c52f141d54d5f8e1a9af31867cd120a2c3c4 | [
"Apache-2.0"
] | 4 | 2018-12-14T07:52:46.000Z | 2021-06-11T18:06:09.000Z |
#include "cc/base/MathUtil.h"
using namespace blink;
namespace cc {
static HomogeneousCoordinate MapHomogeneousPoint(const SkMatrix44& transform, const FloatPoint3D& p)
{
HomogeneousCoordinate result(p.x(), p.y(), p.z(), 1.0);
transform.mapMScalars(result.vec, result.vec);
return result;
}
static inlin... | 37.377432 | 134 | 0.672288 | gergul |
2c01d75e0f7554652b77b603952597d4e25bada8 | 1,264 | hpp | C++ | include/utility/repeat.hpp | oxenran/utility-rack | 5d757feea65e9e83375f4be0a770225ebf39d019 | [
"BSL-1.0"
] | null | null | null | include/utility/repeat.hpp | oxenran/utility-rack | 5d757feea65e9e83375f4be0a770225ebf39d019 | [
"BSL-1.0"
] | 1 | 2018-12-18T06:12:07.000Z | 2020-04-24T03:41:18.000Z | include/utility/repeat.hpp | oxenran/utility-rack | 5d757feea65e9e83375f4be0a770225ebf39d019 | [
"BSL-1.0"
] | 1 | 2019-05-21T02:34:56.000Z | 2019-05-21T02:34:56.000Z | /** @file
*
* @ingroup utility_module
*
* @brief Repeat code N times, since the C++ standard range-for does not make it
* easy to repeat a loop N times. The lambda or function object can access the iteration
* count, if desired.
*
* This code is copied from Vittorio Romeo's blog at https://vittorioromeo.in... | 22.571429 | 89 | 0.651899 | oxenran |
2c0289ae6ae8e0219b440d02590b44f03847df1e | 4,507 | cpp | C++ | code/entity_pool.cpp | MackeYver/pong | ca2e3dd7f6b28786e0c5eb5bf346c1a775c9750a | [
"MIT"
] | null | null | null | code/entity_pool.cpp | MackeYver/pong | ca2e3dd7f6b28786e0c5eb5bf346c1a775c9750a | [
"MIT"
] | null | null | null | code/entity_pool.cpp | MackeYver/pong | ca2e3dd7f6b28786e0c5eb5bf346c1a775c9750a | [
"MIT"
] | null | null | null | //
// MIT License
//
// Copyright (c) 2018 Marcus Larsson
//
// 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... | 22.762626 | 90 | 0.598846 | MackeYver |
2c0a55d997a5a8f36820a28b2a682158d603af75 | 1,638 | cpp | C++ | src/linuxtest.cpp | partouf/cpp-sense-hat | d0f4750d1d432fae1bc4793c8d161d6374ed1d9e | [
"MIT"
] | 4 | 2016-08-22T21:06:46.000Z | 2021-02-28T02:06:52.000Z | src/linuxtest.cpp | partouf/cpp-sense-hat | d0f4750d1d432fae1bc4793c8d161d6374ed1d9e | [
"MIT"
] | null | null | null | src/linuxtest.cpp | partouf/cpp-sense-hat | d0f4750d1d432fae1bc4793c8d161d6374ed1d9e | [
"MIT"
] | null | null | null | #include <wiringPi.h>
#include <iostream>
// LED Pin - wiringPi pin 0 is BCM_GPIO 17.
// we have to use BCM numbering when initializing with wiringPiSetupSys
// when choosing a different pin number please use the BCM numbering, also
// update the Property Pages - Build Events - Remote Post-Build Event command
// whi... | 22.438356 | 91 | 0.569597 | partouf |
2c1554ee2548270dfca49de90ff2a4fd25f75daf | 1,400 | cpp | C++ | Source/Shared/Logger/custom_output.cpp | blgrossMS/xbox-live-api | 17c586336e11f0fa3a2a3f3acd665b18c5487b24 | [
"MIT"
] | 2 | 2021-07-17T13:34:20.000Z | 2022-01-09T00:55:51.000Z | Source/Shared/Logger/custom_output.cpp | blgrossMS/xbox-live-api | 17c586336e11f0fa3a2a3f3acd665b18c5487b24 | [
"MIT"
] | null | null | null | Source/Shared/Logger/custom_output.cpp | blgrossMS/xbox-live-api | 17c586336e11f0fa3a2a3f3acd665b18c5487b24 | [
"MIT"
] | 1 | 2018-11-18T08:32:40.000Z | 2018-11-18T08:32:40.000Z | //*********************************************************
//
// Copyright (c) Microsoft. All rights reserved.
// THIS CODE IS PROVIDED *AS IS* WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING ANY
// IMPLIED WARRANTIES OF FITNESS FOR A PARTICULAR
// PURPOSE, MERCHANTABILITY, OR NON-INFRINGEMENT.
... | 42.424242 | 134 | 0.710714 | blgrossMS |
2c17cdd646c6b008fd3e439af492139accc82902 | 1,737 | hpp | C++ | hiro/extension/list-view.hpp | kirwinia/ares-emu-v121 | 722aa227caf943a4a64f1678c1bdd07b38b15caa | [
"0BSD"
] | 2 | 2021-08-15T04:10:10.000Z | 2021-08-15T20:14:13.000Z | hiro/extension/list-view.hpp | qeeg/ares | 13e23df34788f81e4d14471e892a4241862569ce | [
"ISC"
] | 1 | 2022-02-16T02:46:39.000Z | 2022-02-16T04:30:29.000Z | hiro/extension/list-view.hpp | qeeg/ares | 13e23df34788f81e4d14471e892a4241862569ce | [
"ISC"
] | 1 | 2021-12-25T11:34:57.000Z | 2021-12-25T11:34:57.000Z | #if defined(Hiro_ListView)
struct ListView;
struct ListViewItem;
struct mListView;
struct mListViewItem;
using sListView = shared_pointer<mListView>;
using sListViewItem = shared_pointer<mListViewItem>;
struct mListView : mTableView {
using type = mListView;
using mTableView::append;
using mTableView::remove;... | 28.47541 | 72 | 0.696028 | kirwinia |
2c18e6feda2f0cb9aa9cafa83835bbe756d568b5 | 4,998 | cpp | C++ | mpags-cipher.cpp | tomlatham/mpags-day-1-imawby | fcada84b844d539f9560dfcf4f27696da11a36f4 | [
"MIT"
] | null | null | null | mpags-cipher.cpp | tomlatham/mpags-day-1-imawby | fcada84b844d539f9560dfcf4f27696da11a36f4 | [
"MIT"
] | null | null | null | mpags-cipher.cpp | tomlatham/mpags-day-1-imawby | fcada84b844d539f9560dfcf4f27696da11a36f4 | [
"MIT"
] | 1 | 2019-10-15T08:35:13.000Z | 2019-10-15T08:35:13.000Z | #include <iostream>
#include <string>
#include <vector>
// For std::isalpha and std::isupper
#include <cctype>
std::string convertIntToString(const char x);
int main(int argc, char* argv[])
{
// Convert the command-line arguments into a more easily usable form
const std::vector<std::string> cmdLineArgs{argv, arg... | 27.766667 | 107 | 0.602641 | tomlatham |
2c1dbc0f37cfd9db86ddd5f6f1add1b97791d5d8 | 856 | cpp | C++ | eventrpc/test/buffer_test.cpp | romatotti/avidya | 37bda55b3cea0b592f775743f74e759663f1a660 | [
"BSD-3-Clause"
] | 3 | 2015-12-23T03:29:02.000Z | 2019-07-17T12:57:34.000Z | eventrpc/test/buffer_test.cpp | romatotti/avidya | 37bda55b3cea0b592f775743f74e759663f1a660 | [
"BSD-3-Clause"
] | null | null | null | eventrpc/test/buffer_test.cpp | romatotti/avidya | 37bda55b3cea0b592f775743f74e759663f1a660 | [
"BSD-3-Clause"
] | 1 | 2016-03-23T03:44:12.000Z | 2016-03-23T03:44:12.000Z | /*
* Copyright (C) Lichuang
*/
#include <stdio.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <gtest/gtest.h>
#include <list>
#include <string>
#include "eventrpc/buffer.h"
using namespace std;
namespace eventrpc {
class BufferTest : public testing::Test {
public:
void SetUp() {
}
void TearDown() {... | 19.022222 | 53 | 0.683411 | romatotti |
2c2520efa7a657e50dfdf0b535fc7ebf2b643da9 | 202 | hpp | C++ | include/power.hpp | sammhicks/keyboard-backlight-events | ca39f93f275c2ec0e8676f8021df8f7693f905b5 | [
"MIT"
] | null | null | null | include/power.hpp | sammhicks/keyboard-backlight-events | ca39f93f275c2ec0e8676f8021df8f7693f905b5 | [
"MIT"
] | null | null | null | include/power.hpp | sammhicks/keyboard-backlight-events | ca39f93f275c2ec0e8676f8021df8f7693f905b5 | [
"MIT"
] | null | null | null | #pragma once
#include "common.hpp"
const Color color = Color::Green;
const Brightness brightness = Brightness::Max;
const milliseconds duration = milliseconds(500);
int main(int argc, char *argv[]);
| 20.2 | 48 | 0.747525 | sammhicks |
2c28e182962d0a39a68481c903e43ae601e39bac | 267 | inl | C++ | node_modules/lzz-gyp/lzz-source/smtc_PrintTmplObjDefn.inl | SuperDizor/dizornator | 9f57dbb3f6af80283b4d977612c95190a3d47900 | [
"ISC"
] | 3 | 2019-09-18T16:44:33.000Z | 2021-03-29T13:45:27.000Z | node_modules/lzz-gyp/lzz-source/smtc_PrintTmplObjDefn.inl | SuperDizor/dizornator | 9f57dbb3f6af80283b4d977612c95190a3d47900 | [
"ISC"
] | null | null | null | node_modules/lzz-gyp/lzz-source/smtc_PrintTmplObjDefn.inl | SuperDizor/dizornator | 9f57dbb3f6af80283b4d977612c95190a3d47900 | [
"ISC"
] | 2 | 2019-03-29T01:06:38.000Z | 2019-09-18T16:44:34.000Z | // smtc_PrintTmplObjDefn.inl
//
#ifdef LZZ_ENABLE_INLINE
#define LZZ_INLINE inline
#else
#define LZZ_INLINE
#endif
namespace smtc
{
LZZ_INLINE PrintTmplObjDefn::PrintTmplObjDefn (NamePtr const & qual_name)
: PrintObjDefn (qual_name)
{}
}
#undef LZZ_INLINE
| 16.6875 | 75 | 0.76779 | SuperDizor |
2c2bce50d323eee3864789fbf70000d1d45fd1be | 2,432 | hpp | C++ | include/fe/subsystems/resourceManager/resourceManager.hpp | TheCandianVendingMachine/TCVM_Flat_Engine | 13797b91f6f4199d569f80baa29e2584652fc4b5 | [
"MIT"
] | 1 | 2018-06-15T23:49:37.000Z | 2018-06-15T23:49:37.000Z | include/fe/subsystems/resourceManager/resourceManager.hpp | TheCandianVendingMachine/TCVM_Flat_Engine | 13797b91f6f4199d569f80baa29e2584652fc4b5 | [
"MIT"
] | 5 | 2017-04-23T03:25:10.000Z | 2018-02-23T07:48:16.000Z | include/fe/subsystems/resourceManager/resourceManager.hpp | TheCandianVendingMachine/TCVM_Flat_Engine | 13797b91f6f4199d569f80baa29e2584652fc4b5 | [
"MIT"
] | null | null | null | // resourceManager.hpp
// loads and stores all resources so they don't go out of scope for the program
#pragma once
#include <unordered_map>
#include <vector>
#include <SFML/Graphics/Texture.hpp>
#include <SFML/Graphics/Font.hpp>
#include "../../typeDefines.hpp"
#include "../../objectManagement/str.hpp"
#include "../..... | 34.253521 | 157 | 0.534539 | TheCandianVendingMachine |
2c2c1e48186b835895e3c7ccf48f66b057d27ea2 | 2,860 | hpp | C++ | rajson/exceptions.hpp | dmitigr/cefeika | 6189843d4244f7334558708e57e952584561b1e0 | [
"Zlib"
] | 19 | 2019-07-21T15:38:12.000Z | 2022-01-06T05:24:48.000Z | rajson/exceptions.hpp | dmitigr/cefeika | 6189843d4244f7334558708e57e952584561b1e0 | [
"Zlib"
] | 6 | 2019-12-07T22:12:37.000Z | 2022-01-10T22:31:48.000Z | rajson/exceptions.hpp | dmitigr/cefeika | 6189843d4244f7334558708e57e952584561b1e0 | [
"Zlib"
] | 1 | 2019-08-15T14:49:00.000Z | 2019-08-15T14:49:00.000Z | // -*- C++ -*-
// Copyright (C) 2021 Dmitry Igrishin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// i... | 28.6 | 80 | 0.601399 | dmitigr |
2c2d29642df8f539000ddb2756eea39d17aa67c2 | 162 | cpp | C++ | Source/Core/Controller/network_controller.cpp | mlavik1/HikariOnline | 47fb9457a1c5329859a4d41cb06442109bc507fa | [
"MIT"
] | null | null | null | Source/Core/Controller/network_controller.cpp | mlavik1/HikariOnline | 47fb9457a1c5329859a4d41cb06442109bc507fa | [
"MIT"
] | null | null | null | Source/Core/Controller/network_controller.cpp | mlavik1/HikariOnline | 47fb9457a1c5329859a4d41cb06442109bc507fa | [
"MIT"
] | null | null | null | #include "network_controller.h"
namespace Hikari
{
IMPLEMENT_CLASS(Hikari::NetworkController)
NetworkController::NetworkController()
:GameObject()
{
}
}
| 12.461538 | 43 | 0.759259 | mlavik1 |
2c2ddb8df13735a4e47db47014b92f2d4e2cbefe | 2,255 | cpp | C++ | Tic-Tac-Toe/src/playGame.cpp | neonBdragon/Tic-Tac-Toe | 5016ae2988f28dd6b15d212af00ec4ee4b03e2ef | [
"MIT"
] | null | null | null | Tic-Tac-Toe/src/playGame.cpp | neonBdragon/Tic-Tac-Toe | 5016ae2988f28dd6b15d212af00ec4ee4b03e2ef | [
"MIT"
] | null | null | null | Tic-Tac-Toe/src/playGame.cpp | neonBdragon/Tic-Tac-Toe | 5016ae2988f28dd6b15d212af00ec4ee4b03e2ef | [
"MIT"
] | null | null | null | #include "playGame.hpp"
playGame::playGame(int playerTurns, std::string* spots)
{
board->createBoard(spots);
int p1, p2;
while(true)
{
if(playerTurns % 2 == 1)
{
std::cout << std::endl;
std::cout << "Player 1 it's your turn" << std::endl;
... | 27.168675 | 82 | 0.4102 | neonBdragon |
2c2e3deb03b06f05ad4b1b5bbe45cfc757ba1fc9 | 1,358 | cpp | C++ | compiler/sir/bblock.cpp | glram/seq | 88ba866ffd623376f45fc5dc9a5eca095b494fd7 | [
"Apache-2.0"
] | null | null | null | compiler/sir/bblock.cpp | glram/seq | 88ba866ffd623376f45fc5dc9a5eca095b494fd7 | [
"Apache-2.0"
] | null | null | null | compiler/sir/bblock.cpp | glram/seq | 88ba866ffd623376f45fc5dc9a5eca095b494fd7 | [
"Apache-2.0"
] | 1 | 2020-11-19T16:08:08.000Z | 2020-11-19T16:08:08.000Z | #include <algorithm>
#include <iterator>
#include <sstream>
#include "bblock.h"
#include "stmt.h"
#include "terminator.h"
using namespace seq;
using namespace ir;
BasicBlock::BasicBlock() : statements{}, terminator{nullptr}, id{currentId++} {}
BasicBlock::BasicBlock(const BasicBlock &other)
: statements{}, term... | 25.148148 | 80 | 0.706186 | glram |
2c30654695cc12d20ebfd554a4311a55aa68fbc6 | 1,157 | cpp | C++ | LeetCode/ThousandTwo/1461-check_if_str_contain_all_bin_code_size_K.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandTwo/1461-check_if_str_contain_all_bin_code_size_K.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | LeetCode/ThousandTwo/1461-check_if_str_contain_all_bin_code_size_K.cpp | Ginkgo-Biloba/Cpp-Repo1-VS | 231c68a055e6bf69a3f7c224e7c0182b67ce5b67 | [
"Apache-2.0"
] | null | null | null | #include "leetcode.hpp"
/* 1461. 检查一个字符串是否包含所有长度为 K 的二进制子串
给你一个二进制字符串 s 和一个整数 k 。
如果所有长度为 k 的二进制字符串都是 s 的子串，请返回 True ，否则请返回 False 。
示例 1：
输入：s = "00110110", k = 2
输出：true
解释：长度为 2 的二进制串包括 "00"，"01"，"10" 和 "11"。
它们分别是 s 中下标为 0，1，3，2 开始的长度为 2 的子串。
示例 2：
输入：s = "00110", k = 2
输出：true
示例 3：
输入：s = "0110", k = 1
输出：... | 16.528571 | 49 | 0.557476 | Ginkgo-Biloba |
2c36ffb2eec99286d49645687cec07358d6f83f1 | 5,840 | hpp | C++ | timer-info.hpp | mfleming/uarch-bench | a87790f76e02913fdafa2723fb0c99c485c93822 | [
"MIT"
] | 501 | 2017-06-01T23:20:31.000Z | 2022-03-22T06:52:09.000Z | timer-info.hpp | mfleming/uarch-bench | a87790f76e02913fdafa2723fb0c99c485c93822 | [
"MIT"
] | 90 | 2017-06-01T23:54:34.000Z | 2021-10-30T00:31:02.000Z | timer-info.hpp | mfleming/uarch-bench | a87790f76e02913fdafa2723fb0c99c485c93822 | [
"MIT"
] | 42 | 2018-01-22T12:58:53.000Z | 2022-02-16T06:45:41.000Z | /*
* timer_info.hpp
*/
#ifndef TIMER_INFO_HPP_
#define TIMER_INFO_HPP_
#include <vector>
#include <string>
#include <functional>
#include <array>
#include "args.hxx"
#include "stats.hpp"
#include "bench-declarations.h"
class Context;
typedef std::function<void * ()> arg_method_t; // generates the argum... | 33.757225 | 127 | 0.708904 | mfleming |
2c37b7c6f31783690daa03dc60b3168f0f90d69e | 1,001 | cpp | C++ | cf/1662/I.cpp | Zilanlann/cp-code | 0500acbf6fb05a66f7bdbdf0e0a8bd6170126a4a | [
"MIT"
] | 3 | 2022-03-30T14:14:57.000Z | 2022-03-31T04:30:32.000Z | cf/1662/I.cpp | Zilanlann/cp-code | 0500acbf6fb05a66f7bdbdf0e0a8bd6170126a4a | [
"MIT"
] | null | null | null | cf/1662/I.cpp | Zilanlann/cp-code | 0500acbf6fb05a66f7bdbdf0e0a8bd6170126a4a | [
"MIT"
] | null | null | null | // Problem: I. Ice Cream Shop
// Contest: SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams
// Preferred) URL: https://codeforces.com/contest/1662/problem/I Memory Limit:
// 256 MB Time Limit: 2000 ms
//
// Author: chrisann
// Date: 2022-04-24 20:33:55
#include <bits/stdc++.h>
using namespace std;
#define re... | 23.833333 | 78 | 0.577423 | Zilanlann |
2c3818eb4878d5e668e1c6fd2b6e1d480faa5cbe | 1,670 | cpp | C++ | src/ackward/core/Initialize.cpp | abingham/ackward | f1a45293de570f4b4429d9eaeb3f6c4da7d245bf | [
"MIT"
] | null | null | null | src/ackward/core/Initialize.cpp | abingham/ackward | f1a45293de570f4b4429d9eaeb3f6c4da7d245bf | [
"MIT"
] | null | null | null | src/ackward/core/Initialize.cpp | abingham/ackward | f1a45293de570f4b4429d9eaeb3f6c4da7d245bf | [
"MIT"
] | null | null | null | #include <ackward/core/Initialize.hpp>
#include <ackward/core/ByteArray.hpp>
#include <ackward/core/Bytes.hpp>
#include <ackward/core/ExceptionTranslation.hpp>
#include <ackward/core/PythonConverter.hpp>
namespace
{
void initializeExceptions()
{
using namespace ackward::core;
registerExceptionTranslation<At... | 24.558824 | 49 | 0.675449 | abingham |
2c39d085ae6a1e34e6ea21e27f59c7efce57c1bf | 3,613 | hh | C++ | RecoDataProducts/inc/KalSeed.hh | bonventre/Offline | 77db9d6368f27ab9401c690c2c2a4257ade6c231 | [
"Apache-2.0"
] | 1 | 2021-05-25T19:10:10.000Z | 2021-05-25T19:10:10.000Z | RecoDataProducts/inc/KalSeed.hh | bonventre/Offline | 77db9d6368f27ab9401c690c2c2a4257ade6c231 | [
"Apache-2.0"
] | 1 | 2019-11-22T14:45:51.000Z | 2019-11-22T14:50:03.000Z | RecoDataProducts/inc/KalSeed.hh | bonventre/Offline | 77db9d6368f27ab9401c690c2c2a4257ade6c231 | [
"Apache-2.0"
] | 2 | 2019-10-14T17:46:58.000Z | 2020-03-30T21:05:15.000Z | //
// Persistent representation of the BTrk Kalman filter fit (KalRep)
// Original author: Dave Brown (LBNL) 31 Aug 2016
//
#ifndef RecoDataProducts_KalSeed_HH
#define RecoDataProducts_KalSeed_HH
// mu2e
#include "RecoDataProducts/inc/TrkFitDirection.hh"
#include "RecoDataProducts/inc/TrkStrawHitSeed.hh"
#include "Re... | 47.539474 | 130 | 0.695821 | bonventre |
2c39ebaf7c90e9cf60062f30526bfae09b767e7a | 1,846 | cpp | C++ | ws/ws3/ws3.cpp | blackHatMonkey/BTP305 | 21f8025b151493185a5156ceec5e54260c8018c6 | [
"MIT"
] | 1 | 2020-12-14T21:49:58.000Z | 2020-12-14T21:49:58.000Z | ws/ws3/ws3.cpp | blackHatMonkey/BTP305 | 21f8025b151493185a5156ceec5e54260c8018c6 | [
"MIT"
] | null | null | null | ws/ws3/ws3.cpp | blackHatMonkey/BTP305 | 21f8025b151493185a5156ceec5e54260c8018c6 | [
"MIT"
] | 1 | 2020-01-18T19:21:36.000Z | 2020-01-18T19:21:36.000Z | // Workshop 3 - Templates
// w3.cpp
// Author: Dr. Elliott Coleshill
// Date: 2018-08-22
#include <iostream>
#include <iomanip>
#include <string>
#include "Pair.h"
#include "List.h"
using namespace std;
int main(int argc, char** argv)
{
bool keepreading;
std::cout << std::fixed << std::setprecision(2);
... | 26.371429 | 68 | 0.484832 | blackHatMonkey |
2c3f994372cd687b4bb2ba6650db186f3499adc3 | 463 | cpp | C++ | sparse/test.cpp | maxime-tournier/cpp | 303def38a523f0e5699ef389182974f4f50d10fb | [
"MIT"
] | null | null | null | sparse/test.cpp | maxime-tournier/cpp | 303def38a523f0e5699ef389182974f4f50d10fb | [
"MIT"
] | null | null | null | sparse/test.cpp | maxime-tournier/cpp | 303def38a523f0e5699ef389182974f4f50d10fb | [
"MIT"
] | null | null | null |
#include <iostream>
static const struct test {
test() {
auto x = make_array<double, 32>(0ul);
x = x->set<32>(0, 1);
x = x->set<32>(4, 2);
std::clog << x->at(0) << std::endl;
std::clog << x->at(4) << std::endl;
amt<double> test;
for(std::size_t i = 0; i < (1ul << 14); ++i) {
... | 17.148148 | 50 | 0.475162 | maxime-tournier |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.