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 108 | 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 67k ⌀ | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
dd1390f4214bcff6805ff06e973499feb4bc1223 | 4,040 | cpp | C++ | modules/core/src/MetaObject/core/detail/Time.cpp | dtmoodie/MetaObject | 8238d143d578ff9c0c6506e7e627eca15e42369e | [
"MIT"
] | 2 | 2017-10-26T04:41:49.000Z | 2018-02-09T05:12:19.000Z | modules/core/src/MetaObject/core/detail/Time.cpp | dtmoodie/MetaObject | 8238d143d578ff9c0c6506e7e627eca15e42369e | [
"MIT"
] | null | null | null | modules/core/src/MetaObject/core/detail/Time.cpp | dtmoodie/MetaObject | 8238d143d578ff9c0c6506e7e627eca15e42369e | [
"MIT"
] | 3 | 2017-01-08T21:09:48.000Z | 2018-02-10T04:27:32.000Z | #include "Time.hpp"
#include <iomanip>
#include <sstream>
namespace mo
{
static Time::GetTime_f time_source = nullptr;
Time Time::now()
{
if (time_source)
{
return time_source();
}
return std::chrono::high_resolution_clock::now();
}
void Time::setTimeSou... | 23.352601 | 95 | 0.490594 | dtmoodie |
dd143d1f1469e85b964a87e024d2cee1dbc22783 | 7,764 | cpp | C++ | 3rdparty/GPSTk/core/apps/difftools/rinheaddiff.cpp | mfkiwl/ICE | e660d031bb1bcea664db1de4946fd8781be5b627 | [
"MIT"
] | 50 | 2019-10-12T01:22:20.000Z | 2022-02-15T23:28:26.000Z | 3rdparty/GPSTk/core/apps/difftools/rinheaddiff.cpp | wuyou33/Enabling-Robust-State-Estimation-through-Measurement-Error-Covariance-Adaptation | 2f1ff054b7c5059da80bb3b2f80c05861a02cc36 | [
"MIT"
] | null | null | null | 3rdparty/GPSTk/core/apps/difftools/rinheaddiff.cpp | wuyou33/Enabling-Robust-State-Estimation-through-Measurement-Error-Covariance-Adaptation | 2f1ff054b7c5059da80bb3b2f80c05861a02cc36 | [
"MIT"
] | 14 | 2019-11-05T01:50:29.000Z | 2021-08-06T06:23:44.000Z | //============================================================================
//
// This file is part of GPSTk, the GPS Toolkit.
//
// The GPSTk is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published
// by the Free Software Foundation; ei... | 26.318644 | 79 | 0.564657 | mfkiwl |
dd169e862e5831092be13e9aa1a2b62c61c269be | 2,859 | cpp | C++ | src/disp/Module.cpp | LegalizeAdulthood/cimple | 5ec70784f2ee3e455a2258f82b07c0dacccb4093 | [
"MIT"
] | 4 | 2015-12-16T06:43:14.000Z | 2020-01-24T06:05:47.000Z | src/disp/Module.cpp | LegalizeAdulthood/cimple | 5ec70784f2ee3e455a2258f82b07c0dacccb4093 | [
"MIT"
] | null | null | null | src/disp/Module.cpp | LegalizeAdulthood/cimple | 5ec70784f2ee3e455a2258f82b07c0dacccb4093 | [
"MIT"
] | null | null | null | /*
**==============================================================================
**
** Copyright (c) 2003, 2004, 2005, 2006, Michael Brasher, Karl Schopmeyer
**
** Permission is hereby granted, free of charge, to any person obtaining a
** copy of this software and associated documentation files (the "Software"),
** ... | 25.526786 | 80 | 0.637636 | LegalizeAdulthood |
dd1985b492652c976d8a4d3e6f07cc0be30b3ed4 | 1,799 | cpp | C++ | tree/medium/145.BinaryTreePostorderTraversal.cpp | XiaotaoGuo/Leetcode-Solution-In-Cpp | 8e01e35c742a7afb0c8cdd228a6a5e564375434e | [
"Apache-2.0"
] | null | null | null | tree/medium/145.BinaryTreePostorderTraversal.cpp | XiaotaoGuo/Leetcode-Solution-In-Cpp | 8e01e35c742a7afb0c8cdd228a6a5e564375434e | [
"Apache-2.0"
] | null | null | null | tree/medium/145.BinaryTreePostorderTraversal.cpp | XiaotaoGuo/Leetcode-Solution-In-Cpp | 8e01e35c742a7afb0c8cdd228a6a5e564375434e | [
"Apache-2.0"
] | null | null | null | /*
* @lc app=leetcode id=145 lang=cpp
*
* [145] Binary Tree Postorder Traversal
*
* https://leetcode.com/problems/binary-tree-postorder-traversal/description/
*
* algorithms
* Medium (55.73%)
* Likes: 2082
* Dislikes: 104
* Total Accepted: 415.3K
* Total Submissions: 742.6K
* Testcase Example: '[1,n... | 16.657407 | 77 | 0.566982 | XiaotaoGuo |
dd1a7e577104f752756106fe37dbb18b33216096 | 15,684 | cpp | C++ | kwm/axlib/application.cpp | a-morales/kwm | 2ee8078616d5a37287aeb7c5b20f0dba982b19ed | [
"MIT"
] | 13 | 2020-06-30T09:48:28.000Z | 2022-03-29T04:42:54.000Z | kwm/axlib/application.cpp | a-morales/kwm | 2ee8078616d5a37287aeb7c5b20f0dba982b19ed | [
"MIT"
] | null | null | null | kwm/axlib/application.cpp | a-morales/kwm | 2ee8078616d5a37287aeb7c5b20f0dba982b19ed | [
"MIT"
] | 3 | 2020-02-16T00:57:05.000Z | 2022-03-13T23:50:08.000Z | #include "application.h"
#include "element.h"
#include "sharedworkspace.h"
#include "event.h"
#include "display.h"
#include "axlib.h"
#define internal static
#define local_persist static
enum ax_application_notifications
{
AXApplication_Notification_WindowCreated,
AXApplication_Notification_WindowFocused,
... | 38.253659 | 161 | 0.672533 | a-morales |
dd1b4f199dfec33ec5d15fefe4cfa47258fe1744 | 925 | cpp | C++ | ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | Mogikan/OpenMP | 7fa130159dfb32a9885c31b2c4e36de4ef36fa44 | [
"Apache-2.0"
] | null | null | null | ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | Mogikan/OpenMP | 7fa130159dfb32a9885c31b2c4e36de4ef36fa44 | [
"Apache-2.0"
] | null | null | null | ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | Mogikan/OpenMP | 7fa130159dfb32a9885c31b2c4e36de4ef36fa44 | [
"Apache-2.0"
] | null | null | null | // ConsoleApplication1.cpp : Defines the entry point for the console application.
//
#pragma once;
#include "stdafx.h"
#include <list>
#include <iostream>
using namespace std;
int main()
{
std::list<int> intlist;
for (int i = 0; i < 10; i++)
{
intlist.push_back(i);
}
std::list<int>::iterator iterator,iterator... | 18.877551 | 101 | 0.632432 | Mogikan |
dd1c5d83bea2c8d1bc8f12b801aa9693c18231bf | 1,215 | cpp | C++ | Greedy/jumpGame2.cpp | anishmo99/Diversified-Programming | 2bc955682414ac5afc9e39fbf2e01c411b0b86de | [
"MIT"
] | 2 | 2020-08-09T02:09:50.000Z | 2020-08-09T07:07:47.000Z | Greedy/jumpGame2.cpp | anishmo99/Diversified-Programming | 2bc955682414ac5afc9e39fbf2e01c411b0b86de | [
"MIT"
] | null | null | null | Greedy/jumpGame2.cpp | anishmo99/Diversified-Programming | 2bc955682414ac5afc9e39fbf2e01c411b0b86de | [
"MIT"
] | 5 | 2020-09-21T12:49:07.000Z | 2020-09-29T16:13:09.000Z | class Solution
{
public:
int jump(vector<int> &nums)
{
int jumps = 0, curend = 0, curfurthest = 0;
for (int i = 0; i < nums.size() - 1; i++)
{
curfurthest = max(curfurthest, i + nums[i]);
if (i == curend)
{
jumps++;
cure... | 20.948276 | 56 | 0.327572 | anishmo99 |
dd1f71ee6a148aa7a853aad610459efc653d3a84 | 2,428 | cpp | C++ | src/token.cpp | JevinJ/ConnectFour | 3e131c9ff957c3ca108b6f79e8940ba3ae40e8d4 | [
"MIT"
] | null | null | null | src/token.cpp | JevinJ/ConnectFour | 3e131c9ff957c3ca108b6f79e8940ba3ae40e8d4 | [
"MIT"
] | null | null | null | src/token.cpp | JevinJ/ConnectFour | 3e131c9ff957c3ca108b6f79e8940ba3ae40e8d4 | [
"MIT"
] | null | null | null | /*
* token.cpp
*
* Created on: Dec 24, 2017
* Author: Jevin
*/
#include <iostream>
#include "config.hpp"
#include "token.hpp"
#include "resourcemanager.hpp"
Token::Token() :
x_pos(0),
y_pos(0) {
model.setRadius(TOKEN_RADIUS);
model.setTexture(&resource_manager.textures[Textures::To... | 24.039604 | 107 | 0.669275 | JevinJ |
dd22ffc5f1053df295a6743345308994cf239cd1 | 26,682 | cpp | C++ | src/app/GameView.cpp | Daivuk/ggj16 | 0ba896f3b6ece32ed3a6e190825e53e88f666d5e | [
"MIT"
] | null | null | null | src/app/GameView.cpp | Daivuk/ggj16 | 0ba896f3b6ece32ed3a6e190825e53e88f666d5e | [
"MIT"
] | null | null | null | src/app/GameView.cpp | Daivuk/ggj16 | 0ba896f3b6ece32ed3a6e190825e53e88f666d5e | [
"MIT"
] | 1 | 2019-10-19T04:49:33.000Z | 2019-10-19T04:49:33.000Z | #include "GameView.h"
#include "Player.h"
#include "TiledMapNode.h"
#include "Fireplace.h"
#include "DanceSequence.h"
#include "LightLayer.h"
#include "Tree.h"
#include "Rock.h"
#include "MusicEmitter.h"
#include "DancePedestral.h"
#include "Monster.h"
#include "BloodLayer.h"
#include "Stockpile.h"
#include "Stone.h"
#... | 26.602193 | 174 | 0.574395 | Daivuk |
dd292d6b7460b7bfbd4c2503f5f32bd4bfff325f | 8,898 | cpp | C++ | AVSGatewayManager/test/AVSGatewayManagerTest.cpp | rysmith0315/avs-device-sdk | f0fa55856af9e33d0889ac14820efbb807341f17 | [
"Apache-2.0"
] | null | null | null | AVSGatewayManager/test/AVSGatewayManagerTest.cpp | rysmith0315/avs-device-sdk | f0fa55856af9e33d0889ac14820efbb807341f17 | [
"Apache-2.0"
] | null | null | null | AVSGatewayManager/test/AVSGatewayManagerTest.cpp | rysmith0315/avs-device-sdk | f0fa55856af9e33d0889ac14820efbb807341f17 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0/
*
* or in the "licen... | 35.73494 | 119 | 0.764329 | rysmith0315 |
dd2b3a0606d4f086cfcdd028231cd9711e51406e | 1,496 | cpp | C++ | Breakout/laser.cpp | henry9836/Space-Invaders | 75a3c530589c3a0b6f207e6fd2bbcaad9c9f6c98 | [
"MIT"
] | null | null | null | Breakout/laser.cpp | henry9836/Space-Invaders | 75a3c530589c3a0b6f207e6fd2bbcaad9c9f6c98 | [
"MIT"
] | null | null | null | Breakout/laser.cpp | henry9836/Space-Invaders | 75a3c530589c3a0b6f207e6fd2bbcaad9c9f6c98 | [
"MIT"
] | null | null | null | //
// Bachelor of Software Engineering
// Media Design School
// Auckland
// New Zealand
//
// (c) 2018 Media Design School.
//
// File Name : laser.cpp
// Description : controls lasers
// Author : Henry Oliver
// Mail : henry.oliver@mediadesign.school.nz
//
// Library Includes
// Local Includes
#... | 13.724771 | 66 | 0.645053 | henry9836 |
dd2d3aa721bd507c5401bafa86e2ff70669e61da | 3,478 | cpp | C++ | source/launch.cpp | mvandevander/SpechtCMDLauncher | 692c6acec43f6c91a63edce8094be8c18ad677ab | [
"MIT"
] | 1 | 2022-02-09T01:14:25.000Z | 2022-02-09T01:14:25.000Z | source/launch.cpp | mvandevander/SpechtCMDLauncher | 692c6acec43f6c91a63edce8094be8c18ad677ab | [
"MIT"
] | null | null | null | source/launch.cpp | mvandevander/SpechtCMDLauncher | 692c6acec43f6c91a63edce8094be8c18ad677ab | [
"MIT"
] | null | null | null | // Launch.cpp is a command line utilitiy for launching Applications without
// a .bat script from a config file
// TODO: Write my own token parsing, and compare
#include <cstdio>
#include <stdlib.h>
#include "SpechtStringLib.cpp"
#define internal static
#define local_persist static
#define global_variable static
str... | 25.021583 | 92 | 0.591432 | mvandevander |
dd306cf223ff136818dd3c8b1a7dc37e82d3d7cc | 8,356 | cc | C++ | testing/mystrlen_test_multi_event.cc | jasonspencer/CPP_LPE_wrap | b4b20b730cb04d91c665314aa805cfce4f3ddf35 | [
"Apache-2.0"
] | 1 | 2020-08-10T21:35:14.000Z | 2020-08-10T21:35:14.000Z | testing/mystrlen_test_multi_event.cc | jasonspencer/CPP_LPE_wrap | b4b20b730cb04d91c665314aa805cfce4f3ddf35 | [
"Apache-2.0"
] | null | null | null | testing/mystrlen_test_multi_event.cc | jasonspencer/CPP_LPE_wrap | b4b20b730cb04d91c665314aa805cfce4f3ddf35 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <sstream>
#include <cstring> // std strlen
#include <functional>
#include <memory>
#include <jsplib/perf/PerfEventCount.hh>
#include <jsplib/perf/ScopedEventTrigger.hh>
#include <jsplib/perf/WallTimeEvent.hh>
#ifndef TOTALSTRINGLENGTH
#define TOTALSTRINGLENGTH (1<<30)
#endif
// g++ -O3 -... | 43.978947 | 226 | 0.640618 | jasonspencer |
dd30ba1707c087832ab694c9fc294b4c3a359ab5 | 1,353 | cpp | C++ | 线性表/顺序实现大题/P19.5.cpp | Ruvikm/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | 103 | 2021-01-07T13:03:57.000Z | 2022-03-31T03:10:35.000Z | 线性表/顺序实现大题/P19.5.cpp | fu123567/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | null | null | null | 线性表/顺序实现大题/P19.5.cpp | fu123567/Wangdao-Data-Structures | e00494f40c0be9d81229062bf69fe1e12e340773 | [
"MIT"
] | 23 | 2021-04-10T07:53:03.000Z | 2022-03-31T00:33:05.000Z | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#pragma region 建立顺序存储的线性表
#define MAX 30
#define _for(i,a,b) for( int i=(a); i<(b); ++i)
#define _rep(i,a,b) for( int i=(a); i<=(b); ++i)
typedef struct {
int data[MAX];
int length;
}List;
void swap(int& a, int& b) {
int t;
t = a;... | 17.802632 | 56 | 0.574279 | Ruvikm |
dd400b2b4d4bd9ccb7aac503d7135a31cfdc8598 | 3,046 | cpp | C++ | PareidoliaCL/pattern.cpp | cpkt9762/PareidoliaTriggerbot | fdd98d4fc31fa6dec60176c87264705ddff8a3e8 | [
"MIT"
] | 21 | 2019-11-05T10:21:39.000Z | 2022-03-27T09:07:26.000Z | PareidoliaCL/pattern.cpp | blackhades00/PareidoliaTriggerbot | fdd98d4fc31fa6dec60176c87264705ddff8a3e8 | [
"MIT"
] | null | null | null | PareidoliaCL/pattern.cpp | blackhades00/PareidoliaTriggerbot | fdd98d4fc31fa6dec60176c87264705ddff8a3e8 | [
"MIT"
] | 18 | 2019-11-03T13:55:50.000Z | 2022-03-27T09:07:27.000Z | /*++
Copyright (c) 2019 changeofpace. All rights reserved.
Use of this source code is governed by the MIT license. See the 'LICENSE' file
for more information.
--*/
#include "pattern.h"
#include "log.h"
#include "ntdll.h"
_Use_decl_annotations_
BOOL
PtnFindPatternUnique(
PVOID pBaseAddress,
SIZE_T cbSear... | 21.602837 | 78 | 0.587656 | cpkt9762 |
dd45f094e99705a5b02a686993540713fe77c6e2 | 703 | cpp | C++ | Data Structure/Array Or Vector/Selection Sort/SolutionbyMashiyatHussain.cpp | Mdanish777/Programmers-Community | b5ca9582fc1cd4337baa7077ff62130a1052583f | [
"MIT"
] | 261 | 2019-09-30T19:47:29.000Z | 2022-03-29T18:20:07.000Z | Data Structure/Array Or Vector/Selection Sort/SolutionbyMashiyatHussain.cpp | Mdanish777/Programmers-Community | b5ca9582fc1cd4337baa7077ff62130a1052583f | [
"MIT"
] | 647 | 2019-10-01T16:51:29.000Z | 2021-12-16T20:39:44.000Z | Data Structure/Array Or Vector/Selection Sort/SolutionbyMashiyatHussain.cpp | Mdanish777/Programmers-Community | b5ca9582fc1cd4337baa7077ff62130a1052583f | [
"MIT"
] | 383 | 2019-09-30T19:32:07.000Z | 2022-03-24T16:18:26.000Z | #include <stdio.h>
void main()
{
int n, c, d, position, swap;
printf("Enter number of elements\n");
scanf("%d", &n);
int array[n];
printf("Enter %d integers\n", n);
for (c = 0; c < n; c++)
scanf("%d", &array[c]);
for (c = 0; c < (n - 1); c++) {
position = c;
for (d ... | 23.433333 | 48 | 0.42532 | Mdanish777 |
dd45fb34e2674257c2cc5f5bb9b285324a86752b | 2,562 | cc | C++ | tests&old_stuff/old tests/learning by doing/cache - Copy.cc | reiss-josh/RESTful_memcache | 40a21020cd3830c9e11b075039cb7a3b760ac0ad | [
"MIT"
] | 1 | 2019-05-02T21:47:15.000Z | 2019-05-02T21:47:15.000Z | tests&old_stuff/old tests/learning by doing/cache - Copy.cc | reiss-josh/RESTful_memcache | 40a21020cd3830c9e11b075039cb7a3b760ac0ad | [
"MIT"
] | null | null | null | tests&old_stuff/old tests/learning by doing/cache - Copy.cc | reiss-josh/RESTful_memcache | 40a21020cd3830c9e11b075039cb7a3b760ac0ad | [
"MIT"
] | 1 | 2018-10-08T06:04:44.000Z | 2018-10-08T06:04:44.000Z | #include <cache.hh>
#include <iostream>
struct Cache::Impl {
private:
index_type memused_;
evictor_type evictor_;
hash_func hasher_;
index_type maxmem_;
public:
/*Impl(index_type maxmem, evictor_type evictor, hash_func hasher)
: maxmem_(maxmem), evictor_(evictor), hasher_(hasher), memused_(0)
{
}
~Impl() = ... | 22.875 | 78 | 0.703357 | reiss-josh |
dd493e03d27603d239c22a07eed05f382237c86c | 2,357 | hpp | C++ | queue.hpp | praktikum-tiunpad-2021/tugas-08a-AriqHakim | 8e0fdb0e61830928704aeb4756c8fc4413674e1a | [
"MIT"
] | null | null | null | queue.hpp | praktikum-tiunpad-2021/tugas-08a-AriqHakim | 8e0fdb0e61830928704aeb4756c8fc4413674e1a | [
"MIT"
] | null | null | null | queue.hpp | praktikum-tiunpad-2021/tugas-08a-AriqHakim | 8e0fdb0e61830928704aeb4756c8fc4413674e1a | [
"MIT"
] | null | null | null | #pragma once
namespace strukdat {
namespace priority_queue {
/**
* @brief Implementasi struct untuk elemen, harus ada isi dan prioritas elemen.
*/
template <typename T>
struct Element {
T data;
int priority;
Element* next;
};
template <typename T>
using ElementPtr = Element<T> *;
/**
* @brief implemetasi ... | 20.318966 | 79 | 0.600764 | praktikum-tiunpad-2021 |
dd4ae2fa9c0df7f6751425513850d2c7902b79c7 | 421 | hpp | C++ | include/aw/util/filesystem/filesystem.hpp | AlexAUT/awEngine | 8db7840da71d608de82adc543f71024775c68f22 | [
"MIT"
] | null | null | null | include/aw/util/filesystem/filesystem.hpp | AlexAUT/awEngine | 8db7840da71d608de82adc543f71024775c68f22 | [
"MIT"
] | null | null | null | include/aw/util/filesystem/filesystem.hpp | AlexAUT/awEngine | 8db7840da71d608de82adc543f71024775c68f22 | [
"MIT"
] | null | null | null | #pragma once
#include <aw/config.hpp>
#ifdef AW_OS_ANDROID
#elif defined(__cplusplus) && __cplusplus >= 201703L
#define GHC_USE_STD_FS
#elif defined(__has_include)
#if __has_include(<filesystem>)
#define GHC_USE_STD_FS
#endif
#endif
#ifdef GHC_USE_STD_FS
#include <filesystem>
namespace aw {
namespace fs = std::files... | 16.84 | 52 | 0.767221 | AlexAUT |
dd4ddd14179dfe96aa5ca2bc3accf6a696a6dfe9 | 760 | cpp | C++ | OOP Lab/Lab1/L3.cpp | shashikant-sk/Jab-sab-aapki-le-rahe-ho-tab-aap-bhi-kuch-lelo | 9ce333be44081d09e88418572a89770db1d10a50 | [
"MIT"
] | 4 | 2021-09-14T20:12:12.000Z | 2022-02-08T10:32:22.000Z | OOP Lab/Lab1/L3.cpp | shashikant-sk/Jab-sab-aapki-le-rahe-ho-tab-aap-bhi-kuch-lelo | 9ce333be44081d09e88418572a89770db1d10a50 | [
"MIT"
] | null | null | null | OOP Lab/Lab1/L3.cpp | shashikant-sk/Jab-sab-aapki-le-rahe-ho-tab-aap-bhi-kuch-lelo | 9ce333be44081d09e88418572a89770db1d10a50 | [
"MIT"
] | 3 | 2021-09-10T14:08:12.000Z | 2021-09-18T10:52:09.000Z | //Write a program to find out all roots of a quadratic equation
#include<iostream>
#include<math.h>
using namespace std;
int main(){
float a,b,c;
cout<<"Enter a,b,c of quadratic equation: ";
cin>>a>>b>>c;
float D = (b*b) - (4*a*c);
if(D==0){
float root = (-b)/(2*a);
co... | 28.148148 | 100 | 0.467105 | shashikant-sk |
dd503caeea9f9555eddb7792aff802ffbc2d58b3 | 2,516 | cpp | C++ | mainthread.cpp | ek0/binaryninja-api | d9661f34eec6855d495a10eaafc2a8e2679756a7 | [
"MIT"
] | 589 | 2016-04-11T11:32:33.000Z | 2022-03-30T09:49:37.000Z | mainthread.cpp | ek0/binaryninja-api | d9661f34eec6855d495a10eaafc2a8e2679756a7 | [
"MIT"
] | 2,744 | 2016-04-11T02:47:37.000Z | 2022-03-31T21:05:09.000Z | mainthread.cpp | ek0/binaryninja-api | d9661f34eec6855d495a10eaafc2a8e2679756a7 | [
"MIT"
] | 178 | 2016-04-15T00:47:05.000Z | 2022-03-24T10:42:54.000Z | #include "binaryninjaapi.h"
using namespace BinaryNinja;
using namespace std;
struct MainThreadActionContext
{
function<void()> action;
exception_ptr exception;
};
MainThreadAction::MainThreadAction(BNMainThreadAction* action)
{
m_object = action;
}
void MainThreadAction::Execute()
{
BNExecuteMainThreadActio... | 20.793388 | 107 | 0.75318 | ek0 |
dd506a0fa0bac06cc2667e0cb814f0f8d55a42fa | 4,039 | cpp | C++ | src/GeneralSettingsPage.cpp | lingnand/Helium | d1f8fab6eb5d60e35b3287f6ea35cd1fae71f816 | [
"BSD-3-Clause"
] | 8 | 2021-04-16T02:05:54.000Z | 2022-03-16T13:56:23.000Z | src/GeneralSettingsPage.cpp | lingnand/Helium | d1f8fab6eb5d60e35b3287f6ea35cd1fae71f816 | [
"BSD-3-Clause"
] | null | null | null | src/GeneralSettingsPage.cpp | lingnand/Helium | d1f8fab6eb5d60e35b3287f6ea35cd1fae71f816 | [
"BSD-3-Clause"
] | 2 | 2021-04-17T10:49:58.000Z | 2021-07-21T20:39:52.000Z | /*
* GeneralSettingsPage.cpp
*
* Created on: May 25, 2015
* Author: lingnan
*/
#include <bb/cascades/TitleBar>
#include <bb/cascades/Picker>
#include <bb/cascades/Label>
#include <bb/cascades/DropDown>
#include <bb/cascades/Option>
#include <bb/cascades/Divider>
#include <bb/cascades/ScrollView>
#include <b... | 38.103774 | 129 | 0.732359 | lingnand |
dd53cab832213078acd8b3f185a44673d7be4aa8 | 1,213 | cpp | C++ | src/gasdev.cpp | atyre2/HABITAT | bbf231fcfe48cb11b27117266bfc85f427225414 | [
"MIT"
] | null | null | null | src/gasdev.cpp | atyre2/HABITAT | bbf231fcfe48cb11b27117266bfc85f427225414 | [
"MIT"
] | 2 | 2019-03-29T22:15:17.000Z | 2019-03-29T22:15:50.000Z | src/gasdev.cpp | atyre2/HABITAT | bbf231fcfe48cb11b27117266bfc85f427225414 | [
"MIT"
] | null | null | null | #include <math.h>
#include "mt19937.h"
#include "util2019.h"
#include "gasdev.h"
//---------------------------------------------------------------------------
/* Returns a normally distributed deviate with zero mean and unit variance,
using ran1(idum) as the source of uniform deviates. Taken from
numerical recipe... | 25.270833 | 77 | 0.589448 | atyre2 |
dd556662a315aa9661de10e7b4b4c7de564ca14f | 2,239 | cpp | C++ | LeetCode/Daily-Challenge/174. Dungeon Game.cpp | Sowmik23/All-Codes | 212ef0d940fa84624bb2972a257768a830a709a3 | [
"MIT"
] | 5 | 2021-02-14T17:48:21.000Z | 2022-01-24T14:29:44.000Z | LeetCode/Daily-Challenge/174. Dungeon Game.cpp | Sowmik23/All-Codes | 212ef0d940fa84624bb2972a257768a830a709a3 | [
"MIT"
] | null | null | null | LeetCode/Daily-Challenge/174. Dungeon Game.cpp | Sowmik23/All-Codes | 212ef0d940fa84624bb2972a257768a830a709a3 | [
"MIT"
] | null | null | null | class Solution {
public:
int calculateMinimumHP(vector<vector<int>>& dungeon) {
//recursion
// return dp(0, 0, dungeon);
//recursion with memoization :
// vector<vector<int>> memo(dungeon.size()+2, vector<int> (dungeon[0].size()+2, 1e9+5));
// return dpWith... | 29.460526 | 102 | 0.464493 | Sowmik23 |
dd560ca786c1e4570e39164b58b3757dc29a169f | 8,459 | hpp | C++ | include/rabbit/graphics/graphics.hpp | demurzasty/rabb | f980fd18332f7846cd22b502f1075d224938379c | [
"MIT"
] | 8 | 2020-11-21T17:59:09.000Z | 2022-02-13T05:14:40.000Z | include/rabbit/graphics/graphics.hpp | demurzasty/rabb | f980fd18332f7846cd22b502f1075d224938379c | [
"MIT"
] | null | null | null | include/rabbit/graphics/graphics.hpp | demurzasty/rabb | f980fd18332f7846cd22b502f1075d224938379c | [
"MIT"
] | 1 | 2020-11-23T23:01:14.000Z | 2020-11-23T23:01:14.000Z | #pragma once
#include "viewport.hpp"
#include "environment.hpp"
#include "texture.hpp"
#include "material.hpp"
#include "mesh.hpp"
#include "../components/transform.hpp"
#include "../components/camera.hpp"
#include "../components/geometry.hpp"
#include "../components/light.hpp"
#include <memory>
names... | 39.713615 | 202 | 0.747488 | demurzasty |
dd5705828055178481b651080a7b0891c3c7ee86 | 2,458 | cc | C++ | sim/models/sensors/winch_sensor.cc | leozz37/makani | c94d5c2b600b98002f932e80a313a06b9285cc1b | [
"Apache-2.0"
] | 1,178 | 2020-09-10T17:15:42.000Z | 2022-03-31T14:59:35.000Z | sim/models/sensors/winch_sensor.cc | leozz37/makani | c94d5c2b600b98002f932e80a313a06b9285cc1b | [
"Apache-2.0"
] | 1 | 2020-05-22T05:22:35.000Z | 2020-05-22T05:22:35.000Z | sim/models/sensors/winch_sensor.cc | leozz37/makani | c94d5c2b600b98002f932e80a313a06b9285cc1b | [
"Apache-2.0"
] | 107 | 2020-09-10T17:29:30.000Z | 2022-03-18T09:00:14.000Z | // Copyright 2020 Makani Technologies 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 ... | 37.815385 | 79 | 0.718877 | leozz37 |
dd581e2a7cdf51648dd61510b5f7a625d1cf573f | 1,076 | cpp | C++ | games/jungle_chess/impl/jungle_chess.cpp | JacobFischer/Joueur.cpp | 673fce574ca80fb8f02777e610884a1c9808501d | [
"MIT"
] | 1 | 2015-08-09T01:29:34.000Z | 2015-08-09T01:29:34.000Z | games/jungle_chess/impl/jungle_chess.cpp | JacobFischer/Joueur.cpp | 673fce574ca80fb8f02777e610884a1c9808501d | [
"MIT"
] | null | null | null | games/jungle_chess/impl/jungle_chess.cpp | JacobFischer/Joueur.cpp | 673fce574ca80fb8f02777e610884a1c9808501d | [
"MIT"
] | null | null | null | // DO NOT MODIFY THIS FILE
// Never try to directly create an instance of this class, or modify its member variables.
// This contains implementation details, written by code, and only useful to code
#include "jungle_chess.hpp"
#include "../../../joueur/src/register.hpp"
#include "../../../joueur/src/exceptions.hpp"
... | 25.619048 | 94 | 0.67658 | JacobFischer |
dd5e1f27d44631899cafacce67caed504fb553c3 | 1,034 | cpp | C++ | USACO/Star League/Advanced Greedy Methods/job/sol.cpp | hardik0899/Competitive_Programming | 199039ad7a26a5f48152fe231a9ca5ac8685a707 | [
"MIT"
] | 1 | 2020-10-16T18:14:30.000Z | 2020-10-16T18:14:30.000Z | USACO/Star League/Advanced Greedy Methods/job/sol.cpp | hardik0899/Competitive_Programming | 199039ad7a26a5f48152fe231a9ca5ac8685a707 | [
"MIT"
] | null | null | null | USACO/Star League/Advanced Greedy Methods/job/sol.cpp | hardik0899/Competitive_Programming | 199039ad7a26a5f48152fe231a9ca5ac8685a707 | [
"MIT"
] | 1 | 2021-01-06T04:45:38.000Z | 2021-01-06T04:45:38.000Z | #define __USE_MINGW_ANSI_STDIO 0
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <string.h>
#include <math.h>
using namespace std;
#define PI 3.141592653589793
#define epsilon 0.000000001
#define... | 24.046512 | 83 | 0.599613 | hardik0899 |
e57b35cd99acac58fcd73cc73f21a74700c4d32b | 26,109 | cpp | C++ | src/pmp/algorithms/SurfaceRemeshing.cpp | choyfung/pmp-library | 4a72c918494dac92f5e77545b71c7a327dafe71e | [
"BSD-3-Clause"
] | 1 | 2020-05-21T04:15:44.000Z | 2020-05-21T04:15:44.000Z | src/pmp/algorithms/SurfaceRemeshing.cpp | choyfung/pmp-library | 4a72c918494dac92f5e77545b71c7a327dafe71e | [
"BSD-3-Clause"
] | null | null | null | src/pmp/algorithms/SurfaceRemeshing.cpp | choyfung/pmp-library | 4a72c918494dac92f5e77545b71c7a327dafe71e | [
"BSD-3-Clause"
] | 1 | 2020-05-21T04:15:52.000Z | 2020-05-21T04:15:52.000Z | //=============================================================================
// Copyright (C) 2011-2018 The pmp-library developers
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source ... | 30.608441 | 87 | 0.423724 | choyfung |
e57d51693282e2a2a352ae9e8b9c07fe816cb123 | 1,889 | cpp | C++ | src/earconverter.cpp | jodavaho/earth_coords | f964f5e85749eb3a0ab5170bd6b15a871ecf6b27 | [
"MIT"
] | null | null | null | src/earconverter.cpp | jodavaho/earth_coords | f964f5e85749eb3a0ab5170bd6b15a871ecf6b27 | [
"MIT"
] | null | null | null | src/earconverter.cpp | jodavaho/earth_coords | f964f5e85749eb3a0ab5170bd6b15a871ecf6b27 | [
"MIT"
] | null | null | null | /*
* earconverter.cpp
*
* Created on: Mar 26, 2011
* Author: joshua
*/
#include <EarthCoords/EarthCoords.h>
#include <stdio.h>
#include <stdlib.h>
using namespace RSN;
int main(int argc, char** argv){
if (argc==1){
}
EarthCoords e;
double x,y;
for (int i=1;i<argc;i+=2){
if (strcmp("-h",argv[i])==0)... | 25.527027 | 53 | 0.60667 | jodavaho |
e5846face9519c23698aeeb42216472056044df9 | 3,017 | cpp | C++ | readers_writers.cpp | ranisalt/threading-examples | bd4a98274065e101e180f8c09762ce238437f55a | [
"MIT"
] | 1 | 2015-06-10T12:18:09.000Z | 2015-06-10T12:18:09.000Z | readers_writers.cpp | ranisalt/threading-examples | bd4a98274065e101e180f8c09762ce238437f55a | [
"MIT"
] | null | null | null | readers_writers.cpp | ranisalt/threading-examples | bd4a98274065e101e180f8c09762ce238437f55a | [
"MIT"
] | null | null | null | #include <chrono>
#include <iostream>
#include <mutex>
#include <queue>
#include <random>
#include <thread>
#include <vector>
#include "semaphore.h"
using ms = std::chrono::milliseconds;
using unique_lock = std::unique_lock<std::mutex>;
using resource_type = int;
const int buffer_size = 1;
const int iterations = 10;
c... | 24.136 | 92 | 0.660921 | ranisalt |
e5850b7263726a37883048cf9a3da01eadbd12e0 | 1,375 | cpp | C++ | exercises/exercise-1.cpp | mithi/relearning_cpp | 6e54cb67ad8294ef6a78e96e08cbe1b56484e5b5 | [
"Unlicense"
] | 130 | 2017-06-05T23:35:01.000Z | 2021-12-17T07:57:36.000Z | exercises/exercise-1.cpp | mithi/relearning_cpp | 6e54cb67ad8294ef6a78e96e08cbe1b56484e5b5 | [
"Unlicense"
] | null | null | null | exercises/exercise-1.cpp | mithi/relearning_cpp | 6e54cb67ad8294ef6a78e96e08cbe1b56484e5b5 | [
"Unlicense"
] | 46 | 2017-06-13T07:44:54.000Z | 2021-01-06T11:05:56.000Z | /**
Add two numbers
You are given two non-empty linked lists representing two non-negative integers.
The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the num... | 26.960784 | 138 | 0.483636 | mithi |
e585a602837d0026215acd3613baf037690a2eba | 15,276 | cc | C++ | util.cc | jkominek/fdbfs | 0a347cc63f99428ff37348486a29b11ea13d9292 | [
"0BSD"
] | 12 | 2019-09-11T09:32:31.000Z | 2022-01-14T05:26:38.000Z | util.cc | jkominek/fdbfs | 0a347cc63f99428ff37348486a29b11ea13d9292 | [
"0BSD"
] | 18 | 2019-12-17T22:32:01.000Z | 2022-03-14T06:03:15.000Z | util.cc | jkominek/fdbfs | 0a347cc63f99428ff37348486a29b11ea13d9292 | [
"0BSD"
] | null | null | null | #include "util.h"
#include <strings.h>
#include <stdio.h>
#include <time.h>
#include <ctype.h>
#ifdef LZ4_BLOCK_COMPRESSION
#include <lz4.h>
#endif
#ifdef ZSTD_BLOCK_COMPRESSION
#include <zstd.h>
#endif
#include "values.pb.h"
struct fdbfs_filehandle **extract_fdbfs_filehandle(struct fuse_file_info *fi)
{
static_... | 30.613226 | 108 | 0.661364 | jkominek |
e5870aeafd1ec110394b6da4a5100249254e5468 | 3,513 | hpp | C++ | inc/Alphabet.hpp | esaliya/lbl.pisa | 1846075d84021303f3971534b0ea830845b0cb9e | [
"BSD-3-Clause-LBNL"
] | 4 | 2020-08-19T17:48:00.000Z | 2021-06-17T14:39:48.000Z | inc/Alphabet.hpp | esaliya/lbl.pisa | 1846075d84021303f3971534b0ea830845b0cb9e | [
"BSD-3-Clause-LBNL"
] | 4 | 2020-08-14T16:43:20.000Z | 2020-08-21T01:03:01.000Z | inc/Alphabet.hpp | PASSIONLab/PASTIS | 1846075d84021303f3971534b0ea830845b0cb9e | [
"BSD-3-Clause-LBNL"
] | null | null | null | // Created by Saliya Ekanayake on 1/22/19.
#pragma once
#include <cstring>
#include <string>
namespace
pastis
{
class
Alphabet
{
public:
enum type {PROTEIN, DNA};
static const unsigned short capacity = 128;
std::string letters;
unsigned short size;
unsigned short max_char;
unsigned char char_... | 15.683036 | 71 | 0.568745 | esaliya |
e58b0e4981e854b2a38992b0e1c156da04817a83 | 2,803 | cpp | C++ | OcularCore/src/Math/Random/CMWC.cpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 8 | 2017-01-27T01:06:06.000Z | 2020-11-05T20:23:19.000Z | OcularCore/src/Math/Random/CMWC.cpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 39 | 2016-06-03T02:00:36.000Z | 2017-03-19T17:47:39.000Z | OcularCore/src/Math/Random/CMWC.cpp | ssell/OcularEngine | c80cc4fcdb7dd7ce48d3af330bd33d05312076b1 | [
"Apache-2.0"
] | 4 | 2019-05-22T09:13:36.000Z | 2020-12-01T03:17:45.000Z | /**
* Copyright 2014-2017 Steven T Sell (ssell@vertexfragment.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 requir... | 32.218391 | 92 | 0.351052 | ssell |
e594c6bd1791ab9cfa85cc1d3048a843e94cfb06 | 4,785 | hpp | C++ | src/layer/common/element_op_layer-inl.hpp | pl8787/textnet-release | c85a4162c55b4cfe22eab6f8f0c8b615854f9b8f | [
"Apache-2.0"
] | 114 | 2017-06-14T07:05:31.000Z | 2021-06-13T05:30:49.000Z | src/layer/common/element_op_layer-inl.hpp | pl8787/textnet-release | c85a4162c55b4cfe22eab6f8f0c8b615854f9b8f | [
"Apache-2.0"
] | 7 | 2017-11-17T08:16:55.000Z | 2019-10-05T00:09:20.000Z | src/layer/common/element_op_layer-inl.hpp | pl8787/textnet-release | c85a4162c55b4cfe22eab6f8f0c8b615854f9b8f | [
"Apache-2.0"
] | 40 | 2017-06-15T03:21:10.000Z | 2021-10-31T15:03:30.000Z | #ifndef TEXTNET_LAYER_ELEMENT_OP_LAYER_INL_HPP_
#define TEXTNET_LAYER_ELEMENT_OP_LAYER_INL_HPP_
#include <mshadow/tensor.h>
#include "../layer.h"
#include "../op.h"
#include "../../utils/utils.h"
namespace textnet {
namespace layer {
// this layer elem-wise products bottom representations on the last 2 dimensions
te... | 34.673913 | 100 | 0.617555 | pl8787 |
e5966c7d7338e04d4f35ac22fbc1ffb55193646b | 5,159 | hpp | C++ | lib/include/interlinck/Core/Syntax/SyntaxVariant.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | null | null | null | lib/include/interlinck/Core/Syntax/SyntaxVariant.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | 50 | 2021-06-30T20:01:50.000Z | 2021-11-28T16:21:26.000Z | lib/include/interlinck/Core/Syntax/SyntaxVariant.hpp | henrikfroehling/polyglot | 955fb37c2f54ebbaf933c16bf9e0e4bcca8a4142 | [
"MIT"
] | null | null | null | #ifndef INTERLINCK_CORE_SYNTAX_SYNTAXVARIANT_H
#define INTERLINCK_CORE_SYNTAX_SYNTAXVARIANT_H
#include <cassert>
#include <bitset>
#include "interlinck/interlinck_global.hpp"
namespace interlinck::Core::Syntax
{
class ISyntaxNode;
class ISyntaxToken;
class ISyntaxTrivia;
namespace _detail
{
constexpr std::bitset<4... | 35.826389 | 110 | 0.680364 | henrikfroehling |
e5a369b4ae18d3d951e5b1a3df8be196edd99fae | 11,443 | cpp | C++ | src/mesh.cpp | ddrevicky/cpu-renderer | 445e467377558e9a42bd32feac74c517e55e60be | [
"MIT"
] | 4 | 2019-03-18T18:44:02.000Z | 2022-01-17T17:16:51.000Z | src/mesh.cpp | ddrevicky/cpu-renderer | 445e467377558e9a42bd32feac74c517e55e60be | [
"MIT"
] | null | null | null | src/mesh.cpp | ddrevicky/cpu-renderer | 445e467377558e9a42bd32feac74c517e55e60be | [
"MIT"
] | 1 | 2019-03-18T18:44:22.000Z | 2019-03-18T18:44:22.000Z | #include "mesh.h"
#include "common.h"
#include "bunny.h"
using glm::normalize;
using glm::vec2;
using glm::vec3;
using glm::vec4;
#define PI 3.14159265358979323846264338327950f
Mesh UtilMesh::MakeBunnyMesh()
{
Mesh mesh = {};
mesh.isTexturable = false;
mesh.vertexCount = 0;
mesh.vertices = (Vertex *)malloc(2092 ... | 37.273616 | 138 | 0.585336 | ddrevicky |
e5a84db9398a6bf76a10ad164e6178be4083fc2d | 147 | cpp | C++ | src/Containers/MinimalContainers/ConstantSizeMatrix.cpp | djstaros/qmcpack | 280f67e638bae280448b47fa618f05b848c530d2 | [
"NCSA"
] | null | null | null | src/Containers/MinimalContainers/ConstantSizeMatrix.cpp | djstaros/qmcpack | 280f67e638bae280448b47fa618f05b848c530d2 | [
"NCSA"
] | 11 | 2020-05-09T20:57:21.000Z | 2020-06-10T00:00:17.000Z | src/Containers/MinimalContainers/ConstantSizeMatrix.cpp | djstaros/qmcpack | 280f67e638bae280448b47fa618f05b848c530d2 | [
"NCSA"
] | null | null | null |
#include "ConstantSizeMatrix.hpp"
namespace qmcplusplus
{
template class ConstantSizeMatrix<float>;
template class ConstantSizeMatrix<double>;
}
| 16.333333 | 42 | 0.823129 | djstaros |
e5aaeca79a571acefdb4e26a65da167153685c47 | 1,968 | cpp | C++ | code archive/CF/734E.cpp | brianbbsu/program | c4505f2b8c0b91010e157db914a63c49638516bc | [
"MIT"
] | 4 | 2018-04-08T08:07:58.000Z | 2021-06-07T14:55:24.000Z | code archive/CF/734E.cpp | brianbbsu/program | c4505f2b8c0b91010e157db914a63c49638516bc | [
"MIT"
] | null | null | null | code archive/CF/734E.cpp | brianbbsu/program | c4505f2b8c0b91010e157db914a63c49638516bc | [
"MIT"
] | 1 | 2018-10-29T12:37:25.000Z | 2018-10-29T12:37:25.000Z | //{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef bri... | 24.296296 | 123 | 0.57876 | brianbbsu |
e5adb9ceed8b97daf62b23a84f53f6e01f287334 | 479 | cpp | C++ | question_solution/first_time/1027.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | 1 | 2020-09-24T13:35:45.000Z | 2020-09-24T13:35:45.000Z | question_solution/first_time/1027.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | null | null | null | question_solution/first_time/1027.cpp | xiaoland/CaiojSolution | a12c505235d70b414071ea894fa72cddbcfabc6d | [
"Apache-2.0"
] | null | null | null | #include <cstdio>
int a[110], len, s;
int pd(int x) {
len = 0;
int d= x;
while(x>0) {
len++;
a[len] = x%10;
x = x/10;
}
for(int i = 1;i<=len;i++) {
s= 0;
s = s + a[i]*a[i]*a[i];
}
if(s == d) {
return 0;
}
else {
return 1;
}
... | 15.966667 | 31 | 0.323591 | xiaoland |
e5aef649a03bb14be46c75d5a62ca98388714c65 | 431 | cc | C++ | examples/google-code-jam/BryceSandlund/Brattleship.cc | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | examples/google-code-jam/BryceSandlund/Brattleship.cc | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | examples/google-code-jam/BryceSandlund/Brattleship.cc | rbenic-fer/progauthfp | d0fd96c31ab0aab1a9acdcb7c75f2b430f51c675 | [
"MIT"
] | null | null | null | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
int main() {
ll T;
cin >> T;
for (ll cs = 1; cs <= T; ++cs) {
ll R, C, W;
cin >> R >> C >> W;
ll moves = (C / W) * R;
if (C % W == 0) {
moves += W-1;
}
el... | 15.392857 | 48 | 0.37819 | rbenic-fer |
e5b421b796abba481ae71cd45ba2c0d4d745a0fa | 318 | hpp | C++ | TGEngine/TGEngine.hpp | ThePixly/TGEngine | aff5d5f42c3094dcc37253f4a3f5e09db560a4eb | [
"Apache-2.0"
] | null | null | null | TGEngine/TGEngine.hpp | ThePixly/TGEngine | aff5d5f42c3094dcc37253f4a3f5e09db560a4eb | [
"Apache-2.0"
] | null | null | null | TGEngine/TGEngine.hpp | ThePixly/TGEngine | aff5d5f42c3094dcc37253f4a3f5e09db560a4eb | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "Stdbase.hpp"
#include "App.hpp"
#include "pipeline/Pipeline.hpp"
#include "pipeline/Draw.hpp"
#include "game_content/Actor.hpp"
#include "game_content/Light.hpp"
#include "ui/UI.hpp"
SINCE(0, 0, 1)
void initTGEngine(Window* window, void(*draw)(IndexBuffer*, VertexBuffer*), void(*init)(void)); | 26.5 | 95 | 0.738994 | ThePixly |
e5bb03bacfe29c4c281d494bc99258f2a9f09872 | 1,253 | hpp | C++ | source/ashes/renderer/GlRenderer/Enum/GlQueryType.hpp | DragonJoker/Ashes | a6ed950b3fd8fb9626c60b4291fbd52ea75ac66e | [
"MIT"
] | 227 | 2018-09-17T16:03:35.000Z | 2022-03-19T02:02:45.000Z | source/ashes/renderer/GlRenderer/Enum/GlQueryType.hpp | DragonJoker/RendererLib | 0f8ad8edec1b0929ebd10247d3dd0a9ee8f8c91a | [
"MIT"
] | 39 | 2018-02-06T22:22:24.000Z | 2018-08-29T07:11:06.000Z | source/ashes/renderer/GlRenderer/Enum/GlQueryType.hpp | DragonJoker/Ashes | a6ed950b3fd8fb9626c60b4291fbd52ea75ac66e | [
"MIT"
] | 8 | 2019-05-04T10:33:32.000Z | 2021-04-05T13:19:27.000Z | /*
This file belongs to Ashes.
See LICENSE file in root folder
*/
#pragma once
#include <vector>
namespace ashes::gl
{
enum GlQueryType
: GLenum
{
GL_QUERY_TYPE_SAMPLES_PASSED = 0x8914,
GL_QUERY_TYPE_PRIMITIVES_GENERATED = 0x8C87,
GL_QUERY_TYPE_TIMESTAMP = 0x8E28,
GL_QUERY_TYPE_VERTICES_SUBMITTED = 0x82EE... | 29.833333 | 81 | 0.797287 | DragonJoker |
e5bd0aeccad85113305da537440d3b1f5ae4cd0e | 854 | cpp | C++ | C-Plus-Plus/stack/nextSmallestToRight.cpp | zhcet19/NeoAlgo-1 | c534a23307109280bda0e4867d6e8e490002a4ee | [
"MIT"
] | 8 | 2021-06-07T08:10:47.000Z | 2021-10-12T05:56:50.000Z | C-Plus-Plus/stack/nextSmallestToRight.cpp | zhcet19/NeoAlgo-1 | c534a23307109280bda0e4867d6e8e490002a4ee | [
"MIT"
] | 8 | 2021-03-17T11:21:14.000Z | 2021-06-14T00:57:23.000Z | C-Plus-Plus/stack/nextSmallestToRight.cpp | zhcet19/NeoAlgo-1 | c534a23307109280bda0e4867d6e8e490002a4ee | [
"MIT"
] | 5 | 2020-07-11T14:33:33.000Z | 2021-03-01T19:41:43.000Z | /*
Next Smallest Element to the right using stacks in C++
ALGORITHM:
* Use stack to find out the next smallest element of each element in the array
*/
#include <bits/stdc++.h>
using namespace std;
void nextSmallestElement(int a[], int n)
{
stack<int> s;
s.push(a[0]);
for (int i = 1; i < n; i++)
{
... | 17.428571 | 78 | 0.451991 | zhcet19 |
e5be320567ef32a0d2335e55d64601e871f424d5 | 3,101 | cpp | C++ | src/sysCommon/controller.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | 27 | 2021-09-28T00:33:11.000Z | 2021-11-18T19:38:40.000Z | src/sysCommon/controller.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | null | null | null | src/sysCommon/controller.cpp | doldecomp/pikmin | 8c8c20721ecb2a19af8e50a4bdebdba90c9a27ed | [
"Unlicense"
] | null | null | null | #include "types.h"
/*
* --INFO--
* Address: ........
* Size: 00009C
*/
void _Error(char*, ...)
{
// UNUSED FUNCTION
}
/*
* --INFO--
* Address: ........
* Size: 0000F4
*/
void _Print(char*, ...)
{
// UNUSED FUNCTION
}
struct Controller {
u8 unknown00[0x20];
u32 _20;
u32 _24;
u32 _28;
u32 _2C;
u32 _30;... | 14.159817 | 74 | 0.537891 | doldecomp |
e5c03082b68d39e51789eef9b772f44eecc96c0c | 12,068 | hpp | C++ | join/network/include/join/protocol.hpp | mrabine/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | 1 | 2021-09-14T13:53:07.000Z | 2021-09-14T13:53:07.000Z | join/network/include/join/protocol.hpp | joinframework/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | 15 | 2021-08-09T23:55:02.000Z | 2021-11-22T11:05:41.000Z | join/network/include/join/protocol.hpp | mrabine/join | 63c6193f2cc229328c36748d7f9ef8aca915bec3 | [
"MIT"
] | null | null | null | /**
* MIT License
*
* Copyright (c) 2021 Mathieu Rabine
*
* 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, ... | 25.896996 | 81 | 0.545409 | mrabine |
e5c208de8521f1f39ff879baf31058d17db8e27c | 3,757 | cpp | C++ | board.cpp | marifdemirtas/minesweeper | 4e49692a4af8edf75673d6e53f8dfa5b8c715a8c | [
"MIT"
] | null | null | null | board.cpp | marifdemirtas/minesweeper | 4e49692a4af8edf75673d6e53f8dfa5b8c715a8c | [
"MIT"
] | null | null | null | board.cpp | marifdemirtas/minesweeper | 4e49692a4af8edf75673d6e53f8dfa5b8c715a8c | [
"MIT"
] | null | null | null | #include <iostream>
#include "board.h"
using namespace std;
/**
* Constructor
*/
Board::Board(int row_count, int col_count)
{
board = new int*[row_count];
for (int i = 0; i < row_count; i++){
board[i] = new int[col_count];
for (int j = 0; j < col_count; j++){
board[i][j] = 0;
... | 23.929936 | 85 | 0.438914 | marifdemirtas |
e5c31adb458503f997e2f94f17eb12bcf8fc54d7 | 1,692 | cpp | C++ | src/tests/carl-settings/Test_Settings.cpp | sjunges/carl | 5013c31c035990d9912a6265944e7d4add4c378b | [
"MIT"
] | 29 | 2015-05-19T12:17:16.000Z | 2021-03-05T17:53:00.000Z | src/tests/carl-settings/Test_Settings.cpp | sjunges/carl | 5013c31c035990d9912a6265944e7d4add4c378b | [
"MIT"
] | 36 | 2016-10-26T12:47:11.000Z | 2021-03-03T15:19:38.000Z | src/tests/carl-settings/Test_Settings.cpp | sjunges/carl | 5013c31c035990d9912a6265944e7d4add4c378b | [
"MIT"
] | 16 | 2015-05-27T07:35:19.000Z | 2021-03-05T17:53:08.000Z | #include <boost/program_options.hpp>
#include <carl/util/Singleton.h>
#include <carl-settings/settings_utils.h>
#include <carl-settings/Settings.h>
#include <carl-settings/SettingsParser.h>
#include <gtest/gtest.h>
namespace po = boost::program_options;
struct TestSettings {
bool test_bool;
std::string test_string;... | 27.290323 | 101 | 0.710993 | sjunges |
e5c419a7d653dfe41c91447a761faa3235a81f5b | 1,505 | cpp | C++ | VS/Photoshoop/tool.cpp | abel1502/mipt_3s | 10efc85371e53a0780302763c409cde2158f81fc | [
"MIT"
] | 2 | 2021-10-16T10:58:26.000Z | 2021-12-22T22:18:37.000Z | VS/Photoshoop/tool.cpp | abel1502/mipt_3s | 10efc85371e53a0780302763c409cde2158f81fc | [
"MIT"
] | null | null | null | VS/Photoshoop/tool.cpp | abel1502/mipt_3s | 10efc85371e53a0780302763c409cde2158f81fc | [
"MIT"
] | null | null | null | #include <AGF/llgui.h>
#include "app.h"
#include "tool.h"
Tool::Tool(ToolManager *manager_) :
manager(manager_) {}
void Tool::applyLine(Layer &layer, const Vector2d &pos0, const Vector2d &pos1) {
constexpr unsigned NSTEPS = 100;
Vector2d cur = pos0;
const Vector2d step = (pos1 - pos0) / NSTEPS;
... | 21.5 | 120 | 0.645847 | abel1502 |
e5c6aa0df0c94138ef97000c6627cd6ee4f8501d | 1,259 | hpp | C++ | wrapper/stupid_iterator.hpp | TooBiased/growt | 8b6bb4052763351b8799c392f0573da3efdd1e34 | [
"BSD-2-Clause"
] | 79 | 2016-10-13T17:42:53.000Z | 2022-03-10T07:04:03.000Z | wrapper/stupid_iterator.hpp | TooBiased/growt | 8b6bb4052763351b8799c392f0573da3efdd1e34 | [
"BSD-2-Clause"
] | 8 | 2016-10-07T14:03:50.000Z | 2021-06-09T08:09:07.000Z | wrapper/stupid_iterator.hpp | TooBiased/growt | 8b6bb4052763351b8799c392f0573da3efdd1e34 | [
"BSD-2-Clause"
] | 11 | 2018-09-29T11:32:13.000Z | 2022-03-10T07:04:05.000Z | /*******************************************************************************
* wrapper/junction_wrapper.h
*
* Wrapper to use junction's junction::ConcurrentMap_... in our benchmarks
* use #define JUNCTION_TYPE junction::ConcurrentMap_Leapfrog to chose the table
*
* Part of Project growt - https://github.com/T... | 27.369565 | 80 | 0.559174 | TooBiased |
e5c717fff21c427d9df41750f33789951afb75cb | 4,427 | cpp | C++ | src/serial_port.cpp | NaokiTakahashi12/wit901c_rs485 | a78e724145e9f8267d60f17336b5f69296529fa9 | [
"MIT"
] | null | null | null | src/serial_port.cpp | NaokiTakahashi12/wit901c_rs485 | a78e724145e9f8267d60f17336b5f69296529fa9 | [
"MIT"
] | null | null | null | src/serial_port.cpp | NaokiTakahashi12/wit901c_rs485 | a78e724145e9f8267d60f17336b5f69296529fa9 | [
"MIT"
] | null | null | null |
#include <wit901c_rs485/serial_port.hpp>
#include <thread>
#include <chrono>
#include <Eigen/Dense>
#include <boost/system/error_code.hpp>
#include <boost/asio/io_service.hpp>
#include <boost/asio/serial_port.hpp>
#include <boost/asio/read.hpp>
#include <boost/asio/write.hpp>
namespace wit901c_rs485 {
class Se... | 31.621429 | 114 | 0.510052 | NaokiTakahashi12 |
e5c9444cde58149a53a5b2afd4155a8f065c0f25 | 707 | cpp | C++ | Baekjoon/13023.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | Baekjoon/13023.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | Baekjoon/13023.cpp | Twinparadox/AlgorithmProblem | 0190d17555306600cfd439ad5d02a77e663c9a4e | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int> > adj;
vector<bool> check;
int N, M, flag = 0;
void dfs(int cur, int cnt)
{
if (cnt == 4)
{
flag = 1;
return;
}
check[cur] = true;
int size = adj[cur].size();
for (int i = 0; i < size; i++)
{
int next = adj[cur][i];
if (!check... | 14.428571 | 34 | 0.547383 | Twinparadox |
e5cc69cf227ff8704d8a5b1c6cb349303015ec80 | 1,158 | cc | C++ | ui/message_center/views/notification_view_util.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 14,668 | 2015-01-01T01:57:10.000Z | 2022-03-31T23:33:32.000Z | ui/message_center/views/notification_view_util.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 86 | 2015-10-21T13:02:42.000Z | 2022-03-14T07:50:50.000Z | ui/message_center/views/notification_view_util.cc | zealoussnow/chromium | fd8a8914ca0183f0add65ae55f04e287543c7d4a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 5,941 | 2015-01-02T11:32:21.000Z | 2022-03-31T16:35:46.000Z | // Copyright 2021 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/events/event.h"
#include "ui/views/view.h"
namespace message_center {
namespace notification_view_util {
std::unique_ptr<ui::Event> Convert... | 35.090909 | 79 | 0.708117 | zealoussnow |
e5d5e5f4b98658eac0cf2f141408f4f74f8db09a | 435 | cpp | C++ | src/OneKey/OneKey/HeroTask.cpp | xylsxyls/xueyelingshuan | 61eb1c7c4f76c3eaf4cf26e4b2b37b6ed2abc5b9 | [
"MIT"
] | 3 | 2019-11-26T05:33:47.000Z | 2020-05-18T06:49:41.000Z | src/OneKey/OneKey/HeroTask.cpp | xylsxyls/xueyelingshuan | 61eb1c7c4f76c3eaf4cf26e4b2b37b6ed2abc5b9 | [
"MIT"
] | null | null | null | src/OneKey/OneKey/HeroTask.cpp | xylsxyls/xueyelingshuan | 61eb1c7c4f76c3eaf4cf26e4b2b37b6ed2abc5b9 | [
"MIT"
] | null | null | null | #include "stdafx.h"
#include "HeroTask.h"
#include "CKeyBoard/CKeyboardAPI.h"
#include "D:\\SendToMessageTest.h"
HeroTask::HeroTask():
m_code1(0),
m_code2(0)
{
}
void HeroTask::DoTask()
{
if (m_code1 != 0)
{
CKeyboard::KeyPress(m_code1, 0);
}
if (m_code2 != 0)
{
CKeyboard::KeyPress(m_cod... | 15 | 54 | 0.627586 | xylsxyls |
e5deeaf583cb0b287a2d82b90e3eafae19a07e7f | 25,906 | cpp | C++ | src/base/DICe_FieldEnums.cpp | miniskar/dice | 1a0115a21a5c27af8505bda124d40665223f15aa | [
"MIT"
] | 225 | 2015-12-07T13:13:07.000Z | 2022-03-12T14:48:56.000Z | src/base/DICe_FieldEnums.cpp | zhangkmsjtu/dice | 5a5c85ad8527db68fd4fb2139f0a4a6377668103 | [
"MIT"
] | 244 | 2015-11-23T20:39:16.000Z | 2022-03-24T14:36:59.000Z | src/base/DICe_FieldEnums.cpp | zhangkmsjtu/dice | 5a5c85ad8527db68fd4fb2139f0a4a6377668103 | [
"MIT"
] | 93 | 2016-01-08T09:27:43.000Z | 2022-03-31T11:00:29.000Z | // @HEADER
// ************************************************************************
//
// Digital Image Correlation Engine (DICe)
// Copyright 2021 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
//
// Under the terms of Contract DE-NA0003525 with NTESS,
// the U.S. ... | 65.918575 | 176 | 0.599321 | miniskar |
e5dfd1ad9efbc76565f94871afa3f79f020134bf | 914 | hpp | C++ | src/core/template.hpp | RamchandraApte/OmniTemplate | f150f451871b0ab43ac39a798186278106da1527 | [
"MIT"
] | 14 | 2019-04-23T21:44:12.000Z | 2022-03-04T22:48:59.000Z | src/core/template.hpp | RamchandraApte/OmniTemplate | f150f451871b0ab43ac39a798186278106da1527 | [
"MIT"
] | 3 | 2019-04-25T10:45:32.000Z | 2020-08-05T22:40:39.000Z | src/core/template.hpp | RamchandraApte/OmniTemplate | f150f451871b0ab43ac39a798186278106da1527 | [
"MIT"
] | 1 | 2020-07-16T22:16:33.000Z | 2020-07-16T22:16:33.000Z | #pragma once
#include "algebra/big_integer.hpp"
#include "algebra/fft.hpp"
#include "algebra/linear_algebra.hpp"
#include "algebra/polynomial.hpp"
#include "combinatorics/combinatorics.hpp"
#include "combinatorics/permutation.hpp"
#include "core/all.hpp"
#include "core/main.hpp"
#include "core/time.hpp"
#include "ds/bi... | 28.5625 | 42 | 0.76477 | RamchandraApte |
e5e5d782f8997f6abb05fa918eeacc22f0b285af | 466 | cc | C++ | EE553-CPP/session02/00reviewops.cc | Master-Alcy/StevensCodes | dc33fb2aff0a83f89f291020fd4faa8379034cf1 | [
"MIT"
] | 2 | 2018-11-06T03:15:06.000Z | 2019-03-07T08:11:30.000Z | EE553-CPP/session02/00reviewops.cc | Master-Alcy/StevensCodes | dc33fb2aff0a83f89f291020fd4faa8379034cf1 | [
"MIT"
] | null | null | null | EE553-CPP/session02/00reviewops.cc | Master-Alcy/StevensCodes | dc33fb2aff0a83f89f291020fd4faa8379034cf1 | [
"MIT"
] | 3 | 2019-01-29T21:19:01.000Z | 2020-06-15T01:36:11.000Z | #include <iostream>
using namespace std;
int main() {
int a = 1000 * 1000; // on Arduino, -32768 .. 32767
int b = 15 / 2 * 2;
int c = 3 % 3 * 3;
int d = 2 + 3 * 4;
int e = 15 / (2 * 2);
cout << a << " " << b << " " << c << " " << d << '\n';
// -32768..32767
// 0.. 65535
uint16_t a = 65534 + 2;
}
/*
0 ... | 16.642857 | 55 | 0.396996 | Master-Alcy |
e5e616fd02be5e8e10cf075803b48cd9f62925c1 | 1,423 | hpp | C++ | MtrFirewallPage.hpp | chrisoldwood/UTSvrBrowser | 341d8b09afdcab5a296df6f074cae47c10637f0f | [
"MIT"
] | 3 | 2017-08-17T15:10:43.000Z | 2021-02-27T04:47:49.000Z | MtrFirewallPage.hpp | chrisoldwood/UTSvrBrowser | 341d8b09afdcab5a296df6f074cae47c10637f0f | [
"MIT"
] | null | null | null | MtrFirewallPage.hpp | chrisoldwood/UTSvrBrowser | 341d8b09afdcab5a296df6f074cae47c10637f0f | [
"MIT"
] | null | null | null | /******************************************************************************
** (C) Chris Oldwood
**
** MODULE: MTRFIREWALLPAGE.HPP
** COMPONENT: The Application
** DESCRIPTION: The CMtrFirewallPage class declaration.
**
*******************************************************************************
*/
// Check fo... | 20.623188 | 79 | 0.479269 | chrisoldwood |
e5f049beca1fb78b70071000c1a814969e9b54a8 | 1,881 | cc | C++ | dohboy/src/settings.cc | connectiblutz/dohboy | 78601bf314e77bcb11970f8922cdc67f66857665 | [
"MIT"
] | null | null | null | dohboy/src/settings.cc | connectiblutz/dohboy | 78601bf314e77bcb11970f8922cdc67f66857665 | [
"MIT"
] | null | null | null | dohboy/src/settings.cc | connectiblutz/dohboy | 78601bf314e77bcb11970f8922cdc67f66857665 | [
"MIT"
] | null | null | null | #include "settings.h"
#include <bcl/fileutil.h>
namespace dohboy {
Settings Settings::instance;
void Settings::load(std::string& target, cJSON* config, const std::string& name) {
if (cJSON_HasObjectItem(config, name.c_str())) {
cJSON* tmp = cJSON_GetObjectItem(config, name.c_str());
if (tmp && cJSON_Is... | 32.431034 | 91 | 0.699628 | connectiblutz |
e5f4468cbcdbf312f931dbaf6546bf5c3ce130b0 | 10,144 | cc | C++ | dfs/img_gzfile.cc | jamesyoungman/beebtools | 3780a6f7fba9cdb18e1522720508ecc9a5efd1b6 | [
"Apache-2.0"
] | 4 | 2020-07-17T19:01:59.000Z | 2020-07-19T21:36:41.000Z | dfs/img_gzfile.cc | jamesyoungman/beebtools | 3780a6f7fba9cdb18e1522720508ecc9a5efd1b6 | [
"Apache-2.0"
] | null | null | null | dfs/img_gzfile.cc | jamesyoungman/beebtools | 3780a6f7fba9cdb18e1522720508ecc9a5efd1b6 | [
"Apache-2.0"
] | 1 | 2022-02-19T20:31:29.000Z | 2022-02-19T20:31:29.000Z | //
// Copyright 2020 James Youngman
//
// 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 la... | 31.116564 | 100 | 0.661869 | jamesyoungman |
e5ff3954669165878d3519a94252426233c1c7f7 | 2,248 | cpp | C++ | SkiaRender/skia-lib/src/images/SkImageDecoder_Factory.cpp | isuhao/BaijieCppUILibs | 7771f225d854c69bc129d983cfcb10d672e1eacd | [
"BSD-3-Clause"
] | 10 | 2015-02-16T03:19:55.000Z | 2021-06-16T04:33:37.000Z | src/images/SkImageDecoder_Factory.cpp | blackberry/Skia | a55319dfb35814b1d7be4540646891332eac9727 | [
"Apache-2.0"
] | null | null | null | src/images/SkImageDecoder_Factory.cpp | blackberry/Skia | a55319dfb35814b1d7be4540646891332eac9727 | [
"Apache-2.0"
] | 13 | 2015-02-10T15:02:31.000Z | 2021-05-25T09:29:03.000Z | /* libs/graphics/ports/SkImageDecoder_Factory.cpp
**
** Copyright 2006, The Android Open Source Project
**
** 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/... | 30.378378 | 79 | 0.643683 | isuhao |
f90041863445abfee57d47df573ad988588a894f | 9,677 | cpp | C++ | cmake-build-debug/FakeGLRenderWindowRelease_autogen/EWIEGA46WW/moc_RenderController.cpp | daaiwusheng/Qt_GL_Mac_Clion | 27cda4194a235dd5b32d618bc0119e6616b98248 | [
"MIT"
] | null | null | null | cmake-build-debug/FakeGLRenderWindowRelease_autogen/EWIEGA46WW/moc_RenderController.cpp | daaiwusheng/Qt_GL_Mac_Clion | 27cda4194a235dd5b32d618bc0119e6616b98248 | [
"MIT"
] | null | null | null | cmake-build-debug/FakeGLRenderWindowRelease_autogen/EWIEGA46WW/moc_RenderController.cpp | daaiwusheng/Qt_GL_Mac_Clion | 27cda4194a235dd5b32d618bc0119e6616b98248 | [
"MIT"
] | null | null | null | /****************************************************************************
** Meta object code from reading C++ file 'RenderController.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.15.2)
**
** WARNING! All changes made in this file will be lost!
***************************************************... | 42.818584 | 157 | 0.628397 | daaiwusheng |
f901c2418c65937bb4727d46b735e344b541b490 | 3,976 | cpp | C++ | genetics/shared/geometry/ObjShape.cpp | crest01/ShapeGenetics | 7321f6484be668317ad763c0ca5e4d6cbfef8cd1 | [
"MIT"
] | 18 | 2017-04-26T13:53:43.000Z | 2021-05-29T03:55:27.000Z | genetics/shared/geometry/ObjShape.cpp | crest01/ShapeGenetics | 7321f6484be668317ad763c0ca5e4d6cbfef8cd1 | [
"MIT"
] | null | null | null | genetics/shared/geometry/ObjShape.cpp | crest01/ShapeGenetics | 7321f6484be668317ad763c0ca5e4d6cbfef8cd1 | [
"MIT"
] | 2 | 2017-10-17T10:32:01.000Z | 2019-11-11T07:23:54.000Z | #include "ObjShape.h"
#include <fstream>
#include <iostream>
namespace PGA {
void ObjShape::normalizeShape()
{
if (v.size() == 0) {
return;
}
math::float3 center;
math::float3 min;
math::float3 max;
center = v[0];
min = center;
max = center;
for (int i = 1; i < v.size(); ++i) {
center += v[i];
if (mi... | 20.080808 | 95 | 0.51333 | crest01 |
f902cb652ca50c4e2e10b11c373b547125f16809 | 806 | cxx | C++ | inetsrv/query/setupqry/pch.cxx | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | inetsrv/query/setupqry/pch.cxx | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | inetsrv/query/setupqry/pch.cxx | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | //+-------------------------------------------------------------------------
//
// Microsoft Windows
// Copyright (C) Microsoft Corporation, 1997 - 1998.
//
// File: cnfgreg.hxx
//
// Contents: Precompiled header
//
// History: 09 Jul 1997 mohamedn Created
//
//------------------------... | 20.15 | 77 | 0.511166 | npocmaka |
f902e446e98e7b31e63ee30763abca9fb7640976 | 1,541 | hpp | C++ | src/dam/matrix4f.hpp | delveam/chess | 2c1e8582b73cb59d71e14a50f671d4ccbac34b95 | [
"MIT"
] | null | null | null | src/dam/matrix4f.hpp | delveam/chess | 2c1e8582b73cb59d71e14a50f671d4ccbac34b95 | [
"MIT"
] | 1 | 2021-07-25T15:54:27.000Z | 2021-07-25T15:54:27.000Z | src/dam/matrix4f.hpp | delveam/chess | 2c1e8582b73cb59d71e14a50f671d4ccbac34b95 | [
"MIT"
] | null | null | null | #ifndef DAM_MATRIX4_HPP
#define DAM_MATRIX4_HPP
#include <array>
namespace dam {
class Matrix4F;
}
class dam::Matrix4F {
public:
Matrix4F() = default;
Matrix4F(std::array<float, 16> data) :
m_data(data)
{
}
unsigned int rows() const
{
return m_rows;
}
unsigned int colu... | 28.018182 | 67 | 0.687865 | delveam |
f9059fc7656e2fd4b795effcc2d844a182e305b0 | 1,510 | cpp | C++ | src/main.cpp | saeenyoda/Hash_Table | b014e76c2089a7d4159c1f9ec55442de5ce41511 | [
"MIT",
"Unlicense"
] | null | null | null | src/main.cpp | saeenyoda/Hash_Table | b014e76c2089a7d4159c1f9ec55442de5ce41511 | [
"MIT",
"Unlicense"
] | null | null | null | src/main.cpp | saeenyoda/Hash_Table | b014e76c2089a7d4159c1f9ec55442de5ce41511 | [
"MIT",
"Unlicense"
] | null | null | null | #include "util.h"
int main() {
HashTable<int, File> table(1000);
std::cout << "Welcome to our Repo!\n\n";
int in = 0;
bool flag = false;
while (!flag) {
std::cout << "\n";
menu();
in = input();
system("cls");
switch (in) {
default:
break;
case 1:
load_file(table);
break;
case 2: {
... | 16.413043 | 84 | 0.523179 | saeenyoda |
f907a8a9b57ab0202d85faa7f61207a4dc8d05e7 | 8,268 | hpp | C++ | optionals/arcadian/base/config_sound.hpp | JeffPerk/HavocTeam | 6fb616c41da4baece79ebac941bac72a78c715f9 | [
"MIT"
] | null | null | null | optionals/arcadian/base/config_sound.hpp | JeffPerk/HavocTeam | 6fb616c41da4baece79ebac941bac72a78c715f9 | [
"MIT"
] | 7 | 2021-11-22T04:36:52.000Z | 2021-12-13T18:55:24.000Z | optionals/arcadian/base/config_sound.hpp | JeffPerk/HavocTeam | 6fb616c41da4baece79ebac941bac72a78c715f9 | [
"MIT"
] | null | null | null | attenuationEffectType = "CarAttenuation";
soundGetIn[] = {"A3\Sounds_F\vehicles2\soft\Mrap_01\Mrap_01_Enter", 0.44, 1};
soundGetOut[] = {"A3\Sounds_F\vehicles2\soft\Mrap_01\Mrap_01_Exit", 0.44, 1, 40};
soundDammage[] = {"", 0.56, 1};
insideSoundCoef = 1;
buildCrash0[] = {"A3\Sounds_F\vehicles2\soft\shared\collisions... | 49.214286 | 116 | 0.73851 | JeffPerk |
f9081e05578584029a42cbdd9f3584ac056a9114 | 8,627 | cpp | C++ | MonoNative.Tests/mscorlib/System/Reflection/mscorlib_System_Reflection_AssemblyName_Fixture.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | 7 | 2015-03-10T03:36:16.000Z | 2021-11-05T01:16:58.000Z | MonoNative.Tests/mscorlib/System/Reflection/mscorlib_System_Reflection_AssemblyName_Fixture.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | 1 | 2020-06-23T10:02:33.000Z | 2020-06-24T02:05:47.000Z | MonoNative.Tests/mscorlib/System/Reflection/mscorlib_System_Reflection_AssemblyName_Fixture.cpp | brunolauze/MonoNative | 959fb52c2c1ffe87476ab0d6e4fcce0ad9ce1e66 | [
"BSD-2-Clause"
] | null | null | null | // Mono Native Fixture
// Assembly: mscorlib, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089
// Namespace: System.Reflection
// Name: AssemblyName
// C++ Typed Name: mscorlib::System::Reflection::AssemblyName
#include <gtest/gtest.h>
#include <mscorlib/System/Reflection/mscorlib_System_Reflection_A... | 24.933526 | 150 | 0.722499 | brunolauze |
f9093fcffa403913bba8980d0cc8150d814be5e5 | 1,468 | cpp | C++ | src/main/jni/LandmarkDetector.cpp | oleg-sta/commonLibMask | f43ab54bfc72e64776213cb152434092debd3658 | [
"Apache-2.0"
] | 13 | 2021-02-03T06:39:01.000Z | 2022-03-21T10:06:41.000Z | src/main/jni/LandmarkDetector.cpp | oleg-sta/commonLibMask | f43ab54bfc72e64776213cb152434092debd3658 | [
"Apache-2.0"
] | 4 | 2021-01-08T14:33:15.000Z | 2021-04-25T05:00:22.000Z | app/src/main/jni/LandmarkDetector.cpp | oleg-sta/VrFace | 6d2eb11bb514bdf0b1ce6cab1805da447f9fb640 | [
"Apache-2.0"
] | 4 | 2021-06-22T07:40:15.000Z | 2022-03-18T04:22:04.000Z | #include "LandmarkDetector.h"
//-------------------------------------------------------//
//---------------Constructor & Destructor----------------//
//-------------------------------------------------------//
LandmarkDetector::LandmarkDetector()
{
}
LandmarkDetector::LandmarkDetector(std::string &pathToModel)
{
/... | 26.214286 | 144 | 0.561989 | oleg-sta |
f9094c3ef5ea0a68309c36dc548e878e6a7ea491 | 775 | cpp | C++ | src/GHMetro/GHMetroIAPStoreFactory.cpp | GoldenHammerSoftware/GH | 757213f479c0fc80ed1a0f59972bf3e9d92b7526 | [
"MIT"
] | null | null | null | src/GHMetro/GHMetroIAPStoreFactory.cpp | GoldenHammerSoftware/GH | 757213f479c0fc80ed1a0f59972bf3e9d92b7526 | [
"MIT"
] | null | null | null | src/GHMetro/GHMetroIAPStoreFactory.cpp | GoldenHammerSoftware/GH | 757213f479c0fc80ed1a0f59972bf3e9d92b7526 | [
"MIT"
] | null | null | null | #include "GHMetroIAPStoreFactory.h"
#include "GHMetroIAPStore.h"
#include "GHXMLNode.h"
#include "GHXMLSerializer.h"
GHIAPStore* GHMetroIAPStoreFactory::createIAPStore(const char* configFilename,
const GHXMLSerializer& xmlSerializer) const
{
GHMetroIAPStore* ret = new GHMetroIAPStore;
GHXMLNode* node ... | 31 | 81 | 0.716129 | GoldenHammerSoftware |
f90a157b484bf7553757f731e5729b3c5e23f30e | 961 | cpp | C++ | 737.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 8 | 2018-10-31T11:00:19.000Z | 2020-07-31T05:25:06.000Z | 737.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | null | null | null | 737.cpp | zfang399/LeetCode-Problems | 4cb25718a3d1361569f5ee6fde7b4a9a4fde2186 | [
"MIT"
] | 2 | 2018-05-31T11:29:22.000Z | 2019-09-11T06:34:40.000Z | class Solution {
public:
bool areSentencesSimilarTwo(vector<string>& words1, vector<string>& words2, vector<pair<string, string>> pairs) {
if (words1.size() != words2.size()) return false;
map<string, string> m;
for (int i = 0; i < pairs.size(); i++){
string parent1 = find(m, pai... | 30.03125 | 117 | 0.480749 | zfang399 |
f90ee2953cf8de6346777a82f96500eeeb535f3b | 11,306 | hpp | C++ | include/worker_thread.hpp | cschreib/ice3 | 44aa182543d037863fb7726827e688490ac26275 | [
"MIT"
] | null | null | null | include/worker_thread.hpp | cschreib/ice3 | 44aa182543d037863fb7726827e688490ac26275 | [
"MIT"
] | null | null | null | include/worker_thread.hpp | cschreib/ice3 | 44aa182543d037863fb7726827e688490ac26275 | [
"MIT"
] | null | null | null | #ifndef WORKER_THREAD_HPP
#define WORKER_THREAD_HPP
#include <vector>
#include "lock_free_queue.hpp"
#include "threading_policies.hpp"
#include "worker_thread_fwd.hpp"
#ifdef NO_STD_THREAD
#pragma GCC system_header
#include <boost/thread.hpp>
#include <boost/functional.hpp>
typedef boost::thread thr... | 21.700576 | 91 | 0.549266 | cschreib |
f916270c4928959ea811dbde3b662c0c5f7e23f6 | 988 | hpp | C++ | include/Core/Castor3D/Render/GlobalIllumination/GlobalIlluminationModule.hpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 245 | 2015-10-29T14:31:45.000Z | 2022-03-31T13:04:45.000Z | include/Core/Castor3D/Render/GlobalIllumination/GlobalIlluminationModule.hpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 64 | 2016-03-11T19:45:05.000Z | 2022-03-31T23:58:33.000Z | include/Core/Castor3D/Render/GlobalIllumination/GlobalIlluminationModule.hpp | Mu-L/Castor3D | 7b9c6e7be6f7373ad60c0811d136c0004e50e76b | [
"MIT"
] | 11 | 2018-05-24T09:07:43.000Z | 2022-03-21T21:05:20.000Z | /*
See LICENSE file in root folder
*/
#ifndef ___C3D_GlobalIlluminationModule_H___
#define ___C3D_GlobalIlluminationModule_H___
#include "Castor3D/Render/RenderModule.hpp"
namespace castor3d
{
/**@name Render */
//@{
/**@name Global Illumination */
//@{
/**
*\~english
*\brief
* Enumerator of supported global... | 20.163265 | 66 | 0.733806 | Mu-L |
f916751bd2d5b36248cab4599a8f68b59836351b | 3,021 | cpp | C++ | src/eepp/ui/css/propertyspecification.cpp | jayrulez/eepp | 09c5c1b6b4c0306bb0a188474778c6949b5df3a7 | [
"MIT"
] | 37 | 2020-01-20T06:21:24.000Z | 2022-03-21T17:44:50.000Z | src/eepp/ui/css/propertyspecification.cpp | jayrulez/eepp | 09c5c1b6b4c0306bb0a188474778c6949b5df3a7 | [
"MIT"
] | null | null | null | src/eepp/ui/css/propertyspecification.cpp | jayrulez/eepp | 09c5c1b6b4c0306bb0a188474778c6949b5df3a7 | [
"MIT"
] | 9 | 2019-03-22T00:33:07.000Z | 2022-03-01T01:35:59.000Z | #include <eepp/core/core.hpp>
#include <eepp/system/log.hpp>
#include <eepp/ui/css/propertyspecification.hpp>
namespace EE { namespace UI { namespace CSS {
SINGLETON_DECLARE_IMPLEMENTATION( PropertySpecification )
PropertySpecification::~PropertySpecification() {}
PropertyDefinition& PropertySpecification::register... | 29.910891 | 100 | 0.714995 | jayrulez |
f91c1ebbf48fb01f9e37432b0304a0947b024a07 | 2,435 | cpp | C++ | 00124_binary-tree-maximum-path-sum/200208-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | 6 | 2019-10-23T01:07:29.000Z | 2021-12-05T01:51:16.000Z | 00124_binary-tree-maximum-path-sum/200208-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | null | null | null | 00124_binary-tree-maximum-path-sum/200208-1.cpp | yanlinlin82/leetcode | ddcc0b9606d951cff9c08d1f7dfbc202067c8d65 | [
"MIT"
] | 1 | 2021-12-03T06:54:57.000Z | 2021-12-03T06:54:57.000Z | // https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/
#include <cstdio>
#include <algorithm>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
void release(TreeNode* t)
{
if (t) {
release(t->left);
release(t->r... | 22.136364 | 69 | 0.544969 | yanlinlin82 |
f91d805b7315035dc22746fb046e08442503f6be | 425 | cpp | C++ | CodeForces/841/B - Godsend.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-02-24T06:45:56.000Z | 2018-05-29T04:47:39.000Z | CodeForces/841/B - Godsend.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | null | null | null | CodeForces/841/B - Godsend.cpp | QAQrz/ACM-Code | 7f7b6fd315e7d84ed606dd48d666da07fc4d0ae7 | [
"Unlicense"
] | 2 | 2018-06-28T09:53:27.000Z | 2022-03-23T13:29:57.000Z | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout<<(x)<<endl
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ms(x,y) memset(x,y,sizeof x)
typedef long long LL;
const LL mod=1e9+7,inf=0x3f3f3f3f,maxn=1123456;
LL n,sum,a,flag;
int main(){
ios::sync_with_stdio(false);
cin>>n;
for(int i=... | 20.238095 | 47 | 0.64 | QAQrz |
f91f517680e5e0dd53b2e3c058af5eac2a6b3ee0 | 1,120 | cpp | C++ | src/QtFuzzy/nFuzzySNormFactory.cpp | Vladimir-Lin/QtFuzzy | 185869384f3ce9d3a801080b675bae8ed6c5fb12 | [
"MIT"
] | null | null | null | src/QtFuzzy/nFuzzySNormFactory.cpp | Vladimir-Lin/QtFuzzy | 185869384f3ce9d3a801080b675bae8ed6c5fb12 | [
"MIT"
] | null | null | null | src/QtFuzzy/nFuzzySNormFactory.cpp | Vladimir-Lin/QtFuzzy | 185869384f3ce9d3a801080b675bae8ed6c5fb12 | [
"MIT"
] | null | null | null | #include <qtfuzzy.h>
N::Fuzzy::SNormFactory:: SNormFactory(void)
{
}
N::Fuzzy::SNormFactory::~SNormFactory(void)
{
}
N::Fuzzy::SNorm * N::Fuzzy::SNormFactory::create(const QString & zName) const
{
#define FSNF(CN) if (zName==CN().className()) return new CN()
FSNF ( Maximum ) ;
FSNF ( AlgebraicSum ) ;
... | 28.717949 | 77 | 0.475893 | Vladimir-Lin |
f924ed633381bcc5babc06e4f9d3f332bad627b2 | 2,686 | hh | C++ | src/ggl/Graph.hh | michaelapeterka/GGL | 99e585b773ad8f33e39160d2cbd71c00e036fa37 | [
"MIT"
] | 20 | 2017-05-09T15:37:04.000Z | 2021-11-24T10:51:02.000Z | src/ggl/Graph.hh | michaelapeterka/GGL | 99e585b773ad8f33e39160d2cbd71c00e036fa37 | [
"MIT"
] | 2 | 2017-05-24T08:00:25.000Z | 2017-05-24T08:01:01.000Z | src/ggl/Graph.hh | michaelapeterka/GGL | 99e585b773ad8f33e39160d2cbd71c00e036fa37 | [
"MIT"
] | 7 | 2017-05-29T10:55:18.000Z | 2020-12-04T14:24:51.000Z | #ifndef GGL_GRAPH_HH_
#define GGL_GRAPH_HH_
#include <boost/graph/properties.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <iostream>
#include <vector>
#include <set>
#include "sgm/Graph_boost.hh"
//! The ggl namespace contains classes needed to specify rules of a graph
//! grammar and ... | 27.979167 | 78 | 0.642964 | michaelapeterka |
f92585f74cf71b98bdd3222c1f159351f0001b55 | 121 | cc | C++ | tools/testdata/check_format/std_string_view.cc | dcillera/envoy | cb54ba8eec26f768f8c1ae412113b07bacde7321 | [
"Apache-2.0"
] | 17,703 | 2017-09-14T18:23:43.000Z | 2022-03-31T22:04:17.000Z | tools/testdata/check_format/std_string_view.cc | dcillera/envoy | cb54ba8eec26f768f8c1ae412113b07bacde7321 | [
"Apache-2.0"
] | 15,957 | 2017-09-14T16:38:22.000Z | 2022-03-31T23:56:30.000Z | tools/testdata/check_format/std_string_view.cc | dcillera/envoy | cb54ba8eec26f768f8c1ae412113b07bacde7321 | [
"Apache-2.0"
] | 3,780 | 2017-09-14T18:58:47.000Z | 2022-03-31T17:10:47.000Z | #include <string>
namespace Envoy {
void foo() {
std::string_view x("a string literal");
}
} // namespace Envoy
| 15.125 | 43 | 0.636364 | dcillera |
234e424ee765ce167a5d7a82484fedeabc8e887b | 10,711 | hpp | C++ | src/parser/lexer/string_reader.hpp | alohaeee/-orrosion | 7529cf9fb2d15f4d67a45013bd90760bc9c8f579 | [
"MIT"
] | null | null | null | src/parser/lexer/string_reader.hpp | alohaeee/-orrosion | 7529cf9fb2d15f4d67a45013bd90760bc9c8f579 | [
"MIT"
] | null | null | null | src/parser/lexer/string_reader.hpp | alohaeee/-orrosion | 7529cf9fb2d15f4d67a45013bd90760bc9c8f579 | [
"MIT"
] | null | null | null | #ifndef CORROSION_SRC_PARSER_LEXER_STRING_READER_HPP_
#define CORROSION_SRC_PARSER_LEXER_STRING_READER_HPP_
#include "utility/std_incl.hpp"
#include "lexer/lexer.hpp"
#include "parser/parse_session.hpp"
#include "ast/token.hpp"
#include "span/source_file.hpp"
#include "span/symbol.hpp"
#include "span/span.hpp"
#inclu... | 29.752778 | 135 | 0.642424 | alohaeee |
235065baa317611a019f596d0f90b837f98d8488 | 606 | cpp | C++ | Code/2020/Day 3/day3p1.cpp | holllikill/AdventOfCode2019 | 7ea69ac9cf57ba15196047564f40e63f4d20d996 | [
"MIT"
] | 1 | 2020-01-28T00:06:30.000Z | 2020-01-28T00:06:30.000Z | Code/2020/Day 3/day3p1.cpp | holllikill/AdventOfCode2019 | 7ea69ac9cf57ba15196047564f40e63f4d20d996 | [
"MIT"
] | null | null | null | Code/2020/Day 3/day3p1.cpp | holllikill/AdventOfCode2019 | 7ea69ac9cf57ba15196047564f40e63f4d20d996 | [
"MIT"
] | null | null | null | #include <iostream>
#include <fstream>
using namespace std;
int main () {
ifstream infile;
infile.open ("input.txt");
string total[500];
int i = 0;
if (infile.is_open()) {
while (infile.good()) {
char c[40];
infile.getline(c, 256);
total[i... | 16.833333 | 38 | 0.429043 | holllikill |
2353913ff868e3d33d8c912eae7628f289ed2759 | 5,949 | cpp | C++ | components/network/tcp/iot_tcp.cpp | lask/esp-iot-solution | 40cec135eace36cf11ab72988e27546a2c0d025b | [
"Apache-2.0"
] | 8 | 2021-03-29T16:42:39.000Z | 2022-02-18T07:05:00.000Z | components/network/tcp/iot_tcp.cpp | Conanzhou/esp-iot-solution | f2e0a8ee2448b26171fe361add1b6786b7cf43a0 | [
"Apache-2.0"
] | 27 | 2019-03-12T10:13:29.000Z | 2019-06-07T20:40:56.000Z | components/network/tcp/iot_tcp.cpp | Conanzhou/esp-iot-solution | f2e0a8ee2448b26171fe361add1b6786b7cf43a0 | [
"Apache-2.0"
] | 3 | 2020-05-01T06:33:57.000Z | 2020-05-13T12:01:25.000Z | // Copyright 2015-2016 Espressif Systems (Shanghai) PTE LTD
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by app... | 25.642241 | 120 | 0.597411 | lask |
23555e12d8d2541b45abfc5e9eb42037e5b9d8a5 | 1,545 | cp | C++ | MacOS/Sources/Support/CClockEventHandler.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 12 | 2015-04-21T16:10:43.000Z | 2021-11-05T13:41:46.000Z | MacOS/Sources/Support/CClockEventHandler.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 2 | 2015-11-02T13:32:11.000Z | 2019-07-10T21:11:21.000Z | MacOS/Sources/Support/CClockEventHandler.cp | mulberry-mail/mulberry4-client | cdaae15c51dd759110b4fbdb2063d0e3d5202103 | [
"ECL-2.0",
"Apache-2.0"
] | 6 | 2015-01-12T08:49:12.000Z | 2021-03-27T09:11:10.000Z | /*
Copyright (c) 2007 Cyrus Daboo. 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 re... | 29.150943 | 92 | 0.732039 | mulberry-mail |
235a9f1b0cc9ec21dbdcb1901ba5e1b2d4578437 | 1,457 | cc | C++ | src/tools/persistence_diagram_entropies.cc | eudoxos/Aleph | 874882c33a0e8429c74e567eb01525613fee0616 | [
"MIT"
] | 56 | 2019-04-24T22:11:15.000Z | 2022-03-22T11:37:47.000Z | src/tools/persistence_diagram_entropies.cc | eudoxos/Aleph | 874882c33a0e8429c74e567eb01525613fee0616 | [
"MIT"
] | 48 | 2016-11-30T09:37:13.000Z | 2019-01-30T21:43:39.000Z | src/tools/persistence_diagram_entropies.cc | eudoxos/Aleph | 874882c33a0e8429c74e567eb01525613fee0616 | [
"MIT"
] | 11 | 2019-05-02T11:54:31.000Z | 2020-12-10T14:05:40.000Z | /*
This is a tool shipped by 'Aleph - A Library for Exploring Persistent
Homology'.
It permits the calculation of different entropy measures defined for
persistence diagrams.
Original author: Bastian Rieck
*/
#include <aleph/persistenceDiagrams/Entropy.hh>
#include <aleph/persistenceDiagrams/PersistenceDia... | 19.958904 | 79 | 0.647907 | eudoxos |
235bab4fddd1c645d87cf3164c014efe2abeece2 | 299 | hpp | C++ | src/tool.hpp | Montag55/gl-playground | 7501718726f8933e7550abfacaeff9708a4ab270 | [
"MIT"
] | null | null | null | src/tool.hpp | Montag55/gl-playground | 7501718726f8933e7550abfacaeff9708a4ab270 | [
"MIT"
] | null | null | null | src/tool.hpp | Montag55/gl-playground | 7501718726f8933e7550abfacaeff9708a4ab270 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
// assure compile class will be there
class GraphApp;
class Tool {
public:
Tool(GraphApp* app);
virtual bool draw() const = 0;
virtual bool registerTool() = 0;
void setPriority(int prio);
protected:
GraphApp* m_linkedApp;
int m_priotity;
}; | 17.588235 | 38 | 0.67893 | Montag55 |
235ccc2ae0a2b5fe5b4f3268928091154f4cc7f8 | 14,458 | hpp | C++ | src/libs/optframe/src/OptFrame/MultiObjValue.hpp | fellipessanha/LMRRC-Team-AIDA | 8076599427df0e35890caa7301972a53ae327edb | [
"MIT"
] | 1 | 2021-08-19T13:31:29.000Z | 2021-08-19T13:31:29.000Z | src/libs/optframe/src/OptFrame/MultiObjValue.hpp | fellipessanha/LMRRC-Team-AIDA | 8076599427df0e35890caa7301972a53ae327edb | [
"MIT"
] | null | null | null | src/libs/optframe/src/OptFrame/MultiObjValue.hpp | fellipessanha/LMRRC-Team-AIDA | 8076599427df0e35890caa7301972a53ae327edb | [
"MIT"
] | null | null | null | #ifndef OPTFRAME_MULTI_OBJ_VALUE_HPP
#define OPTFRAME_MULTI_OBJ_VALUE_HPP
#include <assert.h>
#include <iostream>
#include <sstream>
#include <tuple>
#include "SingleObjValue.hpp" // must re-use some structures
#include "myconcepts.h"
//#include <OptFrame/printable/printable.h>
namespace optframe {
// Struct to ha... | 33.236782 | 155 | 0.634389 | fellipessanha |
2360bd309419075ba38cb55f88873bc1911fbde4 | 972 | cpp | C++ | src/simulator.cpp | RicoAntonioFelix/TELEVISION-SIMULATOR | 318862b3a3e0a30dbcc34e9e6fb364d8ed1a4f38 | [
"Apache-2.0"
] | null | null | null | src/simulator.cpp | RicoAntonioFelix/TELEVISION-SIMULATOR | 318862b3a3e0a30dbcc34e9e6fb364d8ed1a4f38 | [
"Apache-2.0"
] | null | null | null | src/simulator.cpp | RicoAntonioFelix/TELEVISION-SIMULATOR | 318862b3a3e0a30dbcc34e9e6fb364d8ed1a4f38 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2014-2015 Rico Antonio Felix
*
* 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... | 25.578947 | 75 | 0.709877 | RicoAntonioFelix |
236345b74fffba778c4432fcf7ba0e48b14d59e3 | 25,149 | cc | C++ | solvers/test/quadratic_program_examples.cc | RobotLocomotion/drake-python3.7 | ae397a4c6985262d23e9675b9bf3927c08d027f5 | [
"BSD-3-Clause"
] | 2 | 2021-02-25T02:01:02.000Z | 2021-03-17T04:52:04.000Z | solvers/test/quadratic_program_examples.cc | RobotLocomotion/drake-python3.7 | ae397a4c6985262d23e9675b9bf3927c08d027f5 | [
"BSD-3-Clause"
] | null | null | null | solvers/test/quadratic_program_examples.cc | RobotLocomotion/drake-python3.7 | ae397a4c6985262d23e9675b9bf3927c08d027f5 | [
"BSD-3-Clause"
] | 1 | 2021-06-13T12:05:39.000Z | 2021-06-13T12:05:39.000Z | #include "drake/solvers/test/quadratic_program_examples.h"
#include <limits>
#include <optional>
#include <gtest/gtest.h>
#include "drake/common/test_utilities/eigen_matrix_compare.h"
#include "drake/solvers/gurobi_solver.h"
#include "drake/solvers/snopt_solver.h"
#include "drake/solvers/solver_type_converter.h"
#in... | 38.572086 | 80 | 0.616366 | RobotLocomotion |
236394ec20600a21bdcb7a74a3118867e877c422 | 144 | hpp | C++ | include/cgla/cgla.hpp | Blodangan/cgla | 48e3418c3fbe7c2e01ec0b107f1fb862de8f48e0 | [
"MIT"
] | 1 | 2020-07-09T19:50:09.000Z | 2020-07-09T19:50:09.000Z | include/cgla/cgla.hpp | Blodangan/cgla | 48e3418c3fbe7c2e01ec0b107f1fb862de8f48e0 | [
"MIT"
] | null | null | null | include/cgla/cgla.hpp | Blodangan/cgla | 48e3418c3fbe7c2e01ec0b107f1fb862de8f48e0 | [
"MIT"
] | null | null | null | #ifndef CGLA_CGLA_HPP
#define CGLA_CGLA_HPP
#include "config.hpp"
#include "vector.hpp"
#include "matrix.hpp"
#include "transform.hpp"
#endif
| 14.4 | 24 | 0.763889 | Blodangan |
23738558fda8206d6ad8056e6eb4712f46736987 | 252 | cpp | C++ | src/yds_object_animation_data.cpp | ange-yaghi/delta-studio | 8466623bdced4706c66643e2b790591517e56821 | [
"MIT"
] | 34 | 2020-07-10T14:23:49.000Z | 2022-03-31T23:38:36.000Z | src/yds_object_animation_data.cpp | ange-yaghi/delta-studio | 8466623bdced4706c66643e2b790591517e56821 | [
"MIT"
] | 7 | 2020-12-20T17:32:08.000Z | 2021-05-19T03:42:08.000Z | src/yds_object_animation_data.cpp | ange-yaghi/delta-studio | 8466623bdced4706c66643e2b790591517e56821 | [
"MIT"
] | 2 | 2021-02-09T20:04:04.000Z | 2022-01-26T08:46:20.000Z | #include "../include/yds_object_animation_data.h"
ysObjectAnimationData::ysObjectAnimationData() {
Clear();
}
ysObjectAnimationData::~ysObjectAnimationData() {
/* void */
}
void ysObjectAnimationData::Clear() {
m_objectName[0] = '\0';
}
| 18 | 49 | 0.702381 | ange-yaghi |
2374a4a78a7c28009d58df9962397dfd618c6436 | 1,218 | cpp | C++ | src/test/tst4.cpp | TING2938/Gmx2020PostAnalysis | 0859383946c05c7424adb1ffa72fd2f8066ce850 | [
"MIT"
] | 4 | 2021-11-23T15:02:13.000Z | 2022-03-21T16:32:09.000Z | src/test/tst4.cpp | jianghuili/Gmx2020PostAnalysis | 0859383946c05c7424adb1ffa72fd2f8066ce850 | [
"MIT"
] | null | null | null | src/test/tst4.cpp | jianghuili/Gmx2020PostAnalysis | 0859383946c05c7424adb1ffa72fd2f8066ce850 | [
"MIT"
] | 1 | 2021-11-23T15:01:49.000Z | 2021-11-23T15:01:49.000Z | #include <itp/core>
#include <format>
#include <map>
#include <vector>
#define Print(...) std::cout << std::format(__VA_ARGS__)
std::vector<std::string> splitString(const std::string& str)
{
std::vector<std::string> result;
std::string::const_iterator currPos = str.begin();
const std::stri... | 23.882353 | 69 | 0.554187 | TING2938 |
237a2bf739070b77f847360e67b4b390ece00c8b | 609 | cpp | C++ | 201403/1.cpp | YiqinXiong/CSP_Practice | b5840117175f0370d4c1fbcc3c6ffd1fd337a04c | [
"MIT"
] | null | null | null | 201403/1.cpp | YiqinXiong/CSP_Practice | b5840117175f0370d4c1fbcc3c6ffd1fd337a04c | [
"MIT"
] | null | null | null | 201403/1.cpp | YiqinXiong/CSP_Practice | b5840117175f0370d4c1fbcc3c6ffd1fd337a04c | [
"MIT"
] | null | null | null | /*
* 用时 10分
* 得分 100分
*/
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_N = 2005;
bool arr[MAX_N];
int N;
int main()
{
int ans = 0;
fill(begin(arr), end(arr), false);
cin >> N;
for (int i = 0; i < N; i++)
{
int num;
cin >> num;
//把数字范围调整为[0,20... | 16.459459 | 53 | 0.456486 | YiqinXiong |
237b40b10cccd5bfd935e1c28b2f669e41669b0d | 1,376 | hpp | C++ | libs/input/include/sge/input/processor.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 2 | 2016-01-27T13:18:14.000Z | 2018-05-11T01:11:32.000Z | libs/input/include/sge/input/processor.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | null | null | null | libs/input/include/sge/input/processor.hpp | cpreh/spacegameengine | 313a1c34160b42a5135f8223ffaa3a31bc075a01 | [
"BSL-1.0"
] | 3 | 2018-05-11T01:11:34.000Z | 2021-04-24T19:47:45.000Z | // Copyright Carl Philipp Reh 2006 - 2019.
// 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)
#ifndef SGE_INPUT_PROCESSOR_HPP_INCLUDED
#define SGE_INPUT_PROCESSOR_HPP_INCLUDED
#include <sge/co... | 26.980392 | 78 | 0.736919 | cpreh |
237f6fdbd1cc682f87a412f4e80acb75d1d96931 | 5,508 | cpp | C++ | source/projects/ar.swell_tilde/ar.swell_tilde.cpp | isabelgk/airfx | bc97f9a093ceba9cd27020f4b4db1c508a37545f | [
"MIT"
] | 16 | 2021-06-20T04:51:09.000Z | 2022-03-30T03:03:32.000Z | source/projects/ar.swell_tilde/ar.swell_tilde.cpp | isabelgk/airfx | bc97f9a093ceba9cd27020f4b4db1c508a37545f | [
"MIT"
] | 7 | 2021-06-20T01:22:22.000Z | 2022-01-24T14:33:31.000Z | source/projects/ar.swell_tilde/ar.swell_tilde.cpp | isabelgk/airfx | bc97f9a093ceba9cd27020f4b4db1c508a37545f | [
"MIT"
] | null | null | null | #include "c74_min.h"
using namespace c74::min;
class swell : public object<swell>, public vector_operator<> {
public:
MIN_DESCRIPTION {"adds attack"};
MIN_TAGS {""};
MIN_AUTHOR {"Isabel Kaspriskie"};
inlet<> in1 {this, "(signal) Input1"};
inlet<> in2 {this, "(signal) Input2"};
outlet<> out1 {this, "(signal) Ou... | 34.21118 | 95 | 0.662309 | isabelgk |
2382237ff773867bd09cd7e4616119dfb2758e8e | 1,796 | hpp | C++ | libraries/vm_manager/vm_manager.hpp | learnforpractice/pyeos | 4f04eb982c86c1fdb413084af77c713a6fda3070 | [
"MIT"
] | 144 | 2017-10-18T16:38:51.000Z | 2022-01-09T12:43:57.000Z | libraries/vm_manager/vm_manager.hpp | openchatproject/safeos | 2c8dbf57d186696ef6cfcbb671da9705b8f3d9f7 | [
"MIT"
] | 60 | 2017-10-11T13:07:43.000Z | 2019-03-26T04:33:27.000Z | libraries/vm_manager/vm_manager.hpp | learnforpractice/pyeos | 4f04eb982c86c1fdb413084af77c713a6fda3070 | [
"MIT"
] | 38 | 2017-12-05T01:13:56.000Z | 2022-01-07T07:06:53.000Z | #pragma once
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <map>
#include <string>
#include <vector>
#include <memory>
#include <vm_py_api.h>
#include <vm_wasm_api.h>
#include <eosio/chain/db_api.hpp>
using namespace std;
namespace eosio {
namespace chain {
#include <eosiolib_native/vm_api.... | 22.17284 | 80 | 0.73441 | learnforpractice |
23853cef46eb8f6de0642455c5294afa6406078f | 1,345 | hpp | C++ | android/test/src/main/cpp/JavaTestParams.hpp | mengxiaokun/CrossLangGenerator | a5f7241ce03aef2403ef0fc409297bcab6b1e069 | [
"MIT"
] | null | null | null | android/test/src/main/cpp/JavaTestParams.hpp | mengxiaokun/CrossLangGenerator | a5f7241ce03aef2403ef0fc409297bcab6b1e069 | [
"MIT"
] | null | null | null | android/test/src/main/cpp/JavaTestParams.hpp | mengxiaokun/CrossLangGenerator | a5f7241ce03aef2403ef0fc409297bcab6b1e069 | [
"MIT"
] | null | null | null | #ifndef _JAVA_TEST_PARAMS_HPP_
#define _JAVA_TEST_PARAMS_HPP_
#include <cstdint>
#include <experimental-span.hpp>
#include <span>
#include <sstream>
#include <vector>
class JavaTestParams {
public:
/*** type define ***/
/*** static function and variable ***/
/*** class function and variable ***/
int crossNa... | 28.617021 | 75 | 0.611896 | mengxiaokun |
2387957b7f1872330ce9e5c71491d1550035489c | 426 | cc | C++ | pcraster/pcraster-4.2.0/pcraster-4.2.0/source/pcraster_old_calc/calc_indexselectedsingle.cc | quanpands/wflow | b454a55e4a63556eaac3fbabd97f8a0b80901e5a | [
"MIT"
] | null | null | null | pcraster/pcraster-4.2.0/pcraster-4.2.0/source/pcraster_old_calc/calc_indexselectedsingle.cc | quanpands/wflow | b454a55e4a63556eaac3fbabd97f8a0b80901e5a | [
"MIT"
] | null | null | null | pcraster/pcraster-4.2.0/pcraster-4.2.0/source/pcraster_old_calc/calc_indexselectedsingle.cc | quanpands/wflow | b454a55e4a63556eaac3fbabd97f8a0b80901e5a | [
"MIT"
] | null | null | null | #include "stddefx.h"
#ifndef INCLUDED_CALC_INDEXSELECTEDSINGLE
#include "calc_indexselectedsingle.h"
#define INCLUDED_CALC_INDEXSELECTEDSINGLE
#endif
calc::IndexSelectedSingle::~IndexSelectedSingle()
{
}
int calc::IndexSelectedSingle::select() const
{
return 0;
}
std::string calc::IndexSelectedSingle::selectedN... | 17.04 | 59 | 0.765258 | quanpands |
2387a586a912bc6ac2dced833e30a0dc20258bcd | 2,828 | cc | C++ | editors/pdfedit/files/patch-src-kernel-pdfoperatorsbase.cc | lbartoletti/freebsd-ports-boost | 6ee5bd68767c7a47e5a19b07a329f349c7a6cbac | [
"BSD-3-Clause"
] | null | null | null | editors/pdfedit/files/patch-src-kernel-pdfoperatorsbase.cc | lbartoletti/freebsd-ports-boost | 6ee5bd68767c7a47e5a19b07a329f349c7a6cbac | [
"BSD-3-Clause"
] | null | null | null | editors/pdfedit/files/patch-src-kernel-pdfoperatorsbase.cc | lbartoletti/freebsd-ports-boost | 6ee5bd68767c7a47e5a19b07a329f349c7a6cbac | [
"BSD-3-Clause"
] | 2 | 2021-04-20T08:30:05.000Z | 2021-06-03T08:24:54.000Z | --- src/kernel/pdfoperatorsbase.cc.orig 2009-04-06 15:25:00 UTC
+++ src/kernel/pdfoperatorsbase.cc
@@ -48,7 +48,7 @@ using namespace debug;
//
//
//
-shared_ptr<CContentStream>
+boost::shared_ptr<CContentStream>
PdfOperator::getContentStream () const
{
assert (_contentstream);
@@ -57,7 +57,7 @@ PdfOperator::get... | 35.797468 | 138 | 0.722065 | lbartoletti |
23880e9ec38994e327e22933a9419a91496eb250 | 1,398 | hpp | C++ | include/SFML-utils/cegui/PopupBox.hpp | Krozark/SFML-utils | c2f169faa7f3ce0aa6e23991d21796dca01944be | [
"BSD-2-Clause"
] | 23 | 2016-03-05T11:27:53.000Z | 2021-05-29T19:08:26.000Z | include/SFML-utils/cegui/PopupBox.hpp | Krozark/SFML-utils | c2f169faa7f3ce0aa6e23991d21796dca01944be | [
"BSD-2-Clause"
] | 11 | 2015-03-12T10:14:06.000Z | 2017-11-24T14:34:41.000Z | include/SFML-utils/cegui/PopupBox.hpp | Krozark/SFML-utils | c2f169faa7f3ce0aa6e23991d21796dca01944be | [
"BSD-2-Clause"
] | 9 | 2016-04-10T22:28:45.000Z | 2021-11-27T08:48:21.000Z | #ifndef SFUTILS_CEGUI_POPUPBOX_HPP
#define SFUTILS_CEGUI_POPUPBOX_HPP
#include <string>
#include <functional>
#include <SFML/Graphics.hpp>
namespace CEGUI
{
class GUIContext;
class Window;
}
namespace sfutils
{
namespace cegui
{
class PopupBox
{
public:
Po... | 22.918033 | 112 | 0.527897 | Krozark |