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 |
|---|---|---|---|---|---|---|---|---|
0809c432c8aa98bf460d5562ed1f625b18947da6 | 4d6f6408caa713ae3472e63edd8e68413061c267 | roboturx/aa | /prj_Qt/_asumtree/lib/dbase/dbase.cpp | C++ | cpp | 58,924 | no_license |
#ifdef ADRS
#include "adrs/clsn.h"
#include "adrs/frm.h"
#include "adrs/ftr.h"
#endif
#ifdef MLZM
#include "mlzm/mlzm.h"
#include "mlzm/mlzm_gc.h"
#endif
#ifdef HSAP
#include "hc_hsp.h"
#include "hc_hspdty.h"
#endif
#ifdef OTHER
#include "ie/ie.h"
#include "ie/iedet.h"
#include "ie/sclk.h"
#include "ie/tsnr.h"
#i... |
aa8c7b972061b9618ef80d81c0fde935e46a5e9c | 78d7de91e5e828945773c5816faa461c40cbb47e | LizTheGameProg/Creator | /external/PhysX-3.2.4_PC_SDK_Core/Samples/SampleFramework/renderer/src/RendererVertexBufferDesc.cpp | C++ | cpp | 2,451 | no_license | /*
* Copyright 2008-2012 NVIDIA Corporation. All rights reserved.
*
* NOTICE TO USER:
*
* This source code is subject to NVIDIA ownership rights under U.S. and
* international Copyright laws. Users and possessors of this source code
* are hereby granted a nonexclusive, royalty-free license to use this code
* ... |
774d1d7a2abcf69a7ddc0494845ec458da977456 | e75e06e77878d4a6615855d8e6ac109a49268616 | dlubom/walls | /reselect/resellib.cpp | C++ | cpp | 22,194 | no_license | // resellib.cpp : Defines the entry point for the DLL application.
//
#include "stdafx.h"
#include "resellib.h"
#define COLON_MASK 0x80000000
#define REF_MASK 0xC0000000
#define DBF_BUFSIZ 512
#define DBF_NUMBUFS 32
#define TRX_NUMBUFS 128
//NOTE: Define these the same in rebuild.c!
#define TRX_KW_TREE (trx)
#define... |
aa6b51285555ca81c93e3b9bb9b5adff2f1b988e | 080797e669460c8d45f1dbe466a2e3d0c4bc66da | Qihoo360/blackwidow | /examples/hashes_example.cc | C++ | cc | 4,700 | permissive | // Copyright (c) 2017-present, Qihoo, Inc. All rights reserved.
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree. An additional grant
// of patent rights can be found in the PATENTS file in the same directory.
#include <thread>
#in... |
ec177661380014d006a9dbbb1da9d788ca1eb4ee | 2574d856db570a190243f16d65c90114d96a5696 | wantomorrow/007 | /build/px4_fmu-v5_default/src/drivers/uavcan/include/dsdlc_generated/uavcan/equipment/air_data/TrueAirspeed.hpp | C++ | hpp | 7,470 | permissive | /*
* UAVCAN data structure definition for libuavcan.
*
* Autogenerated, do not edit.
*
* Source file: /home/xj/007/007/Firmware/src/drivers/uavcan/libuavcan/dsdl/uavcan/equipment/air_data/1020.TrueAirspeed.uavcan
*/
#ifndef UAVCAN_EQUIPMENT_AIR_DATA_TRUEAIRSPEED_HPP_INCLUDED
#define UAVCAN_EQUIPMENT_AIR_DATA_TRU... |
c88803ff3056d6d3b5a9335ded6d15fbb914f3f5 | 1eaf92aed41517c4764570c8ffb21bda8a13c94a | data-processing/ufora | /ufora/FORA/Vector/ExternalDatasetDescriptor.py.cpp | C++ | cpp | 2,003 | permissive | /***************************************************************************
Copyright 2015 Ufora 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/licen... |
1aa615f5dc5995e5ae4662a5dd29dffa0cd15f11 | 6935f55e3ecbac24cf89d696cac79f7d18f44aaf | torkos/magnum | /src/MagnumPlugins/MagnumFont/Test/MagnumFontGLTest.cpp | C++ | cpp | 4,244 | permissive | /*
This file is part of Magnum.
Copyright © 2010, 2011, 2012, 2013, 2014, 2015
Vladimír Vondruš <mosra@centrum.cz>
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 Softwar... |
ee5f90db53ea7ff8ef46904ccc4a1d770b01a07c | d2cb1e74dfcfe16bbbfb6d12c7fda65ef8d3818f | AniruddhaSadhukhan/C-Plus-Plus-Programs | /RunTime Polymorphism/area.cpp | C++ | cpp | 1,276 | no_license | #include<iostream>
using namespace std;
/*Create a base class Shape .Use this Class to store two double type values that could
be used to compute areas. Add two derived Class Triangle and Rectangle from the
base Class Shape. Add to the base class, a member functions get_data () to
initialize the data members in the ba... |
9e9a80523b2ddc291209664de89ef90587dff4bb | b9cc8b8e31041b4657b7dd4aa4c831441ea56d1c | a00012025/Online_Judge_Code | /HSNU-OJ/56.cpp | C++ | cpp | 271 | no_license | #include<bits/stdc++.h>
#define ULL unsigned long long
using namespace std;
main()
{
int n ; scanf("%d",&n) ;
ULL a=0ULL,ans=0ULL ;
while(n--)
{
ULL x ; scanf("%llu",&x) ;
ans+=a*x ; a+=x ;
}
printf("%llu\n",ans) ;
}
|
ab87c6c96b1bb425404c28e43d9b20dcc9a9fcc8 | 2c0a62bbe354b62c10243c0f19e9dcb3e9959dd7 | amoylel/fcppt | /include/fcppt/random/distribution/parameters/uniform_real_fwd.hpp | C++ | hpp | 527 | permissive | // Copyright Carl Philipp Reh 2009 - 2015.
// 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)
#ifndef FCPPT_RANDOM_DISTRIBUTION_PARAMETERS_UNIFORM_REAL_FWD_HPP_INCLUDED
#define FCPPT_RANDOM_DI... |
35b34a6d2202aeb8fe1e4200246c07ed61a89e33 | 4a6c12ebf11e64166ad2632bd4c915510dc54e58 | ttyang/sandbox | /sandbox/channel/boost/channel/dispatchers/push_dispatcher_base.hpp | C++ | hpp | 4,383 | no_license | //
// pull_dispatcher_base.hpp
//
// Copyright (c) 2005-2009 Yigong Liu (yigongliu at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
//// push dispatchers:
//// define push-style message pass... |
4e75485149ae28958323e079edf26dde33800558 | e31fd49e1fd442beef6815c569fdf614031a8385 | pauladams8/chromium | /chrome/browser/ash/borealis/borealis_installer_impl.cc | C++ | cc | 19,300 | 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/browser/ash/borealis/borealis_installer_impl.h"
#include <memory>
#include "base/bind.h"
#include "base/memory/weak_ptr.h"
#include "ba... |
011a2ffc32bd05b81dcdca191d80a40836610cd0 | def1df4ca0547e609cdea1732b834afc044463bb | dmt3o/chromium | /third_party/blink/renderer/modules/manifest/manifest_parser_unittest.cc | C++ | cc | 122,670 | 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 "third_party/blink/renderer/modules/manifest/manifest_parser.h"
#include <stdint.h>
#include <memory>
#include "base/macros.h"
#include "base/... |
c4074044700f63af7ff79c2ec891fc7ea32df1a9 | 37deafd61edecd3f0593c19f04396dc6722435e5 | zyzhen/imsiToPhoneNum | /imsiToPhoneNum.cpp | C++ | cpp | 6,327 | no_license | #include <iostream>
#include <string>
#include <sstream>
using namespace std;
//判断输入的字符串是否全是数字
bool allIsNum(string str)
{
for(int i = 0; i < str.length(); i++)
{
int temp = int(str[i]);
if(temp >= 48 && temp <= 57)
continue;
else
return false;
... |
4683c38a9288979437e69dbd175f6456e7b15638 | 3690ceeedaf33e76b14e721c61219ba003ba950f | NormanBetancourth/Iterator | /ListIterator.cpp | C++ | cpp | 438 | no_license | //
// Created by norma on 19/5/2021.
//
#include "ListIterator.h"
ListIterator::ListIterator(Nodo *cursor) {
this->cursor=cursor;
}
Persona *ListIterator::getFirst() {
Persona *P;
if (isThereNext()){
P = cursor->getPersona();
cursor = cursor->getSig();
return P;
... |
8d6a3d4be1094303de907941aa1eb7d55ea16c83 | 76660fd06ce7666c9cc3ea715f468c4304acb5f4 | cmstas/StopAnalysis2015 | /StopBabyMaker/LeptonTree.cc | C++ | cc | 13,704 | no_license | #include "LeptonTree.h"
#include <algorithm>
#include <cmath>
#include "Math/GenVector/PtEtaPhiE4D.h"
#include "CMS3.h"
#include "ElectronSelections.h"
#include "MuonSelections.h"
#include "MCSelections.h"
#include "VertexSelections.h"
#include "StopSelections.h"
#include "IsolationTools.h"
#include "MCSelections.h"
L... |
c07b748d031ef79a0c3ca97d203c6c1e388f435c | 6038cd1152f51902cfa755b5cf3068daa6f2ac05 | HugoTian/EECS482-OS | /race-condition-examples/randomdelay.cpp | C++ | cpp | 412 | no_license | /*
* Author: Atul Prakash, Department of EECS, University of Michigan, Ann Arbor, MI 48109
* copyright (c) 2006 Atul Prakash
*
*/
#include "randomdelay.h"
void randomdelay()
{
char val;
int fd = open("/dev/urandom" , O_RDONLY);
read(fd, &val, 1); // read a random byte into val
struct timespec sleeptime... |
3bc5a14f133c336ac0a27a7c451cafec5c41f9e7 | c9d06cd3b989ace3689bdc838f2daf83f3738b3b | achen889/Warlockery_Engine | /Engine/Renderer/Text/TextSystem.cpp | C++ | cpp | 42,795 | permissive | //==============================================================================================================
//TextSystem.cpp
//by Albert Chen Jun-16-2015.
//==============================================================================================================
#include "Engine\Renderer\Text\TextSystem.hpp"... |
44b53164aa0c80e4dff9f5cb884d1ca5dd8909cf | 0587e1a1bced1a299054f9478dd1dcd993a6e626 | fengjixuchui/hhvm | /third-party/thrift/src/thrift/compiler/compiler.cc | C++ | cc | 17,534 | permissive | /*
* Copyright (c) Meta Platforms, Inc. and affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by appl... |
dabfc7db3f69635304ea23409bf3dc29459fe231 | 27ffc5e68c14cb9516c91faf56f0449ecc38b13e | rdeiaco/leetcode | /bit_count.cpp | C++ | cpp | 352 | no_license | #include <vector>
class Solution {
public:
vector<int> countBits(int num) {
int i, j;
int count;
std::vector<int> result;
for (i = 0; i <= num; i++) {
count = 0;
for (j = 0; j < 32; j++) {
if ((i>>j) & 0x1) {
count++;
}
}
result.push_back(count);
... |
72f3277d87464c36b303a0aa4ed0d543b377d20f | ef912eff840fe2f2161864fef7e4065f85dfef09 | harishiyer9/DAA_LAB | /Lab1/Q1.cpp | C++ | cpp | 430 | no_license | #include<iostream>
#include<fstream>
#include<climits>
using namespace std;
int Find_Max(int arr[], int i, int n)
{
if(i == n-1) return arr[i];
else return max(arr[i], Find_Max(arr,i+1,n));
}
int main()
{
int n;
ifstream in;
in.open("input.txt");
in>>n;
int *a = new int[n];
for(int i=0; i<n;i++)
{
in>>a[i... |
c3cafd7310c4f320e79fee97b4bcb4d37ab3ea06 | fba13be50df8370bd3c8a26d83e00f11227d1317 | amir5200fx/Tonb | /include/Aft2d_tSegmentEdgeUniMetricFwd.hxx | C++ | hxx | 500 | no_license | #pragma once
#ifndef _Aft2d_tSegmentEdgeUniMetricFwd_Header
#define _Aft2d_tSegmentEdgeUniMetricFwd_Header
#include <Mesh_BndEdge_Position.hxx>
#include <Aft2d_tBndEdgeSurfaceUniMetricTraits.hxx>
namespace tnbLib
{
// Forward Declarations
template<class BndEdgeTraits, Mesh_BndEdge_Position POS>
class Mesh_TBndEdg... |
942bae6614f9143c29b14b9187b326c1623ad1cf | abe62a4402d9c3621f9c05b52436a01a71c1a96f | zeldaret/botw | /src/Game/AI/AI/aiNPCMove.cpp | C++ | cpp | 633 | no_license | #include "Game/AI/AI/aiNPCMove.h"
namespace uking::ai {
NPCMove::NPCMove(const InitArg& arg) : ksys::act::ai::Ai(arg) {}
NPCMove::~NPCMove() = default;
bool NPCMove::init_(sead::Heap* heap) {
return ksys::act::ai::Ai::init_(heap);
}
void NPCMove::enter_(ksys::act::ai::InlineParamPack* params) {
ksys::act::... |
cb26013cb9b9daf14e009e211864333e4cf7979b | c26caa81c79fd8674c948cf3b36253114d37b781 | sawy3r11/Space_Shooter-REVENGE | /Space_Shooter REVENGE/StartScreen.cpp | C++ | cpp | 1,897 | no_license | #include "StartScreen.h"
#include<iostream>
StartScreen::StartScreen()
{
if (!backgoundTexture.loadFromFile("..\\\\sprite\\startowaStrona.png"))
std::cout << "Nie wczytano textury startPage!!!";
else {
backgroundSprite.setTextureRect(sf::IntRect(0,0, 480, 800));
backgroundSprite.setTexture(backg... |
11a80e3226ead6016142cbdca796c3ff2803f58b | 2fa2b821b4eb427a4c6601b3bd39dd1892f4147c | dlaststark/machine-learning-projects | /Programming Language Detection/Experiment-2/Dataset/Train/C++/concurrent-computing-1.cpp | C++ | cpp | 629 | no_license | #include <thread>
#include <iostream>
#include <vector>
#include <random>
#include <chrono>
int main()
{
std::random_device rd;
std::mt19937 eng(rd()); // mt19937 generator with a hardware random seed.
std::uniform_int_distribution<> dist(1,1000);
std::vector<std::thread> threads;
for(const auto& str: {"Enj... |
b2cf2003510b1987cdd62fcf6d42496e9e11907c | 0fc9fd06c7cd3a4d238a2efc75b37067f68eb029 | phrocker/nifi-minifi-cpp | /thirdparty/rocksdb/memtable/write_buffer_manager_test.cc | C++ | cc | 5,250 | permissive | // Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
// This source code is licensed under both the GPLv2 (found in the
// COPYING file in the root directory) and Apache 2.0 License
// (found in the LICENSE.Apache file in the root directory).
//
// Copyright (c) 2011 The LevelDB Authors. All rights r... |
0ad2a718b22a40d622852715d4937b92f790db2f | 80d6517ebf522d12b4b43381416bd1881ec5f396 | obrusvit/ppp_stroustrup | /chap17to21_data_algo/ex_19_1to2.cpp | C++ | cpp | 1,932 | no_license | #include <iostream>
#include <stdexcept>
#include <vector>
//#include "ex_19_1to2.hpp"
#include "catch.hpp"
using namespace std;
//------------------------------------------------------------------------------
template<typename T> //requires Number<T>()
void f(std::vector<T>& v1, const std::vector<T>& v2)
{
for... |
d6583ae844e0993f78a5263441fef4d6b806e46c | 423ba6fe9f710673fad3be80e26d6854c53de7a5 | KinglittleQ/cs144 | /tests/fsm_reorder.cc | C++ | cc | 5,421 | no_license | #include "tcp_config.hh"
#include "tcp_expectation.hh"
#include "tcp_fsm_test_harness.hh"
#include "tcp_header.hh"
#include "tcp_segment.hh"
#include "test_err_if.hh"
#include "util.hh"
#include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <exception>
#include <iostream>
#include <stdexcept>
#include <st... |
bee73f7a569480f98342273ae226734e0f480acb | 79e9adbb870af131d0145cbb7b0bc8fb63511f49 | Sudo248/Algorithm | /kiemtrachutrinh.cpp | C++ | cpp | 1,302 | no_license | #include<bits/stdc++.h>
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
using namespace std;
typedef long long ll;
vector<vector<int> >G;
vector<bool>check;
vector<int> pre;
bool hasCycle;
void BFS(int u){
queue<pair<int,int> > q;
q.push({u,0});
while (!q.empty())
... |
131175bb9face1edf2b1f9e406b48d4e9d2ec4e6 | bee0bf00bc4332c5595a9c0d2875912b0226f184 | LukMRVC/Sorts | /main.cpp | C++ | cpp | 998 | no_license | #include <iostream>
#include <functional>
#include <thread>
#include "sorts.cpp"
#include <ctime>
#include <cstdlib>
int main() {
std::cout << "Hello, World!" << std::endl;
srand(time(nullptr));
const int N = 10;
int * arr = new int[N];
for (int i = 0; i < N; ++i)
arr[i] = rand() % 100;
... |
4e6af9885ec3209d45630a36719d544bf5c04ead | 1602994b9b7d39690ca5d117897ebe35dd54490d | MrCanadianMenace/Capstone | /hardware/butterfly_sum/Vsim/VTest.cpp | C++ | cpp | 3,751 | permissive | #include <stdlib.h>
#include <iostream>
#include "Vbutterfly_sum_helper.h"
#include "verilated.h"
#include "testbench.hpp"
#include "fixed_point.h"
int main(int argc, char **argv) {
// Initialize Verliators variables
Verilated::commandArgs(argc, argv);
// Create an instance of our module under test
... |
8f14b9043bb165df2a82e4afff084f2c271550ba | 09ffa83fd1d3df8bcea2c6b83c75476d1277b495 | IshrakAbedin/RailCannon | /RailCannon/src/Renderer.cpp | C++ | cpp | 1,136 | no_license | #include "Renderer.h"
#include <iostream>
void GLClearError()
{
while (glGetError() != GL_NO_ERROR);
}
bool GLLogCall(const char* function, const char* file, int line)
{
while (GLenum error = glGetError()) {
std::cout << "[OpenGL Error] (" << error << "): " << function << ": " << file << ": " << line << std::en... |
69fece3e0a32634ffb62b89bd6cd88cc4e4c7004 | d09b1b3149d2292247d3016be57f215a52d654c0 | junkkerrigan/algorithmics | /dijkstra-algorithm/2267.cpp | C++ | cpp | 8,402 | no_license | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define DELETED -1
#define WHITE 0
#define GREY 1
#define BLACK 2
#define RED 3
#define BLUE 4
#define MAX_INT 2147483647
struct Route {
int color;
unsigned int to, length;
Route(unsigned int to, unsigned int lengt... |
60a7e4b1afea75f2fcaf73994e6dd7c55ba3cb50 | df7207746d2254dc9ee53a291bce4fa05c8a69bf | splendideXmendax/- | /C++/Test/03第三题栈变队列.cpp | C++ | cpp | 1,568 | no_license | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<stack>
using namespace std;
class Queue
{
private:
stack<int> s1;
stack<int> s2;
public:
//入队
void Push(const int& val);
//出队
void Pop();
//返回队首元素
int& Front();
//返回队尾元素
int& Bac... |
4c34433411b2cb2d0f206be62fb4f452ed95d92b | 2ce62fbb943ab1d45355cd0b8f9ca2431ef03c5d | dragonir/Sicily | /选择法排序算法实现.cpp | C++ | cpp | 484 | no_license | #include <iostream>
using namespace std;
int main ()
{
cout<<"请输入10个整数"<<endl;
int ia[10];
for (int i=0;i<10;i++)
cin>>ia[i];
cout<<"下面对10个数字进行从小到大的排列"<<endl;
for(int m=0;m<9;m++)
{
for(int n=m+1;n<10;n++)
{
if(ia[m]>ia[n])
{
int nTemp =ia[m];
ia[m]=ia[n];
ia[n]=nTemp;
}
}
}
c... |
9221e2381f0303014b33bb534fdb33babba3f5b6 | 557d4bda4b93ef1b3f27893057298535a49dca95 | microsoft/spatialaudio-unity | /Source/Spatializer/SpatializerMixerPlugin.cpp | C++ | cpp | 5,285 | permissive | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
// Please note that this will only work on Unity 5.2 or higher.
#include "AudioPluginUtil.h"
#include "HrtfWrapper.h"
#include "vectormath.h"
#include "mathutility.h"
#include <cstring>
namespace SpatializerMixer
{
st... |
015201dcc323422e2e0d337e8a90a71fe87c7b96 | 615861b63ade4b138ae7a5b9863f162f72a76c1f | johnchaussard/skeletor | /src/com/cca_keepfaces.cxx | C++ | cxx | 926 | no_license | /*Les librairies standardes*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
//Patch des types
#include <patch_types.h>
/*Les bibliotheques de PINK*/
#include <mcimage.h>
#include <mccodimage.h>
//Bibliotheque perso
#include <libcomplex.h>
#define USAGE "<in.cc> <out.cc>"
int32_t main(int argc, char* ... |
262f3062a14166a23f73b5e24e7f9d6a6276f771 | 56b34524ccdfc5d1c41551c7b109d97f3d5b1848 | vedsarkushwaha/code | /codechef/may16/CHBLLS_combi.cpp | C++ | cpp | 755 | no_license | #include <cstdio>
#include <cassert>
#include <ctime>
#include <cstdlib>
#define fr(i,m,n) for(i=m;i<n;i++)
#define ifr(i,m,n) for(i=m;i>n;i--)
#define ll long long
#define sc scanf
#define pf printf
#define var(x) x i=0,j=0,k=0,tmp1=0,tmp2=0,tmp3=0,tmp=0,tmp4=0,tmp5=0,flag=0,T=0,N=0,Q=0
#define pb push_back
#define v... |
773050b238abd4f96719cf6cf6daec9faa8deacd | 7a30400308263db761b788b95585e7ce4f7809a1 | dwywdo/PS | /BFS/숨바꼭질 3/13549_solution.cpp | C++ | cpp | 1,009 | no_license | #include <iostream>
#include <queue>
using namespace std;
bool visited[1000001];
int d[1000001];
int MAX = 1000000;
int main(){
int N, M;
cin >> N >> M;
visited[N] = true; d[N] = 0;
queue<int> q;
queue<int> nq;
q.push(N);
while(!q.empty()){
int now = q.front(); q.pop();
if(no... |
84403bd7455e34a2c6e2156993f3d633e7630db6 | a2f7b5948df861669faa35f5ce54d7f18996a618 | tuandat64/rpw | /C++/Examples/XML/DOM/dynamDOM/dynamDOM.cpp | C++ | cpp | 8,808 | no_license | #include "stdafx.h"
#include <stdio.h> // DynamDOM.cpp : Defines the entry point for the console application. //Create an XML Document Dynamically (C-C++) @ https://msdn.microsoft.com/en-us/library/ms767611(v=vs.85).aspx
#include <tchar.h>
#include <msxml6.h>
// Macro that calls a COM method returning HRESULT value.
#... |
2ae2063553e40a61bcba3319945087775d3909ee | 929dc065809fbe580dd4c27fed3204a53ad63788 | ordinary-developer/education | /cpp/std-11/b_sutherland-cpp_recipes/ch_08-the_stl_algorithms/recipe_8_03-finding_the_maximum_and_minimum_values/03-using_a_separate_function_with_min_element/main.cpp | C++ | cpp | 734 | permissive | #include <algorithm>
#include <iostream>
#include <vector>
class MyClass {
public:
MyClass(const int value) : m_Value{ value } { }
int GetValue() const { return m_Value; }
private:
int m_Value;
};
bool CompareMyClasses(MyClass const& left, MyClass const& right) {
return left.Get... |
33bc0445cccdc07a562d1db9ed7c924bf44ae172 | aa1cc16b6159eda7be9aed26cb20018299435d18 | Noymul-Islam/problems | /Il Gioco dell'X 2.cpp | C++ | cpp | 1,425 | no_license | #include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
void dfs (int i, int j);
int color[205][205],r,cases=1,p,k;
char ch[205][205];
int main()
{
while(scanf("%d",&r)==1)
{
if(r==0)
break;
memset(color,0,sizeof(color));
p=0;
... |
f77926ce7907f33d9ec6e8f8b5f94ca9f8eb3b25 | 51da33e9b99538e1100edf3da59e215fec018857 | kuroni/Competitive-Programming | /Biblioteca/Unfinished/CHTree.cpp | C++ | cpp | 2,832 | no_license | #include <vector>
#include <algorithm>
// this CHT is for min!
const long double INF = 2e9;
typedef long long T;
struct Line {
T a, b; // y = a * x + b
Line(T a = 0, T b = 0) : a(a), b(b) {}
long double inter(Line o) {
// a * x + b = o.a * x + o.b
// x = (o.b - b) / (a - o.a)
return (o.b - b) / (long doubl... |
4b48f4e43fa43e915579d9491ea2889b8709af38 | bd006b63cd8dcc6cb37571a9585817a236058f86 | vv1133/mintdb | /src/include/ossMmapFile.hpp | C++ | hpp | 1,406 | no_license | #ifndef __OSSMMAPFILE_HPP_
#define __OSSMMAPFILE_HPP_
#include "core.hpp"
#include "ossLatch.hpp"
#include "ossPrimitiveFileOp.hpp"
class _ossMmapFile
{
protected :
class _ossMmapSegment
{
public :
void *_ptr ;
unsigned int _length ;
unsigned long long _offset ;
_ossMmapSegment ... |
ab29f731a3722453b413cd91460c77dbcde7f93d | 2119de2cb1ce2e02169bde12a2a38792a734cbf8 | codeAligned/acm-icpc-1 | /archived/COOK59/ANKNIM2.cc | C++ | cc | 2,892 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MAXN = 1 << 20;
namespace FFT {
typedef double flt;
struct Complex {
flt x, y;
Complex() {}
Complex(flt x, flt y): x(x), y(y) {}
Complex operator + (const Complex &r) const {
return Compl... |
b29af0179c7a137730ab7c68dc0e0ac6bbf05edd | 78e8c0d216e657c55c1a9a7bbf91675a8fcbbbad | CS17B023/Leetcode-Solutions | /Linked List/Add Two Numbers.cpp | C++ | cpp | 3,304 | no_license | // You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
// You may assume the two numbers do not contain any leading zero, except the number 0 itself.
... |
c6edf4d4697babbddafc6c30bf6d8b86c8716d09 | 3e4be55f934e88f77961c88bb88db7509a5df9a2 | feserr/bgfx | /3rdparty/spirv-tools/test/opt/generate_webgpu_initializers_test.cpp | C++ | cpp | 14,157 | permissive | // Copyright (c) 2019 Google 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 agreed to... |
ec37e8b16d17db50e22750949a20a9ce35ecf7fc | f3e912251fc35a209b2d99ca0e2eb77877f34e08 | ictlyh/LeetCode | /剑指Offer/最小的k个数.cc | C++ | cc | 1,029 | no_license | class Solution {
public:
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
if (input.size() < k) return vector<int>();
sort(input.begin(), input.end());
return vector<int>(input.begin(), input.begin() + k);
}
};
// 超时，为什么？
class Solution {
public:
vector<int> GetLeastNu... |
a2f6384c41d63d513584142c06bfbbebc6eb0be5 | 187527aae02ff78bef6f0688c7f8ddd296b76e6f | drw0if/FdP | /6/6.2.cpp | C++ | cpp | 384 | no_license | #include <iostream>
using namespace std;
int posMinimo(const double v[], int n){
int ans = 0;
for(int i = 0; i < n; i++)
if(v[ans] > v[i]) ans = i;
return ans;
}
int main(){
double v[] = {1.3, 4.5, 2.4, 8.4, -3.14, -3.14};
int n = sizeof(v)/sizeof(v[0]);
cout << "La posizione del primo minimo all'inter... |
edbab8c61c4f17a1cf9a8097aa63c300d69fc277 | b8ae152f8da3b2599a5799d6846e6e7cbb77282c | Januce/qlcplus | /qmlui/app.cpp | C++ | cpp | 13,667 | permissive | /*
Q Light Controller Plus
app.cpp
Copyright (c) Massimo Callegari
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.txt
Unless requir... |
85ee1f43a14c0e807c9fa75e0862972304736fc0 | 6728ba933009afe76122fe3b9a1f6ac119ed8f10 | lifestyletoken/LST | /src/LST/unity/app.cpp | C++ | cpp | 1,407 | no_license | //------------------------------------------------------------------------------
/*
This file is part of skywelld: https://github.com/skywell/skywelld
Copyright (c) 2012, 2013 Skywell Labs Inc.
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is her... |
397430733f326aa92e79bf2db8486e9059531f92 | 5c04f7e42c29f5525f1951a1c98a1e9fff116cf9 | janlt/daqdb | /lib/spdk/SpdkRAID0Bdev.cpp | C++ | cpp | 1,512 | permissive | /**
* Copyright (c) 2019 Intel Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or... |
5e850ac9bd926bafe4bc351a9b4f70368c3f0d7e | 32ea15375d4d3c87849fd1f9d53e9eb28b7bd2bf | iseeyo/src | /third_party/dawn/src/tests/unittests/validation/IndexBufferValidationTests.cpp | C++ | cpp | 3,674 | permissive | // Copyright 2020 The Dawn 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 agreed t... |
cee5350eb581ae65fbdf9c2ded3266beeed53c91 | 75e00e50679a9336ab667ef61e35651fad62b80e | brunolauze/openpegasus-providers | /src/Providers/UNIXProviders/DoorAccessToDevice/UNIX_DoorAccessToDevice_TRU64.hxx | C++ | hxx | 1,821 | permissive | //%LICENSE////////////////////////////////////////////////////////////////
//
// Licensed to The Open Group (TOG) under one or more contributor license
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with
// this work for additional information regarding copyright ownership.
// Each contributor lice... |
8ca8ca213497248aa2d1b51c4e354b2422c45ac5 | 77d985440943f9d336e43847744bb5b08e42a623 | inbei/libutl | /ucc/DequeIt.cpp | C++ | cpp | 5,218 | permissive | #include <libutl/libutl.h>
#include <libutl/Deque.h>
#include <libutl/MaxObject.h>
////////////////////////////////////////////////////////////////////////////////////////////////////
#define BLOCK_SIZE 1024
////////////////////////////////////////////////////////////////////////////////////////////////////
UTL_CLA... |
bb35c4e9699ef9d41c43b0e0c4f8590e89ff33bf | d9a76827ab2e7e2d27153578af3ab8ddb6309a45 | jjocram/sydevs | /src/sydevs/systems/data_mode.cpp | C++ | cpp | 814 | permissive | #include <sydevs/systems/data_mode.h>
#include <array>
#include <algorithm>
namespace sydevs {
namespace systems {
const std::array<data_mode, 2> data_modes = {
data_mode::flow,
data_mode::message,
};
const std::array<std::string, 11> data_mode_strings = {
"flow",
"message",
};
const std::str... |
15cc5d627fa2e1ea52451fcaf1fea730fc557672 | 1a9b1abda7000f993bba1c06469de8d19a367c97 | kmjp/procon | /codeforce/edu/021-040/023/a.cpp | C++ | cpp | 977 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#... |
22b60f39b9ff8d65c1d6468e78434e8dca3bb439 | f98f39c00f5c03149ff60e61933415dc993c639d | robertsj/libdetran | /src/geometry/Core.cc | C++ | cc | 5,317 | permissive | //----------------------------------*-C++-*----------------------------------//
/**
* @file Core.cc
* @brief Core class member definitions
* @note Copyright (C) 2013 Jeremy Roberts
*/
//---------------------------------------------------------------------------//
#include "Core.hh"
#include <cmath>
#include <... |
ac77cc9342f219fd23d9c3db5cb2c7b34249bb8b | b0860d488ef8ba9341facf3a35d9fde69a3149e5 | rhaas80/Triton | /Utilities/LUDecomposition.hpp | C++ | hpp | 466 | no_license | #ifndef LUDECOMPOSITION_HPP
#define LUDECOMPOSITION_HPP
#include "NumericalRecipes.hpp"
namespace WaveformUtilities {
struct LUdcmp {
Int n;
MatDoub lu;
VecInt indx;
Doub d;
LUdcmp(MatDoub_I &a);
void solve(VecDoub_I &b, VecDoub_O &x);
void solve(MatDoub_I &b, MatDoub_O &x);
void in... |
2703d195b8d194d0c83d691fe2ebc7fafc2d9ac3 | eb5ae44ca525a1fd922ca472ded413129e608ede | abhicse32/4th-Sem-Programming-Lab | /div_mul/double_linked_list.cpp | C++ | cpp | 1,937 | no_license | using namespace std;
typedef struct linked_list list;
struct linked_list{
list* rear;
int data;
list* front;
};
/********************************************************************
* add_node is a function that adds digit to the list.
* Arguments : list* and digit to be added.
* It returns llis... |
2e177aa376735088634fbf31bd274dd4ee7a8d69 | 6ed2805c219f43bac5b8b1afe71f069be0c55d51 | YiYang56/data-structure | /顺序表倒置.cpp | C++ | cpp | 1,028 | no_license | //顺序表逆置.cpp
#include<stdio.h>
#include<malloc.h>
typedef char datatype;
const int maxsize=1024;
typedef struct
{ datatype data[maxsize];
int last;
}sequenlist;
sequenlist*InitList;
void create(sequenlist*&);
void print(sequenlist*);
void invert(sequenlist*);
int main()
{
sequenlist*L;
create(L);//... |
087cc4bef8d4141b649e65b280297ac38a379b77 | b97216225f30c0f0ba14d6514cc6a5dc572af0d8 | huahsing/median | /median_cpplist.cpp | C++ | cpp | 2,671 | no_license | #include "median_list.h"
#ifdef CPP_LIST
unsigned long int MedianList::insert(unsigned long int value)
{
#if ENABLE_DEBUG
cout << "====================\ndebug: inserting " << value << endl;
#endif
if(iList.size() > 0)
{
// we need to determine the insertion position
// the lo... |
3eb596aaa5d0361ac0c66666380306bff24c6494 | a23c926a344dbd869e6c57ffe9bb852bdcc474e7 | UPO33/UEngine | /Src/Editor/DebugHelpers.cpp | C++ | cpp | 623 | no_license | #include "EditorBase.h"
#include "../Core/Log.h"
#include "../Core/Meta.h"
void UPrintObjectClassHierarchy(Object* root, int indent /*= 0*/)
{
if (indent == 0)
ULOG_MESSAGE("==============================================");
ULOG_MESSAGE("% Object [%] Class [%]", LogIndent(indent), root->GetName(), root->GetClass(... |
d1203ab44781aae055c362a398fdb8dfb67c3fd9 | 16dc07b6620636d57ab7c19e329a8e300509123f | ivopisarovic/Timer | /Event.cpp | C++ | cpp | 1,640 | no_license | /*
* 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 distributed in the... |
0fdc9c426bc064c48259ed1a842c965cddfe57a4 | 92693083621947fc365d4691b2bb91a77661c5fd | betwo/csapex | /src/csapex_core/src/msg/no_message.cpp | C++ | cpp | 966 | permissive | /// HEADER
#include <csapex/msg/no_message.h>
/// PROJECT
#include <csapex/utility/register_msg.h>
CSAPEX_REGISTER_MESSAGE(csapex::connection_types::NoMessage)
using namespace csapex;
using namespace connection_types;
NoMessage::NoMessage() : MarkerMessage(type<NoMessage>::name(), 0)
{
}
void NoMessage::serialize(... |
3713861b1ca8a5698afa3a17bf3918714efe2e10 | 4dc350111809ad271d6ba8860600a362fb019d2c | xinzhou1006/CPP-Library | /WayPoint.hpp | C++ | hpp | 2,526 | no_license | #ifndef ASU_WAYPOINT
#define ASU_WAYPOINT
#include<cmath>
#include<Lon2180.hpp>
/**************************************************************
* This C++ template returns the geographic location (waypiont,
* in longitude and latitude) if one start from (lon,lat),
* walk along the great circle path (initial azimu... |
9db1857465ececf2b15065fa3f5bc074039fd1f9 | 6d0948e47a0ef7c8afe2906a8de68840edb6f1ac | paulrishav93/Programs | /Programs-master/test/main.cpp | C++ | cpp | 991 | no_license | #include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int i)
{
if(i==0 || i==1) return false;
if(i==2) return true;
int m=sqrt(i);
for(int j=3; j<=m; j+=2)
if(i%j==0) return false;
return true;
}
int main()
{
bool *a=new bool[40];
for(int i... |
342f4ae2d5747b740b0ef9c236884610965a0bb0 | d0b3663cba5798a31938551d1cbccbc5d4bccf64 | yeomann/GapLocker | /GapLocker/GapLocker.cpp | C++ | cpp | 1,113 | no_license | //| Take -------- MT5 & MT4 plugins, applications, and services
//| profit ------ for medium-sized brokers.
//| techno ------
//| logy -------- www.takeprofit.technology
//|
//| This product was developed by Takeprofit Technology.
//| All rights reserved. Distribution and use of this file is prohibited ... |
1406e4a5ae5206c2947890b75efb734f19b792e3 | 1d246ca0f54d8d4ab1da2d9f5d21510f26192605 | superllout/easywow | /src/scripts/QuestScripts/Zones/Quest_Feralas.cpp | C++ | cpp | 2,362 | no_license | /*
* EasyWoW for ArcEmu MMORPG Server
* Copyright (C) 2014 EasyWoW Team <http://github.com/EasyWoW>
*
* 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 3 of the License, or
*... |
6f69e8c67aea4d6af776157f4ff158aaa85e7e0b | 28f3b2d192d71f171658eb69f73e22c15fb2dfa8 | djpnewton/sdk | /runtime/vm/compiler/backend/range_analysis.cc | C++ | cc | 107,261 | permissive | // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
#if !defined(DART_PRECOMPILED_RUNTIME)
#include "vm/compiler/backend/range_analysis.h"
#include "vm/b... |
65b2d2ddb14bfaa2d7e8541ab77014d11de0ddfb | fce9252dda15bdf7f0f9fe84ab34603e73b74842 | nnuila115/EE553 | /HWEE553/matrixhw.cpp | C++ | cpp | 711 | no_license | #include <iostream>
#include <cstring>
using namespace std;
class BadSize{
private:
int linenum;
const string filename;
public:
BadSize(int linenu, const char filename[]) : linenum(linenum), filename(filename){}
friend ostream& oeprator <<(ostream& s, const BadSize& e){
return s << "BadSize at" << e.filen... |
dac2b44482bda12c75642d6355afb85a33f75e19 | ecc9f19ba737c1ade41e79846ecfd96409ba978f | navarroruben/FastLane | /FastLane/DOT Common Carrier Framework/stester.cpp | C++ | cpp | 3,061 | no_license | /*
shapetester.cpp
Chris Lacher
02/07/17
Test harness for the shape object hierarchy:
0 - Shape
1 - Box
2 - Cylinder
3 - Rectangle
*/
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <shapes.h>
int main(int argc, char* argv[])
{
... |
a5f18e50f65455969e7c29e4cee27a9a286eb61e | 05d35ee2d62d97fe111ecf1c045cf4f904b03ae4 | FINALFINANCE/xnode | /src/qt/xnode/addresseswidget.cpp | C++ | cpp | 10,681 | permissive | //Copyright (c) 2019-2020 The PIVX developers
//Copyright (c) 2020 The xnode developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "qt/xnode/addresseswidget.h"
#include "qt/xnode/forms/ui_addresseswidget.h"
#includ... |
761a7959d8bbf5e36c700bf4b80adff60430c527 | be1f0a72a5a10e70537b6edaec7d2e2e0cea5fe7 | vladopp/Algo-1 | /week2/3-Quadruplets/quadruplets.cpp | C++ | cpp | 1,103 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int zero_quadruplets_count(vector<int>& a,vector<int>& b,vector<int>& c,vector<int>& d)
{
int cnt = 0;
vector<int> perm;
for(int i=0; i<a.size(); i++)
{
for(int j=0; j<b.size(); j++)
{
... |
ecb53bff65df7d3cb9af55ba3ba8de09afc80da8 | 95b6df0f4616e0fa6bb1e8d1d2c888c1ee9d3701 | aaravrav142/MILES | /MILES/Reader/src/NodeList.cpp | C++ | cpp | 6,149 | no_license |
#include <NodeList.h>
#include <Node.h>
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
//Normalize all the nodes in the nodelist
void NodeList::NormalizeAll(){
for(int x=0;x<this->nodeCount;x++){
this->list[x].Normalize();
}
}
//Sort the MACs of ... |
2e8bc1e183e68459d4e631c52752f773c64a08b7 | 768d8feda0ab25bf5893af2ea4ea8d7d2ef96c6a | slavo3dev/mimicoin24 | /mimicoin24/src/qt/utilitydialog.cpp | C++ | cpp | 7,200 | permissive | // Copyright (c) 2011-2016 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H)
#include "config/bitcoin-config.h"
#endif
#include "utilitydialog.h"
#include "ui_helpmessagedia... |
bce8bbcbc131bc62af255506be0549bbc1b78fc6 | d01aae854b71daf49614654f8a47970d9b762dd0 | JGCRI/gcam-core | /cvs/objects/solution/util/source/unsolved_solution_info_filter.cpp | C++ | cpp | 2,389 | permissive | /*
* LEGAL NOTICE
* This computer software was prepared by Battelle Memorial Institute,
* hereinafter the Contractor, under Contract No. DE-AC05-76RL0 1830
* with the Department of Energy (DOE). NEITHER THE GOVERNMENT NOR THE
* CONTRACTOR MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY
* LIABILITY FOR THE USE OF... |
41f386f9d5c8227421f5ed8ba018bd7c5d156b9b | 999eb30be9e58dac0a48dad090208f1dc2c90919 | cristina-serban/slcomp-parser | /exec/execution_settings.cpp | C++ | cpp | 865 | no_license | #include "execution_settings.h"
using namespace std;
using namespace slcompparser;
using namespace smtlib;
using namespace smtlib::ast;
ExecutionSettings::ExecutionSettings()
: coreTheoryEnabled(true)
, inputMethod(INPUT_NONE) {}
ExecutionSettings::ExecutionSettings(const ExecutionSettingsPtr& settin... |
aa8316895954873ae58665437598f0994199f1a1 | ff4f2fd81ee674259da101fab67147de7e354b7d | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-appmesh/source/model/Listener.cpp | C++ | cpp | 2,544 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/appmesh/model/Listener.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws
{
namespace Ap... |
f936eacd85340e7f7b85a9234c6b17df14afc680 | 2e1f0e94df78a75212190152ae4e79a3aa1ef531 | dreamboy9/fuchsia | /zircon/system/utest/fidl-compiler/resource_tests.cc | C++ | cc | 3,166 | permissive | // Copyright 2020 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <fidl/flat_ast.h>
#include <fidl/lexer.h>
#include <fidl/names.h>
#include <fidl/parser.h>
#include <fidl/source_file.h>
#include <zxtest/zxtest.h... |
bec9843b3a4bc569a53612582c779e0e5ceb0c6d | 76888bbb7b9368e0f2b3b6886c09ec85c49c9ea4 | sauravmohapatra/wxWidgets | /src/osx/carbon/font.cpp | C++ | cpp | 34,271 | no_license | /////////////////////////////////////////////////////////////////////////////
// Name: src/osx/carbon/font.cpp
// Purpose: wxFont class
// Author: Stefan Csomor
// Modified by:
// Created: 1998-01-01
// Copyright: (c) Stefan Csomor
// Licence: wxWindows licence
////////////////////////////////... |
ad1caada0f510f7c0f9de3534cec45909aa4254d | eb6b7364c0b90c902518895ade1872c8b4e1dd66 | ThomasDHZ/VulkanGraphics | /VulkanGraphics/SkyBoxPipeline.cpp | C++ | cpp | 7,504 | no_license | #include "SkyBoxPipeline.h"
#include <array>
#include "Mesh.h"
#include "SkyboxMesh.h"
#include "Vertex.h"
SkyBoxPipeline::SkyBoxPipeline() : GraphicsPipeline()
{
}
SkyBoxPipeline::SkyBoxPipeline(VulkanEngine& renderer, const VkRenderPass& renderPass) : GraphicsPipeline(renderer)
{
CreateDescriptorSetLayout(renderer... |
d2e8b9042ce0f3b9b9bbe5d94e792dc0f96cbc96 | 9f6c42a2c689b63b8a841f27399bbcb991de3042 | Ta-2/measures_to_get_high_score_Atcoder | /technique/algorithm/other/Sort_algorithm/headers/output/Intro.hpp | C++ | hpp | 796 | no_license | /**
* ※このファイル単体では動作しません。Sort.cppにincludeして使用してください。
*/
#pragma once
/*-----------------------------------------------------------*/
// std::cout << "[INIT DATA]" << '\n';
// // 初期データの表示
// Sort.showArray(vec8.begin(), vec8.end());
// std::cout << '\n' << '\n';
// std::cout << "[INTRO SORT]" << '... |
3bbe02c5f31d24326574b8c88a83fcedf7ad1b27 | 8293b5a2b67985be3f3adce40c38be9cc097c4f4 | windystrife/UnrealEngine_NVIDIAGameWorks | /Engine/Source/ThirdParty/IntelTBB/IntelTBB-4.0/src/old/concurrent_vector_v2.cpp | C++ | cpp | 10,668 | permissive | /*
Copyright 2005-2012 Intel Corporation. All Rights Reserved.
The source code contained or described herein and all documents related
to the source code ("Material") are owned by Intel Corporation or its
suppliers or licensors. Title to the Material remains with Intel
Corporation or its supplier... |
76b885ffbc470834ed14185a98bb61b3e19de8f2 | 0209bdfd2ff68319c6ee1202fd736ae8656cb21f | kontodimas/inet-hnrl | /src/networklayer/queue/DropTailRRVLANTBFQueue2.cc | C++ | cc | 11,611 | no_license | //
// Copyright (C) 2014 Kyeong Soo (Joseph) Kim
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// Thi... |
051513a7a943978b1b8a1275a2775cc4919bf5c9 | 94f576ba15e27061a320620804af8573c4aca997 | iCodeIN/Competitive-Programming-4 | /02 CONTESTS/Codeforces/673B/E.cpp | C++ | cpp | 2,047 | no_license | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define INF (int) 9e18
#define HELL (int) (1e9 + 7)
#define int long long
#define double long double
#define uint unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fs first
#define sc second
#define size(aa) (int) aa.size()
#defin... |
1f803a95f47ca6d3e5d9f68b7cfe00f5289e9221 | 51070280f9d73579a9ea544f71fda8c3cd3ad264 | Blackstate/Sot-SDK | /SDK/bsp_sea_rock_cluster_e_functions.cpp | C++ | cpp | 892 | no_license | // Name: SoT, Version: 2.1.0.1
#include "../SDK.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//----------------------------------------------------... |
a0112bd826478f9b06a320d03f124d4dbe6f13ef | 97de05ae873a0dca3badee3c3e4eda1dc1410290 | ccicconetti/serverlessonedge | /Test/testedgecontrollerhier.cpp | C++ | cpp | 14,808 | permissive | /*
__ __ __
|__|__| | __
| | | ||__|
___ ___ __ | | | |
| | | || | | | Ubiquitous Internet @ IIT-CNR
| | | || | | | C++ edge computing libraries and tools
|_______|__||__|__|__| https://github.com/ccicconetti/serverlessonedge
Licensed under t... |
eb5ff2085ea95ac24a8c5219ef8d11c8e502986e | d140498b99e0280ecafdfdd6d72080fc6917f0fa | naveenchopra9/uva | /315.cpp | C++ | cpp | 3,488 | no_license | //Two condition most be hold for articulation point in graph
// root vertex with two independent children in graph
// visited timevalue <=low timevalue of adj vertex
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#i... |
1e8835625fd6b6278522dfadb284b51d7ba61d32 | ce885a10bede17fadcecb3135521c8b02bbf3d4b | cowtony/ACM | /LeetCode/1400-1499/1429. First Unique Number.cpp | C++ | cpp | 735 | no_license | class FirstUnique {
public:
FirstUnique(vector<int>& nums) {
for (int num : nums) {
add(num);
}
}
int showFirstUnique() {
if (q.empty()) {
return -1;
} else {
return q.front();
}
}
void add(int valu... |
a6dff508d5a09c243f71fb668e7e016e0ac3f88e | a6e934d3c365975671debb172683a4ef3fe5fa93 | zliu72/amrex | /Tools/C_util/Convergence/RichardsonConvergenceTest.cpp | C++ | cpp | 15,150 | permissive |
#include <new>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
using std::ios;
#include <unistd.h>
#include <WritePlotFile.H>
#include <AMReX_REAL.H>
#include <AMReX_Box.H>
#include <AMReX_FArrayBox.H>
#include <AMReX_ParmParse.H>
#include <AMReX_ParallelDescriptor.H>
#include <AMReX_DataS... |
0c6eb7c7ab084ba9436b61b89f9dbd2b1a815e48 | 72acaad27b99787fc9f46c4ac2f1f6d4e5505150 | otcshare/chromium-src | /ash/quick_pair/common/pair_failure.cc | C++ | cc | 4,322 | permissive | // Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/quick_pair/common/pair_failure.h"
namespace ash {
namespace quick_pair {
std::ostream& operator<<(std::ostream& stream, PairFailure failure) {
switch (failure... |
2fcef296bf76886ae59c8005e278d3d6539a0e12 | b3b995948db5712bcbf80c1accb1b340df569022 | booqee/opencv | /modules/dnn/test/test_tf_importer.cpp | C++ | cpp | 11,425 | permissive | // This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
// Copyright (C) 2017, Intel Corporation, all rights reserved.
// Third party copyrights are property of their respective own... |
0ef01129beee530235415d18b15e9a3ad1bcab00 | eb4d7f4504ebf61ca9fb084f1d8e648c35da330d | Mancoi64/chromium | /chrome/browser/policy/test/promotional_tabs_enabled_policy_browsertest.cc | C++ | cc | 11,238 | 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 <vector>
#include "base/base_switches.h"
#include "base/files/file_path.h"
#include "base/files/file_util.h"
#include "base/json/json_writer.h"
... |
87b3537d2e16dc327d4938a21f5de99e6e771cd7 | a361c07ad9978ea7924fef5af62c12d7529a6687 | viktormalik/DynamicAnalyzer | /src/Analyzer/main.cpp | C++ | cpp | 999 | no_license | /*
* main.cpp
*
* Created on: Feb 14, 2014
* Author: viktor
*/
#include <string>
#include <iostream>
#include "Controller.h"
#include "Exceptions/ProtocolException.h"
#include "Exceptions/SocketException.h"
#include "Exceptions/ConfigurationException.h"
#include "Configuration.h"
int main(int argc, char *... |
1f273792867456af32389a3b5ef281b978148246 | 92c61f0f41b224d9f39e61b8669159cac403bf81 | svn2github/fs2open | /tags/fs2_open_3_6_10_RC1/code/controlconfig/controlsconfigcommon.cpp | C++ | cpp | 37,428 | no_license | /*
* Copyright (C) Volition, Inc. 1999. All rights reserved.
*
* All source code herein is the property of Volition, Inc. You may not sell
* or otherwise commercially exploit the source or things you created based on the
* source.
*
*/
/*
* $Logfile: /Freespace2/code/ControlConfig/ControlsConfigCommon.cpp $... |
6f2eb01feccdb9dc51096a0ac03f94441b8cd7fc | 56413de76ac9453f7232e7423c7d6adbb5af3d51 | dash-orlando/AugmentedStethoscope | /Software/Arduino/Stethoscope/Legacy/KorotkoffSound.cpp | C++ | cpp | 132,288 | no_license | // Audio data converted from WAV file by wav2sketch
#include "KorotkoffSound.h"
// Converted from KorotkoffSound.wav, using 44100 Hz, u-law encoding
const unsigned int KorotkoffSound[11873] = {
0x0100B974,0x15141514,0x15141414,0x15151515,0x16161516,0x16161616,0x17161716,0x18171816,
0x18181817,0x19181818,0x19191919,0x... |
852ef5dd96529ea51be6f610a27c82148951c428 | b4526ccedd7afd9629cd5e0e1d147d40d37f4807 | priyalbhatewara123/cpp-concepts | /Challenges - Arrays/maxCircularSum.cpp | C++ | cpp | 1,317 | no_license | /*
PROBLEM STATEMENT 3:
You are provided n numbers (both +ve and -ve). Numbers are arranged in a circular form.
You need to find the maximum sum of consecutive numbers.
Approach -
There are 2 possible case:
1. solution with wrap around property - inverte the array and then apply kadane's algo
2. solution without wrap ... |
a777023a6010b452953dbccc58b0e15d7f495758 | fe1146b2d07373bda5d0857510ca54e1bfb80039 | KPAdhikari/garfield | /Include/ViewGeometry.hh | C++ | hh | 1,017 | no_license | #ifndef G_VIEW_GEOMETRY
#define G_VIEW_GEOMETRY
#include <string>
#include <vector>
#include <memory>
#include <TCanvas.h>
#include <TGeoManager.h>
namespace Garfield {
class GeometrySimple;
/// Visualize a geometry defined using the "native" shapes.
class ViewGeometry {
public:
/// Constructor
ViewGeometry... |
e0e39c2cfd553a8bff80961dc6b6518000bb0c83 | 99a5088e9384457d62fcc97f743d66b40148c289 | sebuntin/cppstudy | /day35_多态/多态的概念/main.cpp | C++ | cpp | 661 | no_license | # include <iostream>
using namespace std;
class Animal
{
public:
virtual void speak()
{
cout << "Animal speak" << endl;
}
};
class Cat : public Animal
{
public:
void speak()
{
cout << "Cat speak" << endl;
}
};
class Dog : public Animal
{
public:
void speak()
{
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.