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 |
|---|---|---|---|---|---|---|---|---|
771443c06e38e35950457bb34bd24141778f13c9 | 32528b63d6bfb7e0011396a34478ba8f47cf939b | jbrock24/icarous | /Modules/TrajectoryPlanners/PathPlanner.cpp | C++ | cpp | 10,935 | no_license | //
// Created by Swee Balachandran on 12/14/17.
//
#include <cstring>
#include <PlanUtil.h>
#include "PathPlanner.h"
using namespace std;
PathPlanner::PathPlanner(FlightData* fd) {
fdata = fd;
geoCDIIPolygon = CDIIPolygon(&geoPolyCarp);
}
int PathPlanner::FindPath(algorithm search, char *planID, double *from... |
d0e2c60d620db92cff9aec180cf37672caad6f5e | 098461a727b29d17f37e59e2e2f186f6ebc0ae64 | sethhochberg/AwesomeJUCE | /JuceLibraryCode/modules/juce_audio_processors/processors/juce_PluginDescription.cpp | C++ | cpp | 4,458 | no_license | /*
==============================================================================
This file is part of the JUCE library.
Copyright (c) 2013 - Raw Material Software Ltd.
Permission is granted to use this software under the terms of either:
a) the GPL v2 (or any later version)
b) the Affero GPL v3
... |
732615157b07aa4ef769688d01f2376ff56bebc6 | 85a577764c11415f720e1e83a34edc5525741a95 | srivastavaman641/Competitive-Coding | /codechef-delish.cpp | C++ | cpp | 1,270 | no_license | #include<bits/stdc++.h>
#define ll long long int
#define s(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define ss(a) scanf("%s",a)
#define w(t) while(t--)
#define f(i,n) for(int i=0;i<n;i++)
#define fd(i,n) for(int i=n-1;i>=0;i--)
#define p(a) printf("%d",a)
#define pl(a) printf("%lld",a)
#define ps(a) printf("%s"... |
0ac03b281d45c755e88ae7f0b9c82855e18a7f58 | 1a0ecebe3baa3b9b4ba55aa4e0f6439e18a58676 | didrlgus/algorithm-practice | /baekjoon/1525.cpp | C++ | cpp | 1,554 | no_license | // 1525. 퍼즐
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<map>
#define p pair<int, int>
using namespace std;
int dest=123456789;
int st;
int dy[4]={0,0,1,-1};
int dx[4]={1,-1,0,0};
queue<int> q;
map<int,int> visited;
void bfs() {
// 큐에 첫번째 요소 삽입
visited[st]... |
f8fc0be079fbe33751bda2a84da5596a211c8504 | b28bf07d84b807d18548fb822aafd4e9050fb2a9 | hufscse-linux/cplusplus | /sort/sort_lambda.cpp | C++ | cpp | 469 | no_license | #include <iostream>
#include <algorithm>
#include "class.h"
using namespace std;
int main(int argc, char** argv) {
IntValue* values[10];
for(int i = 0; i < 10; ++i) {
values[i] = new IntValue(i);
cout << values[i]->value << " ";
}
cout << endl;
sort(values, values + 10, [](IntValue* a, IntValue* b)... |
821cb07f89596377a43736c4ed69e74f5b4435e3 | b2675f4d9586413db7d99a18a636dabdda074f54 | devin-schulz/suchcoin | /src/test/getarg_tests.cpp | C++ | cpp | 4,954 | permissive | // Copyright (c) 2012-2017 The Suchcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <util.h>
#include <test/test_suchcoin.h>
#include <string>
#include <vector>
#include <boost/algorithm/string.hpp... |
8fe3c214959b1856919bfbdc74f52cc630a429dd | 0ac66bfc8ec6373f35153d808ddf5dda77080dd0 | werto87/server_login_lobby | /src/logic/logic.cxx | C++ | cxx | 24,426 | no_license | #include "src/logic/logic.hxx"
#include "src/database/database.hxx"
#include "src/pw_hash/passwordHash.hxx"
#include <algorithm>
#include <boost/algorithm/algorithm.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/algorithm/string/predicate.hpp>
#include <boost/algorithm/string/split.hpp>
#include <boost/arch... |
e01fc042a2ce409d6fac841fec657521aa60d932 | f46b3aef8d039d0c2a1edaa6ac0bb4470e80ec14 | Solomon1228/Lab3Konda | /Лаб3Конда(4))/Лаб3Конда(4)).cpp | C++ | cpp | 1,825 | no_license | // Лаб3Конда(4)).cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#include <iostream>
using namespace std;
void f(int x)
{
for (int i = 1; i < 10; i++)
{
cout << x << " - " << i << " = " << x - i << " ";
}
}
int main()
{
for (int i = 1; i < 1... |
ee5b1a2c0865e5a5fedad01d4a40b380f2ddd2d9 | 3ff02745cd79f5aaa6f4ea8ec9a9c0721588cbf1 | hd2705576/DelgadoHector_CIS5_42375 | /Hmwk/Assignment_4/Gaddis_8ed_Ch5_Prob6_DistanceTraveled/main.cpp | C++ | cpp | 1,692 | no_license | /*
* File: main.cpp
* Author: Hector Delgado
* Date: April 1, 2018
* Homework Assignment 4
*
* Purpose: Gaddis 8ed Chapter 5 Problem 6 Distance Traveled
* The distance a vehicle travels can be calculated as follows:
* distance = speed * time
* For example, if a train travels 40 miles per hour for 3 hours, ... |
f79b2579e91e1ad92f195d7c587e838d5fbc25b6 | ca3514618e05a39af0158512a1897d1fcbacf96c | Liuchenlong/acm | /codeforces/300/377/D.cpp | C++ | cpp | 1,213 | no_license | #include<cstdio>
#include<cmath>
#include<stdlib.h>
#include<map>
#include<set>
#include<time.h>
#include<vector>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define eps 1e-8
#define LL long long
#define pii pair<int,int>
int n,m;
int ... |
d3a86c0539c85e9a416d4001ef3972a16de98e18 | 48f7bea3a64e198e2e4a0b1866df1c28f2b50b83 | R3D9477/haxe-basics | /4_ExtLib/4.4_GuiFrameworks/4.4.2_HaxeUI/4.4.2.1_SimpleGui/4.4.2.1.1_HaxeuiBackends/4.4.2.1.1.2_haxeui-hxwidgets/4.4.2.1.1.2.3_Dialogs/SimpleMessageDialog/Export/cpp/debug/src/haxe/ui/components/ProgressDefaultMaxBehaviour.cpp | C++ | cpp | 8,128 | no_license | // GeneratedByHaxe
#include <hxcpp.h>
#ifndef INCLUDED_haxe_ui_backend_ComponentBase
#include <haxe/ui/backend/ComponentBase.h>
#endif
#ifndef INCLUDED_haxe_ui_components_Progress
#include <haxe/ui/components/Progress.h>
#endif
#ifndef INCLUDED_haxe_ui_components_ProgressDefaultMaxBehaviour
#include <haxe/ui/component... |
3373a7674dd0ad2c9d8a6e6674ba56ba4a2857cc | 665d90dd8990f484b1ecf9a23fb7a95d9dbc8f11 | yassin64b/competitive-programming | /kickstart/2017/practice17/A.cc | C++ | cc | 1,432 | no_license | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author yassin
*/
#include <fstream>
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstdlib>
#include <tuple>
#include ... |
2fb061bf206cace27dee31d632f434fe00205fcd | f87419cdb0ab647081b00b2695eae701309fcf9b | rdkcmf/rdk-aamp | /test/aampcli/AampcliPlaybackCommand.cpp | C++ | cpp | 14,043 | permissive | /*
* If not stated otherwise in this file or this component's license file the
* following copyright and licenses apply:
*
* Copyright 2022 RDK Management
*
* 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 cop... |
26f8219413108bb80bfbe5dfa9c3a85cc472e5d4 | ad388123c6548a639b7efa35e8404dda53915684 | slimsag/mega | /chromium/chrome/browser/extensions/api/developer_private/extension_info_generator.cc | C++ | cc | 35,531 | permissive | // Copyright 2015 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/extensions/api/developer_private/extension_info_generator.h"
#include <iterator>
#include <memory>
#include <string>
#include <utility>
#include <vect... |
3b33ad2626b8603d65a9d7f4eddae2afeec1911a | 2fc3778536a43d4fef38bc1eb16bc400f3334abd | brunolauze/openpegasus-providers | /src/Providers/UNIXProviders/IPConnectivitySubnet/tests/IPConnectivitySubnet.Tests/main.cpp | C++ | cpp | 2,063 | permissive | //%LICENSE////////////////////////////////////////////////////////////////
//
// Licensed to The Open Group (TOG) under one or more contributor license
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with
// this work for additional information regarding copyright ownership.
// Each contributor lice... |
dd07fa326da0c3deaf30c2ee73563daaed7c69c8 | cead53a913d03ad30e1ee8dc31a75cae9b884594 | xiongjuncheng/llvm-project | /llvm/lib/Target/AMDGPU/SIInsertWaitcnts.cpp | C++ | cpp | 63,571 | permissive | //===- SIInsertWaitcnts.cpp - Insert Wait Instructions --------------------===//
//
// 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
//
//===---------------------------... |
26e593c41799ec9a524b88ce9090badbc16b4010 | 594eb6ea2f7cfda964ec19a2fa7d310fbf1cca63 | Momofil31/ASD_2019-2020 | /mincover/mincover_2.cpp | C++ | cpp | 710 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> point;
int n;
vector<vector<int>> g;
int res = 0;
bool DFS(int u, int p) {
bool black = false;
for (int i = 0; i < g[u].size(); ++i)
if (g[u][i] != p) {
bool cur = DFS(g[u][i], u);
if (... |
aa6774e8df26c2e1c8c73bdf304f8497203995b7 | ca1b0331e885e24f4eef1ba38ba3d2ea04861167 | vmanueltole1/control-resuelto | /EJER1.CPP | C++ | cpp | 487 | no_license | #include <iostream>
using namespace std;
bool esperfecto(int);
int main()
{
for(int x=5;x<=10000;x++)
{
if(esperfecto(x)==true)
{
cout<<" n "<<x<<": ";
for(int y=1;y<x;y++)
{
if((x%y)==0)
{
cout<<y<<" ";
}
}
cout<<'\n';
}
}
cout<<'\n';
}
bool esperfecto(int n){
int ... |
4ada91a9616a24e9428c73578222f44c0e78466c | 666f7e38c6d29218a09333f01b8b34fd34a308f2 | dimitrkovalsky/arduino-robot | /WheelPlatform/WheelPlatform/src/arduino/libraries/PWM/Adafruit_PWMServoDriver.cpp | C++ | cpp | 4,055 | no_license | /***************************************************
This is a library for our Adafruit 16-channel PWM & Servo driver
Pick one up today in the adafruit shop!
------> http://www.adafruit.com/products/815
These displays use I2C to communicate, 2 pins are required to
interface. For Arduino UNOs, thats SCL -... |
30734fb835d4dccdc47c2180821001ec1e6fdf7d | 8e9aa8d59c1cdc34d712171bb60b5c023c60d4fe | nrfconnect/sdk-connectedhomeip | /examples/chip-tool/commands/common/Commands.cpp | C++ | cpp | 22,170 | permissive | /*
* Copyright (c) 2020 Project CHIP 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
*
... |
7e0f90fa20331caac78e092695028a06b377f49f | 6f4753896e51dcf7c618d1aa15cbcb44eb50d84b | TencentCloud/tencentcloud-sdk-cpp | /ams/src/v20201229/model/DescribeTaskDetailResponse.cpp | C++ | cpp | 18,210 | permissive | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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
... |
b703e0e48a2c54218e7259243958ee6866e0b8da | 4ff614a76f68a872e7ff673187f4472bc0508356 | ljohan07/cse20312 | /Lecture08/src/DynArrTest5.cpp | C++ | cpp | 839 | no_license | #include <cstdlib>
#include <iostream>
#include "../include/DynArr5.h"
const int LENGTH = 10;
#define COUT std::cout
#define ENDL std::endl;
template<class T>
void printData( DynArr<T>& theArr ){
// Print initial size and capacity of floatArr
COUT << "Initial: ";
COUT << "Array has a size of " << ... |
b3ee9572024e51a742c22debf5959748b07a4d2a | 17e47d31bf1f61af483d92c10f0828cee7058b75 | hajindvlp/Algorithm | /OnlineJudge/BOJ/1000/1965.cpp | C++ | cpp | 428 | no_license | #include <stdio.h>
#include <algorithm>
#define INF 10000000
using namespace std;
int n, a[100001], d[100001], cnt, mx;
int main()
{
int i, k;
scanf("%d", &n);
for(i=1 ; i<=n ; i++)
d[i] = INF;
for(i=1 ; i<=n ; i++)
{
scanf("%d", &a[i]);
k = lower_bound(d+1, d+cnt+1, a[i]... |
2d42f88fd986c7edc0f99b06a80dcec901d50ded | 4418f9dd613dd13a2be97d267d27866061448222 | lovebkdn/Game-Engine-Development | /Engine/main.cpp | C++ | cpp | 5,230 | no_license | /******************************************************************************/
/*!
\file main.cpp
\author Matt Casanova
\par email: mcasanov\@digipen.edu
\date 27/12/2011
\author Yunhyeok Choi
\par email: yunhyeokchoi.digipen\@gmail.com
\date 20/8/2016
\brief
This is the en... |
01c89ea3cb560329816ecc87665c36755ead14b8 | cf22e4ad76f5a7d5fa24a463a663a7da20d648c7 | rrazvanrraducanu/MFC-Line | /Line/LineView.cpp | C++ | cpp | 2,735 | no_license |
// LineView.cpp : implementation of the CLineView class
//
#include "pch.h"
#include "framework.h"
// SHARED_HANDLERS can be defined in an ATL project implementing preview, thumbnail
// and search filter handlers and allows sharing of document code with that project.
#ifndef SHARED_HANDLERS
#include "Line.h"
#endif
... |
dbb0867019158394d722f6be43c781c34278e423 | b08f6a02672be7b5295c4f348c9d2cb32d03eaf1 | CryptoLover705/x6coin | /src/qt/test/test_main.cpp | C++ | cpp | 1,280 | permissive | // Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2019 The X6Coin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-licens... |
ea4bb5137f6c742ddda9384613872ee970076018 | 81e6e5ccb66e9842a9f02cb670ebf990a5ae3d12 | ast/wsdr | /wdgramsocket.cpp | C++ | cpp | 960 | no_license | #include "wdgramsocket.h"
extern "C" {
#include <sys/socket.h>
#include <sys/un.h>
#include <unistd.h>
}
WDgramSocket::WDgramSocket(QString name)
{
int err;
struct sockaddr_un addr;
const char *socketpath = name.toLocal8Bit().constData();
// Remove just in case
unlink(socketpath);
int fd = s... |
c970ac7b03364695006feaebc1a64b320feafdb4 | fe8018b02d44a4344c4376e8448521d00d80a6d5 | Suyixiu/VScode_example | /windows/opencv_example/opencv_example.cpp | C++ | cpp | 20,689 | no_license | /**
* @file opencv_example.cpp
* @version 0.0
* @date 19-9-2019
*
* @brief 把常用的opencv函数及一些常用知识点进行一个总结与含括
* 毕竟是个含括文件所以其中的变量并没有很严格的命名,不过看得懂就好
*/
#include <opencv2/opencv.hpp>
#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <iostream>
#include <stdio.h>
using namespace std;
us... |
89bf0ea89b9b5fd5dffea555ce526a865e0afb3a | 5c04d1a86fcde06f2e25ca6daae77de76bc1113d | mike-daly/toolbox | /revstr/revstr.cpp/AssemblyInfo.cpp | C++ | cpp | 2,295 | permissive | #include "stdafx.h"
#using <mscorlib.dll>
using namespace System::Reflection;
using namespace System::Runtime::CompilerServices;
//
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembl... |
581b2abaa881a83ecd48532fa777e24e5a4b8d88 | 7dbd82e449dee80b0bf4631bb87a421f97b72d84 | rayz0620/CVTraining2013Azure | /IOUtils/src/IO.cpp | C++ | cpp | 364 | no_license | #include "IO.h"
Mat IOUtils::readMatrixFromYML( const path filename )
{
FileStorage fs(filename.string(), FileStorage::READ);
Mat read;
if (exists(filename))
fs["mat"] >> read;
return read;
}
void IOUtils::saveMatrixToYML( const path filename, const Mat& m )
{
FileStorage fs(filename.string(), F... |
adc9720b0f2bfdd35076f188d5359b2393001bdf | 31561ffdd602556246216f592a685519e9d170b8 | Mervio/and_danilo2 | /andgate-systemc-module/tb.cpp | C++ | cpp | 826 | no_license | #include "tb.h"
#include "terminal_color.h"
void tb::source(){
// Reset
//wait();
// Functionality
bool a_stim, b_stim = false;
for (int i = 0; i<=1; i++){
for (int j = 0; j<=1; j++){
a.write(a_stim);
b.write(b_stim);
wait();
b_stim = ~b_sti... |
f42b0b93270f5c13a0234cc7e2e2fa4c5f9a1b3f | e04f185c8f2304e3bda517de0c840cbc290897bc | zhangwj0101/codestudy | /algorithm/HDU-ACM/ambition0109/3729.cpp | C++ | cpp | 1,772 | no_license | ////////////////////System Comment////////////////////
////Welcome to Hangzhou Dianzi University Online Judge
////http://acm.hdu.edu.cn
//////////////////////////////////////////////////////
////Username: ambition0109
////Nickname: Ambition
////Run ID:
////Submit time: 2010-12-14 12:09:27
////Compiler: Visual ... |
d186db6b4551e0ae8a2c91ba7d529ba39cc36cc1 | 60626a5128121ed8ba2eb489cc803e96d60e6ef8 | joseph-reynolds/bmcweb | /redfish-core/lib/redfish_util.hpp | C++ | hpp | 8,183 | permissive | /*
// Copyright (c) 2019 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or... |
c7f01b2dca9a47565ba809f876b6090b72a6b5f5 | 311aa090a902c8d3c7a105b90b3d7174dc816925 | BogdanDumbravean/Object-Oriented-Programming-OOP | /Examen/Participant.cpp | C++ | cpp | 376 | no_license | #include "Participant.h"
Participant::Participant(string name):name(name) {
score = 0;
}
Participant::~Participant()
{
}
istream& operator>>(istream& o, Participant& p) {
string name;
int score;
o >> name >> score;
p.setName(name);
p.setScore(score);
return o;
}
ostream & operator<<(ostream & o, Particip... |
d341aaf7bb570f1178a7d855af669d22551575ba | f0dce45892d9269672dbf16543e99dfb4737b7cd | mattigruener/gaffer | /src/GafferImage/AtomicFormatPlug.cpp | C++ | cpp | 3,337 | permissive | //////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2012-2015, Image Engine Design 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:
//
// ... |
2c71e461f47389e0414fbe13283dbd130e1e0d02 | e4ce0ab9f24e70299cd53f0269e36a1abb1bb057 | sgzwiz/xbox_leak_may_2020 | /xbox_leak_may_2020/xbox trunk/xbox/private/ui/maxsdk/SAMPLES/vrmlexp/audio.cpp | C++ | cpp | 11,795 | no_license | /**********************************************************************
*<
FILE: audio.cpp
DESCRIPTION: A VRML 2.0 AutoClip helper
CREATED BY: Scott Morrison
HISTORY: created 29 Aug, 1996
*> Copyright (c) 1996, All Rights Reserved.
*************************************************... |
d1383346d8efdd19e732bbc64ec34c1189159dbb | 4171567170e582ff367957ccafcd5230f168f8cb | btxl192/CustomAVSSDK | /Settings/src/SharedAVSSettingProtocol.cpp | C++ | cpp | 12,257 | permissive | /*
* Copyright Amazon.com, Inc. or its affiliates. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0/
*
* or in the "license" f... |
c27c3a99ebaa3599e371c2d4cfa7b12af5604194 | 64f4254bcaf12ab0acdd452dbdbd9c2c4e461330 | harshitdiit/CompetitiveCoding | /Codechef/COOK100B/TRUEDARE.CPP | C++ | cpp | 646 | no_license | #include<bits/stdc++.h>
using namespace std;
int main(){
int T;
cin>>T;
while(T--){
int t, k;
set<int> S[4]; //tR, dR, tS, dS
for(int i=0; i<4; i++){
cin>>k;
while(k--){
cin>>t;
S[i].insert(t);
}
}
bool flag = true;
for(auto x:S[2]){
if(S[0].find(x)... |
29e826aa924bfff98647e9245afa4225601a8ba1 | 25f6a919a3a8720e582d7b741ff9598301c1c943 | snshamwow/CSC-1101-Labs | /Lab13.cpp | C++ | cpp | 1,701 | no_license | //==========================================================
//
// Title: Burger King Menu Upgraded
// Course: CSC 1101
// Lab Number: 13
// Author: Sadeem Shamoun
// Date: 10/29/19
// Description:
// Menu stuff
//
//==========================================================
#include <cst... |
c1abec6d59d5ca68852e873adbd6b4223bcc6796 | 6b90eaae4c6916aad390113cfe2fbc1883d2df6b | github-cloud-corporation/ChromiumGStreamerBackend | /components/password_manager/core/browser/password_form_manager.cc | C++ | cc | 60,051 | 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 "components/password_manager/core/browser/password_form_manager.h"
#include <stddef.h>
#include <algorithm>
#include <map>
#include <set>
#... |
b900254b098a7a333518c9abf0cef99aced33cd5 | 6933cdd18a98e9ef8a6f90e828c2d75beceab867 | pmiddend/fcppt | /libs/core/include/fcppt/math/matrix/detail/static_storage_fwd.hpp | C++ | hpp | 686 | permissive | // Copyright Carl Philipp Reh 2009 - 2018.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef FCPPT_MATH_MATRIX_DETAIL_STATIC_STORAGE_FWD_HPP_INCLUDED
#define FCPPT_MATH_MATRIX_DETAIL_... |
c814b7718d17fd339aa0dc3e045ed7e87aaac813 | 21ae71373b16ee47fdb71f7b29152fb9c8b929f0 | imarsv/WebRTC_Client_A | /conductor.cc | C++ | cc | 19,840 | no_license | /*
* Copyright 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 contributing ... |
47e25f2c511cb8fe847de21ac5b6ec81c78944e0 | 64efd0a705c4491f40114a3801c1202b14dbd542 | elveshka/cppModules | /cpp04/ex01/SuperMutant.hpp | C++ | hpp | 404 | no_license | //
// Created by esnowbal on 18.03.2021.
// With love and butthurt.
//
#ifndef SUPERMUTANT_HPP
#define SUPERMUTANT_HPP
#include "Enemy.hpp"
class SuperMutant : public Enemy {
private:
public:
SuperMutant(void);
virtual ~SuperMutant(void);
SuperMutant &operator=(SuperMutant const &rhs);
SuperMutant(SuperMutant co... |
c234f9bac30fcc48cb8af27c0ccabaa526237c9c | 446cb3405cf424e3f655b888d1770337ab0d28ea | PTSnoop/Hoi3toDefconConverter | /Hoi3ToDefcon/Utils.cpp | C++ | cpp | 1,750 | permissive | #include "Utils.h"
#include <cctype>
#include <iostream>
#include <boost/icl/type_traits/is_numeric.hpp>
#include "Log.h"
bool is_number(const std::string& s)
{
return !s.empty() && std::find_if(s.begin(), s.end(), [](char c) { return !std::isdigit(c); }) == s.end();
}
bool copyDir(
boost::filesystem::path const... |
cd730f22e987e87f7a6e3456c7d711e56bbdefe1 | 2044e7d84d8dd13ca56075fdd15cd602edd8659f | anshuman725/Ds-Algo-Practice | /find-unique-num-in-array-in-which-all-elements-are-present-thrice-except-one-element.cpp | C++ | cpp | 690 | no_license | /*Ex: 1234123123
output: 4;
*/
#include <iostream>
using namespace std;
int getBit(int n, int pos)
{
return ((n & (1 << pos)) != 0);
}
int setBit(int n, int pos)
{
return (n | (1 << pos));
}
int unique(int a[], int n)
{
int result = 0;
for (int i= 0; i < 64; i++)
{
int sum = 0;
fo... |
cfdd55e4e58922b3229df40b215a9d619ec4a386 | e47fab05bfb1c4d64296a9be0b9e3c1b34115c3f | Caceresenzo/42 | /scop/source/lang/Character.cpp | C++ | cpp | 1,480 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Character.cpp :+: :+: :+: ... |
14d1103b52c29f1863aa307ff405c26298e771cd | 4eebfb8e9a97efbae8756fc71244a0c95141f0e3 | KTOC/detector-tk1-fastprcnn | /edgeboxes-c/Option.cpp | C++ | cpp | 14,401 | no_license | # include "Option.h"
#include <cstdio>
void Option::edgeDection(Image &img, Model & model,Image &E_out, Image & G){
nTreesEval = (nTreesEval<nTrees)?nTreesEval:nTrees;
stride= (stride>shrink)?stride:shrink;
if(multiscale){
}
else{
int pt=imWidth/2+(4-(img.numRows+imWidth)%4)%4;
int pb=imWidth/2+(4-(img.numRows... |
b8125fbd640028a55d97373196714b4a3c519da1 | 38556e57c3b434c8008ce290c60d215115369605 | AravindaDP/CarND-Extended-Kalman-Filter-Project | /src/main.cpp | C++ | cpp | 5,155 | permissive | #include <math.h>
#include <uWS/uWS.h>
#include <iostream>
#include "json.hpp"
#include "FusionEKF.h"
#include "tools.h"
using Eigen::MatrixXd;
using Eigen::VectorXd;
using std::string;
using std::vector;
// for convenience
using json = nlohmann::json;
// Checks if the SocketIO event has JSON data.
// If there is da... |
3a748eed313cdb079f13171842cc81d655de1721 | d82a3909d6d895f72875f08fe10377f84eeeec8c | yws/fakescript | /src/compiler.cpp | C++ | cpp | 44,422 | permissive | #include "compiler.h"
#include "semantic.h"
#include "myflexer.h"
#include "fake.h"
#include "binary.h"
void compiler::clear()
{
m_cur_addr = 0;
memset(m_cur_addrs, 0, sizeof(m_cur_addrs));
m_loop_break_pos_stack.clear();
m_loop_continue_pos_stack.clear();
m_continue_end_pos_stack.clear();
m_func_re... |
a9e1204af004a5bffc1f9aeaf86153699e5d595c | ad4191bdaa7935d7b5723e84870185d5f2c98415 | trinhvo/Goliath | /Source/Drawable/Plane.cpp | C++ | cpp | 566 | no_license | #include "Plane.h"
Plane::Plane(const glm::dvec3 &normal, const glm::dvec3 &point) {
x = normal.x;
y = normal.y;
z = normal.z;
d = -glm::dot(normal, point);
}
Plane::Plane(const glm::dvec3 &p1, const glm::dvec3 &p2, const glm::dvec3 &p3) {
glm::dvec3 v1 = p2 - p1;
glm::dvec3 v2 = p3 - p1;
glm::dvec... |
250789c06f2e96089e50f6903b0b1b4c9b60ec47 | 95b7352d0181ab8b7482282549a9cd63405c1289 | frametrip/figures-c- | /palka1.cpp | C++ | cpp | 443 | no_license | #include <iostream>
using namespace std;
void MyFunction() {
int space, rows;
cout << "Enter number rows: ";
cin >> rows;
for (int i = 1, k = 1; i <= rows; ++i, k = 0)
{
for (space = 0; space <= rows + i; ++space)
{
cout << " ";
}
while (k != 1)
... |
b8c7827776e25360758c8a867eae46ec31aceb57 | b10b93978d164928227a43b7b0740b2bfa30d2d8 | JoelGoh92/grpc | /test/core/end2end/tests/cancel_after_round_trip.cc | C++ | cc | 10,182 | permissive | /*
*
* Copyright 2017 gRPC authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... |
0e445140efb6dab2be34f320b8793a926e4c5263 | 1d41f230f31ad3c92711c9f47f62c26e0f395a2f | dls-controls/pmac | /pmacApp/unitTests/test_PMACController.cpp | C++ | cpp | 3,589 | permissive | /*
* test_PMACController.cpp
*
* Created on: 5 Oct 2016
* Author: gnx91527
*/
#include <stdio.h>
#include "boost/test/unit_test.hpp"
#include <string.h>
#include <stdint.h>
#include <deque>
#include <tr1/memory>
#include <iostream>
#include <fstream>
#include <asynPortClient.h>
#include "pmacTestingU... |
80470a8f4e6bdbbdcf62e67894567fe216c7217a | f6fd1227e750a293b0c950b33399b3cf4e4fdcb0 | manuelmohr/x10i | /x10.runtime/x10rt/test/x10rt_basic.cc | C++ | cc | 9,886 | no_license | #include <cstdlib>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <x10rt_front.h>
// {{{ nano_time
#include <sys/time.h>
long long nano_time() {
struct ::timeval tv;
gettimeofday(&tv, NULL);
return (long long)(tv.tv_sec * 1000000000LL + tv.tv_usec * 1000LL);
} // }}}
x10rt_msg_type... |
8041bda37b946f35d804f293c212608d41cd951f | 3b9e6f01bc0d37a27f697df3d3836c70c94787b4 | hyeseonko/Algorithm-Baekjoon | /안전영역_baekjoon2468.cpp | C++ | cpp | 1,837 | no_license | /*
TITLE: SAFE AREA
BAEKJOON 2468
KOI 2010 ELEMENTARY #02
CATEGORY: BFS
DATE: 2017-06-02
*/
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h> //memset
#include <queue>
#include <vector> // vector
#include <algorithm> // sort
using namespace std;
int N;
int map[100][100]... |
18a046d70884a547f99f41ce8b0be0abcc7affba | ad764a4689c2f3bc2a33c7c4d37c09b59371b7d2 | Gwenael-ROUX/TP1-POO | /DureeDeBase/main.cpp | C++ | cpp | 1,826 | no_license | #include <iostream>
#include <iomanip>
using namespace std;
namespace
{
class Duree
{
private:
unsigned long long myDuree;
unsigned long long mySeconds;
unsigned long long myMinutes;
unsigned long long myHours;
unsigned long long myDays;
void Normaliser ()no... |
1c3ca3a74616c4c4e31cf37e0fcd37e58aa31b9d | ab4be70d2f56ecab2d877f16d662eb44ef308e6e | alihaydarkurban/CSE241-Object-Oriented-Programming | /HW6/151044058_CSE241_HW6/HashSet.cpp | C++ | cpp | 4,904 | no_license | #include "HashSet.h"
namespace HW6_151044058
{
template<typename E, typename C_Collection>
HashSet<E, C_Collection> :: HashSet()
{
//Empty
}
template<typename E, typename C_Collection>
HashSet<E, C_Collection> :: HashSet(C_Collection temp_collection)
{
HS = temp_collection; // Gelen collectionu benim colle... |
0eff6346e28ac85d1cf56d8c0d5bb8a544871c59 | 5ff211f66537b851d4401bb54841a3e2d5c8556f | jsyhdl/tmas | /code/branches/pcap-branche/ut/src/util/inc/ip_layer_inl.hpp | C++ | hpp | 11,236 | no_license | /*#############################################################################
* 文件名 : ip_layer.cpp
* 创建人 : tom_liu
* 创建时间 : 2014年2月22日
* 文件描述 : IpLayer类实现
* 版权声明 : Copyright (c) 2014 BroadInter. All rights reserved.
* ##########################################################################*/
#ifndef BROA... |
37103545a88bfbd6521e1a7869577b9d44235061 | 6a8eaab0202f63e86b887e531769328bdeed355a | yhondri/EDA | /2_3/juez/juez27/juez27/main.cpp | C++ | cpp | 4,333 | no_license | //
// main.cpp
// juez27
//
// Created by Yhondri on 20/12/18.
// Copyright © 2018 Yhondri . All rights reserved.
//
#include <iostream>
#include <vector>
#include <fstream>
#include <limits.h>
using namespace std;
int leerDatos(vector<vector<int>> &datos, int numFilas, int numColumnas);
/**
Si ya hemos compr... |
6d0e9cad6552489b3d54bd271503f364eeebe2fe | 7f81d5740b07f2ba7bc0b581c640c829b28192ab | andy2git/coding | /lintcode/cpp/strStr.cpp | C++ | cpp | 847 | no_license | class Solution {
public:
/**
* Returns a index to the first occurrence of target in source,
* or -1 if target is not part of source.
* @param source string to be scanned.
* @param target string containing the sequence of characters to match.
*/
int strStr(char *source, char *target) {
... |
fa1600aa2badc33422fd65c622ac757e520f1ce7 | 0cfb096b03a70d28a48ca390df200b686db81aed | pan2za/ctrl | /controller/src/bgp/test/show_route_test.cc | C++ | cc | 85,840 | permissive | /*
* Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
*/
#include <boost/assign/list_of.hpp>
#include <boost/foreach.hpp>
#include "base/logging.h"
#include "base/task.h"
#include "base/test/task_test_util.h"
#include "sandesh/sandesh_types.h"
#include "sandesh/sandesh.h"
#include "bgp/bgp_config.h"... |
5c916497acf0cf164d18f2f65b8064d7b792ab6f | f0f26a9a51bebd29f78ce0dcc5a156b4363036eb | radtek/UKEYMonitor | /src/DeviceEventFilter.cpp | C++ | cpp | 3,063 | permissive | #include "DeviceEventFilter.h"
#include <Dbt.h>
#include <WinIoCtl.h>
#include <cassert>
#include "Poco/UnicodeConverter.h"
#include "Poco/Path.h"
#include "Poco/String.h"
#include "Poco/Util/Application.h"
#include "Poco/UUID.h"
#include "Poco/SingletonHolder.h"
#include "Poco/SharedPtr.h"
#include "Poco/DateTime.h"
#... |
cc1ae820a76c0380a34390702e0d52b3f2046731 | d9f57bfa13e218bed00be6108e45ad8c030f859c | tupieurods/SportProgramming | /CBR95/C div2/main.cpp | C++ | cpp | 1,720 | no_license | #include <stdio.h>
#include <string.h>
using namespace std;
__int64 treg[32][32];
__int64 CalcC(__int64 n, __int64 k)
{
if(n < k)
throw;
if((k == 0) || (n == k))
{
return 1;
}
__int64 from, second = 2LL;
if(n - k > k)
{
from = n - k + 1;
}
else
{
from = k + 1... |
f86b5d883b15387c473015b1786c35fd52624ecd | c38be64006ae8e5b6aa1fa9a1f8cf8ab8b9938dc | matthb2/ParaView-beforekitwareswtichedtogit | /VTK/Infovis/vtkTreeFieldAggregator.cxx | C++ | cxx | 7,050 | permissive | /*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile$
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distrib... |
acba02eafee83ea2f1993d84d810553b64c151fb | 282fb9c03cbd58880b7db8c80fe1ab9b27e79c92 | MauricioCerv10/schoolhistory | /ENVIO DE REGISTRO/Cliente.cpp | C++ | cpp | 2,357 | no_license | #include <iostream>
#include <fstream>
#include <sstream>
#include "Solicitud.h"
/*
Variables foráneas:
->LIMITE_ARCHIVO
->Ubicación: Mensaje.h
Entidades foráneas:
->struct mensaje
->Ubicación: Mensaje.h
->Solicitud
->Ubicación: Solicitud.h
*/
using namespace std;
int main(int argc, char* argv[]){
if(argc !... |
0eaa28dc212272002c3186a5062fe4433102b626 | 4a8a8e941e7015d59782055f95460d7c85eb4fc9 | radtek/sqltools-1 | /3dParty/boost_1_32_0/boost/mpl/modulus.hpp | C++ | hpp | 676 | no_license |
#ifndef BOOST_MPL_MODULUS_HPP_INCLUDED
#define BOOST_MPL_MODULUS_HPP_INCLUDED
// Copyright Aleksey Gurtovoy 2000-2004
//
// 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)
//
// See http://www.boost.or... |
a963670dd6581f9b671c9d85b26f2844e6799470 | dd897ce45ba7d79026fd0aa0301b4a77638bcdf3 | googlecorporation/omim | /indexer/feature_data.cpp | C++ | cpp | 13,907 | permissive | #include "indexer/feature_data.hpp"
#include "indexer/classificator.hpp"
#include "indexer/feature.hpp"
#include "indexer/feature_impl.hpp"
#include "indexer/ftypes_matcher.hpp"
#include "base/assert.hpp"
#include "base/stl_add.hpp"
#include "base/string_utils.hpp"
#include "std/algorithm.hpp"
#include "std/bind.hpp... |
941aabdf089d8adf684a1567d3374fbdeba0a54f | bfae4e78db3633123d2adf493f374acedfd5d917 | manzanoivan/Club | /FenceArab.cpp | C++ | cpp | 6,918 | no_license | #include <iostream>
#include <cmath>
#include <vector>
#include <iomanip>
#include <algorithm>
using namespace std;
const double ERROR = 1e-9;
const double M_2PI = 2 * M_PI;
bool Igual( double a, double b ){
return fabs( a - b ) < ERROR;
}
struct Punto{
double x, y;
Punto() : x(), y(){}
Punto( double X, double Y... |
993a29b39a3aa2ec6c5c132f0cbfb61b135c7422 | 7cde2e696c9fb49887c22a3bf4fcdcbfff36c111 | anantps926/RustDuino | /question3.cpp | C++ | cpp | 1,724 | no_license | #include <bits/stdc++.h>
using namespace std;
int flag = 0;
int precedence(char op){
if(op == '+'||op == '-')
return 1;
if(op == '*'||op == '/')
return 2;
return 0;
}
int applyOp(int a, int b, char op){
switch(op){
case '+': return a + b;
case '-': return a - b;
case '*': return a * b;
... |
dfcc294be464862aedb045bcc1a01076c53ebcdb | 98ff442c904beeb973527486cd0172441bd81ee2 | Leslym03/AED | /EjerciciosWeissCap3/E_22.cpp | C++ | cpp | 1,072 | no_license | double evalPostFix(){
stack<double> s;
string token;
double a, b, result;
cin>> token;
while (token[0] != '=') {
result = atof (token.c_str());
if (result != 0.0 )
s.push(result);
else if (token == "0.0")
s.push(result);
else
switch... |
edcf1388062d8145835d9a1073bc154fc9f82b9f | 8bd1359ebc45e03e3d063d5b4c858fc9876f3c50 | Zack-Wang-upup/the-progress-of-my-learing-C-python-and-Raspberry-Pi- | /C++ program/金字塔.cpp | C++ | cpp | 294 | no_license | #include<iostream>
using namespace std;
int main()
{int i,j,n;
cout<<"ÇëÊäÈën=";
cin>>n;
for(i=1;i<=n;i++)
{for(j=1;j<=n-i;j++)
cout<<" ";
for(j=1;j<=i;j++)
cout<<j;
for(j=i-1;j>=1;j--)
cout<<j;
cout<<endl;
}
system("pause");
return 0;
}
|
75d27eca6386f3611b4565f0e7e6135be0ff14b8 | 71f6cb7915bdf78f6c8379e223c0d501b3415046 | PsymonLi/sw | /nic/sdk/platform/utils/mpartition.hpp | C++ | hpp | 8,560 | no_license | /**
* Copyright (c) 2018 Pensando Systems, Inc.
*
* @file mpartition.hpp
*
* @brief This module defines memory partition interface
*/
#ifndef __SDK_PLATFORM_MPARTITION_HPP__
#define __SDK_PLATFORM_MPARTITION_HPP__
#include "include/sdk/base.hpp"
#include "include/sdk/types.hpp"
#include "lib/shmmgr/shmmgr.h... |
9257fd276cc08a5a941a2810e51a3fb3a3874d4a | ce1b548ea5022f550c6888a81abf15c3cce17566 | KDE/akregator | /src/feed/feedretriever.cpp | C++ | cpp | 1,652 | permissive | /*
This file is part of Akregator.
SPDX-FileCopyrightText: 2018 Daniel Vrátil <dvratil@kde.org>
SPDX-License-Identifier: GPL-2.0-or-later WITH Qt-Commercial-exception-1.0
*/
#include "feedretriever.h"
#include "akregator-version.h"
#include "akregatorconfig.h"
#include <KIO/StoredTransferJob>
#include ... |
5d6e5740cba20dcb36b37450972d81dfab6a8242 | 92028c1ba482f599ac80953957673353984e3d47 | yaskev/planarity | /planar.cpp | C++ | cpp | 11,292 | no_license | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
class Face;
class ListGraph {
public:
~ListGraph() = default;
explicit ListGraph(int vertNumber);
void AddEdge(int from, int to);
int VerticesCount() const;
bool areAdjacent(int v1, int v2) const { retu... |
ddbde26c4e131252783dfd069a945adbfdc40086 | 4cb80cab7103544e27ad2439fdc8f8a82d7b809e | veldrinlab/thesis-cuda-sparse-voxel-octree | /src/projects/Mathlib/Transform.cpp | C++ | cpp | 3,643 | no_license | #include "Transform.h"
namespace restless
{
Transform::Transform(void) :
_localPosition(0,0,0),
_localRotation(1,0,0,0),
_localScale(1,1,1),
_mLocal_invalid(true),
_mLocalInv_invalid(true),
_mWorld_invalid(true),
_mWorldInv_invalid(true),
_transformParent(nullptr)
{
}
Transf... |
aa7abee018d41719963bfa3ee58545473272f2f5 | dd238e36021c6df531626e022cec6be9bb17ce31 | us419/Programmers_algorithm_practice | /stack/queue/프린터.cpp | C++ | cpp | 893 | no_license | #include <string>
#include <vector>
#include <deque>
using namespace std;
bool isMax(deque<int>& priorities)
{
int front = priorities.front();
deque<int>::iterator it;
for (it=priorities.begin(); it!=priorities.end(); it++)
{
if (*it > front)
return false;
}
return true;
}
... |
b4c64e3db6910c199639f2f7d3909d76042649df | 23510b2a8626c4765f07ed58b70a76a3fd76c3c9 | aakash30jan/tensorflow | /tensorflow/lite/optional_debug_tools.cc | C++ | cc | 12,101 | 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... |
f1a581f075775ad6da9b083d68ee748bed4c976f | adfb52d42f1368e9f7ca057dcc63e56b10015d75 | parsa/iato | /src/lib/isa/Psr.hpp | C++ | hpp | 4,648 | no_license | // ---------------------------------------------------------------------------
// - Psr.hpp -
// - iato:isa library - processor status register class definition -
// ---------------------------------------------------------------------------
// -... |
2df0d5da9b7fda0ce05edf60990ed5619d38acaf | d2a438d297509f5e8653060d4d42b6479a624ceb | baoyoubing/libmove3d-planners | /src/planner/TrajectoryOptim/goal_set_projection.cpp | C++ | cpp | 18,618 | no_license | /*
* Copyright (c) 2010-2015 LAAS/CNRS, WPI
* 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
* notic... |
d6ca1c182dbeaef6da6ba1c78bef9fae96e446bf | afa6a9a94ec2ffd824d66a363c53b69455706d06 | Godsinred/tensorflow | /tensorflow/lite/testing/kernel_test/generate_diff_report.cc | C++ | cc | 1,337 | permissive | /* Copyright 2019 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... |
c8e356a38daa6ac2d5ac96f967696e99c5989b76 | 8411c6e810c061dafae330d5370ad3d89bc69180 | dbuksbaum/FreeOrion | /FreeOrion/combat/OpenSteer/AsteroidBeltObstacle.cpp | C++ | cpp | 7,210 | permissive | #include "AsteroidBeltObstacle.h"
namespace {
const float SQUARE_APPROX_FACTOR = 0.83486238532110091f;
}
AsteroidBeltObstacle::AsteroidBeltObstacle(float r, float tr) :
m_radius(r),
m_tube_radius(tr)
{}
AsteroidBeltObstacle::AsteroidBeltObstacle() :
m_radius(1),
m_tube_radius(0.1f)
{}
void Aste... |
94ef28eb119216a013c43042bc47db27705982c0 | 25a4a0fcf82c5970cfaf5bb2a432c170ad939131 | ALICEHLT/AliRoot | /TDPMjet/AliGenDPMjet.cxx | C++ | cxx | 47,141 | permissive | /**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors ... |
94c5e94c3c72dd980e204ed0db56070e5b26f260 | dab7bd7959944633dc7b3b3ad7cfd8f299ba5a3d | Shirish111/LeetCode | /KthSmallestElementInABst/a.cpp | C++ | cpp | 1,785 | no_license | // Kth Smallest Element in a BST
// Given a binary search tree, write a function kthSmallest to find the kth
// smallest element in it.
// Note:
// You may assume k is always valid, 1 ≤ k ≤ BST's total elements.
// Example 1:
// Input: root = [3,1,4,null,2], k = 1
// 3
// / \
// 1 4
// \
// 2
// Output... |
9e589aff828705722360b9a64bee5f902802234c | 2cad95ef58fde56b4b120dd9e2896982a4f5ae0e | helloworld1983/metal_fs | /src/metal-pipeline/src/data_source.cpp | C++ | cpp | 765 | permissive | extern "C" {
#include <unistd.h>
#include <snap_hls_if.h>
}
#include <snap_action_metal.h>
#include <iostream>
#include <metal-pipeline/data_source.hpp>
#include <metal-pipeline/snap_action.hpp>
namespace metal {
RandomDataSource::RandomDataSource(size_t size) : DataSource(0, size) {
_optionDefinitions.insert(st... |
db8d83c8426433749bc5bb245c886cc4392dbd26 | a8357e2a1ac529c4b428d84269467ddbd53bcf2a | LenyKholodov/wood | /tests/math/test/test.cpp | C++ | cpp | 595 | no_license | #include <math3d.h>
#include <iostream.h>
void main ()
{
vector3d_t v (1,2,3); v.normalize ();
vector3d_t v1 (-1,3,2);
float angle = 3.14 / 2;
quat_t q (v,angle);
quat_t q1 (v1,angle);
matrix_t d ;
matrix_t m = q.toMatrix ();
// matrix_t m (1);
// matrix_t m = matrix_t::tran... |
f86769dbd20830b67974a1d0e229671efc1cab98 | f5df23e6c006fe888f0080e974755f64db25ecec | sindri69/pizza420 | /P86 Backups/006 Núna með Prices/MAKE/ToppingMake.cpp | C++ | cpp | 987 | no_license | #include "ToppingMake.h"
#include "ReadFunctions.h"
ToppingMake::ToppingMake()
{
//ctor
}
void ToppingMake::make_topping(const Topping& topping) {
if(isValidToppingName(topping) && isValidToppingPrice(topping)) {
topping_repo.make_topping(topping);
}
}
bool ToppingMake::isValidToppingName(const ... |
84eb7a82fa19ba5ca317c00b48d99d8869427f10 | 076a1981fc4e655b6cb5e3664c056649956c9be6 | aapocketz/sst-elements | /src/sst/elements/firefly/nicRecvCtx.cc | C++ | cc | 6,416 | permissive | // Copyright 2009-2019 NTESS. Under the terms
// of Contract DE-NA0003525 with NTESS, the U.S.
// Government retains certain rights in this software.
//
// Copyright (c) 2009-2019, NTESS
// All rights reserved.
//
// Portions are copyright of other developers:
// See the file CONTRIBUTORS.TXT in the top level directory... |
59af30dea1fbfbfe827a986dfde6ac6bee48bdb9 | d32e3f79582bf934481bfb805d40515b12242ce2 | oamates/PC2.0 | /third_party/uc_sdk/src/services/filetransfer_service/FSResponseAssist.cpp | C++ | cpp | 4,089 | no_license | /*
* CallRequestAssist.cpp
*
* Created on: Aug 3, 2015
* Author: hualong.zhang
*/
#include <iostream>
#include "FSResponseAssist.h"
#include <boost/property_tree/ptree.hpp>
#include <boost/property_tree/json_parser.hpp>
#include <boost/property_tree/ptree_fwd.hpp>
#include "common/StringConvert... |
cf3ed223b1d654b77e859d09d69d05d347ae9835 | 30721838d935499eee8a41047a4d2eb65a969168 | sslattery/SFC | /core/src/SFC_NewtonSolver.hpp | C++ | hpp | 3,196 | permissive | //---------------------------------------------------------------------------//
/*
Copyright (c) 2013, Stuart R. Slattery
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
*: Redistributions o... |
a512f6c1aba164de2bfa08afa2e8e22bbeb027c5 | 0c8b60cab48d15f7a663a31603cfdb2160889276 | chinajeffery/MPC-BE--1.2.3 | /src/apps/mplayerc/PPageAccelTbl.cpp | C++ | cpp | 39,625 | permissive | /*
* $Id: PPageAccelTbl.cpp 2467 2013-04-11 05:55:16Z judelaw $
*
* (C) 2003-2006 Gabest
* (C) 2006-2013 see Authors.txt
*
* This file is part of MPC-BE.
*
* MPC-BE 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 Softwar... |
57c3c305704a0731c6a73f0759a428039d77775b | 24c9fa2543ff7a9a6111fd110d9b42b42549cc20 | Pointy-hair/AI-Algorithms | /slam/perception/ndt_fuser/src/ndt_fuser.cpp | C++ | cpp | 5,596 | no_license | #include <ndt_fuser/ndt_fuser.h>
namespace perception_oru {
void NDTFuser::initialize(Eigen::Affine3d initPos, pcl::PointCloud<pcl::PointXYZ> &cloud) {
std::cout << "Initializing NDT FUSER!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n";
///Set the cloud to sensor frame with respect to base
perception_oru... |
34fe0e411641b914f6ede8646a62aa6389bcf537 | d268a2edc3004f2603b71157950dc73b6d38d928 | gky2009514/lintcode | /C++/012_Min Stack.cpp | C++ | cpp | 512 | no_license | class MinStack {
public:
MinStack() {
while (!stk.empty())
stk.pop();
while (!mi.empty())
mi.pop();
}
void push(int number) {
if (mi.empty() || number <= mi.top())
mi.push(number);
stk.push(number);
}
int pop() {
int top =... |
4da5afd02c5b510bb016fc47f81c9276da03ac48 | 2a624872f81cff7b93a804863ebee51f2bf1d41c | Evg503/Stepik | /multithreads/6.4.2/memP.cpp | C++ | cpp | 615 | permissive | #include <sys/mman.h>
#include <sys/stat.h> /* For mode constants */
#include <fcntl.h> /* For O_* constants */
#include <unistd.h>
#include <sys/types.h>
#include <string.h>
#include <stdio.h>
int main()
{
size_t size = 1<<20;
int memd = shm_open("/test.shm",... |
4e1a56ae45c36bdb7d6af253dc8d653740910f06 | bfa597bbddb029f1b0b4207d21e6cffef9dcd526 | tiankonguse/ACM | /contest/poj/shen10000/2409/10172426_AC_0MS_164K.cpp | C++ | cpp | 416 | no_license | #include<stdio.h>
#define MAXN 1000
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
long long polya(int c , int s)
{
long long p[100];
p[0]=1;
for( int k=0; k<s;k++)p[k+1]=p[k]*c;
long long count=s&1 ? s*p[(s>>1) +1]:(s>>1)*(p[s>>1] + p[(s>>1)+1]);
for(int k=1; k<=s;k++)count+=p[gcd(k,s)];
return count/(2*s);
}... |
d6a8dc4c437d94c069791206cb63da358435d836 | cff86ad07ce82c31deffe14c0e844ba6d0b43c6c | mambaru/wfcroot | /wonderwaffel/tank_options_json.hpp | C++ | hpp | 2,169 | no_license | #pragma once
#include <wjson/wjson.hpp>
namespace wfc
{
template<
typename ReqJ = wjson::empty_object<>,
typename ResJ = wjson::empty_object<>,
typename OJ = wjson::empty_object<>
>
struct tank_options_json
{
JSON_NAME(request)
JSON_NAME(response)
JSON_NAME(target)
JSON_NAME(gunfire_size)
JSON_N... |
9eb9968a3bc77862c0da46eb3868ab8b780e2a71 | c0eee01c2045f9423d2c03c436594b52acc408e9 | gbrlas/AVSP | /CodeJamCrawler/dataset/09_1506_66.cpp | C++ | cpp | 1,826 | no_license | #include <cstdio>
#include <cstring>
using namespace std;
int T;
int H, W;
unsigned int map[100][100];
char cmap[100][100];
char next_char = 'a';
inline void getInput() {
scanf("%d %d", &H, &W);
for (int h = 0; h < H; h++) {
for (int w = 0; w < W; w++) {
scanf("%d", &map[h][w]);
}... |
811b6dbf879b7712d0672afe451818fee392d9b2 | 752609fc1130cb7aaeff207c665ccfddae3b1525 | isoundy000/ouzel | /ouzel/scene/Camera.cpp | C++ | cpp | 10,639 | permissive | // Copyright (C) 2017 Elviss Strazdins
// This file is part of the Ouzel engine.
#include <cassert>
#include <algorithm>
#include "Camera.hpp"
#include "core/Engine.hpp"
#include "graphics/Renderer.hpp"
#include "graphics/RenderDevice.hpp"
#include "Layer.hpp"
#include "graphics/TextureResource.hpp"
#include "math/Mat... |
8fa5e84607a08a6c794ff5ba8b318721cba15021 | 43e75ee42d4d26b4cfad8f5a134655adc80f95c5 | alhasanmridha/codejam | /Kick Start/Kick Start 2020/Round B/Robot.cpp | C++ | cpp | 912 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
LL M=1e9;
int n;
struct cord{
LL x;
LL y;
};
map<int,int>mp;
string s;
cord get(int id){
LL mult=s[id]-'0';
int n=mp[id];
id++;
cord cur={0LL,0LL};
for(int i=id;i<n;){
if(s[i]<='9' and s[i]>='1'){
cord ret=get(i);
cur.x+=ret.x;
... |
708bd047aa0084461a57d4f5adaeccaa1dd257d6 | fb3410fa73d30f9ed791ecc2ee40960e906386a5 | anonimal/kovri | /src/core/router/net_db/requests.cc | C++ | cc | 8,009 | permissive | /** //
* Copyright (c) 2013-2018, The Kovri I2P Router Project //
* //
* All rights reserved. ... |
e3fe7a326cfd447b57f2aad9bea30f953b0f56ad | 20981237d4d4ef00871daf4dcb1ed9f03fcf3ad9 | jessebarreto/Computer_Vision_Classes | /Project2/project2_req4.cpp | C++ | cpp | 1,789 | no_license | /******************************************************************************************
* Universidade de Brasília – UnB
* Instituto de Ciências Exatas – IE
* Departamento de Ciência da Computação – CIC
* Visao Computacional – Professor Fabio Vidal
*
* Projeto 2 – Objetivo
* Esta atividade tem como objetivo ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.