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 |
|---|---|---|---|---|---|---|---|---|
43ef78f2e3ab3ea149068243ac0ff75701a1b935 | 24eec975b7349a89609abd81de3dd70867eae7e3 | pingcap/poco | /Net/src/MulticastSocket.cpp | C++ | cpp | 6,583 | permissive | //
// MulticastSocket.cpp
//
// Library: Net
// Package: Sockets
// Module: MulticastSocket
//
// Copyright (c) 2005-2006, Applied Informatics Software Engineering GmbH.
// and Contributors.
//
// SPDX-License-Identifier: BSL-1.0
//
#include "Poco/Net/MulticastSocket.h"
#ifdef POCO_NET_HAS_INTERFACE
#include "Po... |
74f5e9fa7be92d05d875d1d2f7df7339c1e48321 | de4e7915f9b9942ed1e7241696c4fddaf4f205ff | atramui11/gfx_VR_final | /gfx_run/src/io/SaverWrl.hpp | C++ | hpp | 1,300 | no_license | #ifndef _IFS_WRL_SAVER_HPP_
#define _IFS_WRL_SAVER_HPP_
#include "Saver.hpp"
#include <wrl/Shape.hpp>
#include <wrl/Appearance.hpp>
#include <wrl/Material.hpp>
#include <wrl/IndexedFaceSet.hpp>
#include <wrl/IndexedLineSet.hpp>
#include <wrl/ImageTexture.hpp>
#include <wrl/Transform.hpp>
#include <wrl/SceneG... |
37ee05ae612b7699db21715c120fdbb499bbe626 | ea7ba4d8af51e99cd0d29d551aead244a9d37e4d | LetsOffBrains/Forward_EngineSimulation | /main.cpp | C++ | cpp | 265 | no_license | #include "Console.h"
#include "TestStand.h"
#include "Engine.h"
int main() {
Console con;
TestStand ts;
Engine eng;
con.input_OutsideTemp();
ts.setTemp(con.getTemp());
ts.setEngine(&eng);
//con.write("Something");
con.output_Results();
return 0;
}
|
8ff4ddc9f892cb6a7af411146e59f06ac06d9422 | a29897c5763e083d0b86250a5cd60c0e414fc93f | anindya028/Programming-Contest-Problems | /UVa/v100/10082.CPP | C++ | cpp | 637 | no_license | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
//#define Long __int64
//#define Long long long
int main()
{
char s[]={"`1234567890-=QWERTYUIOP[]ASDFGHJKL;'ZXCVBNM,./"};
char temp[10000];
int i,j;
while(gets(temp))
{
for(i=0;temp[i];i++)
{
if(temp[i]==' ')
... |
dc7366a0cf505199d0e0eaa9ba40f46335e030c1 | 7c06d709c82d1bedf0175000af80f0d8a608502c | joselp/project-biblioteca | /formsearchprestamo.cpp | C++ | cpp | 13,916 | no_license | #include "formsearchprestamo.h"
#include "ui_formsearchprestamo.h"
FormSearchPrestamo::FormSearchPrestamo(QWidget *parent) :
QWidget(parent),
ui(new Ui::FormSearchPrestamo)
{
ui->setupUi(this);
initGUI();
}
FormSearchPrestamo::~FormSearchPrestamo()
{
delete ui;
}
void FormSearch... |
52d5f25a76428305119a6e1bff5a79b93eb13dbc | ae731578de2418bc6a8b4d661a1992bc8fdf6cc6 | alexandraback/datacollection | /solutions_2692487_1/C++/qiaokan/a.cpp | C++ | cpp | 1,239 | no_license | #include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric> ... |
ed6a698012257c1dc80fbe7f549af28e556e906d | 8f2815026d644d5696e4c7f8b3118a8cf8316019 | dianagut/Program3 | /program3/program3/graphm.cpp | C++ | cpp | 4,447 | no_license | //
// graphm.cpp
// Graph
//
// Created by Diana Gutierrez on 2/7/20.
// Copyright © 2020 Diana Gutierrez. All rights reserved.
//
#include <stdio.h>
#include "graphm.h"
#include <vector>
using namespace std;
GraphM::GraphM()
{
for(int i = 0; i < MAXNODES; i++) {
for (int j = 0; j < MAXNODES; j++) {
... |
ffade94d69ce42aebb25745fb3b5caf70de15261 | d2424f801a7ffc597ebc862b940cba995508e8fa | cdeepakroy/VesselView | /Modules/Loadable/TortuosityModule/Logic/vtkSlicerTortuosityLogic.cxx | C++ | cxx | 15,966 | permissive | /*=========================================================================
Library: TubeTK
Copyright 2010 Kitware Inc. 28 Corporate Drive,
Clifton Park, NY, 12065, USA.
All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the Lic... |
7cf06f711dc29e593f9c874b00bb3f82a51e6924 | b9bf6470f662b793eb1bfaada09152fe2c40e24b | rambo/ccc15-teslacoil | /src/tesla.hpp | C++ | hpp | 2,971 | no_license | #include <math.h>
#define MAPVALUE(data, inmin, inmax, outmin, outmax) (data-inmin) * (outmax-outmin) / (inmax-inmin) + outmin;
// midiToTesla:
// Convert a MIDI note (number, velocity)
//
// and check that it is within the safety bounds
bool
midiToTesla(uint8_t noteNumber, uint8_t velocity,
uint8_t maxDutyP... |
bdd186656d00001f4455c220a89f75b2067ac083 | 590d8b6835ca13cb1bedc9af2c5ae900adf752a1 | chenjianlong/books-code | /head-first-design-pattern/cpp/factory/pizzaaf/reggiano_cheese.cpp | C++ | cpp | 214 | no_license | /* $Id$ */
#include "reggiano_cheese.h"
Reggiano_Cheese::Reggiano_Cheese()
{ }
Reggiano_Cheese::~Reggiano_Cheese()
{ }
std::string Reggiano_Cheese::to_string()
{
return "Reggiano Cheese";
}
|
73eb42dd2141874d072ed0ad359a014747c3f27b | 7938da7f97b8f269dfa1b0ab41cb4de95d52716a | everscalecodes/knapsack-snark | /libs/multiprecision/test/compile_fail/conv_fail_10.cpp | C++ | cpp | 415 | permissive | ///////////////////////////////////////////////////////////////////////////////
// Copyright 2012 John Maddock. 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 <nil/crypto3/multiprecision/cpp_int.hpp>
... |
c6b41a3f8fe0e6cc5890cf0e50ebccb722e36e9d | fd16c0c092b740e99fd91b3ec34a7527cfc1de48 | blowery/phantomjs | /src/qt/src/3rdparty/webkit/Source/JavaScriptCore/runtime/PropertySlot.cpp | C++ | cpp | 1,393 | permissive | /*
* Copyright (C) 2005, 2008 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any late... |
3c9ffbb14d95be9b60a9a29f9133cb8491439764 | 9631a971bccf0763e8b2faefc508076c1853e28f | selonsy/cplusplus | /Messy_Test-master/demo/DesignPatternsTest/Facade.cpp | C++ | cpp | 943 | permissive | #include "Facade.hpp"
// Blog: http://blog.csdn.net/fengbingchun/article/details/30972323
Subsystem1::Subsystem1()
{
}
Subsystem1::~Subsystem1()
{
}
void Subsystem1::Operation()
{
std::cout << "Subsystem1 operation ..." << std::endl;
}
Subsystem2::Subsystem2()
{
}
Subsystem2::~Subsystem2()
{
}
void Subsyste... |
95d7860e8a013b829caebe36dfc72ea81d5e7666 | 1c434a4416664eaa568d66789a8de42dbbe4c08e | aajjbb/contest-files | /Codeforces/ProgressBar.cpp | C++ | cpp | 737 | permissive | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
typedef long long ll;
ll n, k, t;
int main(void) {
scanf("%ld%ld%ld", &n, &k, &t);
for(ll x = 0; ; x++) {
if((x*100) <= (n*k*t) && (n*k*t) < ((x + 1)*100)) {
vector<ll> ans(n, 0);
for... |
afb6af4b2f59088f89b54c5f3c0a63a08de6e9f4 | 9c3591011e47a39fe520b624a19a18337dffb430 | jordanbonaldi/Zappy | /graphic/src/Window.cpp | C++ | cpp | 891 | no_license | /*
** EPITECH PROJECT, 2018
** Window
** File description:
** Implementation of Window
*/
#include <EventManager.hpp>
#include "Window.hpp"
Event Window::event;
irr::IrrlichtDevice *Window::device = irr::createDevice(irr::video::EDT_OPENGL,
irr::core::dimension2du(800, 600), 16,
false, true, true, &event);
Window... |
311532d8af0f221229e015822675c9802cde1e20 | f4047f72f82b1c1d144fd09277affe3db760d44c | Pathgather/smashgather | /client/extract_player_icons.cpp | C++ | cpp | 1,116 | no_license | #include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <iostream>
#include <chrono>
#include <ctime>
#include "src/ContainsTemplate.h"
using namespace std;
using namespace cv;
string randomFilename() {
auto time = std::chrono::system_clock::now();
... |
00978c8871792367d0ecafcb6df4211e7f2965e9 | f9a76ced2e3476d4ff89ba027463ab88773ef107 | more-errors/QJoysticks | /examples/JoystickList/main.cpp | C++ | cpp | 3,509 | permissive | /*
* Copyright (c) 2015-2016 Alex Spataru <alex_spataru@outlook.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
... |
0d90c9fbf10a6864e601a0b2d96d98610f70997c | 5c2b0006b5457a2c147d1a07d09e1c913c1e58d7 | danielgrigg/sandbox | /langs/c++/objgroups/objgroups.cpp | C++ | cpp | 2,417 | permissive | #include <algorithm>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <sstream>
#include <stdint.h>
#include <string>
#include <vector>
#include <boost/lambda/lambda.hpp>
#include <boost/lambda/bind.hpp>
using namespace std;
... |
f00aa677103b64a676664c89edeffaa8b173339b | ce037f9cebb842cc5135c88ba5e1f1a5b569dc09 | teberr/cpp_master | /cpp 연습문제/coffeeMachine.cpp | C++ | cpp | 1,625 | no_license | #include "stdafx.h"
#include "coffeeMachine.h"
#include <iostream>
using namespace std;
coffeeMachine::coffeeMachine(int coffee,int water, int sugar)
{
this->coffee = coffee;
this->water = water;
this->sugar = sugar;
}
coffeeMachine::~coffeeMachine()
{
}
void coffeeMachine::drinkEspresso(){
int state = 1;
if (t... |
65eedea32572bc1fa81469ddcf096a5d5d307bd3 | 823f75fdd490849f172c2741a8da76aa82277a5c | MikkoKivekas/GraduSimut | /solenoid/solenoid.cpp | C++ | cpp | 4,489 | no_license | #include <fstream>
#include <iomanip>
#include <limits>
#include "epot_bicgstabsolver.hpp"
#include "meshvectorfield.hpp"
#include "gtkplotter.hpp"
#include "geomplotter.hpp"
#include "geometry.hpp"
#include "func_solid.hpp"
#include "epot_efield.hpp"
#include "error.hpp"
#include "ibsimu.hpp"
#include "trajectorydiagn... |
29ee2a88309aa29a7e19300f4d645da9da8a460b | 6de335a544a9f7539435b219b53ed91114f0a73f | jeremyjflowers/AIClassExample | /raygame/Edge.cpp | C++ | cpp | 575 | permissive | #include "Edge.h"
#include "Node.h"
#include <raylib.h>
Edge::Edge(Node* node1, Node* node2)
{
connectedNode1 = node1;
connectedNode2 = node2;
}
void Edge::update(float deltaTime)
{
Actor::update(deltaTime);
//Update the position to match the position of the first connected node
setWorldPostion(connectedNode1->... |
125364ba23bfb5f20c4c48f230c0593289ec147f | 5664ac7eb8e7df725f652bba2ccba688e82c98cf | Ablustrund/PATCode | /PAT_A/PAT_A1008.cpp | C++ | cpp | 395 | permissive | #include <bits/stdc++.h>
using namespace std;
int n, preFloor = 0, res = 0, nextFloor;
int main()
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%d", &nextFloor);
if(nextFloor - preFloor > 0) res += (nextFloor - preFloor) * 6;
else res += (preFloor - nextFloor) * 4;
p... |
673ae953b5c9e2a38886c4806523b3a55f75ee65 | e13a50a99c588cc260dab5cc4bc4f26aacd882ab | zacario-li/tvm | /src/relay/pass/fold_scale_axis.cc | C++ | cc | 34,676 | permissive | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... |
ae40b0f0a1d04fb64917577a68ac8e6eb75dd762 | 53f2c7c4621b4692ac87bc23e960502d12d805fe | AThilenius/thilenius | /base/value_of.hh | C++ | hh | 1,138 | no_license | // Copyright 2015 Alec Thilenius
// All rights reserved.
#ifndef BASE_VALUE_OF_H_
#define BASE_VALUE_OF_H_
#include <string>
#include "base/log.h"
namespace thilenius {
namespace base {
template <typename T>
class ValueOf {
public:
ValueOf(T&& value) : value_(value), is_valid_(true) {}
ValueOf(T&& value, std:... |
25ce1436097567bc6d4b00cdf5b78c690c4dee37 | 3db252e64f6cedad5937247d0425b35f1a4b2b72 | dawnbreaks/taomee | /gf/gongfu_online/chat.hpp | C++ | hpp | 4,978 | no_license | /**
*============================================================
* @file message.hpp
* @brief message related functions are declared here. (talk_cmd, ...)
*
* compiler gcc4.1.2
* platform Linux
*
* copyright: TaoMee, Inc. ShangHai CN. All rights reserved.
*
*=====================... |
a6112c0576353b2f16b3df319090bedfa7b2f04b | 1c6f5c8ee80106e3ef3f2ae381be49cf75ec0ad2 | robotprogrammer22/ISIS3 | /isis/src/mro/apps/pds2hideal/main.cpp | C++ | cpp | 8,583 | permissive | #include "Isis.h"
#include <QString>
#include "Cube.h"
#include "IString.h"
#include "FileName.h"
#include "ProcessImportPds.h"
#include "Pvl.h"
#include "PvlKeyword.h"
#include "PvlGroup.h"
#include "UserInterface.h"
using namespace Isis;
using namespace std;
void addTableKeywords(Pvl *isisLabel, Pvl pdsLabelPvl);... |
d7ccbbb69a774a966bd3a2f6be3850b86d62407e | 34689fb8775e48d8a7e8d6063cb3c13d5b30d35d | BHD233/Chalenge2-TRIES | /Challenge_02/TrieStructure/TrieStructure/HashTable.cpp | C++ | cpp | 1,301 | no_license | #include "HashTable.h"
int HashTable::s_prime = 65713;
int HashTable::s_alphabetSize = 26;
HashTable::HashTable()
{
m_hashTableSize = 150000; // Gần bằng số lượng từ trong từ điển.
m_hashTable = new string[m_hashTableSize];
}
int HashTable::hashFuntion(string value)
{
int result = 0;
int temp = 0;
//Băm từng ... |
f8cf548e927aa68c794588dec5f74ce9f8e4cf7e | 9d78287fc761b2505cffbb04482da3a31a478acb | Falcons-Robocup/code | /packages/facilities/environment/src/cEnvironmentRobot.cpp | C++ | cpp | 1,566 | permissive | // Copyright 2016-2020 Michel Koenen (Falcons)
// SPDX-License-Identifier: Apache-2.0
/*
* cEnvironmentRobot.cpp
*
* Created on: Dec 20, 2015
* Author: Michel Koenen
*/
#include <ext/cEnvironmentCommon.hpp>
#include "falconsCommon.hpp"
#include "tracing.hpp"
#include "ext/cEnvironmentRobot.hpp"
using names... |
6f9fe919ec3e9bbd06bc3734c8c3dd7ddb391e9d | e36e74eaa46d0c4f89aba013403cc9af52d53501 | iridium-browser/iridium-browser | /content/renderer/media/win/dcomp_texture_wrapper_unittest.cc | C++ | cc | 4,550 | permissive | // Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/run_loop.h"
#include "base/task/single_thread_task_runner.h"
#include "base/test/mock_callback.h"
#include "base/test/task_environment.h"
#include "content/rende... |
948a52cc5a2486fa54d306a87220e46b0294018e | 374893dd1586543bc93b916a3b994e0bf688a484 | freall/cpp-primer-practice | /01/1-14.cpp | C++ | cpp | 465 | no_license | #include <iostream>
int main()
{
std::cout << "Enter two numbers:" << std::endl;
int v1, v2;
std::cin >> v1 >> v2;
int lower, upper;
if (v1 <= v2) {
lower = v1;
upper = v2;
} else {
lower = v2;
upper = v1;
}
int sum = 0;
for (int val = lower; val <= upper; ++val) {
sum += val;
}
... |
a06764efc77a03699ce91827f25f3e752fffe9fa | 51b2f7fa465a3a75e9fac57b7b0f03cd57fce9bc | marks12/education | /cpp/Sample004.cpp | C++ | cpp | 409 | no_license | #include <iostream>
using namespace std;
// what is biggest
int main() {
double numA, numB;
cout << "Enter first double:";
cin >> numA;
cout << "Enter second double:";
cin >> numB;
if (numA > numB) {
cout << "First double biggest\n";
}
if (numA < numB) {
cout << "Se... |
b6aa2deac045d71185bde1ce638bab162634e14a | bb0c3bb0518c6aeb7d0f43b9209cda2741d11014 | Omn1z/OpenIW8 | /workspace/iw8/code_source/src/game/g_static.cpp | C++ | cpp | 3,914 | no_license | /*
==============
GStatic::GetLeftHandIKTargetModel
==============
*/
XModel *__fastcall GStatic::GetLeftHandIKTargetModel(GStatic *this)
{
return ?GetLeftHandIKTargetModel@GStatic@@UEBAPEAUXModel@@XZ(this);
}
/*
==============
GStatic::CreateWeaponPhysics
==============
*/
void __fastcall GStatic::CreateWeaponPhy... |
3bf87b30beb73139a3d60a2f9178d49169d37f39 | fe903a388b15b750ef2a0315c7b115ea89363106 | zhenzeZ/onlineProject | /onlineProject（server）/OnlineGameProject/Main.cpp | C++ | cpp | 377 | no_license | #include "Game.h"
int main(int argc, char* argv[]) {
//int random = rand() % 2;
//Server MyServer(1111); //Create server on port 100
//Game* game;
//game = new Game(MyServer, random);
//if (random == 0) {
// MyServer.ListenForNewConnection(false);
//}
//else {
// MyServer.ListenForNewConnection(true);
//}
... |
c2f61fd524a4428415a67038d6ac6461d66a21ed | 576bf4aa2bae64ed2c9db23d00a4b13f26559826 | HPCCS/XAPR | /Benchmarks/Serial_code/bfs/bfs.cpp | C++ | cpp | 5,301 | permissive | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <chrono>
#include <iostream>
#include <omp.h>
//#define NUM_THREAD 4
//#define OPEN
int no_of_nodes;
int edge_list_size;
FILE *fp;
using namespace std;
//Structure to hold a node information
struct Node
{
int st... |
01da093e1a2f452e19c6b5fdbee74606952561ec | dd05b814835bef29955f2c45d3eca2fefd5516c9 | BIGpony777/MyCode | /Zylabs/Section 2.2/functions.cpp | C++ | cpp | 429 | no_license | #include "functions.h"
void removeGray(int redAmount, int greenAmount, int blueAmount, int result[])
{
int minValue;
minValue = redAmount;
if (greenAmount < minValue)
{
minValue = greenAmount;
}
if (blueAmount < minValue)
{
minValue = blueAmount;
}
result[0] = redAmount... |
a58c606afaff2d31313783bb67e9f99a09f4b44d | ba97cd3f89aa4ab703f45c9792cac3b128ed9e0d | vimalsheoran/DataStructuresAndAlgorithms | /sorting_algorithms/bubble_sort.cpp | C++ | cpp | 639 | no_license | #include <bits/stdc++.h>
using namespace std;
void bubble_sort(int arr[], int N) {
int outer_loop_counter = 0;
for (int i = 0; i < N; i++) {
outer_loop_counter++;
int swap_counter = 0;
for (int j = 0; j < N-1; j++) {
if (arr[j] > arr[j+1]) {
int temp = arr[j+1];
arr[j+1] = arr[j];
arr[j] = temp... |
ff2272428b6d83650d0a394171248c1170d92a9b | b85a1fd9baaf92c1df1d0ad1df1b10e3ebbc8d1e | charles2648/SFrame | /oss_src/unity/lib/variant_converter.cpp | C++ | cpp | 3,392 | permissive | /**
* Copyright (C) 2015 Dato, Inc.
* All rights reserved.
*
* This software may be modified and distributed under the terms
* of the BSD license. See the LICENSE file for details.
*/
#include <unity/lib/variant.hpp>
#include <unity/lib/unity_global.hpp>
#include <unity/lib/variant_converter.hpp>
#include <unity/... |
4e098769c671c37f855d048cc9487030e6cc808f | 157180413aa9ac117e4775eaa5bec1e8cdd5bd68 | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_Cherufe_AIController_BP_parameters.hpp | C++ | hpp | 895 | permissive | #pragma once
// ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_Cherufe_AIController_BP_classes.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Parameters
//----------------------------------------------... |
f22af8c8a8b2798e12b429aeafbf20bfb92ae195 | d4fc273fb7db84b9507abee2fddafc1e222c05bf | wallydz/chromium-1 | /content/browser/renderer_host/software_frame_manager.cc | C++ | cc | 6,619 | permissive | // 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 "content/browser/renderer_host/software_frame_manager.h"
#include "base/bind.h"
#include "base/callback_helpers.h"
#include "base/debug/alias.h"... |
16edde070ce51c5486e6ad65e0a13db54f43c30e | 8d64ce0712834fb701204bdd4777c15818e975a0 | anunez97/centipede | /TEAL/LoadAllResources.cpp | C++ | cpp | 1,583 | permissive | // LoadAllResources.cpp
// Andre Berthiaume, June 2012
//
// The user fills the method with all resources that need loading
#include "ResourceManager.h"
#include "../SPLevel.h"
void ResourceManager::LoadAllResources()
{
SetStartScene(new SPLevel());
AddTexture("Blaster", "/../../../../../reference/Asse... |
8b2d6b2a94c83d0e9237da3cb7294c6d4161f5e4 | d6c91b78f2905016b3830ee23fabefcce5abcd52 | VichkaS/BattleCity | /Intelligences/Random/AIExample/AIExample.cpp | C++ | cpp | 2,256 | no_license | // AIExample.cpp : Defines the exported functions for the DLL application.
//
#include "stdafx.h"
#include "AIExample.h"
#define _USE_MATH_DEFINES
#include <math.h>
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
CTankActions tank;
int CompareAngles(int a, int b)///сравниваем углы
{
while (a < 0)
{... |
03cdd664f4bbf21e13b8c3411a4ab8f6d6014f7f | a806fc02e5200ad956a25e4b7fd0875962c1b524 | ruar18/competitive-programming | /dmoj/seasonal/back-to-school/16-harambe.cpp | C++ | cpp | 715 | permissive | #include <iostream>
#include <string>
#include <algorithm>
int main() {
std::string essay;
std::getline(std::cin, essay);
std::string upper = essay, lower = essay;
int cntU = 0, cntL=0;
std::transform(upper.begin(), upper.end(), upper.begin(), toupper);
transform(lower.begin(), lower.end(), lo... |
8b9432101bfbe5982858d9bee1b622c464af0bf1 | db0c590fe881fa3d48c61b07b3d6fe08f6abff64 | ELadner/nwnx-unified | /NWNXLib/API/Mac/API/CNWSCombatRoundAction.cpp | C++ | cpp | 2,348 | permissive | #include "CNWSCombatRoundAction.hpp"
#include "API/Functions.hpp"
#include "Platform/ASLR.hpp"
#include "CResGFF.hpp"
#include "CResStruct.hpp"
namespace NWNXLib {
namespace API {
CNWSCombatRoundAction::CNWSCombatRoundAction()
{
CNWSCombatRoundAction__CNWSCombatRoundActionCtor__0(this);
}
CNWSC... |
3599684c46f92c33d2cffe4ef38130f5021ba251 | e9091a8ff2f380629c6039a2af2c69da50b399e7 | continuedc/BaseServer | /Branch/Complete/Alpha001/Source/GameServer/Classes/GameKernel/Network/MsgGameUserAttr.cpp | C++ | cpp | 1,659 | no_license | ////////////////////////////////////////////////////////////////////////
// Copyright(c) 2011-2014, WuHan ChuangYou, All Rights Reserved
// Moudle: MsgGameUserAttr.cpp
// Author: ÅíÎÄÆæ(Peng Wenqi)
// Created: 2014-11-10
////////////////////////////////////////////////////////////////////////
#include "./MsgGameU... |
fb78546a258fc05351d202199da396c80c3f0b97 | 6d9f6464ca6b00508ff234007b9b00d55f942478 | thngkaiyuan/chromium | /third_party/WebKit/Source/platform/loader/fetch/ResourceLoaderOptionsTest.cpp | C++ | cpp | 5,430 | 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 "platform/loader/fetch/ResourceLoaderOptions.h"
#include "testing/gtest/include/gtest/gtest.h"
#include <type_traits>
namespace blink {
namesp... |
70b306328952ca9e8f560d353ddbfd4526f0ee30 | 7092bf1e9780101cc865b8dc72c2126bcf38e6d5 | junxfl/BaikalDB | /src/engine/my_rocksdb.cpp | C++ | cpp | 5,833 | permissive | // Copyright (c) 2018-present Baidu, Inc. 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 b... |
af95043d7575ea192f4a12d6ed318d4626767868 | c91a25b8eb3f66937154cdd214051ad75cde6481 | isabella232/libral | /lib/inc/libral/cwrapper.hpp | C++ | hpp | 400 | permissive | #pragma once
#include "stdint.h"
#ifdef __cplusplus
extern "C" {
#endif
uint8_t get_providers(char **result);
uint8_t get_resource(char **result, char *type_name, char *resource_name);
uint8_t set_resource(char **result, char *type_name, char *resource_name, int desired_attributes_c, char **desired_attributes);
uint... |
58cdde263ade8c5812060f22c2ec44924cd1f316 | 7f6d4989dec8d4342a8b2051e1b130410e6e5106 | ardekani/FlyKit2D | /src/fkview.cpp | C++ | cpp | 13,347 | no_license | #include "fkview.h"
#include <iostream>
#include "log.h"
//FkViewPaintedFlies Class
#define __USE_OPENMP 0
#define _YELLOW_FLY 1
#define __SAVE_BLOB_IMAGES 0
#if __USE_OPENMP
#include <omp.h>
#endif
FkViewPaintedFlies::FkViewPaintedFlies()
//:m_isOpen(0),m_currFrameImg(NULL)
{
m_isOpen = 0;
m_currFrameImg... |
79fb263be5a05b5b2485db645d6d821bc87c782c | d9f6a6958811fe9390c2d7c80db25cd0849fdbc2 | zhaoxing-zstar/Quantnet-C | /Level_1/1.5/1.5.1/1.5.1.cpp | C++ | cpp | 228 | no_license | #include<stdio.h>
float substract(float num1,float num2)
{
return num1-num2;
}
int main()
{
float a,b;
printf("Enter number a and b:\n");
scanf("%f%f",&a,&b);
printf("a-b=%.2f",substract(a,b));
} |
7e4b137ee84a7a3060b533568f871f0c5d7638da | d600c2c0d182853a77a0b107dc3225505dc2992e | tyustli/USB | /pdiusbd12/Codes/Driver Develop/MyUsbLowerFilter/driver/MyUsbLowerFilterDriver.cpp | C++ | cpp | 4,489 | no_license | // MyUsbLowerFilterDriver.cpp
//
// Generated by DriverWizard 3.2.0 (Build 2485)
// Requires DDK and DriverWorks
// File created on 8/28/2008
//
// This source file contains the implementation of a subclass of KDriver.
// WDM drivers implement a subclass of KDriver and override member
// function DriverEntry and AddDev... |
333735c0d45e8d8f49c1db3ea9ce1b9b52e7038b | 2454f77754e9a2de684a74f29af04939f08d57b9 | star-platinum127/uva | /cf 1313 C1.cpp | C++ | cpp | 845 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=500005;
ll a[N];
ll stk[N];
ll l[N];
ll r[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
int k=0;
for(int i=1;i<=n;i++){
while(k!=0 && a[stk[k]]>a[i]) k--;... |
12eebf8ccc5f06bc6751178dab4fa064d8f0a40d | b0642765fc0ea4b12d5b94a5a925e71461fea03a | nembangallen/C-Source-Code | /pattern.cpp | C++ | cpp | 342 | no_license | #include<iostream>
using namespace std;
int main()
{
int i,space,rows,temp;
cout<<"Enter number of rows: ";
cin>>rows;
temp=rows;
for (i = 1; i <= rows; i++)
{
for (space = 1; space <=rows-1; space++)
{
cout<<" ";
}
temp--;
for (space = 1; space <= 2*rows-1; space++)
{
cout<<"*";
}
cout<<en... |
158ea31342248ac4f0f86edba46dd4f4ad93ed13 | 4b0f22ce28d1ebab3ad056df8b15bd8b4cdffab2 | razzie/PotatoGame | /source/game/entity/CreatureEntity.cpp | C++ | cpp | 1,359 | no_license | /*
* Copyright (C) Gábor Görzsöny <gabor@gorzsony.com> - All Rights Reserved
* Unauthorized copying of this file, via any medium is strictly prohibited
* Proprietary and confidential
*/
#include "game/entity/CreatureEntity.hpp"
game::entity::CreatureEntity::CreatureEntity(uint32_t id, uint64_t seed, Entity::Platf... |
402667fbfa3f757f288b95ea32bfdb9a5a6ec269 | a41342dd7b8c95458b3a4e60fd5b500a9acf6534 | lab104yifan/ACM | /UVA475.cpp | C++ | cpp | 2,136 | no_license | #include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <iostream>
using namespace std;
const int N = 100005;
string s, name;
vector<string> g;
vector<string> ans;
int next[N], ll, rr;
bool have;
void getnext(string name) {
next[0] = next[1] = 0;
int j = 0;
for (int i = 2; i <= ... |
8db122378ad132a99edb96896e573fba31e7ff43 | dfe932a12dc225761f0bfd168a218f00325a5d5d | Pedram87/CaroloCup | /2013-CaroloCup/sources/hesperia-light/libcore/src/wrapper/POSIX/POSIXMutex.cpp | C++ | cpp | 1,343 | no_license | /*
* Copyright (c) Christian Berger and Bernhard Rumpe, Rheinisch-Westfaelische Technische Hochschule Aachen, Germany.
*
* The Hesperia Framework.
*/
#include <cerrno>
#include <cstdio>
#include <cstring>
#include <sstream>
#include "core/wrapper/POSIX/POSIXMutex.h"
namespace core {
namespace wrapper {
... |
09457ebdb15502d7956a2934cffce8375a7637cd | 79624b56e1706a89fd237cc59f0d5a03c1cb41e4 | Barnabasz/Pixelization | /mainwindow.cpp | C++ | cpp | 14,262 | no_license | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <iostream>
#include "math.h"
#include <cmath>
#include <QImage>
#include <QMessageBox>
#include <thread>
using namespace std;
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(thi... |
44ec8980947caf592dfbc0721a6c697e8062e027 | 17942f2f972dfeab12e4fa9925a2a9fc801a477b | hughhugh/master-thesis | /model_simulations/stochKit/test/DIMER/DM/ProblemDefinition.cpp | C++ | cpp | 543 | no_license | #include "ProblemDefinition.h"
Vector Initialize()
{
Vector x0(3, 0.0);
x0(0) = 10000;
return x0;
}
Matrix Stoichiometry()
{
Matrix nu(3, 4, 0.0);
nu(0,0) = -1; nu(0,1) = -2; nu(0,2) = 2;
nu(1,1) = 1; nu(1,2) = -1; nu(1,3) = -1;
nu(2,3) = 1;
return nu;
}
Vector Propensity(const Vector& x)
... |
14884d9657f5b3d257d946170abafcdfc0efb275 | 3b35b56a9285ee7b011d89f3cc24493a3a71c328 | alexduhem/skia | /src/pdf/SkPDFFont.cpp | C++ | cpp | 51,715 | permissive | /*
* Copyright 2011 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include <ctype.h>
#include "SkData.h"
#include "SkGlyphCache.h"
#include "SkPaint.h"
#include "SkPDFCatalog.h"
#include "SkPDFCanon.h"
#include "SkPDFDevice.h"
#include "SkP... |
b34edf3b994ae589e8afb7e32eb35a1f0700e394 | a88543dc1e55d51ac73f9af35ad869e7ee7f499c | mrlphoenix/cyber_jihad_bot_client | /spamconfig.cpp | C++ | cpp | 2,080 | no_license | #include <QFile>
#include <QFileInfo>
#include <QByteArray>
#include <QStringList>
#include "spamconfig.h"
SpamConfig::SpamConfig()
{
}
SpamConfig::~SpamConfig()
{
}
void SpamConfig::load()
{
if (!fileExists())
create();
QFile config("config.dat");
config.open(QFile::ReadOnly);
QString data... |
3efa33dc7c5e4154d8e0780cf9d85d6fbdb53689 | c1da2d0d620d401527a8dc476984d5b9cb5ee28e | festlv/esp-power-control | /firmware/app/web_config.cpp | C++ | cpp | 4,386 | permissive | #include "user_config.h"
#include <SmingCore/SmingCore.h>
#include "AppSettings.h"
#include "ota_update.h"
#include "web_ipconfig.h"
#include "uptime.h"
#include "PowerManager.h"
HttpServer server;
FTPServer ftp;
//Buttons: Power (14), Reset (16),
//LEDs: HDD (4), Power (5)
PowerManager pm(14, 16, 5, 4);
Timer pm_ti... |
9a7c1d35323feebff41280c1edcf9ffe87a2a008 | e6d7f5060b5bd3be61e8acd1cccc03a84519fd11 | AashishA11/number_theory | /etf.cpp | C++ | cpp | 1,023 | no_license | /*
In number theory, the totient φ of a positive integer n is defined to be the number of positive integers less than or equal to n that are coprime to n.
Given an integer n (1 <= n <= 10^6). Compute the value of the totient φ.
input
5 //t
1
2
3
4
5
output
1
1
2
2
4
Φ(1) = 1
gcd(1, 1) is 1
Φ(2) = 1
gcd(1, 2) is 1, ... |
9e01c480111d4cfd56f3f590cbb84e8e6f73af47 | 0d4191ac1c816eb9ad3bc3fa0fdb2cc7a1d77105 | ttyang/sandbox | /sandbox/xml/libs/xml/example/config.cpp | C++ | cpp | 709 | permissive | // Copyright 2007 Stefan Seefeld.
// 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/xml/dom.hpp>
#include "string.hpp"
#include <fstream>
namespace dom = boost::xml::dom;
int main(int argc, char ... |
bfefe397bdcc5006190b0d98d03052f494b677ff | fc73adb4ead840f13b797c7f912349dc24b2f856 | SamanKhamesian/ACM-ICPC-Problems | /SGU - Saratov State University/126 - Boxes.cpp | C++ | cpp | 781 | permissive | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int gcd(int A, int B)
{
A = A % B;
if (A == 0) return B;
else return gcd(B, A);
}
int main()
{
long long a, b, one = 0, how = 0;
cin >> a >> b;
long long A = max(a, b);
long long B = min(a, b);
if (B =... |
ec3e842c512a897b48b0aaba7f9941d466b42a71 | 58f4bbd24fd79271000468a3f3adb383483a8b96 | StephenThomasUWTSD/TileMatcher-ExCirc | /TileMatcher(ExCirc)/vector.cpp | C++ | cpp | 1,044 | no_license |
#include "vector.h"
//construct
Vector::Vector(float myx, float myy, float myz)
{
x= myx;
y= myy;
z= myz;
}
void Vector::Scale(float s)
{
x= s*x;
y= s*y;
z= s*z;
}
void Vector::Add(Vector & v1, Vector & v2)
{
v1.x= v2.x + v1.x;
v1.y= v2.y + v1.y;
v1.z = v2.z + v1.z;
}
void Vector::Add(Vector & v1)
{
x= x... |
21e011946e5aa5ee527c4e9f777ee540dc26dbf1 | d685ceb6ceeb03045ed8050da5a45be08f16fe65 | UtopiaBeam/competitive | /Com'O/Com'O BUU 2 2014/1st/19 General/19 General.cpp | C++ | cpp | 1,050 | no_license | #include<stdio.h>
int root[100010],num[100010];
int find(int i){
if(root[i]!=i)
root[i]=find(root[i]);
return root[i];
}
int main(){
int n,m,i,a,b,roota,rootb;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&num[i]);
root[i]=i;
}
while(m--){
... |
6285f9dffd8dc41e065aa0309247dfae9df40388 | 1dd43af628b64f27a154919f61da4ee6ab93eadd | NeoniteDev/Osmium | /Osmium/SDK/FN_GAB_HuskAttachedToShield_classes.hpp | C++ | hpp | 3,240 | no_license | #pragma once
// Fortnite (4.5-CL-4159770) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGeneratedClass GAB_HuskAttac... |
728ccf893415da327dafd2d2c74481a27a7355ea | 1b4745a83cbc2e0168764667ccb6d20a0a193862 | ngaikw/Cplusplus_Financial_Engineering | /Level 5/3.6/Exercise 1/array.cpp | C++ | cpp | 2,429 | no_license | /*
source file for array class
*/
#include<iostream>
#include "array.hpp"
using namespace std;
namespace Inna
{
namespace Containers
{
Array::Array() //default constructor allocates 10 elements
{
a_size = 10;
m_data = new CAD::point[a_size]; //create the array of points on the heap
cout << ... |
3bc9067f40190856d8a289f3b788339cba5c343e | db3411c6166221b3d89448d6c17b52176bf61825 | igankevich/openclx | /src/openclx/device_test.cc | C++ | cc | 1,061 | permissive | #include <iostream>
#include <gtest/gtest.h>
#include <openclx/compiler>
#include <openclx/platform>
#if CL_TARGET_VERSION >= 120 && defined(CLX_HAVE_clCreateSubDevices)
TEST(device, partition) {
for (const auto& platform : clx::platforms()) {
clx::device root;
try {
root = platform.d... |
47b43d0e7efedae449908a8d3588c23beefdd0dc | 81f7b173df6dcada3d18b721b74fd74f949e82b4 | Pedram87/CaroloCup | /2013-CaroloCup/sources/OpenDaVINCI-CaroloCup/libopendavinci/src/context/base/BlockableContainerReceiver.cpp | C++ | cpp | 1,160 | permissive | /*
* OpenDaVINCI.
*
* This software is open source. Please see COPYING and AUTHORS for further information.
*/
#include "core/base/Thread.h"
#include "core/data/TimeStamp.h"
#include "context/base/BlockableContainerReceiver.h"
namespace context {
namespace base {
using namespace std;
using na... |
0e8ddf63a0891175bf2788f51fe751acda9143cd | ad20739a30e87fa37f2b66b1e9bedf412544268e | SeanCandon/risc-v | /compiler/compiler/GeneratedFiles/Release/moc_findInFilesDlg.cpp | C++ | cpp | 3,817 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'findInFilesDlg.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.9.9)
**
** WARNING! All changes made in this file will be lost!
******************************************************... |
e4aecb3e45245e40a15d405a120ff805dab77681 | f09e8ef97c3347d8498fbe63ebae03937f6484a6 | dengchu817/down2memory | /down2memery/src/dd_looper.cpp | C++ | cpp | 2,803 | no_license | //
// dd_command_looper.cpp
// down2memery
//
// Created by dengchu on 2021/2/9.
// Copyright © 2021 dengchu. All rights reserved.
//
#include "dd_looper.hpp"
command_queue::command_queue(){
pthread_mutex_init(&m_deque_lock, NULL);
pthread_cond_init(&m_deque_cond, NULL);
m_exit = false;
}
command_queu... |
fb22d6597ce314c35e27fa2447fa0535280d8355 | 8f62f429c63cbb4c0dc74e83c835f1e38bca9032 | Pompeu/URI-Online-Judge | /URI Online Judge | 1318
Bilhetes Falsos/URI Online Judge 1318.cpp | C++ | cpp | 751 | no_license | /* URI online Judge 1318
**
** Bilhetes Falsos
**
** By Itacir Ferreira Pompeu
**
** Instituto Federal Goiano Campus Morrinhos
*/
#include <cstdio>
#include <cstdlib>
#define LLI long long int
int main(void){
LLI b,p,aux,cont,i,tam;
while(scanf("%lld %lld",&b ,&p), b+p > 0){
tam... |
6c68cab90b0e82653037c9bd81a1d06b8befa72f | 8a0f5032fbdd12d693c7fbc6e16e896b0c139e22 | buptlxb/leetcode | /2nd/310_minimum_height_trees.cpp | C++ | cpp | 1,388 | no_license | #include <iostream>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;
class Solution {
public:
typedef vector<int>::size_type sz_t;
vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
vector<int> ret;
if (n == 0)
return ret;
... |
492b97913144e8612d50be54c3ecd4fce14b4827 | 821b42ff7360040b78a87a1c4281fae8a418fa94 | Dench991228/LeetCodeLearnCpp | /Offer47.cpp | C++ | cpp | 823 | no_license | #include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int maxValue(vector<vector<int>>& grid) {
int height = grid.size();
if(height==0)return 0;
int width = grid[0].size();
if(width==0)return 0;
int dp[height][width];
memset(dp, 0, siz... |
633ef2b2ea6f63c3980815d8a3aab4e2cdd18b5c | e4e09f5a20d847b15e39799f055435d9fbd6ebd7 | peykaf/trajectory_framework | /trajectory_framework/src/SAOptimisation.cc | C++ | cc | 22,246 | permissive | // Copyright 2015 Marc-André Renaud
#include <string.h>
#include <string>
#include <iostream>
#include <fstream>
#include <vector>
#include <limits>
#include <algorithm>
#include <cmath>
#include <chrono>
#include <random>
#include "json.hh"
#include "string_utils.hh"
#include "MixedOptimisation.hh"
#include "MixedArc... |
44ba93e7ee2b7dafd1076de31b7fd4f7651ff7cb | 8838e95a8d8a3629139d7bbf53f8a175f7b61ba8 | oyvindskaaden/TDT4102-Ovinger | /Oving 9/Oving 9/Matrix.cpp | C++ | cpp | 3,483 | permissive | #include "pch.h"
#include "Matrix.h"
#include <iostream>
#include <iomanip>
#include <sstream>
#include <string>
using namespace std;
/////////////
// Private //
/////////////
//Finds the longest number in the matrix
int Matrix::findLongestNumber() const
{
int longest = 0;
if (isValid())
{
int word;
ostringstr... |
d37a3f8345ae6df9d367495a645fb5c21b1dda99 | b3a31ef6a69a9d8bc069a3039c250c427a9aa744 | wyaadarsh/LeetCode-Solutions | /C++/0567-Permutation-in-String/soln-2.cpp | C++ | cpp | 506 | permissive | class Solution {
public:
bool checkInclusion(string s2, string s1) {
int n1 = s1.length(), n2 = s2.length();
vector<int> chars(26, 0);
for(char ch : s2) ++chars[ch - 'a'];
for(int i = 0; i < n1; ++i) {
--chars[s1[i] - 'a'];
if(i - n2 >= 0) ++chars[s1[i - n2] -... |
2d28cbdb899fe0aaa73258cebcab5f01b5813f25 | bf611d8dc6fa9ee21ac1f6f0c9218b20cecee262 | Rost1998/brainfuckoop | /ToNext.hpp | C++ | hpp | 438 | no_license | //
// Created by Rostislav TULCHIY on 4/12/18.
//
#ifndef EX03_TONEXT_HPP
#define EX03_TONEXT_HPP
#include <deque>
#include "IBrainfuckOperations.hpp"
class ToNext : public IBrainfuckOperations
{
public:
ToNext();
ToNext(ToNext const ©);
~ToNext();
// exec
void execute(char* & cur_cell, std::deque<char> ... |
629eb32d226b6d336fef4557c08836c2d37d59c4 | 0025a65d39bdf9009f2205b34095e4cccc7f202a | EasonLiao/Sulcata | /src/config.cc | C++ | cc | 788 | permissive | #include "config.h"
namespace sulcata{
configuration* configuration::singleton_ = NULL;
std::mutex configuration::mtx_;
configuration::configuration(){
default_config_.docroot = "../html/";
default_config_.default_files.push_back("index.html");
default_config_.default_files.push_back("index.htm");
... |
69cac63ae89f931e0c9b81a35a8f00a180848e48 | 9526b6afee591f81aa18ee8c01e21dd6e3a85bb3 | RichardVN/train-escape-game | /sleeper.hpp | C++ | hpp | 535 | permissive | /******************
* File Name: sleeper.hpp
* Author: Richard Nguyen
* Date: 12/10/19
* Description: header file for the class, sleeper
*******************/
#ifndef sleeper_HPP
#define sleeper_HPP
#include <iostream>
using std::endl;
using std::cout;
using std::cin;
#include <string>
using std::string;
#in... |
31bc669d8209111429566d93450141b3400925ef | d526130baa69e7cef5b534cdc493fd50d3fe8117 | mazalet/LongUI | /src/control/ui_list.cpp | C++ | cpp | 30,239 | permissive | #include <control/ui_listbox.h>
#include <control/ui_listitem.h>
#include <control/ui_listcol.h>
#include <control/ui_listcols.h>
#include <control/ui_listhead.h>
#include <control/ui_listheader.h>
#include <core/ui_ctrlmeta.h>
#include <control/ui_image.h>
#include <control/ui_label.h>
#include <control/ui_boxlayout... |
846d7f9e1244d678273911b1963788dc52cac6ff | 2a1688b82f4a0826ebc33b66199f130f0b44f782 | emuikernel/BDXDaq | /devel/clon/src/dbutil/dbutil.s/dbrsql.cc | C++ | cc | 7,302 | no_license | /*
* dbrsql.cc
*
* Performs SQL database access for dbrouter
*
* ejw, 28-jun-96
* ejw, 6-jun-06 switched from ingres to mysql
* not 100% match between ingres and mysql concepts!
* sql_process_data() never used so just returns error
*
*/
// CC -c dbrsql.cc -I$RTHOME/include -I/usr/i... |
b57b0dea35e57c759f839503ec2a5807f10fef0c | b535524f819184ee0cf3ec5fea7f7673ebe01510 | gcasey/VTK | /Common/Core/Sequential/vtkAtomicInt32.cxx | C++ | cxx | 1,423 | permissive | /*=========================================================================
Program: Visualization Toolkit
Module: vtkAtomicInt64.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is ... |
2c9b9f42768cd16ae9a9cce443c2abd5456d2323 | 848be18cfedab77b10aec8ff560b5f217c149c46 | Omn1z/OpenIW8 | /workspace/iw8/code_source/src/client/cl_devgui.cpp | C++ | cpp | 3,871 | no_license | /*
==============
CL_DestroyDevGui
==============
*/
void CL_DestroyDevGui(void)
{
?CL_DestroyDevGui@@YAXXZ();
}
/*
==============
CL_DevGuiFrame
==============
*/
void __fastcall CL_DevGuiFrame(LocalClientNum_t localClientNum)
{
?CL_DevGuiFrame@@YAXW4LocalClientNum_t@@@Z(localClientNum);
}
/*
==============
CL... |
f6d7183c2afe8d56cb19245f52288670cdcd338a | a6b06e7a0911cc5cfdb38c0dd520feba6b95d988 | mew177/cpp-practice | /leetcode/1184 - Distance Between Bus Stops/1184 - Distance Between Bus Stops/main.cpp | C++ | cpp | 833 | no_license | //
// main.cpp
// 1184 - Distance Between Bus Stops
//
// Created by Wu, Meng Ju on 2020/4/19.
// Copyright © 2020 Pitt. All rights reserved.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int distanceBetweenBusStops(vector<int>& distance, int start... |
3c95258df2fb98c1d7db3eb7bcd579cf85aec3c1 | 77d2e8feb7c9d8f1c58f57d9e83f31e849b25475 | Batodalaev/ACMP | /Unit4/unit4.cpp | C++ | cpp | 649 | permissive | //------------------------------------------------------------------------------
// unit0.cpp
//
// Copyright (c) 2020 ya_sayanb
// All rights reserved.
//
// Date: 14.06.2020
// Author: ya_sayanb
//------------------------------------------------------------------------------
#include <iostream>
// https://acmp.ru/in... |
925cd21f73aa90cdb12e048156e28948d44ba9ac | 50ee4172e5670b6d7a2c8b22bf1a5a11876f1896 | zanzo420/Sea-Of-Thieves-SDK | /SDK/BP_GoldPouches_ItemInfo_functions.cpp | C++ | cpp | 1,322 | permissive | // Name: SeaOfThieves, Version: 2.0.23
#include "../pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//--------------------------------------------... |
0c252ca275bdebe2fad808ff57fdf8fe1645011c | 245606a2255f8ce77aadaf6fce36799a942c137e | blueboxd/chromium-legacy | /third_party/blink/renderer/core/layout/layout_flow_thread.cc | C++ | cc | 11,466 | permissive | /*
* Copyright (C) 2011 Adobe Systems Incorporated. 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 ... |
cf1be5edab4d63fd5e8d4291a87e5b82eba3b65a | 6947cb1745d566e10e42143ad95b55b8927fc782 | gommuluk/BaekjoonOnlineJudge | /11650.cpp | C++ | cpp | 597 | no_license | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
class Pos {
public:
int x, y;
Pos(int x, int y) {
this->x = x;
this->y = y;
}
};
bool cmp(const Pos &a, const Pos &b) {
if (a.x != b.x) return a.x < b.x;
else return a.y < b.y;
}
int main() {
int N, x, y... |
601c141ee6c7a7c6f8000ff732f8b55b9cc12112 | f7364f3a7502ffdcc8d29e87bbba4697f92181c2 | maxrake/cppitertools | /filter.hpp | C++ | hpp | 2,883 | permissive | #ifndef ITER_FILTER_H_
#define ITER_FILTER_H_
#include "internal/iterbase.hpp"
#include <utility>
#include <iterator>
#include <initializer_list>
namespace iter {
namespace impl {
template <typename FilterFunc, typename Container>
class Filtered;
struct BoolTester {
template <typename T>
c... |
016eea0a1cac6420b079047a0db1112ff7c62809 | db7def6658dc63ab81fb17741a6a3461bdea1c4b | narayanr7/HeavenlySword | /code/hair/chainreconstruction.cpp | C++ | cpp | 8,429 | no_license | #include "chainreconstruction.h"
#include "chaincore.h"
#include "gfx/simplefunction.h"
#include "anim/hierarchy.h"
using namespace SimpleFunction;
ChainReconstruction::ChainReconstruction()
{
// nothing
}
ChainReconstruction::~ChainReconstruction()
{
// nothing
}
class ChainReconstructionInfoS... |
891a608bb27a12159a904defd66f2a38d1b2b287 | 024a386d91e8b11caf18f825dc4c20531a0c7401 | Lan-ce-lot/overflow | /vjudge/课/Hangover.cpp | C++ | cpp | 2,959 | no_license | /*************************************************************************
> FileName:
> Author: Lance
> Mail: lancelot_hcs@qq.com
> Date: 9102.1.8
> Description:
************************************************************************/
//#include <bits/stdc++.h>
//#pragma comment(linker, "/STA... |
42acd5753b409fd937341f9e80d0cc326b5e7630 | ebbeaf159f17c34e59b88d0308ef44706815f60e | ifcquery/ifcplusplus | /IfcPlusPlus/src/ifcpp/IFC4X3/lib/IfcRelAssociatesLibrary.cpp | C++ | cpp | 6,762 | permissive | /* Code generated by IfcQuery EXPRESS generator, www.ifcquery.com */
#include "ifcpp/model/AttributeObject.h"
#include "ifcpp/model/BuildingException.h"
#include "ifcpp/model/BuildingGuid.h"
#include "ifcpp/reader/ReaderUtil.h"
#include "ifcpp/writer/WriterUtil.h"
#include "ifcpp/IFC4X3/include/IfcDefinitionSelect.h"
#... |
eb841dbd4de123bd166ab59e1e01c80c4ca32976 | 510f82cc609a5d9526fb5f9c073bbfbc5970bdca | MedicaicloudLink/Rosetta | /main/source/test/core/scoring/func/CircularSigmoidalFunc.cxxtest.hh | C++ | hh | 1,900 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
b53df14f5c927ab92d72efbd123b6d7a6d59fc07 | a6e6555a4a1c5ed9249c61e1eda47d0ab0e42fdf | lordashram/mednafen-libretro | /mednafen/cdrom-0928/CDAccess_Image.cpp | C++ | cpp | 23,461 | no_license | /* Mednafen - Multi-system Emulator
*
* 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 later version.
*
* This program is distrib... |
8967fb81c631cb6d0a56235cda0b216e071b9741 | d9374184a13231d46724720d5e8fbd4f4a9ab504 | tudormihaieugen/Cpp2009 | /Neintensiv/S1_2_d/V022.cpp | C++ | cpp | 231 | no_license | #include <iostream>
using namespace std;
int main()
{
int n, d, i;
cout << "n = "; cin >> n;
if (n < 0)
n = -n;
d = 1;
for (i = 2; i <= n / 2; i++)
{
if (i % n == 0)
d = i;
}
cout << "d = " << d;
} |
e1991202c8650da19ebb7fd4c68445831d7a25c8 | ce9ce249ed78f12cd5e5f7cd952c284229d90470 | purvilkamdar/Autnomous-RC-Car | /NodeMaster/L5_Application/main.cpp | C++ | cpp | 5,300 | no_license | /*
* SocialLedge.com - Copyright (C) 2013
*
* This file is part of free software framework for embedded processors.
* You can use it and/or distribute it as long as this copyright header
* remains unmodified. The code is free for personal use and requires
* permission to use in a commercial p... |
a8070deec41d2fc65c4ec5c0c5daa02c3ecf0158 | 2feac99e75e97343ee6cb7d6e0ad4b2bdd81967d | jhw96/Algorithm | /퀵정렬/ConsoleApplication1/ConsoleApplication1.cpp | C++ | cpp | 818 | no_license | #include <iostream>
using namespace std;
void swap(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
int partition(int list[], int left, int right)
{
int pivot = list[left];
int low = left;
int high = right + 1;
do {
do {
low++;
} while (list[low] < pivot && low <= right);
do {
high--;
... |
52c812329c2bbc25a63018ab1527ad09bfe2f368 | b9e57fd245bfb0c2aa3be824f2af8c098802a0a4 | sahilbajaj82/my-code-repo | /codechef/SNCK1A19/graph-on-a-graph.cpp | C++ | cpp | 1,091 | no_license | #include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b) {
if(a>b)
return gcd(b,a);
if(a==0)
return b;
return gcd(b%a,a);
}
int main() {
int t;
cin>>t;
while(t--) {
int n;
cin>>n;
int *a=new int[n];
queue <int >q;
for(int i=0;i<n;i++) {
cin>>a[i];
q.push(a[i]);
}
int list[51][51];... |
962726228f534382a4655041175883db46ff080c | e259d7f015d212ce047c3ece0ea70b6c0e2d07a0 | Silvard/nwnxee | /NWNXLib/API/Mac/API/CServerInfo.cpp | C++ | cpp | 1,544 | permissive | #include "CServerInfo.hpp"
#include "API/Functions.hpp"
#include "Platform/ASLR.hpp"
namespace NWNXLib {
namespace API {
CServerInfo::CServerInfo()
{
CServerInfo__CServerInfoCtor__0(this);
}
int32_t CServerInfo::FindOptionIndex(CExoString a0, CExoString a1)
{
return CServerInfo__FindOptionIndex(this, a0, a1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.