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 |
|---|---|---|---|---|---|---|---|---|
b7fbaf19e85400cdbe3030d032363d49f854f9e1 | 30f1b4fc45c9d188b63e7147a1083dcbcdfc6908 | jkeller3/KellerJoseph_CIS17C_48942 | /Practice/DoublyLLPRactice/Stack.cpp | C++ | cpp | 942 | no_license | /*
* File: Stack.cpp
* Author: rcc
*
* Created on December 2, 2015, 5:13 PM
*/
#include "Stack.h"
#include <iostream>
Stack::Stack(const Stack& orig) {
if(this != &orig){
head = orig.head;
tail = orig.tail;
listSize = orig.listSize;
}
}
Stack::~Stack() {
for(int i=0; i<li... |
3f588845acd17a7cc62d8f9b8fdf2a4672b3d16e | b9f1b9a89f2aad01a017c94728f73e2fc1089fef | blackenwhite/Competitive-Coding | /cut_stick.cpp | C++ | cpp | 882 | no_license | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
int i,j,k;
cin >> n;
vector<int> arr(n);
for(int arr_i = 0;arr_i < n;arr_i++){
cin >> arr[arr_i];
}
while(1)
{
int min=arr[0];
int... |
aaff44f9b4ed2ee65f67b7bc2f1c8b0feaf26a15 | 41268c264faef06e7bc62af40adb371c941283c5 | l1nkkk/leetcode | /offer/Offer06.从尾到头打印链表.cpp | C++ | cpp | 625 | no_license | //
// Created by l1nkkk on 2022/3/21.
//
#include <iostream>
#include <vector>
using namespace std;
namespace offer6{
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
int n = 0;
vector<int> reversePrint(ListNode* head) {
vecto... |
92015179b769f547431f581e3c5e23f2790c87ac | 8105b45d610f6393e2f1b1784d88aab7f96fff7a | jmrsuarez/Grade-12-ICS | /java_utilities/jna/sapi_dll.cpp | C++ | cpp | 374 | no_license | #include <windows.h>
#include <sapi.h>
extern "C" __declspec(dllexport) int Speak(LPCWSTR text) {
ISpVoice *v;
if (FAILED(CoInitialize(nullptr))) {
return 1;
}
HRESULT hr = CoCreateInstance(CLSID_SpVoice, nullptr, CLSCTX_ALL, IID_ISpVoice, (void**)&v);
if (FAILED(hr)) {
return 2;
}
v->Speak(text, 0, null... |
4941a46003dc065181b83ebab0a3d15bcb834fcc | f6b74277a9dd3e7a4ae3ad2e13a884c44754c0b4 | flyish/UE4_Starter | /Source/UE4_Demo/UE4_DemoGameInstance.cpp | C++ | cpp | 1,581 | permissive | // Fill out your copyright notice in the Description page of Project Settings.
#include "UE4_DemoGameInstance.h"
UUE4_DemoGameInstance::UUE4_DemoGameInstance()
: m_pActionManager(nullptr)
, m_pUserWidgetManager(nullptr)
, m_pTesterController(nullptr)
{
}
void UUE4_DemoGameInstance::OnStart()
{
m_pActionManager... |
dfb7b3fa5ac2c06223dd1cac5549679f9d9596f7 | 737249f8aba667048f39fc7d4ce5f1c4668c4c7f | njoy/GNDStk | /src/GNDStk/Tree/src/read.hpp | C++ | hpp | 1,374 | permissive |
// -----------------------------------------------------------------------------
// Tree.read()
// Cases are as for Node.read(), to which these defer with decl == true,
// meaning that, for Tree, we preserve any declaration node.
// -----------------------------------------------------------------------------
// 1. r... |
a0362a1985c861a5fa639898493daa3cc0e30407 | 662ebd0453de5dfd49707995d6229d25eb715580 | zephyroal/BloodrainPlan | /Trunk/BloodRain3D/BloodRain3D/App/AppFrame.cpp | C++ | cpp | 25,613 | no_license | #include "AppFrame.h"
CBloodRain3DApp::CBloodRain3DApp()
{
mTerrainMgr = NULL;
mSplatMgr = NULL;
}
CBloodRain3DApp::~CBloodRain3DApp()
{
delete mTerrainMgr;
delete mSplatMgr;
}
bool CBloodRain3DApp::configure(void)
{
// Show the configuration dialog and initialise the system
// Y... |
8e5d068017de00aaf2879d8c1a926f4cd1dd5f90 | 4164672099f87a8788cc3cf0febc681f3707bd8d | J05062019jazEc18/listadoble | /lista doble.cpp | C++ | cpp | 1,547 | no_license | #include <iostream>
#include <conio.h>
using namespace std;
struct Nodo{
int valor;
Nodo *anterior, *siguiente;
};
void agregar( int);
void mostrar();
void mostar_atras();
struct Nodo *lista=NULL;
int main(int argc, char** argv) {
int opc, dt,n;
while(opc!=3){
cout<<" MENU "<<endl;
cout<<"1.- Ingresar nodo... |
cbd9f39909512be68ed21206fb4b995d7fdf8236 | fcd5b1422daf4318d8c24d899823165193998efa | joseph-gamedev/cpp-netlib | /boost/network/message/modifiers/body.hpp | C++ | hpp | 645 | permissive | #ifndef BOOST_NETWORK_MODIFIERS_BODY_HPP_20100824
#define BOOST_NETWORK_MODIFIERS_BODY_HPP_20100824
// Copyright 2010 (c) Dean Michael Berris
// 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)
namespace boost { na... |
4a93a581db34f52610802728e0517d014810a011 | 15630d81e026dd11f87a67fee609e1f8e5516b8e | Tao20211015/myjfm_spider | /src/global.cc | C++ | cc | 13,549 | no_license | /*******************************************************************************
* global.cc - all the global variables are packeged into one class
*
* Copyright (c) 2013, myjfm <mwxjmmyjfm at gmail dot com>
* All rights reserved.
******************************************************************************/
#in... |
cc3e8c4f4b6005102291768bac7727471f5c640b | ad3bb7ddc304e823a6a4daff970523e3508c2eb2 | stArl23/onlineJudgeExam | /HOJ/1010.cpp | C++ | cpp | 1,766 | no_license | #include<iostream>
#include<cmath>
using namespace std;
char routes[7][7];
bool visited[7][7];
int d_x,d_y;
bool checkbound(int x,int y,int n,int m) {
return 0<=x&&x<n&&y>=0&&y<m;
}
void dfs(int x,int y,int n,int m,int t,int count,bool& flag) {
if(flag)return;
if(t==count) {
if(routes[x][y]=='D') {
flag=true... |
7a2e14ad0ebac2843fa7971a1d42a16120c6dd6c | c12df254a4445295da6d7afa5f90199d717199a6 | janniz/hwid_spoofer | /hwid_spoofer/util.hpp | C++ | hpp | 3,150 | no_license | #pragma once
#include "exported.hpp"
#include "fnv.hpp"
#include <tuple>
#include <random>
namespace serializer
{
// thanks to namazso
static inline bool is_good_char( char c )
{
const auto u = uint8_t( c );
return ( u >= uint8_t( '0' ) && u <= uint8_t( '9' ) )
|| ( u >= uint8_t( 'A' ) && u <= u... |
cba4f45bdc18dbbda00d36a1fc086797f6f8ae0b | b0fef33a1c806306c8ae970064ac2f64411060af | AkiraBiao/ogs | /MaterialLib/MPL/CreateProperty.cpp | C++ | cpp | 9,299 | permissive | /**
* \file
* \author Norbert Grunwald
* \date Sep 7, 2017
*
* \copyright
* Copyright (c) 2012-2019, OpenGeoSys Community (http://www.opengeosys.org)
* Distributed under a Modified BSD License.
* See accompanying file LICENSE.txt or
* http://www.opengeosys.org/project/lic... |
5538e86f8a7007876862c62339cd659ac848e5ea | 7947ee66e13094293777d178b3f5829762a8f555 | gilbertoalexsantos/judgesolutions | /Solved/CodeF/@CodeF 492 - B. Vanya and Lanterns/492 - B. Vanya and Lanterns.cpp | C++ | cpp | 879 | no_license | //Author: Gilberto A. dos Santos
//Website:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const double EPS = 1e-9;
bool less_than(double a, double b) { return (a - b) < EPS; }
bool greater_than(double a, double b) { return (a -... |
83e3168b99bfbaae59fae94dad35fec1bb85dd31 | ff9ce7c2f3cf223c48a6c656d8f365f26496a3f3 | webosce/chromium53 | /src/third_party/WebKit/Source/platform/fonts/WebFontDecoder.cpp | C++ | cpp | 6,999 | permissive | /*
* Copyright (C) 2009 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditio... |
5eae3dfd463b5780fb85a8da125759a86f208426 | 48d095fa8df29063d2fb1970669ad6caee2ccf33 | anniyanvr/mediasoup | /worker/include/Settings.hpp | C++ | hpp | 1,284 | permissive | #ifndef MS_SETTINGS_HPP
#define MS_SETTINGS_HPP
#include "common.hpp"
#include "LogLevel.hpp"
#include "Channel/Request.hpp"
#include <map>
#include <string>
#include <vector>
class Settings
{
public:
struct LogTags
{
bool info{ false };
bool ice{ false };
bool dtls{ false };
bool rtp{ false };
bool srtp{... |
77d123b209d7e2fbfebaaf9c7d625e4800d7cb58 | e504521176a4996eafa6b8dc3a69f4bfd884f583 | lai3d/ThisIsASoftRenderer | /ThisIsASoftRenderer/Editor/XTP/Source/CommandBars/XTPControlCustom.cpp | C++ | cpp | 7,516 | no_license | // XTPControlCustom.cpp : implementation of the CXTPControlCustom class.
//
// This file is a part of the XTREME COMMANDBARS MFC class library.
// (c)1998-2011 Codejock Software, All Rights Reserved.
//
// THIS SOURCE FILE IS THE PROPERTY OF CODEJOCK SOFTWARE AND IS NOT TO BE
// RE-DISTRIBUTED BY ANY MEANS WHATSOEVER W... |
35fa7fd34860b9df6ce525ba844b7601538a7120 | f7e9b5b206e7d194086a29cc9a6d33c57a56d105 | WhiZTiM/coliru | /Archive2/8b/8894b5fe8ba1a9/main.cpp | C++ | cpp | 582 | no_license | #include <type_traits>
#include <functional>
struct foo{};
struct bar{};
bar operator/(foo, foo) { return bar{}; }
static_assert(std::is_same<std::result_of<std::multiplies<double>(double, double)>::type, double>{}, "");
static_assert(std::is_same<std::result_of<std::negate<int>(int)>::type, int>{},... |
a667f6a37da1cac6282f2b8daae9b18dc47c9863 | 807ae3c0db23352519184e0e09688794bd8a0dea | zeyiwu/chromium | /chrome/browser/chromeos/login/quick_unlock/quick_unlock_storage.cc | C++ | cc | 3,043 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/login/quick_unlock/quick_unlock_storage.h"
#include <memory>
#include "base/time/time.h"
#include "chrome/browser/chro... |
eee9fcc7642e1ff113ca8b3b7c212a8730fcff16 | 86a5ecceafbf1ff2ee5ee6cb64e356102a1a557c | HemantKr79/CB-Competitive-Programming-Solutions | /13. Dynamic Programming/Advanced DP - Valentine Magic.cpp | C++ | cpp | 898 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int inf = 1e18;
int n,m;
int solve(int i,int j,vector<int> &boys,vector<int> &girls,vector<vector<int> > &dp) {
if(i==n) {
return 0;
}
if(j==m) {
return inf;
}
if(dp[i][j]!=-1) {
... |
69de55f6c4801a632c2cf10656d25bff0182e58f | bd192b8767d9816424406f3c5585ca83200fae27 | emwhbr/daemon | /basic_daemon/src/basicd_main.cpp | C++ | cpp | 8,289 | no_license | // ************************************************************************
// * *
// * Copyright (C) 2013 Bonden i Nol (hakanbrolin@hotmail.com) *
// * *
// * This progra... |
fac6381f14553f9950f5360938945c70fc2084fb | f362228990d46adff2ddc7e50bbbb592835eebcc | KotelnikovaAA/Lab_0b_Ver1 | /main.cpp | C++ | cpp | 997 | no_license | #include <iostream>
#include "Reader.h"
#include "OperationWithMap.h"
#include "Writer.h"
int main(int argc, char* argv[]) {
if (argc <= 2) {
std::cout << "Wrong number of parameters sent." << std::endl;
return 0;
}
std::string nameFileIn = argv[1];
std::string nameFileOut = argv[2];
... |
9c71efacaec5ded31f597ba2d4676c9e943d4a4b | 11e0a8048902653b64f6695fa0f927e0279866af | solofff/kbengine_ue4_demo | /Plugins/kbengine_ue4_plugins/Source/KBEnginePlugins/Engine/TestNoBaseBase.cpp | C++ | cpp | 3,272 | no_license | #include "TestNoBaseBase.h"
#include "KBVar.h"
#include "Entity.h"
#include "EntityDef.h"
#include "ScriptModule.h"
#include "Property.h"
#include "Method.h"
#include "DataTypes.h"
#include "CustomDataTypes.h"
#include "MemoryStream.h"
void TestNoBaseBase::createFromStream(MemoryStream& stream)
{
EntityComponent::cr... |
11a25c185eebb486f7746b0046618c302c87616d | 23d4999244f4424d4f4028a6592c77e11975de9e | sdk-team/aliyun-openapi-cpp-sdk | /bssopenapi/src/model/QueryUserAlarmThresholdResult.cc | C++ | cc | 2,597 | permissive | /*
* Copyright 2009-2017 Alibaba Cloud 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... |
6c210d5c02b205269361bccb652c1a5add3608ec | 071ded09337cae030f91082215e872c9147c9245 | yoshi5534/schorsch-the-robot | /src/Control2012/libreoffice/com/sun/star/io/XAsyncOutputMonitor.hpp | C++ | hpp | 1,505 | no_license | #ifndef INCLUDED_COM_SUN_STAR_IO_XASYNCOUTPUTMONITOR_HPP
#define INCLUDED_COM_SUN_STAR_IO_XASYNCOUTPUTMONITOR_HPP
#include "sal/config.h"
#include "com/sun/star/io/XAsyncOutputMonitor.hdl"
#include "com/sun/star/uno/XInterface.hpp"
#include "com/sun/star/uno/RuntimeException.hpp"
#include "com/sun/star/io/IOExceptio... |
8ecc7e69ef65b378be41e653851bf59be70cd5ce | 01518e407bd65960b8bf00f1adf7fd97a5e4bdf3 | bappy451/Competative-Code | /CodeForces/734A Anton and Danik.cpp | C++ | cpp | 426 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n=0;
while(cin>>n)
{
string str;
cin>>str;
int A=0, D=0;
for(int k=0; k<n; k++)
{
if(str[k]=='A') A++;
else D++;
}
if(A>D) cout<<"Anton"<<endl;
... |
99622150a792fdf222049f5a6379d6111cb45bea | f348c6e86601771a6398aab2af2913cdc868c2cd | cdsama/LeetCode | /src/0756.cpp | C++ | cpp | 1,668 | no_license | #include "LeetCode.hpp"
/*
756. Pyramid Transition Matrix
Medium
We are stacking blocks to form a pyramid. Each block has a color which is a one letter string, like `'Z'`.
For every block of color `C` we place not in the bottom row, we are placing it on top of a left block of color `A` and right block of color `B`.... |
aa8d6c33d6cc39605db28f9e1c923e05c89ab098 | d18c7bff60d836f5ec80466d30355f0c63789525 | casey/fuchsia | /zircon/system/core/netsvc/test/paver-test.cc | C++ | cc | 11,828 | permissive | // Copyright 2019 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
#include "test/paver-test-common.h"
namespace {
constexpr char kFakeData[] = "lalala";
} // namespace
TEST(PaverTest, Constructor) { netsvc::Paver paver(zx::channel); }
TEST(PaverTes... |
15ec04239c91d0e34506e64cb29fc2bc93127043 | ca637344556c1ded4d86d1aab810c7652ac35ef6 | jamesalliban/JaguarSkills | /addons/ofxKinectNui/src/kinect/nui/Kinect.cpp | C++ | cpp | 11,010 | permissive | #include <vector>
#include "kinect/nui/Kinect.h"
namespace kinect {
namespace nui {
//----------------------------------------------------------
/**
@brief Constructor
@param index Index number of Kinect instance
@arg -1 when search next available device
*/
Kinect::Kinect(int index /* = -1*/)
{... |
9895c6bcb443acb067710096143e0b0f27ba0d53 | e23718e95e00ec852c111c0322d42fde56ae47fc | starsky77/Lab_for_CV | /Src/Lab2/myFitEllipse_canny.cpp | C++ | cpp | 2,920 | no_license | #include <opencv2/imgproc.hpp>
#include <opencv2/imgcodecs.hpp>
#include <opencv2/highgui.hpp>
#include <iostream>
using namespace std;
using namespace cv;
Mat image;
Scalar fitEllipseColor = Scalar(255, 255, 0);
Mat src_gray;
Mat canny_image, detected_edges;
int lowThreshold = 0;
const int max_lowThreshold = 100;
c... |
a6f3a01ad70ea1797fae34ebb6a0f95931d5ee18 | 6c69c5aea28bb5a815f8c2984ebc6b7574f48cc0 | vincaslt/WAVM | /Source/Programs/Test.cpp | C++ | cpp | 15,608 | permissive | #include "Inline/BasicTypes.h"
#include "Inline/Serialization.h"
#include "Platform/Platform.h"
#include "WAST/WAST.h"
#include "WAST/TestScript.h"
#include "WASM/WASM.h"
#include "Runtime/Runtime.h"
#include "Runtime/Linker.h"
#include "Runtime/Intrinsics.h"
#include "CLI.h"
#include <map>
#include <vector>
#include... |
20ed3e24056cc09ad2ef8fc44926d410ec7b72f1 | 274df9ae407cfb71e00c9e300e3ee142c1079293 | moubarakelmahdi1/c-calculator-graph | /clion/AL.cpp | C++ | cpp | 9,959 | no_license | #include "includes.h"
LISTE remplir_liste_fonction(LISTE liste_reference,char* tab_fonction,typelexem lexem,typefonction fonction)
{
LISTE l=(LISTE)malloc(sizeof(struct fonction));
if(liste_reference==NULL)
{
l->tab_fonction =(char*)malloc(sizeof(char)*(strlen(tab_fonction)+1));
strcpy(l->t... |
d5e4a6451c384aaef4de7ed58dd9be4c438dca54 | d6e8638c3c2f4ed4c5ac0363f725645933dfb9f6 | MedicaicloudLink/Rosetta | /main/source/src/basic/Emitter.hh | C++ | hh | 14,154 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
2efecbaeb4afc825e5b2a6dced9a82b2d585d8dd | e0d6f00f3d2d4f1396cf53f82e258845336d97ca | 18616378431/myCode | /CPP/C++Primer Plus/8.3/main.cpp | C++ | cpp | 595 | no_license | #include<iostream>
using namespace std;
int main(int argc,char* argv[])
{
int rats = 101;
int & rodents = rats;
cout << "rats = " << rats << endl;
cout << "rodents = " << rodents << endl;
cout << "address rats = " << &rats << endl;
cout << "address rodents = " << &rodents << endl;
int bunnies... |
4650281ade18ef8ea3624957b5cf35dbab9c69ef | e7d47b38eba713ba4af03d43be7fd8170d986fab | chaincash/chaincashwallet | /src/qt/receiverequestdialog.cpp | C++ | cpp | 5,743 | permissive | // Copyright (c) 2011-2013 The Bitcoin developers
// Copyright (c) 2017 The PIVX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "receiverequestdialog.h"
#include "ui_receiverequestdialog.h"
#include "bi... |
43f89e9037bc1cef193fc573e7f54e258c954a64 | 0abe8511d9969061f148e62906c90f3cb08ec440 | chengwenwu/file | /charpter03/0324.cpp | C++ | cpp | 368 | no_license | #include<map>
#include<string>
#include<iostream>
using namespace std;
int main(){
map<int,string> mapStudent;
mapStudent[1] = "student_one";
mapStudent[2] = "student_two";
mapStudent[3] = "student_three";
int iSize = mapStudent.size();
for(int i = 1; i <= iSize; i++){
cout<<i<<" "... |
2ea4f04fb0a2ef2c678a8a1b427b89e4daa368f5 | 31fe351825dac9615e93aba0789ef91a3d30d8f8 | koosk/siege | /src/math/Matrix4.cpp | C++ | cpp | 12,244 | no_license | #include "math/Matrix4.h"
#include <string.h>
#include <cmath>
#include <iostream>
namespace siege{
namespace math{
Matrix4::Matrix4(){
for(int i=0; i<16; i++){
data[i] = 0.f;
}
this->data[0] = this->data[5] = 1.f;
this->data[10] = this->data[15] = 1.f;
}
Matrix4::Matrix4(const Matrix4 &m){
... |
0c02b54339f3cbe382b6157159ab2d2f512b4dae | 3c3c2df8dc225f534445f798c88e291bb9277d79 | novakale/openvino | /src/frontends/tensorflow/src/op/conv_2d.cpp | C++ | cpp | 496 | permissive | // Copyright (C) 2018-2022 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include "op_table.hpp"
#include "openvino/opsets/opset8.hpp"
#include "utils.hpp"
using namespace std;
using namespace ov::opset8;
namespace ov {
namespace frontend {
namespace tensorflow {
namespace op {
OutputVector translate_... |
01cb0d6f0582bc07350b9e345d65e0035bdb0fd9 | 0dc002903eb757349574867738ddc5bf414d6ce3 | dkaravaev/algs-stepik | /DynamicProgramming/LIS/LDS.hpp | C++ | hpp | 670 | no_license | //
// Created by chronomancer on 12/8/15.
//
#ifndef ALGSSTEPIC_LDS_HPP
#define ALGSSTEPIC_LDS_HPP
#include <map>
#include <cstdint>
#include <algorithm>
class LDS
{
public:
static int find(const std::vector<uint64_t>& numbers)
{
std::vector<int> d(numbers.size(), 1);
for (int i = 0; i < numb... |
8d2a9490e264755bc9b55ab1dbaf2bf44525c144 | 8e14190a29f5b2b8446aebb517d6ea7fed9646d0 | lzlh1213/AliPhysics | /PWGHF/jetsHF/AliAnalysisTaskHFJetIPQA.cxx | C++ | cxx | 186,468 | no_license | #include "TList.h"
#include "TMatrixD.h"
#include "TParticle.h"
#include "TMath.h"
#include "TRandom3.h"
#include "TVector3.h"
#include "TGraph.h"
#include "TFile.h"
#include "TVector3.h"
#include "TLorentzVector.h"
#include "Math/SVector.h"
#include "Math/SMatrix.h"
#include "AliEmcalJet.h"
#include "AliParticleContai... |
356d18f87101e2b458e91e1551104bf6b749f7b0 | b7f4ef2ac637ccff1f21fb1080b0a850100bfad8 | LittleDrogon/MFC-Examples | /CBitmapSliderdemo/CBitmapSlider Demo.cpp | C++ | cpp | 1,989 | no_license | // CBitmapSlider Demo.cpp : Defines the class behaviors for the application.
//
#include "stdafx.h"
#include "CBitmapSlider Demo.h"
#include "DemoDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
////////////////////////////////////////////////////////////////////... |
dc28ad6364b67cc3cf5dfd5305986b68d59728a4 | c9aa3137ced0e7dff1735308ece463c0221ba39f | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/printscan/wia/setup/wiatwain/wiatwain.cpp | C++ | cpp | 566 | no_license | #define WIN32_LEAN_AND_MEAN
#include <windows.h>
/*******************************************************************************
*
* (C) COPYRIGHT MICROSOFT CORP., 2000
*
* TITLE: wiatwain.cpp
*
* VERSION: 1.0
*
* DATE: 1 August, 2000
*
* AUTHOR: Cooper Partin (coopp)
*
* DESCRIPTION:
* M... |
d848251379963cd55eee496fe8ba3bfc532533f6 | 25f1a8ce97efa14b1a3606b95f112f01916dce09 | wtbarnes/FoMo | /fomo-c/src/fomo-object.cpp | C++ | cpp | 13,657 | no_license | #include "../config.h"
#include "FoMo.h"
#include "FoMo-internal.h"
#include <map>
#include <iostream>
/**
* @brief This member is the constructor of the FoMoObject.
*
* The default constructor for the FoMo::FoMoObject constructs in order
* FoMo::FoMoObject.datacube(indim), FoMo::FoMoObject.goftcube(datacube),
... |
b12ffa0e2562e9969a4542fd632efcc08228621a | 8497f887f0decfc6e319c5fcb740a255bdbbff2c | MARYAM6549/control | /control16.cpp | C++ | cpp | 268 | no_license | #include "iostream"
#include "cmath"
using namespace std;
int main(int argc, char const *argv[]) {
int a,b;
cout<<"a ^ b = ? \nenter a and b : \n";
cout<<"a = ";
cin>>a;
cout<<"b = ";
cin>>b;
cout<< a <<" ^ "<< b <<" = "<< pow(a,b)<<"\n";
return 0;
}
|
94d95a19648ad4a89054b9b1f7b7ac451ff9c708 | 4d4d9505fe7763c9d956c6c58a1815f89f2f17ff | tempbottle/avrouter | /src/main.cpp | C++ | cpp | 6,421 | no_license | #include <iostream>
#include <boost/program_options.hpp>
namespace po = boost::program_options;
#include "database.hpp"
#include "io_service_pool.hpp"
#include "login_moudle.hpp"
#include "register_moudle.hpp"
#include "forward_moudle.hpp"
#include "router_server.hpp"
#include "http_server.hpp"
#include "ca_module.h... |
b1a7823b8944d6950eb6fa5ac323b8f0cce7fe5d | c698f98301ed792ef282553306687a315b774f6e | gorsheninmv/algorithms | /week_4/exc_5/main.cpp | C++ | cpp | 5,064 | no_license | #include <iostream>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <string>
#ifdef DEBUG
extern "C" {
#include <io.h>
}
#else
#include "edx-io.h"
#endif
#define PRINT_SPACE edx_print_char(' ');
#define PRINT_NEW_LINE edx_print_char('\n');
int main() {
edx_open();
std::queue<int> q... |
eea93654cf2aa18f48393522f73d6f9969da7e45 | c9ff31433212f2164000d9ba802a746f63fc5eb1 | akotadi/Competitive-Programming | /Contest/Club Ranking/Cuarentena2020/2/D.cpp | C++ | cpp | 3,330 | no_license | #include <bits/stdc++.h>
using namespace std;
__attribute__((constructor)) void _() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::cerr.tie(nullptr);
}
#define read(type) readNumber<type>()
#define prec(n,a) fixed << setprecision(n) << a
#define FORI(i, a, b, in) for ... |
c25daf7363a8d8a4368b04fb97f1f69f7609d0e2 | 69e1346aac5edfcb0b259367b78d9495e8b7c5ed | LuizZak/blend2d | /src/blend2d/blzeroallocator.cpp | C++ | cpp | 23,949 | permissive | // [Blend2D]
// 2D Vector Graphics Powered by a JIT Compiler.
//
// [License]
// ZLIB - See LICENSE.md file in the package.
#include "./blapi-build_p.h"
#include "./blbitarray_p.h"
#include "./blrandom_p.h"
#include "./blruntime_p.h"
#include "./blsupport_p.h"
#include "./blthreading_p.h"
#include "./blzeroallocator_p... |
c6fcd6e7595f8b2fff069a928c7ab3b9afdabf8f | eb67a6531ac74fd00dca38ae9dfc4cb27e06996f | RafaelRodMar/GameEngine | /02Slideshow/SlideShow.cpp | C++ | cpp | 1,426 | permissive | #include <iostream>
#include <stdlib.h>
#include <time.h>
#include <string>
#include <SFML/Graphics.hpp>
#include "Texture.h"
#include "GameEngine.h"
//global variables
GameEngine *pGame;
const int numslides = 6;
Texture *pTextures[numslides];
int currSlide;
sf::Sprite sprite;
bool GameInitialize()
{
//Create th... |
10ed4dd027a3d22cbcb3410b481f91e272b01fbd | f9a3eb86bfb4a48d25164b04d321700b2e9a22b7 | s0910221/CPE | /CPE顆星廣場-CPE49/Code/UVA11332.cpp | C++ | cpp | 240 | no_license | #include <iostream>
using namespace std;
int main(){
long long n;
while(cin>>n && n > 0){
while(n>=10){
long long a = n;
int count = 0;
while(a>0){
count += a % 10;
a /= 10;
}
n = count;
}
cout<<n<<endl;
}
}
|
e950f1d246da5e63f45884a8628784ae46ac0d7e | 93e489662f35e1fbfe1c78eb72a22545d984613e | huanghua1668/amrex | /Src/Base/AMReX_Geometry.cpp | C++ | cpp | 10,036 | permissive |
#include <iostream>
#include <AMReX_BoxArray.H>
#include <AMReX_Geometry.H>
#include <AMReX_ParmParse.H>
#include <AMReX_MultiFab.H>
#include <AMReX_Utility.H>
#include <AMReX_SPACE.H>
#ifdef _OPENMP
#include <omp.h>
#endif
namespace amrex {
//
// The definition of some static data members.
//
int Geometry::s... |
19b91f3d666c8d0698abcfa18aa408e86c810342 | 8db389ef13768663931cbf0b4a4a7c9b1dbdfb53 | allenwhc/Leetcode | /c++/IsomorphicStrings/IsomorphicStrings/main.cpp | C++ | cpp | 1,057 | no_license | /*
* Isomorphic Strings
* Last Modified: 7/13/2015
*/
#include <vector>
#include <iostream>
#include <string>
#include <map>
using namespace std;
class Solution{
public:
bool isIsomorphic(string s, string t){
int m = s.length();
map<char, char> mp1, mp2;
for (int i = 0; i < m; i++){
char cs = s[i];
char ... |
4c17db70f73bd42525495e51555773152aa73754 | 53345a9daec313177236e321498171bf6804fccc | babu12f/uri_problem_solved | /Array Fill II_1177.cpp | C++ | cpp | 247 | no_license | #include<bits/stdc++.h>
#define pf printf
#define sf scanf
using namespace std;
int main()
{
int n, c=0;
cin>>n;
for(int i=0; i<1000; i++)
{
if(c==n)c=0;
cout<<"N["<<i<<"] = "<<c++<<endl;
}
return 0;
}
|
61d7242ccc625a050bf0fdb13bdb33d31009d505 | 4d1a9391c875e47eaa13b468b70d75cfcedba57d | yuviiii/CSC443A2 | /select2.cc | C++ | cc | 2,853 | no_license | #include "library.h"
#include <stdio.h>
#include <string.h>
#include <strings.h>
#include <time.h>
#include <sys/timeb.h>
#include <stdlib.h>
int main(int argc, char **argv){
if (argc<6 || argc>7){
printf("Usage: ./select2 <colstore_name> <attribute_id> <start> <end> <page_size>\n");
exit(1);
}
bool stdoutFl... |
943f93ddf733305c7133ba6fd0e3d5f2223bbdb2 | aed448b0f9fbc75b7798fd14664025bfa879e939 | GamovOleg/Text_Processing | /Project3/Factory.cpp | C++ | cpp | 278 | no_license | #include "Factory.h"
#include "IProcessor.h"
IProcessor *IProcessor::chooseArg(char choice)
{
if (choice == 'A')
return new processorA;
else if (choice == 'B')
return new processorB;
else
return new processorC;
}
IProcessor * Factory::chooseArg()
{
return nullptr;
} |
df3758be3c21186b7c3f07e650008abff24e0179 | 9156b739593a78b6990f30f3c287736c75ffb642 | guilhermealbm/CC-UFMG | /estrutura_de_dados/TP3/src/BTree.cpp | C++ | cpp | 392 | no_license | #include "BTree.h"
#include "node.h"
BTree::BTree(){
this->_raiz = new Node();
}
BTree::~BTree(){
if (this->_raiz != nullptr)
delete this->_raiz;
}
void BTree::insert_cell(Cell cell){
this->_raiz->insert_cell(cell, 0);
}
char BTree::find_cell(std::string key){
return this->_raiz->find_cell(key, 0);
}
v... |
dbeb8915b8f865239725c9cd2f914e6ce50d5ece | 41222f3af069cb94fb4a533c745bf82448ec0263 | GH-WEN/BRAINSTools | /ARCHIVE/BRAINSSurfaceTools/BRAINSSurfaceRegister/AverageScalarsByResampling/itkQuadEdgeMeshAddScalarsFilter.hxx | C++ | hxx | 5,290 | permissive | /*=========================================================================
*
* Copyright SINAPSE: Scalable Informatics for Neuroscience, Processing and Software Engineering
* The University of Iowa
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file excep... |
0dcb602b316deac7e2133e85169d529e81ff6429 | 26bc1c268b54a81cc1246dcad05c58250c2e2529 | gchristian321/rootbeer | /src/midas/TMidasFile.cxx | C++ | cxx | 9,852 | no_license | //
// TMidasFile.cxx.
//
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <errno.h>
#include <assert.h>
#ifdef HAVE_ZLIB
#include <zlib.h>
#endif
#include "TMidasFile.h"
#include "TMidasEvent.h"
using namespace rb;
TMidasFile::TMidasFile()
{
uint32_... |
e6ab1e2b9780c9a6df63161da62f8be38a2c4952 | 6459db22ca5287e9006bff37a708b8e69f910103 | AbhJ/some-cp-files-1 | /codeforces1287B.cpp | C++ | cpp | 642 | no_license | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define ibs ios_base::sync_with_stdio(false)
#define cti cin.tie(0)
#define bp __builtin_popcount
using namespace std;//coded by abhijay mitra
const int N=2e5+3;
int main()
{
ibs;cti;
int n,K;cin>>n>>K;std::map<string, int> m;
std::vector... |
349b49f629d92e1983714834bfa43096ed796bc7 | 29ee59a2047bdcb308922e92b5a4b400bd294f03 | kea64/libraries | /H2_ADXL345/H2_ADXL345.cpp | C++ | cpp | 1,944 | no_license | #include <Arduino.h>
#include <Wire.h>
#include "H2_ADXL345.h"
#define ADXL345_DEVICE (0x53)
#define ADXL345_TO_READ (6)
#define ADXL345_POWER_CTL 0x2d
#define ADXL345_DATAX0 0x32
void ADXL345::init(double accAlpha) {
accAlpha_ = accAlpha;
Wire.begin(); // join i2c bus (address optional for master)
//Turni... |
ef750715343b706f8c3e33d7c9ab14a292782c1a | 3e959ad562e3fcbcaccaafd4ccf29d8eeb4cf45b | peichangliang123/UE4 | /Editor/PixelInspector/Private/PixelInspectorResult.cpp | C++ | cpp | 11,898 | no_license | // Copyright Epic Games, Inc. All Rights Reserved.
#include "PixelInspectorResult.h"
#include "PixelInspectorView.h"
#define LOCTEXT_NAMESPACE "PixelInspector"
namespace PixelInspector
{
void PixelInspectorResult::DecodeFinalColor(TArray<FColor> &BufferFinalColorValue)
{
FinalColor.Empty();
if (BufferFinalCol... |
25eefd5766c51ce1d93b767298b4b3102357037d | 30c19d0d5f612fd1fa29c9e29192475ee4abddce | prasadgujar/Programming | /ll.cpp | C++ | cpp | 410 | no_license | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, i , ans = 0 , loc = 0;
std:;cin>>n;
std::vector<int> v(n);
for(i = 0; i < n; i++)
{
std::cin>>v[i];
if(v[i]!=0)
loc++;
else
{
ans = max(ans , loc);
loc = 0... |
f3e9902e05d6c679d27ba86f1d3ba35851a3aaad | bcf7a174e818ce0e0d74eb0fb849d25c400c90ff | ghsecuritylab/CppSDK | /SDK/lib/api/cursor_ctrl.cpp | C++ | cpp | 266 | permissive | /*
* cursor_ctrl.cpp
*
* Created on: Apr 19, 2017
* Author: Cutare
*/
#include "cursor_ctl_def.h"
#include <api/timer.h>
bool GI::Sensor::Cursor::dataReady()
{
if(!this)
return false;
if(!irqHeandle->in())
return false;
else
return true;
}
|
9d6f76ecb817bdf046978249531a52b4fac96ea4 | eeb5b10ebe01d9a88836610097e829c5888341f0 | viniciusluzsouza/ste | /ExternalInterrupt/ExtInt.cpp | C++ | cpp | 1,110 | no_license | /*
* ExtInt.cpp
*
* Created on: 28 de out de 2018
* Author: vini
*/
#include "ExtInt.h"
#include <avr/io.h>
#include <avr/interrupt.h>
#include <stdint.h>
namespace EXT_INT {
CALLBACK_t ExtInt::_pcallback[8];
ExtInt::ExtInt(uint8_t id, uint8_t int_config, CALLBACK_t pcallback) {
_id = id;
_pcallback[_... |
06d83024cd922428cd619239a34d647f4b236da7 | d4521110ba6314bfcb8e91021e8971508e93a6dd | ruben-ayrapetyan/coreclr | /src/debug/ee/functioninfo.cpp | C++ | cpp | 80,690 | permissive | // Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//*****************************************************************************
//
// File: DebuggerModule.cpp
//
/... |
fcb4e7ab4403d417ab191a4d4fdd1c6602026488 | f2af01a382a94044e90356ec8c718b805a9373d1 | ronenius/Advanced-Programming-Project | /ass3/src/server/tcpServer/tcpSocket.cpp | C++ | cpp | 1,180 | no_license | #include "tcpSocket.hpp"
//The constructor of the tcp socket.
tcpSocket::tcpSocket(int sock) : sock(sock){};
//The function sends a string message from the client
//or the server to the other side, respectively.
void tcpSocket::send(std::string message)
{
//Builds the char array from the string.
int len = mes... |
e3c1a6b29f7271c71156a4d7ea7663679d5f75bf | 6b8aa25111ce5a78a1e0085ed926fc6d98b4d3de | imnotkind/Graphics | /assn2/CEnemy.cpp | C++ | cpp | 600 | no_license | #include "CEnemy.h"
void CEnemy::M_ClearMove(void)
{
while (!V_MoveQueue.empty())V_MoveQueue.pop();
}
void CEnemy::M_Loop(double t)
{
if (V_MoveQueue.empty()) return;
auto math = CMath::getInstance();
auto des = V_MoveQueue.front();
V_Osil1 += V_Osil2;
double asp = std::min(V_Speed*0.7 + V_Speed*0.3*sin(V_O... |
22aa6ec150c009ea27761ca84b0600bb89d88d3e | f7da7de514d3036c580444618e78d8d73c0ddf8d | Godjiang/algorithm | /tree/test_bin_tree.cpp | C++ | cpp | 1,585 | permissive | #include <iostream>
#include <string>
#include "../tree/avl_tree_impl.h"
template <typename T>
void testEveryOrder(binSearchTree<T> &bin_search_tree);
int main ()
{
char* createString = "6(2(0(,1),4(3,5)),8(7,9))#";
AVLTree<int> avl_tree(createString);
}
template <typename T>
void testEveryOrder(binSearchTr... |
6a205901a32e363e782689bcc5e2399aa9d3e99f | 87ed855c2a5b6c7a667719d498e61f637db2796b | Saptaparna/cmssw | /EventFilter/SiPixelRawToDigi/plugins/SiPixelDigiToRaw.cc | C++ | cc | 6,336 | permissive | #include "FWCore/Framework/interface/ESWatcher.h"
#include "FWCore/Framework/interface/global/EDProducer.h"
#include "FWCore/Framework/interface/EventSetup.h"
#include "FWCore/Framework/interface/Event.h"
#include "FWCore/ParameterSet/interface/ParameterSet.h"
#include "FWCore/Utilities/interface/InputTag.h"
#include "... |
4a802efce88d957f31d8dc5256b2a25fcf1f7b17 | c3b471bb607035d42ba46803b3ade3c765b1c593 | MayorovAndrey/OOPSZI_4laba | /src/rational.cpp | C++ | cpp | 2,913 | no_license | #include <iostream>
#include <cmath>
#include "rational.h"
using namespace std;
Rational::Rational()
{
numerator = 0;
denominator = 1;
intPart = 0;
sign = 1;
}
Rational::Rational(int n, int d, int i, int s)
{
intPart = i;
numerator = n;
denominator = d;
sign = s;
GetMixedView();
}
int ... |
150800764c49346a944e56fc2a39acc37a4ed612 | b08467ab51e63dc08e611eb2adb4568766bfd0a0 | Codeon-GmbH/mulle-clang | /test/SemaCXX/warn-unreachable.cpp | C++ | cpp | 9,345 | permissive | // RUN: %clang_cc1 %s -fcxx-exceptions -fexceptions -fsyntax-only -verify -fblocks -std=c++11 -Wunreachable-code-aggressive -Wno-unused-value -Wno-tautological-compare
int &halt() __attribute__((noreturn));
int &live();
int dead();
int liveti() throw(int);
int (*livetip)() throw(int);
int test1() {
try {
live()... |
67171fb0be7b93d8ab49fb20275d3846c7c89f1b | 7938a071118332895e8c660c892b142fba68838f | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/base/cluster/admin/cluadmin/openclus.cpp | C++ | cpp | 13,849 | no_license | /////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 1996-1997 Microsoft Corporation
//
// Module Name:
// OpenClus.cpp
//
// Abstract:
// Implementation of the COpenClusterDialog class.
//
// Author:
// David Potter (davidp) May 1, 1996
//
// Revision ... |
b13717b1db3cbba2310a019917ef44652dbceb43 | 642022084087803a80437edc5c72a8e22c17efd5 | caorenmei/cr_libraries | /src/common/cr/lua/log_params.cpp | C++ | cpp | 2,678 | no_license | #include "log_params.h"
#include "string.h"
namespace cr
{
namespace lua
{
LogParams::LogParams()
: LogParams("", 0, "")
{}
LogParams::LogParams(std::string file, int line, std::string text)
: file_(std::move(file)),
line_(line),
text_(s... |
ff05956f865a3e30b4075cf7da2f3942fbded08f | ac343a25ef4aae9a844a4bab2e615514269d05f5 | NupurChandrapal/CodeMarshal | /Desktop/CodeMarshal/easy.cpp | C++ | cpp | 1,854 | no_license | #include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <list>
#include <stack>
#include <utility>
#include <set>
#include <ctime>
#include <string>
#include <map>
#include <vector>
#include <queue>
#include <cctype>
#define LongInt lo... |
bc12a7a1565d20f98b23329fcdf22e8ef3f4ceaa | 90cf9682a8e98129e19855e994374ed6eaccdfa7 | grimaudjm/android-system-nfc | /src/fuzzers/nci/hal.cc | C++ | cc | 4,219 | permissive | #include "fuzz.h"
void hal_inject_event(uint8_t hal_evt, tHAL_NFC_STATUS status) {
tNFC_HAL_EVT_MSG msg = {};
msg.hdr.len = 0;
msg.hdr.event = BT_EVT_TO_NFC_MSGS;
msg.hdr.offset = 0;
msg.hdr.layer_specific = 0;
msg.hal_evt = hal_evt;
msg.status = status;
FUZZLOG("Injecting event to NFC co... |
2d6d6008fe33ec1cae2e64c831ebea59a2abf053 | 3d9b1b157649b5c2f1f30203be5ebaae3da64fb7 | wisest30/AlgoStudy | /source/CodeJam/2022_1_Round_A/2_Equal_Sum/hyo.cpp | C++ | cpp | 2,046 | no_license | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(int TestCase) {
int n;
cin >> n;
if(n == -1) {
exit(0);
}
assert(n == 100);
vector<ll> A;
for(auto i = 0; i < 30; ++i)
A.push_back(1ll << i);
A.push_back(7);
for(auto i = 1; i < 30; ++... |
64a7c9f294d33bcfdbd655ad5bf7f122cec41f99 | 06ae82621efdc42180c2232501a65d20c048ae1b | Payalkumari25/DSA | /Recursion/remove_X_From_String.cpp | C++ | cpp | 626 | no_license | #include<iostream>
using namespace std;
void removeX(char c[]){
//base case
if(c[0] =='\0'){
return;
}
if(c[0] != 'x'){
removeX(c+1);
}else{
int i=1;
for(;c[i]!='\0';i++){
c[i-1] = c[i];
}
c[i-1] = c[i];
removeX(c);
}
}
int ... |
147830a241d32a4821af6c4b998329f09bb83fde | ea0081d3a5864b51c8aa7e621aa84d5a973d9cbd | LegendaryZone/WindowsLeagueAutoplay | /C++ League Detection Source/Detection/Allies/AllyChampionManager.cpp | C++ | cpp | 3,220 | no_license | //
// AllyChampionManager.m
// Fluffy Pug
//
// Created by Matthew French on 5/27/15.
// Copyright (c) 2015 Matthew French. All rights reserved.
//
#include "AllyChampionManager.h"
ImageData AllyChampionManager::topLeftImageData;// = loadImage("Resources/Ally Champion Health Bar/Top Left Corner.png");
ImageData ... |
7821c974ec34dd56f7a840d83ee422933bc7ba2f | 5b71166beb5b1dad785efeb102dc02deebdcf863 | niuxu18/logTracker-old | /second/download/squid/gumtree/squid_repos_function_5667_squid-3.1.23.cpp | C++ | cpp | 3,634 | no_license | void
SquidMD5Transform(uint32_t buf[4], uint32_t const in[16])
{
register uint32_t a, b, c, d;
a = buf[0];
b = buf[1];
c = buf[2];
d = buf[3];
MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17... |
9bce3452cd40a3e43ae7a377d9024645a5586c1b | 0c12c520a0377b99271bef85acc5cc88fc4e6883 | cpsa3/backup | /OJ/HDU_CODE/2085.cpp | C++ | cpp | 857 | no_license | ////////////////////System Comment////////////////////
////Welcome to Hangzhou Dianzi University Online Judge
////http://acm.hdu.edu.cn
//////////////////////////////////////////////////////
////Username: 096040179JY
////Nickname: ___¼òÑÔ
////Run ID:
////Submit time: 2010-09-26 22:15:45
////Compiler: Visual C++
//////... |
ba2e4232d713be0293f64b003c16af8092c5dbbd | 0c10b24a4b4abc08b13dcbf31e2a1e471fd21e16 | deweerdt/browser-android-tabs | /ui/message_center/views/custom_notification_view_unittest.cc | C++ | cc | 14,138 | permissive | // Copyright 2016 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 <memory>
#include "base/macros.h"
#include "base/memory/ptr_util.h"
#include "base/memory/ref_counted.h"
#include "base/strings/utf_string_conve... |
bf2b090f9e1161638b004eb1c1070ce7d0bf64e4 | 02b9aa07afe2e85d58e9021d88d188b348906167 | mikibinxue/snowballs | /snowballs/src/Snowball.cpp | C++ | cpp | 724 | no_license | //
// Snowball.cpp
// OOP-tester
//
// Created by Miki Bin on 2/22/18.
//
#include "Snowball.h"
Snowball::Snowball(){
}
void Snowball:: setup(){
position.set(ofRandom(ofGetWidth()),ofRandom(ofGetHeight()));
dim = ofRandom(18,25);
color.set(255); // one way of defining digital... |
67561674dfb656378df44c254f7e4920d5d41dc9 | 14753ff9a288142816bae87f8b5bbb032bcfa522 | AyushPathak12/Hacktoberfest-Codedump | /Searching_Methods/JumpSearch.cpp | C++ | cpp | 1,079 | permissive | #include <iostream>
#include <cmath>
using namespace std;
int jump_Search(int a[], int n, int item)
{
int i = 0;
int m = sqrt(n); //initializing block size= √(n)
while (a[m] <= item && m < n)
{
// the control will continue to jump the blocks
i = m; // shift the block
m += sqrt(... |
561f09d2331d5a2f24260b6940e07eb51f250bcb | f495ed0b4eb7e8047f680335384524f8bd707132 | welschmorgan/cppserve | /inc/response.hpp | C++ | hpp | 1,926 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* response.h :+: :+: :+: ... |
b6d2ffe1e1468046535464a645de1d4d37fa9e62 | a2a5511cf307cb0732614fba68fbf7c239202175 | Hakhyun-Kim/projectanarchy | /Source/Vision/Runtime/Engine/SceneElements/VisApiStaticGeometryInstance.hpp | C++ | hpp | 18,627 | no_license | /*
*
* Confidential Information of Telekinesys Research Limited (t/a Havok). Not for disclosure or distribution without Havok's
* prior written consent. This software contains code, techniques and know-how which is confidential and proprietary to Havok.
* Product and Trade Secret source code contains trade secrets ... |
edddefe380328001d0561106980ec944b0b15534 | a76264d003be2c2de294ebdd811c9c25d7707f7a | xintrea/mytetra_dev | /app/src/libraries/wyedit/EditorShowTextDispatcher.cpp | C++ | cpp | 17,449 | no_license | #include "EditorShowTextDispatcher.h"
#include "EditorShowText.h"
#include "main.h"
#include "views/mainWindow/MainWindow.h"
#include "views/record/MetaEditor.h"
#include "views/tree/KnowTreeView.h"
#include "models/tree/KnowTreeModel.h"
#include "models/recordTable/Record.h"
#include "libraries/helpers/ObjectHelper.h"... |
d0ce75fb7b52d0cd7ff68520a93711f010a17c43 | 35760d597c104fee4df03f984b99cb792c0859a6 | antoni-heredia/FP | /Sesion2/I_Interes.cpp | C++ | cpp | 1,099 | no_license | /***************************************************************************/
// FUNDAMENTOS DE PROGRAMACIÓN
//
// CURSO 2016-2017
// (C) Antonio Jesus Heredia Castillo
//
//
/* Programa para realizar la ley de Ohm
Implementa la siguiente formula
Entradas: intensidad (A), resistencia (ohmios)
Salidas: volta... |
a165581cdb1162f86b9bdb2591d71e52611bccf0 | 43578eaae64b6084f8ef63bc43419038f0a1c022 | ViktorJordanov/tudat | /Tudat/Astrodynamics/Relativity/relativisticAccelerationCorrection.cpp | C++ | cpp | 6,037 | permissive | <<<<<<< HEAD
/* Copyright (c) 2010-2018, Delft University of Technology
=======
/* Copyright (c) 2010-2019, Delft University of Technology
>>>>>>> origin/master
* All rigths reserved
*
* This file is part of the Tudat. Redistribution and use in source and
* binary forms, with or without modif... |
dc90f347af18df6f00d57a6232d5645c3d13d4c6 | 186827050a62716e2c32dccc9cb499f6f877d24d | velazqua/competitive-programming | /online-judges/SPOJ/oldStuff_cpp/MFLAR10.cpp | C++ | cpp | 1,144 | no_license | #include <iostream>
#include <string>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <list>
using namespace std;
int main ()
{
string sentence;
while (1)
{
cin >> sentence;
if (sentence == "*")
break;
transform(sentence.begin(),sentence.end(),... |
d067421aecabd1a11d3b5001787599b6804a1be3 | 7bb3f976992c9436bdc419ef3d957710f089c1e3 | 130000002947823457136193789891/StudentDormManagementSystem | /学生宿舍/Operation.cpp | C++ | cpp | 3,802 | no_license | // Operation.cpp : 实现文件
//
#include "stdafx.h"
#include "学生宿舍.h"
#include "Operation.h"
#include "afxdialogex.h"
#include "student.h"
#include "AddDlg.h"
#include "trueChange.h"
#include "account.h"
// Operation 对话框
IMPLEMENT_DYNAMIC(Operation, CDialogEx)
Operation::Operation(CWnd* pParent /*=NULL*/)
: CDialogEx(O... |
c02eb87c54dcb9f166c7f970e6b4e8a1f933633e | 6044a6bce270bc818da80fbd066f8cd7edda01f0 | gkornakov/AliPhysics | /PWGUD/UPC/AliAnalysisTaskUPCforwardMC.cxx | C++ | cxx | 67,756 | permissive | /**************************************************************************
* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors ... |
fed7e736047ed6e0d6b4baf6abafcd7f248e4a13 | 4113a276035e72d6d3d48c4f592eb63004c58c00 | lar-deeufba/Daniel-UR5 | /init/init_skill_server/src/ur5.cpp | C++ | cpp | 17,546 | no_license | #include "ur5.hpp"
UR5::UR5(ros::NodeHandle n_,int number_of_movements){
n=n_;
arm=n.advertise<control_msgs::FollowJointTrajectoryActionGoal>("/follow_joint_trajectory/goal", 1);
msg.header.stamp = ros::Time::now();
msg.goal.trajectory.joint_names.push_back("ur_arm_shoulder_pan_joint");
msg.goal.t... |
4573b4f16a214f030ac8a0fadab3da98a6a9971f | be95be3a7f170c1506c0c7dc5aca7098a37ad36c | hli1221/styletransfer | /include/caffe/layers/activation/repmat_layer.hpp | C++ | hpp | 903 | permissive |
#ifndef CAFFE_Repmat_LAYER_HPP_
#define CAFFE_Repmat_LAYER_HPP_
#include <vector>
#include "caffe/blob.hpp"
#include "caffe/layer.hpp"
#include "caffe/proto/caffe.pb.h"
namespace caffe {
class RepmatLayer : public Layer {
public:
explicit RepmatLayer(const LayerParameter& param): Layer(param) {}
virtual... |
730fa7320b08be34ce2210b7504373f7e6abb4d9 | 02698d640102191492ce33659a7ba9e34cb3d394 | weiliangc/chromium | /content/common/input/synthetic_web_input_event_builders.cc | C++ | cc | 8,452 | permissive | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/common/input/synthetic_web_input_event_builders.h"
#include "base/logging.h"
#include "content/common/input/web_touch_event_traits.h"
#... |
9d17007b03ea374eccf7a1222bd1ac1400cd1828 | 4e6ef85d24135f00be3c7053e94c073f80c595d6 | sifat120/10F-Robot-Code-19-20 | /Code/PROS/Learning/src/subsystemFiles/odomDebug.cpp | C++ | cpp | 9,957 | no_license | #include "lift.cpp"
#include "odomDebug.hpp"
/**
* @param ix QLength
* @param iy QLength
* @param itheta QAngle
*/
odomDebug::state_t::state_t(okapi::QLength ix, okapi::QLength iy, okapi::QAngle itheta) : x(ix), y(iy), theta(itheta) {}
/**
* @param ix inches
* @param iy inches
* @param itheta radians
*/
o... |
483a0115851f321bb75b2c0ef985af1f30b0afa9 | 923593d10a7cad7c90c8feb47428817d448f07ea | myrao/adt-tools-base | /profiler/native/utils/native_backtrace.cc | C++ | cc | 2,632 | no_license | /*
* Copyright (C) 2017 The Android Open Source Project
*
* 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 app... |
91f638b5da4d998e051a7bc496d4a6f16379d0e4 | 0e7f2ffe4942ac60d9b37f2437cdc0d1ac8241f3 | joonr7/SFND_Lidar_Obstacle_Detection | /src/processPointClouds.cpp | C++ | cpp | 10,740 | no_license | // PCL lib Functions for processing point clouds
#include "processPointClouds.h"
//constructor:
template<typename PointT>
ProcessPointClouds<PointT>::ProcessPointClouds() {}
//de-constructor:
template<typename PointT>
ProcessPointClouds<PointT>::~ProcessPointClouds() {}
template<typename PointT>
void ProcessPoi... |
d55826e98933d6920932806eaacf05c5fe5727f8 | 63354d58a08ac799e3ccc00762590f6a9e693f1c | MatthewH-code/projects | /Arma3/DAG.Jackson_County/dialog/statusBar.hpp | C++ | hpp | 784 | no_license | #define ST_RIGHT 0x01
class osefStatusBar {
idd = -1;
onLoad = "uiNamespace setVariable ['osefStatusBar', _this select 0]";
onUnload = "uiNamespace setVariable ['osefStatusBar', objNull]";
onDestroy = "uiNamespace setVariable ['osefStatusBar', objNull]";
fadein = 0;
fadeout = 0;
duration = 1... |
7e5a24e83d853b8a6cdd41c18f5e4429e24bdfaa | 946c0d62754cb4f7ebc0534dd96e9fe49b7d5669 | DKU-STUDY/jongmanbook-study | /소스 코드/8. 동적 계획법/9. 비대칭 타일링.cpp | C++ | cpp | 567 | no_license | #include <iostream>
#include <cstring>
#define MOD 1000000007
using namespace std;
long long cache[101];
long long tile(int n) {
if (n <= 1)
return 1;
long long& res = cache[n];
if (res != -1)
return res;
return res = (tile(n - 1) % MOD + tile(n - 2) % MOD) % MOD;
}
int main() {
int C;
cin >> C;
int n;
... |
e971cbcce3e1bd4c56f6c3df85c741148e7ef41b | a97aedd1f65d655242bb04e60d0bbcb054674b6d | crackfoo/vpc | /src/test/test_bitcoin.cpp | C++ | cpp | 1,759 | permissive | #define BOOST_TEST_MODULE Voltpotcoin Test Suite
#include <boost/test/unit_test.hpp>
#include <boost/filesystem.hpp>
#include "db.h"
#include "txdb.h"
#include "main.h"
#include "wallet.h"
#include "util.h"
CWallet* pwalletMain;
CClientUIInterface uiInterface;
extern bool fPrintToConsole;
extern void noui_connect();... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.