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 |
|---|---|---|---|---|---|---|---|---|
602a61ee707710a5ac5700f39ef4daf38d977366 | 3c879dc698f48bf16209b32e5218d8a9a3e18f53 | Wajov/Algorithms-DataStructures | /算法/计算几何/多边形面积/dbxmj.cpp | C++ | cpp | 518 | no_license | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<double, double> Point;
const int N = 1000001;
int n;
double ans;
Point p[N];
inline double Cross(Point a, Point b, Point c) {
return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}
int main() {
scanf("%d", &n);
... |
9fe79a3a89617fce2fe7f92e47b538ef1c83729e | ed5804fe7043c161663c44c43d8e4a3f6d177563 | azusalee/MyCustomMars | /marsksim/boost/detail/utf8_codecvt_facet.hpp | C++ | hpp | 7,969 | no_license | // Copyright (c) 2001 Ronald Garcia, Indiana University (garcia@osl.iu.edu)
// Andrew Lumsdaine, Indiana University (lums@osl.iu.edu).
// Distributed under the Boost Software License, Version 1.0. (See accompany-
// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_UTF8_CODEC... |
8219665affc313852e79c20e2949407f3a3f0157 | 92b1dd33913af84949437b02039ba21a4d6e791e | Naios/MythCore | /dep/acelite/ace/Codeset_Registry.cpp | C++ | cpp | 3,342 | no_license | //=============================================================================
/**
* @file Codeset_Registry.cpp
*
* $Id: Codeset_Registry.cpp 91286 2010-08-05 09:04:31Z johnnyw $
*
* emulated codset regstry functions
*
*
* @author Phil Mesnier <mesnier_p@ociweb.com>
*/
//================================... |
819efab272964d9a211cda826dae6df553c4d204 | 637f69af03653a90b8af481775538ed44331b40f | troelsfr/llvm-project | /llvm/lib/Target/AArch64/AArch64TargetMachine.cpp | C++ | cpp | 30,720 | permissive | //===-- AArch64TargetMachine.cpp - Define TargetMachine for AArch64 -------===//
//
// 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
//
//===---------------------------... |
b359c5e242d9183b67f0e42c65e9439774fc17c2 | 73041e41751ed12c45e3ef330f04230db10c45dc | bootchk/msp430Drivers | /src/ISR/internalRtcISR.cpp | C++ | cpp | 791 | permissive |
#include <msp430.h> // RTC_VECTOR
#include "../timer/counter.h"
#include "../config/driverConfig.h"
/*
* ISR to support Counter (and Timer) in msp430Drivers.
*/
#pragma vector = RTC_VECTOR
__interrupt void RTC_ISR(void)
{
#ifdef LOW_POWER_TIMER_USE_RTC
Counter::setOverflowFlag();
/*
* RTC inte... |
000a1a3e43c2d8682f3118ec95774ada6c50542a | 83bc7b3da7f340c727c888fadb01b6cd91be1706 | elemtype/tm | /core/login.cc | C++ | cc | 3,480 | no_license | #include "login.h"
byte *g_id = new byte[4];
string g_password ;
byte *g_0825_data = new byte[29];
byte *g_key = rand_nbyte(16);
byte *g_0825_token = new byte[0x38];
byte *g_0826_token = new byte[0x38];
byte *g_0826_token_1 = new byte[0x78];
byte *g_0826_key = new byte[4];
byte *g_0828_ke... |
e1854a2ec5393bfa864bb90d6b349a769e4ef575 | d1e8a9ab724b16d8324b2e87cde162b30428770f | utkarshayachit/mantid | /Code/Mantid/Framework/CurveFitting/src/FlatBackground.cpp | C++ | cpp | 1,741 | no_license | #include "MantidCurveFitting/FlatBackground.h"
#include "MantidAPI/FunctionFactory.h"
#include "MantidKernel/System.h"
using namespace Mantid::Kernel;
using namespace Mantid::API;
namespace Mantid
{
namespace CurveFitting
{
DECLARE_FUNCTION(FlatBackground)
//------------------------------------------------------... |
00bfe541699f583abe9414acaf65bb63c39a674c | 7f4595ab9da20fe1aae8f71fa1ebbc91847056a2 | codingman/soui3 | /SOUI/src/core/shostwnd.cpp | C++ | cpp | 47,440 | no_license | #include "souistd.h"
#include "SApp.h"
#include "core/SHostWnd.h"
#include "helper/SAutoBuf.h"
#include "helper/SColor.h"
#include "helper/SplitString.h"
#include "helper/STime.h"
#include "../updatelayeredwindow/SUpdateLayeredWindow.h"
#include <helper/SHostMgr.h>
#include <Imm.h>
#pragma comment(lib,"imm32.lib")
n... |
64260d007ce5878f8178529771672989cbc16783 | 424daf7d8d8c5b6f01db549f12fedec75acaac8b | taan02991/Algorithm-Design | /ex04e3_teamwork/main.cpp | C++ | cpp | 642 | no_license | #include <iostream>
#include <queue>
using namespace std;
int main()
{
int n, m;
double fTime = 0;
cin>>n>>m;
priority_queue<int, vector<int>, greater<int>> task, student;
for(int i = 0; i < m; i++){
int t;
scanf("%d", &t);
task.push(t);
}
for(int i = 0; i < n; i++)... |
7788cdabccc1e4c3ec451d224e5fdcf26b082ba6 | 6496bbc3b9f7aba29f5b8c6ff676767e403afda1 | dm-vodopyanov/llvm | /llvm/lib/Analysis/MemorySSA.cpp | C++ | cpp | 97,546 | permissive | //===- MemorySSA.cpp - Memory SSA Builder ---------------------------------===//
//
// 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
//
//===---------------------------... |
caacfc6522ce12d4adddcfc0783a705c6d6bdafa | 0f6599cb1924b84bd322dbe52726a8b1df31f8d7 | celidon/Schoolwork | /c++/Semester2/final/question3.cpp | C++ | cpp | 739 | no_license | /*
File Name: question3.cpp
Description: Assume proper includes have been executed, but not using directive
or declaration. Write a definition of an iterator for a vector
named vec of int values. Write a for loop that will display the
contents vec on the screen, separated by spaces. Use iterators for
... |
e9a5f20fb1406b018c2ef11d1ce2a54c18f5e9e3 | 3e0e8b0c021a041a78b9f3b7b5b85fbd0d8c372c | vrace/WowClassic1 | /WowClassic1/controller/KeepAliveOperationController.cpp | C++ | cpp | 405 | permissive | #include "KeepAliveOperationController.h"
#include <Windows.h>
void KeepAliveOperationController::enter()
{
actionFactory.enter();
currentAction.reset(actionFactory.create());
}
void KeepAliveOperationController::tick(double deltaSeconds)
{
if (currentAction)
currentAction->tick(deltaSeconds);
if (!currentAct... |
daa19dcd978edfd6662da94186ce91ee8c0d7db0 | bb08115ebee1ea76ec67fb4aa52f9f278016e52d | ichthyandr/TB12Ctrl | /qnrpntwidget.cpp | C++ | cpp | 32,431 | no_license | #include <QVBoxLayout>
#include <QHBoxLayout>
#include <QGridLayout>
#include <QGroupBox>
#include "qhomewidget.h"
#include "qnrpntwidget.h"
#include "qmidi/qmidisysexmsgs.h"
Q_LOGGING_CATEGORY( NPRNT, "NPRNT" )
static QNrpnTWidget * g_NRPNt{Q_NULLPTR};
static QNrpnTWidget * g_NRPNm{Q_NULLPTR};
QNrpnTWidget::QN... |
650d2cb0ce32f6b17d5043d743e49f3142137435 | f51ef90531fd1e4b7a570bbf7e768b514a17ad65 | ambakick/codingground | /Microsoft/ll_reverse.cpp | C++ | cpp | 244 | no_license | #include<bits/stdc++.h>
using namespace std;
struct Node{
int data;
struct Node* next;
Node(int data){
this->data = data;
this->next = NULL;
}
}
int main(void){
Node *head = Node(5);
cout<<head.data;
} |
7ddc4d3ff7627488aaaf76e0142a469e10894c56 | 46b53d54ea0e8ac180ed0acb473f06092b2563a4 | NathanielACollier/cppLib | /nfunc/nfunc.cpp | C++ | cpp | 1,644 | no_license | /*
Nathaniel Collier
2/10/2007
Function Library
*/
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
int RNUM( int min, int max );
void open_in_file( ifstream & fin,string filename );
void open_out_file( ofstream & fout,string filename );
float calc_sdv( const float array[], int length... |
1137b919731772e30b87bc99601a17b0e81d7735 | 72a0c9da23610a52fedce64295f7e0e5d963edcf | gorillabull/a2 | /ConsoleApplication1/ConsoleApplication1/vasilevlcs302hw2.cpp | C++ | cpp | 3,955 | no_license |
/*
Name: Leonardo Vasilev 2000213591 Assignment #2
Descriptions: An implementation of quicksort and bubblesort.
Input: A file containing a number, one per line
*/
#include <iostream>
#include <fstream>
#include <string>
#include <iostream>
#include <sstream>
#include <math.h>
using namespace std;
void bbs(int*,... |
ae0bb60cf86a23f2f87617427ea50ebed2fb5e16 | ed25fe8cbd031c2b78be92b757f03feb433dc836 | public-domain/ncbi_cxx | /include/objtools/edit/autodef.hpp | C++ | hpp | 9,305 | no_license | #ifndef OBJTOOLS_EDIT___AUTODEF__HPP
#define OBJTOOLS_EDIT___AUTODEF__HPP
/* $Id: autodef.hpp 142830 2008-10-09 21:59:40Z bollin $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Informa... |
1ce636b01fdf592b3003231c18694a144b5eea9e | ef75c4d61d6992c3a73ca762ce4c05545bb27ddc | BerndGabriel/simutrans-experimental | /descriptor/reader/building_reader.cc | C++ | cc | 19,478 | no_license | #include <stdio.h>
#include <string.h>
#include "../../bauer/hausbauer.h"
#include "../../simdebug.h"
#include "../building_desc.h"
#include "../intro_dates.h"
#include "../obj_node_info.h"
#include "building_reader.h"
#include "../../network/pakset_info.h"
/**
* Old building types, for compatibility ...
*/
struct old... |
f0a3731b41f683fbac3eeef88d9b560029ffec13 | 879a05632614ab6b718c047a676da3989695f6a4 | statoil-travis/opm-parser | /opm/parser/eclipse/EclipseState/Schedule/Schedule.cpp | C++ | cpp | 74,357 | no_license | /*
Copyright 2013 Statoil ASA.
This file is part of the Open Porous Media project (OPM).
OPM is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any l... |
1c506634ebc1da1dff0ba9710bd03dd15b19363f | 4698c662bdd0678e1fc039aafc3e1d7e0deff6cf | jilljenn/acm | /solutions/find-the-twin.cpp | C++ | cpp | 801 | no_license | /* c.durr - jill-jênn vie - préparation ACM/ICPC/SWERC 2014
find the twin
trier les listes puis avec un parcours détecter la première paire.
complexité O(kn log n), k=max long chaînes, n=nb chaînes
astuce: utiliser une function solve, pour terminer la recherche dés
réponse trouvée.
*/
#include <... |
129adcbcfab150c82b3f2dd4321bf92990bde0e4 | 8285df586b7ce0f8a53479086472eb5a78887a2d | Arhan13/CPP | /Graphs/BFS.cpp | C++ | cpp | 1,147 | no_license | //Template
//BFS go to the source and then the nbrs
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=int (a);i<int (n);i++)
#define endl "\n"
#define vi vector<int>
#define se set<char>
#define pb push_back
#define um unordered_map
typedef long long ll;
using namespace std;
template<typename T>
class Graph {
... |
e85e6697ecbee9caed7c8cbe23a6abf68b0800f9 | 47c45dcfe8cda403a7037d7c0d90723aee3b71dc | chmnchiang/bcw_codebook | /Contest/NEERC2015/G.cpp | C++ | cpp | 3,189 | no_license | //a34021501 {{{
#include<bits/stdc++.h>
#include<unistd.h>
using namespace std;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define SZ(x) ((int)((x).size()))
#define ALL(x) begin(x),end(x)
#define REP(i,x) for (int i=0; i<(x); i++)
#de... |
eaa2dbf8b096f2845037c2c2405e0277f0218d7e | 7805ca6dfdb54197d99fd980653f85eb530aee67 | 5l1v3r1/VTIL | /symbolic/operators.hpp | C++ | hpp | 3,695 | permissive | #pragma once
#include <map>
#include <string>
#include <vector>
#include <platform.hpp>
namespace vtil::symbolic
{
// Generic operator description.
//
struct operator_desc
{
// Symbolic identifier for this operator.
//
// If [symbol] is empty:
// to_string(...) => function(split(..., ','))
... |
30343390e038364d7af5d1673ccefa2e47c6f49d | e704c8369450931242562cdfb8943d78dcd9665a | MontiCore/EmbeddedMontiArc | /generators/EMAM2Cpp/native/armadillo/include/armadillo_bits/constants.hpp | C++ | hpp | 10,723 | no_license | /* (c) https://github.com/MontiCore/monticore */
// Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au)
// Copyright 2008-2016 National ICT Australia (NICTA)
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You ... |
5a77d4f3242ab2c503d7ec648031f59849c1b1a3 | 17465b50e903fdf5d4e3ce11cfc9f4cdfe648af9 | Brandonag1997/chessGame | /src/Piece.cpp | C++ | cpp | 32,991 | no_license | // Piece.cpp
#include <SFML/Graphics.hpp>
#include <set>
#include "Piece.h"
#include <iostream>
#include "config.h"
Piece::Piece(std::string location, std::string fileLocation)
{
std::string delim = RESOURCE_PATH;
// std::string delim = "content/";
type = fileLocation.substr(delim.length(),fileLocation.f... |
0153d24da0e0d8b609feae8413d5e0c1bbefe5db | d1385644f2c3be0c7a0215dcb7e7f4db4dfbbc10 | DavidPoliakoff/RAJAPerf | /src/apps/WIP-COUPLE.cpp | C++ | cpp | 4,714 | no_license | //~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~//
// Copyright (c) 2017-18, Lawrence Livermore National Security, LLC.
//
// Produced at the Lawrence Livermore National Laboratory
//
// LLNL-CODE-738930
//
// All rights reserved.
//
// This file is part of the RAJA Performance Suite.
//
//... |
b734a80357b73a2674ae76e5773ac7cd3a51c2c3 | 0d597a824b1f3b47380fb5ec0ac4abf5cc0a5735 | vsara/duel6r | /source/weapon/impl/MachineGun.cpp | C++ | cpp | 2,369 | permissive | /*
* Copyright (c) 2006, Ondrej Danek (www.ondrej-danek.net)
* 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, ... |
99557a2b624b9d1d69c6932bcc3c03a2097bed64 | 26c251fd7b0a6c78cbf552aec081935c1078d9b5 | choffstein/Optimization | /SimulatedAnnealing/Travelling Salesman/travelling_salesman.cpp | C++ | cpp | 3,351 | no_license | /*
* travelling_sales_man.cpp
*
*
* Created by Corey M. Hoffstein on 1/16/10.
* Copyright 2010 Newfound Research, LLC. All rights reserved.
*
*/
//SIMULATED ANNEALING WITH TRAVELING SALES MAN PROBLEM
#include "solver.h"
#include "state.h"
#include <iostream>
#include <cmath>
#include <cstdlib>
#include... |
fa91a558cdb538751e8a8ba5a92716b936c60ef9 | 971624544b6d6179f7b87757d5c963e48d386976 | cowtony/ACM | /ZOJ/ACM answer/1196_t1.cpp | C++ | cpp | 893 | no_license | #include<iostream.h>
long pos[201];
long make(int beg,int end, int lev)
{
if(end-beg+1<=lev) return 0;
if(lev==1)
{ int mid;int i;long sum=0;
if((end-beg)%2==0)
mid=beg+(end-beg)/2;
else mid=beg+(end-beg-1)/2;
for(i=beg;i<mid;i++)
sum+=pos[mid]-pos[i];
for(i=mid+1;i<=end;i++)
sum+=pos[i]... |
28f23e881cdef85ded5c353c89190f159d23e6cd | dc330c9c7559dc758fac4f72a17cbc89df79048e | ay2306/Competitive-Programming | /codeforces/practice/i_love_username.cpp | C++ | cpp | 828 | no_license | #include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define P pair
#define PLL pair<long long, long long>
#define PII pair<int, int>
#define PUU pair<unsigned long long int, unsigned long long int>
#define L list
#define V vector
#define S set
#define MS multiset
#define M map
#define m... |
3b6521d3641b07173d8f3d9f63fac03c71bdff8d | 911a05908bc9d8d5c3086e8f6cdad3bace7c0cf7 | jenac/LeetCode-1 | /Exercise/TestHashtable.cpp | C++ | cpp | 40,553 | no_license | #include "..\LeetCode\LeetCode.h"
#include "..\LeetCode\LeetCodeHashtable.h"
#include "TestHashtable.h"
void TestLeetCode1(void)
{
Logger::WriteMessage("Test Leet Code 1");
LeetCodeHashtable leetCode;
vector<int> nums = { 19, 21, 15, 2, 7, 11, 18, 23, 25 };
Logger::WriteMessage(nums);
vecto... |
ffb1c1dacf88d1d126d94ccd5eb04d761f7e26b3 | 2ef2bd190e20c60fa4142e2a0318607a5a301cbb | yyd01245/bbcv_SM | /10.SM/SM_contro2.2/CommonData.cpp | C++ | cpp | 1,445 | no_license | char strAdverIP[128];
int iAdverPort;
char strNavIP[128];
int iNavPort;
char strVodIP[128];
int iVodPort;
char strMsiIP[128];
int iMsiPort;
char strMyServerIP[128];
int iMSIServerPort;
char strVOD_KeyIP[128];
char dbip[128];
char dbname[128];
char dbuser[128];
char dbpass[128];
char hdadvna... |
f5d47b14b57a09c0ea173f9cf443a3c42fa6665a | edef71625e8b5afc0d921be2168d6f583d895115 | chrishoen/Dev_DspLib | /DspLib/dspThreeMatrix.cpp | C++ | cpp | 11,519 | permissive | /*==============================================================================
Description:
==============================================================================*/
//******************************************************************************
//*************************************************************... |
5005a34bd9a30cd2af72b0c9791cad16f2726406 | 56b9c02b9190a10edfe8bb2a3431bc95cf2449fd | cesarriat/mlir | /examples/Linalg/Linalg1/lib/RangeOp.cpp | C++ | cpp | 2,546 | permissive | //===- RangeOp.cpp - Implementation of the linalg RangeOp operation -------===//
//
// Copyright 2019 The MLIR Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.... |
3a4364726c94443a5f59b6586ae91f8356fcac5a | a9bef1738226ab8739355398e4768a2eb3c83e20 | Ktnnn3/KittinunShoppingMall | /windows/runner/main.cpp | C++ | cpp | 1,280 | no_license | #include <flutter/dart_project.h>
#include <flutter/flutter_view_controller.h>
#include <windows.h>
#include "flutter_window.h"
#include "utils.h"
int APIENTRY wWinMain(_In_ HINSTANCE instance, _In_opt_ HINSTANCE prev,
_In_ wchar_t *command_line, _In_ int show_command) {
// Attach to console w... |
818f21a7a26ed97d047e26c9e06aef65d81a8f97 | 9381f48f3bf7952822725ab347fe8236d6dff7c8 | cool2528/miniblink49 | /third_party/skia/src/core/SkPath.cpp | C++ | cpp | 89,778 | permissive | /*
* Copyright 2006 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkBuffer.h"
#include "SkErrorInternals.h"
#include "SkGeometry.h"
#include "SkMath.h"
#include "SkPathPriv.h"
#include "SkPathRef.h"
#include "Sk... |
173cd4eae00c5748b4046fa051cf83c499fa9baf | da40b5902d260d76c2f954e9ce202f6564f4159b | google/gumbo-parser | /examples/prettyprint.cc | C++ | cc | 10,596 | permissive | // Copyright 2015 Kevin B. Hendricks, Stratford, Ontario, All Rights Reserved.
// loosely based on a greatly simplified version of BeautifulSoup4 decode() routine
//
// 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 ... |
1e3a730504226a25695084983da82f234a96f8eb | 7487e8d60d3b92ba919b63843820d0aee940edf4 | vitalybuka/chromium | /pdf/pdfium/accessibility_unittest.cc | C++ | cc | 21,045 | permissive | // Copyright 2019 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 "pdf/accessibility.h"
#include "pdf/pdfium/pdfium_engine.h"
#include "pdf/pdfium/pdfium_test_base.h"
#include "pdf/test/test_client.h"
#include ... |
382a495c6973d438656825556ef2ba66a3ef3e97 | 328555b6016c1ce9b0d070d068c13a72c4d90420 | CesarChaMal/UnrealSection_03_BuildingEscape | /Intermediate/Build/Win64/UE4Editor/Inc/BuildingEscape/Grabber.gen.cpp | C++ | cpp | 3,126 | no_license | // Copyright 1998-2019 Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
==============================================================... |
b5b498bc96b4aba00597a240bc843ce5f4518862 | 4a76dd17202e393acffc434140c77e051ba63b34 | Bartosz1988/Alfabet-Morse-a | /Alfabet Morse'a.cpp | C++ | cpp | 4,131 | no_license | #include <iostream>
#include <map>
#include <string>
using namespace std;
void zamianaNaMorsea(string wyraz)
{
map<char, string> alfabetMorsea;
alfabetMorsea['A'] = ".-";
alfabetMorsea['B'] = "-...";
alfabetMorsea['C'] = "-.-.";
alfabetMorsea['D'] = "-..";
alfabetMorsea['E'] = ".";
alfabet... |
f1303f067942bda36eb0e3cb8f0562a022301eb4 | 706f9d394fcffa3901b0aa3495b79a189bbb272c | fullsaildevelopment/DyingDungeon | /DyingDungeon/DyingDungeon/src/SkillShowcase.cpp | C++ | cpp | 4,985 | no_license | #include "OdysseyEngine.h"
#include "SkillShowcase.h"
CLASS_DEFINITION(Component, SkillShowcase)
void SkillShowcase::initialize()
{
}
void SkillShowcase::update(double deltaTime)
{
if (Odyssey::InputManager::getInstance().getKeyPress(KeyCode::F))
{
DirectX::XMVECTOR position = {};
DirectX::XMVECTOR rotation ... |
75018c50ed604b0011d061f72409ad3074bd13f8 | 8cb0ca0ffb1e86f4a18a0806d96e53430d105ec5 | m-sobieszek/fonline | /ThirdParty/Asio/src/tests/unit/basic_waitable_timer.cpp | C++ | cpp | 622 | permissive | //
// basic_waitable_timer.cpp
// ~~~~~~~~~~~~~~~~~~~~~~~~
//
// Copyright (c) 2003-2021 Christopher M. Kohlhoff (chris at kohlhoff dot com)
//
// 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)
//
// Disable autolink... |
2d3daf12fe950d87e619d2b01dc481501b8034b6 | a62f5891de771c4a421868fef397a9620d583fdc | NSBHS-Programming-Club/Random-Cpp | /One Compile Challenge/bubble.cpp | C++ | cpp | 650 | no_license | #include <iostream>
bool isSorted(int a[], int size){
for(int i = 1; i < size; i++){
if(a[i] < a[i-1]){
return false;
}
}
return true;
}
int* bubble(int a[], int size){
for(int i = 1; i < size; ... |
1f7bda0e08629d3e40a2af870af50f7d7b1542b7 | 7a3e8ed0423e4b4bdfce449f1ae4d756e5664693 | bvdberg/code | /cpp/tlv_stream/utils/Logger.cpp | C++ | cpp | 3,979 | no_license | #include <stdio.h>
#include <time.h>
#include <sys/time.h>
#include <unistd.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <inttypes.h>
#include "utils/Logger.h"
#include "utils/color.h"
#define LONG_NAMES
static uint64_t getCurrentTime() {
struct timeval tv;
gettimeofday(&tv, 0);
... |
feabb6b93bbe2484db36fef67ffce95a33bcbc49 | 674a9b01eb5bc81e93c969cd4b134c48303ebed1 | dewpey/stellar-core-alt | /src/transactions/InflationTests.cpp | C++ | cpp | 21,953 | permissive | // Copyright 2014 Stellar Development Foundation and contributors. Licensed
// under the Apache License, Version 2.0. See the COPYING file at the root
// of this distribution or at http://www.apache.org/licenses/LICENSE-2.0
#include "herder/LedgerCloseData.h"
#include "ledger/LedgerManager.h"
#include "ledger/LedgerSt... |
44d2e896244b6ee7609f141c79fff5d5d1ae2500 | 786a1727befe1e4577a49f67cd765b4bcc0b2a4c | prakashupes/CompetitiveProgramming | /Tree/BST.hpp | C++ | hpp | 900 | no_license | #ifndef BST
#define BST
#include "001_Tree.hpp"
using namespace MyTree;
class BSTree
{
public:
Node *root = NULL;
Node *root2 =NULL;
Node* insertData(Node *root,int key)
{
if(root==NULL) return new Node(key);
else if(root->key > key) root->left=insertData(root->left,key);
else root->right =insertDat... |
12fcc30a2cd6ccca49308148b6c4cc8e391add02 | 89e713ed21e5670aed8d0c997d23470eefb78a43 | aarmono/crypto_transceiver | /jack_crypto_tx.cpp | C++ | cpp | 17,637 | no_license | /*---------------------------------------------------------------------------*\
Originally derived from freedv_tx with modifications
\*---------------------------------------------------------------------------*/
/*
This program is free software; you can redistribute it and/or modify
it under the terms of the... |
0b934c7d4e10024c2d177ea6b6d25aa405e6af1d | 64179e95ce4ab29527b0ace245097f6202057415 | macpete/Halide | /test/error/async_require_fail.cpp | C++ | cpp | 803 | permissive | #include "Halide.h"
#include <memory>
#include <stdio.h>
using namespace Halide;
int main(int argc, char **argv) {
if (get_jit_target_from_environment().arch == Target::WebAssembly) {
printf("[SKIP] WebAssembly JIT does not yet support async().\n");
_halide_user_assert(0);
}
const int kPr... |
19eb2a7861be7f303bdc16ed8478d32360c6ed29 | 4cf03a5ca2fb61be93536c8f1ffdfec048540e53 | LaughingSun/c2compiler | /c2c/main.cpp | C++ | cpp | 9,295 | no_license | /* Copyright 2013-2016 Bas van den Berg
*
* 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 agr... |
d0aa429abb872840a6af0531ca130d632266daa4 | 90faa1fa1677966bb5a907f7f068e1949957df56 | pampersrocker/SaveGameSyncer | /SaveGameSyncer/SaveGameSyncerWindow.cpp | C++ | cpp | 2,252 | permissive | #include "stdafx.h"
#include "SaveGameSyncerWindow.h"
#include "CreateSaveGameConfigWindow.h"
#include "SaveGameSyncerConfig.h"
#include "Utils/ProcessUtil.h"
#include "SavegameSyncer.h"
SaveGameSyncerWindow::SaveGameSyncerWindow(QWidget *parent)
: QMainWindow(parent)
{
ui.setupUi(this);
Configuration = new SaveGam... |
65a00440743d3d727ad52a2960da92810eab564c | db7955dc16e11a35eb57081a80a44f2c6591d8e8 | niuxu18/logTracker-old | /second/download/git/gumtree/git_patch_hunk_1570.cpp | C++ | cpp | 453 | no_license | {
struct write_shallow_data *data = cb_data;
const char *hex = oid_to_hex(&graft->oid);
if (graft->nr_parent != -1)
return 0;
if (data->flags & SEEN_ONLY) {
- struct commit *c = lookup_commit(graft->oid.hash);
+ struct commit *c = lookup_commit(&graft->oid);
if (!c || !(c->object.flags & SEEN)) {
i... |
bf8d960ef68cbfe8301b23f40b21678bf2a7a109 | 7bed49a083046a1cdb3f25b3b619adcb9bca9655 | Alfredo1777/alfredito | /ConsoleApplication1/ConsoleApplication1/ConsoleApplication1.cpp | C++ | cpp | 280 | no_license | #include <iostream>
#include <string>
using namespace std;
int main()
{
int numero[5];
int suma;
for (int i = 0; i <= 5; i++)
{
cout << "Introduce de manera gentil su numero: ";
cin >> numero[i];
suma = suma + numero[i];
}
cout << "La suma es: " << suma;
return 0;
}
|
71873332e50b6e984265da93afc27864a1172a37 | 87446e8b36aacbc6dcb4ec336d880e50abe04b2a | Mayank-Maurya/Dynamic-Programming-Tasks | /A-frog1.cpp | C++ | cpp | 351 | no_license | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
int main()
{
intl n;
cin>>n;
intl a[n+1];
for(intl i=0;i<n;i++)
{
cin>>a[i];
}
intl dp[n+1];
dp[0]=0;
dp[1]=abs(a[1]-a[0])+dp[0];
for(intl i=2;i<n;i++)
{
dp[i]=min(((abs(a[i-1]-a[i]))+dp[i-1]),((abs(a[i-2]-a[i])+dp[... |
029870fe933e81fa3142001a215764f88a5f710d | c52ad1b486f0a1e55f73b0a5ed3952fbc8c1b570 | bergtholdt/ngraph | /src/ngraph/frontend/onnx_import/exceptions.hpp | C++ | hpp | 1,817 | permissive | //*****************************************************************************
// Copyright 2017-2018 Intel Corporation
//
// 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://w... |
d728e2664aa4c2b3a9f755c12be9ef3480987d0b | 4fec30e5691a5cc0a158ef695820de0f70b2abfa | thanhchungbtc/BattleCity1990CPP | /main.cpp | C++ | cpp | 814 | no_license | #include "Game.h"
#include "Vector2D.h"
#include <iostream>
#include <time.h>
using namespace std;
const int FPS = 60;
const int DELAY_TIME = 1000/FPS;
int main(int argc, char** argv)
{
Uint32 frameStart, frameTime;
srand(time(0));
if (Game::Instance()->init("Battle city", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENT... |
36ce726a6699876b051875262983a2305be44d67 | 3f68494713b7b70d4306d93eb8b21d28ee9ded78 | debanjansaha-git/ssdc | /jSO-SOURCE-RESULTS/main.cc | C++ | cc | 4,128 | no_license | /*
These files are the code of "jSO" for Special Session & Competition on Real-Parameter Single Objective Optimization at CEC-2017 (see [1])
[1] Janez Brest, Mirjam Sepesy Maucec, Borko Boskovic. Single Objective Real-Parameter Optimization: Algorithm jSO,
Proc. IEEE Congress on Evolutionary Co... |
450cbe7ec3abc729543559e23e3d6265b02304b8 | 096076641e15eb5a949e1131a45da5151dd290b4 | DwyaneSuarez/leetcode | /algorithms/65.cpp | C++ | cpp | 2,424 | no_license | class Solution {
public:
bool isNumber(string s) {
int len = s.size();
if (len == 0)
return false;
int l = 0;
while (l < len && s[l] == ' ')
l++;
if (l == len)
return false;
int r = len - 1;
while (r >= 0 && s[r] == ' ')
... |
5bca710129f2e0955501d7fea29a6e9d14275b6d | 96f3b165cdf253f2fc0f24ec36a49df3b7adf6a0 | chris-schroeder/Umpire | /src/umpire/strategy/ZeroByteHandler.cpp | C++ | cpp | 2,150 | permissive | //////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2016-20, Lawrence Livermore National Security, LLC and Umpire
// project contributors. See the COPYRIGHT file for details.
//
// SPDX-License-Identifier: (MIT)
////////////////////////////////////////////////////////////////... |
3ea415c75ee038e9729c57d3cadc811d89b45287 | 1495a7149bb7b0a6f076c01c2250f7bde4bfd0ca | blazhkevych/09072020lab2 | /09072020lab2.cpp | C++ | cpp | 4,216 | no_license | /*
Задание №2
Создайте класс Passport (паспорт), который будет содержать паспортную информацию о гражданине Украины.
С помощью механизма наследования, реализуйте класс ForeignPassport (загран.паспорт) производный от Passport.
Напомним, что заграничный паспорт содержит помимо паспортных данных, также данные о визах, но... |
5672826683547aa05366471ade9ce43c84285984 | 54beab8bf760896b4388ee74738db6c02d82a12c | vis-hnu04/Fall_Detection | /main.cpp | C++ | cpp | 693 | no_license | #include<iostream>
#include "HumanFallDetection.h"
using namespace cv;
using namespace std;
void help(char** argv)
{
cout << "\nThis program gets you started reading a sequence of images using cv::VideoCapture.\n"
<< "Image sequences are a common way to distribute video data sets for computer vision.\n"
<< "Usage:... |
4f6180afa826ab56f53e4c3d1c2da8f4eccea123 | c31d410678cda0598f61fbe6efb94eec954ba243 | pi5/leetcode_algos | /94_inorder_traversal_iterative.cpp | C++ | cpp | 2,648 | no_license | #include<iostream>
#include<vector>
#include<stack>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
void inorderTraversal_recursive_util(TreeNode *root, vector<int> &result) {
if(root == NULL) return;
inorderTraversal_re... |
9ad76f68579fb99243cd0c3c921139651751928f | 35ce80e747f5382abc759660479f0191ca3e3f1e | iglin/dynamic-systems-dsl-engine | /taskbag.cpp | C++ | cpp | 10,794 | no_license | /*$TET$actor*/
/*--------------------------------------------------------------------------*/
/* Copyright 2016 Sergei Vostokin */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); ... |
ee7f7682b8e6535670f0d66ec771991fa2347f2c | ea91ef899b066f738ae1da4e7137af2217635932 | mgh0010/OS_Project5 | /TLB.cpp | C++ | cpp | 1,021 | no_license | //
// Created by michael on 12/3/16.
//
#include <clocale>
#include "TLB.h"
void setuptlb(TLB * tlb)
{
for(int i = 0; i < TLB_LENGTH; ++i)
{
TLB_row * tlb_row = new TLB_row();
tlb_row->age = 0;
tlb_row->page_num = 0;
tlb_row-> frame_num = 0;
tlb->rows.push_back(*tlb_ro... |
f08352ea44236e05b4164f9e5be09c1c6d93e7f7 | 24f4c7ecc89b1760b436b3d9f6a05fe422856c44 | VMironiuk/omim | /map/map_tests/booking_filter_test.cpp | C++ | cpp | 13,984 | permissive | #include "testing/testing.hpp"
#include "generator/generator_tests_support/test_feature.hpp"
#include "generator/generator_tests_support/test_with_custom_mwms.hpp"
#include "map/booking_availability_filter.hpp"
#include "map/booking_filter_processor.hpp"
#include "map/booking_utils.hpp"
#include "search/result.hpp"
... |
88e385aaf529cf4bd7f8906046073de18d425d80 | 00593339f92ae663f9243758196fba1e0396ec24 | linsallyzhao/earlyobjects-exercises | /2015/chapter_15/examples/15_4.cpp | C++ | cpp | 1,033 | no_license | #include <iostream>
class Shape
{
protected:
int posX, posY;
public:
virtual void draw() const = 0;
void setPosition(int pX, int pY)
{
posX = pX;
posY = pY;
}
};
class Rectangle : public Shape
{
public:
virtual void draw() const
... |
c793724be6fd301039d7c5f7c2fc6a520d52b288 | ac137e962d8434cd1ecd0e3dd475450ce5616e00 | masakinihirota/2019pg | /CGL/CGL_2_C.cpp | C++ | cpp | 872 | no_license | #include <math.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
int main() {
double x1, x2, x3, x4, y1, y2, y3, y4, ansx, ansy;
int q;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &x1, &y1, &x2, &y2, &x3, &y3,
... |
aca17def4747ebc33b5f277dffa0c299396ca1c2 | ddedac710724997c72f695e01f777080ff48b18e | mkoeppe/e-antic | /e-antic/test/t-renfxx-io.cpp | C++ | cpp | 1,360 | no_license | /*
Copyright (C) 2017 Vincent Delecroix
This file is part of e-antic
e-antic is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your o... |
3306fb2c87ed169e0cdcfa7d16577a7b534ecf66 | e77fcac7a93589dfe812a5fe464d401772c9ffaf | silverspace/samsara-sdks | /openapi-generator/cpp-tizen/src/TagUpdate.cpp | C++ | cpp | 11,148 | no_license | #include <map>
#include <cstdlib>
#include <glib-object.h>
#include <json-glib/json-glib.h>
#include "Helpers.h"
#include "TagUpdate.h"
using namespace std;
using namespace Tizen::ArtikCloud;
TagUpdate::TagUpdate()
{
//__init();
}
TagUpdate::~TagUpdate()
{
//__cleanup();
}
void
TagUpdate::__init()
{
//new std:... |
1d4c8ca92a620ae8ac91ee77f4961979ac306b80 | b2e526d33540a756aac3922834e71c4d75f7540f | therocode/genes | /include/dna/cerealbackend.hpp | C++ | hpp | 994 | no_license | #pragma once
#include <vector>
#include <cstdint>
#include <sstream>
#include <cereal/archives/binary.hpp>
namespace dna
{
class CerealBackend
{
public:
template <typename InType>
std::vector<uint8_t> encode(InType&& data);
template <typename OutType>
Out... |
d541b759b40858c2bda32d8afec2ce7fb9255524 | 3064673b5d0eaf4540274df4e1e6f0b4d7ef45f9 | xlla/Pangolin | /components/pango_opengl/src/glfont.cpp | C++ | cpp | 6,064 | permissive | /* This file is part of the Pangolin Project.
* http://github.com/stevenlovegrove/Pangolin
*
* Copyright (c) 2013 Steven Lovegrove
*
* 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 wit... |
ec5fdb33afce0e822144f7306baa1281dc593330 | 76487006981c2ef42546756bf63bba1eb9d7efe5 | michaellukashov/ConEmu | /src/ConEmuHk/ExtConsole.cpp | C++ | cpp | 47,576 | permissive |
/*
Copyright (c) 2012-2015 Maximus5
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the followin... |
75495390ee8a5b03d9ae860cf3df97f72443d35a | 81fee3c3b3e27b3129e6291aaa32b2d08a742cc8 | jaccen/GLES-FrameWork | /Framwork/src/Common/engine.cpp | C++ | cpp | 1,882 | no_license | #include "engine.h"
Engine::Engine(glm::vec2& windowSize)
{
m_windowSize = windowSize;
m_sceneManager = new SceneManager();
m_shaderManager = new ShaderManager();
m_renderer = new Renderer( m_shaderManager);
//Scene* scene = m_sceneManager->getCurrentScene();
}
void Engine::update(float t)
{
Scene... |
bd8517bcdfbdad57f7f29805f354ef1ed7e99234 | f61ee1f25a45e1024b4e38938fe07979c30be00f | allenck/DecoderPro_app | /libPr3/logixng/debuggermalestringexpressionsocketfactory.cpp | C++ | cpp | 961 | no_license | #include "debuggermalestringexpressionsocketfactory.h"
#include "malestringexpressionsocket.h"
#include "instancemanager.h"
#include "defaultlogixngpreferences.h"
#include "debuggermalestringexpressionsocket.h"
/**
*
* @author daniel
*/
//@ServiceProvider(service = MaleStringExpressionSocketFactory.class)
//public c... |
1aaf20959f3a67828e5a37e659b6dd108be75ba7 | 6da7e4ac5c92f4426bca6c6117452ee36307770d | HeHaowei/Leetcode | /main/Longest Common Prefix.cpp | C++ | cpp | 997 | no_license | class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string result = "";
int s = strs.size();
if (s==0) return result;
if (s==1) return strs[0];
int min_size = strs[0].size();
char com = strs[0][0];
... |
76f4eca7ace77bd9f7946601fea7f790cc290dc4 | a69a9c4bd60e48f83839fc9e103f77ae8026df8b | gnoliyil/fuchsia | /src/lib/fxl/functional/cancelable_callback_unittest.cc | C++ | cc | 3,434 | permissive | // Copyright 2017 The Fuchsia 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/lib/fxl/functional/cancelable_callback.h"
#include <gtest/gtest.h>
namespace fxl {
namespace {
void AddBToA(int* a, int b) { (*a) += b; }
... |
6b191750081b73dae563fc26cea2a1e45faa33bb | a8a01397cc608e60db1b64cd2b062c37555a834c | thsgytjr/leetcode | /topics/Binary_Search/[410] split_array_largest_sum.cpp | C++ | cpp | 1,443 | no_license | /*
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
Note:
If n is the length of array, assume the following constraints are satisfied:
1 ≤ n ≤ 1000
1 ≤ m ≤ min(5... |
569e7f3794de0dc361817bd6de29a41825485628 | 7fb4c75e1c1ca70d7b1711a3ca8a1f1dcf02200e | JimmyLauren/the-23-gang-of-four-design-patterns-with-cplusplus | /创建型模式/Builder/main.cpp | C++ | cpp | 227 | permissive | #include "Builder.h"
#include "Product.h"
#include "Director.h"
#include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
Director* d = new Director(new ConcreteBuilder());
d->Construct();
return 0;
}
|
9efbb4c445a402ba231b55e9dcc4c38a6652bdf3 | 6a6094658129a4b3982ccb09a5914d644b7dc620 | HyogeunEE/algorithm | /BOJ_16236.cpp | C++ | cpp | 2,688 | no_license | // BOJ_16236 아기 상어
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
struct pt {
int x, y;
int len; // 상어의 이동거리
const bool operator<(const pt &p) const {
// 1. len 비교
if (len == p.len) {
... |
08f1a979e660a99869af2c5cf333df1d6d6528a0 | e3db926df6212b3f7ef5369e104100c6e1b4184b | hlodwig1993/KsiazkaAdresowaObiektowo | /main.cpp | C++ | cpp | 2,153 | no_license | #include <iostream>
#include "KsiazkaAdresowa1.h"
using namespace std;
char wybor;
int main()
{
KsiazkaAdresowa ksiazkaAdresowa("Uzytkownicy.txt","Adresaci.txt");
while(true)
{
if (!ksiazkaAdresowa.czyUzytkownikJestZalogowany())
{
wybor = ksiazkaAdresowa.wybierzOpcjeZMenuGlown... |
f0ff80bca1a55a7eb6d4bcc7f47ae063c6a1ca33 | abe4f9a1017cf576c629a1b29523dc1f21b0f4f2 | mopalka/smokey | /src/gui.cpp | C++ | cpp | 5,029 | no_license | #include "gui.hpp"
#include "drawer.hpp"
#include "engine.hpp"
#include <QtGui>
#include "car.hpp"
#include "player_car.hpp"
#include <iostream>
MainWindow::MainWindow() {
central = new CentralWidget(this);
setCentralWidget(central);
createActions();
createMenus();
// createToolBars();
createS... |
1672c682d43518f825b6086277a0b1778f975b49 | e853c11ff647e13286eef05152e618fa115250a3 | BharadwajMP/Face-Track | /main.cpp | C++ | cpp | 4,141 | no_license | #include <iostream>
#include<opencv2/opencv.hpp>
#include<opencv2/tracking.hpp>
#include "face_detector.hpp"
#include "helpers.hpp"
#include<vector>
#include<fstream>
#define FRAME_LIFE 2
#define FRAME_RATE 30
using namespace std;
using namespace cv;
//Function to decrement tracker life
void desc(std::pair<Ptr<Tracker... |
f2934cb9761c5d97513985292556ecbec1302762 | c9146aa6b7fd7cb2f3f29f6d312c2f1bf8cafa6b | whycoding126/chromium | /chrome/browser/google/google_update_win_unittest.cc | C++ | cc | 42,225 | permissive | // Copyright 2014 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 "chrome/browser/google/google_update_win.h"
#include <windows.h>
#include <atlbase.h>
#include <atlcom.h>
#include <wrl/client.h>
#include <mem... |
b592d0f179da2c759b39bf616a3223d87da1ca69 | c36fda96d382170aac4a5205c74eab64afaa3d9e | alexorrec/photoshock | /controller.cpp | C++ | cpp | 4,537 | no_license | #include "controller.h"
#include <utility>
void Controller::load(QString path){
model->imgLoad(path);
model->setFlag(true, model->is_Loaded);
originator->setValue(0, originator->exposure_Val);
originator->setValue(0, originator->contrast_Val);
originator->setValue(0, originator->red_Val);
ori... |
d3b1cda47daf367579d0fa510af11dcc080ac9d3 | ab9c841429858c2331933262c007ac919d99afdd | kgasniko/ZeeD2p76 | /ZeeDExamples/src/ZeeDExampleHistManager.cxx | C++ | cxx | 3,257 | no_license | #include "ZeeDExamples/ZeeDExampleHistManager.h"
// Root includes
#include <TLorentzVector.h>
// Analysis includes
#include "ZeeDEvent/ZeeDEvent.h"
#include "ZeeDCalculator/ZeeDElectron.h"
#include "ZeeDCalculator/ZeeDZBoson.h"
#include "egammaEvent/ElectronContainer.h"
#include "ZeeDMisc/ZeeDMisc.h"
//-----------... |
7ebf646117c72f715a9002681f15bbecdaa5c6f7 | d48339913d09b25f19e5ec773e994051fd94b83e | manolismih/OJsolutions | /australia (orac.amt.edu.au)/chimera.cpp | C++ | cpp | 1,774 | no_license | #include <cstdio>
#include <algorithm>
#define incmarks ++marks[0],++marks[1],++marks[2]
#define decmarks --marks[0],--marks[1],--marks[2]
#define cpmarks data[datai].dna[0]=dna[0][i], data[datai].dna[1]=dna[1][i], data[datai].dna[2]=dna[2][i]
using namespace std;
FILE *fin=fopen("chimin.txt","r"), *fout=fopen(... |
0dce8a9a3b024102d98d2aa6db1f2769da970a19 | 9c17b25fe66926709e3b6e2558544a885e896b52 | herfrain/cc | /Dw_Transform.cpp | C++ | cpp | 2,017 | no_license | // Dw_Transform.cpp : implementation file
//
#include "stdafx.h"
#include "calculator.h"
#include "Dw_Transform.h"
#include "Length.h"
#include "Area.h"
#include "Weight.h"
#include "Volum.h"
#include "_Time.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
//////////... |
e422179759b5e9596f5fb5ff47310141e5cec5e2 | 2c070d1c19bb3f4b99d92d4a6bbba15c06542447 | lauer3912/chromium.src | /chrome/browser/browsing_data/browsing_data_remover.cc | C++ | cc | 41,828 | 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 "chrome/browser/browsing_data/browsing_data_remover.h"
#include <map>
#include <set>
#include "base/bind.h"
#include "base/bind_helpers.h"
... |
f0cb1d4fd8e43f9b13caa2527eacf830834790e5 | 1c51ea577fa6aca683adc9989af0fca49e98d140 | alex-min/rtype-2014-minetta | /GraphicClient/Sounds.cpp | C++ | cpp | 1,783 | no_license | #include "Sounds.h"
Sounds::Sounds(const std::string &music, const std::string &weapon, const std::string &explosion)
{
if (!_gameMusic.OpenFromFile(std::string(SONGPATH) + music))
std::cout << "Error trying to open the music song file -> " << std::string(SONGPATH) + music << std::endl;
else
_... |
7001b93da160fb4fb1a7401b322016c026786f4a | 8720e65627344be10e1cb5b5dfa435ebbac2ceb7 | moosburger/SpielZeit | /SetUpPcZeit/GeneratedFiles/Release/moc_QWinWidget.cpp | C++ | cpp | 2,721 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'QWinWidget.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.4.0)
**
** WARNING! All changes made in this file will be lost!
****************************************************... |
7b0e170be6c281d08bf79854153285899a7d7071 | bcba01cd6c8fcda9b299bb19498b8fb13cc8f664 | tokitsu-kaze/ACM-Solved-Problems | /Codeforces/Codeforces Round 634/1335C - Two Teams Composing.cpp | C++ | cpp | 4,077 | no_license | #include <bits/stdc++.h>
using namespace std;
namespace fastIO{
#define BUF_SIZE 100000
#define OUT_SIZE 100000
//fread->read
bool IOerror=0;
//inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc(){
static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
if(p1==pend){
... |
4c8d429b240a00c6a25bcec971979b21c0e1a4eb | f455e8ab4a9998288086e7344e0c1d212b65b226 | accb529/Kassiopeia | /KGeoBag/Source/Extensions/Random/Include/KGBoxSpaceRandom.hh | C++ | hh | 673 | no_license | /*
* KGBoxSpaceRandom.hh
*
* Created on: 13.05.2014
* Author: oertlin
*/
#ifndef KGBOXSPACERANDOM_HH_
#define KGBOXSPACERANDOM_HH_
#include "KGShapeRandom.hh"
#include "KGBoxSpace.hh"
namespace KGeoBag
{
/**
* \brief Class for dicing a point inside a KGBoxSpace.
*/
class KGBoxSpaceRandom : virtu... |
2c39630f23d24c316b8789b9cfef0344bd6a29f0 | 8aff93bfb0cb675a9cbc8d4ec5024ca4a029a6c6 | Mentos-/Mordhau_SDK | /SDK/Mordhau_BP_BoltProjectile_classes.hpp | C++ | hpp | 685 | no_license | #pragma once
// Mordhau (Dumped by Hinnie) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGeneratedClas... |
d08d689b37521dfc84404f3cdcf84c89a8415b06 | 85947ecdd5b145a1d52262f7ff53efe49b106f98 | juremenart/rcCarControl | /sw/rccGui/src/mainwindow.cpp | C++ | cpp | 1,527 | no_license | #include <QTabWidget>
#include <QToolButton>
#include <QLabel>
#include "mainwindow.h"
#include "ui_mainwindow.h"
#include "helperMacros.h"
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent), ui(new Ui::MainWindow),
mMainWidget(NULL), mMainLayout(NULL), mTabWidget(NULL),
mCtrlWidget(NULL), mDrv... |
e2c5ff334bb93c3b3028f38bc07b68133c541b92 | f11408d79f572d664739af6c36271aa0f9471497 | pdpdds/Win32OpenSourceSample | /libtomEx3/libtomEx3.cpp | C++ | cpp | 1,265 | no_license | // libtomEx3.cpp : 콘솔 응용 프로그램에 대한 진입점을 정의합니다.
//
#include "stdafx.h"
#include <tomcrypt.h>
#pragma comment(lib, "tomcrypt.lib")
int md5Test();
int shaTest();
int _tmain(int argc, _TCHAR* argv[])
{
shaTest();
//md5Test();
return 0;
}
int shaTest()
{
int idx, err;
hmac_state hmac;
uns... |
9c2f828ed106afae33f9b4802d791eeaf1f1cfad | cba41a9c32ab52f354bb7e0197084a72b6c89134 | Stephen-Seo/SeoSplasher | /src/ec/system.hpp | C++ | hpp | 494 | permissive |
#ifndef SYSTEM_HPP
#define SYSTEM_HPP
#include <memory>
#include <map>
#include <SFML/System.hpp>
#include "node.hpp"
struct Context;
class System : private sf::NonCopyable
{
public:
explicit System(std::unique_ptr<Node> nodeType);
bool checkEntity(Entity& entity);
void removeEntity(int eID);
voi... |
c329138f63f65f89bbf471d251f13bb951fe859a | c94495ef2cd2833f40cc03e127086e3d8b6aed66 | zp1996/PAT | /Basic Level/1055.cpp | C++ | cpp | 1,746 | no_license | //
// 1055.cpp
// PAT Basic Level
//
// Created by apple on 16/7/7.
// Copyright © 2016年 zp1996. All rights reserved.
//
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
struct Person
{
string name;
int height;
};
bool compare (Person &a, Person &b)
{
return a.height > b.heig... |
6f79a82a709d8b97cd1c71f0b334f5ec50375f44 | 93dcfe905319d3bdb13948d36912f9cbcbedb684 | anteins/GameplayFootball | /src/menu/menutask.cpp | C++ | cpp | 5,619 | permissive | // written by bastiaan konings schuiling 2008 - 2015
// this work is public domain. the code is undocumented, scruffy, untested, and should generally not be used for anything important.
// i do not offer support, so don't ask. to be used for inspiration :)
#include "menutask.hpp"
#include "../onthepitch/match.h... |
7844219d1cc65bb89c7bc7ad343a51d609b3da2f | 1db3c45f7050157d96392d12bc177ed2e9824927 | dreamboy9/fuchsia | /src/devices/securemem/drivers/aml-securemem/sysmem-secure-mem-server.cc | C++ | cc | 12,626 | permissive | // Copyright 2019 The Fuchsia 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 "sysmem-secure-mem-server.h"
#include <lib/async-loop/default.h>
#include <lib/fidl-async/cpp/bind.h>
#include <lib/fit/defer.h>
#include <cintt... |
3a25b4e824c5e2fe366b3ced084cb55e86344ac8 | b26443fce65a6ca1b4e2f87cec48ffb25dbf4d89 | corymonroe/GrinPlusPlus | /src/P2P/Dandelion.cpp | C++ | cpp | 6,048 | permissive | #include "Dandelion.h"
#include "ConnectionManager.h"
#include "Messages/TransactionMessage.h"
#include "Messages/StemTransactionMessage.h"
#include <Common/Util/StringUtil.h>
#include <Common/Util/ThreadUtil.h>
#include <Crypto/RandomNumberGenerator.h>
#include <Infrastructure/ThreadManager.h>
#include <Infrastructu... |
33101dbf4438dca1fc7f7015482189e797608d26 | 1bbbf8e412655f4c929f5d108d74b4d71edcbc1f | MichaelBranz/MDE4CPP | /src/fuml/src_gen/fUML/impl/StartClassifierBehaviorActionActivationImpl.cpp | C++ | cpp | 9,742 | permissive | #include "fUML/impl/StartClassifierBehaviorActionActivationImpl.hpp"
#ifdef NDEBUG
#define DEBUG_MESSAGE(a) /**/
#else
#define DEBUG_MESSAGE(a) a
#endif
#ifdef ACTIVITY_DEBUG_ON
#define ACT_DEBUG(a) a
#else
#define ACT_DEBUG(a) /**/
#endif
//#include "util/ProfileCallCount.hpp"
#include <cassert>
#include... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.