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 |
|---|---|---|---|---|---|---|---|---|
7423e4cfb23963fa9fa74c363cd506adcf6f8309 | 05be36934abd2fe00cd3cf863b8d7a347a915487 | kyuya11/d-team | /saisin/Player3.cpp | C++ | cpp | 6,583 | no_license | #include "DxLib.h"
#include "SceneMgr.h"
#include "Input.h"
#include "Player.h"
#include "Enemy.h"
#include "Effect.h"
#include "ITEM.h"
#include <math.h>
int HitCirclePlayerShot(ENEMY*, PLAYER_SHOT*);
struct PLAYER mPlayer;
struct PLAYER_SHOT mPlayerShot[PLAYER_SHOT_MAX];
static int mImagePlayer; ... |
ff4fd5da0e92bc33edf63613b68a03ec1dd2d621 | 60fb955ddb421b92ac89712acca40500022d24fa | haijianliu/dungeon-tease | /Vania3D/Mesh/Quad.cpp | C++ | cpp | 1,438 | no_license |
#include "Engine.hpp"
/*------------------------------------------------------------------------------
< Constructor >
------------------------------------------------------------------------------*/
Quad::Quad() {
unsigned int vbo;
float quadVertices[] = {
// positions // texture Coords
-1.0f, 1.0f, 0.... |
2a9477b84195d4a011ec550dbf6e12cad6107838 | a7659670a1076b5f6bfe2084bae8ed0920f4d087 | pedris11s/coj-solutions | /lmm-p2647-Accepted-s540494.cpp | C++ | cpp | 294 | no_license | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
LL MOD;
int main()
{
int t;
cin >> t >> MOD;
while(t--)
{
LL N;
cin >> N;
LL sol = ((N % MOD) * (N % MOD)) % MOD;
cout << sol << endl;
}
return 0;
}
|
4046e2107b1c5148f99612b81349c567722a6cc5 | 714ff7ab150602ae5361e9f200fdab76e623e5f4 | soulrpg/Sokoban | /Game_manager.cpp | C++ | cpp | 4,376 | no_license | #include "Game_manager.h"
#include "Game_object.h"
#include "Movable_object.h"
#include "Storage_location.h"
Game_manager::Game_manager(int max_levels) {
Game_manager::choice = ' ';
Game_manager::level_load_id = 0;
Game_manager::number_of_levels = max_levels;
main_menu();
}
// Funkcja zajmujaca sie komunikacja z ... |
87b4b3685810dffd8db4ed9251354e23a4896a6d | e632987438d52eb7ced43e5947242ef38e8984d6 | nzivkovi/Mathbot_arduino | /PID.cpp | C++ | cpp | 505 | no_license | #include "PID.h"
PIDController::PIDController(double k_p, double k_i, double k_d)
{
this->k_p = k_p;
this->k_i = k_i;
this->k_d = k_d;
this->E = 0.0;
this->e_old = 0.0;
}
void PIDController::reset_errors()
{
this->E = 0.0;
this->e_old = 0.0;
}
double PIDController::execute(double error, double dt)
{
... |
d7b55ece483a706d58ef76ee0db3d400d4457d04 | 378eb959379f29998c42030761331193e8860139 | maxwell-zhengxu/compute-runtime | /unit_tests/program/process_debug_data_tests.cpp | C++ | cpp | 4,596 | permissive | /*
* Copyright (c) 2018, Intel Corporation
*
* 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, merge, publis... |
36fd7c4051b0db88b0a6d56021001758158b4134 | 78adb29166856725adeec93852e9e047f3aeba6a | SandorSu/DataStructure-Algorith | /LinkedList.cpp | C++ | cpp | 9,147 | no_license | #include<iostream>
using namespace std;
struct Node
{
int data;
struct Node* next;
};
void display(Node *p)
{
while(p != NULL)
{
cout<<p->data<<" ";
p = p ->next;
}
}
Node* create(int A[], int n)
{
Node *p = new Node;
Node *start = p;
p -> data = A[... |
eba165688240fc0614f62c4d5a3382ec6e762c8b | d5edaf903629227d782d5cb1713b1398f25b5ddb | linsallyzhao/earlyobjects-exercises | /2015/chapter_9/examples/9_3.cpp | C++ | cpp | 2,309 | no_license | #include <iostream>
#include <string>
class Inventory
{
private:
std::string itemCode;
std::string description;
double price;
public:
Inventory()
{
itemCode = "XXX";
description = " ";
price = 0.0;
}
Inventory(std::str... |
839410ed16857a05b3b64d23c9bc570cd964da98 | e74c9209066b6cdc65eea5ae74c0908d10f8072c | silver005/GossipCoinCore | /src/test/zerocoin_denomination_tests.cpp | C++ | cpp | 21,495 | permissive | // Copyright (c) 2012-2014 The Bitcoin Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "amount.h"
#include "chainparams.h"
#include "coincontrol.h"
#include "denomination_functions.h"
#include "main.... |
ff10a9324870db6de27707fd73377ac7e89084fb | ae802c445e2e7c091c693951c9284c196ea0d80e | felixpj2001/Computer-Graphics-Oefeningen | /Oefeningen_les_7/raytracer/src/Vec3.cpp | C++ | cpp | 3,235 | no_license | // Vec3.cpp: implementation of the Vec3 class.
//
//////////////////////////////////////////////////////////////////////
#include "Vec3.h"
#include <math.h>
#include <stdio.h>
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
/////////////////////////////////... |
5752013465dd79396231179ef9410cc887e7228e | b8b4e17d00a389a89c5f3453587848c27fb1efb2 | SEESAI/MAVSDK | /src/integration_tests/telemetry_async.cpp | C++ | cpp | 16,254 | permissive | #include <iostream>
#include <iomanip>
#include <ctime>
#include "integration_test_helper.h"
#include "mavsdk.h"
#include "plugins/telemetry/telemetry.h"
#define CAMERA_AVAILABLE 0 // Set to 1 if camera is available and should be tested.
using namespace mavsdk;
static void receive_result(Telemetry::Result result);
s... |
15877693194a26780b9d5e22182bce2f81c132ba | 0a7395e5c5d31a1ad2e7406ca79d4b0e3a065836 | AditiKandhway/30daysofcodewithgfg | /Solution1.cpp | C++ | cpp | 348 | no_license | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
void helpclassmates(ll a[],ll n)
{
vector<ll> b(a,a+n);
for(int i=0;i<n;i++)
{
a[b[i]]=b[b[b[i]]];
}
}
int main()
{
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
helpclassmates(a,n);
for(int i=0;i<n;i++... |
97abd098159106cb3c3934affd427189f5d2e7e3 | 8f674652ab7c8ea08acfb110573f3cfa724031a0 | nanocurrency/diskhash | /unittests/os_wrappers_tests.cpp | C++ | cpp | 1,169 | permissive | #include <utility>
#include <cassert>
#include <os_wrappers.h>
#include <helper_functions.hpp>
void os_wrappers_dht_delete_file_works ();
void os_wrappers_dht_open_file_creates_file ();
int main (int argc, char ** argv)
{
printf ("os_wrappers_dht_delete_file_works ():\n");
os_wrappers_dht_delete_file_works ();
... |
c9624cb43ea83d290791407f023d168f206e41ed | ebae82ffc6d07a35142bddbad1521fc36c664a0a | mfkiwl/OmniCV-Lib | /ros_files/src/fisheye2equirect.cpp | C++ | cpp | 2,239 | permissive | #include <ros/ros.h>
#include<ros/package.h>
#include <image_transport/image_transport.h>
#include <cv_bridge/cv_bridge.h>
#include <sensor_msgs/image_encodings.h>
#include <std_msgs/Float32.h>
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/highgui/highgui.hpp>
#include "utils.hpp"
static const std::string O... |
d08b9927035f6b642427e9f0d7467bd871d396c1 | dce08d37fc568b66e949cb7051633598b3f97a51 | UAVXP/CorRMPSrc | /src/game/server/gameinterface.cpp | C++ | cpp | 94,288 | no_license | //===== Copyright © 1996-2005, Valve Corporation, All rights reserved. ======//
//
// Purpose: encapsulates and implements all the accessing of the game dll from external
// sources (only the engine at the time of writing)
// This files ONLY contains functions and data necessary to build an interface
// to extern... |
81d899eb01b46be4421c20df34ec12672a19a053 | 8b401a5f441b8b658f48993ecf763992cc59b088 | SimulationEverywhere-Models/CDPP-BATTLE | /kattack.cpp | C++ | cpp | 2,609 | no_license | /*******************************************************************
*
* DESCRIPTION: Atomic Model Receiver
*
* AUTHOR: Tao Zheng
*
* EMAIL: mailto://zhengtao@sce.carleton.ca
*
* DATE: 15/10/2002
*
*******************************************************************/
/** include files **/
#include "kattack.h" ... |
ecf4bfeffea910e6c768d38f1187f32633b80b13 | 5dfc1e838c8db8f6bbc96732d06756fd7539578f | MaxIGL/my_work | /my_pcl_tutorial/src/essai2.cpp | C++ | cpp | 1,705 | no_license |
#include <ros/ros.h>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <pcl/filters/extract_indices.h>
#include <pcl/segmentation/progressive_morphological_filter.h>
#include <pcl_conversions/pcl_conversions.h>
#include <pcl/point_cloud.h>
#include <sensor_msgs/PointCloud2.h>
ros::Publisher pub;
vo... |
b3dd8506c4ca18ab16aba2df4050d3db7433e3db | 4c2263d04fa34eef83958048d2908392d35504a9 | PDi-Communication-Systems-Inc/lollipop_external_chromium_org | /third_party/webrtc/modules/video_capture/test/video_capture_unittest.cc | C++ | cc | 23,399 | permissive | /*
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... |
f4549af74770596803e37c5f10fe55d677aaeeea | fbf970ad43d97fbd8b8273a1de00700aa44d96e6 | wmarshall484/bio-3 | /main.cpp | C++ | cpp | 658 | no_license | #include <iostream>
#include "UPGMABuilder.hpp"
#include "NeighborJoiner.hpp"
using namespace std;
int main(int argc, char ** argv){
if(argc!=3){
cout<<"USAGE:./main <treetype> <infile.grid>"<<endl;
cout<<"treetype is either 0 for UPGMA tree or 1 for Neighbor joining tree"<<endl;
cout<<"infile.grid is ... |
a0957a70044f836008c031feb76c76a2a216d353 | 5379d5ac4ebebe1e077ae1067a387ce7a2213d2e | jiansunpurdue/OpenHF | /plugins/HFDs2KstarKaon.cc | C++ | cc | 4,198 | no_license | #include "HFDs2KstarKaon.h"
#include "FWCore/Framework/interface/MakerMacros.h"
#include "UserCode/OpenHF/interface/TAna01Event.hh"
#include "UserCode/OpenHF/interface/HFMasses.hh"
#include "UserCode/OpenHF/interface/HFTwoParticleCombinatoricsNew.hh"
using std::cout;
using std::endl;
// -- Yikes!
extern TAna01Even... |
5e42ee6a8f81341a8c79528b17b976334003982e | 905591354b81c6df7b6740b25d725059d97bb50e | ccdxc/logSurvey | /data/crawl/squid/old_hunk_170.cpp | C++ | cpp | 415 | no_license | return (os << (int)d);
}
/* Legacy debug style. Still used in some places. needs to die... */
#define do_debug(SECTION, LEVEL) ((Debug::level = (LEVEL)) <= Debug::Levels[SECTION])
#define old_debug(SECTION, LEVEL) if do_debug((SECTION), (LEVEL)) _db_print
/* Legacy debug function definitions */
void _db_init(c... |
2d002713b5d6e16b02e2dcebd4252303f9f57cfc | 882d4bdc874de150972cc58948889de269e8e5ce | jbohren-forks/personalrobots-stacks | /common/tags/latest/pluginlib/src/SharedLibrary_HPUX.cpp | C++ | cpp | 2,806 | no_license | //
// SharedLibrary_HPUX.cpp
//
// $Id: //poco/1.3/Foundation/src/SharedLibrary_HPUX.cpp#1 $
//
// Library: Foundation
// Package: SharedLibrary
// Module: SharedLibrary
//
// Copyright (c) 2004-2006, Applied Informatics Software Engineering GmbH.
// and Contributors.
//
// Permission is hereby granted, free of charge... |
ae0673216bb172401967be7a7c5c2a0bcc8fae57 | eedcee1909ceda668a51affc54eb23b83f412c53 | RetroJamo/piback | /joystick.cc | C++ | cc | 1,656 | 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 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be usefu... |
77fd1fe84f9ea50da5f3ef1c57703e4cda3f2809 | 3d136cfb65a2fcb149ebecebfcdd6c8819bf3654 | gangriming/Algorithm_Solve | /VS_Solution/AlgorithmSolve/BOJ_1978.cpp | C++ | cpp | 539 | no_license | #include <iostream>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int count = 0;
while (n)
{
int temp;
cin >> temp;
bool flag = true;
int debug = 0;
for (int i = 2; i <= temp; ++i)
{
if (i % t... |
a5d6a71211f52731ff7dd0d7ddc563ea407dabb6 | 7f39162eafaf45018078c068b9f0e668bbbd2125 | aaren/cpp_intro_course | /day2/array1.cpp | C++ | cpp | 305 | no_license | // Example of using arrays
#include <iostream>
using namespace std;
int main()
{
// Create array
int data[10];
// Display array elements
// (What happens if loop limit is greater than 10?)
for (int i = 0; i < 10; ++i)
cout << "data[" << i << "] = " << data[i] << endl;
return 0;
}
|
f7b04ab928937328c1ef592d9e03df595c3af5f8 | 7c84389c9cdefbdd3e1d34245402511983a2cfdb | Kawser-nerd/CLCDSA | /Source Codes/AtCoder/arc031/A/2359356.cpp | C++ | cpp | 374 | no_license | #include <iostream>
#include <algorithm>
using namespace std;
int main () {
string s;
cin >> s;
bool reversible = true;
for (int i = 0, j = s.size() - 1; i < j; i++, j--) {
if (s[i] != s[j]) {
reversible = false;
break;
}
}
cout << ((r... |
bf6de72939b70a40c109dc014ccfcead1689df68 | 75ac77fe13c7ebb81e0530f76ea22dc4151cc03d | BehaviorTree/BehaviorTree.CPP | /3rdparty/lexy/include/lexy/_detail/stateless_lambda.hpp | C++ | hpp | 2,456 | permissive | // Copyright (C) 2020-2023 Jonathan Müller and lexy contributors
// SPDX-License-Identifier: BSL-1.0
#ifndef LEXY_DETAIL_STATELESS_LAMBDA_HPP_INCLUDED
#define LEXY_DETAIL_STATELESS_LAMBDA_HPP_INCLUDED
#include <lexy/_detail/config.hpp>
namespace lexy::_detail
{
template <typename Lambda>
struct stateless_lambda
{
... |
9d8eb56aa94685e289b91efb3ae33b990a801956 | 0741bc64b1233933d14ae1d10737783ef5a15fc9 | pornin/openweave-core | /src/test-apps/weave-key-export.cpp | C++ | cpp | 24,148 | permissive | /*
*
* Copyright (c) 2013-2017 Nest Labs, Inc.
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE... |
67dd15f0e6a8292d82042ca0806eefeff68a1884 | 6ff18eac1e360b480ecaa63d0e31115e9d35dc0d | poseidon1214/PageDB | /core/PageDB/PageEmptyBlock.cpp | C++ | cpp | 1,155 | no_license | // Copyright (c) 2014 The PageDB1 Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
#include "PageDBImpl.h"
namespace pagedb
{
PageEmptyBlock::PageEmptyBlock() : m_curNum(0), m... |
e38471e94f2c2ac99a524987b07e619a8c30adb1 | 39b7feeba4e5acf59ca46c12dc1abc007a43b78a | metux/chromium-suckless | /buildtools/third_party/libc++/trunk/test/std/containers/unord/unord.multimap/max_load_factor.pass.cpp | C++ | cpp | 2,116 | permissive | //===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------... |
121638c415ff17ecebeb7bfe7645f772abf604da | 94b6ed0404f7a0195ecd6e824409e251937e1db7 | anjsoft/SpaceVikingX | /SpaceVikingX/libs/extensions/CCBReader/CCBReader.cpp | C++ | cpp | 27,451 | no_license | #include "CCBReader.h"
#include <algorithm>
#include "CCNodeLoader.h"
#include "CCNodeLoaderLibrary.h"
#include "CCNodeLoaderListener.h"
#include "CCBMemberVariableAssigner.h"
#include "CCBSelectorResolver.h"
#include "CCData.h"
#include "CCBAnimationManager.h"
#include "CCBSequenceProperty.h"
#include "CCBKeyframe.h... |
88c5cb8a1339e68f3cd65a1193eacbf4d6f71d7a | e679234a480ca63d65381cefe16bbbc8639e177f | carbonfish/acm_cheat_sheet | /graph/LCA_Binary_lifting.cpp | C++ | cpp | 863 | no_license | // O(NlogN) for preprocessing, and O(logN) for each LCA query
int n, l, timer; // only assign n equal to # of vertices in main
vvi adj, up; // also Adjacency list :)
vi tin, tout;
void dfs(int v, int p){
tin[v] = ++timer;
up[v][0] = p;
for (int i = 1; i <= l; ++i)
up[v][i] = up[up[v][i - 1]][i - 1... |
32d93f1c6ac9f4f1e23ee73bf1624aefd5e71963 | b587ef778b2e8d3ba064f87317f769e4ba3aa960 | Mu2e/Stntuple | /obj/obj/TStnPidBlock.hh | C++ | hh | 2,603 | permissive | #ifndef STNTUPLE_TStnPidBlock
#define STNTUPLE_TStnPidBlock
//-----------------------------------------------------------------------------
// definition of the STNTUPLE track block- prototype for MU2E
// cloned from CDF TStnPidBlock
//
// Author: Pavel Murat (CDF/FNAL)
// Date: Mar 07 2013
//
// the impl... |
178e1c119431caf59e84a2d8df09f8f16233c322 | 243e510e0c0fa3ed000e46d0d850af4b3891d6a9 | UniChargersInc/UCLinux | /mkr_linux/mkr_geocoding/mkr_encoding/var_length_encording.hpp | C++ | hpp | 2,432 | no_license | #pragma once
/**
* C++ utilities for variable-length integer encoding
* Compile with -std=c++11 or higher
*
* Version 1.1: Use size_t for size argument, improve function signatures
*
* License: CC0 1.0 Universal
* Originally published on http://techoverflow.net
* Copyright (c) 2015 Uli Koehler
*/
#ifndef MY__... |
0fa54ef104a1f3943e2578114dbb9eb63c69a0fd | e24e340a569dc0db604ce8632c6b2ec24c99bcc1 | laurent22/ConEmu | /src/common/Memory.cpp | C++ | cpp | 12,219 | permissive |
/*
Copyright (c) 2009-2014 Maximus5
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 followin... |
5160fe5f3c235e0377199889566a50d2cc861e2f | 40e60eb3732e6a004ba3b4056f53a4f0a5cb9511 | vkrishnandev/codefun | /Codeforces/584A.cpp | C++ | cpp | 293 | no_license | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, t, a(1);
cin >> n >> t;
if (n == 1 and t == 10)
cout << -1 << endl;
else
{
cout << t;
if (t == 10) a++;
for (a; a < n; a++)
cout << '0';
}
return 0;
}
|
54132072b9365e4e653f042cfc099a7ceae20934 | 36c5f6a4a753f172d2711b807677b51957b01fd9 | NCAR/lrose-core | /codebase/apps/ingest/src/WDTLtg2Spdb/WDTLtg2Spdb.hh | C++ | hh | 2,477 | permissive | // *=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*
// ** Copyright UCAR (c) 1990 - 2016
// ** University Corporation for Atmospheric Research (UCAR)
// ** National Center for Atmospheric Research (NCAR)
// ** Bo... |
e67e09311460439b5fef9d8675b44161fb80bf44 | b655b6d2d5654f15c53894d6f193596339fd7c62 | chc1129/MeikaiCpp | /chap03/list0307a.cpp | C++ | cpp | 358 | no_license | // 読み込だ個数だけ+と-を交互に表示する
#include <iostream>
using namespace std;
int main()
{
int n;
cout << "何個表示しますか: ";
cin >> n;
if (n > 0) {
int i = 1;
while (i <= n) {
if (i % 2)
cout << '+'; // 奇数
else
cout << '-'; // 偶数
i++;
}
cout << '\n';
}
}
|
12a1cc04f4d7b53c3aa95ecfad17c98717feb1af | 294254cdd4f271b3bb70050714c57cae5270d98f | niumeng07/x-deeplearning | /xdl-algorithm-solution/ESMM/data/third_party/protobuf/protobuf-3.5.0/src/google/protobuf/stubs/structurally_valid.cc | C++ | cc | 27,083 | permissive | /* Copyright (C) 2016-2018 Alibaba Group Holding Limited
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 ... |
76b30d9a5270c29ef79f65d01e3d4ef92b43780f | 3b61a41b6c9358cd74acf88bb575fdc902fec037 | NCCA/NGL | /src/MultiBufferVAO.cpp | C++ | cpp | 5,546 | no_license | #include "MultiBufferVAO.h"
#include <iostream>
#include <NGLassert.h>
namespace ngl
{
MultiBufferVAO::~MultiBufferVAO()
{
removeVAO();
}
void MultiBufferVAO::draw() const
{
if(m_allocated == false)
{
NGLMessage::addWarning("trying to draw an unallocated VOA");
}
if(m_bound == fa... |
268ad998a6fd40946f89249378a6e1c4fcd70c00 | 60350fce1814fcd544c1e5dfc951d8c2fc0560b0 | olofn/db_public | /db-06_secret_of_fantasy/src/fileutil.hpp | C++ | hpp | 395 | no_license | #ifndef FILEUTIL_HPP
#define FILEUTIL_HPP
#include <string>
#include <vector>
std::string loadFile(const std::string &fileName, bool fullpath = false, bool failsafe = false);
void storeFile(const std::string &fileName, const std::string &data, bool fullpath = false);
std::vector<std::string> tokenize(const std::str... |
61fdb63ddb9ec05214c3423b54bb49fc9a625a87 | bede0883a0b0f8c164f0658785ade0a9401ddd6b | freebsd/freebsd-ports-haskell | /www/iridium/files/patch-components_password__manager_core_browser_login__database__unittest.cc | C++ | cc | 1,552 | permissive | --- components/password_manager/core/browser/login_database_unittest.cc.orig 2022-03-28 18:11:04 UTC
+++ components/password_manager/core/browser/login_database_unittest.cc
@@ -2090,7 +2090,7 @@ TEST_F(LoginDatabaseUndecryptableLoginsTest, DeleteUnd
base::HistogramTester histogram_tester;
ASSERT_TRUE(db.Init());
... |
de90bcea997355d501ac9225fb3fcdb14f1a0dc7 | c9c0b94ba45d42386068f0265022416a932e59dc | akhikolla/TestedPackages-NoIssues | /ordinalClust/inst/testfiles/pejp1zj1_ej/libFuzzer_pejp1zj1_ej/pejp1zj1_ej_DeepState_TestHarness.cpp | C++ | cpp | 2,330 | no_license | // AUTOMATICALLY GENERATED BY RCPPDEEPSTATE PLEASE DO NOT EDIT BY HAND, INSTEAD EDIT
// pejp1zj1_ej_DeepState_TestHarness_generation.cpp and pejp1zj1_ej_DeepState_TestHarness_checks.cpp
#include <fstream>
#include <RInside.h>
#include <iostream>
#include <RcppDeepState.h>
#include <qs.h>
#include <DeepState.hpp>
doub... |
49c3627b2d44551f9f1ff76b04094af5350edd6f | bf2e85fa2421b35e132af1ad201edb44751881ed | CKeddie/flecs | /include/flecs/cpp/impl/builder.hpp | C++ | hpp | 2,951 | permissive |
namespace flecs
{
template<typename Base>
inline Base& term_builder_i<Base>::id(const flecs::type& type) {
ecs_assert(m_term != nullptr, ECS_INVALID_PARAMETER, NULL);
m_term->pred.entity = type.id();
return *this;
}
template <typename ... Components>
inline query_builder_base<Components...>::opera... |
e8d76a218ff324bfbc4c005382d30c6dd720ceaa | aa87560a5a9b0d3d39f8f123aa95f210c8c97812 | davisrs/CS452-LAB3 | /Example/transformations.cpp | C++ | cpp | 4,274 | no_license | #include "initShaders.h"
#include <cstdlib>
using namespace std;
void rotate(GLuint locate);
GLuint vaoID,vboID[2],eboID;
GLuint program;
GLfloat pit,yaw,scalar=1;
glm::vec3 cubeTran;
GLfloat size=10;
GLfloat vertexarray[]={size,size,-size,
size,-size,-size,
-size,-size,... |
45ed84642c1c90acbaa1d9e2e63bb935864a0713 | 078b43e01c5a6f5d254bc93cfcc9186c3d443ae6 | NguyenMinhThuan24112001/CPP_PTIT | /STRING7.cpp | C++ | cpp | 1,177 | no_license | #include<bits/stdc++.h>
using namespace std;
inline int tonum(char c){
return c-'0';
}
string bigsum(string s1,string s2){
if(s1.length()<s2.length())
swap(s1,s2);
int len1=s1.length();
int len2=s2.length();
int c=0;
string res="";
for(int i=0;i<len2;i++){
int x=tonum(s1[len1-i-1])+tonum(s2[len2-i-1])+c;
re... |
ff3d142de4d12ac61d9381ce71e3ee9dbba7a952 | 6b5c934947a7a0b2ee6bb14f9105306cff423d8a | cubetrain/CubeTrain | /contracts/libc++/upstream/test/std/numerics/numarray/template.slice.array/slice.arr.comp.assign/shift_right.pass.cpp | C++ | cpp | 1,268 | permissive | //===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===---------------------------------... |
64707e7af58b66ccecbbeef90ccb22ca72a563a0 | 07c28fccb61742106cb0186da6b8055f8e60994e | Hperigo/Cinder-ecs | /samples/EcsInteraction/src/EcsInteractionApp.cpp | C++ | cpp | 5,632 | no_license | #include "cinder/app/App.h"
#include "cinder/app/RendererGl.h"
#include "cinder/gl/gl.h"
#include "ecs/Manager.h"
#include "Utils/TransformSystem.h"
#include "cinder/Timeline.h"
#include "CinderImgui.h"
#include "MouseInteraction.h"
using namespace ci;
using namespace ci::app;
using namespace std;
struct Info{
... |
5ebc729433de07de5cb04a702d83c869ff219647 | 904a54615a1fe29516b84e8902c6efd5d29c1f46 | tmontgomery/reactivesocket-cpp | /examples/conditional-request-handling/TextRequestHandler.cpp | C++ | cpp | 992 | permissive | // Copyright 2004-present Facebook. All Rights Reserved.
#include "TextRequestHandler.h"
#include <string>
#include "ConditionalRequestSubscription.h"
using namespace ::reactivesocket;
/// Handles a new inbound Stream requested by the other end.
void TextRequestHandler::handleRequestStream(
Payload request,
... |
ae52913ed5a032da62bc14d7c16548c886c713c7 | eee8fca08e03f1cf09d31af425fcf2001e234cfc | akamilkhan/cpp2python | /externals/include/boost/fiber/detail/spinlock_ttas_adaptive.hpp | C++ | hpp | 5,104 | permissive |
// Copyright Oliver Kowalke 2016.
// 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 BOOST_FIBERS_SPINLOCK_TTAS_ADAPTIVE_H
#define BOOST_FIBERS_SPINLOCK_TTAS_ADAPTIVE_H
#incl... |
224a0a8abd9439864fe18261ce81941902e690a3 | d52e921af9674c59d97c0ebc25251502b4c63c4b | 3KMedialab/Midi-Controller | /Libraries/MIDIMessage/MIDIMessage.cpp | C++ | cpp | 1,692 | permissive | /*
* MIDIMessage.cpp
*
* Class that represents a MIDI Message. These objects will be assigned to the different
* MIDI Components that the controller can manage.
*
* Copyright 2017 3K MEDIALAB
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance... |
a85854415c7f000a2f5f28783b13ca238d9c635a | f8bf01a6bd070da2de1e0139dfa1baeb31b7295b | Huangzhongmin/rtf_study | /vector/src/main/c++/rtf_vector/src/plugin.cpp | C++ | cpp | 832 | no_license | /*
* Project : Real-Time Framework
*
* Description : Rtf_vector plugin implementation
*
* Author : codac-dev
*
* Copyright (c) : 2017-2019 ITER Organization,
* CS 90 046
* 13067 St. Paul-lez-Durance Cedex
* France
*
* This file is part of ITER C... |
8f5c855b8dddab40cec36691e8b986b1d728d605 | 8df86aa568015ca081ae3dc20ab384dd5ec0ab5f | antolopez/emulemorph | /srchybrid/server.cpp | C++ | cpp | 9,470 | no_license | //this file is part of eMule
//Copyright (C)2002-2008 Merkur ( strEmail.Format("%s@%s", "devteam", "emule-project.net") / http://www.emule-project.net )
//
//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 Fo... |
c7ee87aa70535c02ffec6a2dccb0bc8d79ca1cc1 | c2e3ee727a82db51dfc00307f2bc7513f4ccbe15 | quotekio/quotek-sdk | /src/broker.cpp | C++ | cpp | 2,071 | permissive | /*
Quotek Strategies SDK 3.0
Copyright 2013-2016 Quotek SAS
http://www.quotek.io
*/
#include "broker.hpp"
namespace quotek {
broker::broker(strategy* s) {
this->s = s;
}
void broker::buy(std::string asset,
int quantity,
int stop,
int limit) {
std:... |
6168556f565c2fe3e7c7a764de7fad12ec944c69 | fbc613f9e2a935417887502d0707e58d55ab520b | otcshare/chromium-src | /third_party/blink/renderer/core/loader/resource/image_resource_content.cc | C++ | cc | 25,052 | permissive | // Copyright 2016 The Chromium Authors
// 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/resource/image_resource_content.h"
#include <memory>
#include "base/auto_reset.h"
#include "base/metrics/histogram_macros.h"
... |
bf8a2b978a82dc948870e342422a65b6f3dd660a | c1c961a59e64019ae4e2d6687f9c9d8aba0ac08b | ishine/neuralLOGIC | /C++/nnForge/nnforge/cuda/hyperbolic_tangent_layer_testing_schema.cpp | C++ | cpp | 1,561 | permissive | /*
* Copyright 2011-2013 Maxim Milakov
*
* 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... |
135fd839a870656eb8c03838a6054601608acebb | 702bbf1639b43b16aef3abb6606290498c0d6615 | kollivier/webkit | /Source/WebKit/chromium/tests/CCLayerTreeHostTest.cpp | C++ | cpp | 73,253 | permissive | /*
* Copyright (C) 2011 Google Inc. 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 condition... |
a7355684cc32a9b46b09130eb990022fc23614c8 | 0ef1f9f05370714c954e2b3bd9f07437430aea9c | noelchalmers/occa | /src/lang/expr/emptyNode.cpp | C++ | cpp | 656 | permissive | #include <occa/lang/expr/emptyNode.hpp>
namespace occa {
namespace lang {
const emptyNode noExprNode;
emptyNode::emptyNode() :
exprNode(NULL) {}
emptyNode::~emptyNode() {}
udim_t emptyNode::type() const {
return exprNodeType::empty;
}
exprNode* emptyNode::clone() const {
... |
f25a398fcd23c12371ef24252cac6133d7ff5fb7 | b36b22032597d735dbfec368949aa0cf85c49566 | kopernikus-git/akikcoin | /src/miner.cpp | C++ | cpp | 34,444 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2019 The PIVX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-li... |
b409c362890ea04b15ae3f36394f9f5903ed9111 | fc9868c26bbb180f3ef8ef9d9cbf39cbe931e89b | dacunni/LittleEngine | /Transform.cpp | C++ | cpp | 2,899 | no_license | #include <cmath>
#include "Transform.h"
//
// Constructors
//
Transform::Transform()
{
fwd.identity();
rev.identity();
}
Transform::Transform( const Matrix4x4 & f, const Matrix4x4 & r)
: fwd(f),
rev(r)
{
}
// Destructors
Transform::~Transform()
{
}
//
// Helpers
//
Transform compose( const Tra... |
897f0269a5ac913e747b3a7e61e56190074e1c06 | 377bcd1541d34e0fa9be44fed01cc25be7b3c12a | shuaizengMU/AlgorithmDesign | /Leetcode/715.cpp | C++ | cpp | 1,711 | no_license | /*
template
*/
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define MAX(x, y) ((x)>(y)?(x):(y))
#define MIN(x, y) ((x)<(y)?(x):(y))
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
class RangeModule {
public:
unordered_m... |
0e1cc61018395ca2a0041e7e47f09eb9f10285c7 | f92f588579f86cf4089c652d7f1c3613b23d03fe | srdgame/srdgame_mmo | /src/shared/packet/packetdump.cpp | C++ | cpp | 2,559 | no_license | #include "packetdump.h"
#include "autolock.h"
#include "log.h"
#include "packetparser.h"
#include <cstring>
using namespace srdgame;
using namespace std;
#define DUMP_S_FILE_NAME "packet_s.dump"
#define DUMP_P_FILE_NAME "packet_p.dump"
PacketDump::PacketDump() : _inited(false)
{
_file_s_lock.lock();
_file_p_lock.l... |
6394f0f552929acfd2f2404825ab91674112dec0 | 957eb0ae4e71b76b04436e1a754036c7b868fe95 | gboyraz/macchina.io | /platform/JS/V8/v8/src/arm64/code-stubs-arm64.cc | C++ | cc | 71,695 | permissive | // Copyright 2013 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#if V8_TARGET_ARCH_ARM64
#include "src/api-arguments.h"
#include "src/arm64/assembler-arm64-inl.h"
#include "src/arm64/macro-assembler-arm64-inl.h"
#in... |
3c5a5cc5f5fef115b0ece0a85711005328133759 | ec89cf730190cd333445a2107d2c787620d016b0 | otcshare/chromium-src | /components/power_bookmarks/storage/power_bookmark_backend.cc | C++ | cc | 3,617 | permissive | // Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/power_bookmarks/storage/power_bookmark_backend.h"
#include "components/power_bookmarks/core/powers/search_params.h"
#include "components/power_bookmarks/s... |
b4debf49cc83e32aa38fb0c1e0f72a5121d501fc | 40300602eb2c230e60326fd291eaa828535e4eee | wolframtheta/floppyMonk | /utils.hpp | C++ | hpp | 1,511 | permissive | #ifndef UTILS_HPP
#define UTILS_HPP
#include <iostream>
#include <fstream>
#include <cctype>
#include <vector>
#include <list>
#include <queue>
#include <set>
#include <cmath>
#include <utility>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <SFML/System.hpp>
#include <SFML/Graph... |
a1442335be037ec5e7aa7f2225670163de8d8d48 | 59153deb2422d0a5f82de16cbd6e34299b896c61 | miski1998/ListaEnlazada | /listaenlazada.cpp | C++ | cpp | 3,779 | no_license | #include<iostream>
using namespace std;
struct node
{
int data;
node *next;
};
class list
{
private:
node *head, *last;
public:
list()
{
head=NULL;
last=NULL;
}
void createnode(int value)
{
node *temp=new node;
temp->data=value;
temp->next=NULL;
if(head==NU... |
c06611d81a7c7e91315cafbbcc55a0c4ac669096 | 5bcdf6282164c9061cc37703dec5558bef6e1399 | bhupkas/Backup | /programs/codes/codeforces/177d2_1.cpp | C++ | cpp | 521 | no_license | #include"iostream"
#include"stdio.h"
#include"string.h"
#include"string"
#include"math.h"
#include"vector"
#include"algorithm"
#include"map"
#include"set"
#include"deque"
using namespace std;
#define FOR(i,a,b) for(i=a;i<b;i++)
typedef long long LL;
void pre()
{
}
int main()
{
pre();
int n,i,j,k,m,ans=0,te1,te2;
... |
f0a3c04d1fcdf537a466aea7a3246230ec85bdf0 | c1e227f21d6e1dfa59d056c838b1cadd342c1736 | kmjp/procon | /yuki/1001-2000/1101-1200/1141.cpp | C++ | cpp | 1,559 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#... |
27da2c34ebfa93a5984d85388d4f1e5ab2e4d6e1 | b791a94542057f63ed86fc8643769edf5a591688 | darynachernobrovkina/homework | /task 5.33.cpp | C++ | cpp | 2,704 | no_license | #include <iostream>
#include <string>
#include <fstream>
using namespace std;
struct Date{
int day;
int month;
int year;
};
bool compare_dates(struct Date first, struct Date second)
{
if(first.year > second.year){
return true;
}
else if(first.year < second.year){
... |
93efa0a1decaa6b03757fa7b1bea0342431c970e | ad7b25edb6c8024c0f569c0ea2cb7e3ce080da79 | cbullo/GeometricTools | /GTE/Samples/Physics/HelixTubeSurface/HelixTubeSurfaceWindow3.cpp | C++ | cpp | 6,431 | permissive | // David Eberly, Geometric Tools, Redmond WA 98052
// Copyright (c) 1998-2021
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
// https://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// Version: 4.0.2020.01.10
#include "HelixTubeSurfaceWindow3.h"
#include <... |
fd4eaa19afd6e2f76d01efc4438e1aff9436730c | 4a7ea78dee062d0dd0d196582a629774ff0ab027 | kberryUSGS/ISIS3 | /isis/tests/GaussianDistributionTests.cpp | C++ | cpp | 2,242 | permissive | #include "GaussianDistribution.h"
#include "IException.h"
#include "TestUtilities.h"
#include <gtest/gtest.h>
#include <QPair>
#include <QString>
class DoubleTest : public ::testing::TestWithParam<QPair <double, double> > {
// Intentionally empty
};
TEST(GaussianDistribution, DefaultConstructor) {
Isis::Gaussia... |
f1b0d7cfc4a999c4d51e7dcdec9e22e147083b5d | 20c6b7d193a731fe501634755f09af72e58fc9b9 | goffersoft/commonutils-cpp | /experimental/src/com/goffersoft/codeclean/codeclean.cc | C++ | cc | 2,825 | permissive | /**
**
** This file is part of experimental.
**
** experimental is free software: you can redistribute it and/or modify
** it under the terms of the GNU General Public License as published by
** the Free Software Foundation, either version 3 of the License, or
** (at your option) any later version.
**
** expe... |
5972ff979c178fd77cf74a5076e1ded54dcf1bdb | c71790fb0f4520abcc0333b5d8f605f3dd97c48d | rivy/FossaMail | /mailnews/addrbook/src/nsAbMDBDirFactory.cpp | C++ | cpp | 3,488 | no_license | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "nsAbMDBDirFactory.h"
#in... |
4eaf02d3133a26a2c0c87eace0e81cf81a60c838 | d2e27ef9e8dfa504e996cb85dcad7b97ed9328b6 | larryzen/Project3.x | /lottery/Classes/lottery/BRNN/BRNNGameLogic.cpp | C++ | cpp | 21,257 | no_license | #include "BRNNGameLogic.h"
#include "BRNNDefine.h"
//////////////////////////////////////////////////////////////////////////
//构造函数
BRNNGameLogic::BRNNGameLogic()
{
}
//析构函数
BRNNGameLogic::~BRNNGameLogic()
{
}
E_BRNN_CardType BRNNGameLogic::RetType(int itype)
{
itype = itype%10;
switch(itype)
{
case 0:
retur... |
d22e624f29fd222eef6221f28a2ff2d906706b0d | ceb6096e6c83dfaa2c2f6a947ad23501af0283dd | Kerry-yu/Cpp_Learn | /5. C++学习第五阶段/3. STL - 常用容器/6. list容器/3. list容器-容器大小.cpp | C++ | cpp | 690 | no_license | #include<iostream>
#include<string>
#include<list>
using namespace std;
//list 容器大小
void printList(const list<int>& l)
{
for (list<int>::const_iterator it = l.begin(); it != l.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void test01()
{
list<int> L1;
L1.push_back(10);
L1.push_back(20);
L1.push_back... |
eb887f422fa68108d49adcebcd55344a7d8caaff | 8d9af64afc848830480a2e22147bb240afa4b9f4 | duilee/workspace | /this_is_cpp/2_Func_Namespace/class/multifunction_2.cpp | C++ | cpp | 295 | no_license |
#include "stdafx.h"
#include <iostream>
//must declare the functions first
int Add(int a, int b);
double Add(double a, double b);
int multifunction_2(void)
{
Add(3, 4);
Add(3.3, 4.4);
return 0;
}
int Add(int a, int b)
{
return a + b;
}
double Add(double a, double b)
{
return a + b;
}
|
ea60dc93417566b10340e4b216abc245ff90b75e | 1b7d368e13ec0d02dd98621ca7206dc774534c8e | faircoin/faircoin | /src/test/Checkpoints_tests.cpp | C++ | cpp | 697 | permissive | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
//
// Unit tests for block-chain checkpoints
//
#include "checkpoints.h"
#include "uint256.h"
#include "test/test_bitcoin.h... |
0483ac3040fbf7dfa080817e643a6abb14006b7b | b019c2611d0d9b108b000fed927a2cf423d7c946 | pranishg/genji | /tests/cli/main.cpp | C++ | cpp | 16,282 | permissive | /*
* Copyright (c) 2018 John Jones, and contributors.
*
* The 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 without restriction, including without limitation the rights... |
b2d79b73f48db6a6e9bfe82cb6bfc206906addc7 | affa2831b76bd23bbd394521112df3e6a93df12c | anteins/Blunted2 | /src/base/sdl_surface.hpp | C++ | hpp | 1,979 | permissive | // written by bastiaan konings schuiling 2008 - 2014
// this work is public domain. the code is undocumented, scruffy, untested, and should generally not be used for anything important.
// i do not offer support, so don't ask. to be used for inspiration :)
#ifndef _hpp_sdl_surface
#define _hpp_sdl_surface
#include "S... |
22190719cab707eab4befe3622b2fb6b02b8721e | f6c5985d6bee7d37be9b208d9ec6f3940cd85d1b | jolinlaw/turicreate | /test/unity/toolkits/sparse_similarity/test_brute_force_all_pairs.cxx | C++ | cxx | 10,941 | permissive | /* Copyright © 2017 Apple Inc. All rights reserved.
*
* Use of this source code is governed by a BSD-3-clause license that can
* be found in the LICENSE.txt file or at https://opensource.org/licenses/BSD-3-Clause
*/
#define BOOST_TEST_MODULE
#include <boost/test/unit_test.hpp>
#include <util/test_macros.hpp>
#inclu... |
eea92e3e32a3de50ef0eaa7d3f236ff367fdfc85 | 62a6d5293f89d03f6c0645ad3b34819cfeede84d | q4a/half | /gameui/ChangeGameDialog.cpp | C++ | cpp | 4,476 | no_license | //========= Copyright © 1996-2002, Valve LLC, All rights reserved. ============
//
// Purpose:
//
// $NoKeywords: $
//=============================================================================
#include <windows.h>
#include <stdio.h>
#include "ChangeGameDialog.h"
#include "ModInfo.h"
#include "EngineIn... |
836ca43d96ad0f850ae08d2ca61ddd0011bdc1f6 | 32a8b7afa4aa30773ff64d3d9940e0b37c692b9c | ZoondEngine/Core | /SDK/PUBG_P_Sniper_Kar98_BP_classes.hpp | C++ | hpp | 659 | no_license | #pragma once
// PLAYERUNKNOWN'S BATTLEGROUNDS (3.7.27.27) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace Classes
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGenerate... |
02214423dec1901fcb367b8afda219040fad4d64 | 1270783fbd395d44d021cadaae01b566cfb52ee0 | GOFIRST-Robotics/NASA-RMC-2020-NorthstarRobotics | /src/rovr_control/src/telecom_nodes/robot_to_mc_node.cpp | C++ | cpp | 4,540 | permissive | /*
* robot_to_mc_node.cpp
* Uses telecom to TX/RX ROS data from robot to the Mission Control (MC)
* Does not transmit video
* VERSION: 0.0.0
* Last changed: 2019-04-28
* Authors: Michael Lucke <lucke096@umn.edu>
* Maintainers: Michael Lucke <lucke096@umn.edu>
* MIT License
* Copyright (c) 2018 GOFIRST-Robotics... |
b9cb1f542c97160d251866b13394b6a558a13577 | 0f444f6edf7f38c1662b5923fa428b2d4bcac56f | Vaa3D/vaa3d_tools | /hackathon/PengXie/NeuronStructNavigator/cmake-3.6.2/Source/cmsys/Directory.hxx | C++ | hxx | 2,122 | permissive | /*============================================================================
KWSys - Kitware System Library
Copyright 2000-2009 Kitware, Inc., Insight Software Consortium
Distributed under the OSI-approved BSD License (the "License");
see accompanying file Copyright.txt for details.
This software is distr... |
142c0359b198317ffe97a3d1aceb4bb244469594 | 597ef87b9e2ebbfb4e4d083272c419dee3836bea | cambell-prince/FieldWorks | /Src/AppCore/AfColorTable.cpp | C++ | cpp | 6,795 | no_license | /*-----------------------------------------------------------------------*//*:Ignore in Surveyor
Copyright (C) 1999, 2001 SIL International. All rights reserved.
Distributable under the terms of either the Common Public License or the
GNU Lesser General Public License, as specified in the LICENSING.txt file.
File: Af... |
57ec5976f11ec7e11dd978a66956b95e907f1b77 | d7837960ebed642a9b078d67881932a47aa537b5 | tanuj211/GraphicsRayTracing | /source/raycast.cc | C++ | cc | 2,706 | no_license | #include "raycast.h"
// Globals:
// File names
char *_inputName = NULL;
char *_outputNameRGB = NULL;
char *_outputNameDepth = NULL;
// Image parameters.
int _width = 100;
int _height = 100;
float _depthMin = 0;
float _depthMax = 1;
// Render a color image of objects in a scene.
void renderRGBImage(... |
d1adcf92849c7d5a33597727ce321f510980e430 | d382fc12c40ee37c4a4c61d6c2b72925a7cc91a7 | AmesianX/SHZPublicDev | /Develop/Server/GameServerOck/unittest/TestTalent_Moving.cpp | C++ | cpp | 3,907 | no_license | #include "stdafx.h"
#include "GTalent.h"
#include "GUTHelper.h"
#include "GNPCInfo.h"
#include "MockField.h"
#include "GTestWrapper.h"
#include "GModuleAI.h"
#include "GModuleCombat.h"
#include "GTalent.h"
#include "GTalentInfoMgr.h"
#include "GFieldMgr.h"
#include "GEntityNPC.h"
#include "FBaseMockLink.h"
... |
761891aa199f9ffdbafc910cfd43deb0055ba8b8 | 61ac4d732d30297f73f9186e11030711f124f6f3 | groverinho/competitive-programming-solutions | /Nacional ACM-ICPC 2015/src/c.cpp | C++ | cpp | 2,046 | no_license |
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
typedef vector<int> VI;
#define MAX_N 400010
char T[MAX_N], P[MAX_N];
int b[MAX_N], n, m;
void kmpPreprocess(){
int i = 0, j = -1; b[0] = -1;
while (i < m) {
while(j >= 0 && P[i] != ... |
27b3781887f9c811ccc806630c7388d1c6b4de3f | c69b95e829f389f388120e15a057c74c5d559cf4 | mpomaran/cleric | /tests/functional/http/listener/building_response_tests.cpp | C++ | cpp | 5,335 | permissive | /***
* ==++==
*
* Copyright (c) Microsoft Corporation. All rights reserved.
*
* ==--==
* =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
*
* building_response_tests.cpp
*
* Tests cases for manually building up HTTP responses with http_listener.
*
* =-=-=-=... |
2c8fb3f9fc5a0b6df299d7241f1faf8321a40711 | 1bcc3c01cc3e13cd590aa5dec2f2d72cc6f0b8ba | mayankgrwl97/Competitive-Coding | /SPOJ/IOIPALIN.cpp | C++ | cpp | 1,531 | no_license | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define scani(n) scanf("%d",&n);
#define endl '\n'
#define EPS 1e-9
#define FOR(i,n) for(int i=0; i<n; i++)
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define X first
#define Y second
#define for0(i,n) for(int i=0; ... |
e208771f970a236fb60cfc80bca78a5cd19e7d03 | 3b918ea679d83649db2be716f7040f76f9196fe3 | Group-3-CS201R/Project-4-Group3 | /GroupProject4/UserInterface.cpp | C++ | cpp | 3,458 | no_license | #include "pch.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include "FoodItem.h"
#include "MachineBank.h"
#include "Storage.h"
#include "UserInterface.h"
using namespace std;
UserInterface::UserInterface(Storage storageSystem, MachineBank bankingSystem) {
vendingStorage = storageSyst... |
cf1f1a0a519024bc8f1ddfd7f9831f98ffc0e97e | d3a507523841cf94c91862149f1052d19d970dfb | Sotatek-TuyenLuu/Deep-Phi | /MITK-superbuild/MITK-build/Plugins/org.blueberry.core.expressions/qrc_org_blueberry_core_expressions_cached.cpp | C++ | cpp | 7,763 | no_license | /****************************************************************************
** Resource object code
**
** Created by: The Resource Compiler for Qt version 5.4.2
**
** WARNING! All changes made in this file will be lost!
*****************************************************************************/
static const unsig... |
d366f73b395b921458874d70fb939a14e9d5fb50 | 2f71f9a5659e2f7d0832d92ce6ec3e1107d82a29 | SLeoneSoftware/Database_Normalizer | /functional_dependency.hpp | C++ | hpp | 567 | no_license | #include <vector>
#include <string>
class functional_dependency {
std::vector<std::string> determinant_names;
std::vector<std::string> dependent_names;
public:
functional_dependency(std::vector<std::string> new_determinant_names, std::vector<std::string> new_dependent_names);
std::vector<std::string> get_deter... |
af20480f506bf56094bd0da1ff50b6d5b8e68d08 | 915bb1087cdeb8baf089cdebccd7a8c2e16eb7d6 | ybayart/42-cpp-d05 | /ex00/Bureaucrat.hpp | C++ | hpp | 2,054 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Bureaucrat.hpp :+: :+: :+: ... |
16240c45bffc9ae8d9ac1c175ebc91ca8f156d45 | df2b01a37bdc55538681de736ca41fe2d1fd3724 | jason-bunn/SFMLTests | /Include/ResourceIdentifiers.hpp | C++ | hpp | 877 | no_license | #ifndef RESOURCEIDENTIFIERS_HPP
#define RESOURCEIDENTIFIERS_HPP
//Forward declaration of SFML classes
namespace sf
{
class Texture;
class Font;
class Shader;
}
namespace Textures
{
enum ID
{
TitleScreen,
Buttons,
Particle,
PlayerBoy,
};
}
namespace Shaders
{
... |
c213ca008f422d6f46d6f43d24cb05481233960f | e1dd9405eb8dfc9eb9b2c7274af5dcbe6e728b90 | taichi-dev/taichi | /taichi/analysis/gather_deactivations.cpp | C++ | cpp | 879 | permissive | #include "taichi/ir/ir.h"
#include "taichi/ir/analysis.h"
#include "taichi/ir/statements.h"
#include "taichi/ir/visitors.h"
namespace taichi::lang {
class GatherDeactivations : public BasicStmtVisitor {
public:
using BasicStmtVisitor::visit;
std::unordered_set<SNode *> snodes;
IRNode *root;
explicit Gather... |
f5ef89dd2516fa9345bc388af1a4c9ef8ae4f84c | 1bd95622b64a7c2070ec50a667d5d4879f351df2 | SweiLz/Parkself | /parkself_stm32/src/parkself_backup_old.cpp | C++ | cpp | 4,640 | permissive | #include <mbed.h>
#include <dynamixel.h>
#include <mpu9250.h>
//#include <ros.h>
//#include "geometry_msgs/Twist.h"
//#include "sensor_msgs/Imu.h"
// sensor_msgs::Imu imu_msg;
// class Dynamixel
// {
// Dynamixel();
// };
struct Position {
float x;
float y;
float theta;
};
//namespace Thre... |
943be2106a31805ed1d99a2a14b337e5ace6f458 | 02a6c582f33371c6c3065e45f742bfe5ba4e3323 | lfyuomr-gylo/old-stuff | /hse/course_02/CS/leo/sm16/3.cc | C++ | cc | 1,173 | no_license | #include <bits/stdc++.h>
#include <unistd.h>
#include <wait.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <wait.h>
// ( cmd1 ; cmd2 ) | cmd3 > file
int main(int argc, char **argv) {
int chanel[2];
pipe(chanel);
if (!fork()) {
// firs child.
// performs ( cmd1 ;... |
8f3d30d7b20559946c7fcf58c087a3b06943cd11 | 3421eee76df283acb4a81eb2c99a8dc0c3e66a9a | Sergey01923/pp_2021_spring_informatics | /modules/task_2/vlasov_m_simpson_method/simpson_method.cpp | C++ | cpp | 3,937 | permissive | // Copyright 2021 Vlasov Maksim
#include "../../../modules/task_2/vlasov_m_simpson_method/simpson_method.h"
#include <omp.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <numeric>
#include <stdexcept>
#include <utility>
static void sumUp(std::vector<double>* accum, const std... |
e87bd44797384d420e0eac89b3c19aa1cc09fe07 | c327d3d68e931225b4b5ca43a3d42bb63867c815 | VictorAlfonso21/Practica-de-C- | /principios.cpp | C++ | cpp | 1,032 | no_license | #include <conio.h>
#include<stdio.h>
/*escriba un programa que lea la nota final de N alummnos
y calcule la nota final media de los N alumnos*/
int main(){
int i,a, nota;
int const limite=20;
float acum=0, promd=0;
printf("\n\n P R O M E D I O D E N O T A S \n");
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.