blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 4 201 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 7 100 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 260
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 11.4k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 17
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 80
values | src_encoding stringclasses 28
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 8 9.86M | extension stringclasses 52
values | content stringlengths 8 9.86M | authors listlengths 1 1 | author stringlengths 0 119 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a77456410f7d9c2816d2563e5d502e6a0db5ef05 | 60205812b617b29713fe22dcb6084c4daed9da18 | /00-Keypoint_in_WangDao/Chapter_06-Graph/02-Minimum_Spannning_Tree/00-Prim/00-Prim.cpp | 215051a4e594a32b7a54f46da38864d5bf4eb189 | [
"MIT"
] | permissive | liruida/kaoyan-data-structure | bc04d6306736027cb5fc4090a2796aca7abbbaa4 | d0a469bf0e9e7040de21eca38dc19961aa7e9a53 | refs/heads/master | 2023-04-02T19:57:49.252343 | 2021-01-03T07:20:11 | 2021-01-03T07:20:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 995 | cpp | void Prim(MGraph g, int v0, int &sum) {
int lowcost[maxSize], vset[maxSize], v;
int i, j, k, min;
v = v0;
for(i = 0; i < g.n; ++i) {
lowcost[i] = g.edges[v0][i];
vset[i] = 0;
}
vset[v0] = 1; //将v0并入树中
sum = 0; //sum清零用来累计树的权值
for(i = 0; i < g.n-1; ++i) {
min = INF; //INF是一个已经定义的比图中所有边权值都大的常量
/*下面这个循环用于选... | [
"1097985743@qq.com"
] | 1097985743@qq.com |
adf1c466dbee4af37a779b3e7235c02edec773c6 | f9c4a3b4ab06f6f82b4ea3560c9dcfaf8fb6ff1a | /IntervalTree.cpp | 0fa301de09b8f6df93175dfab25167b3861bd5af | [] | no_license | lymcool/Introduction-to-Algorithms-Data-Structures | f6250124773b0e891cf1f41503658849b97ccbf5 | 695604bfd3da9b126b4751779fcbf8ab9cbb1318 | refs/heads/master | 2021-09-03T06:35:45.540632 | 2018-01-06T14:02:42 | 2018-01-06T14:02:42 | 109,775,501 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 717 | cpp |
#include <iostream>
#include <vector>
#include "IntervalTree.h"
using namespace std;
void main() {
int a[6] = { 17, 5, 21, 4, 15, 7 };
int b[6] = { 19, 11, 23, 8, 18, 10 };
vector<dataNode> data;
for (int i = 0;i < 6;i++) {
dataNode d;
d.low = a[i];
d.high = b[i];
data.push_back(d);
}
IntervalTree i... | [
"1326833121@qq.com"
] | 1326833121@qq.com |
98087c8c5c12b7ac214e71f7131b9062e42eb3b8 | 51bce7274dcdfb3ae1c00fe7010ee6818ea8f260 | /Sensor.cpp | e10a3df1a406ecfcec529c91eb5c7c689af2d04d | [] | no_license | cvicens/caelum | dbea7672cd02a346be6f966a68374278601c3ff4 | 35af1f74bd0826669daf126617cbe6ee5f90007e | refs/heads/main | 2023-08-15T20:30:46.497821 | 2021-10-19T13:41:54 | 2021-10-19T13:41:54 | 398,583,378 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 224 | cpp | /*
Sensor.cpp - Base Class for sensors.
Created by Carlos V.
Released into the public domain.
*/
#include "Sensor.h"
// Sensor::Sensor(char* name)
// {
// this->initialized = false;
// this->valid = false;
// }
| [
"carlos.vicens.alonso@gmail.com"
] | carlos.vicens.alonso@gmail.com |
c8f54486df68e2510ba878486cf368f5341f5f53 | 1552d8af68204103fcd269c6eb508cf061f7f0fe | /src/util.h | 0e4e8011a4335aeb347488b71c0541fbbb3747ff | [] | no_license | staveshan/Bootstrap | c4ef433cf6e796021cd3f519aee4be9e623f64ef | d9d7560c2cae5f6927925cb61700ed4101345ab5 | refs/heads/master | 2020-03-24T07:55:31.414177 | 2016-06-20T02:15:42 | 2016-06-20T02:15:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,303 | h | #ifndef _BS_UTILS_H_
#define _BS_UTILS_H_
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <stdint.h>
#include <unistd.h>
#include <search.h>
#include <pthread.h>
#include <errno.h>
#include <sys/types.h>
#include <time.h>
#include "list.h"
#define panic(fmt, arg...) do { fpr... | [
"yoonki@mdstec.com"
] | yoonki@mdstec.com |
c3c1b6cdcc39842a38af164688d0868b5f12fea2 | 328de0c1f7041d5fa266ecaf29d7720e4a15c5aa | /CompositeCommand.cpp | 89100cd59a52fd86d939709306256e80d8a9f719 | [] | no_license | hjxy2012/CppDesignPatterns | 9a725cc7ee44c4dcf2d88359717aab843411cc19 | a001c17fe2297812d8cff68d96991771733863b9 | refs/heads/master | 2023-05-31T06:41:07.630796 | 2018-06-19T17:45:39 | 2018-06-19T17:45:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,515 | cpp | #include <iostream>
#include <vector>
using namespace std;
struct BankAccount {
int balance_ = 0;
int threshold_ = 0;
void Deposit(int amount) {
balance_ += amount;
cout << "Deposit: " << amount << "\n"
<< "Balance: " << balance_ << endl;
}
bool Withdraw(int amount) {
if (balance_ -... | [
"rollschild@gmail.com"
] | rollschild@gmail.com |
49bac64acde2c0f73a7ed7f7cd3985745bb91fa6 | f33a8a22d6ef48a2968f6f378ad1f318e34278ee | /src/Game.cpp | 4eaa183d2e9241bd971da28d41c71268f389bd46 | [] | no_license | WBojangles/birds | 44cbd24b73137c315d75cb809ce9b9d0cc7f94fb | 6bf521faadf03391e04aefe3b96ad5fae357f42f | refs/heads/master | 2021-01-19T17:23:09.372728 | 2013-07-21T17:05:01 | 2013-07-21T17:05:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,321 | cpp | #include "../include/Game.hpp"
brd::Game::Game()
{
SHE::StateManager::window.create(sf::VideoMode(800, 600), "birds", sf::Style::Titlebar | sf::Style::Close);
//SHE::StateManager::window.create(sf::VideoMode(1440, 900), "Sailing the Seas of Sick", sf::Style::Fullscreen);
SHE::StateManager::window.setMouseCursorVisi... | [
"qqofficial@gmail.com"
] | qqofficial@gmail.com |
c6d46827ffd6556b4105be3b29c3c21c81f6ffe8 | b55fcf6edd06cda075745abffb42c5052c445b41 | /cf/upsolving/742-A/code.cpp | 15ca41d57a253229e920d030b9a9ea587c5b06cb | [] | no_license | ANKerD/competitive-programming-constests | 41030bf6250a92cfa2a611127d73ff62c3808c19 | 4edb687b82228bac4e1b103ed4c0b94d466b6c10 | refs/heads/master | 2021-11-09T20:26:47.317274 | 2021-10-31T23:41:49 | 2021-10-31T23:41:49 | 133,289,164 | 0 | 1 | null | 2021-10-31T23:41:50 | 2018-05-14T01:24:28 | C++ | UTF-8 | C++ | false | false | 1,219 | cpp | #include <bits/stdc++.h>
using namespace std;
#define trace1(a) cout << a << '\n';
#define trace2(a, b) cout << a << ' ' << b << '\n';
#define trace3(a, b, c) cout << a << ' ' << b << ' ' << c << '\n';
#define trace4(a, b, c, d) cout << a << ' ' << b << ' ' << c << ' ' << d << '\n';
#define trace5(a, b, c, d, e) cout <... | [
"a.kleber.d@gmail.com"
] | a.kleber.d@gmail.com |
6802b6b325a09b9bc0d003faf3b300177565a78f | 7a97496d628a6a6d89df847c43a0f0215fc0993f | /pynq_dsp_hw/pynq_dsp_hw.ip_user_files/mem_init_files/base_m10_regslice_9.h | 69f3e578779e3f16f3f6613fc8a868e39d1eacb2 | [
"MIT"
] | permissive | kamiyaowl/pynq_dsp_hw | 9336329bf952fcdfb6d35f2817c374ca4f91936d | cb3adee62d80ef8d70f9886ddfae8ff39441fe2d | refs/heads/master | 2020-12-23T04:19:22.080691 | 2020-02-09T07:52:02 | 2020-02-09T07:52:02 | 237,025,484 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,948 | h | #ifndef IP_BASE_M10_REGSLICE_9_H_
#define IP_BASE_M10_REGSLICE_9_H_
// (c) Copyright 1995-2020 Xilinx, Inc. All rights reserved.
//
// This file contains confidential and proprietary information
// of Xilinx, Inc. and is protected under U.S. and
// international copyright and other intellectual property
// laws.
//
... | [
"kamiyaowl@gmail.com"
] | kamiyaowl@gmail.com |
ad86c90b30f7ebe54f6820ba65dd5613fad36e8d | 39bcafc5f6b1672f31f0f6ea9c8d6047ee432950 | /extension/icu/third_party/icu/i18n/chnsecal.h | a0c21b6b5c2f86e951d0059df0442be345f2e1fb | [
"MIT",
"ICU",
"NAIST-2003",
"LicenseRef-scancode-unicode",
"BSD-3-Clause",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause"
] | permissive | duckdb/duckdb | 315270af6b198d26eb41a20fc7a0eda04aeef294 | f89ccfe0ec01eb613af9c8ac7c264a5ef86d7c3a | refs/heads/main | 2023-09-05T08:14:21.278345 | 2023-09-05T07:28:59 | 2023-09-05T07:28:59 | 138,754,790 | 8,964 | 986 | MIT | 2023-09-14T18:42:49 | 2018-06-26T15:04:45 | C++ | UTF-8 | C++ | false | false | 10,510 | h | // © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
*****************************************************************************
* Copyright (C) 2007-2013, International Business Machines Corporation
* and others. All Rights Reserved.
*****************... | [
"mark.raasveldt@gmail.com"
] | mark.raasveldt@gmail.com |
6e8d76ebf3589a09ffaa59bc3e3a1d77cacde164 | a849b845b482ca0dc1ad41a43cee31878a407c7f | /Billing_tools/Billing_sdk/common/BscpSocket.h | 017997de0dae52b1719fa9f41ad85928cef9ebf1 | [] | no_license | shaodaWang/test_20200628 | 106c3f4224ca6715ce374c540a7918747be125d1 | 32ecc8b762d792d26df914c107c38df2687dd7d2 | refs/heads/master | 2022-11-12T22:08:08.646333 | 2020-07-01T07:04:36 | 2020-07-01T07:04:36 | 275,546,863 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,973 | h | /** $Id$ $DateTime$
* @file BscpSocket.h
* @brief BSCP模块，调用加密与网络连接两个子模块。接收上层任意数据，向Dvr发送，并接收Dvr回应数据。
* @version 0.0.1
* @since 0.0.1
*/
#pragma once
#include "Encrypt.h"
#include "StreamSocket.h"
#include "Lock.h"
// #include "AudioFifo.h"
#include "bsrLog.h"
#include "../BillSdkType.h"
// 日志
#define BSCP... | [
"langzizhuyue@163.com"
] | langzizhuyue@163.com |
a34673beac11a3733ecfed464f4fe26e42daa275 | eb8a75fbb3cc22dc2fb297096ccbad872a9512fc | /src/rpcmasternode.cpp | f3505b0dbfcf2b1212bd4b24ce6564a130f68d83 | [
"MIT"
] | permissive | admecoin/CTTCoin | 29848f810eea5aa1c6094563939a91f733d05150 | b1a2f9e6d8ffee7749636030f3b223859d731c86 | refs/heads/master | 2020-04-25T12:55:26.033094 | 2019-10-29T18:13:43 | 2019-10-29T18:13:43 | 172,792,780 | 0 | 0 | MIT | 2019-02-26T21:23:30 | 2019-02-26T21:23:29 | null | UTF-8 | C++ | false | false | 25,134 | cpp | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2017-2018 The CryptoInvest developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit... | [
"46240091+CTTDeveloperTeam@users.noreply.github.com"
] | 46240091+CTTDeveloperTeam@users.noreply.github.com |
bc9cdb001bf9e33cc63423fae59bb97f6c02f233 | 3dfceb181f9cf5bb29c671cc2f417ce877805390 | /m2srccf/Metin2Client/UserInterface/PythonMessenger.cpp | 578f987e7f6b5c8747eb64eb8c20bccb08992052 | [] | no_license | Sophie-Williams/M2-Project | 74e1ce9e80a137b59b54dc8f42f192fb8293b6e9 | b07c37b6c24b46040b21693402e4b1606ad67b48 | refs/heads/master | 2022-11-23T05:16:37.706348 | 2020-08-02T21:52:07 | 2020-08-02T21:52:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,458 | cpp | #include "stdafx.h"
#include "PythonMessenger.h"
void CPythonMessenger::RemoveFriend(const char * c_szKey)
{
m_FriendNameMap.erase(c_szKey);
}
void CPythonMessenger::OnFriendLogin(const char * c_szKey/*, const char * c_szName*/)
{
m_FriendNameMap.insert(c_szKey);
if (m_poMessengerHandler)
PyCallClassMemberFunc(... | [
"contact@asikoo.xyz"
] | contact@asikoo.xyz |
4e43483d6c58015044939ec6ce8796d2225d9994 | e5b9b67769d7408d1bc0c49fcda94b10c628fa29 | /maneuver/sma.cpp | ddd761a6b14bdf30713036e8af6456fbadfa1d18 | [] | no_license | s1w2i3f4t/orbitdynamics | bba6751cde1db4d372d08bb84da55661c7cd4b3b | d0f1ff9a98d5c71c4dd39c19bfb65561bbd702c5 | refs/heads/master | 2020-03-27T07:12:14.519376 | 2018-08-09T15:46:48 | 2018-08-09T15:46:48 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 625 | cpp | // semi-major axis maneuver
#include <OrbitDyn.h>
#include <PerfTimer.h>
using namespace Constant;
//! 近圆轨道的半长轴机动
double sma_nearcircle(double a,double deltaa)
{
double n = sqrt(GE / a / a / a);
return 2 / n * deltaa;
}
double sma_ellipse(double a, double e, double f, double deltaa)
{
double r = a * (1 - e * e) /... | [
"31544492+handong1979@users.noreply.github.com"
] | 31544492+handong1979@users.noreply.github.com |
5b873d511a3aae1883b676b8aa29c53084629d7e | f5d58b77743a85938f566647a80a8568950b6644 | /additional 3/2/2.4.cpp | b521b89bfeb450bdffb8c31ec2c7491a6918f49f | [] | no_license | Limineses/JS | 4308bb086a500263facee7a3c8bee71174c01c04 | d0711eab6853faf087be543be8b60b172edd1c89 | refs/heads/master | 2020-06-16T15:47:26.210627 | 2019-11-03T13:32:06 | 2019-11-03T13:32:06 | 195,625,653 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 914 | cpp | #include <cstdlib>
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
setlocale(LC_ALL, "Russian");
double odd = 1;
double even = 1;
double sum = 0;
double s1, s2, x;
cout << "Разложение arcsin(x) в ряд Тейлора до 4-го члена." << endl;
cout << "Введите Х в пределах [-1; 1]: ";
cin >>x;
cou... | [
"andreihodunov3@tut.by"
] | andreihodunov3@tut.by |
0663504bc1408c13649c8d1656278be0b0218ae1 | a3569601d203ad418a5cf68043001be5610da90f | /String/72_编辑距离.cpp | cddae8c4d8ac69f585bf63cf97f1eacdf0060138 | [] | no_license | l1nkkk/leetcode | a12b0e117dd5e580fe8356f66774f75edb4612ac | 6c4bb462afb68f5cd913d6f3010b39f62dce2d86 | refs/heads/master | 2023-03-16T17:25:18.765935 | 2022-08-06T15:31:42 | 2022-08-06T15:31:42 | 220,748,877 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,161 | cpp | //
// Created by l1nkkk on 3/29/21.
//
#include <vector>
#include <iostream>
using namespace std;
namespace leetcode72{
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int> > dp(505, vector<int>(505,0));
// 初始化dp
for(int i = 0; i <= word1.length(); ++i)... | [
"linkgvhj.ggg.@gmail.com"
] | linkgvhj.ggg.@gmail.com |
328ef96fcc5b5f22f376790a4a8c51798f62a683 | f1e371917d861264e294bdfc5246afb15659da52 | /Server/Sources/RequestParser.cpp | 34b63a32981f33fd0942918858ed729594a96361 | [] | no_license | gobiggo/cpp_spider | ab29c5aa6f2348b52e8ae7f745054f003d48c57c | d24db742742af7f15144b94e02d19c4e6e2f74f5 | refs/heads/master | 2020-03-22T07:43:54.137272 | 2018-01-24T23:13:21 | 2018-01-24T23:13:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,463 | cpp | //
// main.hpp
// spider_server
//
// Created by Victor Sousa on 28/09/2017.
//
//
#include "RequestParser.hpp"
#include "Request.hpp"
http::RequestParser::RequestParser() : state_(method_start)
{
}
void http::RequestParser::reset() {
state_ = method_start;
}
http::RequestParser::result_type http::RequestParse... | [
"victor.sousa@epitech.eu"
] | victor.sousa@epitech.eu |
035a841ef01553169c31303b6354e1f57a91e4f3 | 5db5a5a053ef2c572c115f4ac36bfefa00e28379 | /BZOJ/BZOJ1058.cpp | 1d81a94623b31f8906ffadb9a3ec3cedb5349eba | [] | no_license | CaptainSlowWZY/OI-Code | 4491dfa40aae4af148db2dd529556a229a1e76af | be470914186b27d8b24177fb9b5d01d4ac55cd51 | refs/heads/master | 2020-03-22T08:36:19.753282 | 2019-12-19T08:22:51 | 2019-12-19T08:22:51 | 139,777,376 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,959 | cpp | // BZOJ 1058
// ZJOI 2007
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <vector>
#include <set>
typedef std::multiset<int> Set;
const int MAXN = 5e5 + 10, INF = 0x3f3f3f3f;
int N, M, ming = INF;
std::vector<int> A[MAXN];
Set D;
char IN[20];
namespace Treap {
struct Node {
in... | [
"CaptainSlowWZY@163.com"
] | CaptainSlowWZY@163.com |
22e28f3d3686c025e964c6df54e7e6d737c0972b | 8792c08bc939f8811f6779cea2a67c77c2af09a7 | /Rotate_Array/Rotate_Array/Main.cpp | 69c031153e1c87d4d3cc9259bf2fbab06a8013f1 | [] | no_license | 7mA/LeetCode | e56fe618a7efcbd80454ba1dcbba0c261a6cfaf4 | b67a46463cd83149f537f894c96c62030af6af16 | refs/heads/master | 2020-03-09T01:18:41.757032 | 2018-04-07T09:09:47 | 2018-04-07T09:09:47 | 128,510,884 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 104 | cpp | #include<iostream>
using namespace std;
void main(){
int i = -2, k = 3;
k %= i;
cout << k << endl;
} | [
"812966201@qq.com"
] | 812966201@qq.com |
d23a180812801af3578530bb8d158e9cac65f175 | b0ae18048c0eb6f2577f0f907a07fe7a0f27df5f | /WDL/wdlstring.h | 9023225fa8bc0dc7092f8ea03e5e4ca39720dfdf | [
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-other-permissive"
] | permissive | Youlean/IPlug-Youlean | 215988ae4fe960099719a4c994ed5a4f5706dd4c | 0291d9f634bd2e180a402ccf9b652b4a91e00451 | refs/heads/master | 2021-09-12T08:09:57.689757 | 2018-04-15T11:09:34 | 2018-04-15T11:09:34 | 56,938,366 | 40 | 9 | null | 2017-11-18T12:16:19 | 2016-04-23T20:01:29 | C | UTF-8 | C++ | false | false | 13,259 | h | /*
WDL - wdlstring.h
Copyright (C) 2005 and later, Cockos Incorporated
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 s... | [
"justin@cockos.com"
] | justin@cockos.com |
8fa7d04a2d600b2a7be7b21f76ba22cd9640bf52 | 3c4ef59613962378e96263c30afab597a96ab25d | /src/common/player/player_body/PlayerEngine.hpp | 65a198213e6b0a85c1c7f344974f0321c3d5a1db | [] | no_license | paolettiandrea/non-gravitar | 42157daea6f0530a2bfeecf50686ff3cb3043465 | 6dcd579fac6b6f69191b45aa6864dfe1b957f4d9 | refs/heads/master | 2022-04-08T11:09:08.839998 | 2020-02-20T13:25:01 | 2020-02-20T13:25:01 | 214,554,394 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,954 | hpp | #ifndef NON_GRAVITAR_PLAYERENGINE_HPP
#define NON_GRAVITAR_PLAYERENGINE_HPP
#include <SGE/components/physics/Rigidbody.hpp>
#include <SGE/components/graphics/ui/blocks/UIBar.hpp>
#include <noise-generation/NoiseMap.hpp>
#include "SGE/logic/Logic.hpp"
#include "SGE/components/graphics/VertArray.hpp"
#include "PlayerPe... | [
"andrea.paoletti3@studio.unibo.it"
] | andrea.paoletti3@studio.unibo.it |
2b7753bc3da3367fe7201ee202158c772a0acdb4 | 876b4a0b307b57ab2df634a0aa55b61cdf8d6680 | /core/widgets/WidgetList.h | 4ca5c5ab1c561462a53b5fea6eeb78ac2b82e2cd | [] | no_license | McManning/fro_client | b2b0dec3709ce0b737691dcf4335c13313961c97 | 985b85ce5c1470923880ca0d203f4814e6020516 | refs/heads/master | 2021-01-19T05:53:07.544837 | 2012-01-23T21:44:19 | 2012-01-23T21:44:19 | 2,669,742 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,608 | h |
/*
* Copyright (c) 2011 Chase McManning
*
* 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,... | [
"cmcmanning@gmail.com"
] | cmcmanning@gmail.com |
08d6e570381a2b3d0870d353bf05bbb01d3122ff | 96e03053772da867ee856ed769a086c56caee105 | /consumer/rabbitmqConsumer.cpp | 8f25cd3b3c3d4aa7868b6d02fd585a7489e282b0 | [] | no_license | Mcefor19/rabbitmq-cpp | 6299be318d326b3d2910d7abb97153cac327fb33 | 0ceca3f9263820cd23344d9685f3f9d4a77bbc1a | refs/heads/main | 2023-06-29T11:48:57.635896 | 2021-08-07T05:48:39 | 2021-08-07T05:48:39 | 393,590,755 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,276 | cpp | #include "rabbitmqConsumer.h"
amqp_queue_declare_ok_t* rabbitmqConsumer::declareQueue(amqp_channel_t chID, string queueName)
{
return amqp_queue_declare(_conn, chID, amqp_cstring_bytes(queueName.c_str()), 0, 0, 0, 1, amqp_empty_table);
}
void rabbitmqConsumer::bindQueue(amqp_channel_t chID, string queueName, ... | [
"315189070@qq.com"
] | 315189070@qq.com |
f9d0745edb7c0f0ecd85841f8620b9f947038c08 | 86b5ab8bf22c292d314fa553714d7bdef71e3d97 | /src/consensus/params.h | 35fdb188f2f58458b4615c5d0e96a546d863f979 | [
"MIT"
] | permissive | lycion/solbit_BitcoinUnlimited | 6a464eca7e793a2978a97c7fd59deb9e0231b43f | 8c89e95f19522d1f253da2e9242cdcfc9b4e00af | refs/heads/master | 2020-04-08T11:16:38.496228 | 2018-11-29T08:17:23 | 2018-11-29T08:17:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,995 | h | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Solbit Core developers
// Copyright (c) 2015-2018 The Solbit Unlimited developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef SOLBIT_CONSENSU... | [
"lycion@gmail.com"
] | lycion@gmail.com |
e673c8b2090380005ac371558a7400e0a9352a37 | 77a08ec51aa16191986a739267fd9d4379bbb208 | /homework/20181030-8.cpp | 7baf859e514c53367a2d89bed56faeaea4d3ba0c | [] | no_license | cenariusxz/ACM-Coding | 8f698203db802f79578921b311b38346950ef0ca | dc09ac9adfb4b80d463bdc93f52b479a957154e6 | refs/heads/master | 2023-06-24T13:12:13.279255 | 2021-07-26T01:24:36 | 2021-07-26T01:24:36 | 185,567,471 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 642 | cpp | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
#define MP make_pair
#define PB push_back
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int maxn = 1e4 + 5;
int n,c[maxn],y[maxn];
int ans[maxn];
int main(){
... | [
"810988849@qq.com"
] | 810988849@qq.com |
967e2b8a664232cb0e42cc2597f916a039f011e1 | 0dca3325c194509a48d0c4056909175d6c29f7bc | /arms/src/model/DeleteGrafanaResourceRequest.cc | a917fd2b4e7c25a307babae83580b74c607028d9 | [
"Apache-2.0"
] | permissive | dingshiyu/aliyun-openapi-cpp-sdk | 3eebd9149c2e6a2b835aba9d746ef9e6bef9ad62 | 4edd799a79f9b94330d5705bb0789105b6d0bb44 | refs/heads/master | 2023-07-31T10:11:20.446221 | 2021-09-26T10:08:42 | 2021-09-26T10:08:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,739 | cc | /*
* Copyright 2009-2017 Alibaba Cloud All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required... | [
"sdk-team@alibabacloud.com"
] | sdk-team@alibabacloud.com |
a221b684a9cfeca4f952a5ed0dc93b2e464ce7f7 | e65df504fa21f9cb232f68dbd020b24a7ce3268e | /src/Elements/PotentialElement.cc | b9fe66de838d1a3204d6757a9a475d673283909c | [
"MIT"
] | permissive | zhili93/voom | bdbbc56e9a8f49603747c329b72dbf9200912d6b | 856b3109dde60f76e4bf32c914ca5916bebd00c8 | refs/heads/master | 2020-12-03T10:29:19.488974 | 2016-05-10T18:12:33 | 2016-05-10T18:12:33 | 58,485,720 | 0 | 1 | null | 2016-05-10T18:49:51 | 2016-05-10T18:49:51 | null | UTF-8 | C++ | false | false | 1,210 | cc | // -*- C++ -*-
//----------------------------------------------------------------------
//
// William S. Klug, Luigi Perotti
// University of California Los Angeles
// (C) 2004-2007 All Rights Reserved
//
//------------------------------------------------------------------... | [
"luigiemp@login2.(none)"
] | luigiemp@login2.(none) |
2ffbdc56218203e50e7cd78b6efe603114775d67 | d84cf8f82efe5251b93d119ffbcc950c3b73dc6d | /ProDinoWiFiEsp/src/PRODINoESP8266/examples/WiFiWebDHTSrvAP/WiFiWebDHTSrvAP.ino | 9302d13646356b06b5fec5563d85f8e5236af6c7 | [] | no_license | kepsic/KMP | 305816980e05c44a8be836d3bbeebd669e8febd1 | 9912267a048aff5059ad0e9248a2352b7074e2a1 | refs/heads/master | 2020-12-24T20:23:57.255075 | 2016-09-12T15:45:15 | 2016-09-12T15:45:15 | 68,018,593 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,804 | ino | // WiFiWebDHTSrvAP.ino
// Company: KMP Electronics Ltd, Bulgaria
// Web: http://kmpelectronics.eu/
// Supported boards:
// KMP ProDino WiFi-ESP WROOM-02 (http://www.kmpelectronics.eu/en-us/products/prodinowifi-esp.aspx)
// Description:
// Web server AP DHT example.
// Example link: http://www.kmpelectronics.eu/en-us/... | [
"p.kovandjiev@kmpelectronics.eu"
] | p.kovandjiev@kmpelectronics.eu |
98cbe0013fe04ef94650a5eb87ae5b66a96d7e65 | 68a76eb015df500ab93125396cf351dff1e53356 | /Codeforces/443.cpp | c4228fbba999d8a8c2f088b8e4311e9105c458c2 | [] | no_license | deepakn97/Competitive-Programming | a84999c0755a187a55a0bb2f384c216e7ee4bf15 | aae415839c6d823daba5cd830935bf3350de895e | refs/heads/master | 2021-10-04T08:00:59.867642 | 2018-12-03T15:37:32 | 2018-12-03T15:37:32 | 81,475,571 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,915 | cpp | /* * * * * * * * * * * * * * * * *
Created By: Deepak Nathani
* Last Updated: 23/12/2017 *
You will win or you'll learn
* * * * * * * * * * * * * * * * */
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <l... | [
"deepakb1019@gmail.com"
] | deepakb1019@gmail.com |
2716ea3a1fc091b0daf413366b8da277d5cc6d81 | 84a21fbee2cb2319460de32b991c714b844de8e5 | /Bell/Easing/OutBounce.hpp | 12ec43a1bf5ec3d16069cec1677fe1db0b7bc6b7 | [] | no_license | Ryooooooga/Easing | b76f6a19b6f20ddc32411b4777959f44ca7c4c74 | 3c9896d14e2719350b1bee2cb7ab0d99fe9cc0da | refs/heads/master | 2021-01-18T18:26:22.127590 | 2016-07-30T13:47:52 | 2016-07-30T13:47:52 | 64,550,618 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,249 | hpp | //=====================================================================
// Copyright (c) 2016 Ryooooooga.
// https://github.com/Ryooooooga
//
// 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)
//====================... | [
"ryoga_314@yahoo.co.jp"
] | ryoga_314@yahoo.co.jp |
79033400d58a4412056e08f8aba22c988b39c16e | 264fdc13bfe259ae4cb79dd7d8bec1fa41472c77 | /graphmove.h | 2ad2c6c6c08cf64f5b46da5871b9f0ece4f381cd | [] | no_license | loveyu/simple-graph | 86542c2b5da08e8bf3716f544fab4159448cf2f5 | 05a1e6e56a0dbb5ebbf3e4e134bb7992d7ffbc16 | refs/heads/master | 2020-05-31T13:32:01.791289 | 2014-12-26T15:21:16 | 2014-12-26T15:21:16 | 28,513,957 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 596 | h | #ifndef GRAPHMOVE_H
#define GRAPHMOVE_H
#include <QList>
#include <QLine>
#include <QRectF>
#include <QPolygonF>
#include "GraphVector.h"
class GraphMove
{
public:
GraphMove(int x,int y);
bool is_move(int x,int y);
void move(QList<QLine> &line,
QList<QRectF> &circle,
QList<QRectF... | [
"admin@loveyu.info"
] | admin@loveyu.info |
cf55778e3851c9ea67f70a95a308d51d1838d66e | d6d0c969317f524d04689eecc78fa10db1bd6a58 | /Colossal Cave Adventure/ClassMessage.h | bc30460205afc67c28aeffba777ec3838894a6a7 | [] | no_license | emorozova/Colossal-Cave-Adventure-C-plus-plus | cd5aedc612e6c8aa920e04e28ec7c9dcab4bdfe6 | 16c404e025329d39f55ff73b0232a636ae95a85a | refs/heads/master | 2020-12-01T03:09:58.765558 | 2012-10-14T09:01:27 | 2012-10-14T09:01:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 600 | h | //
// ClassMessage.h
// Colossal Cave Adventure
//
// Created by Sebastian Norling and Niclas Björner on 2012-09-29.
// Copyright (c) 2012. All rights reserved.
//
#ifndef __Colossal_Cave_Adventure__ClassMessage__
#define __Colossal_Cave_Adventure__ClassMessage__
#include <iostream>
#include "Message.h"
class Cl... | [
"norling.sebastian@gmail.com"
] | norling.sebastian@gmail.com |
4a572ee8c2be3794433d87ff63b31ce54bb17e27 | 8531941cee6ec624c9eebea503822c6a33d9ff5b | /20142966-1-黄伟鹏/stud3/stud3/main3.cpp | 7216478278433c7c48ca92c036cdce0395b9390c | [] | no_license | SaintAbu/C-project | 7a1a922a4729f84cf9d860a759b50e497dadade0 | 3772ff048e8d2e3f18158e076d3f705cfaf5184b | refs/heads/master | 2021-07-17T11:59:45.402708 | 2017-09-21T16:35:00 | 2017-09-21T16:35:00 | 104,372,784 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 226 | cpp | #include <iostream>
using namespace std;
void main ()
{
double r;
cout<<"请输入正方形的边长:";
cin>> r;
double l,s;
l = 4*r;
s = r*r;
cout<<"正方形周长为"<<l<<endl;
cout<<"正方形面积为"<<s<<endl;
} | [
"1419744295@qq.com"
] | 1419744295@qq.com |
db98921a926e0d9b8120706fb25c9069bd77b5db | 2135d93183928ff868384f004697fcb251cbe7bf | /examples/source/c_call.cpp | 1e422657fc684269050482ee65eeb36c2dc5686f | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yangc999/sol2 | 192f0e84e34c809a40b725d573b4fdfe0090fb9b | dca62a0f02bb45f3de296de3ce00b1275eb34c25 | refs/heads/main | 2023-05-10T22:01:04.742464 | 2022-06-25T17:25:52 | 2022-06-25T17:27:29 | 315,809,866 | 0 | 0 | MIT | 2020-11-25T02:43:25 | 2020-11-25T02:43:24 | null | UTF-8 | C++ | false | false | 1,178 | cpp | #define SOL_ALL_SAFETIES_ON 1
#include <sol/sol.hpp>
int f1(int) {
return 32;
}
int f2(int, int) {
return 1;
}
struct fer {
double f3(int, int) {
return 2.5;
}
};
int main() {
sol::state lua;
// overloaded function f
lua.set("f",
sol::c_call<sol::wrap<decltype(&f1), &f1>,
... | [
"phdofthehouse@gmail.com"
] | phdofthehouse@gmail.com |
83fbcd19e88dceac5d5abc80b7ca792123fa9fd9 | 5af68d43b182694e6955be8de0a84ecea20c078d | /BlackCat.Physics.PhysX/PhysicsImp/Shape/bcTriangleMesh.cpp | e6b66bd2055843fe42cff9e54387ff42a5d0829d | [] | no_license | coder965/BlackCat-Engine | 1ed5c3d33c67c537eaa1ae7d1afe40192296e03f | a692f95d5c5f0c86ababa0c5ecc06531f569f500 | refs/heads/master | 2020-03-18T21:41:31.035603 | 2017-04-15T16:53:26 | 2017-04-15T16:53:26 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,398 | cpp | // [12/12/2016 MRB]
#include "PhysicsImp/PhysicsImpPCH.h"
#include "PhysicsImp/bcExport.h"
#include "PhysicsImp/Shape/bcTriangleMesh.h"
namespace black_cat
{
namespace physics
{
template<>
BC_PHYSICSIMP_DLL
bc_platform_triangle_mesh< g_api_physx >::bc_platform_triangle_mesh() noexcept
: bc_platform_physics... | [
"mohammad.r.barzegar@gmail.com"
] | mohammad.r.barzegar@gmail.com |
4b836e0c40b14794d761a4d1794626166d937e3f | e89a8e57e5c397b92d40c451308faf209b10a2fd | /Sudoku.cpp | 1db671315b503e8718c938587001272ac4a04047 | [] | no_license | NikBomb/SudokuSolver | 7c37f484c09177363b3d89307afb717e7984432e | 3e6c4e5930179ed7cad701dc74a71c676a485023 | refs/heads/master | 2021-08-14T11:39:59.850067 | 2017-11-15T15:04:08 | 2017-11-15T15:04:08 | 110,845,676 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,352 | cpp |
#include "stdafx.h"
# include <vector>
#include <math.h>
using namespace std;
/*Class That implements the sudoku as a double array*/
class Sudoku {
private:
int grid[9][9];
public:
Sudoku(int clues[9][9]);
Sudoku() { /*Method to initialise the Sudoku to zeros*/
int igrid;
int jgrid;
for (... | [
"noreply@github.com"
] | noreply@github.com |
65376de8e22d00ff5dcb3c896ff274a5872da471 | 2b332da28ca7d188892f72724400d79f16cda1b9 | /include/ce2/ext/enum_ext.hpp | 6d70a04b7e8a5106eed27d43aae4abb0ed816d52 | [
"Apache-2.0"
] | permissive | chokomancarr/chokoengine2 | e4b72f18f6fd832c2445b5c7bec1bb538ad62de1 | 2825f2b95d24689f4731b096c8be39cc9a0f759a | refs/heads/master | 2023-05-02T18:05:43.665056 | 2021-04-14T17:54:17 | 2021-04-14T17:54:17 | 191,103,464 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 815 | hpp | #pragma once
#include <type_traits>
#define CE_ENUM_OP_DEF(op) \
template <typename E, typename T>\
constexpr inline typename std::enable_if<std::is_enum<E>::value, E>::type operator op(E a, T b) {\
return E((size_t)a op (size_t)b);\
}\
template <typename E, typename T>\
constexpr inline typename std::enable_if<std::... | [
"puakai2010@gmail.com"
] | puakai2010@gmail.com |
f804e0751cc3c0835967a7bf96f2b266e2bbbd22 | 954bfd7c464f443cc3b006bbf4460fdc1534645e | /1203A.cpp | 66d82fe7f80095c85943a8e5495975cb7d03ce88 | [] | no_license | draconware/codeforces | 0f68ef88d9e00226e8802413209ffe33c3648003 | 0c92fe56092cb323ff67629ca45ac40007ac06f1 | refs/heads/master | 2021-01-01T06:01:39.191054 | 2019-12-13T07:55:20 | 2019-12-13T07:55:20 | 97,331,903 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,022 | cpp | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ff first
#define ss second
#define mp make_pair
#define pii pair<int,int>
#define pb push_back
int main(){
#ifndef ONLINE_JUDGE
freopen("input.in","r",stdin);
freopen("output.out","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin... | [
"noreply@github.com"
] | noreply@github.com |
adc760d1ee72e01efd9aaaa39469e7471b627d86 | ed27c2e31ec84826b3b66d2b3c159fb17ca3fbbf | /Advanced shaders/PixelLighting2/Mesh.cpp | c36a546383280021cc257a6a2e77a429187c1302 | [] | no_license | LiliVeszeli/Graphics | 69c3f8b5266b554039fc34ba262d4f2f545d28e1 | a079675849959a3278bad36851ac8bc7c49f08cd | refs/heads/master | 2022-05-30T22:49:12.800976 | 2020-05-03T10:36:20 | 2020-05-03T10:36:20 | 212,877,051 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,302 | cpp | //--------------------------------------------------------------------------------------
// Class encapsulating a mesh
//--------------------------------------------------------------------------------------
// The mesh class splits the mesh into sub-meshes that only use one texture each.
// ** THIS VERSION WILL ONLY K... | [
"47601474+LiliVeszeli@users.noreply.github.com"
] | 47601474+LiliVeszeli@users.noreply.github.com |
cbc5e5b485d2094ff9bae000df2153bd33efc761 | 182322f4f2800f851754bb1bcb85fd4f9fc324ea | /gcj/2015/round_1B/pb.cpp | 4d5bc20adf113e4f703bab4ffaee472ccaa9f4f1 | [] | no_license | Tocknicsu/oj | 66100fe94d76b6fe8d1bd3019f5ada9d686c1753 | e84d6c87f3e8c0443a27e8efc749ea4b569a6c91 | refs/heads/master | 2021-01-17T08:12:32.510731 | 2016-04-18T02:09:04 | 2016-04-18T02:09:16 | 32,704,322 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,088 | cpp | #include <bits/stdc++.h>
using namespace std;
int cost[5];
void calc(int r, int w){
fill(cost, cost+5, 0);
if( r > w ) swap(r, w);
if( r == 1 ){
if(w == 1){
cost[0] = 1;
return;
}
cost[1] = 2;
cost[2] = w - 2;
} else {
cost[2] = 4;
cost[3] =2 * ( r + w ) - 8;
cost[4] = r * w - cost[2] - cost[... | [
"wingemerald@gmail.com"
] | wingemerald@gmail.com |
be6ee0b7cfc792f211296919aa75266a77bc673b | 890577a365ee41df5ec3d1c347fc3294122d1f96 | /Heros Game - C++/Thief.h | 1e6d2fc91dd418f2ca85f0d4b5c867c3300d4ad9 | [] | no_license | michaltalmor/Practical-projects | d01377888c5bdbdb3d00f6d944ac2d352909faf7 | 70af317818f997c6c7acfa54d8f73a6373e2e2fd | refs/heads/master | 2020-06-17T01:52:19.062064 | 2020-02-17T14:45:01 | 2020-02-17T14:45:01 | 195,759,681 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 341 | h | /*
* Thief.h
*
* Created on: Dec 25, 2018
* Author: ise
*/
#ifndef THIEF_H_
#define THIEF_H_
#include <string>
#include "Hero.h"
using namespace std;
class Thief : public Hero {
public:
Thief(string name):Hero(name, "Thief"){}
~Thief();
bool specialAbility(Hero& other);
bool specialAbility();
};
#... | [
"noreply@github.com"
] | noreply@github.com |
9ec2e72c6feea44e9fea99a4007e7603793b0bce | a6e826224b4288004ab04ec49c878fc7a415e3b3 | /ClientMain.cpp | c4e9b66f4da93c9f07bf564fda93196f4a6a6fe5 | [] | no_license | sunchao4991/ChatRoom | 9bf09a8d2836e0edfecf36dab588294dc6c54094 | 95f124681ebd3f7688fa240deab23605ba159edb | refs/heads/master | 2020-05-05T13:40:31.850891 | 2019-04-08T07:00:04 | 2019-04-08T07:00:04 | 180,088,545 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 138 | cpp | //
//ClientMain.cpp
//chatroom
//
#include "Client.h"
int main(int argc, char *argv[]) {
Client client;
client.start();
return 0;
}
| [
"sunchao4991@163.com"
] | sunchao4991@163.com |
bbafc14486580435fad20e200de0cb690e359afd | bd7fd14de907e42bffa0691f5cfff1f8d11a3194 | /passManager/template.h | 028c1a8146691341186e8ba6168e4161dcb6095d | [] | no_license | yklym/passManagerCppQt | 62e665b53b88372846bd1024e1ca4697152c1ecb | a5c70448da6ee0df36f4aed90ec5af8b42500c29 | refs/heads/master | 2020-12-23T16:00:03.187492 | 2020-01-30T11:27:07 | 2020-01-30T11:27:07 | 237,198,298 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,098 | h | #ifndef TEMPLATE_H
#define TEMPLATE_H
#pragma once
#include <string>
#include <iostream>
#include <cstdio>
#include <vector>
#include <QString>
#include <QtCore>
#include<rpc/msgpack.hpp>
//
using std::string;
using std::vector;
struct Template
{
int id;
string login;
string password;
string pass_s... | [
"yaroslaw.klymko@gmail.com"
] | yaroslaw.klymko@gmail.com |
4daf52a11f37e4bdf016506e6b8713d43df0f1ba | d53362b59f80d96f902b0bfa7c4fd0530a79aeba | /type_names.hpp | 8b82f452ce1e875f71b3aef33f76a2bc596699e4 | [
"MIT"
] | permissive | milasudril/strint | ffcb8e5b3663bafc7e03cd3c4f0a3929f342e45b | a7f26ca3c89e0f15d195337c60b9ee389b92b549 | refs/heads/master | 2020-03-09T07:37:53.435767 | 2018-06-23T03:17:58 | 2018-06-23T03:17:58 | 128,668,570 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,397 | hpp | //@ {"targets":[{"name":"type_names.hpp","type":"include"}]}
#ifndef STRINT_STRINT_NAMES_HPP
#define STRINT_STRINT_NAMES_HPP
#include <cstdint>
namespace Strint
{
template<class T>
struct TypeInfo
{};
enum class TypeId:int
{
Int8
,UInt8
,Int16
,UInt16
,Int32
,UInt32
,Int64
,UInt64
};
te... | [
"milasudril@gmail.com"
] | milasudril@gmail.com |
b91b8fd8c59257e2a36506bd697d24ba1a861577 | 092d638d7e00daeac2b08a448c78dabb3030c5a9 | /gcj/gcj/188266/Mystic/168107/0/extracted/main.cpp | cd56b8e920a7da4a847ac6e1f184fc095eb1f7ef | [] | no_license | Yash-YC/Source-Code-Plagiarism-Detection | 23d2034696cda13462d1f7596718a908ddb3d34e | 97cfdd458e851899b6ec6802a10343db68824b8b | refs/heads/main | 2023-08-03T01:43:59.185877 | 2021-10-04T15:00:25 | 2021-10-04T15:00:25 | 399,349,460 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,308 | cpp | #include <fstream>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
ifstream fin("A-small-attempt0.in");
ofstream fout("file.out");
map <pair<int, int>, bool> happy;
bool isHappy(int num, int base) {
if(happy.find... | [
"54931238+yash-YC@users.noreply.github.com"
] | 54931238+yash-YC@users.noreply.github.com |
04e205bd3b472a59d1affbad906b83c100cd68ec | 8a9bb0bba06a3fb9da06f48b5fb43af6a2a4bb47 | /LeetCode/RemoveDuplicatesFromSortedArray.h | 6d62c7a285dbb500fa09d306c84fe90801e70369 | [] | no_license | ruifshi/LeetCode | 4cae3f54e5e5a8ee53c4a7400bb58d177a560be8 | 11786b6bc379c7b09b3f49fc8743cc15d46b5c0d | refs/heads/master | 2022-07-14T09:39:55.001968 | 2022-06-26T02:06:00 | 2022-06-26T02:06:00 | 158,513,101 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 113 | h | #include <vector>
using namespace std;
class Solution {
public:
int removeDuplicates(vector<int>& nums);
}; | [
"ruifshi@hotmail.com"
] | ruifshi@hotmail.com |
e273e19a2a9a0b253cfe414ceb143e114711d9f4 | 62126238af2e3e85b9337f66293c2a29946aa2a1 | /framework/Thread/ThreadWUP/Headers/ThreadRunMethodWUP.h | 015e1d39dfe40093d9c59bb2b4913434056df89a | [
"MIT"
] | permissive | metalkin/kigs | b43aa0385bdd9a495c5e30625c33a170df410593 | 87d1757da56a5579faf1d511375eccd4503224c7 | refs/heads/master | 2021-02-28T10:29:30.443801 | 2020-03-06T13:39:38 | 2020-03-06T13:51:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 991 | h | #ifndef _THREADRUNMETHODWUP_H_
#define _THREADRUNMETHODWUP_H_
#include <windows.h>
#include "ThreadRunMethod.h"
// ****************************************
// * ThreadRunMethodWUP class
// * --------------------------------------
/*! \class ThreadRunMethodWUP
Windows threadrun class
\ingroup ThreadWindows
*... | [
"antoine.fresse@assoria.com"
] | antoine.fresse@assoria.com |
cbf8997d373fe5f5e3352b04a4030c1f0933e403 | 3457d7cb2c7e48ff8cc2a359f8f8e5a92ecddc47 | /Source/InputMonitor.h | 368db148117d9dbc0dddbac7a50b647dadb66915 | [] | no_license | 467-Audio-Loop/467-Audio-Loop-Station | d02f9c4c0ebd18974eb2c0f3d6a1962a37cc21a7 | d5145249f1ef9cb94484113263f5b0cfe844b74e | refs/heads/master | 2023-03-13T04:12:16.356267 | 2021-03-10T18:59:00 | 2021-03-10T18:59:00 | 331,146,728 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,676 | h | /*
==============================================================================
InputMonitor.h
//DN: A simple AudioSource class where we can send the audio input in buffer
form, to be read from by our main mixer
==============================================================================
*/
#pr... | [
"dnegovan@gmail.com"
] | dnegovan@gmail.com |
4cb688a817df4f5d51f860fe14abae287cfb60dc | 3cf9e141cc8fee9d490224741297d3eca3f5feff | /C++ Benchmark Programs/Benchmark Files 1/classtester/autogen-sources/source-13334.cpp | 7c9219a74de84c0d21da1864d61e06d99ceb640e | [] | no_license | TeamVault/tauCFI | e0ac60b8106fc1bb9874adc515fc01672b775123 | e677d8cc7acd0b1dd0ac0212ff8362fcd4178c10 | refs/heads/master | 2023-05-30T20:57:13.450360 | 2021-06-14T09:10:24 | 2021-06-14T09:10:24 | 154,563,655 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,343 | cpp | struct c0;
void __attribute__ ((noinline)) tester0(c0* p);
struct c0
{
bool active0;
c0() : active0(true) {}
virtual ~c0()
{
tester0(this);
active0 = false;
}
virtual void f0(){}
};
void __attribute__ ((noinline)) tester0(c0* p)
{
p->f0();
}
struct c1;
void __attribute__ ((noinline)) tester1(c1* p);
struct c1 : c0
{
bo... | [
"ga72foq@mytum.de"
] | ga72foq@mytum.de |
e7519bf4d5d22a572dbbdebc68b80642b41c8dd9 | 3e281819bd3706ba78d620e31dce1a02c3a43441 | /test-core/projection/main_test_projection.cpp | 8dd76ed64b8aad1f1c55cdcaf1fa429ee1fd399c | [] | no_license | janchk/corecvs | 69eeda1404d8c127fb16be7073b86e5044faf6d6 | 7f1ed44256dae0a950d49ac12c218b906522547f | refs/heads/master | 2020-08-01T21:25:20.864718 | 2019-12-06T12:07:20 | 2019-12-06T12:07:20 | 211,121,283 | 1 | 0 | null | 2019-12-06T12:07:22 | 2019-09-26T15:23:53 | null | UTF-8 | C++ | false | false | 12,929 | cpp | /**
* \file main_test_projection.cpp
* \brief This is the main file for the test projection
*
* \date янв 20, 2018
* \author alexander
*
* \ingroup autotest
*/
#include <iostream>
#include "gtest/gtest.h"
#include "core/cameracalibration/projection/equidistantProjection.h"
#include "core/cameracalibration/... | [
"calvrack@googlemail.com"
] | calvrack@googlemail.com |
4ac28716c8b08bb45743be6f82e9ecea18d539e6 | 11c74b57455ce2454849fbe9a73a2e0d2a3542d2 | /contests/2020多校联合训练/杭电/题解/杭电ACM多校2020-1/2020 MUTC KUT Round/Codes/Submissions/boring-task-correct.cpp | 9d145aacb14860ac7ddb8aafc69fee31af1febab | [] | no_license | heyuhhh/ACM | 4fe0239b7f55a62db5bc47aaf086e187134fb7e6 | e1ea34686b41a6c5b3f395dd9c76472220e9db5d | refs/heads/master | 2021-06-25T03:59:51.580876 | 2021-04-27T07:22:51 | 2021-04-27T07:22:51 | 223,877,467 | 9 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,251 | cpp | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1LL << 60;
long long correct_solution(int n, const vector<long long> &T, const vector<int> &D) {
vector<pair<long long, int>> a(n + 1);
vector<long long> s(n + 1, 0);
for (int i = 1; i <= n; i++) a[i].first = T[i];
for (int i = 1; i <= n; i++) a[... | [
"2468861298@qq.com"
] | 2468861298@qq.com |
284892787e5e08cacabf32991abb9697d46b6690 | d61d05748a59a1a73bbf3c39dd2c1a52d649d6e3 | /chromium/net/base/expiring_cache.h | a22497b76e51d1ed546def6a0b80a9c1ec117e83 | [
"BSD-3-Clause"
] | permissive | Csineneo/Vivaldi | 4eaad20fc0ff306ca60b400cd5fad930a9082087 | d92465f71fb8e4345e27bd889532339204b26f1e | refs/heads/master | 2022-11-23T17:11:50.714160 | 2019-05-25T11:45:11 | 2019-05-25T11:45:11 | 144,489,531 | 5 | 4 | BSD-3-Clause | 2022-11-04T05:55:33 | 2018-08-12T18:04:37 | null | UTF-8 | C++ | false | false | 7,627 | h | // Copyright (c) 2012 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.
#ifndef NET_BASE_EXPIRING_CACHE_H_
#define NET_BASE_EXPIRING_CACHE_H_
#include <stddef.h>
#include <map>
#include <utility>
#include "base/gtest_pr... | [
"csineneo@gmail.com"
] | csineneo@gmail.com |
d6d3d952d69b567a49aeb8713958b9e556b4c87e | 94c8615196a08aa8704a56bb650fa1f49903592e | /sandbox/fft_single/proj/solution1/syn/systemc/fft_top.h | 98be0a72eee3bafab7b80e76d37e9f6423acb36b | [
"MIT"
] | permissive | trevor-crowley/mylab | ee78b4096767567b195a4f31bf21096a33a90ae0 | aa5af79c5aae47696697d058a6b906ba875dcd48 | refs/heads/master | 2021-05-09T02:28:58.804785 | 2021-04-16T17:12:43 | 2021-04-16T17:12:43 | 119,201,767 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,636 | h | // ==============================================================
// RTL generated by Vivado(TM) HLS - High-Level Synthesis from C, C++ and OpenCL
// Version: 2020.1
// Copyright (C) 1986-2020 Xilinx, Inc. All Rights Reserved.
//
// ===========================================================
#ifndef _fft_top_HH_
#def... | [
"trevor.crowley@henryschein.ca"
] | trevor.crowley@henryschein.ca |
fdab3c1ab7184c550f79b21aa4315d2b3a95c80e | 29f8c69e01b997d46ad5c59b2995b35cbd031f7e | /Project 3/Field.h | e9e9d3c2317511cba4b15b8e0745749b0df52c18 | [] | no_license | RichAguil/CSCI-335-Algorithms | 8cd3f59295bc0f396d57dca4ea65be49617abddc | e562e1011ddc8e5597e90c33fbf2171f655473bc | refs/heads/master | 2023-02-01T05:34:59.256557 | 2020-12-17T23:21:20 | 2020-12-17T23:21:20 | 315,523,706 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 492 | h | #ifndef FIELD_H
#define FIELD_H
#include <vector>
class Field {
private:
int length = 0;
int height = 0;
std::vector<std::vector<int>> storageMatrix;
std::vector<std::vector<int>> weightMatrix;
public:
Field(const std::vector<std::vector<int>>& input);
Field(std... | [
"ryaguilar23@gmail.com"
] | ryaguilar23@gmail.com |
706d11affd951feaad37a7784e73150aefc5094c | f3e95d0d6b87e7330f3ddc20b00df0673bcbc08b | /HPSEvioReader/Headbank.cpp | 8764a7112adb692639aecaa1e2c4914cd57f81e6 | [] | no_license | JeffersonLab/EvioTool | 88525821760d91da12827ea2214d107ffd4d1424 | 942cb3dfc7454bb3ff6435aca01a13f9c725829c | refs/heads/master | 2022-09-26T10:16:17.013108 | 2022-09-15T20:09:44 | 2022-09-15T20:09:44 | 164,700,955 | 2 | 1 | null | 2022-04-24T20:56:55 | 2019-01-08T17:34:44 | Java | UTF-8 | C++ | false | false | 157 | cpp | //
// Headbank.cpp
// HPSEvioReader
//
// Created by Maurik Holtrop on 6/18/19.
// Copyright © 2019 UNH. All rights reserved.
//
#include "Headbank.h"
| [
"maurik@physics.unh.edu"
] | maurik@physics.unh.edu |
ab715dfcb4a00257e43ff080eb6eb1d46dddd162 | 03faee3398730eb8b7b94c2d124aa1b66c02893d | /OceanLight/3rd/algServer/common/IMP_FrameQueue.cpp | 727be9808e175707ba6b3a060e36d6c31c9bc00e | [] | no_license | bianshifeng/OceanLight | a80829c6021662e22e987f0ddb12b3839c5c7ef2 | 697106f43397467966b76586862c1283d4326ed2 | refs/heads/master | 2021-01-13T14:05:26.721466 | 2017-05-03T07:48:57 | 2017-05-03T07:48:57 | 76,212,078 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,278 | cpp | #include "QDebug"
#include "IMP_FrameQueue.h"
#include "imp_algo_type.h"
IMP_FrameQueue::IMP_FrameQueue():
m_nQueueLen(0),
m_peekFlag(0),
m_queueHead(0),
m_queueTail(0),
m_queueMaxSize(DEFAULT_MAX_FRAME_QUEUE_SIZE),
m_nMallocWidth(DEFAULT_MALLOC_WIDTH),
m_nMallocHeight(DEFAULT_MALLOC_HEI... | [
"bianshifeng@ctvit.com.cn"
] | bianshifeng@ctvit.com.cn |
560fc2169c5e1ed9eeaf599fcbe17340ba0e1eb6 | 630cca2388c9a003bafeb0a5c4cd095ca41b54d9 | /Code/Engine/Network/NetConnection.cpp | cf172a9fb86a5e6628ae949c7be8039c91573f5f | [] | no_license | Junwon/JyakuhaiEngine | 49992bd787f3829694b0839d3ddf89b012d68d2a | 6a348ac351c910ef5965e80f908bb9eabd5d362b | refs/heads/master | 2021-05-09T12:03:01.272209 | 2018-01-26T04:05:53 | 2018-01-26T04:05:53 | 119,003,626 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 43 | cpp | #include "Engine/Network/NetConnection.hpp" | [
"johnnguyen@smu.edu"
] | johnnguyen@smu.edu |
72913508a09eb01094be3cd29acd1896ee22babe | 38b9daafe39f937b39eefc30501939fd47f7e668 | /tutorials/2WayCouplingOceanWave3D/EvalResults180628-Eta-ux-uy/28.4/uniform/time | 062a37e07379a9cb82eb7fb1bdb546b61694eeb4 | [] | no_license | rubynuaa/2-way-coupling | 3a292840d9f56255f38c5e31c6b30fcb52d9e1cf | a820b57dd2cac1170b937f8411bc861392d8fbaa | refs/heads/master | 2020-04-08T18:49:53.047796 | 2018-08-29T14:22:18 | 2018-08-29T14:22:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,003 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.1 |
... | [
"abenaz15@etudiant.mines-nantes.fr"
] | abenaz15@etudiant.mines-nantes.fr | |
72c7acdbe0a22563f9c34c884d8c6cd122334b8b | 03700e2ff7e48ca17443bf8aa3611e634a0acdc8 | /source/Kernel/HardwareAbstraction/Network/UDP.cpp | 8e1bada80fec37b4b17ebc5de7d95844c95f7e43 | [] | no_license | Wannabe66/mx | 432aac7b4ac7998e61fe2e432e54d9a03226e37a | f4f73da9bb7c2c0760de920ec2cb931846b90a31 | refs/heads/master | 2021-01-18T13:14:08.905424 | 2015-03-08T11:45:48 | 2015-03-08T11:45:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,873 | cpp | // UDP.cpp
// Copyright (c) 2014 - The Foreseeable Future, zhiayang@gmail.com
// Licensed under the Apache License Version 2.0.
// implements a set of functions to support processing UDP packets
#include <Kernel.hpp>
#include <HardwareAbstraction/Network.hpp>
using namespace Library;
namespace Kernel {
namespace Har... | [
"zhiayang@gmail.com"
] | zhiayang@gmail.com |
015fbd307bc7f856cc906e082a8890b0638c90ac | 9ad4e9b71adff85887c615af63cd29be49f2216f | /Contest10/TaskA/main.cpp | e88f6463849465a846f4fce854b53f02c9f72ce6 | [] | no_license | VodimShilin/Algo_2sem_Vadim_Shilin | f9e27adaa51d3c3ac20eee5ecb5af183fed61cac | 0c76c5a098fde93bc394769c313ff707a5cfb6b2 | refs/heads/main | 2023-06-14T03:41:54.036840 | 2021-07-07T14:20:31 | 2021-07-07T14:20:31 | 342,899,112 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,964 | cpp | #include <iostream>
#include <vector>
constexpr long long INF = 2'147'483'647;
struct Edge{
Edge() = default;
Edge(const Edge&) = default;
Edge(Edge&& another): x(another.x), y(another.y), w(another.w), index(another.index) {}
Edge reverse() {
std::swap(x, y);
return *this;
}
l... | [
"VodimShilin"
] | VodimShilin |
81745a4ffcb1ae254b7cf6548f178e7ac69dbd5f | 1a65adea801d4bbd2510006830d1f7573a5c9434 | /version1.5/sxEngine/sxRender/sxShader3D.cpp | eeb12e5ef8be09a0a5190de45719d4da935e2ad0 | [] | no_license | seganx/old-engine | 4ed9d6165a6ed884b9e44cd10e2c451dc169d543 | e5b9fbc07632c870acb96b8448b5c9591111080c | refs/heads/master | 2020-08-08T21:23:26.885808 | 2019-10-09T13:18:03 | 2019-10-09T13:18:03 | 213,920,786 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,666 | cpp | #include "sxShader3D.h"
#include "sxDevice3D.h"
#include "sxResource3D.h"
namespace sx { namespace d3d {
Shader3D::Shader3D( void ): m_Effect(NULL), m_curTech(NULL)
{
}
Shader3D::~Shader3D( void )
{
//Resource3D::ReleaseEffect(m_Effect);
}
bool Shader3D::Exist( void )
{
return m_Effec... | [
"seganx@38cbe2c2-61fc-4d10-a75b-7a9200028551"
] | seganx@38cbe2c2-61fc-4d10-a75b-7a9200028551 |
a9a5573ac9e460a0ca4ef832d197e9a06f39ad0a | e37d0e2adfceac661fbd844912d22c25d91f3cc0 | /CPP-Data-Structure/appendix-b/b05_switch_case.cpp | 8a43ebbf9e9cffd0679dd6254ddb28779b9ec11b | [] | no_license | mikechen66/CPP-Programming | 7638927918f59302264f40bbca4ffbfe17398ec6 | c49d6d197cad3735d60351434192938c95f8abe7 | refs/heads/main | 2023-07-11T20:27:12.236223 | 2021-08-26T08:50:37 | 2021-08-26T08:50:37 | 384,588,683 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,025 | cpp |
/* Execute switch-case statement */
#include<iostream>
using namespace std;
int main(void){
int a,b;
cout<<"==============================================="<<endl;
cout<<"Integer four operations"<<endl;
cout<<"Please input two numbers:";
cin>>a>>b;
cout<<"Please input the necessa... | [
"noreply@github.com"
] | noreply@github.com |
33d49197da978435cebc245590b0842de1a59e9f | a008b112837ba18b5a3325bf559a78a1993d0717 | /courses/clang/No4/13_thousand.cpp | cfb35647c021c889852bd78c53b70329533bc140 | [] | no_license | jokerlee/college | 4509aadc180ad2a4e11dc19e56af2b9f4cd6ba03 | 3fbbb79d86b25e55a68141c3ee1292af0b48af1a | refs/heads/master | 2020-12-24T16:49:24.656255 | 2014-01-31T04:19:45 | 2014-01-31T04:19:45 | 16,399,338 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,174 | cpp | /*
Name:13.千分位
Copyright: free
Author: Joker Lee
Date: 31/10/06 21:40
Description: 将输入的数从个位起，每三位之间加一个逗号
*/
#include <stdio.h>
#include <stdlib.h>
int main()
{
int div=1;//除数,用于将数字三位三位地分开
int i=0;//储存数字的位数
int j=0, k = 0,;
int result;//result用于储存分离后的三位
int num, tempnu... | [
"lijie@hortorgames.com"
] | lijie@hortorgames.com |
62892045c535458db0cbe770eb4799896df96c5c | 17f913bb741911b547948cc7300be5600fef4dfd | /Devices/Generic HTTP Device/NodeMCU.ino | b11d857c7e09ed5f37b8821956cc90f4221a3d37 | [
"Apache-2.0"
] | permissive | asushugo/SmartThings | bfe21c89a385577a9582d62242d5ef16b4a4a7f1 | 43deff26b04c4836f0360e7c6077f15221b5f9bd | refs/heads/master | 2020-03-12T05:49:29.258907 | 2018-02-02T17:07:54 | 2018-02-02T17:07:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39,671 | ino | /**
* ESP8266-12E / NodeMCU / WeMos D1 Mini WiFi & ENC28J60 Sample v1.0.20171030
* Source code can be found here: https://github.com/JZ-SmartThings/SmartThings/blob/master/Devices/Generic%20HTTP%20Device
* Copyright 2017 JZ
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use th... | [
"jzelyeny@gmail.com"
] | jzelyeny@gmail.com |
7295599085f66c2df320488ef2bef91d9785a023 | ef3145c7202afa96df2afbd8fbaea8529cfa2d14 | /sacache.cpp | d5a561fd6bde22b49662e66d686ea916046d5df4 | [] | no_license | vincentssheng/Caching | 24d53e7ba87dbc845f5b0e0e5538554c71fdf841 | 70ca28c1e00128b0ec799b7aad062bbcce65f397 | refs/heads/master | 2020-03-30T10:47:12.430802 | 2018-10-01T18:25:11 | 2018-10-01T18:25:11 | 151,136,102 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,997 | cpp | #include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <cstring>
using namespace std;
class cacheLine
{
public:
cacheLine()
{
tag = -1;
counter = 0;
dirty = 0;
}
int tag; //converted from first two hex digits of addr
string bytes [8];
int dirty;
... | [
"shengyeesiow96@gmail.com"
] | shengyeesiow96@gmail.com |
7003003e734fd5b3240909ee650229d0ea01f3ba | 97ce7536ed81a0cfefa746824f7f0ec38d7021fb | /tetris/trie.cc | 59af6e52295eefe0ac5404e633e6659218ca4981 | [] | no_license | k10bradley/projects | 10165974207551a6880ba366b4d106a52859499e | 89c2a2768ecb3754d5aebeafd1d833dab421ea0b | refs/heads/master | 2020-05-31T13:00:39.354640 | 2019-06-04T23:38:49 | 2019-06-04T23:38:49 | 190,294,024 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,267 | cc | #include "trie.h"
#include <vector>
#include "command.h"
#include <memory>
#include <iostream>
using namespace std;
char translate(char in){
if ( 'a' <= in && 'z' >= in ) return in - 'a';
else return in - 'A' + 26;
}
struct Trie::TrieNode{
Op op = NONE;
vector<TrieNode*> children;
bool final = false;
... | [
"kcpbradl@uwaterloo.ca"
] | kcpbradl@uwaterloo.ca |
9bdb0b3461ae64717c77c1807a50654bedafcab4 | da83490ee5951d0a5e6bb469b6a9f69dda1efd0d | /priorityQueue.h | dcc6474e9d83833dede949c2b1b9d1bb806d21cd | [] | no_license | venkatkrish1983/Prep | 312326c3e2b0eb9d313ae6b2c1907504c03e117e | 0427812e9c7cb5e12be60185eee332eb5c1ab548 | refs/heads/master | 2021-05-08T18:26:41.567655 | 2021-05-05T11:11:30 | 2021-05-05T11:11:30 | 119,519,883 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,883 | h | #include <vector>
#include <exception>
using namespace std;
class queueEmptyException; //forward declaration
template <class T>
class PriorityQueueADT
{
//Even Priority queue can be implemented using LL but insert will be O(n) but delete and max element is O(1)
public:
virtual void enqueue(T elem) = 0;
virtual T... | [
"noreply@github.com"
] | noreply@github.com |
41ad0da4bd82d2cde5313e7e83c0c5db95866b7b | 2b26d7846abc385af2bbbde150ba07e11d11e91e | /rdd.h | 7001fd82248174fbe2b14ec5030f3b712729b193 | [] | no_license | hdaikoku/mapreduce-mpi | 6fcefc2cfd7146c99710e8d179df6730bf58e76f | 692d58b288f40e35f939503c4ec306eb680c619a | refs/heads/master | 2020-12-25T14:12:44.939450 | 2015-11-18T09:07:22 | 2015-11-18T09:07:22 | 62,628,214 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 564 | h | //
// Created by Harunobu Daikoku on 2015/09/02.
//
#ifndef RDD_MAPREDUCE_RDD_H
#define RDD_MAPREDUCE_RDD_H
#include <iostream>
#include <memory>
#include <string>
#include <mpi.h>
using namespace std;
class Rdd {
public:
Rdd();
virtual ~Rdd() {
if (!MPI::Is_finalized()) {
MPI::Finalize();
}
}
... | [
"daikoku@hpcs.cs.tsukuba.ac.jp"
] | daikoku@hpcs.cs.tsukuba.ac.jp |
b92589123c455ca333554a4ea6c291f5854b7a89 | 9fad4848e43f4487730185e4f50e05a044f865ab | /src/device/bluetooth/bluetooth_remote_gatt_service_win.cc | 95e43cc2bc32bd5ebf59a1c4574811b4ba04da92 | [
"BSD-3-Clause"
] | permissive | dummas2008/chromium | d1b30da64f0630823cb97f58ec82825998dbb93e | 82d2e84ce3ed8a00dc26c948219192c3229dfdaa | refs/heads/master | 2020-12-31T07:18:45.026190 | 2016-04-14T03:17:45 | 2016-04-14T03:17:45 | 56,194,439 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,902 | cc | // Copyright 2016 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 "device/bluetooth/bluetooth_remote_gatt_service_win.h"
#include <memory>
#include "base/bind.h"
#include "base/memory/ptr_util.h"
#include "dev... | [
"dummas@163.com"
] | dummas@163.com |
42ef0f9ea60e4a53f86692bd43a99980b1b3a903 | 0f103905a89b79de0164a9199301dc7ddb62070c | /util/Cubemap.h | 3711dbb7acc184436365fbea56c9318338fd751d | [
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer",
"BSD-2-Clause"
] | permissive | alexander-koch/3D-Game-Engine | 3f750033c63af00087f4dc7cf40ee068bd0b7822 | a55bedaec05428ecbbd333dd357e0f3599afeb25 | refs/heads/master | 2021-01-18T21:07:53.494175 | 2016-05-23T17:36:09 | 2016-05-23T17:36:09 | 47,876,356 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,020 | h | /*
* Copyright 2015 Alexander Koch
* File: Cubemap.h
*
* 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... | [
"kochalexander@gmx.net"
] | kochalexander@gmx.net |
01b7374270d9c34f1467673c482f79fd91531ffc | 844e750651845083b94ca81dcf1f42b3eb319e01 | /codesheet/644c.cpp | 1e4f888f16b27078ece0f31b96b4d4d7411995ce | [] | no_license | qwertyran3/coding | fe197d1e1fbff9ffbb472dd46a735828361d99b1 | c08b24522e3c093de9927cf7f36c02da3a852aee | refs/heads/master | 2022-12-24T19:03:16.890969 | 2020-09-30T15:32:06 | 2020-09-30T15:32:06 | 258,968,150 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,949 | cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ini(arr, val) memset(arr, (val), sizeof(arr))
#define loop(i,n) for(ll i=0; i<n; i++)
#define loop1(i,n) for(ll i=1; i<=n; i++)
#define all(a) (a).begin(),(a).end()
#define tr(a) (a).begin(),(a).end(),(a).begin()
#define dupli(a) ... | [
"qwertyrani3@gmail.com"
] | qwertyrani3@gmail.com |
7af937530a5906bfd0a6ee5380aeb7eefae4ad05 | 9f9bbadcd24cb995c231c018ff2b4746e92a0e8a | /file_org/even.cpp | a11d3b510b1a84346a76d8297614f32af5ff6777 | [] | no_license | ShivamTripathi21/basic_cpp | 4462a49f28a2511642fd5af0da1c1a874e67f512 | f212c60f9db151c734f04ac2ce573ffd384411ef | refs/heads/master | 2020-03-25T18:06:01.809157 | 2018-09-29T15:00:49 | 2018-09-29T15:00:49 | 144,012,676 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 103 | cpp | #include "functions.h"
bool iseven(int number){
if(number % 2 == 0)return true;
else return false;
}
| [
"noreply@github.com"
] | noreply@github.com |
5c7de561ebe1227c43fd1019e96d09c5445d5fc1 | 7eff9d7b7feebbc972b21569439eb28fa13e5c71 | /Window System Programming/Day_4/Day_4/stdafx.cpp | 21cc5a0544d960638de444c0a843cdd25ad15c1b | [] | no_license | rlarlgns/study | fe67e5951c8d5a6498dbf6d12fb8e25dc1bc48c0 | 12abb79f5f73853feee8f03fde8c3a3d06c27cd3 | refs/heads/master | 2021-05-23T04:14:58.869789 | 2020-05-01T08:25:04 | 2020-05-01T08:25:04 | 81,773,025 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 233 | cpp |
// stdafx.cpp : 표준 포함 파일만 들어 있는 소스 파일입니다.
// Day_4.pch는 미리 컴파일된 헤더가 됩니다.
// stdafx.obj에는 미리 컴파일된 형식 정보가 포함됩니다.
#include "stdafx.h"
| [
"21kihoon@gmail.com"
] | 21kihoon@gmail.com |
b83bba63fb52308780f32e686cd79a1f9ded489a | 1df9106e475d7f1b4de615cb4f8122cc93305b7b | /Engine/ThreadLocks.h | 23ac3faca4c32b87831eb62fc23b19cbc92351c4 | [] | no_license | mcferront/anttrap-engine | 54517007911389a347e25542c928a0dd4276b730 | c284f7800becaa973101a14bf0b7ffb0d6b732b4 | refs/heads/master | 2021-06-26T08:48:59.814404 | 2019-02-16T05:37:43 | 2019-02-16T05:37:43 | 148,593,261 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,562 | h | #pragma once
#include "EngineGlobal.h"
class CriticalSection
{
friend class CriticalSectionScope;
private:
#if defined WIN32
CRITICAL_SECTION c;
#else
#error "Platform Undefined"
#endif
public:
CriticalSection( uint32 spinCount )
{
#if defined WIN32
BOOL result = InitializeCriticalSectionAndSpi... | [
"trapper@trapzz.com"
] | trapper@trapzz.com |
a75d70280bc0862eef9e4d26c26fbd44d7047890 | 6689c67620eaab900809c0cce761a9c046b389b3 | /C++/OOPS/class.cpp | e4bb2a03226d71e7b35d410e453bfb3ffda6b9ba | [] | no_license | manmeet17/Competitive-Coding | 33ecf0d56ca4a17c1adf6e96bbce69d40afe06cf | e161623eb5a4c4610663fadade6523b9ae87407d | refs/heads/master | 2020-12-30T14:44:26.708633 | 2019-05-24T12:49:30 | 2019-05-24T12:49:30 | 91,076,872 | 0 | 1 | null | 2017-10-28T19:19:32 | 2017-05-12T09:49:41 | C | UTF-8 | C++ | false | false | 903 | cpp | #include<bits/stdc++.h>
using namespace std;
class Geeks
{
private:
double rad;
public:
string geekname;
void printname();
void print()
{
cout<<"Geek: "<<geekname<<endl;
}
double compute(double r)
{
rad=r;
doub... | [
"meetutarun16@gmail.com"
] | meetutarun16@gmail.com |
dfaeaf8a911ec29b50d97b0a6e532b720c024b71 | f394c65d386ec9e3720dd1f559d96c209fe94114 | /trees/binary_search_tree/application/second_largest_node/include/second_largest_node.hpp | aa17f4d314f992e90eeba8600fde8c7a00b2eb5b | [] | no_license | ktp-forked-repos/algorithms-8 | 875ef6aeecf6510f3954c8daa55ac4e76aaf7871 | 74007a5ef4f8b0a7a1416dcc65eeeab3504792b4 | refs/heads/master | 2020-05-25T19:20:05.204701 | 2018-04-11T13:32:58 | 2018-04-11T13:32:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 765 | hpp | //
// second_largest_node.hpp
// algorithms. BST application.
//
// Created by alifar on 10/28/16.
// Copyright © 2016 alifar. All rights reserved.
//
#include <binary_search_tree.hpp>
/*
Write a function to return the second largest node of a tree/subtree
*/
template <class T>
Tnode<T> * LargestNode(Tnode<T> *... | [
"lifar_tut_net@mail.ru"
] | lifar_tut_net@mail.ru |
aa9d7294a36fffb88f552eef22a7faa1e71f629e | 5670418126e79fa4eff199dfbda340727ad30ada | /map/mapgenerator.cpp | cb36d5dbd76afc762f6e176031184ed5a9d60241 | [] | no_license | wokste/steamdiggerengine | 1a8be37598f9d50a6015af35624428fcbae43b08 | d0e79a94d8dc660d25011e344cac4d3cea246928 | refs/heads/master | 2021-01-17T09:37:55.707891 | 2013-10-20T09:10:09 | 2013-10-20T09:10:09 | 12,185,012 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,904 | cpp | /*
The MIT License (MIT)
Copyright (c) 2013, Steven Wokke
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,... | [
"wokste@gmail.com"
] | wokste@gmail.com |
430dbb118a95a4a5ff02153bb1dd66d6ba72523f | 1ba99208487e49075f687fa8b6ae17d4ea50c681 | /Code/CGAL/tmp/segments.cpp | 5e4c7345cd8562d43104d843844b4cebde67693c | [] | no_license | aocalderon/RIDIR | e79d33711ea5d355b272500969826953a6cae897 | 0ebab5c0160e1ed16ed365dc902e62d06b5b7654 | refs/heads/master | 2023-05-26T14:11:39.936432 | 2023-05-12T03:40:48 | 2023-05-12T03:40:48 | 181,546,524 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,331 | cpp | #include <iostream>
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/linestring.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/assign.hpp>
#include <vector>
template <typename Segment>
struct gather_segment_statistics
{
// Remember that if coordinates are integer, the leng... | [
"acald013@ucr.edu"
] | acald013@ucr.edu |
0bd3c748b68752e6a824dc05251662f24b57616e | 20f46879a2e0a354aad80db7aee0259f24f9602a | /src/tools/clang/tools/extra/clang-tidy/cppcoreguidelines/ProBoundsArrayToPointerDecayCheck.h | ec6979a5069b18107cbf2ed4fb600802a1ebe7d1 | [
"NCSA"
] | permissive | apple-oss-distributions/clang | e0b7a6ef6d2ee6fdd4ab71e5dc0a4280cb90a6f3 | 8204159ac8569f29fddc48862412243c2b79ce8c | refs/heads/main | 2023-08-14T22:37:07.330019 | 2016-12-09T19:27:15 | 2021-10-06T05:11:14 | 413,590,209 | 7 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,285 | h | //===--- ProBoundsArrayToPointerDecayCheck.h - clang-tidy--------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... | [
"91980991+AppleOSSDistributions@users.noreply.github.com"
] | 91980991+AppleOSSDistributions@users.noreply.github.com |
f4071a9b3c8841d27bdf023d5d0600444d45c0e6 | 879681c994f1ca9c8d2c905a4e5064997ad25a27 | /root-2.3.0/run/MicroChannelFOAM/TurbulenceMicroChannel/0.028/alpha.water | 541805200f1048130c253f5af864f4766fd76ff9 | [] | no_license | MizuhaWatanabe/OpenFOAM-2.3.0-with-Ubuntu | 3828272d989d45fb020e83f8426b849e75560c62 | daeb870be81275e8a81f5cbac4ca1906a9bc69c0 | refs/heads/master | 2020-05-17T16:36:41.848261 | 2015-04-18T09:29:48 | 2015-04-18T09:29:48 | 34,159,882 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,668 | water | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.3.0 |
... | [
"mizuha.watanabe@gmail.com"
] | mizuha.watanabe@gmail.com |
419b696d1fdb25d3e488932254f16ea508632d48 | 260b2307c4cf8e7f68fdc7011e0804eeff6aea74 | /manyglucose-4.1-60/parallel/PrdClausesQueue.cc | 13da4ebca73611090bfd07d4d20a26d7183f0cf8 | [
"MIT"
] | permissive | nabesima/manyglucose-satcomp2020 | 32775ae466ef32b89a03c9bc95d5ecf957b917cf | 6eede39f609b1283e8eda4745a0642007d7643a2 | refs/heads/master | 2022-06-09T06:34:13.940750 | 2020-04-29T07:47:37 | 2020-04-29T07:47:37 | 257,584,234 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,922 | cc | /***********************************************************************************[LocalVals.h]
Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson
Copyright (c) 2007-2010, Niklas Sorensson
Copyright (c) 2017-2018, Hidetomo Nabeshima
Permission is hereby granted, free of charge, to any person obtaining a copy of t... | [
"nabesima@yamanashi.ac.jp"
] | nabesima@yamanashi.ac.jp |
3935a616f4756f079e9dd74a48e74cffee9f720e | 4b079e58941be01982b59f92b02a63dc59439aa3 | /ghkm/basic/MemDgnst.h | d96819fdc7e4346fca5dbf2e3cae559d6f0449ca | [] | no_license | isi-nlp/sbmt | 143b784540e79cdbeaed3655588e8f4e38157284 | 56b2a2651b7741219657d095db3ebd7875ed4963 | refs/heads/master | 2020-04-06T13:56:13.370832 | 2018-11-21T18:59:31 | 2018-11-21T18:59:31 | 47,573,153 | 6 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 986 | h | // Copyright (c) 2001, 2002, 2003, 2004, 2005, Language Weaver Inc, All Rights Reserved
/*
* Class for memory diagnostics.
*/
#ifndef _MemDgnst_H_
#define _MemDgnst_H_
#include "LiBEDebug.h"
#include <cassert>
//! Memory allocation class.
class MemDgnst : public LiBEDebug {
public:
virtual ~MemDgnst() {}
inline ... | [
"pust@Michaels-MacBook-Pro-2.local"
] | pust@Michaels-MacBook-Pro-2.local |
92b9015d81f6b33eff0929afc700a63083c4f522 | 575a7fff16e2f34d8515c62be210c27f3d1df4aa | /src/minerplot.h | aaad9ed88f0c98ee56768663bebbdec8ca90bdee | [
"Unlicense"
] | permissive | GeopaymeInc/AvalonMiner | 5c1398be6a6165e690c4593fffc0c124398fa23d | 7ec1ec45f9bfcaaeee0acffcc0900c802faf40db | refs/heads/master | 2021-05-30T00:18:35.623535 | 2014-08-27T02:29:18 | 2014-08-27T02:29:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 911 | h | #include <qwt_plot.h>
#include <qwt_legend.h>
#include <qwt_plot_canvas.h>
#include "minerstat.h"
class QwtPlotCurve;
class MinerPlot : public QwtPlot
{
Q_OBJECT
public:
MinerPlot(QWidget * = 0);
const QwtPlotCurve *minerCurve(int id) const
{
return data[id].curve;
}
vo... | [
"ecl.time@gmail.com"
] | ecl.time@gmail.com |
f2eb25f88e3257c0cb1a101e3a951ed5745c2370 | f41e49c73435d88cb8319d088acb4f4a5de44c71 | /binary_search_recursion.cpp | 7eddc758baaf122f8231804cfa6252f7470dff6e | [] | no_license | MansiSMore/Searching-and-Sorting-Algorithms | 9b6c3d80bf97215cf1ff974bf2feb394532119be | 91555e304898b5ab28f1777e9d34e436799a332b | refs/heads/main | 2023-07-15T21:58:51.049957 | 2021-08-23T20:33:37 | 2021-08-23T20:33:37 | 399,202,890 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,390 | cpp | //Binary Search - Search a sorted array by repeatedly dividing the search interval in half.
//The time complexity : O(logn).
/*
Note : Thank you. Exactly what I was looking for. (left + right) / 2 is not a safe operation on high numbers.
Better to use left + ((right - left)/2) or (right + left) >> 1 which are equival... | [
"noreply@github.com"
] | noreply@github.com |
93124b372dbbbbec6fce3db33142c3b83b1af28c | 68ae824285562080e9cf090119c49b15f89093a0 | /linkList/445.cpp | 6dc29549977238dab7e88dc8b6a3d42cda6b57e7 | [] | no_license | ZexinYan/Introduction_to_algorithm_notebook | 55e58e2d4decf507835fff53058fe302e4363e0b | 9d137bd092040f21465339e216a1809e8ded248e | refs/heads/master | 2021-06-14T21:38:58.074432 | 2017-04-05T08:02:25 | 2017-04-05T08:02:25 | 75,030,644 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,109 | cpp | /**
* differ from 2.cpp
*/
class Solution {
private:
int getLen(ListNode* l1) {
ListNode* tmp = l1;
int num = 0;
while (tmp) {
num++;
tmp = tmp->next;
}
return num;
}
ListNode* helper(ListNode* l1, ListNode* l2, int offset) {
if (!l1)... | [
"yzx9610@outlook.com"
] | yzx9610@outlook.com |
0bb7443213d5952d91e065856e064ffa0bb48465 | 12979489d3489cfca9ec627a91830bd8ac695be8 | /symbletable/symbletable.h | 940e2b8a45c1a7867129c08d306cb5e27de8cb9b | [] | no_license | linan1109/C0-compiler | 20388276835d59ed67347c8c3a6c1abf22d84966 | ab7e1f82ff97738e57120bb0707b6c2b963c3269 | refs/heads/master | 2022-04-24T11:51:25.643269 | 2019-12-24T13:09:05 | 2019-12-24T13:09:05 | 229,587,717 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,329 | h | #pragma once
#include <vector>
#include <optional>
#include <utility>
#include <cstdint>
#include <algorithm>
#include <instruction/instruction.h>
namespace miniplc0 {
class one_symbol final{
std::string _name; //标识符名称
int32_t _kind; /*种类
0... | [
"linan119@yeah.net"
] | linan119@yeah.net |
926dc57e8427a90cf2db9f04ba111f86a7855d32 | 8a2f3bb64e8feb3ccff65eb3edf86a47d62b0b10 | /360/src/common/statictextbutton.cpp | f79ca7ba4d1c1ad3cea16480e017c0b0e98c2168 | [] | no_license | GLDsuh-a/qt-1 | 010489a59a26a62747eaadddf37e4b0d80546460 | 0a642fa56f71d94e7f815305a806173c8e586ddb | refs/heads/master | 2021-01-17T06:59:12.293528 | 2015-08-28T03:08:13 | 2015-08-28T03:08:22 | 41,582,969 | 7 | 2 | null | 2015-08-29T06:18:11 | 2015-08-29T06:18:11 | null | UTF-8 | C++ | false | false | 855 | cpp | #include "statictextbutton.h"
#include <QLabel>
#include <QVBoxLayout>
#include "staticbutton.h"
StaticTextButton::StaticTextButton(QWidget *parent)
: QWidget(parent)
{
m_num = 4;
m_button = new StaticButton;
m_textLabel = new QLabel;
m_textLabel->setObjectName("staticText");
QVBoxLayout *vLay... | [
"ltz121320@163.com"
] | ltz121320@163.com |
a2fca666eac7994bda873d4fce38ade342fe1e45 | 3accd018e09d3fa1cf1a403219a7a64d00866210 | /AlgorithmicPractice/AlgorithmicPractice/Demo5/Demo5_1/Demo5_1_SortList.cpp | e2b98958078c8315d4440b28714daf3e9ebbd6be | [] | no_license | COMOCO-5672/AlgorithmicPractice | cd40bbfd87f172bc315dd732000c99daf594514f | 553f7efe1e3e6f057d9c5490ed9e158e2d550f52 | refs/heads/master | 2023-08-25T00:26:00.693198 | 2020-12-17T13:49:42 | 2020-12-17T13:49:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 772 | cpp | //
// Demo5_1_SortList.cpp
// AlgorithmicPractice
//
// Created by 帅斌 on 2019/2/20.
// Copyright © 2019 personal. All rights reserved.
//
#include "Demo5_1_SortList.hpp"
ListNode* sortList(ListNode* head) {
if (!head || !head->next) return head;
ListNode *slow = head, *fast = head, *pre = head;
while ... | [
"1533607721@qq.com"
] | 1533607721@qq.com |
7816a5ec9717923d675cc7cf34b503aefd0f5fce | 70015191dd9eef400d81240a321acfdd1df859bb | /examples/sessionusage/main.cpp | b05431557e941f0def40608c4955a9cc57985f06 | [] | no_license | SindenDev/Qtufao | 6050f21ac82ad803b46958881961bff0da10a07e | 55bf878c9757c72e7b5f529a3fe96884a260b931 | refs/heads/master | 2021-01-15T21:25:17.054141 | 2017-08-11T01:05:32 | 2017-08-11T01:05:32 | 99,868,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,517 | cpp | /*
Copyright (c) 2012 Vinícius dos Santos Oliveira
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, merg... | [
"sindendev@foxmail.com"
] | sindendev@foxmail.com |
5ca5fb3a252775c8fb7809a6f0653ee8d6a4632f | 67611090dd9203fcac9febdaef32f1ab60d777b6 | /c++/faster-than-wind/ftw-editor/src/Editor/UI/button.cpp | f52b76f89261aa5ea47ae88b6d3656e9feaa2abd | [] | no_license | Hopson97/Ancient-Projects | bdcb54a61b5722a479872961057367c96f98a950 | bea4c7e5c1af3ce23994d88a199427ac2ce69139 | refs/heads/master | 2020-06-26T18:39:08.194914 | 2020-03-16T07:55:40 | 2020-03-16T07:55:40 | 199,717,112 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,367 | cpp | #include "button.h"
/*
=================================================================================================================================================================
Button is class that is a.. well a button that can be clicked.
================================================================... | [
"mhopson@hotmail.co.uk"
] | mhopson@hotmail.co.uk |
7f8075427cbdfc3a89b7b93d0de3c00d77f89b5d | 5a90e6067568350d489b3d2f6564aaad07e6a50c | /OpenFOAM-Wing-Mesh-Refinement-Study-main/OpenFOAM-Wing-Mesh-Refinement-Study-main/Mesh_Refinement/case1/0/omega | bd871a3e68e060205b85efc26f9491fa8351461d | [
"GPL-3.0-only",
"MIT"
] | permissive | Aeroguyyy/OpenFOAM-Cases-Interfluo | 97fdecc4ccf45c0d6db6031a38e0f86854315230 | 6d8ca5639d601e3d1766cc4edf32eba5db93bb2c | refs/heads/main | 2023-07-12T03:35:05.621598 | 2021-08-20T02:00:31 | 2021-08-20T02:00:31 | 398,274,700 | 1 | 0 | MIT | 2021-08-20T12:49:52 | 2021-08-20T12:49:52 | null | UTF-8 | C++ | false | false | 1,302 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2012 |
... | [
"79390007+Interfluo@users.noreply.github.com"
] | 79390007+Interfluo@users.noreply.github.com | |
4b02f8d75cabe578422cbca0a2cd90af67531416 | 837c4ac8f0ebb45a59b1305077180e21f41d6ddb | /lab7_q2.cpp | 7d5edcb359492e0b724f24983827108e83f6f6c5 | [] | no_license | nayantharar/cs141-lab7 | ce3d2f9675f703070fbbf6d07957291817009e0f | 2352a117ba006bc667e6022981ea68ca75005641 | refs/heads/master | 2020-03-31T00:14:35.651054 | 2018-11-23T12:26:34 | 2018-11-23T12:26:34 | 151,731,900 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 540 | cpp | //include the library
#include<iostream>
using namespace std;
//declaration and definition of the recursive function
int printnum(int n,int a)
{ //loop terminator
if(a>n)
{
return 0;
}
//loop running
else
{
//printing the numbers in the increasing order
cout<<a<<endl;
a++;
/... | [
"noreply@github.com"
] | noreply@github.com |
0e4dfd63599d82ee76ae6c4502a09f92210b7e83 | 5c23b302684f260fbbad2edfe19dd7cf16fd822c | /ch03/exercise_3_35.cpp | f9b247355efa1db841735494eef20630f17a2368 | [] | no_license | platoTao/CPP_Primer_Answer | 123c99b0283ba15d51037cf16f2a6886b570d394 | b1837239c9d58e54587f7a5ae44ee220238f5c95 | refs/heads/master | 2021-04-03T06:43:04.089574 | 2018-06-10T06:25:57 | 2018-06-10T06:25:57 | 124,714,759 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 270 | cpp | #include<iostream>
#include<vector>
using namespace std;
int main(){
constexpr size_t arry_size = 10;
int a[arry_size] = {0,1,2,3,4,5,6,7,8,9};
int *p = a;
for(;p!=end(a);p++)
*p = 0;
for(auto i:a)
cout << i << " ";
return 0;
}
| [
"1209015200@qq.com"
] | 1209015200@qq.com |
aac3125854776522cf1a1b053ccf131997b597eb | ad472befb7a3422406394836245b6a9ddc44c593 | /codechef/dec_challenge/vaccine.cpp | b7add25b83361532dac0a9f467934fa103b96537 | [] | no_license | aa-ryan/Comp-Prog | 34840b6038ab208349cc8f98a23ede9b15bd70a5 | dbcce36a2ce319f3eca5c1033eab3cc2e861bf7c | refs/heads/master | 2023-06-03T11:17:54.765702 | 2021-06-21T13:49:21 | 2021-06-21T13:49:21 | 297,729,534 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 666 | cpp | #include<bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
int d1,d2,v1,v2,dd;
cin >> d1 >> v1 >> d2 >> v2 >> dd;
if (d1 == d2) {
int cnt = dd/(v1 + v2);
cout << ((dd % (v1+v2) == 0) ? cnt : cnt+1) << endl;
}
else {
pair<int, int> p1, p2;
... | [
"aryansinha6363@gmail.com"
] | aryansinha6363@gmail.com |
c4921ed3ba9cb5ce61da012f97525dfb7e4b1241 | ed688cf001bd39394a9ced39c4ed5201a166be85 | /BitManipulation/SingleNumber.cpp | af714562ca382f45b9444525a9d75926c2992a1f | [] | no_license | ng29/Interview-Bit-Solution | e7959c99866c3b59e7b3911f7c0755cb96acf826 | efd20ce2b297ef0a8028c7bece4937a18f0e7157 | refs/heads/master | 2021-09-03T20:14:25.163897 | 2018-01-11T17:24:33 | 2018-01-11T17:24:33 | 107,449,259 | 0 | 2 | null | 2017-10-28T10:14:46 | 2017-10-18T18:48:01 | C++ | UTF-8 | C++ | false | false | 155 | cpp | int Solution::singleNumber(const vector<int> &A) {
int l=A.size();
int ans=0;
for(int i=0;i<l;i++){
ans^=A[i];
}
return ans;
}
| [
"noreply@github.com"
] | noreply@github.com |
15da0c1466809cc6592240c2a41849746b309d76 | cf5c1d28f4e097379eccd5f0496780060f92c023 | /queueSort/queueSort/queueSort.cpp | 03c622df5c953ea7d502293aac37201e4728396e | [] | no_license | zotov228/queueSortLaba10_1 | 9cd47f3e48677dc4b6f8e2fe91b276cb8b64a4dc | cf2ab4b4f79099888ef99ced091b6ea67ff1e55e | refs/heads/master | 2021-01-12T01:23:29.696883 | 2017-01-09T00:24:18 | 2017-01-09T00:24:18 | 78,379,807 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 887 | cpp | // queueSort.cpp: определяет точку входа для консольного приложения.
//
#include "stdafx.h"
#include <iostream>
#include <queue>
using namespace std;
int main()
{
queue<int> one_queue;
queue<int> side_queue;
queue<int> res_queue;
int k = 0;
// One queue. Cout
cout << "One queue" << '\n';
for (int i = 0; i <=... | [
"zotov228@tut.by"
] | zotov228@tut.by |
613d8e30ccfdf92b27f0b35cfa255038e6afcc5d | 9bb67fbbb0f658c485bb1ecda7b4b73f67f1de79 | /Graph/Topological Sorting/Topological Sorting/Topological Sorting.cpp | 222c9680cd6607f679a5753d1accbd5088e22ec4 | [] | no_license | KamilJanda/Algorithm-and-data-structure | d1d70b7a61661f293beaf032eba59c5bd3a8e0ea | ffcb56b78432f203aa0d3d90eeeb7057523afbf4 | refs/heads/master | 2021-01-23T03:43:02.820968 | 2017-05-17T10:21:54 | 2017-05-17T10:21:54 | 86,112,717 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,671 | cpp | // Topological Sorting.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <cstdlib>
using namespace std;
struct node
{
int vertex;
char colour;
node* next = NULL;
};
class Graph
{
int V;
node** adj;
int* result;
int idResult;
public:
Graph(int V);
... | [
"kamiljanda@yahoo.pl"
] | kamiljanda@yahoo.pl |
4a4791264676509a4c5308d3b6f102bd191054da | d27fc0c975eea686d0a9764a9da4248f5b521130 | /raschet.cpp | 2d46c7c6d055e3bfa9ceef62e7d3b745e9c52cf4 | [] | no_license | uliana-titanyuk/take__2 | 26c64bc1300738bfff5bf0a0d7035f841b7c9cc2 | b9a924ecd6f2d856bd7da4f9486afbbb2d210f70 | refs/heads/main | 2023-05-12T14:57:43.716623 | 2021-06-02T11:23:18 | 2021-06-02T11:23:18 | 373,135,361 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 732 | cpp | #include "Func.h"
#include "CRat.h"
#include "CVectRat.h"
void raschet(void) {
int size;
cout << "Vvedite dlinu vectora" << endl;
cin >> size;
CVectRat vect1(size);
CVectRat vect2(size);
gorCVectRat vect3(size);
vertCVectRat vect4(size);
CRat m;
vect1 = input(size);
vect2 = input(size);
... | [
"noreply@github.com"
] | noreply@github.com |
07b6ecef27e0b93a5aeb16da194feda27d32bf38 | 15419e6b114d5b89e78648dbae52a0aae276b673 | /UVa/Comptitive Programming/Ch-03 Problem Solving Paradigms/08 Non Classical/UVa 10337 - Flight planner - AC.cpp | c6026499a6f7280923016a10bb4867f56139fe5b | [] | no_license | ImnIrdst/ICPC-Practice-2015-TiZii | 7cde07617d8ebf90dc8a4baec4d9faec49f79d13 | 73bb0f84e7a003e154d685fa598002f8b9498878 | refs/heads/master | 2021-01-10T16:29:34.490848 | 2016-04-08T04:13:37 | 2016-04-08T04:13:37 | 55,749,815 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,034 | cpp | #include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <functional>
#include <cmath>
#define INF (int)1e9
#define int64 long long
#define maxn 1000
#define maxh 10
using namespace std;
int dp[15][1010], a[15][1010]={0}, N;
int solve(int n, int h){
... | [
"imn.irdst@gmail.com"
] | imn.irdst@gmail.com |
e53f16696c010d8a1f5b1e72966bbe751dc27779 | ffb568806e34199501c4ca6b61ac86ee9cc8de2e | /tool_project/SequenceEditor/old_lib/opensource/cpputest/include/CppUTestExt/MockNamedValue.h | 61362b9713850ee7e5705afc3d7de1f5b0b9c672 | [
"BSD-3-Clause"
] | permissive | Fumikage8/gen7-source | 433fb475695b2d5ffada25a45999f98419b75b6b | f2f572b8355d043beb468004f5e293b490747953 | refs/heads/main | 2023-01-06T00:00:14.171807 | 2020-10-20T18:49:53 | 2020-10-20T18:49:53 | 305,500,113 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,408 | h | /*
* Copyright (c) 2007, Michael Feathers, James Grenning and Bas Vodde
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above cop... | [
"forestgamer141@gmail.com"
] | forestgamer141@gmail.com |
dcf7bb78adf37bae0a9b41aeb0d7eca3d3da3da3 | 2878085060affd8375c9a2cdf7319b0a2280f8be | /src/ui/widgets/Label.h | d8a3000f6b12c60e8018b62e972407b296afabe6 | [] | no_license | silascodes/sgame | d2829b322b6971fa566d4884725e842dbbfaa98a | b563fc2d84208b4922cc7e7595bc470fdbed3eab | refs/heads/master | 2021-01-23T19:25:53.218607 | 2017-09-08T05:36:44 | 2017-09-08T05:36:44 | 102,821,247 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 274 | h | #ifndef SGAME_LABEL_H
#define SGAME_LABEL_H
#include "ui/Widget.h"
namespace ui {
namespace widgets {
class Label : public Widget {
public:
void RenderSelf(graphics::Renderer *renderer);
};
}
}
#endif //SGAME_LABEL_H
| [
"silas@amberweb.co.nz"
] | silas@amberweb.co.nz |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.