blob_id stringlengths 40 40 | content_id stringlengths 40 40 | repo_name stringlengths 5 114 | path stringlengths 5 318 | language stringclasses 5
values | extension stringclasses 12
values | length_bytes int64 200 200k | license_type stringclasses 2
values | content stringlengths 143 200k |
|---|---|---|---|---|---|---|---|---|
60328f2676b5fc5f8ab9a82bd0b51fbad5c1891d | 7b1c4716c831e995bee690e6a7ff4c4a5f2d9a8d | sterjanez/Geometer | /Geometer/GlavnaEnota.cpp | C++ | cpp | 42,820 | no_license | // Ta datoteka vsebuje vse glavne komponente programa Geometer:
//
// Nastavitve: vse nastavitve v obliki nizov in funkcije za manipulacijo z njimi
// Parser: pretvorba txt datotek v izvrsljivo kodo
// Podatki: pretvorjene nastavitve, BMP tabela
// Grafika: funkcija za risanje trikotnika v 3D
// Eksekutor: funkcije za ... |
0fac08b63063cdae4286ba89a9a6f05aa4ba07f9 | 0ea17417bf34d689fccfbc7359872f196dcce9af | a04050203/PhoscoinGUI | /src/WalletAdapter.cpp | C++ | cpp | 18,375 | permissive | // Copyright (c) 2011-2017 The Cryptonote developers
// Copyright (c) 2014-2017 XDN developers
// Copyright (c) 2016-2017 BXC developers
// Copyright (c) 2017 Royalties developers
// Copyright (c) 2017 Wayang developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://ww... |
0744d9b88c8c1694223911470637a4f43d82e173 | 10ed9d407b4aa94d499847b11f504c246988dc56 | A-And/onnxruntime | /onnxruntime/contrib_ops/cpu/murmur_hash3.cc | C++ | cc | 5,736 | permissive | //-----------------------------------------------------------------------------
// MurmurHash3 was written by Austin Appleby, and is placed in the public
// domain. The author hereby disclaims copyright to this source code.
// License from https://github.com/scikit-learn/scikit-learn/blob/master/COPYING
/* Modificatio... |
a9a4ba97baf77e4a2266dbc56ebffd00e85ce098 | fed18189fdf2bd2f3574dd80eb5d23ceee155cc3 | OSADP/Pikalert-Vehicle-Data-Translator- | /apps/vdt4/config_reader.cc | C++ | cc | 18,402 | permissive | //==============================================================================
//
// The source of this product, which was developed with funding from the
// U.S. Department of Transportation under contract number
// DTFH61-08-C-00004. Copyright ©2013, UCAR. This product includes quality
// checking algorithm... |
e28978ae202ca50946fd5b256789a8bc5e71d0b7 | 98b5466cd42bb22b9819f37f36d7408918628903 | iridium-browser/iridium-browser | /buildtools/third_party/libc++/trunk/test/std/input.output/iostreams.base/std.ios.manip/floatfield.manip/fixed.pass.cpp | C++ | cpp | 746 | permissive | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
addfd6ff79b4dc99cbf70f8598b8394848395ef7 | 54206bfb9c50abfde89d709888a8101cb25e8f85 | JavierMHdz/ElectricalEngineering | /DataStructures/lab-draw/bmplib.cpp | C++ | cpp | 12,217 | no_license | #include <stdio.h>
#include <iostream>
#include <cstdlib>
#include "bmplib.h"
#include "unistd.h"
using namespace std;
using std::cout;
using std::cin;
using std::endl;
typedef unsigned char uint8;
typedef unsigned short int uint16;
typedef unsigned int uint32;
//#define BMP_BIG_ENDIAN
#define BYTE_SWAP(num) (((num>... |
75685eed44fd216c56664f05fb05dce56c069997 | 8afae0880722cacd5306594c4243afbdcd2393ca | racchit/cses-solutions | /cses/p9.cpp | C++ | cpp | 208 | no_license | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n, k;
cin>>n;
k=1;
for(int i=0; i<n;i++){
k=2*k%(1000000007);
}
cout << k;
return 0;
}
|
1b3248805377fa5d8a4ba9b7674442208acbf383 | b2a57a4b2137d1a33ea90849ba3715cc7e1702a1 | rdxxer/SPOJ | /gcj20rnd1ApA.cpp | C++ | cpp | 3,661 | no_license | /**
* TOPIC:
* status:
*/
#include <bits/stdc++.h>
using std::vector;
using std::pair;
using std::string;
std::istream &is = std::cin;
std::ostream &os = std::cout;
std::vector<std::string> p;
std::vector<int> pref, suff;
int n;
bool starts_with( const std::string &x, const std::string &y ) {
assert( x.size() ... |
ba2fd663804d270c50d690366aae3cf528d96ffe | dc2e2c7a6b4ba537043b8cc30fb930c45d6c9e0d | WhiZTiM/coliru | /Archive2/07/882db106422780/main.cpp | C++ | cpp | 290 | no_license |
struct Logger;
struct Console {
Console(Logger * L): L(L) {}// Copy pointer
Logger* L;
};
struct Logger {
Logger(Console * C): C(C) {}
Console* C;
};
extern Logger L;
Console C(&L); // BUT L IS NOT DEFINED YET
Logger L(&C);
int main()
{
}
|
d47e4ee951b20e2732bb840f62c70be2f97b3c38 | f6f7864a7006c83ac99217ea4de9940bdc4e0650 | 519984307/CameraTest | /CameraTest.cpp | C++ | cpp | 2,493 | no_license | #pragma execution_character_set("utf-8")
#include "CameraTest.h"
#include <QDebug>
#include <QlineEdit>
#include "CImageManager.h"
#include "cconfigmanager.h"
#include <QMessageBox>
extern void ShowMessageBox1(QMessageBox::Icon type, QString title, QString content);
CameraTest::CameraTest(QWidget *parent)
: QDialog(pa... |
ea038c00786318834c5646ae3649069f1e689f47 | 8861a2769f61ae92d296c557320de73480af53aa | daninsky1/programming_principles_practice | /ch4/exer/4_guess_game.cpp | C++ | cpp | 1,101 | no_license | // exercise 4
// page 149
// number guessing game
#include "../../std_lib_facilities.h"
int main()
{
char input = 0;
int num = 0;
int num_factor = 100;
int selection_min = 0;
int selection_max = 100;
cout << "Think a number between 1 and 100, and I will try to guess, OK?\nPress en... |
d2e5fa40c4a228ee961467a6c10a445e363b1688 | 6015eeef3c3d4f75ee4cf0d64f9f3a44fe1025e7 | bapadapa/programmers | /programmers/cpp/Lv1_가운데 글자 가져오기.cpp | C++ | cpp | 245 | no_license | #include <string>
#include <vector>
using namespace std;
string solution(string s) {
string answer = "";
if (s.length() % 2 == 1) {
answer = s[s.length() / 2];
}
else {
answer = s.substr((s.length() / 2) - 1, 2);
}
return answer;
} |
46ee9d8bb30e2951c1ce8628f7620205724fc984 | d4f1ec644f92c3e19c5b45a80bdea3cf0eaae92b | StepVr/OrionStreamer | /Source/DataStreamEditor/Private/AnimGraphNode_OrionDataStream.cpp | C++ | cpp | 1,551 | no_license | /* Copyright (C) 2006-2017, IKinema Ltd. All rights reserved.
*
* IKinema API Library; SDK distribution
*
* This file is part of IKinema LiveAction project http://www.ikinema.com
*
* Your use and or redistribution of this software in source and / or binary form, with or without
* modification, is subject to:
* (i) your... |
8bef1f27b97c5bf76e79ca7d2a9d64994ddd1269 | 6ea40b52e4d7cb59ef6127601c2a6331bd35dcb3 | lukaszkurantdev/Object-Oriented-Programming | /13. 7 czerwiec 2018/zad4.cpp | C++ | cpp | 1,764 | no_license | #include <iostream>
#include <cmath>
using namespace std;
struct Point {
float x, y;
friend istream& operator>> (istream&, Point&);
};
istream& operator>> (istream &in, Point &p) {
in>>p.x>>p.y;
return in;
}
class Points {
public:
Point **tab;
int size;
friend ostream& operator<< (ostre... |
a35bc3fdbd415384f1b9b8480760fafe808e72ab | b9d009b104a0dde49773bf08d5b115d342d3ab28 | vvasco/gazebo | /gazebo/rendering/ContactVisualPrivate.hh | C++ | hh | 2,334 | permissive | /*
* Copyright (C) 2012 Open Source Robotics Foundation
*
* 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 appl... |
f429c1dcf14ca89585d4f5d64f0af293a361208b | 6300cda51eb5b51d926ad3a90716950b15cfa4e2 | choisb/baekjoon | /BFS_DFS/No_1012.cpp | C++ | cpp | 3,155 | no_license | #include <iostream>
#include <vector>
#include <queue>
#define endl '\n'
using namespace std;
struct Node {
Node()
: mNum(0) // 모든 노드는 노드에 할당된 번호를 0으로 초기화.
, mVisited(false) // 방문 정보를 false로 초기화
{}
vector<Node*> mAdjacent; // 인접 노드에 대한 정보
int mNum; // 단지 번호 (... |
f865b55d9606ed7f5dd4a9b9231aee53904c21f6 | 331c456bae6ef10cdde47a8275a2c763956b3c43 | nkornek/SimHamlet | /prototype/src/functionExecute.cpp | C++ | cpp | 140,454 | permissive | #include "common.h"
#ifdef INFORMATION
Function calls all run through DoCommand().
A function call can either be to a system routine or a user routine.
User routines are like C macros, executed in the context of the caller, so the argument
are never evaluated prior to the call. If you evaluated an argument durin... |
87f83fb673895cb48255795c3944e55a784db1fc | 77fdbd7c9833e2e8e476f06f3472e9035190d0f4 | sundargates/topcoder | /SRM 542/WorkingRabbits.cpp | C++ | cpp | 3,981 | no_license | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... |
ed0a5dc1f6c4a0972480752b0d102286598c929a | 69b31ed0b8435f2d64b622df233cdbdb07f44793 | timminn/Competitive-Programming-Solutions | /COCI/coci 2003/coci 2003 - 8/jozo.cpp | C++ | cpp | 1,901 | no_license | #include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define EKLE(x,y,s) Q.push(make_pair(make_pair(-s,x),y))
#define BAK(x,y,s) { x=Q.top().first.second; y=Q.top().second; s=-Q.top().first.first; Q.pop(); }
#define FOR(i,a,b) for(i=a; i<=b; i++)
#define cin in
using namespace std;
ifstrea... |
480504fd14f6132fe57cc07b06ed0eb297e21987 | 9696624465308958789b3f0ba53f79af51890c59 | steff208/ASD-2 | /Tabel_Periodic_Stefi/Tabel_Periodic_Stefi/main.cpp | C++ | cpp | 17,243 | no_license | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include "AVL Tree.hpp"
#include "NewLinkedList.hpp"
#include "Stefi'sLibrary.hpp"
#include "Draw.hpp"
using namespace std;
int raspuns;
char raspunsChar[100];
bNode* tempbNode = new bNode;
lNode* templNode = new lNode;... |
9c727373f5a03357412ef06bb1fe39b181b0f102 | 242259af0f1dd983d964c0634d9c0abc680e7472 | OptimistQAQ/Study-notes | /C++/杨辉三角.cpp | C++ | cpp | 280 | no_license | #include<stdio.h>
int main()
{
int a[10][10];
int i,j;
for(i=0;i<10;i++)
{
a[i][0]=1;
a[i][i]=1;
}
for(i=2;i<10;i++)
for(j=1;j<i;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j];
for(i=0;i<10;i++)
{
for(j=0;j<=i;j++)
printf("%-4d",a[i][j]);
printf("\n");
}
return 0;
} |
d48fbde4a1d8c0cc6bb5250c5ecf8def979b83d7 | b4bcf0691df99b72efb67e3f938c6e47704174d9 | marklee77/workloadmodels-docker | /models/m_cirne01/genworkload/randtest.cpp | C++ | cpp | 1,427 | no_license | /*****
*
* main.cpp - test wstat
*
*/
#include <fstream>
#include <iostream>
#include "util.h"
#include "random.h"
const long sample = 10000;
main()
{
// set-up
int i;
char* data_fn;
ofstream* data;
StartRandom();
// uniform
data_fn = "uniform.data";
data = new ofstream( data_fn );
if( data == N... |
386529cffa679936483da1efb7099d861361b599 | 53c3fc328ca7614e33a0c55d8ef744998be5ae73 | Tsinghua-OpenICV/OpenICV | /Branch/Deprecated/Mobileye/icvMobileye.cxx | C++ | cxx | 8,748 | permissive | // @ Project : RADAR
// @ File Name : sensorlrr.h
// @ Date : 2016/12/22
// @ Author :
//
//
#ifndef _TuanDynamics_H
#define _TuanDynamics_H
#include "OpenICV/Core/icvFunction.h"
#include "OpenICV/Core/icvFunctionFactory.h"
#include "OpenICV/Core/icvSubscriber.h"
#include "OpenICV/Core/icvPublisher... |
8d68234880528fce1e72e8445fa5bd21204cc01c | 2e5f974feeb134ae14a98b4941e072e852c39ffa | jizillon/v8 | /src/compiler/arm64/instruction-scheduler-arm64.cc | C++ | cc | 11,830 | permissive | // Copyright 2014 the V8 project 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 "src/compiler/instruction-scheduler.h"
namespace v8 {
namespace internal {
namespace compiler {
bool InstructionScheduler::SchedulerSupported... |
39c51de41c0e32abf268492cc1ae2d53db1b97f5 | b64c7437270f92250f140f84d524d18f97371b9b | xrLil-Batya/gitxray | /xr_3da/xrGame/ui/UIStatsIcon.cpp | C++ | cpp | 2,951 | no_license | #include "StdAfx.h"
#include "UIStatsIcon.h"
#include "UITextureMaster.h"
#include "UIInventoryUtilities.h"
CUIStatsIcon::TEX_INFO CUIStatsIcon::m_tex_info[MAX_DEF_TEX][2];
CUIStatsIcon::CUIStatsIcon(){
SetStretchTexture(true);
InitTexInfo();
m_bAvailableTexture = true;
}
using namespace InventoryUt... |
427ad4c55af82da317df1e9ed38e67dfe601f37e | 1164573c070d115716d29a38b873a9da6daa1209 | Ashik1704026/codeforce | /550C.cpp | C++ | cpp | 532 | no_license | #include<bits/stdc++.h>
using namespace std;
int main(){
string str;
cin>>str;
string dp[10000];
for(int i=0,j=0;i<=124;i++,j++){
dp[j]=to_string(i*8);
}
int k=0,flag=0;
for(int j=0;j<125;j++){
for(int i=0;i<str.size();i++){
if(dp[j][k]==str[i]) k++;
i... |
051889f8bac7cc2d03365079108be1f1c5c29774 | cb1894f2b5597a1ec1dfc04fe6d504f46f7a483b | Tyrcnex/tai-mod | /export/release/windows/obj/src/lime/app/Promise_lime_text_Font.cpp | C++ | cpp | 11,372 | permissive | #include <hxcpp.h>
#ifndef INCLUDED_lime_app_Future
#include <lime/app/Future.h>
#endif
#ifndef INCLUDED_lime_app_Promise
#include <lime/app/Promise.h>
#endif
#ifndef INCLUDED_lime_app_Promise_lime_text_Font
#include <lime/app/Promise_lime_text_Font.h>
#endif
#ifndef INCLUDED_lime_text_Font
#include <lime/text/Font.h>... |
901f985f5d078e1897350acddac7fae15eb19321 | b730a6497c4c5a2a49e3e99d1a5908c1a32882c5 | nscoincommunity/XDNA | /src/masternode-payments.cpp | C++ | cpp | 35,304 | permissive | // Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2017-2018 The Bulwark developers
// Copyright (c) 2017-2020 The NSCOIN Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licen... |
1529a3cf576b13a880db7aa45ae91fca789768ab | d2ebe647e4d9b1b083d1230419e2b4d4186d38d5 | kururu-zzz/DirectWrite | /DirectX11_BaseSystem/Source/System/Base/DXInput.cpp | C++ | cpp | 10,349 | no_license | #include "DXInput.h"
DXInput * DXInput::m_spInstance = NULL;
DXInput::DXInput()
{
m_pInput = NULL;
m_pKeyDevice = NULL;
m_pMouseDevice = NULL;
for (long u = 0; u < JOYPAD_MAX; ++u)
{
m_pJoyPadDevice[u] = NULL;
}
m_iDetectJoypadCount = 0;
m_iSettingJoypad = 0;
m_iStateIndex = 0;
m_spInstance = this;
... |
9319c7597e39f5d64baea4d4365a525610e3274f | cf806cc39ae3d248d9c012daf339c84c5a9b6d91 | catch-twenty-two/mavsdk | /src/core/serial_connection.cpp | C++ | cpp | 9,513 | permissive | #include "serial_connection.h"
#include "global_include.h"
#include "log.h"
#if defined(APPLE) || defined(LINUX)
#include <unistd.h>
#include <fcntl.h>
#include <termios.h>
#endif
namespace mavsdk {
#ifndef WINDOWS
#define GET_ERROR() strerror(errno)
#else
#define GET_ERROR() GetLastErrorStdStr()
// Taken from:
// h... |
4e9bcef95c5276a179473abe7ab69c79ab3af440 | b8308ff16f9c435438be08bbe28180af8c8d8c8d | anungrr/Soal-Bootcamp-Batch-13-kloter-6 | /6.cpp | C++ | cpp | 1,252 | no_license | #include <iostream>
using namespace std;
void BuyEgg(int x, int y){
int telur, lusin, sisa, bonus, total, kembalian;
int ganjil, genap, prima, kel5;
int ganjil1, genap1;
telur = y / 2500;
lusin = telur / 12;
kembalian = y % 2500;
if (kembalian < 12)
sisa = kembalian;
if (x > 0 && x <= ... |
9b95be0897af661d7b3f6e56774e1679dadda61b | 0acaaccdef10778c6d92dc5f0b5aab935d1d3e6b | wzj1988tv/code-imitator | /data/dataset_2017/dataset_2017_8_formatted_macrosremoved/kuzphi/8294486_5681755159789568_kuzphi.cpp | C++ | cpp | 2,103 | no_license | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstrea... |
c9239056137ca6ef54efe8eaeb8b438d02925ec5 | c8a82f3618224f4d8d8470eca0c66850b8abc176 | deniskokarev/practice | /c/lc/largest-submatrix-with-rearrangements.cc | C++ | cc | 408 | no_license | class Solution {
public:
static int largestSubmatrix(vector<vector<int>>& mm) {
int h = mm.size();
int w = mm[0].size();
for (int r=h-2; r>=0; r--)
for (int c=0; c<w; c++)
mm[r][c] = (mm[r+1][c]+1) * mm[r][c];
int mx = 0;
for (auto &row:mm) {
sort(begin(row), end(row), std::greater<int>());
int ... |
897ea7a5165e801f5596bc4db18d2487d0b1f40a | 2e7f35e33964e9ed93e6772f490ce3398987ab56 | iamjwc/CS438 | /Archive.tar/AI.cpp | C++ | cpp | 6,916 | no_license | // Programmed by Justin "Scheme Program Failure" Camerer on 2/2/2007
//
#include <iostream>
#include <list>
#include <set>
#include <string>
#define BOARD_INIT "0000000000000000000000000000000000000000000000000"
#define BOARD_SIZE 49
#define ONE_DIMENSION 7
using namespace std;
#define for_each( index, l ) ... |
4ef4fe4f679ee517880da165b7c138637e81b1e2 | 66715a1dff9b2b1a999bdbf3546a0c38061f2859 | SREERAGI18/chromium | /components/arc/input_overlay/touch_id_manager_unittest.cc | C++ | cc | 2,081 | permissive | // 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 "components/arc/input_overlay/touch_id_manager.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace arc {
class TouchIdManagerTest : pub... |
760d65ff4e0d97e9fe302d6bd2700e0cdca00517 | effe25cdcfbf55d2b780012903f432882df9e4c9 | aarizaq/Denacast | /src/underlay/singlehostunderlay/TunOutDevice.cc | C++ | cc | 8,794 | no_license | //
// Copyright (C) 2006 Institut fuer Telematik, Universitaet Karlsruhe (TH)
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any la... |
43407b80f50b1252a3c03ac86e8c609c765a7d17 | 54ee4e419352f5dfec738c0d5216ca9922efb07c | Prcuvu/StepMania-3.95 | /OptionIcon.cpp | C++ | cpp | 3,093 | no_license | #include "global.h"
#include "OptionIcon.h"
#include "ThemeManager.h"
#include "PlayerOptions.h"
#include "RageUtil.h"
#define TEXT_OFFSET_X THEME->GetMetricF("OptionIcon","TextOffsetX")
#define TEXT_OFFSET_Y THEME->GetMetricF("OptionIcon","TextOffsetY")
#define TEXT_H_ALIGN THEME->GetMetricI("OptionIcon","TextHAlign"... |
78cbbc76ebe5e36caa37d68f7bbaf28143a1c9f6 | 2eb9ca91e3db248acdb00118b1a88027b2ed1fd8 | Sangil-Lee/RefCode | /kstar/portedkwt/src/caGraphic.cpp | C++ | cpp | 7,725 | no_license | /* -*- mode: C++ ; c-file-style: "stroustrup" -*- *****************************
* Qwt Widget Library
* Copyright (C) 1997 Josef Wilgen
* Copyright (C) 2002 Uwe Rathmann
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the Qwt License, Version 1.0
**************... |
bc12631d0ffbe8544e273161c9ee836dc9124089 | 77d659189472871adb008543509bca37e5520bb2 | adde13372/shadowcore | /src/server/scripts/Pandaria/ThroneOfThunder/boss_tortos.cpp | C++ | cpp | 54,172 | no_license | #include "ObjectMgr.h"
#include "ScriptMgr.h"
#include "ScriptedCreature.h"
#include "SpellScript.h"
#include "SpellAuraEffects.h"
#include "SpellAuras.h"
#include "MapManager.h"
#include "Spell.h"
#include "Vehicle.h"
#include "Cell.h"
#include "CellImpl.h"
#include "GridNotifiers.h"
#include "GridNotifiersImpl.h"
#i... |
eb08d8be8dcefdd3d5e5fb7a872fd419227e4365 | 2621d369a31b4fd10605245d0fe0a20890e9fe1e | hdlopesrocha/com.enter4ward | /old/hidrogine/hidrogine/unilib/html/InputText.cpp | C++ | cpp | 383 | no_license | #ifndef unilib_html_InputText
#define unilib_html_InputText
#include "Text.cpp"
#include <iostream>
#include <string>
#include <queue>
#include <sstream>
#include <csignal>
#include <stdlib.h>
using namespace std;
namespace unilib {
class InputText : public Text
{
public: InputText(string n) : Text("<input t... |
ea77fb3b749408732a50faa6068c7b73040d2209 | 39fef52a05c5683b53d04cba9db9ab57ac87602b | iridium-browser/iridium-browser | /net/third_party/quiche/src/quiche/quic/core/quic_session.cc | C++ | cc | 103,500 | permissive | // 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.
#include "quiche/quic/core/quic_session.h"
#include <cstdint>
#include <string>
#include <utility>
#include "absl/memory/memory.h"
#include "absl/st... |
1c3b4eaa099c9a6ca177bebaf486ae2282a58dc0 | ce1987f7208b124a5b6652799994f9045a5df970 | junxzm1990/ASAN-- | /testcases/juliet_test_suite/testcases/CWE23_Relative_Path_Traversal/s01/CWE23_Relative_Path_Traversal__char_console_w32CreateFile_18.cpp | C++ | cpp | 4,161 | no_license | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE23_Relative_Path_Traversal__char_console_w32CreateFile_18.cpp
Label Definition File: CWE23_Relative_Path_Traversal.label.xml
Template File: sources-sink-18.tmpl.cpp
*/
/*
* @description
* CWE: 23 Relative Path Traversal
* BadSource: console Read input from the... |
536a0f87c687d739e4d9a5fdf235abcf75b54c45 | 09b25580bede116a6d32f04c8f069a72771b8c89 | novaquark/aws-sdk-cpp | /aws-cpp-sdk-ec2/source/model/MulticastSupportValue.cpp | C++ | cpp | 2,490 | permissive | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... |
4b3842782c45c1d5fe7ab0c544abbc1f8da45ef9 | a3c4ba783506c2718569d8f4be9526de91c67304 | Relz/BPA | /UltimateShamanKing/Snowball.cpp | C++ | cpp | 1,561 | no_license | // This is a personal academic project. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
#include "stdafx.h"
#include "Snowball.h"
void CSnowball::Init(sf::Vector2f startPosition, float directionX, float speed, float maxLivingTimeSec, float strength)
{
m_sp... |
0b2559008127d5fe7e6d22ae9fdad747fa3cf2ab | aad7a56b60d7eb43a3d070549f1636bec643464b | TizenTeam/blink-crosswalk | /Source/bindings/core/v8/custom/V8InjectedScriptManager.cpp | C++ | cpp | 6,702 | permissive | /*
* Copyright (C) 2012 Google Inc. 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 copyright
* notice, this list of conditio... |
bf16b852cdf403a8d436c651d2eb3332c0a30d60 | f1f9fb08703ff3b1a91696d2f09e4c4760799cf8 | aniket2013/SPOJ | /ACPC10D.cpp | C++ | cpp | 1,814 | no_license | #include<iostream>
#include<stdio.h>
#include <stdlib.h>
using namespace std;
long long int min(long long int x,long long int y,long long int z,long long int w)
{
long long int k=(x<y)?x:y;
k=(k<z)?k:z;
k=(k<w)?k:w;
return k;
}
long long int min(long long int x,long long int y,long long int z... |
17c82f188814795ba434f52e782c42c20e8f7fda | 3487b1b3d7b1829f362ae528ab7c64ee1528a03a | Feodor2/Mypal68 | /media/webrtc/trunk/webrtc/modules/video_coding/video_sender.cc | C++ | cc | 15,460 | permissive | /*
* Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... |
cde67f04baea05b4e38e9b279cf48952e389fdec | 5cb5757624dde31789ce77001044da27cf3b296b | lazymonday/PS | /baekjoon/1613.cpp | C++ | cpp | 861 | no_license | #include <bits/stdc++.h>
using namespace std;
const int MAX = 400;
const int INF = 1e9;
typedef long long ll;
int n, m;
bool adj[MAX + 1][MAX + 1];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int u, v;
for (int i = 0; i < m; ++i)
{
cin >> u >> v;
... |
6a50e9646906ae0809e70c35b9a3dde1bc51b872 | 2c312be2fc2b03ab5ee4db97c30bcc4820cdd325 | mihelem/labinnovative | /examples/001_intro/001.cpp | C++ | cpp | 1,706 | permissive | #include <iostream>
#include <vector>
#include <mutex>
#include <thread>
// STATIC_INIT_ORDER_FIASCO
struct helper_struct{
int var;
helper_struct(int n) : var(n) {}
int square(){
return var*var;
}
};
struct static_init_order_fiasco{
static helper_struct hs;
static int square;
};
int square{ static_init_order_... |
89a2fde64ab0d12c24c291e246ba2e55232312d7 | 90957f6c4241ef5f2043407496e74b9d0890bea5 | rajeshinrise-zz/tensorflow | /tensorflow/core/ops/array_ops_test.cc | C++ | cc | 56,980 | permissive | /* Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is d... |
faaf6c6cfbbf62e76254cff6dd4b64dd40812cde | fd87b15e8bf0111d6f090bcfc64039ffe879d25c | stev96/jukuzregie | /main.cpp | C++ | cpp | 483 | no_license | #include "mainwindow.h"
#include <QApplication>
MainWindow* wP;
int main(int argc, char *argv[])
{
QApplication::setOrganizationName("jukuz");
QApplication::setOrganizationDomain("jukuz.de");
QApplication::setApplicationName("LiveStreamRegie");
QApplication a(argc, argv);
MainWindow w;
wP = ... |
217f24336e3ce3bb2f090bbbe35003042f43dd2e | c7be6a853dcbaee3f05be0f767884f50e857b171 | tanhtm/Competitive-Programming | /OnlineJudge/UVa/2532_IntervalProduct.cpp | C++ | cpp | 1,261 | no_license | #include <iostream>
#include <vector>
using namespace std;
int n,k;
vector < int > a;
vector < int > st;
void init(int id,int l, int r){
if(l==r){
st[id] = a[l];
return;
}
int mid = (l + r)/2;
init(id*2,l,mid);
init(id*2+1,mid+1,r);
st[id] = st[id*2]*st[id*2+1];
}
void update(int id, int l, int r, int i, int... |
53d0dbb76f8ac4cc855446cd9fc36ede04ef0913 | 63b14b6dcda537dd11e1481102208dd30d3e6625 | ivankreso/stereo-vision | /tracker/detector/feature_detector_harris_cv.cc | C++ | cc | 6,262 | permissive | #include "feature_detector_harris_cv.h"
#include "../base/helper_opencv.h"
namespace {
struct greaterThanPtr : public std::binary_function<const float*, const float*, bool>
{
bool operator () (const float* a, const float* b) const
{ return *a > *b; }
};
}
namespace track {
FeatureDetectorHarrisCV::FeatureD... |
dfdb27a0fd63cb088a4fba2bddb4e5225283306a | 3bc87bc54a4a3d37010cb05e9bf6c28e5f0ff912 | Salvare219/CodeLibrary | /acm/Online-Judge/cf/code/471C.cpp | C++ | cpp | 581 | no_license | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int main()
{
//freopen("1.txt","r",stdin);
long long n;scanf("%I64d",&n);
long long c=2;
long long cnt=0,f=1;
while(c<=n)
... |
5f661abd9196b8ea8000180fba75700d722e30be | fedae81f60ba20e7ddc3e14fb233bd4d47770932 | jpcima/ADLplug | /thirdparty/vst3sdk/pluginterfaces/base/funknown.cpp | C++ | cpp | 11,758 | permissive | //-----------------------------------------------------------------------------
// Project : SDK Core
//
// Category : SDK Core Interfaces
// Filename : pluginterfaces/base/funknown.cpp
// Created by : Steinberg, 01/2004
// Description : Basic Interface
//
//--------------------------------------------------... |
819a7c5370cdbbf7bfad67b50b7d56871fd102a9 | a5fcd88670c4d77b8ca35f12419926a60da1e472 | agentsix1/Chkdraft | /Chkdraft/src/UnitCreateDel.cpp | C++ | cpp | 1,074 | permissive | #include "UnitCreateDel.h"
#include "GuiMap.h"
std::shared_ptr<UnitCreateDel> UnitCreateDel::Make(u16 index)
{
return std::shared_ptr<UnitCreateDel>(new UnitCreateDel(index));
}
std::shared_ptr<UnitCreateDel> UnitCreateDel::Make(u16 index, ChkUnit &unit)
{
return std::shared_ptr<UnitCreateDel>(new UnitCreateD... |
56371608264c428ecc8c70203a1f8993e0d55c06 | 5915e15633b9b8b025e4549cfa7814483ea26414 | brookman/k4a_mkv2image | /k4a_mkv2image/kinect.hpp | C++ | hpp | 3,231 | permissive | #ifndef __KINECT__
#define __KINECT__
#include <k4a/k4a.hpp>
#include <k4arecord/playback.hpp>
#include <opencv2/opencv.hpp>
#if __has_include(<concurrent_queue.h>)
#include <concurrent_queue.h>
#else
#include <tbb/concurrent_queue.h>
namespace concurrency = tbb;
#endif
#include <thread>
#include <atomic>
#include <... |
56437f20740e85f8e506f71755f878bef2313fa0 | ea6df1d45b7f4b3f315049545b8f4abcbd4c2d41 | SuryankDixit/Problem-Solving | /RECURSION + BACKTRACKING/Backtracking/nQueens.cpp | C++ | cpp | 2,431 | no_license | #include <bits/stdc++.h>
using namespace std;
bool isSafe(vector<vector<int>> &v, int i,int j){
for(int x=0;x<i;x++){
if(v[x][j]==1)
return false;
}
int x = i;
int y = j;
while(x>=0 && y>=0){
if(v[x][y]==1)
return false;
x--;
y--;
}
... |
985bc495fed9dc20b508a915c27c30c21beb2144 | 462fed0d45c44c4527c6668a1adf8befa4ef9165 | tensorflow/tensorflow | /tensorflow/core/kernels/eigen_backward_spatial_convolutions_test.cc | C++ | cc | 44,497 | permissive | /* Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
437b2a0ce15c50b8b5f7dedd07c7d5cdb5d72b04 | de179e8d56dfd6b7b2fc257e52d252802ff0bf02 | tdcarson2000/PolynomialsInCPlusPlus | /src/Driver.cpp | C++ | cpp | 3,258 | permissive | #include "polynomial.h"
#include <ctime>
#include <iomanip>
double randomValueOnInterval(double minimum, double maximum);
int main()
{
// Initialization for the time-based random function.
srand(time(NULL));
// Create two polynomials to use.
Polynomial first;
Polynomial second;
// Choose a random small degree... |
cae01b78812f9a925d5fc8742a4bdad209ba7372 | f70676a90789e314d7dd4085e15dfc6c81865b36 | poppyla0104/BaconNumber | /BaconNumber.cpp | C++ | cpp | 4,754 | no_license | /*Poppy La
File name: BaconNumber.cpp
Instructor: Dr.Stiber
Date: 02/05/2021
Course: CSS343
Program 2: The BaconNumber class
This class takes a database file name and extracts all the actor and their movies as the
program's data then store them into a map with each movie as keys and vector of actors in
... |
d3494e0646daa8b9f665a551ef6be5e3e9627d56 | 29cf2083efd0aa036cedc9336347aaf35e18bb59 | sharperM/cef | /libcef/common/widevine_loader.cc | C++ | cc | 16,430 | permissive | // Copyright 2016 The Chromium Embedded Framework Authors. Portions copyright
// 2013 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 "libcef/common/widevine_loader.h"
#if defined(WIDEVINE_CDM_AVAILABLE) && BUILDF... |
4b38a481751432bfccbfbe62e60aba314d5a77f4 | 59fb61d39d5384aa9d8ad15844ab67c22dd8436a | UWARG/simSPIKE | /gazebo/test/integration/joint_spawn.cc | C++ | cc | 16,598 | permissive | /*
* Copyright (C) 2012-2014 Open Source Robotics Foundation
*
* 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... |
a5c597a69bb4d6f9f945328d3389759e5a40935c | eb7aea47f6152e8e423b698c6273d9ccd0b32625 | febiosoftware/FEBioStudio | /FEMLib/FEMultiMaterial.cpp | C++ | cpp | 70,995 | permissive | /*This file is part of the FEBio Studio source code and is licensed under the MIT license
listed below.
See Copyright-FEBio-Studio.txt for details.
Copyright (c) 2021 University of Utah, The Trustees of Columbia University in
the City of New York, and others.
Permission is hereby granted, free of charge, to any pers... |
e35aaf36364f09f6e9d5b33df5edc306afe9cae1 | ea0544c5df15d04a9ae1b171434eb608eed42b98 | yukinjie/btframework | /Module/src/boost_server_example/simple_timer/simple_timer.cpp | C++ | cpp | 1,219 | no_license | #include<iostream>
#include<boost/asio.hpp>
#include<boost/thread/thread.hpp>
#include<boost/date_time/posix_time/posix_time.hpp>
#include<boost/date_time/posix_time/posix_time_io.hpp>
void timer_expired( const boost::system::error_code& e )
{
boost::posix_time::ptime now_time = boost::posix_time::second_clock::loca... |
b999ab3e41896feaf6eaff1e935f18d1f47c2165 | 09edec68c9c6e89c2772d661982a601f20c8504a | mannshah1211/programming-contest | /Algorithm Implementation/Number Theory/Prime Factorization.cpp | C++ | cpp | 656 | no_license | vector<int> prime; /// List of all the prime numbers till a maximum bound
vector< pair<int,int> > primeFactorize(LL num){
vector< pair<int,int> > flist; /// Contains the prime factors with frequency
for(int i = 0;i<prime.size();i++){
LL pf = prime[i];
if(pf*pf>num) break;
if(num%pf == 0... |
c8e7baf9029d1963dcf250a6d347d657359a6c74 | 4392e12683f1561880ee378853f9b713e51f42b6 | VirtUalProtoss/Kashier | /tests/test_subscribe.cpp | C++ | cpp | 669 | no_license | #include "test_subscribe.h"
#include "queue/subscribe.h"
#include <QDebug>
#include <QTest>
#include <QString>
Test_Subscribe::Test_Subscribe(QObject *parent) : QObject(parent) {
}
void Test_Subscribe::subscribe() {
QFETCH(QString, subStr);
Subscribe sub_1 = Subscribe(subStr);
QFETCH(bool, tOut);
Q... |
fad5ec85ff879958ac7f5f3f0b74ed69fbabfcc2 | 87b9159dba39b28b8269dee0cfa7c32b45d52cb4 | Sam-Tygier/MERLIN-old | /Merlin/BeamDynamics/ParticleTracking/ParticleBunch.cpp | C++ | cpp | 17,816 | permissive | /////////////////////////////////////////////////////////////////////////
//
// Merlin C++ Class Library for Charged Particle Accelerator Simulations
//
// Class library version 3 (2004)
//
// Copyright: see Merlin/copyright.txt
//
// Last CVS revision:
// $Date: 2004/12/13 08:38:53 $
// $Revision: 1.7 $
//
///////////... |
89d9390dd6fb8ac0da718d1a6ae0143d1084f315 | 35f625bca8de715b034cbde91b6883aee8b7278e | someonewithpc/IncludeOS | /lib/uplink/log.hpp | C++ | hpp | 3,779 | permissive | // This file is a part of the IncludeOS unikernel - www.includeos.org
//
// Copyright 2017 Oslo and Akershus University College of Applied Sciences
// and Alfred Bratterud
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may... |
0d45eaed6784dd0ba8bbffa3c50a5989871f57e9 | 9c8b6e478861461f4f814ff09ccda963bf036beb | merrymercy/Halide | /test/performance/jit_stress.cpp | C++ | cpp | 557 | permissive | #include "Halide.h"
#include "halide_benchmark.h"
#include <cstdio>
using namespace Halide;
using namespace Halide::Tools;
int main(int argc, char **argv) {
Var x;
ImageParam a(Int(32), 1);
Buffer<int> b(1), c(1);
b(0) = 17;
c(0) = 0;
a.set(c);
int expected = 0;
double t = benchmark... |
d3267a66e844491e9f00b2b696cf3678e6ef2fc6 | 38d368da3eba16d80ac3486514324f2465f86861 | Eve-ning/osu-Replay-Analyzer | /osu-Replay-Analyzer/osu!/Score/osu-std/score.cpp | C++ | cpp | 7,859 | permissive | #include "score.h"
std::vector<osu::TIMING> OSUSTANDARD::accTimings;
static Play* play;
bool OSUSTANDARD::sortAccTimings(osu::TIMING i, osu::TIMING j)
{
return i.time < j.time;
}
int OSUSTANDARD::SCORE::getJudgment(int _frameTime, int _noteTime, bool _pressState)
{
bool hit = false;
bool miss = true; // assume ... |
4266aafb7093e4a9cb3c64f77fab9b9522882c7b | af999d87cbbfc6ea213e84df6b04ef9c4c04e221 | JIANGCHENZHOU/GOBANG | /GOBANG/GOBANG.cpp | C++ | cpp | 5,351 | no_license |
// GOBANG.cpp : 定义应用程序的类行为。
//
#include "stdafx.h"
#include "afxwinappex.h"
#include "afxdialogex.h"
#include "GOBANG.h"
#include "MainFrm.h"
#include "GOBANGDoc.h"
#include "GOBANGView.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CGOBANGApp
BEGIN_MESSAGE_MAP(CGOBANGApp, CWinAppEx)
ON_COMMAND(ID_APP_ABOUT, ... |
31853640d388a0353ece2b1c1ad4140d4e78459c | 20f2da9d04dff67104dd0c1c8af83cfdb79fcb42 | KonradMaroszek/An-application-that-identifies-computer-components---ATICCO | /src/ATICCO/ATTICOEXE/src/controllers/ResourceConsumptionCpuController.cpp | C++ | cpp | 970 | no_license | #include "controllers/ResourceConsumptionCpuController.h"
#include "resourceCollectors/CpuUsageCollector.h"
#include <QFuture>
ResourceConsumptionCpuController::ResourceConsumptionCpuController(QList<ResourceConsumptionWidget *> resourceConsumptionWidgets) :
ResourceConsumptionController(resourceConsumptionWidget... |
fd287ce42b0c0f44aee98e528d34ce2749273349 | 70ace4eb1079fa14be5daaee0095b056e303f650 | saftoes/pdce | /FM-check.cpp | C++ | cpp | 4,168 | permissive | // (C) 2018 University of NKU. Free for used
// Author: stoneboat@mail.nankai.edu.cn
/*
* FM-check.cpp
*
*/
#include "FM/PFM.h"
#include "FM/IFM.h"
#include <iostream>
#include <string>
#include <vector>
#include <sys/time.h>
#include "Tools/ezOptionParser.h"
/***********************************************... |
b495e5d6b5aa4ee3ba9df1fabae2cf957e3ab825 | cdcc507bd05b64e2400eca0e6892595bbbc80169 | cmaggu/bde | /groups/bbl/bblb/bblb_schedulegenerationutil.cpp | C++ | cpp | 26,423 | permissive | // bblb_schedulegenerationutil.cpp -*-C++-*-
#include <bblb_schedulegenerationutil.h>
#include <bsls_ident.h>
BSLS_IDENT_RCSID(bblb_schedulegenerationutil_cpp,"$Id$ $CSID$")
#include <bdlt_calendar.h>
#include <bdlt_calendarutil.h>
#include <bdlt_date.h>
#include <bdlt_dateutil.h>
#... |
9a47caf1f57f20235514d84f191d73e748f75d5b | 99384499c5dddabec6834739daca6e09b2ec56f3 | jpanikulam/experiments | /viewer/rendering/pre_render.cc | C++ | cc | 1,328 | permissive | #include <GL/glew.h>
#include "viewer/gl_aliases.hh"
#include "viewer/rendering/pre_render.hh"
namespace viewer {
void apply_view(const OrbitCamera &view) {
glMatrixMode(GL_MODELVIEW);
glLoadIdentity();
glTransform(view.camera_from_anchor());
glTransform(view.anchor_from_world());
}
void prepare_to_render()... |
63126c7432b130821805cb849c7be09993c721ca | f638afb0085238e9e0962f158c8c551e7a0a5971 | CygnusGameDesign/Motor | /Motor/Source/TestMotor.cpp | C++ | cpp | 6,605 | no_license | #include "./TestMotor.h"
#include <EV3_LCDDisplay.h>
#include <EV3_Timer.h>
#include <EV3_Thread.h>
#include <EV3_BrickUI.h>
using namespace ev3_c_api;
C_TestMotor::C_TestMotor()
{
}
C_TestMotor::~C_TestMotor()
{
}
void C_TestMotor::Test_StartMotor() const
{
this->Show_Title("Start Motor");
const E_Brick_Layer... |
931ed7300c95f4f7b80ca73c248521e5bcfabfe7 | 7a5d051a2b689cddd603f01e98e2a5665ea3da88 | jainamandelhi/Competitive-programming-questions | /Codeforces Round #535 (Div. 3)/E1 - Array and Segments (Easy version).cpp | C++ | cpp | 1,181 | no_license | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define mp make_pair
#define se second
#define pb push_back
#define fast ios_base::sync_with_stdio(false)
typedef long long ll;
typedef pair<ll,ll> p;
ll mod=1000000007;
ll gcd(ll a,ll b)
{
return (b==0)?a:gcd(b,a%b);
}
int main()
{
fast;
ll n,m,... |
f4ecee7a703688fe97ad535e2f6271c39b5a1b96 | 77351af670b17131a2ec1897a0cb96a3a64d0dd2 | tbgeorge/putty_engine | /Systems/UI/GroupWidget.hpp | C++ | hpp | 2,436 | no_license | //=================================================================================
// GroupWidget.hpp
// Author: Tyler George
// Date : April 28, 2016
//=================================================================================
/*
* Used Properties include:
* - GroupOpacity (flt) -used to multiply all ch... |
ec233737e5fb96ec3184eaa7d0b7a1e199801831 | c75d90e7313584e859ae5949a66376ebe3fd07f7 | Darijan23/ASP | /Broj_Putova_Svi_Vrhovi.cpp | C++ | cpp | 615 | no_license | #include <bits/stdc++.h>
using namespace std;
#define MAXN 10
vector<int> graph[MAXN];
bool been[MAXN] = {false};
int n, m, num = 0, visited = 0;
void dfs(int u) {
been[u] = true;
visited++;
if(visited == n) num++;
for (auto v : graph[u]) {
if (been[v]) continue;
dfs(v);
}
... |
a7732a9b9a1f74ba3ac41af54bc1e4e2cb359d73 | 6f0c074b9f8ab95560180f03d3e171ad803b2829 | serebryakovam/cppfan | /password_storage/HashTable.cpp | C++ | cpp | 1,120 | no_license | #include "hashtable.h"
#include <iostream>
HashTable::HashTable(const int size)
{
const int hsize = 1013;
for (int i = 0; i < hsize; i++)
{
std::vector<PasswordStorageEntry> new_;
data_.push_back(new_);
}
}
void HashTable::Add(const PasswordStorageEntry& new_pair)
{
PasswordStorage... |
aafe82c8b539e96b444b9d1932cbfcc5173f5478 | c0a8cd71b0d01eb525743e265cc58649eab7245f | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_PrimalItemArmor_ArgentavisSaddle_classes.hpp | C++ | hpp | 885 | permissive | #pragma once
// ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_PrimalItemArmor_ArgentavisSaddle_structs.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Classes
//----------------------------------------... |
26a39a6661789d7a7b419026abb58fabda3fed11 | 470f3ee921e64a5fcd41682b819c051c820f85e0 | manojk16/Dream_2019 | /lcpp/oops/Basic/12_destructor_Basic.cc | C++ | cc | 683 | no_license | /*
* 12_destructor_Basic.cc
*
* Created on: Aug 2, 2019
* Author: user1
*/
#include <cassert>
#include <iostream>
using namespace std;
class IntArray{
int m_length;
int *m_array;
public:
IntArray(int length){
assert(length>0);
m_length=length;
m_array=new int[length];
}
~IntArray(){
delete [] ... |
2a4e005cd6b100f093a3299d386813f848756dd6 | 5da120c0f1e3d3da67da8b95a93cf5edfffe0769 | proteanx/devault | /src/test/scriptflags.cpp | C++ | cpp | 2,260 | permissive | // Copyright (c) 2017 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "test/scriptflags.h"
#include "script/interpreter.h"
#include <boost/algorithm/string/classification.hpp>
#include <boost/al... |
cf4c2768f0349dbcbee4755c9b08acd6051cbc4a | 93eb5b22e6ef6e635ccc6f27976a7fcf3138329e | NineToken/9chain | /src/qt/bitcoin.cpp | C++ | cpp | 9,136 | permissive | /*
* W.J. van der Laan 2011-2012
*/
#include "bitcoingui.h"
#include "clientmodel.h"
#include "walletmodel.h"
#include "optionsmodel.h"
#include "guiutil.h"
#include "guiconstants.h"
#include "init.h"
#include "ui_interface.h"
#include "qtipcserver.h"
#include <QApplication>
#include <QMessageBox>
#include <QTextCo... |
07b411aff61a514869f1a55387bc3f883f558681 | 2e96ffe794729d01d85ebb7620f853b373793d38 | TCeason/ClickHouse | /src/Interpreters/ExpressionActions.cpp | C++ | cpp | 40,024 | permissive | #include <Interpreters/Set.h>
#include <Common/ProfileEvents.h>
#include <Interpreters/ArrayJoinAction.h>
#include <Interpreters/ExpressionActions.h>
#include <Interpreters/TableJoin.h>
#include <Interpreters/Context.h>
#include <Columns/ColumnArray.h>
#include <Columns/ColumnFunction.h>
#include <Common/typeid_cast.h>... |
3054fdf091b2aea155951e2962491385c494865f | 00cc9f8df40722525950023db645fc914b01b377 | andysim/libecpint | /src/lib/qgen.cpp | C++ | cpp | 2,223 | permissive | #include "qgen.hpp"
#include <cmath>
#include "mathutil.hpp"
namespace libecpint {
namespace qgen {
void rolled_up(int lam, int LA, int LB, ThreeIndex<double> &radials, FiveIndex<double> &CA, FiveIndex<double> &CB, TwoIndex<double> &SA, TwoIndex<double> &SB, AngularIntegral &angint, ThreeIndex<double> &values)
... |
7a64ba415bf01c525826fb1693bd5f87a89e6a36 | 994705ffc4d516110409042deb94e7bc18d08772 | arangodb/arangodb | /3rdParty/boost/1.78.0/boost/mp11/mpl.hpp | C++ | hpp | 389 | permissive | #ifndef BOOST_MP11_MPL_HPP_INCLUDED
#define BOOST_MP11_MPL_HPP_INCLUDED
// Copyright 2017, 2019 Peter Dimov.
//
// 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
#include <boost/mp11/mpl_list.hpp>
#include <boos... |
548d697962603fa575350184eab6f81dff50a05f | 5cd87c0698d139f3beab9836dadb8378b7915984 | SummerLatte/pta | /firstContect.cpp | C++ | cpp | 1,346 | no_license | #include<iostream>
#include<algorithm>
#include<unordered_map>
#include<vector>
#include<string>
using namespace std;
typedef struct Node{
int a,b;
}node;
bool cmp(node a, node b){
return a.a!=b.a?a.a<b.a:a.b<b.b;
}
int main(){
int cnt,pairs;
unordered_map<int, bool> pv;
vector<int> rv[10000];
... |
9c8f8390fdd46d272c0b591137cf9b11b4054ddb | 0f18266eb19b1beceeb308da9b0a51707fc66dfe | ssarassars/TinderForPets | /AddClientDialog.cpp | C++ | cpp | 1,991 | no_license | #include "AddClientDialog.h"
#include "ui_AddClientDialog.h"
#include <QDebug>
AddClientDialog::AddClientDialog(QWidget *parent, Control *cntrl) :
QDialog(parent),
ui(new Ui::AddClientDialog)
{
ui->setupUi(this);
this->cntrl = cntrl;
}
AddClientDialog::~AddClientDialog()
{
delete ui;
}
bool AddCl... |
a094246480f192c2f68db11f9b237fcf76c05ff8 | 6826c4fba2552e0da663f44c4b1000c2b25ea5b5 | gpac-buildbot/PlatinumSDK | /Neptune/Source/System/Win32/NptWin32MessageQueue.cpp | C++ | cpp | 6,807 | no_license | /*****************************************************************
|
| Neptune - Win32 Message Queue
|
| (c) 2001-2008 Gilles Boccon-Gibod
| Author: Gilles Boccon-Gibod (bok@bok.net)
|
****************************************************************/
/*---------------------------------------------------... |
587cc37a215b18972a9d9e0595e6ea91ced19018 | 0e83f6e2becde54a2335b53d773f4aa010afbd08 | dubinder/primer | /source/cpp.primer.5th.edition/chapter.6/6.55.cpp | C++ | cpp | 1,214 | no_license | //:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
// Dylan Binder
// Copyright 2014
//:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
//:::::::::::::::::::::::::::::::::::::::::::::::::::... |
896c0a9404264909d4ce50f6032418e32b361f95 | a023757268cac7de60b26068e202186fe4b2fa1d | tiny656/PAT | /团体程序设计天梯赛-练习集/L2-022_重排链表.cpp | C++ | cpp | 1,505 | no_license | #include <iostream>
#include <vector>
using namespace std;
struct Node {
int data;
int next;
};
vector<Node> nodes(10e5, Node{0, -1});
void PrintLinkList(int addr) {
while (addr != -1) {
printf("%05d %d ", addr, nodes[addr].data);
if (nodes[addr].next == -1) printf("-1\n");
else printf("%05d\n", nodes[addr]... |
9a69065bd81c5f518be16cd27424d8406f310b1b | c9e7d5319cc89fd14b445bcfca0d247aaa8f788e | Kapsule98/solid-octo-engine | /codeforces/Codeforces Round #683/A.cpp | C++ | cpp | 216 | no_license | #include<bits/stdc++.h>
using namespace std;
#define li int64_t
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cout<<n<<endl;
for(int i=1;i<=n;i++)
{
cout<<i<<" ";
}
cout<<endl;
}
}
|
80e344980e2a7c8bd035104bd06d8140a44a5db5 | 878ac70059a58ed9f030589dac43f12cc1eb8571 | Vizionnation/chromenohistory | /ui/views/examples/example_base.cc | C++ | cc | 991 | permissive | // 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.
#include "ui/views/examples/example_base.h"
#include <stdarg.h>
#include "base/macros.h"
#include "base/strings/stringprintf.h"
#include "ui/views/v... |
fe075d9993c5d4d626f9bb65cf32adf59a0a8193 | 004b9b793a94ed3be5d3d9c6162e710b97d0e112 | sureshdontha/KappaTools | /Tools/bin/xsec.cc | C++ | cc | 898 | no_license | /* Copyright (c) 2011 - All Rights Reserved
* Fred Stober <stober@cern.ch>
*/
#include "Kappa/DataFormats/interface/KInfo.h"
#include "../../RootTools/interface/RunLumiReader.h"
#include "../../RootTools/interface/FileInterface.h"
#include "../../Toolbox/interface/CmdLineSetup.h"
using namespace std;
int main(in... |
514542514569fce6316ae2587fb5a9ac3ee23e73 | dba66bb7809c9d4ab32f3eb6d2299f7ce55952ff | WIZARD-CXY/algo | /algo2/pa11.cpp | C++ | cpp | 1,168 | no_license | /*************************************************************************
> File Name: pa11.cpp
> Author: Wizard
> Mail: wizard_cxy@hotmail.com
> Created Time: Wed 09 Jul 2014 10:29:07 PM CST
************************************************************************/
#include <iostream>
#include <cstdio>
#include... |
34dcb2ab30d7df9b70fccb00f59303c8ecabd4de | 826cecfb6f0081683a9746ecb133dce5c9b483ee | meonBot/bitcoin | /src/wallet/walletdb.cpp | C++ | cpp | 49,267 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2021 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <wallet/walletdb.h>
#include <fs.h>
#include <key_io.h>
#include <proto... |
7a815d0917044f5d5aafbce16f21c41c74dd2555 | 1a251912c382e7e113ea72a4fc4061bd55c2820f | wCmJ/thread | /thread.cpp | C++ | cpp | 763 | no_license | #include<process.h>
//typedef void (__cdecl *_beginthread_proc_type)(void*);
//typedef unsigned (__stdcall *_beginthread_proc_type)(void*);
typedef struct ThreadParms
{
void *(*start)(void*);
void *arg;
}ThreadParms;
unsigned __stdcall threadStartFunc(void *p)
{
ThreadParms *pt = (ThreadParms)p;
pt->s... |
7de6a4de679826d50abf3422e62d6f0b17316594 | 9f2bff957cadd77d576beae0234e391c6706af06 | tekezo/onikiri2 | /src/Sim/Op/OpContainer/OpList.cpp | C++ | cpp | 4,055 | permissive | //
// Copyright (c) 2005-2008 Kenichi Watanabe.
// Copyright (c) 2005-2008 Yasuhiro Watari.
// Copyright (c) 2005-2008 Hironori Ichibayashi.
// Copyright (c) 2008-2009 Kazuo Horio.
// Copyright (c) 2009-2015 Naruki Kurata.
// Copyright (c) 2005-2015 Ryota Shioya.
// Copyright (c) 2005-2015 Masahiro Goshima.
//
// Thi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.