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 |
|---|---|---|---|---|---|---|---|---|
e137efb1165e3d3dfee1533420b148ed95e02074 | cb1e336a23403e81e2bd187245401c1ff0d1ff45 | wumch/stage | /sys.hpp | C++ | hpp | 1,128 | no_license |
#pragma once
#include "meta.hpp"
#ifdef __linux
# include <sys/resource.h>
# include <unistd.h>
# include <asm/unistd.h>
# include <sys/mman.h>
# include <sched.h>
#else
typedef int64_t rlim_t;
# error "system other than linux is currently not supported."
#endif
namespace stage {
static inline std::size_t getCpuN... |
86aa86fde020eb32f6185472badbc79302666892 | ba381c2046fad3509607cd3f902e8a94c52bffd8 | YKitty/ResourceShareServer | /server/requset.hpp | C++ | hpp | 5,975 | no_license | #include "utils.hpp"
//http数据的接收接口
//http数据的解析接口
//对外提供能够获取处理结构的接口
class HttpRequest
{
private:
int _cli_sock;
std::string _http_header;
RequestInfo _req_info;
public:
HttpRequest(int sock)
: _cli_sock(sock)
{}
//接收http请求头
bool RecvHttpHeader(RequestInfo& info)
{
//定义一个设置http头部最大值
char t... |
595151454d567c642d1a3cc50f21ab9f7c85eef5 | 6307664569cd05246b9b6a98a7ef12ff267ddf11 | toolbits/GPDSP | /lib/GPDSP/synthesis/GPDSPSawtoothWaveNode.cpp | C++ | cpp | 4,214 | permissive | /*
** General Purpose DSP Library
**
** Original Copyright (C) 2017 - 2018 HORIGUCHI Junshi.
** http://iridium.jp/
** zap00365@nifty.com
** Portions Copyright (C) <year> <author>
** ... |
c550c19a581e341f40717e13e77f5877019f9789 | cafae32ce4059dcb596fd220f7d8ebbab9b48967 | 2bite/ARK-SDK | /SDK/ARKSurvivalEvolved_Buff_WarmWater_functions.cpp | C++ | cpp | 1,388 | permissive | // ARKSurvivalEvolved (332.8) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_Buff_WarmWater_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//-------------------------------------------------------------------... |
a211bd2a52faeaf15fd8745187dfb39e59504afd | 754669aaa2a350c56d8813fb73d4a89563ec91e0 | EdMroz/bam-readcount | /src/exe/bam-readcount/bamreadcount.cpp | C++ | cpp | 25,541 | no_license | #ifndef _GNU_SOURCE
# define _GNU_SOURCE
#endif
#include "bamrc/auxfields.hpp"
#include "bamrc/ReadWarnings.hpp"
#include <boost/program_options.hpp>
#include "bamrc/BasicStat.hpp"
#include <stdio.h>
#include <memory>
#include <string.h>
#include "sam.h"
#include "faidx.h"
#include "khash.h"
#include "sam_header.h"
#... |
dc0777a5b40e15b899a751d6a2b88bfc28743a90 | 5ba339295236adafe1c967c3b503501e9be9dd51 | datoufeng/Linux-Network-Programming | /04多路io复用-poll-epoll-epoll反应堆/09epoll反应堆扩展/wrap.cpp | C++ | cpp | 2,631 | no_license | #include <iostream>
#include <string.h>
#include <unistd.h>
#include "wrap.h"
using namespace std;
void perr_exit(const char * s)
{
perror(s);
exit(1);
}
int Accept(int fd, sockaddr * sa, socklen_t * salenptr)
{
int connFd;
again:
if (0 > (connFd = accept(fd, sa, salenptr)))
{
//如果accept被信号打断时错误码为EINTR
//或... |
6bba0815424c9d4a3e9b5657e9c943abf4f61c43 | 703bd8ebeacb2c058c0267a7e96bfd4c7fa468e8 | ASIKOO/Metin-Refresh-Client-Src | /client/UserInterface/InstanceBaseMovement.cpp | C++ | cpp | 7,920 | no_license | #include "StdAfx.h"
#include "InstanceBase.h"
#include "PythonBackground.h"
#include "../eterLib/GrpMath.h"
void CInstanceBase::SetAttackSpeed(UINT uAtkSpd)
{
if (uAtkSpd > 1100)
uAtkSpd = 0;
m_GraphicThingInstance.SetAttackSpeed(uAtkSpd/100.0f);
m_kHorse.SetAttackSpeed(uAtkSpd);
}
void CInstanceBase::SetMoveS... |
0d854a97d4d1c337c084a5d449f703d5dc907401 | 0d4fa40350b4f0e51e792f96bc096e6cdd0ecb84 | 3bhady/Logic-Simulator | /Components/LED.cpp | C++ | cpp | 3,521 | no_license | #include "LED.h"
#include"Connection.h"
LED::LED(const GraphicsInfo &r_GfxInfo)//, pair<int, int> x)
{
Type = LED_;
// generate random number between 0 and 5
// choosing a LED color
stringstream sstream;
srand(time(NULL));
int randNum = rand() % 6;
sstream << randNum;
sstream >> colour;
State = LOW;
m_Inp... |
258026538f00cff4703f11eef6f884b91030743d | a5426d9e0738204f97563af80bf6d78108ac419f | H0uston/bmstu | /sem4/ООП/lab_4/manager/camera_manager.cpp | C++ | cpp | 678 | no_license | #include "camera_manager.h"
namespace transformations {
void CameraManager::vertical(std::shared_ptr<Camera> camera, double angle) {
double cur_angle = camera->getZAngle();
camera->setZAngle(angle / 180. * 3.1415926535 + cur_angle);
}
void CameraManager::longitudional(std::shared_ptr<objects::Camera> camera,... |
e4fb1f17aa8c316fe74359650236a2f6aeb1d493 | c27c338601ee1f87fc430d3b7128f373bbfaa89a | zhili93/voom | /src/Solvers/Test/Rosenbrock.cpp | C++ | cpp | 3,688 | permissive | //--------------------------------------------------------------------
//
// William Klug
// University of California Los Angeles
// (C) 2004 - All Rights Reserved
//
//--------------------------------------------------------------------
//
// Rosenbrock.cpp: Me... |
99f616ecac0487eebf63518915f29d3f4b3c1294 | ef4e0199b035c0a5f6e2db965b7e504857d93d0d | truecarfield/tud_firefly_landing_sim | /tud_firefly_gazebo_plugins/src/gazebo_motor_model_mod.cpp | C++ | cpp | 8,882 | no_license | /*
* Copyright 2015 Fadri Furrer, ASL, ETH Zurich, Switzerland
* Copyright 2015 Michael Burri, ASL, ETH Zurich, Switzerland
* Copyright 2015 Mina Kamel, ASL, ETH Zurich, Switzerland
* Copyright 2015 Janosch Nikolic, ASL, ETH Zurich, Switzerland
* Copyright 2015 Markus Achtelik, ASL, ETH Zurich, Switzerland
*
* L... |
7f5fa746803dc1f2c74a2ea77c93e882ea3cf14d | cf5b60c1ae354b7f0fef7b0f771ea938f53b546c | csce622/a4 | /p2.cpp | C++ | cpp | 1,780 | no_license | /**
*
* @file p2.cpp
*
* @brief CSCE-622: Generic Programming -- Assignment 4
*
* @author Damien L-G <lebrungd@neo.tamu.edu>
* @date November 16, 2010
*/
#include <iostream>
#include <cassert>
#include <complex>
#include <boost/mpl/assert.hpp>
#include <boost/mpl/comparison.hpp>
#include <boost/mpl/vector.hpp>... |
a0426c43dc7e2f00d67e6f83430c048b5301ebe0 | cbfbb2d075b8cc512b6e6d14a96c2adb57bfe6ca | ParkHyeonJae/SaveTheEarth | /SaveTheEarth/Cimage.cpp | C++ | cpp | 3,173 | no_license | #include "framework.h"
BOOL Cimage::AddImage(string key, CSprite* sprite)
{
auto iter = m_images.find(key);
if (iter == m_images.end()) //맵에 해당 키가 없을 때
{
m_images.insert(make_pair(key, sprite));
return TRUE;
}
return FALSE;
}
BOOL Cimage::FindImage(string key)
{
auto iter = m_images.find(key);
if (it... |
22cbb061a44f4889604d403a536e4afb78c94eb4 | 49f0a3767f1372fd6e60ebf14d6b62ca014c9b84 | chromium/chromium | /ui/wm/core/shadow_types.cc | C++ | cc | 1,090 | permissive | // Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/wm/core/shadow_types.h"
#include "ui/base/class_property.h"
namespace wm {
DEFINE_UI_CLASS_PROPERTY_KEY(int, kShadowElevationKey, kShadowElevationDefault)
void... |
00be2a6bcab3dd9fa2b11ad15e9d81395d3a70d8 | 1892c923e1fab6d9afa67364218ccde2182d2442 | shanche/Notes | /Quant/A组（组长：杨鹏飞）/Quiz 1/temp/try_on_quiz1/avePricesLessP.cpp | C++ | cpp | 888 | no_license | #include <iostream>
#include <vector>
#include <queue>
#include <ctime>
using namespace std;
bool avePricesLessP(const vector<float>& prices, int M, float P)
{
priority_queue<float> minM;
for (int i = 0; i < M; i++)
{
minM.push(prices[i]);
}
for (int i = M; i < prices.size()-1; i++)
{
if (prices[i] < minM.... |
a68b9676a55a04d6ca8ba42901015302b93fc247 | 3ff75ce8a3c4130434733e65b89df2ac1c7d356e | xhyangxianjun/Builder6-program | /LUS/HVI_250P/PreBuff.cpp | C++ | cpp | 24,713 | no_license | //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
//---------------------------------------------------------------------------
#include "PreBuff.h"
#include "SLogUnit.h"
#include "SMInterfaceUnit.h"
#include "UtilDefine.h"
#include "PstnMan.h"
#include "Op... |
7f670a9b61cfaf91c5854f19992cb3ddc676b343 | a0bb5de8779cdb7852fef01ac6cb209cb30a949e | SohagMollik/UVA | /Solution/10311 Goldbach and Euler.cpp | C++ | cpp | 1,146 | no_license | #include<bits/stdc++.h>
using namespace std;
#define N 100000005
int prime[N];
vector<int>v;
void sieve(int n)
{
for(int i=0;i<n;i++){
prime[i]=1;
}
for(int i=4;i<=n;i+=2){
prime[i]=0;
}
prime[0]=0;
prime[1]=0;
for(int i=3;i*i<=n;i+=2){
if(prime[i]==... |
828847eb9bb7bda77e19713140f44c9285f46b77 | c0c54c00dda5ef1a7a5a9934390151f51accea2b | DevxMike/hackerrank | /sock_merchant.cpp | C++ | cpp | 516 | no_license | #include <map>
#include <vector>
//https://www.hackerrank.com/challenges/sock-merchant/problem
using m = std::map<int, int>;
int sockMerchant(int n, std::vector<int> ar) {
m socks;
m::iterator iter;
int quantity = 0;
for (auto sock : ar) {
iter = socks.find(sock);
if (iter == socks.end(... |
fcf7112272b5de244e47740eb56f32d20077208f | 1035a80f8f1bd4c9729a3ba104c2dbec3e18b7aa | skyellen/robwork-mirror | /RobWorkSim/src/rwsimlibs/bullet/BtTactileSensor.cpp | C++ | cpp | 6,746 | permissive | /********************************************************************************
* Copyright 2015 The Robotics Group, The Maersk Mc-Kinney Moller Institute,
* Faculty of Engineering, University of Southern Denmark
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file exce... |
0d9508a0957b0e1878e856cee34b7c86b8d4a01d | 997d594af39acd2a626090d66217dc3eda2a0f32 | GMNGeoffrey/iree | /compiler/src/iree/compiler/Codegen/SPIRV/SPIRVAnnotateWinogradLoops.cpp | C++ | cpp | 1,449 | permissive | // Copyright 2022 The IREE Authors
//
// Licensed 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
#include "iree/compiler/Codegen/PassDetail.h"
#include "iree/compiler/Codegen/SPIRV/Utils.h"
#inc... |
59701432eddc35fe0382142fac0cc3988106dc88 | 9c78b5689fc7808872af49843f872455c6456a09 | mosspassion/ofNoiseFace | /example-calibrated/src/ofApp.cpp | C++ | cpp | 7,908 | no_license | #include "ofApp.h"
#include "ofMeshUtils.h"
#include "ofxPS3EyeGrabber.h"
using namespace ofxCv;
using namespace cv;
void ofApp::setup() {
ofSetVerticalSync(true);
// ps3EyeCamera
cout << "elapsed time: " << ofGetElapsedTimeMillis() << endl;
ps3cam.setGrabber(std::make_shared<ofxPS3EyeGrabber>());
... |
97511d3516435b4b2ac86dc1a57c69df84bfdd72 | 9a52ca3c788392200a25c967907e6c0dfe9c0085 | alohamora/iroha | /irohad/ametsuchi/wsv_query.hpp | C++ | hpp | 1,625 | permissive | /**
* Copyright Soramitsu Co., Ltd. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0
*/
#ifndef IROHA_WSV_QUERY_HPP
#define IROHA_WSV_QUERY_HPP
#include <optional>
#include <vector>
#include "common/result.hpp"
#include "interfaces/common_objects/peer.hpp"
#include "interfaces/common_objects/string_view... |
d61ac8362586c5cd2c0196cf1840c621d6059000 | 863ac7b1b4e9cd706ca77e6dcb0fe4b49dc9f9d7 | CurrentH/gorobots_edu | /utils/rbf-framework/c++_library/rbf_network.cpp | C++ | cpp | 10,565 | no_license | ///Author: Bassel Zeidan
#include <iostream>
#include "rbf_network.h"
#include <math.h>
namespace RBFnetwork {
////////////////////////////////////////////////////////////////////////////////
// InputConfigs class //
//////////////////////////////////... |
c75e8d0f0c643bb2f1451ebfb4dca38ea89a6503 | b1b863ae64e4d83cf6d6079fa6dc2b7944a2dcf9 | jmorton06/Lumos | /Lumos/Source/Lumos/Graphics/Animation/Animation.cpp | C++ | cpp | 882 | permissive | #include "Precompiled.h"
#include "Animation.h"
#include <ozz/animation/offline/skeleton_builder.h>
#include <ozz/animation/offline/animation_builder.h>
#include <ozz/animation/runtime/animation.h>
#include <ozz/animation/runtime/local_to_model_job.h>
#include <ozz/animation/runtime/sampling_job.h>
#include <ozz/base... |
f1095c55c6be948602df46bbb40992b9b7e730ee | 89f128e1e588f7c1bf33f0f557af056f7484ba32 | kuk941025/BaekJoon | /BFS/BJ_4963.cpp | C++ | cpp | 1,145 | no_license | #include <iostream>
#include <queue>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
int arr[60][60] = { 0 }, visited[60][60] = { 0 };
int dir[8][2] = { {-1, -1}, {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1} };
int main() {
while (1) {
queue<pair<int, int>> q;
int cn... |
f71e0f6e5e978f088570f676eda892c4829e65dc | 16d51481deb517ad57e182ef867e2e6f99294b3d | arthurteisseire-epitech/CPP_rtype_2019 | /client/src/GameSprite.hpp | C++ | hpp | 2,020 | no_license | /*
** EPITECH PROJECT, 2019
** rtype
** File description:
** Created by Arthamios
*/
#ifndef RTYPE_GAMESPRITE_HPP
#define RTYPE_GAMESPRITE_HPP
#include <SFML/Graphics/Sprite.hpp>
#include <SFML/Graphics/Texture.hpp>
#include <SFML/Graphics/Image.hpp>
#include <functional>
namespace game
{
class GameSprite {
... |
ba480d5d7e82eb633299ddf09b9126b3a87124c1 | ed4160ee1f1d75db7de66f4cdc1330929e95046a | perryiv/cadkit | /Minerva/Core/Commands/AddLayer.cpp | C++ | cpp | 3,124 | no_license |
///////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2007, Arizona State University
// All rights reserved.
// BSD License: http://www.opensource.org/licenses/bsd-license.html
// Author: Adam Kubach
//
//////////////////////////////////////////////////////////////////... |
d6ad286d6311bee7d61d1ff8b50c0f96f5115383 | 2f901e91c7488d9e2482410d8d06dbf301b49650 | Ajinkyadata/G4G | /rem_dupl.cpp | C++ | cpp | 2,115 | no_license | /* Given a singly linked list consisting of N nodes. The task is to remove duplicates (nodes with duplicate values) from the given list (if exists).
Note: Try not to use extra space. Expected time complexity is O(N). The nodes are arranged in a sorted way.
Input:
First line of input contains number of testcases T. Fo... |
84b8ba2a05102c651781286706c66da1839092d1 | 52e69dc24a11ecb095032f47b1e2b690d97c89f8 | robcog-iai/UROSWorldControl | /Source/UCheckpointSystem/Private/UCheckpointComponent.cpp | C++ | cpp | 2,626 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "UCheckpointComponent.h"
// Sets default values for this component's properties
UCheckpointComponent::UCheckpointComponent()
{
// Set this component to be initialized when the game starts, and to be ticked every frame.... |
caca2afc92a414ed63c9756d499ffd041183cd08 | 099250190b6c6f479525ac2e70fa7a4773712c23 | odiubankov/cppChallenges | /ostd/tests/DistanceTest.cpp | C++ | cpp | 330 | no_license | #include "../Distance.h"
#include <gtest/gtest.h>
#include <list>
namespace ostd
{
TEST(Distance, test)
{
std::vector<int> v{1, 2, 3};
ASSERT_EQ(ostd::Distance(std::begin(v), std::end(v)), v.size());
std::list<int> l{1, 2};
ASSERT_EQ(ostd::Distance(std::begin(l), std::end(l)), l.size());
}
}//name... |
e02f4f38734d9db21a2b9a67d0481f4fc02ea67e | c2bf8ce42c1addd10182dcd1a839f77b8009ad98 | hjagana/ProjectECEOOP | /hjagana/src/XMLHandler.hpp | C++ | hpp | 1,904 | no_license | #ifndef XMLHANDLER_H_
#define XMLHANDLER_H_
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <xercesc/sax2/SAX2XMLReader.hpp>
#include <xercesc/sax2/XMLReaderFactory.hpp>
#include <xercesc/sax2/DefaultHandler.hpp>
#include <xercesc/util/XMLString.hpp>
#include <xercesc/sax2/Attribu... |
d4264d204edca13343756ed9321bda3593a7d10b | e4d11c0484d590fe71665fa6b99a175b1e90ce0d | Laura-Wa1sh/ProgrammingLecture2 | /Lecture2.2/reverse_array.hpp | C++ | hpp | 279 | no_license | //
// reverse_array.hpp
// Lecture2.2
//
// Created by Laura Walsh on 12/11/2018.
// Copyright © 2018 Laura Walsh. All rights reserved.
//
#ifndef reverse_array_hpp
#define reverse_array_hpp
void reverse_array(int data[], int data_length);
#endif /* reverse_array_hpp */
|
afda436f601ce9b4ec1ecfdbc4b4f48d327ef0f7 | 512fda833c5ea2b2ff6f0863e09e5df627d36785 | costa-bo/My_home | /tests/learncpp/2_10_ex4/2_10_ex4.cpp | C++ | cpp | 774 | no_license | #include <iostream>
#include "constants.h"
void curent_height(double height, int seconds)
{
double dist_fallen = (myConstants::gravity * seconds * seconds)/2;
height = height - dist_fallen;
if (height <= 0)
std::cout << "At " << seconds << " seconds, the ball is on the ground"
... |
946d5e01740907c23364acffb2aa4d0fa223996c | eb9fd0343cfaaf2d47364463fe1abd5ab232ab7b | PANGMeng/uwaterloo-cs246 | /1149/a4/q3/cell.cc | C++ | cc | 1,753 | no_license | #include "cell.h"
void Cell::notifyDisplay() {
td->notify(r, c, '0'+state);
}
Cell::Cell() {// Default constructor
// give default values to all variables to prevent terrible errors
numNeighbours = 0;
state = 0;
prevState = 0;
r = 0;
c = 0;
}
int Cell::getState() { //getter for private state
return state;
}
... |
a2bd928ffbc4b2c2c151ce71286bd17d02190efc | 47380e190a1f0abe0d02b299662c94038e473c7a | gusah009/Algorithm | /2020-1/chapter.9/PrimeNumber.cpp | C++ | cpp | 872 | no_license | #include <iostream>
#define INF 987654321;
using namespace std;
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int M, N;
int number;
int min;
int sum = 0;
bool isPrime[10001];
isPrime[1] = false;
isPrime[2] = true;
for(int i = 2; i < 10001; i++) {
... |
c212deb77daaaa786951e280baa123c9d4a14d70 | 1f63e151fda7a913767aba5a14773fe1b0807942 | bmagyar/ros2_control | /test_robot_hardware/include/test_robot_hardware/test_robot_hardware.hpp | C++ | hpp | 2,657 | permissive | // Copyright 2017 Open Source Robotics Foundation, Inc.
//
// 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 appli... |
4a0daaf0dcad7625a31ce3250791e0bfc7fdb58a | 55950b64212ffbc15b2f0c7e0ac4b14df32b7791 | shenjunHZ/TTS_Demo | /src/applications/ClientReceiver.cpp | C++ | cpp | 1,516 | no_license | //
// Created by junshen on 10/1/18.
//
#include "ClientReceiver.hpp"
#include "socket/SocketSysCall.hpp"
#include "logger/Logger.hpp"
namespace applications
{
ClientReceiver::ClientReceiver(Logger& logger, const configuration::AppConfiguration& config,
const configuration::AppAd... |
353ed4be6d4ee9a80184b4306037a67c9e4ed195 | 360339b29a03b9c21ac9d03a9cd13c45d6362a20 | PPL-IIITA/ppl-assignment-prankuragarwal | /Q4/input.cpp | C++ | cpp | 1,178 | no_license | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <limits.h>
#include <cstdlib>
#include <string.h>
using namespace std;
/*
----------------------------------
PRANKUR AGARWAL
LIT2015040
----------------------------------
*/
#define ll long long
#define S(x)... |
3ea0615836b4071bdda3ee537d77806584e57907 | bc5c9d9372d847c2d8cfae9748c9a6ae006c4384 | AjaniStewart/cv | /Ajani_Stewart_Assignment2/p2.cpp | C++ | cpp | 799 | permissive | /*
Author: Ajani Stewart
Date: February 16,2020
File: p2.cpp
Purpose: Driver program to label an image
*/
#include "image.h"
#include "vision_funcs.h"
#include <string>
#include <iostream>
int main(int argc, char** argv) {
std::string usage_string = "usage: p2 [input binary image] [output_label_image]\n";
... |
f89322ba7b5768abfa8e7d6ed23ce88b3b23893a | dfe6d00fc8c0bc3567c68c426bdde31e120ed4b4 | Shell-Wataru/AtCoder | /kakomon/arc052_c.cpp | C++ | cpp | 1,881 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <cmath>
#include <iomanip>
#include <functional>
#include <random>
#include <set>
using namespace std;
using ll = long long;
int solve()
{
ll N,M;
cin >> N >> M;... |
8d53469b45d63e9fad705423d80ffcb484f7df22 | b1ebe4a804a971043d19b588f07ffc54b1d1aa38 | agataszcz/tensorflow | /tensorflow/contrib/lite/experimental/kernels/ctc_beam_search_decoder.cc | C++ | cc | 9,491 | permissive | /* Copyright 2018 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... |
ee816267a4b7c1ccc647aa0b30e71383703800a7 | 2ab0730814e6228f3d56116aff0bd049ecbea2b8 | Ham1dul/C-labs-from-College | /HashTable/BSTree.cpp | C++ | cpp | 6,470 | no_license |
#include "BSTree.h"
template <typename DataType, class KeyType>
BSTree<DataType, KeyType>::BSTreeNode::BSTreeNode(const DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode *rightPtr) : dataItem(nodeDataItem), left(leftPtr), right(rightPtr)
{
}
template < typename DataType, class KeyType >
BSTree<DataTyp... |
839d4605258778a4d953578e0ab73495aea00eb3 | 674876f548d908ce955651d4462e12af6236941d | ttdyce/Dynamic-embedding-labeller | /selected-data/542.cpp | C++ | cpp | 1,180 | no_license | #include <iostream>
#include <stdio.h>
#include <math.h>
#include "../StateIntercept.cpp"
#include <string.h>
using namespace std;
// ????2.cpp : ??????????????
//
void out(int, Intercept<int>);
// Intercept<int> t(1, 2);
Intercept<int> intercepts[] = {Intercept<int>(0, 2), Intercept<int> (1, 2), Intercept<int> (0, ... |
f08006a01f58d79975d4d4c141183901e0e4114b | bd7556d8e86372dc42698cc2efc7b48c4790cd76 | Carter0/OldGameEngines | /projects/proj2-platformer-platformance/src/base/PlayerRenderComponent.cpp | C++ | cpp | 1,399 | no_license | #include "base/PlayerRenderComponent.hpp"
#include "base/GameObject.hpp"
#include "managers/ResourceManager.hpp"
#include <string>
#include <iostream>
//! \brief A component which renders a GameObject using the Player sprite.
PlayerRenderComponent::PlayerRenderComponent(GameObject & gameObject, const std::string& path... |
296f918a76cf517cd0376d85dec3837d78a9bff5 | e6a4f48ef49cffeb82177145c8a503455660249c | raujika418/GoodOldDays | /llvm/lib/VMCore/iSwitch.cpp | C++ | cpp | 1,818 | permissive | //===-- iSwitch.cpp - Implement the Switch instruction --------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===--------... |
11b3f495221decdd7ff3424780ed0a89875dc612 | 94b9c97e7a7010c92e424a21ed9c2a43a95ec093 | missgreenwood/masterarbeit | /src/Tests/BloomFilterList.hpp | C++ | hpp | 1,119 | no_license | // BloomFilterList.hpp, Judith Greif
// Description: Header for class BloomFilterList
#ifndef BloomFilterList_hpp
#define BloomFilterList_hpp
#include "BloomFilterListNode.hpp"
class BloomFilterList {
private:
BloomFilterListNode *head;
BloomFilterListNode *tail;
int size;
public:
BloomFilte... |
45e90d8f41e6c54a13aea7a72a899f1c684b3bad | 53ab69f797ad8ac7aed9539c2d1220d37c84d70e | ClickHouse/ClickHouse | /src/Processors/Formats/Impl/JSONCompactRowOutputFormat.cpp | C++ | cpp | 2,580 | permissive | #include <Processors/Formats/Impl/JSONCompactRowOutputFormat.h>
#include <Formats/FormatFactory.h>
#include <Formats/JSONUtils.h>
#include <IO/WriteHelpers.h>
namespace DB
{
JSONCompactRowOutputFormat::JSONCompactRowOutputFormat(
WriteBuffer & out_,
const Block & header,
const FormatSettings & settings_... |
83f00c82d0d9f363b42eccc15cd7abba48ff39ab | 13a96c4318381300341a6906ff96dfc73ba9a809 | SymbianSource/oss.FCL.sf.mw.uiresources | /uigraphics/AknIcon/SvgtFbsRasterizer/src/SvgtFbsRasterizer.cpp | C++ | cpp | 22,486 | no_license | /*
* Copyright (c) 2002 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/legal/epl-v10.h... |
a51c1b4dfc55709888c409a1319573d1488214d1 | aaff61c3bc300afe1986c29c47ee087b50667a37 | bengalm/fireroothacker | /Carberp Botnet/source - absource/pro/all source/BJWJ/source/Common/ScreenShots.cpp | C++ | cpp | 15,586 | no_license | //---------------------------------------------------------------------------
#include "ScreenShots.h"
#include "gdiplus.h"
#include "GetApi.h"
#include "Memory.h"
#include "Utils.h"
#include "BotUtils.h"
#include "Splice.h"
#include "Unhook.h"
//--------------------------------------------------------------------... |
6277cdb901e8113fdc9387c667bb5d284a28b9d5 | 3b89b167dbb913895643ec1fbfe875a6c6e4eb19 | aosproj/BuilderPattern | /BuilderPattern/BuilderPattern_Car.cpp | C++ | cpp | 3,487 | no_license | #include <iostream>
enum carType
{
CITYCAR,
CABRIOLET,
SPORTS
};
/* Product */
class Car {
private:
int16_t numseats;
carType carVersion;
bool tripComputer;
bool GPS;
bool AWD;
public:
Car():tripComputer(false),GPS(false),AWD(false){}
void setSeats(int16_t seatcnt) { numseats = seatcnt; }
void setCarVersi... |
e3f5665750cb2d0e77484762042ed2ad2ab7e412 | 6e46dd93a89135c9dae05d3d2a683dfd13a849ab | mahajanchirag/binary_trees_ques | /kth largest element of BST.cpp | C++ | cpp | 597 | no_license | class Solution
{
public:
void helper(Node *root,int k,int &count,int &res)
{
if(!root)
{
return;
}
helper(root->right,k,count,res);
count++;
if(count==k)
{
res=root->data;
return;
}
helper(root->left,... |
7818d4f0314952c7c14d3bba396d2788ee287f25 | 311f09f9b4bf10e4bc1fdda08ffc061750fca4e4 | DarisaLLC/ridge_strands | /xcode/strands/strands/main.cpp | C++ | cpp | 3,038 | permissive |
#include <fstream>
#include <iostream>
#include <iomanip> // setw
#include <cmath> // floor
#include <climits> // UINT_MAX
#include <boost/program_options.hpp>
#include <boost/filesystem.hpp> // includes all needed Boost.Filesystem declarations
#include "strands.h"
using namespace std;
using namespace boost;... |
26559fff0c8642d7f4078a225562a48d1a8d3fcc | 43a7598b7827a7a91c68e26aa94ba9cc73da5519 | 16131zzzzzzzz/Homework202001 | /5-18/ex1_2.cpp | C++ | cpp | 855 | no_license | #include<iostream>
#include<fstream>
#include<string>
using namespace std;
int main()
{
ifstream read("1.txt");
if(!read)
{
cerr<<"Files cannot be opened.";
exit(EXIT_FAILURE);
}
string IP, date, time;
int ip;
int A=0, B=0, C=0, D=0, E=0;
while(read>>IP>>date>>time)
{
for(int i=0;i<=2;i++)
{
if(IP[... |
753e736e9d70f3029138c3f0fced02457b09bd49 | e0b21c1dfe03522e699091fc8ebf9d53cd8a958b | kinpro/webrtc-standalone | /json.cpp | C++ | cpp | 3,210 | no_license | #include "api/yajl_gen.h"
#include "api/yajl_tree.h"
#include "json.h"
#include <sstream>
#define VALIDATE_STATE() if(!mState) { return false; }
struct JSONParser::State {
yajl_val mTree;
bool mValid;
std::string mError;
State() : mTree(NULL), mValid(true) {};
~State()
{
yajl_tree_free(mTree); mTree ... |
674f9f48151c24f51d4c37c750b979b0c44066db | 57be59a6142654de76033d76c610827d48a05f90 | jennyb2911/chromium | /cc/layers/surface_layer_unittest.cc | C++ | cc | 13,255 | permissive | // Copyright 2014 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 <stdint.h>
#include <iostream>
#include <set>
#include <vector>
#include "base/location.h"
#include "base/run_loop.h"
#include "base/single_thr... |
f665022d0759f03a46879ba125e0b97bb2222cf0 | c6b4e1b9e5923d4d91d02b1550891b34afe0ef7a | Suhrid-Talukder333/Data-structures-and-Algorithms | /c++ data structure/Array/leaders in array.cpp | C++ | cpp | 481 | no_license | //leaders are the number in the array which dont have bigger numbers in the right side of the array
//from the position
#include <bits/stdc++.h>
using namespace std;
void leaders(int arr[], int n)
{
int x = arr[n - 1];
cout << x << " ";
for (int i = n - 2; i >= 0; i--)
{
if (arr[i] > x)
... |
561c071e2102e04f907e10e3eceab291bdf5db3a | d6f8802afd6fed74bd4c1c6a7887bb31a51f2521 | YuanzhongLi/CompetitiveProgramming | /AtCoder/ABC/113/a.cpp | C++ | cpp | 1,406 | no_license | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin... |
bced6d5f13b251f759c94793d751e707041e7ce8 | ff295836d36da7d502ad1a6e7114420d4b8696b7 | TD2106/Competitive-Programming | /Pressure Test/WORDPOW-KMPver.cpp | C++ | cpp | 1,531 | no_license | #include <iostream>
#include <cstring>
using namespace std;
void preKMP(string pattern, int f[])
{
int m = pattern.length(), k;
f[0] = -1;
for (int i = 1; i < m; i++)
{
k = f[i - 1];
while (k >= 0)
{
if (pattern[k] == pattern[i - 1])
break;
... |
85b90c5b78ce1bc60bc39a90b490bc3f37e07736 | d04e1bdaecc876bf39c1dbd64ffdf0fce8b9b42d | tbui468/BlackJack | /BlackJack/Game.cpp | C++ | cpp | 1,949 | permissive | //Game class. Each game is comprised of multiple rounds
//the deck is replenished after each round, and new bets place
#include "Game.h"
#include <fstream>
#include <map>
Game::Game(): deck(DECK_NUMBER), player(deck), house(deck) {
//load profile
std::cout << "Welcome to Blackjack!" << std::endl << std::endl;
bo... |
931e9a850d02fec0b02bb05b0a5f59be5fecbb0e | 18d3af7391de0791a5bfb394bfeb64c4a1b32109 | LeonColt/skripsi | /Seraph/FileProcessWindow.cpp | C++ | cpp | 8,852 | no_license | #include "stdafx.h"
#include "FileProcessWindow.h"
FileProcessWindow::FileProcessWindow() {
}
void FileProcessWindow::onCreate() {
lbl_status_var.setParentAndId( this, LABEL_FILE_PROCESS_STATUS_VAR );
( ( maschinen::layout::LayoutMatrix* )getLayout() )->addController( &lbl_status_var, 0, 0, 0, 3, 1, 0 );
... |
e63ef1618196cf999ac56a06f6880cf02da88f2d | 811496ff98b0e931a2d0c4dc539ddac38281b2f8 | JohanSamir/PCL-Perception-Project | /PointCloud_Object-Classification/x_b.cpp | C++ | cpp | 32,944 | no_license | #include <pcl/io/pcd_io.h>
#include <pcl/io/ply_io.h>
#include <iostream>
#include <pcl/point_cloud.h>
#include <pcl/console/parse.h>
#include <pcl/sample_consensus/method_types.h>
#include <pcl/sample_consensus/model_types.h>
#include <pcl/segmentation/sac_segmentation.h>
#include <pcl/filters/extract_indices.h>
#inc... |
86c43e6b49394fca293c173790066a228a5163e7 | dcc3c8855c7588c0a76775c722d122425689fbc2 | arrayfire/arrayfire | /src/backend/cpu/kernel/select.hpp | C++ | hpp | 4,569 | permissive | /*******************************************************
* Copyright (c) 2015, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
**********************************************... |
4ac4ea9c2e9fa9b57d8f4b14fad0ceca9132a113 | df095e484c89a34d56cf21e09731288572a6cfac | jtahstu/iCode | /workspace/jintao/src/1045.cpp | C++ | cpp | 424 | no_license | /*
* http://183.167.205.82:8081/JudgeOnline/showproblem?problem_id=1045
* by jtahstu on 2015/3/26 15:00
*/
#include<iostream>
#include<set>
#include <algorithm>
using namespace std;
int main1045() {
set<int> s;
int n, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
s.insert(a);
}
set<i... |
2828e67a0eae1316be7286fd8813d4b50cdc5d31 | f83988ed715f61789f68cbcc220c5976988f7f47 | dingshiyu/aliyun-openapi-cpp-sdk | /emr/src/model/CreateBackupPlanResult.cc | C++ | cc | 1,969 | 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... |
40e74ce9df108abada39d2df7a553f0dd1cc3b53 | a1ffd9a9ed5455c9f7127627aee0859568838324 | aquemy/ZenoSolver | /tests/ut-combiGenerator.cpp | C++ | cpp | 12,226 | no_license | #include <iostream>
#include <stdexcept>
#include <vector>
#include <map>
#include <combiGenerator.hpp>
#include <paretoExtraction.hpp>
#include <algorithm.hpp>
#include <algorithm>
//#ifdef _OPENMP
#include <omp.h>
//#endif // _OPENMP
bool test_combi(int k, int n, const std::vector<std::vector<int>>& expected, boo... |
6e1446bec1d6936c1ee86af9508b880365a4213b | cd68f1fb0497da1c0a4fe22f3a85ac07b795069b | mjww3/algorithms | /doughnut.cpp | C++ | cpp | 282 | no_license | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int T;
long int c,w,k;
cin>>T;
while(T--)
{
cin>>c>>w>>k;
if(c*k<=w)
{
cout<<"yes"<<endl;
}
else
{
cout<<"no"<<endl;
}
}
return 0;
}
///solved |
74f76e26dd1e506e4fbf4c7866ab9e0d06dae755 | 68b69a47154cfab88f724c390b66189b8d8b79c2 | ossewawiel/WinUI | /WinUI/demo_app.cpp | C++ | cpp | 278 | no_license | #include "demo_window.h"
#include "demo_app.h"
#include "win_main.h"
int win_main()
{
demo_app app{ L"Demonstration Application" };
return app.run();
}
void demo_app::init()
{
_demo_window = std::make_unique<demo_window>(this, L"Demo App Title");
_demo_window->show();
}
|
3e034295cbe7f6b46982c7a93f1483cef9d6739b | 3b1d0874f7081b13ac8568f7764c004ef50bea91 | connectthefuture/psdmrepo | /psddl_python/tags/V00-04-08/src/oceanoptics.ddl.cpp | C++ | cpp | 4,380 | no_license | /* Do not edit this file, as it is auto-generated */
#include <boost/python.hpp>
#include <boost/make_shared.hpp>
#include "ndarray/ndarray.h"
#include "pdsdata/xtc/TypeId.hh"
#include "psddl_psana/oceanoptics.ddl.h" // inc_psana
#include "psddl_python/Converter.h"
#include "psddl_python/DdlWrapper.h"
#include "psddl_... |
f5e6f4d25003caf5fcf2969c64552b3881c16225 | 81e6fa8c9a96e4a6dc98ae0ce30a85c7bf7735cd | anandogc/tarang | /trunk/lib/fluid/fluid_base/force/compute_force_random.cc | C++ | cc | 19,207 | no_license | /* Tarang-2
*
* Copyright (C) 2008, 2009 Mahendra K. Verma
*
* Mahendra K. Verma
* Indian Institute of Technology, Kanpur-208016
* UP, India
*
* mkv@iitk.ac.in
*
* This file is part of Tarang-2 .
*
* Tarang-2 is free software; you can redistribute it and/or
* modify it under the terms of the ... |
0fef96720fcef784c0da68b1aca6fc5dff812ed1 | acc9f2dfc2f2a4211a9faf98ca1900ff61a88003 | umariqb/Multi-Person-Pose-Estimation-using-LJPA-ECCVW-2016 | /cpp/third_party/graph_CP/include/andres/graph/multicut-lifted/kernighan-lin.hxx | C++ | hxx | 12,356 | no_license | #pragma once
#ifndef ANDRES_GRAPH_MULTICUT_LIFTED_KERNIGHAN_LIN_HXX
#define ANDRES_GRAPH_MULTICUT_LIFTED_KERNIGHAN_LIN_HXX
#include <iomanip>
#include <stdexcept>
#include <unordered_set>
#include <vector>
#include <stack>
#include "andres/graph/components.hxx"
#include "andres/graph/twocut-lifted/kernighan-lin.hxx"
... |
e157c765c36341a5e81d32c8d91965e1cbe4b820 | b5ccf953e0278a5e3d2eece4a2b654680b65aa48 | Timofey21/Algorithms | /binSearch/main.cpp | C++ | cpp | 536 | no_license | #include <iostream>
#include <fstream>
uint64_t w, h, n;
const uint64_t max = 10e18;
uint64_t BinSearch(uint64_t l, uint64_t r) {
uint64_t mid;
while (l < r - 1) {
mid = (l + r) / 2;
if ((mid / h) * (mid / w) >= n)
r = mid;
else
l = mid;
}
return r;... |
2117f2b4bc063444d4ea348024eb8d6d9a149997 | c267788386ab5ef0ba62c297b7240c19c63f5df5 | vgladush/CPP | /d04/ex03/MateriaSource.cpp | C++ | cpp | 1,632 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* MateriaSource.cpp :+: :+: :+... |
53ce62708736aefe7ca45b10ab0c358a3899ba07 | 791139aa581cd7f80843314c67cb794ca80e4314 | pablo-lamtenzan/ft_containers | /includes/Queue.hpp | C++ | hpp | 2,922 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Queue.hpp :+: :+: :+: ... |
a71b8ae4fac9ba84f2caca113bc6fb61518591c9 | 4319eaaf08318eeb4efe1f3925395f5439bf2a36 | jhliberty/AAF | /examples/com-api/ComExtension/ComPersonnelExtension/writePlugin.cpp | C++ | cpp | 3,573 | no_license | //=---------------------------------------------------------------------=
//
// $Id: writePlugin.cpp,v 1.8 2009/06/01 11:46:52 stuart_hc Exp $ $Name: V116 $
//
// The contents of this file are subject to the AAF SDK Public Source
// License Agreement Version 2.0 (the "License"); You may not use this
// file except in c... |
a03e50b5f53c3897476cbbcfa5a0674f5278da60 | cd7ed6e8d5fc40b5edcce695eacc0b3c6be3ce00 | Halksel/Competition | /AOJ/V0/29.cpp | C++ | cpp | 1,394 | no_license | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_el... |
14d880bc12ffbb742c645d91fb04fa3c9b7a2db7 | 8f386532c9b4a58dc04b90663551a3731836556a | bluepp2/bitg | /src/zmq/zmqpublishnotifier.cpp | C++ | cpp | 7,381 | permissive | // Copyright (c) 2015-2018 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <chain.h>
#include <chainparams.h>
#include <streams.h>
#include <zmq/zmqpublishnotifier.h>
#include <validation.h>
... |
2c13f7fc28fb43c4f7b5cad6aa68d732b9fb3e65 | 9a3ad0f5a506f0f5120d7bf1950efdf00f7722e8 | zyw3000/ACM-CODE | /ZOJ/3876.cpp | C++ | cpp | 454 | no_license | #include <iostream>
#include <cstring>
using namespace std;
int data[10005];
int run(int x)
{
if(x % 4 == 0 && x % 100 != 0) return 1;
if(x % 400 ==0) return 1;
return 0;
}
int main()
{
int W[] = {9,6,5,5,5,5,6};
int T,t;
cin>>T;
memset(data,0,sizeof(data));
t = 0;
for(int i = 1928; i < 10000; i++)
{
if(... |
410c7edfce07eb337c349916baac54e500ae6951 | 4a8c93625b68e42ae221e4d1cf12a37d66edd92c | Wicker25/intercom-party | /src/EventPlanner.cpp | C++ | cpp | 1,040 | permissive | /*!
* Title ---- intercom-party/EventPlanner.cpp
* Author --- Giacomo Trudu aka `Wicker25` - wicker25[at]gmail[dot]com
*
* Copyright (C) 2017 by Giacomo Trudu.
* All rights reserved.
*/
#include <intercom-party/EventPlanner.hpp>
namespace intercom { // Begin main namespace
EventPlanner
EventPlanner::create(con... |
4bb52f67d742cc504b0e0ba85575222c7ed4d024 | cc99c3f09bf4f483637392f0b905418b1bc0509c | Crasader/18_TTL | /congcongclient/Classes/Plaza/HomeScene/CreateRoom/GPHomeCreateRoomPanel_SRLF.cpp | C++ | cpp | 20,543 | permissive | #include "GPHomeCreateRoomPanel_SRLF.h"
#include "Plaza/GameManager/GPGameLink.h"
#include "Game/SRLF/SRLFGameScence.h"
#include "Game/SRLF/CMD_SRLF.h"
#include "kernel/kernel/server/CServerItem.h"
#include "Plaza/HomeScene/GPHomeEnterRoomPanel.h"
#include "Plaza/HomeScene/GPHomeEditNumPanel.h"
FV_SINGLETON_STORAGE... |
5b36b70ae2087e5d4819ecd19007148fd2bd0e5a | 160627093ca885a392580d3054d4b9a9500cf02b | jumperbeng/backup | /PDA/VTK-6.3.0/Imaging/Core/vtkImageReslice.cxx | C++ | cxx | 95,349 | permissive | /*=========================================================================
Program: Visualization Toolkit
Module: vtkImageReslice.cxx
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 ... |
0847a3762953a5813a131c7bca28bb2b11298038 | a9c6fae52b315d3b14afbfddba6ac11bec930da2 | weareskyrabbit/NoCMake | /src/test.cpp | C++ | cpp | 6,980 | permissive | #include <cstdint>
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <string>
using namespace std;
bool is_little_endian() {
#if defined(__LITTLE_ENDIAN__)
return true;
#elif defined(__BIG_ENDIAN__)
return false;
#else
int e = 1;
if (*reinterpret_cast<char*>(&e)) return true;
else ret... |
45e5e7d51d2d59e0c2bef322e4305e18bec2a005 | f1c7939eb364104d84eb670e1ff0c742da2aaa0f | jasonblog/RTMPLive | /webrtc/common_video/h264/sps_parser_unittest.cc | C++ | cc | 6,923 | no_license | /*
* Copyright (c) 2015 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... |
74c4dc4393533ad8a273de87b3ab65049a69c9aa | 93406e9160bfb22ff59849fccf526926e2ac46de | 0xF6/openvino | /inference-engine/thirdparty/clDNN/kernel_selector/core/actual_kernels/max_unpooling/max_unpooling_kernel_base.cpp | C++ | cpp | 3,266 | permissive | // Copyright (c) 2018 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 a... |
4a89ec8837d998426a05b7311e61b6f8d47f92c1 | 428b30a32195d9b63b7eb360a7837db9569a508a | yokotech/competitive_programming | /AtCoder/agc/agc_034/4_agc034_d.cpp | C++ | cpp | 1,482 | no_license | // 4_agc034_d
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... |
4650a7e0dc77fe21b0787c3697659b72094c6145 | 3559d118519974428f771d0de92a42fb4bc7bd60 | ue4sdk/DRG-SDK | /DRG-SDK/SDK/DRG_BP_CountDownWidget_classes.hpp | C++ | hpp | 3,562 | no_license | #pragma once
// Deep Rock Galactic (0.22) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "DRG_BP_CountDownWidget_structs.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//----------------------------------------------------------------------... |
59943972e864507e78232064f31ae1044246d594 | b7f9f354f36097ea44279fa73087e8a9ddc7b8ce | seanprime7/Halide | /src/CodeGen_OpenCL_Dev.cpp | C++ | cpp | 36,969 | permissive | #include <algorithm>
#include <sstream>
#include <utility>
#include "CSE.h"
#include "CodeGen_Internal.h"
#include "CodeGen_OpenCL_Dev.h"
#include "Debug.h"
#include "EliminateBoolVectors.h"
#include "EmulateFloat16Math.h"
#include "ExprUsesVar.h"
#include "IRMutator.h"
#include "IROperator.h"
#include "Simplify.h"
n... |
37ad15f40449f8796f9176f3ef256253f79f0344 | 7895161a3b238227a6a9531ba67dd3c9c3b620f8 | zorba-processor/zorba | /src/runtime/core/gflwor/outerfor_iterator.cpp | C++ | cpp | 4,343 | permissive | /*
* Copyright 2006-2016 zorba.io
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in... |
954c62f906fd436463d8578dc76d374574d8fa6c | dd48a0fd44c00bb88f3b93a56e649899d48b555c | hqng/optimal-transport | /v0.1.2/Solvers/Common/TCouplingHandler.cpp | C++ | cpp | 3,809 | permissive | #include"TCouplingHandler.h"
// Dense Data Structure
template<typename Vc>
TCouplingHandlerDensePrototype<Vc>::TCouplingHandlerDensePrototype(int _xres, int _yres, Vc *_c, double *_mu) {
xres=_xres;
yres=_yres;
c=_c;
mu=_mu;
total=xres*yres;
}
template<typename Vc>
TCouplingHandlerDensePrototype<Vc>::~TCouplin... |
2c903ad6d1f6e1772898fd96ef5b26c4a1d81c1a | e4d4b002cbf70981377c8b41c9371f0200c4d618 | gerald-liu/misc | /mastermind/mastermind.cpp | C++ | cpp | 3,056 | no_license | /* Author: Gerald Liu
* GitHub Repository: https://github.com/gerald-liu/misc
* Algorithm by Frans van Gool: http://jmastermind.sourceforge.net/algorithm.html
*/
#include <iostream>
using namespace std;
struct Score {
int black = 0;
int white = 0;
};
Score feedback(const int guess[], const int code[]) {
... |
e594e044600f60a27acabd7db0233cf5c48d5b72 | 4c94599a9caf8a2cd20b2c2ac7c40806463f6cae | DracoL1ch/WarcraftIII_DLL_126-xxx | /DotAAllstarsHelper/DotaErrorHandler.cpp | C++ | cpp | 27,787 | no_license | #include "Main.h"
#include <iomanip>
#include <eh.h>
#define PSAPI_VERSION 1
#include <Psapi.h>
#pragma comment(lib,"Psapi.lib")
class InfoFromSE
{
public:
typedef unsigned int exception_code_t;
static const char* opDescription( const ULONG opcode )
{
switch ( opcode )
{
case 0: return "read";
case 1:... |
e2a910a94765e72506c3ad82857533cb90487ae6 | 99baed3ad3c4a9e0bd4ad9806e321a56d040392f | johncgenere/CPUandIOScheduling--OS_Simulation | /main.cpp | C++ | cpp | 12,256 | no_license | #include "process.h"
#include "disk.h"
#include "memory.h"
#include <iostream> // cout, cin
#include <queue> // priority_queue
#include <vector> // vector
#include <cctype> // isdigit()
#include <string> // stoll(), stoi(), getline()
void sim(const long long int &sizeOfOS, const int &amoun... |
5d31279e98866f2775450af8cb24b6d13eaf545a | 43a74974d8f3982daeb0fc984c16374313f0172c | duckdb/duckdb | /extension/icu/third_party/icu/common/static_unicode_sets.cpp | C++ | cpp | 10,115 | permissive | // © 2018 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
#include "unicode/utypes.h"
#if !UCONFIG_NO_FORMATTING
// Allow implicit conversion from char16_t* to UnicodeString for this file:
// Helpful in toString methods and elsewhere.
#ifndef UNISTR_FROM_STRING_E... |
6c62ce4d828135af50f7530a01bcd8d672a9c512 | 674ddcf05e11e26050d7928144b693877b18a18d | shi-yan/Zoidblog | /sessionmanager.cpp | C++ | cpp | 3,653 | no_license | #include "sessionmanager.h"
#include <QDateTime>
#include <cstdlib>
#include <QThread>
#include <QVector>
#include <QtCore/QCoreApplication>
SessionManager::SessionManager(QObject *parent):QObject(parent),checkerCount(0),needToAdd(false),maximumSessionSize(100),expirationTimeInSeconds(3600)
{
srand(QDateTime::cu... |
0a6c47e26ca887924608de8078f009f3b8eca320 | cfea1bb73fbc386422c1852e287749896950078a | sap2002/Pleskov-Coin | /src/version.cpp | C++ | cpp | 2,478 | permissive | // Copyright (c) 2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <string>
#include "version.h"
// Name of client reported in the 'version' message. Report the same name
// for both bitco... |
82499a97841e750ac284c51b0867cb2cc1846637 | 13ad7ab9f115975ab854ea1854d13a8bd51d042f | carvetime/study-cplus | /main.cpp | C++ | cpp | 453 | permissive | #include <iostream>
using namespace std;
class Box
{
public:
Box(){
cout << "invoke constructor function" << endl;
}
~Box(){
cout << "invoke destroy function" << endl;
}
};
int main()
{
// new方法创建的对象是在堆中的需要手动free或delete
Box *p = new Box;
cout << "p is created" << endl;
// 此方法是函数的局部变量在栈中，函数结束就会销毁
... |
32e0394830e908fc5d1f8620d3f89dfdfd54e083 | d6f1f62b3bbcd5ed3720644493b8210237e1142e | mxd369/cpp | /iitX/Programming_Basics/program_with_logical_expression.cpp | C++ | cpp | 235 | no_license | #include <iostream>
using namespace std;
int main()
{
int A, B, C;
bool isALargest;
cout << "Give 3 numbers: ";
cin >> A >> B >> C;
isALargest = ((A>=B)&&(A>=C));
cout << "Is A the largest:";
cout << isALargest;
return 0;
} |
a18e119c7dd21d78c946383aad04407e92d8a01b | a5c08869dab927ef266907a953ae51b6c6504e64 | RomaA2000/some_cpp_programs | /strings/C.cpp | C++ | cpp | 962 | no_license | //
// Created by Роман Агеев on 21.02.2020.
//
#include <iostream>
#include <vector>
class substring_founder {
public:
substring_founder() = default;
substring_founder(substring_founder const &) = default;
substring_founder &operator=(substring_founder const &) = default;
substring_founder(substring_founder &... |
240aae010e4ab47778ae504245f72fb2f6e645ca | 1407b5d6076aa89e046debc43374f6b2b868cb6e | eggs-cpp/sd-6 | /tests/cpp/lib/integer_sequence.201304.cpp | C++ | cpp | 596 | permissive | // Eggs.SD-6
//
// Copyright Agustin K-ballo Berge, Fusion Fenix 2015
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include <utility>
void test_integer_sequence() {
std::integer_sequence<std::size_t, 0, 1,... |
d6a2d57d5229182e333b921de4ef0506300b0f86 | 9f22b7e5e6feb80ba488c7c62620d5fb77d2d423 | losangler/C_project | /算法程序-用C++语言实现/ch13/数据排序类例.cpp | C++ | cpp | 2,843 | no_license | //数据排序类例.cpp
#include <iomanip>
#include "数据排序类.h"
#include "产生随机数类.h"
using namespace std;
int main()
{
int i,j;
cout <<"冒泡排序例:" <<endl;
RND r(5);
DATA_SORT<double> q;
double p[70];
for (i=0; i<70; i++) //产生70个0～1之间的随机数
p[i] = r.rnd1();
for (i=0; i<70; i++) //转换成0～999之间的... |
aecb3f50528a5befed183dd7bddf1a1e672e9ba3 | f2c90aa09f398b02c743eca69ac585b03926afb8 | SREERAGI18/chromium | /chrome/browser/ash/net/network_diagnostics/dns_latency_routine.cc | C++ | cc | 6,512 | permissive | // Copyright 2020 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/ash/net/network_diagnostics/dns_latency_routine.h"
#include <iterator>
#include <map>
#include <string>
#include <utility>
#incl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.