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 |
|---|---|---|---|---|---|---|---|---|
116668ad77449245894fdab441533937f831891f | 4f2d190417da0a71e8645a37ce651436480b5859 | perthblank/ViSSI | /ViSSI32/src/renderer.cpp | C++ | cpp | 17,810 | no_license | #include"renderer.h"
Renderer::Renderer(
unsigned population,
GLfloat pos_scale,
SIMethod * sip,
int draw_type) :
p_num(population), draw_type(draw_type), sip(sip), pos_scale(pos_scale)
{
InputFactor.refreshView(pos_scale * 2);
is_ok = false;
v_size = p_num * 3;
p_vertex = sip->getPosArr();
Projection = g... |
95cd5ff7e7f01067faa2e0ec8caa265459d2d3c5 | b3eb034f2183998ce25a2364ef889f0593de2346 | ybouret/iics | /sludge2/src/tracer.hpp | C++ | hpp | 1,666 | no_license | #ifndef TRACER_INCLUDED
#define TRACER_INCLUDED 1
#include "types.hpp"
#include "yocto/sequence/cached-list.hpp"
#include "yocto/core/clist.hpp"
#include "yocto/hashing/sha1.hpp"
class Bubble;
class Junction;
class Tracer
{
public:
Tracer() throw();
~Tracer() throw();
Tracer *next;
Tracer *prev;
... |
404ed29760ffc26c9b17d03dbe7a79efb7bae0c5 | 0b22db93d3e692f7235d902260b73bc1e5d9abd5 | khcsce/GooberEats | /GooberEats/PointToPointRouter.cpp | C++ | cpp | 8,379 | no_license | #include "provided.h"
#include "support.h"
#include <list>
#include <algorithm>
using namespace std;
struct Node
{
GeoCoord startCoord;
GeoCoord endCoord; // GeoCoord object REMEMBER THIS
Node* parent; // parent Node will use to deal with "neighbors or childs"
double g; // g gost
double h; // h cose... |
d5d8056baea60ec246c23957bd0898b51fef3b72 | 1ac0fbb030506eda9c2fbc2548789489c84f3764 | yeeway/chromium | /content/browser/worker_host/worker_script_fetch_initiator.cc | C++ | cc | 16,974 | 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 "content/browser/worker_host/worker_script_fetch_initiator.h"
#include <string>
#include <vector>
#include "base/bind.h"
#include "base/callbac... |
bb7bfe03ec935dc17226a68dc8e316bdd24deb56 | 8444c04470baf02c9c52fcbc9149d37959bcef6d | dipendughosh/programs | /BSc_CompSc/SK Sir/bst(sonam).cpp | C++ | cpp | 3,287 | no_license | #include<iostream>
#include<new>
#include<exception>
using namespace std;
template<class type>
class bst
{
typedef struct node
{
struct node *left;
type data;
struct node *right;
}tree;
tree *root;
public:
bst();
~bst();
void insertion(type);
int deletion(type);
void display();
void inorder(tree*);
v... |
14f6bad7dec0349c428cb6e7ede8d6ed4d378bb2 | 1acf7dcc38db127b0a2006f1fd7a73bb25fcd93f | YayaDaxter/dsba-itop2021-hw1 | /Campus_placement/detailwindow.cpp | C++ | cpp | 850 | no_license | #include "detailwindow.h"
#include "ui_detailwindow.h"
#include "person.h"
#include <QString>
DetailWindow::DetailWindow(QWidget *parent) :
QDialog(parent),
ui(new Ui::DetailWindow)
{
ui->setupUi(this);
}
void DetailWindow::setPersonDetail(Person person)
{
ui->lineEdit->setText(QString::... |
90c6857f8f43adb9773d7c630d0f4c8227e79836 | 38ac396c421cf414059a4fd0ee6287e8f9785194 | koobonil/Boss2D | /Boss2D/addon/tensorflow-1.2.1_for_boss/tensorflow/compiler/xla/service/algebraic_simplifier.cc | C++ | cc | 59,641 | permissive | /* Copyright 2017 The TensorFlow 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 applicable law or a... |
24fcdf64c2c313c2cd40394f63c37332325f5871 | f3112d8981cbe2e49ce5a259eb2d4e8312f572d0 | 16raj/Faculty_information_system | /src/main/resources/static/uploads/Vacancies/ef118afe-90d0-4d3b-b60d-1b7f08765ac0binarysearch.cpp | C++ | cpp | 1,163 | no_license | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... |
d5e4575b595d9f1dc8c13ffa02a1769286e6d1d1 | 1585af9b99475ae6f9b462e641f25eec94ceb2d5 | andreondra/chip8 | /src/Platform.cpp | C++ | cpp | 4,942 | permissive | #include "Platform.hpp"
Platform::Platform(const void *screenBuffer, uint8_t *keypad, const char *title, int scale){
SDL_Init(SDL_INIT_VIDEO);
window = SDL_CreateWindow(title, 0, 0, SCREEN_WIDTH * scale, SCREEN_HEIGHT * scale, SDL_WINDOW_SHOWN);
renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCE... |
184af826508da9ad9289243bd1f8adcfffc97d8d | cd38aaa607bfc47a206fdd676ed4d27501ebab3d | infinitemoneycoin/infinitemoneycoin | /miner.cpp | C++ | cpp | 32,378 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2018 The PIVX developers
// Copyright (c) 2018 The infinitemoneycoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// fi... |
82d8fd4184db274234cc4acccb2f7f03edf00cb5 | 9de55cf9528ff932af299ac7993a03701f7d53a4 | SCP-10086-CS/Animaker | /Animaker/GraphicsObject.cpp | C++ | cpp | 631 | permissive | #include"Animaker.h"
using namespace Animaker::Core;
using namespace Animaker::Math;
Animaker::Core::GraphicsObject::GraphicsObject(){
this->pc_gpuMatrixBuffer = nullptr;
this->pc_gpuVertexBuffer = nullptr;
this->pc_cpuVertexBuffer = nullptr;
}
void Animaker::Core::GraphicsObject::Move(Math::Float4 from, Math::... |
a18e6d5d5e8febd4cca82a708b2b128ce5dae917 | 90dfbe0b1189ed9ff1a2d009b15973be0e32b73f | lucaschf/OnlineJudge | /Beginner/Problem1864.cpp | C++ | cpp | 306 | no_license | //
// Created by lucas on 01/18/2021.
//
#include <iostream>
using namespace std;
int main() {
string quote = "LIFE IS NOT A PROBLEM TO BE SOLVED, BUT A REALITY TO BE EXPERIENCED.";
int number;
cin >> number;
for (int i = 0; i < number; i++) {
cout << quote[i];
}
cout << endl;
return 0;
}
|
d3312d2dd05763258021059a1ea8a2e30138473c | 2a9231d1da38972de6e83f22d9cf8b3cf3f55bfe | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_PrimalItemSkin_SummerSwimPants_Carno_classes.hpp | C++ | hpp | 914 | permissive | #pragma once
// ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_PrimalItemSkin_SummerSwimPants_Carno_structs.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Classes
//------------------------------------... |
0528db901b7a45b741dfd2f6b6c9c30dbb534f53 | e065cc088e2088ec6572db4506b460ef737af0cf | junxzm1990/ASAN-- | /testcases/juliet_test_suite/testcases/CWE36_Absolute_Path_Traversal/s03/CWE36_Absolute_Path_Traversal__wchar_t_connect_socket_ofstream_84_goodG2B.cpp | C++ | cpp | 1,726 | no_license | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE36_Absolute_Path_Traversal__wchar_t_connect_socket_ofstream_84_goodG2B.cpp
Label Definition File: CWE36_Absolute_Path_Traversal.label.xml
Template File: sources-sink-84_goodG2B.tmpl.cpp
*/
/*
* @description
* CWE: 36 Absolute Path Traversal
* BadSource: connec... |
f8393361f395303ef99b11e8682c0d33caa2e332 | 6e0fd4b1ba6c6bf76c7f9a08dd20d2ad762d7c9d | xtblock/chromium | /chrome/browser/ui/views/payments/payment_request_can_make_payment_metrics_browsertest.cc | C++ | cc | 35,473 | permissive | // Copyright 2017 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/macros.h"
#include "base/strings/utf_string_conversions.h"
#include "base/test/metrics/histogram_tester.h"
#include "chr... |
82558db9c0867456cb28c092773d369a4e047c13 | 8b172b34f24299ace2623dd8b2667645e901156d | royalsoftkv/dexergi | /src/qt/multisigdialog.cpp | C++ | cpp | 39,866 | permissive | /* Copyright (c) 2019-2020 The Dexergi Developers */
// Copyright (c) 2017-2019 The DEXERGI developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "multisigdialog.h"
#include "forms/ui_multisigdialog.h"
#includ... |
312bb78b235343bac9623b19b30cc9012950a5f2 | 0fd1332d76c641bc7779bbc8c1fd90ab08297378 | Shixiaowei02/Paddle | /paddle/phi/kernels/cpu/compare_kernel.cc | C++ | cc | 4,842 | permissive | // Copyright (c) 2022 PaddlePaddle 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... |
1d1da6205acdedf2c2c45c0cc25a7a9f369be4db | f7654eabb1da506cbc19878b67973ea35ff98a85 | 0lorak0/chromium | /chrome/browser/ui/views/tabs/tab_unittest.cc | C++ | cc | 35,117 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/views/tabs/tab.h"
#include <stddef.h>
#include <utility>
#include "base/macros.h"
#include "base/strings/utf_string_con... |
6b35ce65aa958af48cdd55c02a2cd877528d8cb5 | d00e98cc2b96fac95013e45fd08b04853caffbe0 | eduardohmrodrigues/competitive-programming | /UVa/cpp/01203.cpp | C++ | cpp | 998 | no_license | #include <cstdio>
#include <iostream>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
class Compare{
public:
bool operator() (const std::pair<int, std::pair<int, int>> &a, const std::pair<int, std::pair<int, int>> &b){
if(a.first == b.first) return a.second.first > b.second... |
fb6875c0e7553253fd5afa67d6e97a4b1a249c88 | 8149454532a6b71894550a75d9ec41a75b26d7dc | VB6Hobbyst7/VBAcodeConverter | /OperateVB6codeLine.cpp | C++ | cpp | 5,432 | no_license |
#include <iostream>
#include <fstream>
#include <string>
#include <list>
#include <regex>
#include <filesystem>
#include <boost/version.hpp>
#include <boost/algorithm/string.hpp>
#include "FormattingVB6Code.h"
#include "StringOperate.h"
/// <summary>
/// <para>行の分割、複合を戻す処理の手順</para>
/// <para>ファイルを全て読み込む</para>
///... |
07086f9e225007e1e7ab6da56695220f101cd744 | a3c30fa9b86abd52a67eb95857912524f1075b97 | TianyunZ/FDU-Data-Structure | /BinaryTree&LinkedList/pra10-2(2)/main.cpp | C++ | cpp | 2,728 | no_license | //µÝ¹é
#include <iostream>
#include <queue>
using namespace std;
typedef struct BinNode{
int data;
BinNode * lchild;
BinNode * rchild;
int ltag = 0;
int rtag = 0;
};
void CreateTree(BinNode * &root, int a[], int size){
queue<BinNode *> q;
BinNode * p, * t;
int i = 0;
root = new Bi... |
fc555bddb3a44ecc9d7203513c296afdddddeaf7 | 51e746e31bb225f33d46ff4d1dac84b57f97dda9 | blacksteven/flowercoin | /src/qt/editaddressdialog.cpp | C++ | cpp | 4,242 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "editaddressdialog.h"
#... |
8423463365e5a0a33ec54bfdbf49042a1766eb2c | 8b7c8557e5ed5cdfb09f4c53f237c17e695ec731 | junxuezheng/chromium | /third_party/blink/renderer/core/loader/idleness_detector.cc | C++ | cc | 8,521 | permissive | // Copyright 2017 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/core/loader/idleness_detector.h"
#include "base/logging.h"
#include "base/time/default_tick_clock.h"
#include "servi... |
42320e7f8ddff8c0ee641e6360ecf9eab2951906 | b6d03dc21e6e579ccfc4886abff4f5e3cd7f5fbb | jakehasler/datalog-interpreter | /Graph.cpp | C++ | cpp | 7,190 | no_license | //
// Graph.cpp
// DatalogInterpreter
//
// Created by Jake Hasler on 12/8/15.
// Copyright © 2015 Jake Hasler. All rights reserved.
//
#include "Graph.h"
Graph::Graph()
{
currentPostNum = 0;
currentNode = 0;
for(int i = 0 ; i < nodeGraph.size(); i++)
{
set<int> emptySet;
SCC.push... |
454d9b8ce4b199f60a528f0de791da551c5c9c36 | 97518ef3efd1fd474178f4183e795af3e1419589 | Laiwen-Li/LeetCode_Learn | /Learn/面试题03.01.三合一.cpp | C++ | cpp | 1,517 | no_license | /*
三合一。描述如何只用一个数组来实现三个栈。
你应该实现push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum)方法。stackNum表示栈下标，value表示压入的值。
构造函数会传入一个stackSize参数，代表每个栈的大小。
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/three-in-one-lcci
*/
//思路：vector的基本用法
#include <vector>
#include <iostream>
using namespace std;
class Triple... |
e4b917a244d20eb00b2fb862f108234d76bcb9f7 | e22cb89957a24c8478a9764ea41a697ee7e67094 | lejonmcgowan/SPHOpenGL | /Texture.cpp | C++ | cpp | 1,864 | permissive | #include "Texture.h"
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define STB_IMAGE_IMPLEMENTATION
#include "stb_image.h"
Texture::Texture() :
filename(""),
tid(0)
{
}
Texture::~Texture()
{
}
void Texture::init()
{
// Load texture
int w, h, ncomps;
unsigned char *data = stbi_load(filename.c_st... |
928ee5e4fe1a58543f23b117f53c513ec17fd04f | b34af70a2384b5d8aca24aa27e39b054573430be | Prakhar32/Box-Shooter | /Box Shooter/Temp/StagingArea/Data/il2cppOutput/Il2CppCompilerCalculateTypeValues_17Table.cpp | C++ | cpp | 49,325 | no_license | #include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <cstring>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <limits>
#include <assert.h>
#include "class-internals.h"
#include "codegen/il2cpp-codegen.h"
#include "AssemblyU2DCSharp_TargetMover... |
3dd3a073b44f80f13b9d838cf95ec2dd1ea4b247 | 279b33761d0fdd6ac3df4dc4b0e5826161202288 | DariaZvereva/programming | /Ray_tracing/plane.cpp | C++ | cpp | 1,063 | no_license | #include "plane.h"
#include <assert.h>
Plane::Plane() {
base = UNDEF_POINT;
first_vector = UNDEF_POINT;
second_vector = UNDEF_POINT;
}
Plane::Plane(const Point &p, const Point &v1, const Point &v2){
assert(! v1.isCollinear(v2));
base = p;
first_vector = v1;
second_vector = v2;
Point no... |
728f894ad595d5385292360c4c03bdfacf2b0ad1 | 77db371d47d6e5cfca974e36b5090b809314dde7 | sstefan1/llvm-local | /clang-tools-extra/clangd/Selection.cpp | C++ | cpp | 16,966 | permissive | //===--- Selection.cpp ----------------------------------------------------===//
//
// 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
//
//===---------------------------... |
e968a544d7796a23de115dffeb3510240597426c | 59b2ce21e4599938b93eee8e06a8f3b0c7473125 | KTXSoftware/Kha-haxelib | /Kore/Backends/Direct3D11/Sources/Kore/TextureImpl.cpp | C++ | cpp | 2,513 | permissive | #include "pch.h"
#include "Direct3D11.h"
#include "TextureImpl.h"
#include <Kore/WinError.h>
using namespace Kore;
namespace {
Texture* setTextures[16] = { nullptr, nullptr, nullptr, nullptr, nullptr, nullptr, nullptr, nullptr,
nullptr, nullptr, nullptr, nullptr, nullptr, nullptr, nullptr, nullptr };
}
Tex... |
a7cfac8abbfa984a8bfdedf774902f3427671bd2 | 7cc0a81e87df713321ec483b5424e080db7faf09 | ECS-251-W2020/chromium | /weblayer/browser/file_select_helper.cc | C++ | cc | 5,996 | permissive | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "weblayer/browser/file_select_helper.h"
#include <string>
#include "build/build_config.h"
#include "content/public/browser/render_frame_host.h"... |
f44c7c9fbfe89a1e675722e62f24ff587471cb0c | 5b17821fef65d0e4a3b27d4586bff46ee95badc7 | BackupTheBerlios/airdc-svn | /branches/2.4x/windows/CDMDebugFrame.cpp | C++ | cpp | 9,633 | 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 hope that it will... |
4a4dfc6268f27388a9d1a168cbe1cdb544f30067 | 9a6f880509937393a2605102113d51437738d35e | usdot-fhwa-stol/carma-platform | /carma_wm/include/carma_wm/collision_detection.hpp | C++ | hpp | 5,298 | permissive | /*
* Copyright (C) 2022 LEIDOS.
*
* 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 in w... |
7b4fd86a00c660d2c1c88a9566fe6814c460712e | 53b49448f3cce7595fbd61d9a47d181ba2377ed5 | PatricioTorres/AjedrezQt | /king.cpp | C++ | cpp | 4,309 | no_license | #include "king.h"
#include "game.h"
extern game * juego;
king::king(QString team,QGraphicsItem *parent):Piece(team,parent)
{
setImage();
type = "R";
}
void king::setImage()
{
if(Team== "WHITE")
setPixmap(QPixmap(":/kingW.png"));
else
setPixmap(QPixmap(":/kingB.png"));
}
void king::resi... |
dc0426485680bb757ec013015a4ab04141fcad56 | da0cfcf841b99b35034c1f5e85826bf05deca9d2 | rgr19/MpiNonBlockingProtocol | /tmp1/deep-learning/cifar10_reader.hpp | C++ | hpp | 11,808 | no_license | //=======================================================================
// Copyright (c) 2017 Baptiste Wicht
// Distributed under the terms of the MIT License.
// (See accompanying file LICENSE or copy at
// http://opensource.org/licenses/MIT)
//==================================================================... |
2358dc001b1f9a39848ccd08f48b8cc1191444e1 | 8350d694682acdd6735ef10ff99886395951c9d7 | snowzhangy/reshade | /source/effect_codegen_hlsl.cpp | C++ | cpp | 40,341 | permissive | /**
* Copyright (C) 2014 Patrick Mours. All rights reserved.
* License: https://github.com/crosire/reshade#license
*/
#include "effect_parser.hpp"
#include "effect_codegen.hpp"
#include <cmath> // signbit, isinf, isnan
#include <cstdio> // snprintf
#include <cassert>
#include <cstring> // stricmp
#include <algorith... |
5ccaa80f6966b272a0746cbfbd519791d10f0464 | a2292a66aab35cca8d4907177c17e4c00884ad9d | djkimgogo/epnr | /DJFaceAPI.cpp | C++ | cpp | 3,736 | no_license | // DJFaceAPI.cpp : Defines the entry point for the console application.
//
#include <stdio.h>
#include "cv.h"
#include "highgui.h"
#include "cvmser.h"
//using namespace std;
#define M_PI (3.1415926535897932384626433832795)
int main(int argc, char* argv[])
{
IplImage* img = 0;
IplImage* o_img = 0;
... |
72d5363482c49ddef254430c2b04eb09f6f33c4b | e5716a40f08a0c641d5538a06aa73d20079aabc3 | idaholab/raven | /crow/contrib/include/boost/fusion/view/reverse_view/reverse_view.hpp | C++ | hpp | 2,625 | permissive | /*=============================================================================
Copyright (c) 2001-2011 Joel de Guzman
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
========================================... |
a6e56b98611b03e2b1f88ab720e9097f9870b36e | 7a1fb9b22f4e5ee996a1edac9c0cd5fee5ee6703 | stanislas-brossette/manifolds | /tests/CartesianProductTest.cpp | C++ | cpp | 20,617 | no_license | // Copyright (c) 2015 CNRS
// Authors: Stanislas Brossette, Adrien Escande
// This file is part of manifolds
// manifolds 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
// 3 of the Li... |
7c450b93fbfb69f7515a5018f1fbec49ab7e9e09 | 4bd875542ac0f3e59077779d0765b1b1415bb152 | royaljain/TheEngine | /lib/src/Stochastic/RandomNumber/Distributions/DistributionTests/BeasleySpringerTest.cpp | C++ | cpp | 2,073 | no_license | #include <Stochastic/RandomNumber/Distributions/NormalDistribution/BeasleySpringer.h>
#include <assert.h>
#include <math.h>
#include <cmath>
using namespace std;
double InverseCumulativeNormal(double u)
{
static double a[4]={ 2.50662823884,
-18.61500062529,
41... |
cfe1785010803dff7f3d7922b7793d760a92ae34 | e35e1d01428e3648d9ab1c6f1d9bbaadbedba4c2 | kosfango/fips | /SEDESTA.CPP | C++ | cpp | 2,250 | no_license | // sedesta.cpp : implementation file
// IDD_SEARCH_AREA_SELECTION
#include "stdafx.h"
#include "sedesta.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
CString gSearchDestArea;
static char DlgName[]="IDD_SEARCH_AREA_SELECTION";
// ==================================... |
0538fa34034163c9f88443bc6a25d9f777ae1af2 | 3b532d62961e3f03cf63959332d5c5dd901241f1 | pplonski/catboost | /catboost/private/libs/feature_estimator/ut/feature_estimator_ut.cpp | C++ | cpp | 10,677 | permissive | #include <catboost/private/libs/feature_estimator/text_feature_estimators.h>
#include <catboost/private/libs/feature_estimator/base_text_feature_estimator.h>
#include <catboost/private/libs/options/text_processing_options.h>
#include <catboost/private/libs/text_features/bow.h>
#include <catboost/private/libs/text_feat... |
313ac3bae0bbcc7c14d63f178b3f8c79d044cf14 | 3804ba00d9a86216cf26b199f8573e6067a803ba | Ghassen-kh/Cpp_Training | /revision/standard_library/file-IO.cpp | C++ | cpp | 1,067 | no_license | #include<iostream>
#include <cstdio>
using namespace std;
int main( int argc, char ** argv ) {
const char * fn = "test.file"; // file name
const static int maxString = 1024; // read buffer size
const char * str = "This is a literal C-string.\n";
// create/write the file
printf("writing file\n");
FILE * fw = f... |
c6ab4752b53af7301488c02b102c307a34e8a245 | fc2787a3938570a72da56b1496cbabc2dbcfa60c | sandeepshiven/cpp-practice | /Tree/Binary Tree/Vertical Sum in Binary Tree/verticalSum.cpp | C++ | cpp | 1,279 | no_license | #include<bits/stdc++.h>
using namespace std;
#define null NULL
class Node{
public:
int key;
Node *left;
Node *right;
Node(int k){
key = k;
left = right = null;
}
};
void verticalSum(Node *root){
if(root == null){
return;
}
ma... |
df3ab7739e46aded4abc043a0ef2248e8e89de7a | 1b0170d29a095689689f1236ce689f68c485ebf0 | qcri/coclean | /notebook/fahes_service/fahes/csv_reader.cpp | C++ | cpp | 3,655 | no_license | /**************************************
**** 2017-4-23 ******************
**** Abdulhakim Qahtan ****************
**** aqahtan@hbku.edu.qa ****************
***************************************/
#include "csv_reader.h"
bool CSV_READER::check_file_type(std::string const & complete_name, std::string const... |
a291ec02de2ba9dc4f5fd00c12345e6c82bfd895 | 7680baa5de43916253b27e3d15c2a1ec66e27507 | alexmanno/cfony-tests | /src/Services/Faker.cpp | C++ | cpp | 852 | no_license | //
// Created by Alessandro Manno on 17/11/2017.
//
#include "Faker.h"
#include <cstdlib>
Faker::Faker() {
lastindex = 0;
}
unsigned long Faker::count() {
return Faker::names.size();
}
int Faker::getLastindex() const {
return lastindex;
}
void Faker::setLastindex(int lastindex) {
Faker::lastindex =... |
fdcea93c2d3ba15d07240f2cc8639cc3026296df | 11317e3e73cbb1c39144cde58df6cb95ceed9dd9 | tanht-lavamyth/Algorithm | /Data and Structure/Array/ArrayInitilization.cpp | C++ | cpp | 1,787 | no_license | /*
* @Author: tanht
* @Date: 2020-09-06 18:54:19
* @Last Modified by: tanht
* @Last Modified time: 2020-09-10 07:02:55
* @Email: tanht.lavamyth@gmail.com
*/
// References:
// https://docs.microsoft.com/en-us/cpp/cpp/arrays-cpp?view=vs-2019
#include <iostream>
#include <array>
using namespace std;
constexpr size... |
f5aaa64cc38a2b24c3ead358fd4a8471fc9e9134 | 2a7cf8782edd60df41720c1758ac6a0fda7e46e7 | akostecki001/nand2tetris | /07 - vm 1/vmTranslator/src/FileHandler.cpp | C++ | cpp | 3,468 | no_license | #include "FileHandler.h"
#include <sys/stat.h>
#include <unistd.h>
#include <dirent.h>
#include <iostream>
FileHandler::FileHandler(string input)
: input(input)
{
if (isFile() && isVmFile()) {
path = "";
files.push_back(string(input));
} else if (isDir()) {
if (input.back() == '/')
path = input;
else
... |
6d775394bb7a465b10059997fd4babb6651091b6 | 8be6cad9d9a746b0671c4a2aa302b2e74b534967 | mkipp/touchflow | /tools/KinectMSClient/UDPServer.cpp | C++ | cpp | 1,119 | no_license | //Headers
//#include <WinSock2.h>
//#include <Windows.h>
//#include <stdio.h>
//#include "tinystr.h"
//#include "tinyxml.h"
#include "StdAfx.h"
#include "UDPServer.h"
#pragma comment(lib,"Ws2_32.lib")
int UDPServer::startWinSock(){
WSADATA wsa;
return WSAStartup(MAKEWORD(2,0),&wsa);
}
void UDPServer:... |
7fb745e720272f076044ad80986b555aec232db0 | 4b2b4ff68a74b0103be42b6b23413a0c327e75b7 | JuneOne/LeetCode | /1001-1050/1004_max_consecutive_ones_iii.cpp | C++ | cpp | 806 | no_license | /*
* @see https://leetcode.com/problems/max-consecutive-ones-iii
*
* 最大连续1的个数（最多可以将K个值翻成1）
* Input: A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
* Output: 6
*/
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int longestOnes(vector<int>& A, int K) {
int one = 0, left = 0, m... |
ec62dd8261668b2e67eccaee772280ca05177d6f | 230ac5ea87b7861096d8f2b3a2bc0cbe71d587cb | ChilliWorks/ChilliSource | /Source/ChilliSource/Core/Container/ParamDictionarySerialiser.cpp | C++ | cpp | 6,366 | permissive | //
// ParamDictionarySerialiser.cpp
// ChilliSource
// Created by Scott Downie on 15/05/2014.
//
// The MIT License (MIT)
//
// Copyright (c) 2014 Tag Games Limited
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Soft... |
4bab3b7e0b23654bf6109f84a4d3267ddcaa27a3 | ffb9e0a46eb522d8236115d62d7a501245c604c2 | acsutt0n/code | /fitneuron/injectors/CaT.cpp | C++ | cpp | 5,249 | no_license | #include "NernstChannel.h"
// Inactivating calcium channel (mPower = 3, hPower = 1)
// Base formula from Turrigiano et al., 1995 (Ca1 in that paper)
// Cultured spiny lobster STG cells, recorded at room temperature (22-25 C)
// Adjustable with vShift, vScale, tauScale
DECLARE_SOLUTE(Ca, 2);
class CaT : public Nernst... |
e60538a81090366bc39606fd380e2e3274c9723a | 1a52d2be61b3f92851e3e2cbd8951ec25bea00cf | windystrife/UnrealEngine_NVIDIAGameWorks | /Engine/Source/Runtime/SlateCore/Private/Rendering/SlateRenderer.cpp | C++ | cpp | 3,846 | permissive | // Copyright 1998-2017 Epic Games, Inc. All Rights Reserved.
#include "Rendering/SlateRenderer.h"
#include "Textures/TextureAtlas.h"
#include "Fonts/FontCache.h"
#include "Fonts/FontMeasure.h"
#include "Widgets/SWindow.h"
/* FSlateFontCacheProvider interface
*********************************************************... |
34d96919d4ecb9c8c16df58d464a1e2e5a5e0f49 | 58682aa63e7dc9f213aa106fb68f447fb49dfa12 | amorecoin/amorecoin | /src/test/amount_tests.cpp | C++ | cpp | 3,668 | permissive | // Copyright (c) 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.
#include "amount.h"
#include "policy/feerate.h"
#include "test/test_bitcoin.h"
#include <boost/test/unit_test.hpp>
BOOST_FIXTURE... |
8841168ba89283bbbe458036212126ac0e364e64 | 65d6f512f3c858d42aadc8058667026d38632d62 | 101vinayak/Cpp-course | /Lecture-3/operators.cpp | C++ | cpp | 290 | no_license | #include<iostream>
using namespace std;
int main(){
int x = -10;
//cout<<x--<<endl;
int y = 6;
/*
cout<< (x&y) <<endl;
cout<< (x|y) <<endl;
cout<<(x^y)<<endl;
cout<<(~y)<<endl;
*/
/*
cout<< (x<<2)<<endl;
cout<< (x>>1)<<endl;
*/
/*
x = 10;
x+=20;
*/
int q = 10;
cout<<(q++ + -n)<<endl;
}
|
321fa1d8be7da921ba5d10731a6f423ef2c375fc | 74a296ba8f672e21773ec3a16ed6230dd850e668 | Kiritow/OJ-Problems-Source | /HDOJ/1985_autoAC.cpp | C++ | cpp | 539 | no_license | #include<stdio.h>
#include<string.h>
int main()
{
double n;
int t,i;
char a[3];
scanf("%d",&t);
i=1;
while(t--)
{
scanf("%lf %s",&n,a);
if(strcmp(a,"kg")==0)
printf("%d %.4lf lb\n",i,n*2.2046);
else if(strcmp(a,"lb")==0)
printf("... |
684c01b82d6088e21703a7db0aa55c0a68b5bf45 | 080b12f970c54aea80dee27a260c55914e20e07a | Clepoy3/LeakNet | /cl_dll/tf2_hud/playerandobjectenumerator.cpp | C++ | cpp | 1,910 | no_license | //========= Copyright © 1996-2002, Valve LLC, All rights reserved. ============
//
// Purpose:
//
// $NoKeywords: $
//=============================================================================
#include "cbase.h"
#include "playerandobjectenumerator.h"
#include "tf_shareddefs.h"
// Enumator class for rag... |
aa01e1a2576bd2852af6709bf85f4bbea407c898 | 8f570f609ebe053f39c7d76b0904b07d41d082e5 | MACKHITH/C- | /source/moltiplicazione_senza_x2.cpp | C++ | cpp | 687 | permissive | //scrivere un programma che legge da tastiera num1 e num2 (interi) e calcola ris=num1*num2 senza usare gli
//operatori *, / o mod (prova a farlo con un solo ciclo facendo diventare num1 e num2 positivi e poi regolandoti
//per il segno finale)
#include <iostream>
using namespace std;
int main(int argc, char con... |
09a4a2fb7c6eb228f56e25aeff0243f6f6da2bb9 | a73a9e7d4c94ac360f56a606f248a77411063d22 | willruggiano/folly | /folly/futures/test/RetryingTest.cpp | C++ | cpp | 14,461 | permissive | /*
* Copyright (c) Facebook, Inc. and its 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 applic... |
a8accacdbb82c846e5754466c738841f44109ab7 | f6cadced280db5f683ab4727babeb533d58a7c9d | Fooway/saga-cpp | /tools/shell/init.cpp | C++ | cpp | 961 | permissive | // Copyright (c) 2005-2008 Andre Merzky
//
// 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 "saga-shell.hpp"
// re-init the session, which should cause all adaptors to be reloaded.
// Note that the old ... |
82be54209df4dcf13e82109d420fb786399ca25a | d08549a2c7e92f779b90042776dc9283722ff249 | yuri410/rpg | /external/DirectXShaderCompiler/tools/clang/test/SemaCXX/warn-self-move.cpp | C++ | cpp | 1,604 | permissive | // RUN: %clang_cc1 -fsyntax-only -Wself-move -std=c++11 -verify %s
// definitions for std::move
namespace std {
inline namespace foo {
template <class T> struct remove_reference { typedef T type; };
template <class T> struct remove_reference<T&> { typedef T type; };
template <class T> struct remove_reference<T&... |
5c042171212a3b9ab1b39cb58cb4d02e116289b0 | 662d1da0ba74125f7766e61eb067a24415ec1f55 | aydar-sheffield/Chaste | /pde/test/pdes/NonlinearEllipticEquation.hpp | C++ | hpp | 2,764 | permissive | /*
Copyright (c) 2005-2019, University of Oxford.
All rights reserved.
University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.
This file is part of Chaste.
Redistribution and use in source and binary forms... |
78902be8d5178fdaa51195977f18a2d805202eba | 6327281a9feb07178fccb183b029c65a5809f672 | Rakatashii/cpp_ch11 | /P11_2/P11_2/employee.hpp | C++ | hpp | 1,605 | no_license | /*
Exercise P8.3.
Derive a class Manager from Employee. Add a data field, named department, of type string. Supply a function print that prints the manager’s name, department, and salary. Derive a class Executive from Manager. Supply a function print that prints the string Executive, followed by the information store... |
4ce225b1b8dea74c47d3dff23d84faca182070e0 | a8ceb13e14b0d0203a0dab021f14a03938a522df | Ewenwan/LeetCodeSolution-1 | /143/solution.cpp | C++ | cpp | 938 | no_license | #include "../solution.h"
class Solution {
public:
void reorderList(ListNode* head) {
int len = 0;
ListNode *cur = head;
while(NULL != cur){
len++;
cur = cur->next;
}
if(len <= 2)
return;
ListNode *pre = head;
for(int i=0; ... |
7d4eac06dbf70a0066fed59c3aca035933264cad | 265706c08b90a000b929bcc7d395fd0bf9ab9d07 | ChristianWacker/Aurora | /Clients/OpSys2/OpSys2.cpp | C++ | cpp | 19,838 | permissive | //--- Aurora/Clients/Opsys2/OpSys2.cpp -----------------------------------------
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//------------------------------------------------------------------------------
#include "Clients/OpSys2/OpSys2.h... |
d899c81e420bdfcb7e51c45cde24d09359b99a51 | a9b3f5826166c49c6efae833dbdcf713385b5a69 | zv-proger/ol_programms | /acmp/0692.cpp | C++ | cpp | 1,329 | no_license | /*
Автор кода: Вадим Зинов (zv.proger@yandex.ru)
Решение задачи 0692 с сайта acmp.ru
*/
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
const int inf = 1e9;
using ll = long long;
using pii = pair<int, int>;
template <class A> void print(A a) { cout << a << ' ';... |
29a79713d86ce8e08702eff008ac464693d0478f | ab7e39bdea4cc223a440e3d4b9171ddd47cb0778 | akhikolla/InformationHouse | /hutilscpp/inst/testfiles/max_charsize/max_charsize_DeepState_TestHarness.cpp | C++ | cpp | 869 | no_license | // AUTOMATICALLY GENERATED BY RCPPDEEPSTATE PLEASE DO NOT EDIT BY HAND, INSTEAD EDIT
// max_charsize_DeepState_TestHarness_generation.cpp and max_charsize_DeepState_TestHarness_checks.cpp
#include <fstream>
#include <RInside.h>
#include <iostream>
#include <RcppDeepState.h>
#include <qs.h>
#include <DeepState.hpp>
in... |
08f706fd865bc6dc5a07c8551c2ff9b0f2e30dba | 32fd03ffbcffee09419d67cf65a3b2efd5d99ad7 | nNbSzxx/ACM | /多校18/7.30第三场/1013 floyd分块.cpp | C++ | cpp | 2,617 | no_license | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX = 55;
const int INF = 0x3f3f3f3f;
int dis[210][MAX][MAX]; // dis[i, u, v] 恰好走i条边从u到v的最短距离
int disleast[210][MAX][MAX]; // disleast[i, u, v] 至少走i条边从u到v的最短距离
int dis100[110][MAX][MAX]; // dis100[i, u, v] 恰好走10... |
f664b7620fc05d40dc3d49f251e67f3b13c088a5 | f292605c2f4b4bfda2075f636aa9ca1d6dff98e5 | VarunRajPanigrahy/CompetetiveCodes | /longest_common_substring.cpp | C++ | cpp | 862 | no_license | #include <iostream>
using namespace std;
int main() {
//code
int tc;
cin>>tc;
while(tc--)
{
int X,Y;
cin>>X>>Y;
cin.ignore();
string s1,s2;
getline(cin,s1);
//cin.ignore();
getline(cin,s2);
int dp[X+1][Y+1];
int lcs = 0;
int x1,y1;
for(int i=0;i<=X;++i)
... |
13d4ed5d6022096fc9aa1f786fd02f2be0ff4bd8 | 369a7a2063ca534d60a6b872a3956aae36cf58af | 1214wuai/LeetCode | /整数转罗马数.cpp | C++ | cpp | 445 | no_license | string intToRoman(int num) {
vector<string> s = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
vector<int> v = {1000,900,500,400,100,90,50,40,10,9,5,4,1};
int index = 0;
string res;
while(index<13)
{
while(num>=v[index])
{
... |
edb9081c259d4b6bb516e65121d502b140e09f1a | b843d9d132dd619aea8b4db5aa877d3cd62d0ac0 | Balthazar6969/T2K | /psyche/psycheSelections/v3r25/src/antiNueCCFGD2Selection.hxx | C++ | hxx | 2,124 | no_license | #ifndef antiNueCCFGD2Selection_h
#define antiNueCCFGD2Selection_h
#include "SelectionBase.hxx"
#include "Parameters.hxx"
#include "ToyBoxTracker.hxx"
#include "SystId.hxx"
#include "SubDetId.hxx"
#include "nueCCFGD2Selection.hxx"
class antiNueCCFGD2Selection: public SelectionBase{
public:
antiNueCCFGD2Selection(b... |
81fbbda27f49e8816b8a4c9d7c5f8669b72a5726 | f65276c5df167d7421e08e48b5b72b359afe34c0 | curtkim/c-first | /torch-first/utils/image_io.cpp | C++ | cpp | 6,016 | no_license | #include "image_io.h"
#include <torch/torch.h>
#define STB_IMAGE_IMPLEMENTATION
#include "stb_image.h"
#define STB_IMAGE_WRITE_IMPLEMENTATION
#include "stb_image_write.h"
#define STB_IMAGE_RESIZE_IMPLEMENTATION
#include "stb_image_resize.h"
namespace image_io {
namespace {
void norm_ip(torch::Tensor img, doub... |
38531b67f8355dc84d62a7ee9fc7e222544915ee | 54b3e5ded1078240f263dd4f2906dec6e2e613db | NeGaT1Ve928/LabOOP | /Strings/DecString.cpp | C++ | cpp | 618 | no_license | #include "DecString.h"
#include <bitset>
using namespace std;
DecString::DecString(string _name, string _val) :
name(_name + " (DecString)") {
val = to_string(
BinaryToDecimal(
ConvertToBinary(_val)
)
);
}
DecString DecString::operator+(DecString a) {
s... |
bcfa42d4d375a87d54dd73d48ac6d49a33a684db | 2888d204220229d06c3a2fe584d6150982d19d43 | scherman/tp2-algo1 | /src/drone.cpp | C++ | cpp | 15,194 | no_license | #include "drone.h"
#include <cstdlib>
#include <iostream>
#include "campo.h"
#include <algorithm>
#include "auxiliares.h"
Drone::Drone()
{
this->_id = rand() % 200;
this->_productos = {Fertilizante, Fertilizante, PlaguicidaBajoConsumo};
this->_bateria = 100;
this->_enVuelo = false;
this->_trayectoria = Secuencia... |
fbf5cd84f5c3217ab51a31a1275509590163cb21 | d95d2837ab813d42f97c6c0d5dd9fb5ffeb4b408 | pharick/cpp | /1-year/8-switch/eyes.cpp | C++ | cpp | 235 | no_license | #include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
switch (x) {
case 1: cout << "Cyclop"; break;
case 2: cout << "Earthman"; break;
default: cout << "Multieye";
}
return 0;
}
|
eb3ef7a621639067bc05c178afe312f84b44158a | 9081bcffa7069351b111293f66e45d76f20840f1 | RobotJustina/qr_reader | /src/main.cpp | C++ | cpp | 1,009 | no_license | #include <cstdlib>
#include <string>
#include <vector>
#include <sstream>
#include <boost/bind.hpp>
#include "RosNode.h"
#include "QRDecoder.h"
// Topic where camera images came from.
#define IMAGE_SOURCE "camera/image"
// Topic for publishing recognized text in QR codes.
#define RECOGNIZED_TEXT "recognized"
using... |
b54a3bed3c86b2c900ee33169201c60d83a0c8e0 | 3ec3cace4d6cba5ce6004a47ad2eaf7d806fcf52 | KhronosGroup/VK-GL-CTS | /external/openglcts/modules/gles31/es31cSeparateShaderObjsTests.hpp | C++ | hpp | 1,516 | permissive | #ifndef _ES31CSEPARATESHADEROBJSTESTS_HPP
#define _ES31CSEPARATESHADEROBJSTESTS_HPP
/*-------------------------------------------------------------------------
* OpenGL Conformance Test Suite
* -----------------------------
*
* Copyright (c) 2014-2016 The Khronos Group Inc.
*
* Licensed under the Apache License, ... |
2c407f4d673510f31fc12e232a642c1c5e9ea5c8 | b972a04b46fa352e9b50bb11fef26f886627e71f | Neurodrive/Unreal-Engine-Fundamentals | /UE4Fundamentals10/Source/UE4Fundamentals10/Props/DestructibleProp.cpp | C++ | cpp | 4,017 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "DestructibleProp.h"
#include "Engine.h"
// Sets default values
ADestructibleProp::ADestructibleProp()
{
// Set this actor to call Tick() every frame. You can turn this off to improve performance if you don't need it.
Primary... |
b575052584a5a5212a56025e283d07f14f4c157d | f7242ce8586739f3ed3f455f5e4c20f73c197ec7 | UnforeseenOcean/xbox-live-api | /Source/Services/Achievements/WinRT/Reward_WinRT.cpp | C++ | cpp | 1,472 | permissive | //*********************************************************
//
// Copyright (c) Microsoft. All rights reserved.
// THIS CODE IS PROVIDED *AS IS* WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING ANY
// IMPLIED WARRANTIES OF FITNESS FOR A PARTICULAR
// PURPOSE, MERCHANTABILITY, OR NON-INFRINGEMENT.
... |
c74821ae7c7f96c5b921d014885a983fd5aab2d9 | d01a4f27cf832807c6176bf50c52ae06ab12d91d | JMK92/C_pp_Programming | /Day005/Inheritance_2/inheritance_2.cpp | C++ | cpp | 1,246 | no_license | /*
친구 : 이름, 연락처
중학교 : 이름, 연락처, 주소
고등학교 : 이름, 연락처, 주소, 취미
대학교 : 이름, 연락처, 학과
사회 : 이름, 연락처, 직장, 직급
*/
#include<iostream>
#include<string>
using namespace std;
class AAA {
public :
int x;
AAA(int x):x(x){}
};
class BBB : public AAA {
public:
int y;
//BBB(int y):y(y) {} // AAA 의 생성자를 초기화 하지 못해서 '{}' 빨간색이 뜸,
... |
6cdee4aab0a6ca839830a69ad67018da6df0a8a3 | 363de9e344344a13a07446172114dee52d533fa9 | connectthefuture/psdmrepo | /PSTime/tags/V00-01-08/src/Duration.cpp | C++ | cpp | 11,619 | no_license | //--------------------------------------------------------------------------
// File and Version Information:
// $Id$
//
// Description:
// Class Duration...
//
// Author List:
// Mikhail S. Dubrovin
//
//------------------------------------------------------------------------
//-----------------------
// This C... |
2db449cd26bc1e5d13df656ad02ea7a72f2b6169 | e83ccb9c0690a9b736bd5821556e2c321d8ab2e4 | JohnHonkanen/penguine | /Engine/ColliderSpawn.cpp | C++ | cpp | 966 | no_license | /*
Name: Lars Anthony Palm
Student ID: B00294272
I declare that the following code was produced by Lars Anthony Palm, John Christopher Arnon Honkanen as a group assignment for the GED module and that this is our own work.
I am aware of the penalties incurred by submitting in full or in part work that is not our own... |
9f3d60b6e24813e790b38f65f9a9e0ddd59be456 | 20784b54c86f8236fe49ba71aff19f1cd69945c9 | arslansadiq/DaRefl | /source/darefl/mainwindow/simulationwidget/sidecontroller.cpp | C++ | cpp | 2,329 | no_license | // ************************************************************************** //
//
// Reflectometry simulation software prototype
//
//! @license GNU General Public License v3 or higher (see COPYING)
//! @authors see AUTHORS
//
// ************************************************************************** //
#inc... |
6ac82d9ed5ba1db875f09a152d5e233696c507d1 | d04136f8e068a9210e0b72cea693c31a2f2f07c2 | reaper-oss/sws | /Fingers/Envelope.cpp | C++ | cpp | 5,336 | permissive | #include "stdafx.h"
#include "Envelope.h"
#include "RprStateChunk.h"
RprEnvelopePoint::RprEnvelopePoint(RprEnvelope *parent /* = NULL */) :
m_time(0.0), m_parameterValue(0.0), m_envelopeShape(Linear),
m_selUnknown(0), m_selected(0), m_bezierUnknown(0),
m_bezierTension(0.0), m_parent(parent)
{
}
void
RprEn... |
00e0aca74efc6850b6ff8b06fa236926d8c4366a | 2abd343d8810c3645d07794bf46a87ce3d1d159e | weimingtom/httpcontentparser | /projects/MainUI/DlgSearchRule.cpp | C++ | cpp | 5,540 | no_license | // DlgSearchRule.cpp : 实现文件
//
#include "stdafx.h"
#include "MainUI.h"
#include "DlgSearchRule.h"
#include "globalvariable.h"
#include ".\dlgsearchrule.h"
#include <com\comutility.h>
#include <typeconvert.h>
#include <logger\logger.h>
// CDlgSearchRule 对话框
IMPLEMENT_DYNAMIC(CDlgSearchRule, CDialog)
CD... |
54c4e145d4846ffc9b6e1436bb334d4bf9c5baa0 | 87943d513f0fda63e9cc1ce1dd05ff760eb419e7 | AndyJMR/ITK | /Modules/Core/Common/test/itkThreadedIteratorRangePartitionerTest3.cxx | C++ | cxx | 12,366 | permissive | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* h... |
fea5c04d53fb8be5fd9c5e7e4f7b222b990d55cd | 10689a7b522c64bfea592c9fc4fc47a9f03319e4 | sapostolakis/noelle | /tests/unit/loop_invariant_code_motion/suite/simple_load_store/test.cpp | C++ | cpp | 761 | permissive | #include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <math.h>
int main (int argc, char *argv[]){
if (argc < 2){
fprintf(stderr, "USAGE: %s LOOP_ITERATIONS\n", argv[0]);
return -1;
}
auto iterations = atoll(argv[1]);
if (iterations == 0) return 0;
long long int *array = (long long int... |
0349f27b4f9016eed143161270dc51f83f34b232 | 175802a5f33d3b1cd81ec449ed67b7a72abaee73 | yaobinwen/tpm-js | /src/tss_adapter.cc | C++ | cc | 6,486 | permissive | // Copyright 2018 Google LLC
//
// 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 in ... |
9e6b71b78edf6486e21eb312f30bf2b3212e219e | 17d0936e6f4fbc9dea0b7b8602a13fe3b1ab2449 | supreethms1809/mpas-insitu | /Source/PV/build/VTK/Wrapping/Python/vtkPVClientServerCoreDefaultPythonInitImpl.cxx | C++ | cxx | 2,481 | no_license | // Generated by vtkWrapPythonInit in VTK/Wrapping
#include "vtkPython.h"
#include "vtkSystemIncludes.h"
#include <string.h>
// Handle compiler warning messages, etc.
#if defined( _MSC_VER ) && !defined(VTK_DISPLAY_WIN32_WARNINGS)
#pragma warning ( disable : 4706 )
#endif // Windows Warnings
extern "C" {VTK_ABI_EXPO... |
3ae9916b344e52ec83e0c146d679eb6f5ccf32a9 | 851c94e324f12154865699d8044840f1b32f33fd | imulan/procon | /yukicoder/466.cpp | C++ | cpp | 1,525 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
typedef pair<int,int> pi;
... |
3181f30923aafd51b17470a574e1ba8fea4d2e2c | 910d876b43c16a46cf09918de4df944726bf9d79 | LeandroPerrotta/DarghosTFS04_87 | /0.3/a1/ioban.cpp | C++ | cpp | 15,002 | no_license | //////////////////////////////////////////////////////////////////////
// OpenTibia - an opensource roleplaying game
//////////////////////////////////////////////////////////////////////
//
//////////////////////////////////////////////////////////////////////
// This program is free software; you can redistribute it ... |
9d85c5d5bd831d37ff0cc9cee97e32e70aded7b0 | 6f5d2c30e8ac9ffeef4b3e45e8cb5f2c0fd3e320 | zH4x/RoCo-SDK | /SDK/RoCo_FriendlyLobbyCharacter_structs.hpp | C++ | hpp | 262 | no_license | #pragma once
// Rogue Company (0.59) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "RoCo_Basic.hpp"
#include "RoCo_LobbyMainCharacter_classes.hpp"
#include "RoCo_Engine_classes.hpp"
namespace SDK
{
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
|
b9d7939dd4d49649e90c882fa88bda36d81bb7c4 | 8d36906cad936f5693a24fbc116649dfb5a787cb | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_Moschops_Chibi_AnimBP_functions.cpp | C++ | cpp | 1,060 | permissive | // ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_Moschops_Chibi_AnimBP_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//------------------------------------------------------------... |
314349e1da3427524cd2bbddae7b08c481408535 | e2420b4fff3d323c08cf750eb745c27d1ab709a3 | i-RIC/prepost-gui | /apps/rivmaker/data/points/pointspreprocessorview.cpp | C++ | cpp | 1,493 | permissive | #include "pointspreprocessorview.h"
#include "../../geom/geometrypoint.h"
#include <QFont>
#include <QPainter>
#include <QRectF>
namespace {
int LEGEND_FONTSIZE = 10;
} // namespace
const int PointsPreProcessorView::LEGEND_WIDTH = 170;
const int PointsPreProcessorView::LEGEND_TOPMARGIN = 10;
const int PointsPrePro... |
6a55740b4f1178fd4e61ffa31935626ebdf8c35e | d13b2abb4cef78bfb7f65cb4da89042bb6b3456d | chemiczny/automateusz_gto_d2 | /include/gto_d2_kit/d2_ee_pdss_AA.hpp | C++ | hpp | 683 | no_license | #ifndef D2_EE_PDSS_AA_HPP
#define D2_EE_PDSS_AA_HPP
void second_derivative_ee_1200_11( const double ae,
const double xA,
const double yA,
const double zA,
const double be,
const double xB,
const double yB,
const double zB,
const double ce,
const double xC,
const double yC,
... |
b8f2f81b712c51b95cc2ebf7e50a47b553df2b22 | ebe043db28d01d02db9a4872c06b793a65129677 | 0x000922/C_programming | /C++/recursion_probs/warm_ups/5_sorted_bst.cpp | C++ | cpp | 846 | no_license | #include <bits/stdc++.h>
typedef struct TreeNode
{
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x);
TreeNode();
} node;
using namespace std;
TreeNode::TreeNode()
{
left = nullptr;
right = nullptr;
}
TreeNode::TreeNode(int x)
{
val = x;
left = nullptr;
... |
49246badf1ae0f6506428904a3181863f7cfb7c9 | eb630c2c081b30df1767410f266af5331d01b27d | ivens-bruno/Logica_de_Programacao | /trabalho 1004/Questao15/Questao15/Questao15.cpp | C++ | cpp | 834 | no_license | /* 15. Três amigos, Carlos, André e Felipe. decidiram rachar igualmente a conta de um bar. Faça
um algoritmo para ler o valor total da conta e imprimir quanto cada um deve pagar, mas faça
com que Carlos e André não paguem centavos.Ex: uma conta de R$101, 53 resulta em R$33, 00
para Carlos, R$33, 00 para André e R$35, 5... |
507e123887fcce03ebc8cbc1a68c2071a57993a4 | cdb6898e4178d54f918dee30e0293a16e833c5ef | gutaussehend-Harshal/Leetcode | /lc_partition_list.cpp | C++ | cpp | 823 | no_license | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode*... |
144e1e40de48da5ef54fe04a418e62fe31b78cbd | 6c55e3d4b15fd214e66fc8183218e97c2c0309e6 | kn-rusan/FreeProject | /sample_cm/CM001.cpp | C++ | cpp | 3,164 | no_license | /*****************************************************************************************************
CM001.cpp
CM001 basic mode Ver.1.0
2009.2.23 M.Utsumi@EasLogic
******************************************************************************************************/
#include<windows.h>
#incl... |
e54b03fe0910a93b022cc28d21c97543dac05601 | d6edcdf01c69cfa73d9713011a8e434cf50c3901 | GeorgiyX/TP-CCpp-HW1 | /project/testing/src/utils.cpp | C++ | cpp | 3,602 | no_license | #include <fstream>
#include <streambuf>
#include "utils.h"
const std::string OUT_STREAM_FILE = "custom_out.txt";
const std::string IN_STREAM_FILE = "custom_in.txt";
std::string file2string(const std::string &path) {
std::ifstream in(path);
std::string testOutput;
in.seekg(0, std::ios::end);
testOutput... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.