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 |
|---|---|---|---|---|---|---|---|---|
60fd7016d470c6a07341b0f09dbc92a3b2fd1566 | e285d0668fb41c9c50c3a689d590b361fce661cb | highfidelity/oglplus | /doc/quickbook/oglplus/quickref/enums/stencil_operation.hpp | C++ | hpp | 887 | permissive | // File doc/quickbook/oglplus/quickref/enums/stencil_operation.hpp
//
// Automatically generated file, DO NOT modify manually.
// Edit the source 'source/enums/oglplus/stencil_operation.txt'
// or the 'source/enums/make_enum.py' script instead.
//
// Copyright 2010-2015 Matus Chochlik.
// Distributed under the Bo... |
a6f70e24b757bf459998f02b09bfab7538645723 | 23502fa82b4ccf51ac67bb77a898e85340c934f7 | zgsxwsdxg/clDNN | /kernel_selector/core/kernel_selector.cpp | C++ | cpp | 4,591 | permissive | /*
// Copyright (c) 2016 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 o... |
eb2fca8e19c622e5f50108aa89cabc21c1e56229 | f17e4bb6fdd4a5b566f894603b5bbd881a09d5da | priestd09/SkyDolly | /src/Plugin/src/Export.cpp | C++ | cpp | 2,484 | permissive | /**
* Sky Dolly - The Black Sheep for your Flight Recordings
*
* Copyright (c) Oliver Knoll
* All rights reserved.
*
* MIT License
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this
* software and associated documentation files (the "Software"), to deal in the Software
* ... |
5724dc028766d8f20f54f2a69b658058aee61539 | e426f2deae7ce7afbc55cd56ddba1cbbccd0e048 | peplopez/El-Rayo-de-Zeus | /dependencies/boost/libs/unordered/test/exception/insert_exception_tests.cpp | C++ | cpp | 8,100 | permissive |
// Copyright 2006-2009 Daniel James.
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include "../helpers/prefix.hpp"
#include "./containers.hpp"
#include <string>
#include "../helpers/random_values.hpp"... |
14e97478885af50bc97a8b288adea6f7b2f38df3 | d3a89a849617161b27928bce0feed6fa0ced5925 | crazypeace/naiveproxy | /src/base/task/current_thread.cc | C++ | cc | 8,531 | permissive | // Copyright 2018 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 "base/task/current_thread.h"
#include "base/bind.h"
#include "base/callback.h"
#include "base/message_loop/message_pump_for_io.h"
#include "base... |
0aad903e4beb8935be4b98f556ac7ba7378efdaa | f0ee057b3809c5f56f704bc6785ed7f06d013c86 | allenck/DecoderPro_app | /libPr3/sprog/sprogmonframe.cpp | C++ | cpp | 1,570 | no_license | #include "sprogmonframe.h"
#include "loggerfactory.h"
#include "sprogreply.h"
using namespace Sprog;
/**
* Frame displaying (and logging) Sprog command messages
*
* @author Bob Jacobsen Copyright (C) 2001
*/
///*public*/ class SprogMonFrame extends jmri.jmrix.AbstractMonFrame implements SprogListener {
/*public... |
f2930fb92256ac125275e2791b3c4855cdb27762 | 31dd99607e996da473c437ad4360157ceca92b46 | ymd104/atcoder | /abc130e.cpp | C++ | cpp | 1,434 | no_license | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
/*
MODの扱い
・+=演算子は危険. 丁寧に書かないとたまに死ぬ.
・負になりうるものにMODを噛ませるのは危険. 謎に通らない時は引き算を含む式に一度MODを足してからMODをとる.
*/
void solve(){
ll n,m;
cin >... |
5f089d7090f183a99088fefa0bf9ac4d07e80555 | 7e4845a0d0701f1bef5cf72705411793f3fb9f65 | aqchin/wreckingball | /main.cpp | C++ | cpp | 8,216 | no_license | /*
* Credit for bullet engine physics tutorial to
* THECPLUSPLUSGUY @ https://www.youtube.com/watch?v=d7_lJJ_j2NE
*/
#include "main.h"
static int width = 800;
static int height = 600;
static bool m1_down = false;
static double rot_scale = 120.2;
Matrix4 m2w = *new Matrix4();
Vector3 v_prev, v_cur;
Physics phys... |
2efa2cb3ddecc6eae55dfb51d4fd0d55963a5482 | 11d2287da0f671d7c778cef26216c6469e537b83 | i-RIC/prepost-gui | /apps/rivmaker/data/crosssection/crosssectionpreprocessorcontroller.cpp | C++ | cpp | 4,515 | permissive | #include "crosssectionpreprocessorcontroller.h"
#include "../base/model.h"
#include "../base/view.h"
#include "../crosssections/crosssectionspreprocessorcontroller.h"
#include "../project/project.h"
#include "../../dialogs/coordinateseditdialog.h"
#include "../../window/preprocessor/preprocessormodel.h"
#include "priv... |
2d726cb797263b0c3283c3938539faaa7faecf1a | 515d72b443066dffaf2a08f72baf0e47e9bef4f5 | Jisean/SARProjectBackup | /SR팀플/Engine/Utility/Code/Layer.cpp | C++ | cpp | 3,302 | no_license | #include "Layer.h"
#include "component.h"
ENGINE::CLayer::CLayer(LPDIRECT3DDEVICE9 pDevice)
: m_pDevice(pDevice)
{
}
ENGINE::CLayer::~CLayer()
{
Release();
}
ENGINE::CLayer* ENGINE::CLayer::Create(LPDIRECT3DDEVICE9 pDevice)
{
return new CLayer(pDevice);
}
void ENGINE::CLayer::Update(void)
{
MAPOBJLIST::iterator ... |
ae6e88a797ce3f664df92a542d600a61aa515fcd | 02831abeb6bb35bb0b7946ef32c79f574f6dff06 | eddyxq/Operating-Systems | /Assignment 4/deadlock.cpp | C++ | cpp | 5,337 | no_license | #include <string.h>
#include <iostream>
#include <sstream>
#include <fstream>
#include <vector>
#include <unordered_map>
#include <set>
#include <list>
#include <algorithm>
using namespace std;
/**
* Assignment 4
* CPSC 457 - L01 - T05
* Eddy Qiang - 30058191
*/
//vector of all graphs
vector<vector<string> > ve... |
99a53563b7e52ebb230f08e842521d3ab1ae7552 | 08e199760a1a1c3b35db2290db5d13f0b5def6bc | pqrs-org/Karabiner-Elements | /src/vendor/cget/cget/pkg/chriskohlhoff__asio/install/include/asio/impl/spawn.hpp | C++ | hpp | 45,413 | permissive | //
// impl/spawn.hpp
// ~~~~~~~~~~~~~~
//
// Copyright (c) 2003-2023 Christopher M. Kohlhoff (chris at kohlhoff dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#ifndef ASIO_IMPL_SPAWN_HPP
#define ASI... |
2527000172e273236eb8e4b1d62988a2028fb64f | 47f7cb1cfa2e109dbcf20d2d9b5115654bb0d54a | soundestmammal/cpp | /cs120/InClass/Week3/Wednesday/Example6/main.cpp | C++ | cpp | 435 | no_license | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <fstream>
using namespace std;
int main() {
string friendName = "";
int counter = 0;
ofstream output;
output.open("friends.txt");
while (counter < 3) {
cout << "What is your friend's name? \n";
get... |
47c00f9fe8c76b846f1b24418120b79ee5edf80c | 699b82cb76566e97558a101f54138ebc755b4ceb | gregmedlock/roadrunnerwork | /Wrappers/C/rr_c_api.cpp | C++ | cpp | 70,525 | permissive | /**
* @file rr_c_api.cpp
* @brief roadRunner C API 2012
* @author Totte Karlsson & Herbert M Sauro
*
* <--------------------------------------------------------------
* This file is part of cRoadRunner.
* See http://code.google.com/p/roadrunnerwork/ for more details.
*
* Copyright (C) 2012
* Unive... |
741eed925b1a3f17b1d43f52a90e0c24aa6a1417 | 9f3613001e82f3cff174018126b0da4423a66e06 | ybkyozy/Direct3D11Demo | /MyDemo/27_MeshView/27_MeshView/Effects.cpp | C++ | cpp | 15,355 | no_license | #include "Effects.h"
#include <d3dcompiler.h>
Effect::Effect(ID3D11Device* device, const std::wstring& fileName)
{
DWORD shaderFlags = 0;
#if defined( DEBUG ) || defined( _DEBUG )
shaderFlags |= D3DCOMPILE_DEBUG;
shaderFlags |= D3DCOMPILE_SKIP_OPTIMIZATION;
#endif
ID3DBlob* compilationMsgs = 0;
HR(D3DX11CompileEf... |
58c2c0976ea0c02426843aeadec247572c608134 | 2b67f83e9da223f7c2b63dfce703b7e3adee0cea | naiyer-abbas/Code-Forces | /Problemset/469A - I Wanna Be the Guy.cpp | C++ | cpp | 1,078 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
int n, p, q;
cin >> n;
cin >> p;
vector <int> p_levels;
int temp;
for(int i = 0; i < p; i++)
{
cin >> temp;
p_levels.push_back(temp);
}
cin >> q;
v... |
664020c2b907d3d7688d6d6201407bd4f303fc3b | 05a1a88596cf25c74b58a6b18184f534bc253365 | A-men007/Covid_data_displayer | /Covid_data_displayer/record.cpp | C++ | cpp | 1,670 | no_license | #include <stdio.h>
#include <string>
#include <iostream>
#include <sstream>
#include "record.h"
using namespace std;
// Constructor; where the processing is done for each row/line in the csv file
Record::Record(string line) {
// Used to store the country name, since this value is a 'special case' (s... |
ea39ee94836f45a6077cff72f8c2ed57e6049cee | 3de90f67ff87262cc8f42e5ab65c117936a7a052 | MyNameIsKodak/nexuscheats | /utils/math.cpp | C++ | cpp | 20,360 | no_license | // This is an independent project of an individual developer. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++, C#, and Java: http://www.viva64.com
#include "math.hpp"
#define M_RADPI 57.295779513082f
namespace math
{
void normalize_angles(Vector& angles)
{
while (angles.x > 89.0f)
... |
aa2487406eb5c054d7cedfa083f69fdc9344cb33 | 744e9582ea7dce773b4a517d63764d125ad49c18 | rouol/LabGraph | /cpp/LabGraph/main.cpp | C++ | cpp | 2,291 | no_license | #include <iostream>
#include <random>
#include "Graph.h"
// random Numeric
template<typename Numeric, typename Generator = std::mt19937>
Numeric Random(Numeric from, Numeric to)
{
thread_local static Generator gen(std::random_device{}());
using dist_type = typename std::conditional
<
std::is_i... |
d2b9e4824cc9cebb3b6bd072929e8ec022bd08fc | 326ea6659135af119616857a914ff4f28e834b9d | JetAr/ZNginx | /Book/Boost C++ Application Development Cookbook/Chapter10/version/main.cpp | C++ | cpp | 505 | permissive | #include <cstddef>
int to_int(const char* str, std::size_t length);
#include <boost/version.hpp>
#include <boost/lexical_cast.hpp>
#if (BOOST_VERSION >= 105200)
int to_int(const char* str, std::size_t length)
{
return boost::lexical_cast<int>(str, length);
}
#else
int to_int(const char* str, std::size_t lengt... |
05f951c6b54d5286e885a6b36e57dfbdc8b9a9e2 | 76f4be25b2ecb1195187da0904f6d273484d4dbe | tarruda/neovim-deps | /32/usr/include/msgpack/sbuffer.hpp | C++ | hpp | 2,428 | no_license | //
// MessagePack for C++ simple buffer implementation
//
// Copyright (C) 2008-2013 FURUHASHI Sadayuki and KONDO Takatoshi
//
// 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
//
// ... |
b01a2d40e53473ddefbe8af7d3195f944638e864 | 20a3c031ff48c6d4faa51692105ca24985291554 | tdmurphy/IntelligentRobotics_Leonard | /build/src/find_object_2d/src/moc_CameraTcpServer.cpp | C++ | cpp | 4,279 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'CameraTcpServer.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.9.5)
**
** WARNING! All changes made in this file will be lost!
*****************************************************... |
16abf8d2bb2343a8654228e7bd869d15866ebbad | 25e8cd049095c29fb2f8794063c523960f0cff26 | bell0136/TIL | /C21/ConvStringToPrimitive.cpp | C++ | cpp | 426 | no_license | #include <stdio.h>
#include <stdlib.h>
int main()
{
char str[30];
printf("정수입력하시오\n");
scanf("%s", str);
printf("%d\n", atoi(str));
printf("실수입력하시오(6자리)\n"); //double
scanf("%s", str);
printf("%g\n", atof(str)); //%f는 float, double형 출력 서식문자
printf("정수입력하시오\n"); //long이므로 엄청 큰 값
scanf("%s", str);
printf("%l\... |
ab6ac4f019d2825e0c30063dc6352fc8ce644b4f | 802da139ee8f10ff46473350bec60c830c6f890f | astoeckel/nbdkit-smb-plugin | /test/test_get_space_info.cpp | C++ | cpp | 511 | no_license | #include <iostream>
#include <nbdkit_smb_plugin/smb.hpp>
int main(int argc, const char* argv[]) {
if (argc != 2) {
std::cout << "Usage: " << argv[0] << " <SMB SHARE>" << std::endl;
return 1;
}
SMB smb(argv[1]);
const auto info = smb.get_size_info();
std::cout << "Total size: " << (info.size / (1024 * 1024 * ... |
43a5d39749a83cc0ee08916c27af0cad0a8ed851 | cbacfd47f91bc63aa085ae3bc671e83530b3a3c2 | Alaxe/noi2-ranking | /2019/solutions/C/RDG-Shumen/alt.cpp | C++ | cpp | 310 | no_license | #include<iostream>
using namespace std;
const int MAXN=1024;
int a,br=0;
int main()
{
int k,m,n;
cin>>k>>m>>n;
a=0;
if(k>=m){cout<<0;return 0;}
for(int j=1;j<m;j++)
{
a++;
if(a+k<m&&a-k>0)br++;
}
cout<<(m-1+br)+(n-2)*((m-(2*k)))<<endl;
return 0;
}
|
0181668af9904592afcb1cc2aca97e8ae37c71ab | d70c71f13d368684e1cef9c268cbcdc9bc3f5247 | sheriby/DandAInLeetCode | /Daily_Problem/2012/Beginning/201207_Score_After_Flipping_Matrix/method1/solution.cc | C++ | cc | 1,713 | permissive | #include <iostream>
#include <vector>
using std::vector;
static const auto __ = [] {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
return nullptr;
}();
class Solution {
public:
// 使用贪心算法，先变行使得所有的行的第一位都变成1，
// 然后变列使得所有的列的1多于半数
// 这里使用的算法，修改了原矩阵，不是很好
// 时间复杂度: O(MN)
// 空间复杂... |
8e74b0b1435671e17d02caa1103ffee96a7259a4 | 08324e50df13f0e232bc7a01c5e964938c5a7af1 | arangodb/arangodb | /3rdParty/boost/1.78.0/boost/archive/polymorphic_xml_oarchive.hpp | C++ | hpp | 1,341 | permissive | #ifndef BOOST_ARCHIVE_POLYMORPHIC_XML_OARCHIVE_HPP
#define BOOST_ARCHIVE_POLYMORPHIC_XML_OARCHIVE_HPP
// MS compatible compilers support #pragma once
#if defined(_MSC_VER)
# pragma once
#endif
/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8
// polymorphic_xml_oarchive.hpp
// (C) Copy... |
c729d1a4609cb9759e5860457a340458365fb7d0 | abf3dc4d4fd6099a12ad47fc59dc1d8a006b66fd | Andrettin/Metternich_old | /culture/culture.cpp | C++ | cpp | 5,001 | permissive | #include "culture/culture.h"
#include "character/dynasty.h"
#include "culture/culture_group.h"
#include "culture/culture_supergroup.h"
#include "script/condition/and_condition.h"
#include "util/container_util.h"
#include "util/random.h"
#include "util/vector_random_util.h"
namespace metternich {
culture::culture(con... |
c285bc1bffedd811f2648fea56d5238a2f9db653 | 6d48aa1b92b625c65d5b8fb07603de673ee925e7 | jahid-coder/competitive-programming | /AtCoder/m-solutions2020/A.cpp | C++ | cpp | 1,682 | permissive | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using ... |
cbb9f81f22125ce845f69a6a37f464efea3066dd | a1c0773f373ac7dd4948eefd9c35b2e01965cb45 | alexzaccardelli/SauciCode | /22101A_2020/src/main.cpp | C++ | cpp | 746 | no_license | #include "vex.h"
using namespace vex;
competition Competition;
vex::brain cpu;
controller con;
task driveTask, intakeTask, tilterTask, armTask, autonTask;
void usercontrol(void) {
auton::resetAll();
//auton::deployTray();
//auton::skills();
driveTask = task(drive::op);
intakeTask = task(intake::op);
tilte... |
c76c9bbd5ee7d0737b9cdde80479d8c925be6c8c | 53d9d33b93a88c738f44caf5091887c04e80639e | mikf/euler | /src/euler/042.cpp | C++ | cpp | 1,710 | permissive | #include "euler.h"
#include "util/map.h"
#include "util/sum.h"
#include "util/takewhile.h"
#include "util/predicates.h"
#include "math/triangle.h"
#include <fstream>
#include <vector>
#include <string>
#include <map>
using namespace util;
using namespace math;
// The nth term of the sequence of triangle numbers is giv... |
8f6b2b5805474e1d202faf04974922f0dd837843 | 7ee7929ad50c307869e927188cd84dc68064362e | commshare/CopperRat | /src/jni/src/Playlist.cpp | C++ | cpp | 6,866 | no_license | /*
Copyright (c) 2014, Helios
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disc... |
c1a832eb4b74411a912d5522d9badd94d862d487 | cca6dc038856873a96f282dbe8f52ee055dbcaed | BrianJConway/CS480_Graphics | /PA10/src/mbumper.cpp | C++ | cpp | 1,578 | no_license | #include "mbumper.h"
#include <vector>
#include <cmath>
#include <iostream>
using namespace std;
MBumper::MBumper( string fileName, btDiscreteDynamicsWorld* dynamicsWorld ) : Model( fileName )
{
// Create bumper collision shape
btCollisionShape* bumperShape = new btSphereShape( 4 );
// Create ... |
b4af6ab4ec251f39b0481af8fa132d7a67ae1019 | 20090ffb18d424416a8afb4803b8d5a900d682d7 | songhtdo/JITCalculator | /exp/bytecode/Interpreter.hpp | C++ | hpp | 1,850 | permissive | // Interpreter.hpp
#pragma once
#include <map>
#include <memory>
#include <stack>
#include <functional>
#include "ast.hpp"
#include "bc.hpp"
class Interpreter {
public:
Interpreter();
/**
Returns value on the top of the stack
*/
jcVariablePtr interpret();
/**
Calls the function wit... |
2b5eb8f6e13afda5f03bdc4ca67e88ae510ca405 | f1e60253e9b248c9f24735640e4f3198deaa313e | ZVNexus/fuchsia | /zircon/system/utest/hid/hid-driver.cc | C++ | cc | 5,683 | permissive | // Copyright 2019 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <ddk/platform-defs.h>
#include <fbl/unique_ptr.h>
#include <fuchsia/hardware/hidctl/c/f... |
b892fee9a125abe37e19135b77b45523c71865a0 | 0919abfb71a63efb4d15d15261d6dfe96052d7d7 | vito-c/rtabmap | /corelib/src/util3d_surface.cpp | C++ | cpp | 34,335 | no_license | /*
Copyright (c) 2010-2016, Mathieu Labbe - IntRoLab - Universite de Sherbrooke
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
... |
b381cf13be32a760c8e1ba6945b6cb2f393c5660 | cef4138220aff5af60a211d2a42b1ce7ad89b1a4 | fish47/leetcode | /src/016_3sum-closest.cpp | C++ | cpp | 3,005 | no_license | #include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <random>
class Solution
{
public:
int threeSumClosest(std::vector<int> &vecNums, int target)
{
if (vecNums.size() < 3)
return std::accumulate(vecNums.cbegin(), vecNums.cend(), 0);
... |
4c49c5f724a780f0822df3eaf25e5166f76e9932 | 5031dce562ba01d1ee9acc7f3c6a9cd5da29ecc0 | monad-one/chromium | /chrome/browser/media/webrtc/desktop_media_picker_utils.cc | C++ | cc | 1,592 | permissive | // Copyright 2023 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/media/webrtc/desktop_media_picker_utils.h"
#include "media/base/video_util.h"
#include "ui/gfx/geometry/rect.h"
#include "ui/gfx/geometry/size.h"
#inc... |
057adc64082c6ddb6c131dc83547ad52221720aa | 685fb5a801ae78a1909ab08e7330e67d616c09c6 | mocig/znc | /modules/disconkick.cpp | C++ | cpp | 1,570 | permissive | /*
* Copyright (C) 2004-2020 ZNC, see the NOTICE file for details.
*
* 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 requi... |
9246c47d53bef90697b6297e5f9eaee6df86e652 | e8408ca1c514b8d3d771a6bb3194d4b6f066c403 | simonecid/cmssw | /FWCore/Framework/test/stubs/TestMergeResults.cc | C++ | cc | 24,237 | permissive |
//
// Reads some simple test objects in the event, run, and lumi
// principals. Then checks to see if the values in these
// objects match what we expect. Intended to be used to
// test the values in a file that has merged run and lumi
// products.
//
// Original Author: David Dagenhart, Fermilab, February 2008
#in... |
b861eb763c59e77aa37a4722e7adf61b6b843c1f | 2408cffb671be5452764fcba385a53db69440c0b | VagabondOfHell/Equations | /Equations/Equations/Equations.cpp | C++ | cpp | 1,248 | no_license | // Equations.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include "Equation.h"
#include "StringExtensions.h"
int _tmain(int argc, _TCHAR* argv[])
{
Equation eq = Equation();
//Set a sample equation. We can specify the name of the variables inside the declara... |
5d2d6837bf3821b5a7538b58a388130e1d351bf1 | abc0834a299ff3562e6c85295eade756141bb0d1 | subailong/actor-framework | /libcaf_core/caf/scheduler/worker.hpp | C++ | hpp | 5,412 | permissive | /******************************************************************************
* ____ _ _____ *
* / ___| / \ | ___| C++ *
* | | / _ \ | |_ Actor *
... |
6e25885b0a411f15cbe523352c7953e96b81c853 | 39198505fa943592f0cc5d78c4a55f6757a75ff8 | haochengxia/ZJU_2_2-Computer_Photography | /demo_project/GC_Border_Matting/maxflow.cpp | C++ | cpp | 14,897 | no_license | /* maxflow.cpp */
#include <stdio.h>
#include "graph.h"
/*
special constants for node->parent
*/
#define TERMINAL ( (arc *) 1 ) /* to terminal */
#define ORPHAN ( (arc *) 2 ) /* orphan */
#define INFINITE_D ((int)(((unsigned)-1)/2)) /* infinite distance to the terminal */
/*********************************... |
a53c3f52d1fce112b07e8a058565e2cc82fc10fa | aa8f78de05bbe926442fa8d4acb6224ea6cf55f1 | rnaumenk/abstract_vm | /include/Operand.hpp | C++ | hpp | 5,816 | no_license | #ifndef OPERAND_HPP
# define OPERAND_HPP
# include "avm.hpp"
# include "Factory.hpp"
# include "AvmException.hpp"
extern int g_line;
extern int g_end_of_read;
extern int g_exit;
template< typename T >
class Operand : public IOperand
{
public:
Operand( std::string const & value, eOperandType type, Fact... |
c40c66b9c2140a46955430fc3f44f2f1b295bc7f | ba865cd0d78dd67d864aa36182fa3ca40d7f7bbc | laughtrey/cis202 | /13 Sets/main.cpp | C++ | cpp | 936 | no_license | /*
File: main.cpp
Description:
Author: Raymond Laughrey
Email: raymonl4963@student.vvc.edu
Date of Creation: 4/20/2019, 3:21:12 AM
*/
#include <iostream>
#include <set>
#include <cmath>
void sieve_of_Eratosthenes(int n);
int main()
{
int n;
std::cout << "Up to what number do you want to know all pri... |
5f9682884ca408100408824b4d181b991c3d1e86 | 8df3a2f42fc6d389b06e8a51060d252b48d77251 | JukiyaHayakawa-1225/Yoshidagakuen_HayakawaJukiya_aaa | /01_制作ゲーム/01_チーム制作/01_雪だるまを止めるな！/00_プロジェクト/billboard.cpp | C++ | cpp | 8,308 | no_license | //=============================================================================
//
// ビルボードの処理 [billboard.cpp]
// Author : Jukiya Hayakawa
//
//=============================================================================
#include "billboard.h"
#include "renderer.h"
#include "manager.h"
#include "input.h"
//***********... |
e46900d808f475e406b4e8dd6a5ef24610378ca6 | 326330902ccb969386310e9950c12b3e6162e09e | EganChin/PAT-Advanced-Level | /Others/1101 Quick Sort(25).cpp | C++ | cpp | 2,988 | no_license | /*
1101 Quick Sort （25 分)
There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N distinct positive integers after a ru... |
a32bd5debf2f4967804e4d2c322ee135090f5929 | bfd026941bfdcd7bf9c5493de22af1058ae82963 | ttyang/sandbox | /sandbox/fiber/libs/fiber/test/condition_test_common.hpp | C++ | hpp | 1,295 | permissive | #ifndef TASK_CONDITION_TEST_COMMON_HPP
#define TASK_CONDITION_TEST_COMMON_HPP
// Copyright (C) 2007 Anthony Williams
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <boost/utility.hpp>
#include <boo... |
fd271bdefe9ba7353697892aad0262548a1d2f75 | 861b06d6b022c737c2b0d36914da4e2df05f3f4f | odelalleau/mvfst | /quic/dsr/Types.cpp | C++ | cpp | 545 | permissive | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*
*/
#include <quic/dsr/Types.h>
namespace quic {
WriteStreamFrame sendInstructionToWriteStreamFrame(
const SendInstruction& sen... |
2b08637d7079f96836d9720729730b8f68488bc0 | 3e8d8bf69f26342be2ea305b2fa4ea3cd5b85f52 | std2312/C-PLUS-PLUS | /C++项目/10/HRMS/AssessDlg.cpp | C++ | cpp | 3,820 | no_license | // AssessDlg.cpp : implementation file
//
#include "stdafx.h"
#include "hrms.h"
#include "AssessDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CAssessDlg dialog
CAssessDlg::CAsse... |
fd1e79ef9a68fb886399f3ceaa91034ea7ec11b5 | 38d8d031ac918cf54e0de6a31017c3891f0b37be | project8/lice | /Lice.cc | C++ | cc | 2,578 | no_license | #include "Lice.hh"
#include <sstream>
P8Lice::P8Lice() {
interface.setServer("p8portal.phys.washington.edu");
interface.setPort("5984");
interface.setDBName("p8slowcontrollog");
}
set<string> P8Lice::getSensors(time_t start,time_t stop) {
vector<SensorReading> allsens=getReadings(start,stop);
set<string> ret;
... |
9bb46c5c6068741b02b20f71f0dda5c4cf50a9d9 | 337b9a92a211a0c5d914d68efdfd8c11ed05caea | calledpaul/lathe_pure | /OneButton.cpp | C++ | cpp | 5,226 | no_license | // -----
// OneButton.cpp - Library for detecting button clicks, doubleclicks and long press pattern on a single button.
// This class is implemented for use with the Arduino environment.
// Copyright (c) by Matthias Hertel, http://www.mathertel.de
// This work is licensed under a BSD style license. See http://www.math... |
f16048635b49084c0b8727869810aae21a1c7d34 | 96b37650a892a3bc2a251c30314236e03419949d | quentinfonk/Indie-Studio | /include/Encapsulation/Text.hpp | C++ | hpp | 899 | no_license | /*
** EPITECH PROJECT, 2021
** Untitled (Workspace)
** File description:
** text
*/
#ifndef TEXT_HPP_
#define TEXT_HPP_
#include "include.hpp"
namespace rl {
class Text
{
public:
Text(std::string = "", float = 0, float = 0, float = 15, RAYLIB::Color = RAYLIB::WHITE);
~Text() =... |
14843c8af31b92f2e3e1d9a56cf0b2c73c149b12 | ed2283b18be03ea3a0f6cbe63edbf5c73f8b5d43 | Northmedal/DSALearn | /hackerrankrough1.cpp | C++ | cpp | 711 | no_license | #include <iostream>
#include <cstdio>
using namespace std;
int main() {
// Complete the code.
int a,b;
cin >> a >> b;
for(int i=a;i<=b;i++){
if(i<=9){
if(i==8) cout<<"eight\n";
else if(i==9) cout<<"nine\n";
else if(i==7) cout<<"seven\n";
else if(i... |
01a3c4b37386afffc592c7c06dd6fd249642aa33 | e3839f2c52107b0eeccd92bb6e550e0af7421f27 | hyunyong/L1TriggerDPGUpgrade | /L1TMuon/plugins/GEMCollector.cc | C++ | cc | 1,138 | no_license | #include "L1TriggerDPGUpgrade/L1TMuon/interface/GEMCollector.h"
#include "DataFormats/GEMDigi/interface/GEMDigiCollection.h"
#include "DataFormats/MuonDetId/interface/GEMDetId.h"
#include "DataFormats/Common/interface/Handle.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCore/Framework/interface/EventSet... |
fabaeda05c144de118f6b427ca5bfd38569aa8b4 | 83d0a2023069c0ac1b7f363475271ae0c48c0568 | WaerjakSC/SpaceInvadersCPP | /Source/SpaceCPP/CharMovementComponent.cpp | C++ | cpp | 810 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "CharMovementComponent.h"
void UCharMovementComponent::TickComponent(float DeltaTime, enum ELevelTick TickType, FActorComponentTickFunction *ThisTickFunction)
{
Super::TickComponent(DeltaTime, TickType, ThisTickFunction);
if (!... |
b4ee1d271a666af32f9d51c9dff0e2372f65ecb7 | fced9f9e29635d0e681a9b1fc9fa8eb593a73e11 | aliakbr/Makhluk | /MakhlukHidup.cpp | C++ | cpp | 1,741 | no_license | #include "MakhlukHidup.h"
MakhlukHidup::MakhlukHidup(int _umur, char _DNA, int _ulangtahun, Point P) : ukuran_predator(20), batas_umur(_umur), posisi(P.getAbsis(),P.getOrdinat()), PPosisi(P.getAbsis(),P.getOrdinat()) {
umur = 0;
DNA = _DNA;
ulang_tahun = _ulangtahun;
predator = new char[ukuran_pr... |
59459bba1313773e44f95274213d3c0f45ab0703 | 553553f5facb7541a1dc419918849f863d439d16 | CMS-TMTT/cmssw | /RecoJets/FFTJetAlgorithms/src/JetToPeakDistance.cc | C++ | cc | 923 | permissive | #include <cmath>
#include <cassert>
#include "RecoJets/FFTJetAlgorithms/interface/JetToPeakDistance.h"
namespace fftjetcms {
JetToPeakDistance::JetToPeakDistance(const double etaToPhiBandwidthRatio)
: etaBw_(sqrt(etaToPhiBandwidthRatio)),
phiBw_(1.0/etaBw_)
{
assert(etaToPhiBandwidth... |
7001f567cb8e1e84561d223d4b1188ddc60bd113 | b10eccf575c3ad8bc89d519cc93c944fe95d45da | Erumaru/ACM | /SPOJ/ABA12C/a.cpp | C++ | cpp | 1,250 | no_license | #pragma comment(linker, "/STACK:64000000")
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include <sstream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
#include <vector>
#include <queue>
#include <stac... |
5a80f7e9ee8372d807a321f60dd7dfa3f3b472c7 | 41cbea974aac32a6911812c5a74da87bb4d33958 | rdsgautier/UnrealEnginePython | /Source/UnrealEnginePython/Private/UObject/UEPyViewport.cpp | C++ | cpp | 6,026 | permissive | #include "UEPyViewport.h"
#if WITH_EDITOR
#include "LevelEditor.h"
#include "Editor/LevelEditor/Public/ILevelViewport.h"
#include "Editor/UnrealEd/Public/LevelEditorViewport.h"
#endif
#include "Slate/UEPySWidget.h"
// required for GEngine access
#include "Engine/Engine.h"
PyObject *py_unreal_engine_get_game_viewport... |
1d622cf6f07387ec0f555188ddc0ba2c27e80ad8 | bfca59edbc012d901883cdcc848f1d0389792809 | lz-purple/Source | /app/src/main/java/com/syd/source/aosp/external/parameter-framework/asio-1.10.6/include/asio/detail/local_free_on_block_exit.hpp | C++ | hpp | 510 | permissive | //
// detail/local_free_on_block_exit.hpp
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//
// Copyright (c) 2003-2015 Christopher M. Kohlhoff (chris at kohlhoff dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
/... |
ca211f9340490413abd42f05e75a87e68d34731f | 7f0220020d6953095e98a5e6639cb7cda3f5e9e5 | dyg540/chromium | /third_party/crashpad/crashpad/snapshot/ios/process_snapshot_ios_intermediate_dump.cc | C++ | cc | 8,962 | permissive | // Copyright 2020 The Crashpad Authors. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by ... |
74de32b6c7afd11e05a3307862290c4763ee5734 | fd8da0a53ecf20c482a23ad57dce051becb8b489 | Hasanzakaria/CODEFORCES | /1189B.cpp | C++ | cpp | 1,167 | no_license | #include<bits/stdc++.h>
using namespace std;
vector<long long int>v;
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n,i,flag=0,p;
cin>>n;
long long int ara[n];
for(i=0; i<n; i++)
{
cin>>ara[i];
}
sort(ara,ara+n);
for(i=0; i<n; i+=2)
{
v.... |
65872b6c25148c53b9255e02856440719a2acad9 | 2cd5541d1be2b14ff96aa9657a27e340022b1985 | neo5167/cppcoro | /include/cppcoro/resume_on.hpp | C++ | hpp | 1,626 | permissive | ///////////////////////////////////////////////////////////////////////////////
// Copyright (c) Lewis Baker
// Licenced under MIT license. See LICENSE.txt for details.
///////////////////////////////////////////////////////////////////////////////
#ifndef CPPCORO_RESUME_ON_HPP_INCLUDED
#define CPPCORO_RESUME_ON_HPP_IN... |
d35d4d0c55195cbadfbf1024c148d961b9e2fb03 | 2b3844774bde5e9111e6b2a5730316e82799862c | DionEngels/GasDischarges | /phivar.cpp | C++ | cpp | 4,137 | no_license | /** \file
*
* Implementation of the code which has been declared in phivar.h
* $Id$
*/
#include "phivar.h"
#include "basics.h"
#include "grid.h"
#include <cmath>
#include <iostream>
PhiVariable::PhiVariable(const Grid &grid, const Field &w_cv,
const BoundaryCondition &bc_... |
e5c1ab8a27ac93d324d0fd5bf1d92ddd7e16c270 | c68c36da0c3a0d231da134653bb4e6f0d3dba194 | Sickelmo83/YugiohPhantomRealm | /Game/Cards/Magic/Curse.cpp | C++ | cpp | 2,303 | permissive | #include <Game\Cards\Magic\Curse.h>
#include <Utility\Clock.h>
#include <Game\Cards\Magic\MagicUnit.h>
#include <Game\Animation\ParticlesUnit.h>
#include <Game\Duel\Board.h>
#include <Utility\SoundUnit.h>
#define ZYUG_GO 0
#define ZYUG_PART 1
#define ZYUG_FADE_IN 2
#define ZYUG_FADE_OUT 3
#define ZYUG_FIN 5
namespac... |
2baa0394599871473ed61a08ff90f8de720ae310 | 66c175aa20e7718a29a5339fdc3d94aa947d98bb | crea7or/x3f-processor | /CEX3FTagCMbM.cpp | C++ | cpp | 2,803 | permissive | // Document modified at : Sunday, February 19, 2012 11:45:24 PM , by user : Pavel Sokolov , from computer : CREA7OR
// CEX3FTagCMbM.cpp: implementation of the CEX3FTagCMbM class.
#include "stdafx.h"
#include "CEX3FTagCMbM.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
... |
b30224ed8cd2b628cde8c1538afcb33a336bda7d | 13bbbb2fbd1589d5e8ebf16de2fe31961666b6fa | GulajavaMinistudio/swift | /lib/Sema/TypeCheckStmt.cpp | C++ | cpp | 109,840 | permissive | //===--- TypeCheckStmt.cpp - Type Checking for Statements -----------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2018 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/L... |
d896ae302480af7bcc1ac3d01ae5710afdf196da | 0e8d7f2a7337d8b8e78df32acefd1f7ea6f0de90 | minicore2/marnav | /test/ais/Test_ais_message_19.cpp | C++ | cpp | 2,456 | permissive | #include <gtest/gtest.h>
#include <marnav/ais/message_19.hpp>
#include <marnav/ais/ais.hpp>
namespace
{
using namespace marnav;
class Test_ais_message_19 : public ::testing::Test
{
};
TEST_F(Test_ais_message_19, parse)
{
std::vector<std::pair<std::string, uint32_t>> v;
v.push_back(std::make_pair("C000000000H0htY0... |
8653cf66ce40607d3681ad679e191a1492edc266 | 9c699b0e6af767c7c6a10309b84d5e252030c3df | Haseko/snake | /World.cpp | C++ | cpp | 3,504 | no_license | #define KEY_UP 72
#define KEY_DOWN 80
#define KEY_LEFT 75
#define KEY_RIGHT 77
#include "World.h"
#include "Snake.h"
#include <iostream>
#include <vector>
#include <cstdlib>
#include <conio.h>
#include <windows.h>
//#include <random>
//
//std::default_random_engine generator;
//std::uniform_int_distribution<int> dist... |
64106c7a8244b5019d43bee38a3b3f7b950af2e3 | f55f8a6d0352fdd2f0f0810f6e07a80d17fb5c4b | rafid211/online-judge-solution | /LightOj/Goldbach`s Conjecture.cpp | C++ | cpp | 1,735 | no_license | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const double EPS = 1e-11;
const double PI = 2 * acos(0.0);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector... |
c527940bd53a31c7437fe488c697d9e4b5fbc724 | 560fa8894b7b83b1a93b6607738fc4e59da46103 | apple/swift-libcxx | /test/std/utilities/optional/optional.object/optional.object.observe/has_value.pass.cpp | C++ | cpp | 990 | permissive | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
13959933e672030ea1ba861b71dc66acf855d4f6 | 0cf87e3d95983e829f765237ec8d01bae9ade791 | thesvzh/hw | /hw1p.cpp | C++ | cpp | 291 | no_license | #include <iostream>
int main()
{
Stack stack;
stack.reset();
stack.print();
stack.push(3);
stack.push(7);
stack.push(5);
stack.print();
stack.pop();
stack.print();
stack.pop();
stack.pop();
stack.print();
return 0;
}
|
06b544672d2da84360ccb442d8e5e02680194c72 | 7b80d37d9b92005ca87acc774ef22dff5d8b520a | zhangwj0101/codestudy | /algorithm/HDU-ACM/ambition0109/26884.cpp | C++ | cpp | 1,661 | no_license | ////////////////////System Comment////////////////////
////Welcome to Hangzhou Dianzi University Online Judge
////http://acm.hdu.edu.cn
//////////////////////////////////////////////////////
////Username: ambition0109
////Nickname: Ambition
////Run ID:
////Submit time: 2010-08-25 14:45:14
////Compiler: Visual ... |
4a2799987278f836f6f2c3870f5836f990f69761 | 34e33d9c9912f441ca2addbdb95183fe061fae36 | wcsanders1/LeetCode | /TotalAppealOfAString/CPP/TotalAppealOfAString.cpp | C++ | cpp | 951 | no_license | // https://leetcode.com/problems/total-appeal-of-a-string/
// NOT MINE: https://leetcode.com/problems/total-appeal-of-a-string/solutions/1996203/dp/?orderBy=most_votes
#include <vector>
#include <string>
#include <unordered_map>
using namespace std;
class Solution
{
public:
long long appealSum(string s)
{
uno... |
aef689a1d78441098a0a0b33e678c199baa03249 | fe4e538977c995d54bf1adb47d9d2ace5a1a0bad | codemercenary/autowiring | /contrib/autoboost/autoboost/range/detail/end.hpp | C++ | hpp | 2,523 | permissive | // Boost.Range library
//
// Copyright Thorsten Ottosen 2003-2004. 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)
//
// For more information, see http://www.boost.org/libs/rang... |
bc342e24f19b59393c74badbb2aec74afe9ac6a3 | f7ab624c94242a1b3672bb48aa3fc788e0bff6dd | AntonVanEs/TRD | /parts/segmenttree.cpp | C++ | cpp | 1,590 | no_license | struct segment{
int num;
int beg, eind;
int minIndex;
};
class SegmentTree{
public:
SegmentTree(int n){
ar.assign(n, inf);
p.resize(3*n + 5); // to be sure
p[1].num = 1; p[1].beg = 0; p[1].eind = n-1; p[1].minIndex = 0;
for(unsigned int i = 2 ; i < p.size() ; i++){
p[i].num = i;
if( i%2 == 0 ){
p... |
3314d7f6b053f6fb784654db31c74fddc5ce95ec | f07c0d809fec2b32ff61d401343d67f1d2a053a5 | apple-open-source/macos | /WebKit/Source/WebKit/UIProcess/API/glib/WebKitSecurityOrigin.cpp | C++ | cpp | 7,842 | no_license | /*
* Copyright (C) 2017 Igalia S.L.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library i... |
af9178cc069c2ad3ef210c1c92389b254c6f00af | d0e2adb074ebd555dcc81a5bb82495ec57e2f03e | gonatama/pancoro | /pre/pre/player.cpp | C++ | cpp | 18,148 | no_license | //=============================================================================
//
// プレイヤー処理 [player.cp]
// Author : 権頭 啓太
//
//=============================================================================
#include "player.h"
#include "camera.h"
#include "input.h"
#include "shadow.h"
#include "bullet.h"
#include "effe... |
4b9a1f083d43edb0461275e21af7255225b375fd | 4052cf6e87ba4027950c2d6ec13254556233a4a9 | huayyang/HackdayDemo | /HackdayDemo/ios_build/Classes/Native/UnityClassRegistration.cpp | C++ | cpp | 13,456 | no_license | template <typename T> void RegisterClass();
template <typename T> void RegisterStrippedType(int, const char*, const char*);
void InvokeRegisterStaticallyLinkedModuleClasses()
{
// Do nothing (we're in stripping mode)
}
void RegisterStaticallyLinkedModulesGranular()
{
void RegisterModule_Animation();
RegisterModule... |
d91a2c8273e9824a5ed5f925616f57716d73f0c7 | 126015896039b0ee79b2cec58cc5c5d1148e1def | iGNSS/GMAT1 | /src/gui/mission/DecoratedTree.hpp | C++ | hpp | 5,695 | permissive | //$Id$
//------------------------------------------------------------------------------
// DecoratedTree
//------------------------------------------------------------------------------
// GMAT: General Mission Analysis Tool.
//
// Author: Darrel J. Conway
// Created: 2003/10/12
//
// D... |
9317ed7add0e40a4a993704001e663b66ab0003e | dbe49f484f4cdfa04499451425e704af949d66b3 | chocolateplatform/cocos2dx-cpp-android-sample | /proj.android-studio/app/jni/hellocpp/VdopiaJNI_Interstitial.cpp | C++ | cpp | 9,307 | no_license | #include <platform/android/jni/JniHelper.h>
#include <android/log.h>
#include "VdopiaAdNativeAPI.h"
#include "VdopiaInterstitialListener.h"
#include "../../../../Classes/VdopiaInterstitialListener.h"
#define LOG_TAG "VdopiaAdsJNI"
#define LOGD(...) __android_log_print(ANDROID_LOG_DEBUG,LOG_TAG,__VA_ARGS__)
#define... |
0f1b7f5f664ab7a0f154c5072bfd41eeee912632 | b2e99364038f13dcc0dddfebc369a89896411a9b | beobillly/project_cpp | /src/Game.cpp | C++ | cpp | 3,823 | no_license | #include "../include/Game.hpp"
Game::Game()
{
std::cout << "Do you want to play against the robot ? (Y/N) " << endl;
string answer("");
std::cin >> answer;
Player p1 = Player(Game::ask_player_name(), true);
this->player_white = p1;
if (answer == "Y")
{
this->player_black = Bot();
... |
4bf4edfabd5139c31e87ca1ca5cbf071f459135c | 1c07c964a479cde7ca115a26b706258e6dc310dc | john19950730/SpaProjectRepo | /source/ApiCallPatternClause.cpp | C++ | cpp | 4,691 | no_license | #include "APICallPatternClause.h"
#include "Keywords.h"
#include "PKB.h"
using namespace keywords::query;
using namespace keywords::clauseParamType;
APICallPatternClause::APICallPatternClause(pair<string, string> paramType, PATTERN_CLAUSE patternClause, string selectSynonym, map<string, string> synonymTable) {
this-... |
3b85ef2e9cfa7337acf50b4a71f5c1f1bf143dc9 | 0f21ae3ae922b370cdb9757c90fb3e42b8869dc3 | olsonanl/close_kmers | /fastq_to_protein.cc | C++ | cc | 2,665 | no_license | #include "fastq_parser.h"
#include "trans_table.h"
#include "dna_seq.h"
#include <boost/program_options.hpp>
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
namespace po = boost::program_options;
void to_proteins(const std::string &fastq_file, std::ostream &output)
{
std::ifstream fa... |
c1042592f75dd4cc5b9e09e2a914a12f61e900ee | b6958339ddcbf475bf03fb1ec7944269b66fc338 | OC-MCS/prog5-mystring-SeanJennings15 | /MyString/testMyString.cpp | C++ | cpp | 4,084 | no_license | // test driver code goes here
#include <iostream>
#include <cstring>
#include "MyString.h"
#include <string>
using namespace std;
//=====================================================
// Sean Jennings
// 3/1/2019
// Programming 2, Assignment #5
// Description: MyString
//=============================================... |
a1a86106495bcd79c420ff7ffa33d1a0d9e8e6f5 | e1c2ff7d6488f3b9e689bb3eb7b8ffabb589c11a | Doloops/Xemeiah | /src/dom/nodeset.hpp | C++ | hpp | 13,605 | no_license | #include <Xemeiah/dom/nodeset.h>
#include <Xemeiah/dom/item-base.h>
#include <Xemeiah/xprocessor/xprocessor.h>
#include <math.h>
#define Log_NodeSetHPP Debug
#define __XEM_NODESET_FAST_NODEREF_DUPLICATE
// #define __XEM_NODESET_PUSHBACK_LOG_NODESET
// #define __XEM_NODESET_NO_EXPLICIT_ITEM_CLEARCONTENTS
namespace ... |
960cd787c3166fd27489bbf41087853dee7e62f8 | 1e3d6b12432ae11032946637ecb9f6f7528e390b | magicus/phoneME | /cldc/src/vm/share/compiler/Location.hpp | C++ | hpp | 12,322 | no_license | /*
*
*
* Portions Copyright 2000-2007 Sun Microsystems, Inc. All Rights
* Reserved. Use is subject to license terms.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public Licens... |
4ad730aac38b9e7ceffa4732dc7f2e3f04ef4d9c | 391f1bc121372ce298de658bd20fe0b5a663b9d4 | yuri410/rpg | /external/DirectXShaderCompiler/tools/clang/test/SemaCXX/static-cast.cpp | C++ | cpp | 7,666 | permissive | // RUN: %clang_cc1 -fsyntax-only -verify %s
struct A {};
struct B : public A {}; // Single public base.
struct C1 : public virtual B {}; // Single virtual base.
struct C2 : public virtual B {};
struct D : public C1, public C2 {}; // Diamond
struct E : private A {}; // Single private base... |
ba72451d980ea66ba128006798e8a70b2610ae09 | e005a5d8f3a84558a811c626c093a593f657c32a | mkgharbi/TP | /TP/TP4/fichierstp4/Enonce/utilisateurPremium.cpp | C++ | cpp | 785 | no_license | /********************************************
* Titre: Travail pratique #4 - utilisateurPremium.cpp
* Date: 19 octobre 2018
* Auteur: Wassim Khene & Ryan Hardie
*******************************************/
#include "utilisateurPremium.h"
UtilisateurPremium::UtilisateurPremium(const string& nom, MethodePaiem... |
b1ae4a9df9034165ded7b72924f40f5849740de0 | 430e40d6c4058d4f883e679645ccda04a7dc85ad | Sohaibb98/Portfolio | /C++/BomberPacman/Bomber_Pacman(VS 2013)/hw0-windows/bomber_Pacman.cpp | C++ | cpp | 11,061 | no_license | //============================================================================
// Name : bubble-shooter.cpp
// Author : Sibt ul Hussain
// Version :
// Copyright : (c) Reserved
// Description : Basic 2D game of Bubble Shooting...
//======================================================================... |
23f551befc3051913ad626e8e4524afed866188b | 9485f761473256fd1515b52c81406fbff14eab0e | coregenomics/FStitch | /src/grabTrainingExamples.cpp | C++ | cpp | 2,020 | no_license | // #include <string>
// #include <vector>
// #include "grabTrainingExamples.h"
// #include "read.h"
// #include <map>
// #include <iostream>
// #include <random>
// using namespace std;
// map<string,T> makeIntervalTree(map<string, interval *> intervals){
// typedef map<string, interval *>::iterator it_type;
// map<s... |
eefb344bb0fb7c6cf315f6083d84a1c513dbdd8a | e831dd55fea0bfb5a889733d2ef94babbb2b8cc9 | mdqyy/HnT-neuralNetworks | /src/trainer/supervisedTrainers/SupervisedTrainer.hpp | C++ | hpp | 1,239 | no_license | #ifndef __SUPERVISEDTRAINER_HPP__
#define __SUPERVISEDTRAINER_HPP__
/*!
* \file SupervisedTrainer.hpp
* Header of the SupervisedTrainer class.
* \author Luc Mioulet
*/
#include "../Trainer.hpp"
#include "../../dataset/supervised/SupervisedDataset.hpp"
#include <opencv/cv.h>
#include <vector>
/*!
* \class Supervi... |
7a864aae9f08585df133fafba5f20a5136714624 | 15b4260014d8e0f64014bff16eaba65263272812 | MaxIV-KitsControls/Lima-tango | /LimaDetector/src/PrincetonCCDStateMachine.cpp | C++ | cpp | 4,977 | no_license | static const char *RcsId = "$Id $";
//+=============================================================================
//
// file : PrincetonCCDStateMachine.cpp
//
// description : C++ source for the PrincetonCCD and its alowed
// methods for commands and attributes
//
// project : TA... |
d48510b5d6a43083e3e4ee5fbba57d62ebb2e709 | fa95fce710389cd56408589f38b312c719a79d2f | Jakstor/C-programs | /qualify.cpp | C++ | cpp | 491 | no_license | #include<stdio.h>
int main()
{
int t,n,k,s[100],temp,i,j,max;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
scanf("%d",&k);
for(i=0;i<n;i++)
{
scanf("%d",&s[i]);
}
for(i=0;i<n;i++)
{
for(j=1;j<n-i;j++)
{
if(s[j-1]<s[j])
{
temp=s[j-1];
s[j-1]=s[j];
s[j]=temp;
}
}
... |
eec8a6f5b664a1da1152ad12cd253d308dcdae77 | aa15d05e9347f35f3f9f8f1077853e3f27e1daa5 | GregPhi/m1s2 | /COA/CM/05.smart_pointers/examples/shared.cpp | C++ | cpp | 1,120 | no_license | #include <iostream>
#include <memory>
using namespace std;
class MyClass {
int x;
public:
MyClass(int i) : x(i) {
cout << "Constructor of MyClass with " << x << endl;
}
int get() const { return x; }
~MyClass() {
cout << "Destructor of MyClass with " << x << endl;
}
};
shared_ptr<MyClass> pg... |
10ecc8fb6b574f40d1e737335b442aeb911ea0eb | a924b205a05eb6ede8d8204e44e550ee4e14d5a4 | jojo4444/-practice | /bfu/lab3/1 на 1/fairy.hpp | C++ | hpp | 306 | no_license | #pragma once
#include "being.hpp"
#include "constants.hpp"
class fairy : public being {
public:
fairy();
fairy(int hp, int stunned, int poison);
fairy(const state& stat, int poison);
void setPoison(int poison);
int getPoison() const;
private:
int poison_;
};
|
532be1f5175ad07bf938a505e24b13cb3ec5c06d | e472ac5ce1bf88cbddf687ae1569cc4783e16151 | ternence-li/LightInk3D | /src/LightInk3D/Graphics/ConstantBuffer.cpp | C++ | cpp | 2,156 | permissive | //
// Copyright (c) 2008-2016 the Urho3D project.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, m... |
a113c122dcf3d9860453eafdfa79a7c2a0b29bf9 | 80d7411a0dc5a84300a28292366ce8b7945c7ca7 | conyconydev/swift | /lib/Sema/CSGen.cpp | C++ | cpp | 153,665 | permissive | //===--- CSGen.cpp - Constraint Generator ---------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2018 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/L... |
108356183237ff815cb0b6b94f3099c222b4d095 | c083697feff09bf811dde740909f11f36bdec3e0 | MDNoorUddin/UVA-Solutions | /10946.cpp | C++ | cpp | 1,854 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
int I=1;
while(cin>>n>>m&&n&&m)
{
vector<string> a(n);
for(int i=0;i<n;i++)cin>>a[i];
priority_queue<pair<int,int> > mp;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.