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 |
|---|---|---|---|---|---|---|---|---|
e8014c07dfb683ea14bcb10071f9205a12ca79e0 | 2545be953a7e6f04f1e13e18fd17765190d00e19 | playbar/VkCore | /samples/browser/src/FormsSample.cpp | C++ | cpp | 10,313 | no_license | #include "FormsSample.h"
#if defined(ADD_SAMPLE)
ADD_SAMPLE("Graphics", "Forms", FormsSample, 8);
#endif
// Input bit-flags
#define KEY_BACK 1
//FormsSample sample;
const static unsigned int __formsCount = 5;
FormsSample::FormsSample()
: _scene(NULL), _formNode(NULL), _formNodeParent(NULL), _formSelect(NUL... |
3fe30781dc60e88a8cd856eea6f37fe269942049 | df090cc6f46cd4204b4dc9034ed1bb715de3063b | michaeljdietz/NpcVoiceActivation | /skse64/skse64/Hooks_Diagnostics.cpp | C++ | cpp | 405 | permissive | #include "Hooks_Diagnostics.h"
#include "skse64_common/SafeWrite.h"
#include "skse64_common/Utilities.h"
#include <vector>
#include <string>
// not really needed, bethesda does this now
void Hooks_Diagnostics_Commit(void)
{
UInt32 enableDiagnostics = 0;
if (GetConfigOption_UInt32("General", "EnableDiagno... |
d37e886e514928ea2c8a4ada9d46bafe2485df88 | ccfe14d01d8c8882e5259f7b15c9bd13e93f1090 | roa/dramaqueen | /src/config/Config.hpp | C++ | hpp | 1,603 | no_license | /**
the config object loads the config specified as cli arg.
the config is a lua config file.
after all value have been initialized,
the config object supplies several getter on the public interface.
the config object is a global unique object ( singletonobject ).
**/
#ifndef DRAMAQUEEN_CONFIG_HPP... |
12d60f10700b9ccd041d5afa4e36d68822b8685b | 6e56d8f2381404eff6903aedc0a7178d41308e8d | AlexandreBaiao/azure-storage-cpplite | /adls/src/create_directory_request.cpp | C++ | cpp | 1,115 | permissive | #include "create_directory_request.h"
#include "http_base.h"
#include "storage_url.h"
#include "utility.h"
namespace azure { namespace storage_adls {
void create_directory_request::build_request(const storage_account& account, http_base& http) const
{
using namespace azure::storage_lite;
http... |
5a8682ea1971caf2a56f1b950f235a8186cd85da | 7dbc73eb504ff84411cd84e2e7222a9026504a21 | thoughtworksarts/Dual_Brains | /drafts/quickSpectrogram_2/libraries/liblsl/external/lslboost/typeof/encode_decode.hpp | C++ | hpp | 1,688 | permissive | // Copyright (C) 2004 Arkadiy Vertleyb
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.lslboost.org/LICENSE_1_0.txt)
// lslboostinspect:nounnamed
#ifndef BOOST_TYPEOF_ENCODE_DECODE_HPP_INCLUDED
#define BOOST_TYPEOF_ENCODE_DECODE_HP... |
f4e42ffb3b80e89c7a53bb3c1cb3d0252bbc73e1 | 003991e3948111facad07cc9e16366fbf3dfb518 | JaviVinnas/Proyecto-final-de-COGA | /ProyectoFinalCOGA/LocalizadorShader.cpp | C++ | cpp | 5,479 | no_license | #include "LocalizadorShader.h"
////////////////////////////////////////////////////////////////////////////////////////////////////
//VERTEX SHADER/////////////////////////////////////////////////////////////////////////////////////
LocalizadorShader::LocalizadorVertexShader::LocalizadorVertexShader()
{
this->view... |
fa48c10868c888e678ff53364e259e3c301365e1 | c5010402f2f9800f9fec64a332e90d1fdfc72549 | moltenguy1/minimangalore | /minimangalore/Nebula2/code/nebula2/src/tools/nbundler.cc | C++ | cc | 5,830 | no_license | //------------------------------------------------------------------------------
// nbundler.cc
//
// Nebula2 resource bundler
//
// (C) 2003 RadonLabs GmbH
//------------------------------------------------------------------------------
#include "kernel/ntypes.h"
#include "tools/ncmdlineargs.h"
#include "k... |
db0d728ed2923683e2a86ee07f6b2e17567dfb53 | e42687285083172e5516da3a55388d941489c785 | hrabeCesnek/CalibrationSources | /Analysis/Full/AllFiles.cpp | C++ | cpp | 7,211 | no_license | #include "TFile.h"
#include "TH1.h"
#include "TF1.h"
#include "TGraph.h"
#include "TGraphErrors.h"
#include "TLine.h"
//#include "TTree.h"
#include <TCanvas.h>
#include "TMultiGraph.h"
#include <iostream>
#include <fstream>
#include <numeric>
#include <dirent.h>
#include <sys/types.h>
#include "singlePulse.h"
#includ... |
be42034324df9fb1d285726bebf04d8f5436f65c | c2083837fb64216b22cdc24a53e8801365e711b4 | jayin92/competitive-programming | /zerojudge/b589.cpp | C++ | cpp | 3,125 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, ... |
d9f61016c701a3d5ebff29b22f51428e5fc34b75 | bdd9b79e58827eda67fefa6da425c643b9a2f88a | ryppl/boost-history | /tools/quickbook/test/snippets/pass_thru.cpp | C++ | cpp | 482 | no_license | /*=============================================================================
Copyright (c) 2011 Daniel James
Use, modification and distribution is subject to 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)
=============... |
7ad83154048f547f4a6060c3c61e2bc6920d69d7 | 64036d05b0b8ceeff92f723b23cf4152d2251944 | JinHuiXu1991/CMSC435 | /proj1/trace.cpp | C++ | cpp | 960 | no_license | /*****************************************
** File: trace.cpp
** Project: CMSC 435 Assignment 1, Fall 2015
** Authoer: Jin Hui Xu
** Date: 9/12/2015
** E-mail: ac39537@umbc.edu
**
** This file contains the main driver program for assignment 1.
**
**
*****************************************/
#include"readNF... |
5bfcfa09cea84873f484159df4b33efe3ccd71d8 | 1d80b3eebf4a41e1a1fbb31d6ace0febd601f068 | Taxod/socket | /clientsocket.cpp | C++ | cpp | 5,116 | no_license | // Client side C/C++ program to demonstrate Socket programming
#include <stdio.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <string.h>
#include<string>
#include <iostream>
#define PORT 8888
using namespace std;
int main(int argc, char const *argv[])
{
int sock = 0;
in... |
1f31f2fce026a331fad43c80a60ad4a1c723c64d | 4b003a654deebb01c0102ee6dff8d216d7ae8da4 | ConnectNitish/CompetitiveProgramming | /CodeFiles/NoCategory/Sherlock_and_Inversions_HackerEarth.cpp | C++ | cpp | 1,518 | no_license | #include<bits/stdc++.h>
using namespace std;
#define MAX 1000000
int BIT[MAX];
int Data[MAX];
int temp[MAX];
int q=0;
int n=0;
int debug = 0;
void update(int i,int val)
{
while(i<=n)
{
BIT[i] += val;
if(debug)
cout << " Update " << i << endl;
i += (i & (-i));
}
}
int query(int i)
{
int res = 0;
while(... |
ba6192c189bf529239c60b8bb9cbd32a10e9e4ed | c8f2d5609182515ae4a7a1aec56a30599b760883 | leosampsousa/MESHLESS | /main.cpp | C++ | cpp | 4,284 | no_license | #if USE_INTERFACE
#include "mainwindow.h"
#include <QApplication>
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
MainWindow w;
w.show();
return a.exec();
}
#else
#define LOOP_MAIN false
#include "model.h"
#include "solver.h"
#include "methodid.h"
#include "boundaryconditions.h"
#in... |
8d1bf9d4d2809056fb01f9e679bef8ed6ce64a30 | 2225de31e4bfd5b10e2b0701eae5b646c922fc2a | henriwoodcock/armnn | /src/backends/backendsCommon/test/layerTests/LogicalTestImpl.cpp | C++ | cpp | 21,234 | permissive | //
// Copyright © 2020 Arm Ltd and Contributors. All rights reserved.
// SPDX-License-Identifier: MIT
//
#include "LogicalTestImpl.hpp"
#include <armnn/utility/Assert.hpp>
#include <ResolveType.hpp>
#include <backendsCommon/Workload.hpp>
#include <backendsCommon/WorkloadData.hpp>
#include <backendsCommon/test/Tenso... |
57b16676f57a8b009a63fe3cad8b6a328a06b1d2 | 1da23bf36e890be8dd6d386ac23eb3a3ded614ea | nikola825/ss | /assembler/File.cpp | C++ | cpp | 915 | no_license | //
// Created by nidzo on 20.5.18..
//
#include "File.h"
File::File(std::ifstream &inputStream, std::string fileName)
{
if(inputStream.fail())
{
valid=false;
errors.push_back("Failed to open file "+fileName);
return;
}
valid=true;
uint lineNumber=0;
std::string line;
... |
258ea9ffe6da4358a032cbd9a929f73e2156bda7 | 09f090fd4114231bd1960998fbb54bdc7c76432b | Garciat/competitive | /leetcode/nth-digit.cpp | C++ | cpp | 971 | no_license | // https://leetcode.com/problems/nth-digit/
#define int long long
class Solution {
public:
int findNthDigit(int n) {
int s = 1;
int d = 1;
int p = 0;
for (;;) {
int pp = p + 9 * s * d;
if (pp >= n) {
break;
}... |
dc8cde902017b057523f5cd2d660718f50e798e2 | ad0635265674e8e52a8b1876a53816486eb90c74 | AlbinMartinsson/master_thesis | /Programming/mbed-os-example-sockets/mbed-os/connectivity/drivers/cellular/TELIT/ME310/TELIT_ME310_CellularStack.cpp | C++ | cpp | 21,684 | permissive | /*
* Copyright (c) 2020, Arm Limited and affiliates.
* SPDX-License-Identifier: Apache-2.0
*
* 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/LICEN... |
88406c12100c931e1898c4033b07e7b98ce4e7c8 | 402fe354d1afa4f9ee88bc659f416da1065de472 | AventadorSQ/CPlusPlus | /C++多态/C++多态/源.cpp | C++ | cpp | 6,083 | no_license |
//多态条件
//1.在基类中该函数必须为虚函数（即在该函数前加上virtual关键字）
//2.在子类中必须对这个函数进行重写，即与这个函数原型一样
//（返回值类型，参数列表，函数名字必须一致(virtual可加可不加（但确保不再被继承）)）只不过是实现另一个功能
// 重写例外：
// 1.返回值类型有例外：
// 协变：基类虚函数返回基类对象的指针或者引用
// 派生类虚函数返回派生类对象的指针或者引用
// 2.析构函数例外
#if 0
#include<iostream>
using name... |
7cc4fc05ad3ce50d02ebc7d6018b33829d81fa6b | 95890a33c246e61751d29ba17394c97cd6dc5007 | jedh/bloodred | /Core/Source/Foundation/Vector2.cpp | C++ | cpp | 856 | no_license | #include "Foundation\Vector2.h"
namespace BRCore
{
Vector2 Vector2::Add( const Vector2& vectorLHS, const Vector2& vectorRHS )
{
Vector2 returnVector = Vector2();
returnVector.x = vectorLHS.x + vectorRHS.x;
returnVector.y = vectorLHS.y + vectorRHS.y;
return returnVector;
};
... |
0bda929b61dc8dfcd2694e074080703fb8fa441f | 5a1c8eab038327b19554c59a9c11299a584a5a4f | djrhernandez/NewHaven | /src/EnemyFighter_Straight.cpp | C++ | cpp | 2,128 | no_license | // Created by Junior on 6/19/2016.
#include "EnemyFighter_Straight.h"
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "Config.h"
#include "defns.h"
#include "Global.h"
#include "addItemScreen.h"
#include "HeroFighter.h"
#include "Ammo.h"
#include "EnemyAmmo.h"
EnemyFighter_Straight::EnemyFighter_St... |
9292b818687651822bc82210ed188cd2f8dbc359 | 083791276e004e177e2484db93b8dd67e25e0ebc | escuco/bling-desktop | /src/DesktopApp/browser/preferences_test.cc | C++ | cc | 11,584 | permissive | // Copyright (c) 2015 The Chromium Embedded Framework 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 "browser/preferences_test.h"
#include <sstream>
#include <string>
#include <vector>
#include "cef/base/cef_logging.h"
#i... |
24d36c5d1f9bd9eb904bd518732f39b7ef941753 | 430efdf2b7aa66719ca80b1d846a9e9adc85f307 | gmeuli/caterpillar | /include/caterpillar/synthesis/strategies/action.hpp | C++ | hpp | 2,645 | permissive | /*------------------------------------------------------------------------------
| This file is distributed under the MIT License.
| See accompanying file /LICENSE for details.
| Author(s): Giulia Meuli
*-----------------------------------------------------------------------------*/
#pragma once
#include <cstdint>
#in... |
a467c813d20a9a5c0e476b35cad150b100085dc5 | e29e9a40a09fad0e3f8201b85fb48a4708c3263e | Igalia/chromium | /chrome/browser/chromeos/policy/device_local_account_browsertest.cc | C++ | cc | 109,241 | permissive | // Copyright (c) 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 "chrome/browser/chromeos/policy/device_local_account.h"
#include <stddef.h>
#include <map>
#include <memory>
#include <set>
#include <strin... |
ce9b09413bdeb10abed3e8f15a32b9c1ba969027 | 582b10c254346b396c237e9a6f0920018b007bd3 | xuze1993/QooMap | /QooMap/Weather.cpp | C++ | cpp | 375 | no_license | #include "Weather.h"
#include "Offset.h"
#include "D2State.h"
void __declspec(naked) LightingPatch()
{
__asm {
cmp [togglelight],0
je lightold
mov eax,0xff
mov byte ptr [esp+4+0], al
mov byte ptr [esp+4+1], al
mov byte ptr [esp+4+2], al
add dword ptr [esp], 0x72;
ret
lightold:
pu... |
c4693334e7fd14b507c660c8a1b707f94cd671a5 | 232e63e086c8364dd308b647fca26c9f9d7f44ac | RexOrCine/opencine | /Source/ProcessingTest/Controls/PreviewPane.cpp | C++ | cpp | 9,408 | no_license | #include "PreviewPane.h"
#include <QWheelEvent>
unsigned char pixels[12] = {
255, 0, 0, 0, 255, 0,
0, 255, 0, 0, 0, 255
};
float xOffset = 0.5f / 4096.0f;
float yOffset = 0.5f / 3072.0f;
float wheelValue = 1.0;
GLuint textureRed = 0;
GLuint textureGreen = 0;
GLuint textureBlue... |
0a82f15452028f7cceb4bc9136583d1a6ddc51f3 | ea6e4ffb4e90f88f35caac3b3d6fa40334670ca9 | nen155/Estructura-de-Datos | /UsoTreeC++/prueba_gs1.cpp | C++ | cpp | 1,170 | permissive | #include <iostream>
#include <set>
#include <unordered_set>
#include <iostream>
#include "gs1Set.h"
#include <fstream>
/** @brief Carga el fichero en memoria
* @param contenedor contenedor de salida
* @param s nombre del fichero
* @pre T debe tener el método insert(const string &)
*/
template <typename T>
void lo... |
82b42d4ac05dd37b236d5eecd5b54fae321aa663 | 23e9e91665202b9362dc6cec19c56cbe8b85912a | sency90/allCode | /networkProgramming/2_source_code/clientDir/client.cpp | C++ | cpp | 941 | no_license | #include "header.h"
int main(int argc, char** argv) {
if (argc != 2) {
printf("Usage: %s IPv4-address\n", argv[0]);
return -1;
}
struct sockaddr_in connectSocket;
//클라이언트용 소켓(connectSocket)을 set 하시오
int connectFD = socket(AF_INET, SOCK_STREAM, 0);
connectSocket.sin_family ... |
123df53dab42a7274ab2acf39785fad035e113ea | c8fce7f4301e2472702ff7fbcbcc2905ccd36d47 | Autoratch/spoj-solutions | /NSTEPS.cpp | C++ | cpp | 327 | no_license | #include<stdio.h>
int main()
{
int t,x,y,a[100000],z;
scanf("%d",&t);
for(int i=0;i<t;i++)
{
scanf("%d%d",&x,&y);
z=y+2;
if(x==y || x==z)
if(x%2==0)
a[i]=x+y;
else
a[i]=x+y-1;
else
a[i]=-1;
}
for(int i=0;i<t;i++)
{
if(a[i]==-1)
printf("No Number\n");
else
printf("%d\n",a[i]);
... |
50bf482c922c2d1ac6e39032991488dbfec875b1 | 75b30cb14bf52454a6ca2d449a54b7ce30231678 | ryanmiao/pyston | /src/codegen/irgen/irgenerator.cpp | C++ | cpp | 78,635 | permissive | // Copyright (c) 2014 Dropbox, Inc.
//
// 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 agree... |
de81c4d42df674082751504fe7e86ec310925bdf | c3b268d9aa334bd7ea050abc7c65953e8a59fe23 | challett/mandelBulb | /mainBulb.cc | C++ | cc | 2,409 | no_license | /*
This file is part of the Mandelbox program developed for the course
CS/SE Distributed Computer Systems taught by N. Nedialkov in the
Winter of 2015-2016 at McMaster University.
Copyright (C) 2015-2016 T. Gwosdz and N. Nedialkov
This program is free software: you can redistribute it and/or modify
it und... |
e32701fc32da3d4f20862b14cf3f42db9ad17cbe | eb9d2442e297fbac79dffa5a5c4d90feb6f632a5 | chromium/chromium | /chromecast/media/cma/base/simple_media_task_runner.cc | C++ | cc | 830 | permissive | // Copyright 2015 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chromecast/media/cma/base/simple_media_task_runner.h"
#include "base/task/single_thread_task_runner.h"
namespace chromecast {
namespace media {
SimpleMediaTaskRunn... |
dbc3b09814308b4f1907d795541b691a6fb0c227 | 0a397f063deb5a1755cf054f61a587d2f2a55d07 | maddevsio/noocoin | /src/walletdb.cpp | C++ | cpp | 14,606 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Copyright (c) 2012 The PPCoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "walletdb.h"
#include "wallet... |
b5ada7b775751c52e7caf20bf4bead96978652fd | dd0630c655545d33f8d076b40d446a159cbac818 | kant/perf_data_converter | /quipper/address_mapper.cc | C++ | cc | 11,119 | permissive | // Copyright (c) 2013 The Chromium OS 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 "address_mapper.h"
#include <stdint.h>
#include <vector>
#include "base/logging.h"
namespace quipper {
AddressMapper::AddressMapper(c... |
0cd66cb9234ee9b439b89d4cb862d60bf08b5662 | db37672ff072d3f6349162e0f31415aadf8d20be | Jizhongpeng/pbrt-v3-tof | /src/shapes/disk.cpp | C++ | cpp | 5,807 | permissive |
/*
pbrt source code is Copyright(c) 1998-2016
Matt Pharr, Greg Humphreys, and Wenzel Jakob.
This file is part of pbrt.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redi... |
96b7cfa34f415f2743b1ebae01a9aa689cdd9e45 | ec9c2e58b3e20b2a827d08cf5c1ab67b3435ca73 | chadrockey/chromium | /chrome/browser/ui/webui/options/search_engine_manager_handler.cc | C++ | cc | 11,936 | 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/ui/webui/options/search_engine_manager_handler.h"
#include "base/bind.h"
#include "base/strings/string_number_conversions.h"... |
6efb2d31f8a730240adb79f8ee1be70d59e2029a | e7da2c6f33cb4f2f1d32b8dadaa8ea624367155d | MaxRayskiy/Algorithms-3d-sem | /M1/B1/main.cpp | C++ | cpp | 3,229 | no_license | /*
* Найти лексикографически-минимальную строку, построенную по префикс-функции, в алфавите a-z.
*/
#include <iostream>
#include <string>
#include <vector>
using std::string;
using std::vector;
vector<int> PrefixFunctionFromString(const string &text);
vector<int> ZFunctionFromString(const string &text);
vector<i... |
af6765354da68435b95d5bf59c47e6c228c01e2b | 410c9092b38ecb917073f06dad1b49f93cb7caa7 | oatpp/oatpp-mbedtls | /test/oatpp-mbedtls/FullTest.cpp | C++ | cpp | 8,579 | permissive | /***************************************************************************
*
* Project _____ __ ____ _ _
* ( _ ) /__\ (_ _)_| |_ _| |_
* )(_)( /(__)\ )( (_ _)(_ _)
* (_____)(__)(__)(__) |_| |_|
*
*
* Copyright 2018-present, Leoni... |
c7f313eb10b79451ef8e12a4bbefc14a7d6208b1 | 8205fc950efc1674a10f75be82bf7d1d44a9ee7e | szeged/TyGL | /Tools/DumpRenderTree/cg/ImageDiffCG.cpp | C++ | cpp | 11,015 | no_license | /*
* Copyright (C) 2005, 2007 Apple Inc. All rights reserved.
* Copyright (C) 2005 Ben La Monica <ben.lamonica@gmail.com>. 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. Redistributi... |
ec73e253ff542c4146f12417a7bdd4fac5a291c5 | 0f478f5d3038b7980af4a942c5836c8c0f89fa24 | stackdragon/cplusplus-primerplus | /Chapter6/ex6-2.cpp | C++ | cpp | 930 | no_license | // ex6-2.cpp Write a program that reads up to 10 donation values into an array
// of double. The program should terminate input on non-numeric input. It should
// report the average of the numbers and also report how many numbers in the
// array are larger than the average
#include <iostream>
#include <array>
in... |
3c31e8e054917385a0bcaca7298d59c94d92c9f2 | 8ce444f68808b0d2776f29d381b40bbe53a9655d | benhj/glconsole | /test/main.cpp | C++ | cpp | 1,907 | no_license | // This 'ere software is hacky as fuck. Use at your peril.
// I'd appreciate a mention if you do. But if you don't,
// I'm not going to lose sleep over it.
// Ben H.D. Jones in the year of 2018
#include "glconsole/GLConsole.hpp"
#include <GLFW/glfw3.h>
#include <memory>
// Store the GLConsole that does the drawing of... |
2e0fefec1757944cc5c7e22ce40ffec92f62767f | ba161c50b941dbe61d0cabea0329473f6b212ae2 | XiaoTu1/qishi_data_structure | /BigO_array_set/MedianOfTwoSortedArrays.cc | C++ | cc | 1,212 | no_license | class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int m = nums1.size();
int n = nums2.size();
if ((m + n) % 2 == 1) {
return findKthNumber((m + n) / 2 + 1, nums1, nums2, 0, 0);
} else {
return (findKthNum... |
e22cfa9dc791fdb523087ea06b0bca7809a8794f | 8afbfbe28fd4ff3f0b8bb5413e700eccab39b8fd | GreenYun/DirectX-Samples | /legacy DirectX SDK/C++/Direct3D/Tutorials/Tut03_Matrices/Matrices.cpp | C++ | cpp | 10,374 | no_license | //-----------------------------------------------------------------------------
// File: Matrices.cpp
//
// Desc: Now that we know how to create a device and render some 2D vertices,
// this tutorial goes the next step and renders 3D geometry. To deal with
// 3D geometry we need to introduce the use of... |
3cfab365ae2d95d7246ad16c434037b37a571d68 | e5b8e278028725739b35ee06bc7d81c006ca889b | ASchneidman/Scotty3D | /src/scene/object.cpp | C++ | cpp | 4,765 | no_license |
#include "object.h"
#include <sstream>
#include "../gui/render.h"
#include "../geometry/util.h"
#include "renderer.h"
Scene_Object::Scene_Object(Scene_ID id, Pose p, GL::Mesh&& m, std::string n) :
pose(p),
_id(id),
armature(id),
_mesh(std::move(m)) {
set_skel_dirty();
editable = false;
if(n.size()) {
snp... |
79e7fb8ed26aae0bd9bcf090e672d8b72263c89c | 38b50ea181f963d29624786778f9b247a5ebf7ea | chrisoldwood/NCL | /PipeException.hpp | C++ | hpp | 1,566 | permissive | /******************************************************************************
** (C) Chris Oldwood
**
** MODULE: PIPEEXCEPTION.HPP
** COMPONENT: Network & Comms Library
** DESCRIPTION: The CPipeException class declaration.
**
*******************************************************************************
*/
// Chec... |
9c0bbbdd44df485a19e405a70b78ac6820fdca76 | b94304b213ccf64bd939abcd082818758f1d0336 | wangyongxina/DirectX12-Framework- | /GraphicsUtility/Mesh.cpp | C++ | cpp | 5,248 | permissive | #include "stdafx.h"
#include "Mesh.h"
#include "Render.h"
#include <limits>
using namespace std;
#undef min()
#undef max()
bool Mesh::loadMesh(aiMesh* assmesh, Render& render, CommandAllocator& cmdalloc, CommandList &cmdlist)
{
Fence tempfence;
tempfence.initialize(render);
if (!assmesh)
return false;
if (assme... |
60991667762fb3586ca9c48b0b165e369cf28f69 | 35866b9f1ca184170d2011f1cf6511a9e2c73a24 | RiponDas/UVa-Practices-C- | /uva-374.cpp | C++ | cpp | 406 | no_license | #include<bits/stdc++.h>
using namespace std;
long long int bigmod(long long a,long long b,long long M)
{
if(b==0) return 1%M;
long long x = bigmod(a,b/2,M);
x = (x*x)%M;
if(b%2 == 1)
x = (x*a) %M;
return x;
}
int main()
{
long long int B,P,m;
while(scanf("%lld %lld %l... |
9b65ac3c8fc65aa1bd5dd409f1c73e4c480f76cc | a65bb042d989a3741ec1c12926065bc5ecc94917 | TurtleMan64/SAB2 | /NewSonicThing/src/fontMeshCreator/GUINumber.cpp | C++ | cpp | 9,613 | no_license | #include "guinumber.hpp"
#include "../engineTester/main.hpp"
#include "../loading/loadergl.hpp"
#include "../fontRendering/textmaster.hpp"
#include "textmeshdata.hpp"
#include "fonttype.hpp"
#include "../menu/pausescreen.hpp"
#include "../toolbox/maths.hpp"
#include "../renderEngine/display.hpp"
GLuint GUINumber::numb... |
b138484185cf112b5f7c754daf4af926f47462f4 | f2a904654c16316a1b8d92213204c98020a361e7 | iakshatgandhi/DSAImportantQuestionScratch | /Amazon_Interview_Questions/Medium/Bottom_View_of_Binary_Tree.cpp | C++ | cpp | 577 | no_license | /*
Problem Link: https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1
*/
vector <int> bottomView(Node *root){
map<int,int>m;
queue<pair<Node*,int>>q;
vector<int>v;
if(!root)
return v;
q.push({root,0});
while(!q.empty()){
Node *t = q.front().first;
int h = q.fro... |
9f2be2f37f4f2c79e5262f340d2f9418ca2e70ce | 80f86c4481e5717dd230101b27c3ab441e9cf623 | nn020701/OIER | /xx/Vijos/2007/1.cpp | C++ | cpp | 1,441 | no_license | //85分
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define N 7100005
inline int read(){
int x = 0,f = 1;char ch = getchar();
while(ch<'0' || ch>'9'){if(ch=='-')f = -1;ch = getchar();}
while(ch>='0' && ch<='9'){x = x*10+ch-'0';ch = ge... |
b2623dfeb1a519a022ebde2a758236b4026de987 | 54e8dd588f9b1d0be5f978ee51f4d3f7cd1d08f3 | arrayfire/arrayfire | /src/backend/opencl/meanshift.hpp | C++ | hpp | 652 | permissive | /*******************************************************
* Copyright (c) 2014, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
**********************************************... |
0b810500f4aaa9a39f438b3842a40cc6ec9040ef | 04cc87239f310b7eb88ff4be0fefeea7347aa92c | shajunguang/Algorithm_competition | /537_Study/Fourteenth_Run/UVa10689.cpp | C++ | cpp | 1,233 | no_license | //由于n=1e9,O(n)TLE,可使用O(lgn)矩阵乘法[f(2),f(1);f(1),f(0)]^(n-1),使用快速幂策略
#include<bits/stdc++.h>
using namespace std;
typedef vector<vector<int>> mat;
int M;
//定义矩阵相乘
mat mul(mat &A, mat &B){
mat C(A.size(), vector<int>(B[0].size()));
for(int i=0;i<A.size();i++)
for(int k=0;k<B.size();k++)
for(int... |
526a23ed3e00c5ebbc9f6ec921f8428e61f03a27 | 6b10d09227221e169236a2b4ca445d451a232455 | soxar/soxar | /src/rpc/misc.cpp | C++ | cpp | 49,522 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Copyright (c) 2018 The Soxar Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-... |
99ecb61b921c0803b5635290b51ff8bebb50f1d0 | ef6fc1e1ca320151e1f225f963172f111b9b302b | sagarsharma122000/CipherSchools_Assignment | /Assignment 3/Linked List Palindrome.cpp | C++ | cpp | 890 | no_license | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
class Node{
public:
int data;
Node *next;
Node(int data){
this->data = data;
next = NULL;
}
};
void printList(Node *head)
{
if(head==NULL)
{
return;
}
while(head!=NULL)
{
cout<<head->data<<"->";
head =... |
8fc414b1687e51af01cc3ba1b66eac1fbca87719 | b8cf3ad9a5f716b7aff70dd71a0df89c563b39a7 | vhirtham/GDL | /test/unit/resources/memory/Test_generalPurposeMemory.cpp | C++ | cpp | 28,373 | no_license | #include <boost/test/unit_test.hpp>
#include "test/tools/ExceptionChecks.h"
#include "gdl/base/exception.h"
#include "gdl/base/functions/alignment.h"
#include "gdl/resources/memory/generalPurposeMemory.h"
#include <array>
#include <atomic>
#include <thread>
using namespace GDL;
void AssertIncreasingAddresses(std::... |
1f53726a27de1e11014ffd6b5bc86be10ec1190e | 5affb4cb7da6851791f93539d11a4b2cd862e663 | nguyenchiemminhvu/Rescue-in-warface-cocos2d-x- | /Classes/InstructionScene.cpp | C++ | cpp | 3,669 | no_license | /*
- Project: Rescue in warface
- Author: Nguyen Chiem Minh Vu
- First release: 00:20 07/03/2016
*/
#include "InstructionScene.h"
Scene * InstructionScene::createScene()
{
auto scene = Scene::create();
auto layer = InstructionScene::create();
scene->addChild(layer);
return scene;
}
bool InstructionScene::init(... |
8ffa00b312d6c801d824b4cdaeed1e8f9d41dcba | b64a9f6cbc8c2ec4e5a108f1c72d2d8a85504f0c | bigbearishappy/3d-printer | /20151214/cpp/motion_control.cpp | C++ | cpp | 7,210 | no_license | /*
motion_control.c - high level interface for issuing motion commands
Part of Grbl
Copyright (c) 2009-2011 Simen Svale Skogsrud
Copyright (c) 2011 Sungeun K. Jeon
Grbl 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... |
afad033fab322986bce5cb6953c3f82a19b5deeb | 35ba96c3d44bfb47c11d3a6817462fee018c5fc9 | aashrafh/PaintForKids | /src/Actions/SaveAction.cpp | C++ | cpp | 2,196 | permissive | #include "SaveAction.h"
#include"..\ApplicationManager.h"
#include"..\Figures\CFigure.h"
#include"..\GUI\Input.h"
#include"..\GUI\Output.h"
#include<fstream>
SaveAction::SaveAction(ApplicationManager *pApp, int FigCount) : Action(pApp)
{
FileName = "TEST";
FigCnt = FigCount; //We need the figure number to write i... |
47eccf08f967b8b628815f04af3898e70494f6a5 | 96a11c40aa4fe209d311413c397d7e17fe07f314 | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-medical-imaging/source/model/ImageSetWorkflowStatus.cpp | C++ | cpp | 4,495 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/medical-imaging/model/ImageSetWorkflowStatus.h>
#include <aws/core/utils/HashingUtils.h>
#include <aws/core/Globals.h>
#include <aws/core/utils/EnumParseOverflowContainer.h>
using names... |
5a1be851307d9f1492f05db1199691ece203fc2b | 71f6ebf1e5d5fed8e1c28a53926f0c1273b02111 | lightman1998/lab08 | /include/print.hpp | C++ | hpp | 639 | permissive | /*!
\file
\brief Заголовочный файл print.hpp
Декларация
*/
#include <string>
#include <fstream>
#include <iostream>
/*!
Функция вывода (1)
\param[in] text стринговая переменная, для записи текста
\param[in] out оператор вывода
*/
void print(const std::string& text, std::ostream& out = std::cout);
/*!
Функция вывода... |
802c4c9121f5ec9abca18a720ad72a28aec1c533 | 5e2a911b21acce7e5b6eee13851fdc41073bdca0 | otcshare/chromium-src | /chrome/test/views/chrome_test_widget.cc | C++ | cc | 1,471 | permissive | // Copyright 2020 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/test/views/chrome_test_widget.h"
#include <memory>
#include "ui/base/theme_provider.h"
#include "ui/gfx/color_palette.h"
#include "ui/g... |
572de833e68dd7ee306f8cb1058d86db9815afc0 | d2e1ae329be3ff8cf5e810e1fc10e4e84ef4c93d | pombreda/irods | /iRODS/lib/core/include/sslSockComm.hpp | C++ | hpp | 1,441 | permissive | /*** Copyright (c), The Regents of the University of California ***
*** For more information please refer to files in the COPYRIGHT directory ***/
/* sslSockComm.h - header file for sslSockComm.c
*/
#ifndef SSL_SOCK_COMM_HPP
#define SSL_SOCK_COMM_HPP
#include <openssl/ssl.h>
#include <openssl/x509v3.h>
#... |
5616c1478fc7acaf6dad0bacac5ca25d8c6b96b8 | 04a38887c79cdb15cf3ecbfd53e8bbecc500ef83 | tomdbar/cold-control | /dlls/IVI Foundation/IVI/Drivers/wx218x/Source/wx218x.cpp | C++ | cpp | 2,138 | no_license | #include "StdAfx.h"
#include "wx218x.h"
#include "wx218x.nimbus.h"
ViStatus TranslateUnknownHRESULT(ViSession session, HRESULT hr)
{
ViStatus error = 0x80000000; // _VI_ERROR
NTL_UNUSED(hr);
return ReportErrorUsingComErrorInfoDescription(session, error);
}
ViStatus _VI_FUNC wx218x_QueryArbWfmCapabilities ( ViSe... |
7eea12026e46322fe6970c9272c6e8fc91840843 | 75936eb4daaeabc0fe157c8b50bcca67756cc344 | tashfeen39/OOP-Workshops | /WS01/part 2/w1_p2.cpp | C++ | cpp | 3,034 | no_license | // Workshop 1 - Linkage, Storage Duration, Namespaces, and OS Interface
// Cornel - 2020/01/08
// Chris - 2021/01/14
#include <iostream>
#include <iomanip>
#include <fstream>
#include "event.h"
#include "event.h"
/* input file format: a comma separated set of fields; some fields have a single parameter
T175,SComputer... |
230c0a4e8bcaee1c84fd9c5f6248e29b8b89f4b5 | 85a33444406815ecd4bd9bd8f64e417fc412f1bb | PraxLannister/Interview-Preparation | /DisjointSet/numberOfConnectedComponents.cpp | C++ | cpp | 2,024 | no_license | #include<iostream>
#include <set>
using namespace std;
// class Graph
// {
// int V;
// list<int> *adj;
// public:
// Graph(int V)
// {
// this->V = V;
// adj = new list<int>[V];
// }
// void addEdge(int u,int v,bool bidir=true)
// {
// adj[u].push_back(v);
// if(bidir)
// adj[v].push_back(u);
// }
... |
429ee15252ed06da20f6340e72bc21217d5abf3f | 34b4873492e5630d1ed94830032bab92ed552451 | drownedout/datamap | /node_modules/gdal/deps/libgdal/gdal/ogr/ogrgeometrycollection.cpp | C++ | cpp | 40,783 | permissive | /******************************************************************************
* $Id: ogrgeometrycollection.cpp 29330 2015-06-14 12:11:11Z rouault $
*
* Project: OpenGIS Simple Features Reference Implementation
* Purpose: The OGRGeometryCollection class.
* Author: Frank Warmerdam, warmerdam@pobox.com
*... |
d5183f15671d26a5e8b61c44a1b08ba3eb5de80f | 4a1df1d826df2577fb03b5c43a6131d052b44105 | YooInKeun/Baekjoon-Online-Judge-Code | /Simulation/(4307)개미.cpp | C++ | cpp | 2,565 | no_license | /*
문제
개미 여러 마리가 길이가 lcm인 막대 위에 있다.
각 개미의 이동 속도는 모두 일정하며, 1cm/s이다.
개미가 막대의 마지막까지 걸어간다면, 개미는 그 즉시 떨어지게 된다.
또, 두 개미가 만나게 된다면, 방향을 반대로 바꾸어 걸어가게 된다.
가장 처음에 막대 상에서 개미의 위치를 알고 있다.
하지만, 개미가 어느 방향으로 움직이는 지는 알 수가 없다.
이때, 모든 개미가 땅으로 떨어질 때까지 가능한 시간 중 가장 빠른 시간과 느린 시간을 구하는 프로그램을 작성하시오.
입력
첫째 줄에 테스트 케이스의 개수가 주어진다.
각 테스트 케이스의 첫째 줄에는... |
7c380dabd2c800f73058ce7951cdce21519cc8ee | 51fc014172e797e5fd6c734d5e81d6d8e8057f39 | adshidtadka/algorithm | /atcoder/pfu/a.cpp | C++ | cpp | 4,399 | no_license | // include
//------------------------------------------
#include <bits/stdc++.h>
#include <algorithm>
#include <cctype>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
in... |
de7d25200e0b4ff5236ca57e4ab54b7b60d86f7e | 8f5cbca9d6601268883667dbcdb136ab078ac932 | WilliamQf-AI/IVRMstandard | /MarketDataAdapters/hyperfeedproviders/Workaround/hf_Queue/hyperfeedmarketdataforiv.cpp | C++ | cpp | 16,662 | no_license | // HyperFeedMarketDataForIv.cpp : Implementation of CHyperFeedMarketDataForIv
#include "stdafx.h"
#include "HyperFeedMarketDataForIv.h"
STDMETHODIMP CHyperFeedMarketDataForIv::RequestData(short RequestDataTypes)
{
ATLTRACE(_T("CHyperFeedMarketDataForIv::RequestData\n"));
try
{
if (!RequestDataTypes)
... |
83866531a9edf346cbe54ed613c96ae3792f4b78 | 31adc3c5c549ea0a628b757498a4a5192b6c1846 | joker-eph/nt2 | /modules/core/arithmetic/unit/simd/ifloor.cpp | C++ | cpp | 2,907 | permissive | //==============================================================================
// Copyright 2003 - 2012 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2012 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// ... |
34719e26bde840e23f2cfdc35a507be3d4d92ec0 | 09d1bed26facfff3bbe9488f7c64b0c8db46b45a | Lamoreauxaj/USACO | /Training Pages/Chapter 3/game1.cpp | C++ | cpp | 1,628 | no_license | /*
ID: lamorea1
LANG: C++11
PROG: game1
*/
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 105
int N;
int nums[MAXN];
pair<int,int> memo[MAXN][MAXN];
pair<int,int> score(int s, int e) {
if(memo[s][e]!=pair<int,int>(-1,-1)) return memo[s][e]; //if already found
if(s>e) return pair<int,int>(0,... |
54917c4eb9a0ad7d86447745efc5d4a7eeee3ab4 | d326302c5b281a3cd7fa4a514480c4939ca7c786 | VishvajitP/pytorch | /aten/src/ATen/native/TensorProperties.cpp | C++ | cpp | 1,954 | permissive | #include "ATen/ATen.h"
#include "ATen/NativeFunctions.h"
#include "ATen/WrapDimUtils.h"
#include "ATen/detail/CUDAHooksInterface.h"
#include "ATen/Config.h"
namespace at {
namespace native {
bool is_same_size(const Tensor& self, const Tensor& other) {
return self.sizes().equals(other.sizes());
}
int64_t size(const... |
eb2cbc5fe2513b424096f1eee5d04e9109aeb06a | cdf6a6a3b9809b4d81ee5aee7fcaada66773537e | Abdullah28-gheyad/Abdullah-commerce | /linux/my_application.cc | C++ | cc | 3,730 | no_license | #include "my_application.h"
#include <flutter_linux/flutter_linux.h>
#ifdef GDK_WINDOWING_X11
#include <gdk/gdkx.h>
#endif
#include "flutter/generated_plugin_registrant.h"
struct _MyApplication {
GtkApplication parent_instance;
char** dart_entrypoint_arguments;
};
G_DEFINE_TYPE(MyApplication, my_application, GT... |
e24fc4d8f6b50d2da282edee0ec52b5c87f1d5ad | 3cf5cda620cecfe4e26febb1bc6ffb50256cf248 | yuri410/rpg | /external/DirectXShaderCompiler/tools/clang/test/CXX/temp/temp.decls/temp.class.spec/p6.cpp | C++ | cpp | 2,214 | permissive | // RUN: %clang_cc1 -fsyntax-only -verify %s
// Test class template partial specializations of member templates.
template<typename T>
struct X0 {
template<typename U> struct Inner0 {
static const unsigned value = 0;
};
template<typename U> struct Inner0<U*> {
static const unsigned value = 1;... |
03d18c94d645cff76b57e148e0117df5d5c8f009 | 7030ebca981a332076aa0a237077fda7ceda5aa9 | OBliv10N/lab10 | /lab10_1.cpp | C++ | cpp | 486 | no_license | // cout << "Press Enter 3 times to reveal your future.";
// cout << "You will get A in this 261102.";
#include<iostream>
#include<string>
#include<cstdlib>
#include<ctime>
using namespace std;
int main(){
cout << "Press Enter 3 times to reveal your future.";
srand (time(0));
cin.get();
cin.get();
c... |
ed01cbbef8b293e7bcf816057ade7fd16b2d39f3 | dbdedf2647df4a200c80c8d8f8e41a04d4977f27 | patels20/Text-RPG | /main.cpp | C++ | cpp | 8,263 | no_license | #include "level.cpp"
#include "player.h"
#include "monster.h"
#include <iostream>
#include <windows.h>
using namespace std;
int main()
{
wizard player1("Wizard",100,25,15); // instantiate new player objects
archer player2("Archer",100,35,5);
warrior player3("Warrior",100,30,10);
int cash =0;
s... |
bdafdfbcc9935e609e2ab2fbabbffcf0e2903a92 | c213c4ab897781f3668b616a8ea82876043a8c4f | zeldaret/botw | /src/Game/AI/AI/aiLastBossDemoWarpRoot.cpp | C++ | cpp | 646 | no_license | #include "Game/AI/AI/aiLastBossDemoWarpRoot.h"
namespace uking::ai {
LastBossDemoWarpRoot::LastBossDemoWarpRoot(const InitArg& arg) : ksys::act::ai::Ai(arg) {}
LastBossDemoWarpRoot::~LastBossDemoWarpRoot() = default;
bool LastBossDemoWarpRoot::init_(sead::Heap* heap) {
return ksys::act::ai::Ai::init_(heap);
}
... |
da03a0decb3bf17f456394b050ab9341ff0c78b7 | 685a6ac48143c45e3511a491fb4f5862a38577f5 | scharlton2/wphast3 | /src/WellDeleteAction.cpp | C++ | cpp | 684 | no_license | #include "StdAfx.h"
#include "WellDeleteAction.h"
#include <map>
#include "WPhastDoc.h"
#include "WellActor.h"
CWellDeleteAction::CWellDeleteAction(CWPhastDoc* pDoc, CWellActor* pWellActor)
: m_pDoc(pDoc)
, m_pWellActor(pWellActor)
{
ASSERT_VALID(this->m_pDoc);
ASSERT(this->m_pWellActor && this->m_pWellActor->IsA("... |
dc973f5d4da84c45e176d707a605f3940d022d4b | 336d5bbf1681b115a22610de523cc3d178bd5cec | yupeihua/algorithm | /sljc/z.cc | C++ | cc | 838 | no_license | #include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
using namespace std;
typedef unsigned long long ll;
const int N = 90;
bool is[N];
//只有次方数为和数时满足要求
//筛选64以内的素数
void getPrime() {
memset(is, 1, sizeof(is));
is[0] = is[1] = 0;
for (int i = 2; i * i <= N; i++)if (is[i]) {
for (int j = i * i; j <... |
5f5b10e74db5df20309427a8de66f652b0fbf5fd | f260746c40fe89594ef93363c1fba788b96f412a | rolanrbd/expressionsEvaluator | /Expression.cpp | C++ | cpp | 8,986 | no_license | #include "Expression.h"
Expression::Expression():
opT(OPT_UNSET)
{
}
void Expression::setExpression(QString s)
{
if(s.isEmpty())
return;
exp = s;
opT = toPostorder();
}
QString Expression::toString()
{
QString result = "";
if(expPostorder.isEmpty())
retu... |
8a90c4a584f25808e2a40784ef9e41b2bfe8124b | 12f1dfefec58be1faa0f5f0622237b8144169ddb | namans511/codeforces | /contests/Codeforces Round #690 (Div. 3)/A.cpp | C++ | cpp | 1,252 | no_license | #include <bits/stdc++.h>
#define ll long long
#define M 1000000007
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define vi std::vector<int>
#define vl std::vector<ll>
#define pi std::pair<int,int>
#define pl std::pair<ll,ll>
#define mi std::map<int, int> map;
#define ml std::map<ll, ll> ma... |
197c5545df0ebf28e78c445b8089eea1ae48079c | 1861b95c994ce997bcbb68f2e7dba1b12fdc0f91 | GordonFreeman622/Arduino | /libraries/AM232X/AM232X.cpp | C++ | cpp | 6,587 | permissive | //
// FILE: AM232X.cpp
// AUTHOR: Rob Tillaart
// VERSION: 0.2.4
// PURPOSE: AM232X library for AM2320 for Arduino.
//
// HISTORY:
// 0.1.0 2017-12-11 initial version
// 0.1.1 2017-12-12 added CRC checking
// 0.1.2 2017-12-12 get and set functions.
// 0.1.3 2017-12-19 added ESP8266 - issue #86
// ... |
5b2da1528087254be3e6b24810b0fdc704505915 | 3f0d65232621765c4eeb5c716749f892225934f7 | hexuscoin/hexus | /src/miner.cpp | C++ | cpp | 22,870 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Copyright (c) 2019 The Hexus Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses... |
5dffd476c5d31cf22a734abfb3292defc9cd51f1 | 15aef013e165e6bc3c977b99dfc6d75409e9488b | xph906/TrackingFree | /src/chrome/browser/media/chrome_webrtc_audio_quality_browsertest.cc | C++ | cc | 17,166 | 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 <ctime>
#include "base/command_line.h"
#include "base/file_util.h"
#include "base/path_service.h"
#include "base/process/launch.h"
#include "bas... |
2d5ee3211121cd2d76b21afb73d3fcb427250dd2 | 62365a21ebce322ebe043af0f6f8292d634b3b18 | LIMXTEC/BitSend | /src/test/merkle_tests.cpp | C++ | cpp | 10,691 | permissive | // Copyright (c) 2015-2018 The Bitsend Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <consensus/merkle.h>
#include <test/test_bitsend.h>
#include <boost/test/unit_test.hpp>
BOOST_FIXTURE_TEST_SUITE(m... |
6359cdfff534b744e34e3b04eefdd4d037e3ff66 | 3f71bfbe6394518212eb9f3f6ff5ae83c1df173c | TheNsBhasin/Codeforces | /Dima and Staircase/main.cpp | C++ | cpp | 625 | no_license | /*input
5
1 2 3 6 6
4
1 1
3 1
1 1
4 3
*/
//
// main.cpp
// Dima and Staircase
//
// Created by Nirmaljot Singh Bhasin on 19/05/18.
// Copyright © 2018 Nirmaljot Singh Bhasin. All rights reserved.
//
#include <iostream>
using namespace std;
typedef long long int lli;
const int MAXN = 100005;
lli a[MAXN];
int ma... |
6c20c137f6e8433e8cd27ea1dc458d709034a599 | 4f11cd7cf2482f6b8512a58684ec99f7b2fb2d9c | BroodLord/Games-Dev-2 | /GD2/Source/Scene/EntityManager.cpp | C++ | cpp | 10,062 | no_license | /*******************************************
EntityManager.cpp
Responsible for entity creation and
destruction
********************************************/
#include "EntityManager.h"
namespace gen
{
/////////////////////////////////////
// Constructors/Destructors
// Constructor reserves space for entities and... |
fabd18462cfc484a4f15ba71a873efafbe9ea86d | b2ca1e413b0ef6ada01c9ea8ea621ec5117d1cf0 | willespencer/Computer-Vision | /closest-pair/Sort/closestPair.cpp | C++ | cpp | 2,239 | no_license | //Will Spencer, Period 4
#include <stdlib.h>
#include <iostream>
#include <fstream>
#include <math.h>
#include <limits>
#include <time.h>
#include <algorithm>
using namespace std;
class Dot{
public:
float x;
float y;
};
bool xSort(const Dot & i, const Dot & j)
{
return i.x < j.x;
}
bool ySort(const Dot & i, c... |
a5846bf0467f5dd1cd60942a4777f40cd44c3594 | 4f3335ffa86db3201fdab87732c3543b1988533c | sgurumurthy/contrail-controller | /src/bgp/bgp_peer.cc | C++ | cc | 82,277 | permissive | /*
* Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
*/
#include "bgp/bgp_peer.h"
#include <boost/assign/list_of.hpp>
#include <boost/foreach.hpp>
#include <boost/tuple/tuple.hpp>
#include <algorithm>
#include <map>
#include "base/task_annotations.h"
#include "bgp/bgp_factory.h"
#include "bgp/bgp_l... |
8104acef749ec56e23b76bc64eb79d3bb3376c9d | 27e05fcf1b73f5ce03c620127c4a1287901cf45a | tiny656/scan-line-zbuffer-algorithm | /ScanLineZBuffer/ScanLineZBuffer/include/OpenMesh/Tools/Decimater/ModEdgeLengthT.cc | C++ | cc | 4,950 | no_license | /*===========================================================================*\
* *
* OpenMesh *
* Copyright (C) 2001-2015 by Computer Graphics Group, RWTH Aachen *
* ... |
0e712035a7fa27c847ae3542f03e4f26a8842b75 | abc374ac2ff9b316f46a451697e36b838d068df2 | RuiteGuo/draco | /src/draco/attributes/point_attribute_test.cc | C++ | cc | 1,694 | permissive | // Copyright 2017 The Draco 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.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agree... |
c025deeb38ed9169b21b49d54bd580e34ae9bd1a | 37cc193f9657cc11e2ffa19d14c17775b477f83d | jestyf/TNN | /source/tnn/device/opencl/acc/opencl_cpu_adapter_acc.cc | C++ | cc | 7,177 | permissive | // Tencent is pleased to support the open source community by making TNN available.
//
// Copyright (C) 2020 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy o... |
5f10177a52e18b6aef54220b308fb474c983fd3a | ca0e53e675be8f5a7a98b3a987e3fa20be37f783 | MasterMind90/cppractice | /atcoder/abc042/B.cpp | C++ | cpp | 316 | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
int n , l ;
cin >> n >> l ;
vector<string> v(n);
for(int i=0;i<n;i++){
cin >> v[i] ;
}
sort(v.begin(),v.end());
string ans = "" ;
for(string x : v){
ans += x ;
}
cout << ans << endl;
return 0 ;
}
|
a1c607ac7a2ae069b0c9a32e12070dd10e87c5cf | cafe02572b92013c6cd581b1983f5bf7a401c62f | dwilliamson/Sandbox | /Alignment/Main.cpp | C++ | cpp | 397 | no_license |
#include <stdio.h>
#include <stddef.h>
struct float2
{
float x, y;
};
struct float3
{
float x, y, z;
};
struct float4
{
float x, y, z, w;
};
__declspec(align(16))
struct Data
{
float4 a;
float3 b;
float2 c;
float d;
float e;
};
#define O(x) printf("%s : %d\n", #x, offsetof(Data, x));
int main()
{
pr... |
651e046dd0602860fdeca8dac391748f91ce1e7d | 63a74c2f9925fd24fbb786a09ba502c73417f0a5 | laszlofederics/Esp | /lib/EspWifi.cpp | C++ | cpp | 14,277 | permissive | /* ************************************************************************** */
/* ************* Configuration settings ****************** */
/* ************************************************************************** */
#define ENABLE_DEBUG
#define ESP_NOW_WIFI_CHANNEL 1
/* Define a locally ad... |
58dc54f49421785bc4cdeb8c63988900b3c2a8f2 | 930f8cc588daaa02ca5080655c10052a6e01af6a | ibaranov-cp/flir_ptu | /flir_ptu_driver/src/driver.cpp | C++ | cpp | 7,643 | no_license | /*
* flir_ptu_driver ROS package
* Copyright (C) 2014 Mike Purvis (mpurvis@clearpathrobotics.com)
*
* PTU ROS Package
* Copyright (C) 2009 Erik Karulf (erik@cse.wustl.edu)
*
* Author: Toby Collett (University of Auckland)
* Date: 2003-02-10
*
* Player - One Hell of a Robot Server
* Copyright (C) 2000 Brian ... |
a6cf56698b1b25ca03823d66bb168aa65e49fda3 | eb8b3b7562777d0e49e67edf216045052c73aaae | sfztools/sfizz | /src/sfizz/WindowedSinc.hpp | C++ | hpp | 3,011 | permissive | // SPDX-License-Identifier: BSD-2-Clause
// This code is part of the sfizz library and is licensed under a BSD 2-clause
// license. You should have receive a LICENSE.md file along with the code.
// If not, contact the sfizz maintainers at https://github.com/sfztools/sfizz
#pragma once
#include "WindowedSinc.h"
#inclu... |
9de4b6e5b8b80aa4e52ae1d1e4cd9ac9edafc507 | fff3444dacd213448ccfa7bc5e8f2f15026e7383 | eriser/AudioPlug-In | /HeyMate/HeyMate/SupportingFiles/HeyMate_vst2wrapper.cpp | C++ | cpp | 868 | no_license | //
// vst2wrapper.cpp
// HeyMate
//
// Created by Henri Aribert-Desjardins on 24/10/2014.
//
//
//------------------------------------------------------------------------
//------------------------------------------------------------------------
// Wrapping VST2
//#include "public.sdk/so... |
25dc23e1f9d4ed0eb94655b30c074a461aaf78d8 | fc4ddbdb077d08bbd4f1ff9937decb742903187a | YuriyGulyayev/NaturalGasTrading | /Myself/Prototypes/Prototype52/Prototype52/Prototype52/TNewsHubEconomicIndicatorReceiverConfiguration.hpp | C++ | hpp | 1,723 | no_license | #pragma once
#include "./TEconomicReportReceiverViaTcpBaseConfiguration.hpp"
#include "../Common/SourceCodeModel/IncrementHeaderInclusionBalance.hpp"
namespace Prototype52
{
// See the config file for more info.
class TNewsHubEconomicIndicatorReceiverConfiguration :
public TEconomicReportReceiverViaTcpB... |
463a6e74c68b5e3a3c613a49502d7b51259c2f13 | f70d13923127fe762e2ab579d36d11530d32c7f2 | turi-code/GraphLab-Create-SDK | /boost/fusion/container/map/detail/map_impl.hpp | C++ | hpp | 5,874 | permissive | /*=============================================================================
Copyright (c) 2005-2013 Joel de Guzman
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)
=========================================... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.