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 |
|---|---|---|---|---|---|---|---|---|
1cdd6b9a6646b701af2c7e390da2f79eafc9539f | 0c8631d66694653e2df9c460b6bbb906070eaf16 | sayed-ppqq/Code-Library | /Data Structure/Linked List.cpp | C++ | cpp | 2,380 | no_license | #include<bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define MEM(a,x) memset(a,x,sizeof(a))
#define pi acos(-1.0)
#define ll long long
#define pb push_back
#define mp make_pair
#d... |
bd0134c95da8d0c08ccfa3d1569ede5424e4d642 | fcff293ed56115edf3cd2c2ac0ebc3b2360288de | suliutree/AcceleratedCPP | /chapter03/3-4.cpp | C++ | cpp | 659 | no_license | #include<iostream>
#include<string>
using namespace std;
int main()
{
typedef string::size_type str_sz;
string longest;
str_sz longest_size =0;
string shortest;
str_sz shortest_size= 0;
cout <<"Enter words: ";
string s;
while (cin >> s)
{
if (longest_size == 0 || s.size() > longest_size)
{
longest =... |
3956b52c2d1bcf458440511d3303470c035c1af4 | 7b8de608ecb9e7c83c06ce64afc976601e3d28bf | cms-externals/boost | /libs/type_index/test/testing_crossmodule.cpp | C++ | cpp | 1,928 | permissive | //
// Copyright Antony Polukhin, 2012-2013.
//
// 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 <boost/test/minimal.hpp>
#include <boost/type_index.hpp>
#include "test_lib.hpp"
#define BOOST_CHECK_EQUA... |
1a1250d9ed9162bb5f7b09b3c120f352acff1195 | f972322b65a8c572f276d1d776defa73061e433e | slxixiha/Design_Pattern | /FactoryMode.cpp | C++ | cpp | 1,449 | no_license | /* 模式名称：工厂方法模式
* 模式分类：创建型模式
* 简单概述：在工厂基类中定义一个用于创建具体对象的接口，让具体工厂子类去生产对应的类。
* 工厂基类的使用把一个类的实例化延迟到其子类
* 模式优点：这个模式把工厂负责的内容也封装起来了，符合了开放封闭原则。
* 模式缺点：每增加一个产品，就要增加一个对应的工厂类，增加了开发量，而且还要修改客户端的代码。
* 使用场景：
*/
#include <iostream>
#include <string>
using std::cout;
using std::endl;
//控件基类
class Item
{... |
a968e7acd38ec6d25d75dd40689139ceafe538ec | 5d308a0b54610cecc23d11011246adf883d111a6 | timi-liuliang/echo | /thirdparty/google/tensorflow/lite/delegates/utils_test.cc | C++ | cc | 9,871 | permissive | /* Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
548ad59d088879b82892bfa2471f280044dca5d7 | 6eeb7df7dac925c6d862dea6dd8f9875bba8f62d | SINHASantos/pegasus | /src/replica/backup/cold_backup_context.cpp | C++ | cpp | 45,891 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
6b6d125edddc3a0ba9575bb2977437213b803d3b | d15762b07a22331f4fa2a9f96a9413344f5472eb | osmansajid/Contest-Problems | /LightOJ/1217/8606756_AC_12ms_1696kB.cpp | C++ | cpp | 873 | no_license | #include<bits/stdc++.h>
using namespace std;
int dp[1010],a[1010],n;
int fun(int indx)
{
if(indx>=n-1){
return 0;
}
if(dp[indx]!=-1){
return dp[indx];
}
int res1=0,res2=0;
res1=a[indx]+fun(indx+2);
res2=fun(indx+1);
return dp[indx]=max(res1,res2);
}
int fun2(int indx)
{... |
36bd47a9e8f68c96da63085978f4e6a1685489e3 | b55ee7ac15bfe518651f654c5503e6b431f2a272 | thiagosf88/TestLibrary | /jni/integer.cpp | C++ | cpp | 1,839 | no_license | #include <jni.h>
#include <stdlib.h>
#include <stdio.h>
#include <edu_performance_test_nativo_integeroperation_IntegerOperationNative.h>
#include <android/log.h>
#include <test_library.h>
jint
Java_edu_performance_test_nativo_integeroperation_IntegerOperationNative_testNIntegerOperationSieve( JNIEnv* env,
job... |
65ffe5b8b9d1aeaa97ab68c805143346918a29d0 | 4c40142a265d254eb2a065389104a3775a3e4cb6 | Dylleriz/bitlitas-explorer | /main.cpp | C++ | cpp | 24,337 | permissive | #define CROW_ENABLE_SSL
#include "src/page.h"
#include "ext/crow/crow.h"
#include "src/CmdLineOptions.h"
#include "src/MicroCore.h"
#include <fstream>
#include <regex>
using boost::filesystem::path;
using liteg::remove_bad_chars;
using namespace std;
namespace mylit
{
struct jsonresponse: crow::response
{
json... |
5c48abda4b03499282d1764d8661495e3d6c91c4 | db3f835dc04cdbf3c342d2f04505d7823d57ef58 | hrOarr/Important-coding-topics | /Binary Tree/binary search tree.cpp | C++ | cpp | 2,754 | no_license | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
const ll N=4e5+2,inf=1e9+7;
struct Node
{
int data;
Node *lft,*rgt;
Node(int val)
{
data=val;
lft=NULL;
rgt=NULL;
}
};
Node* _insert(Node *root,int data)
{
if(root==NULL)return new No... |
534768a32b726d6b67616d5655d79b9d26797a69 | 76c809e38d53ebdd3e1365ff1971710ef31d01b5 | darcyg/WPN-XM | /bin/innosetup-download-plugin/source/idp/url.cpp | C++ | cpp | 5,601 | permissive | #include <string.h>
#include "tstring.h"
#include "trace.h"
#include "url.h"
#include "ui.h"
Url::Url(tstring address)
{
urlString = address;
int len = (int)urlString.length();
scheme = new _TCHAR[len];
hostName = new _TCHAR[len];
userName = new _TCHAR[len];
password = new _TCHAR[len];
urlPath = new _T... |
66be042f68d831aa9db0a4cfe23fb849ff53d077 | 148d994af8d2c1fc432d56421e58f7bf47dfabca | mathter/antlr4 | /runtime/Cpp/runtime/src/Recognizer.cpp | C++ | cpp | 4,782 | permissive | /* Copyright (c) 2012-2016 The ANTLR Project. All rights reserved.
* Use of this file is governed by the BSD 3-clause license that
* can be found in the LICENSE.txt file in the project root.
*/
#include "ConsoleErrorListener.h"
#include "RecognitionException.h"
#include "support/CPPUtils.h"
#include "support/String... |
d623b9c43a1c14a44865fd84037414422ad225cf | 9a16b07e52d36356104539e07f5c0058f84761ee | joses97/SanchezJose_CSC5_41202 | /Class/Savitch_8thEd_Chap3_Prob11_V2/main.cpp | C++ | cpp | 1,049 | no_license | /*
* File: main.cpp
* Author: Jose Sanchez
* Purpose: Calculate e^x
* Created on January 4, 2016, 11:01 AM
*/
//System Libraries
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
//User Libraries
//Global Constants
//Function prototypes
//Execution Begins Here
int main(int argc, ... |
57617e097fa0edb7f3a35d3fda20b986a5366a30 | fdb6f9a0aae522fca8ebc1b814236f0cfebc6e2c | zhangliliang/opencv | /modules/core/include/opencv2/core/ocl.hpp | C++ | hpp | 21,966 | permissive | /*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, instal... |
d3b69d2ddd79ef32a2d3d8554f1cbde5ce7c669b | 6aa1fa828c898a1af8e0fcfe391e151a5a46cb5c | openharmony/third_party_flutter | /skia/third_party/externals/angle2/src/compiler/translator/VariablePacker.cpp | C++ | cpp | 12,239 | permissive | //
// Copyright 2002 The ANGLE 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.
//
// Check whether variables fit within packing limits according to the packing rules from the GLSL ES
// 1.00.17 spec, Appendix A, section 7.
#i... |
c1072300f0555375381df64e6f778da8e27cf96e | c04d33cd4f8cca081e76291ecb5659b7b8ab4c5e | yinshunming/chromium | /chrome/browser/chromeos/apps/intent_helper/apps_navigation_throttle.cc | C++ | cc | 9,644 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/apps/intent_helper/apps_navigation_throttle.h"
#include "base/bind.h"
#include "chrome/browser/chromeos/apps/intent_hel... |
a54fd014bf225483537644c40db0d904a42ff55c | 21057f32ed26ab9b2d12daf43f72002eb3d18a7a | saransh09/CppPrograms | /C++_Programs/PracticeCPPprograms/print_all_combinations.cpp | C++ | cpp | 700 | no_license | #include<iostream>
#include<cstring>
using namespace std;
void printAllCombinations(char * sol, char * nums) {
if (*nums == '\0') {
cout << sol << endl;
return;
}
int len = strlen(sol);
sol[len] = nums[0] - '0' + 'A';
sol[len+1] = '\0';
printAllCombinations(sol, nums+1);
if (... |
42ce5a57a94aed6b5989ced5b6500a722404efa3 | 58721033ea78b5117a44d56d72978e16621d3b94 | google/mozc | /src/base/process_mutex.cc | C++ | cc | 7,837 | permissive | // Copyright 2010-2021, 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 condit... |
39370c3d202230e70f3d2205507ae65450af053a | ccb54878e5a30fec609a99bb55b706f736623093 | KashidVivek/HashTag-Counter | /hashtag.cpp | C++ | cpp | 11,283 | no_license | #include<iostream>
#include<algorithm>
#include <string>
#include <stdlib.h>
#include <unordered_map>
#include<vector>
#include <fstream>
using namespace std;
//Max-Fibonacci Heap Structure
struct Node{
int frequency; //Frequency of HashTags
string name; //Name of HashTags
int degree; ... |
6e4d0be2052d662cf7273ed49d92806038f0ce1d | bba7cde273f844d2b83446d02464321a01121a06 | andreikl/ogl | /include/input.hpp | C++ | hpp | 788 | no_license | class Application;
class InputBase {
// constructors and destructors
public:
InputBase(Application & app);
// methods
public:
virtual void init() = 0;
virtual void handle() = 0;
// variables
protected:
Application & app;
};
class InputOrbit: InputBase {
// construcots and destructors
public:
InputOrbit(Applica... |
842986781ff0be079a13eba47bffd838586265bc | 7ea6fd214807eaba480281ef446fdffc232b93f3 | perryk12/conduit | /tests/uit/ducts/proc/impl/inlet/templated/templated/AggregatedInletDuct.cpp | C++ | cpp | 922 | permissive | #include <memory>
#define CATCH_CONFIG_DEFAULT_REPORTER "multiprocess"
#define CATCH_CONFIG_MAIN
#include "Catch/single_include/catch2/catch.hpp"
#include "uitsl/debug/MultiprocessReporter.hpp"
#include "uitsl/mpi/MpiGuard.hpp"
#include "uit/ducts/proc/impl/inlet/templated/AggregatedInletDuct.hpp"
#include "uit/duct... |
81e0491bc6acbe1233b38e2be2db8f5c6320d14a | 49e49061267076ef560c95a37c5427cb07db8545 | treefrogframework/treefrog-framework | /src/twebapplication_win.cpp | C++ | cpp | 3,404 | permissive | /* Copyright (c) 2010-2019, AOYAMA Kazuharu
* All rights reserved.
*
* This software may be used and distributed according to the terms of
* the New BSD License, which is incorporated herein by reference.
*/
#include "tsystemglobal.h"
#include <QLocalServer>
#include <QLocalSocket>
#include <TWebApplication>
#def... |
16ada572a8a57cfaaf17f78b9bbf8ee5bc555d81 | ef9bf86d80bd314cbce12f238daa721f15c7ca81 | tilomitra/DesignProjectOpenCV | /OpenCVTestApp/PreProcess.cpp | C++ | cpp | 1,179 | no_license | //
// PreProcess.cpp
// OpenCVTestApp
//
// Created by Sachi on 11-11-05.
// Copyright (c) 2011 __MyCompanyName__. All rights reserved.
//
#include <iostream>
#include "PreProcess.h"
IplImage * Equalize(IplImage * img)
{
IplImage * faceImage = 0;
IplImage * imageProcessed = 0;
if (img->nChannels... |
d8d131aea7dade6f6ca3c65d2101b1022bc5c1da | 94907144677f7022c86070b09ca639c90a57cc6c | liang0/chromium | /components/password_manager/core/browser/form_saver_impl_unittest.cc | C++ | cc | 13,205 | 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 "components/password_manager/core/browser/form_saver_impl.h"
#include <map>
#include <memory>
#include <set>
#include <string>
#include <vector>... |
f60e83beb5a0a8d418b75db8bc0b10e6ef6afedf | 273907da9ead9f38fd73e7316cfb20b68e9a0a2f | Kalo2412/OOP.More | /Message.hpp | C++ | hpp | 683 | no_license | //
// Message.hpp
// HW4_R
//
// Created by Kaloyan Vachkov on 25.05.21.
//
#ifndef Message_hpp
#define Message_hpp
// You are not allowed to make breaking changes to the class interface,
// but you are allowed to add additional methods/fields, as
// well as MODIFY the existing interface so as to make it
// "more ... |
9519a21e12d1bc4ccdc17efc8dc8cd0b33199abf | 07375710e579da5f9aa3cda9f458197558b29a6e | DeepWolf413/additional-native-data | /rdr2/0xDD9DC1AB63D513CE.cpp | C++ | cpp | 404 | no_license | // beat_torturing_captive.ysc @ L9201
void func_241()
{
int iVar0;
int iVar1;
vector3 vVar2;
TASK::WAYPOINT_RECORDING_GET_NUM_POINTS(sLocal_94, &iVar0);
GRAPHICS::_0x41F88A85A579A61D(0.5f);
iVar1 = 0;
while (iVar1 <= iVar0)
{
TASK::WAYPOINT_RECORDING_GET_COORD(sLocal_94, iVar1, &vVar2);
GRAPHIC... |
6222280d689ec84b0361335b699b4ae0c2d11fba | 7a3f8b8a067417869f4c20e65832a28a537d61d5 | FBerendsen/SuperElastix-1 | /Modules/Components/itkImageRegistrationMethodv4/include/selxItkGaussianExponentialDiffeomorphicTransformComponent.hxx | C++ | hxx | 4,380 | permissive | /*=========================================================================
*
* Copyright Leiden University Medical Center, Erasmus University Medical
* Center and contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License... |
b65ea002a624e4d1b90bad260133d855167a64c9 | 02c66ccde2ec9e03c0c905c38821b2c38621450e | hfuhuang/proview | /xtt/lib/cow/gtk/cow_xhelp_gtk.cpp | C++ | cpp | 17,270 | no_license | /**
* Proview $Id: co_xhelp_gtk.cpp,v 1.4 2008-10-31 12:51:30 claes Exp $
* Copyright (C) 2005 SSAB Oxelösund AB.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation, either version 2 of... |
b65e511e38ab39aad1d8a7c6cbceb2c6b4fced7f | 623b0cd38c7295a70758018540419b27bb000eb5 | DemyCode/algorep | /src/mpi_classes/process-information.cc | C++ | cc | 872 | no_license | #include "process-information.hh"
void ProcessInformation::set_information(size_t rank,
size_t n_client,
size_t client_offset,
size_t n_node,
size_t node_o... |
ea89c1f0df61872d7c8c71ba9100bcd8350a872d | 28682de30567120091efcc86bd7d8b9ce7848af3 | otissot/oliviertissot-projects | /Navier-Stokes/src/stokes2d.cpp | C++ | cpp | 15,685 | no_license | // stokes2d.cpp ---
//
// Filename: stokes2d.cpp
// Description:
// Author: O.TISSOT
// Created: lun. janv. 27 09:31:10 2014 (+0100)
// Version:
// Last-Updated: sam. mai 31 13:26:26 2014 (+0200)
// By: otissot
// Update #: 1003
// Compatibility:
//
// UMFPACK
// Commentary:
//
// Resolution du ... |
322fa5a98498864a62ab23214fc7dbe777b03b30 | 52a24936fefa723eeb94d67c58b2118f8c30933d | bigeasy/node-leveldown | /src/iterator.cc | C++ | cc | 8,463 | permissive | /* Copyright (c) 2012-2013 LevelDOWN contributors
* See list at <https://github.com/rvagg/node-leveldown#contributing>
* MIT +no-false-attribs License <https://github.com/rvagg/node-leveldown/blob/master/LICENSE>
*/
#include <node.h>
#include <node_buffer.h>
#include "database.h"
#include "iterator.h"
#include "it... |
169ad968fc7cf8fd48ed00ad61eb3f353fedd155 | 5a632a1d80db5fc947f9d042c3f89a9d15c1d17f | madsbh/experiments | /dynamics/testbed/DemoApplication.cpp | C++ | cpp | 34,636 | no_license | /*
Bullet Continuous Collision Detection and Physics Library
Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permiss... |
22998c2fe9531d8ae23d63f93baf636deb9f882d | 87dea6756bb61d182b2b6acbb92337d1fb838dac | Razdeep/Codeforces-Solutions | /contests/Codeforces Global Round #5/Balanced_rating_changes.cpp | C++ | cpp | 564 | permissive | // @TODO
#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; ++i)
{
cin >> arr[i];
}
ll sum = std::accumulate(all(arr), 0LL);
for... |
522e8827fb0a597151b04c44a4ad2a31006a4e9e | b4c1fcf9d67eba3a25d3bd8148d4199560a53b12 | Hibiki1999/Hibiki1999-Base | /Base/Base/Scene/Child/PlayingScene/PlayingScene.cpp | C++ | cpp | 485 | no_license | #include "PlayingScene.h"
#include "../../../Game.h"
#include "../../../Resource/Map/Map.h"
#include "../../../Resource/Sound/SoundEffect_Object/SoundEffectObject.h"
PlayingScene::PlayingScene()
{
}
void PlayingScene::Init()
{
}
void PlayingScene::Update()
{
//if (Input::GetButtonDown(Pad::All, PAD_INPUT_1)) Game:... |
3c325c4afddecf270d40ccce502ac1227344987c | 842939af4e2c1a1b22e4ae326f38c3ddc643af54 | Svengali/VoxelPlugin | /Source/VoxelEditor/Private/VoxelEditorToolsPanel.cpp | C++ | cpp | 25,996 | permissive | // Copyright 2021 Phyronnaz
#include "VoxelEditorToolsPanel.h"
#include "VoxelTools/VoxelToolManager.h"
#include "VoxelTools/Tools/VoxelTool.h"
#include "VoxelTools/Tools/VoxelFlattenTool.h"
#include "VoxelTools/Tools/VoxelLevelTool.h"
#include "VoxelTools/Tools/VoxelMeshTool.h"
#include "VoxelTools/Tools/Vo... |
99ac991373fd3675d8f7154a2a3a918b976b6241 | e2863813377da9b2677eb790d688f17769dcb690 | JonasEira/Network_lab4 | /Brick_wall_client/Brick_wall_client.cpp | C++ | cpp | 975 | no_license | // Brick_wall_client.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include "pch.h"
using namespace std;
int main()
{
string ip = "169.254.140.159";
//string ip = "10.0.2.25";
int port = 49152;
ClientConnectionManager* ccm = new ClientConnectionManager();
ccm->openConne... |
581594267f566f23e8626a5dfb0c36b518827092 | 87413c3ffe6135aa87f5732473fa4bb5d7809964 | Tubbz-alt/i2pd | /libi2pd/TunnelPool.cpp | C++ | cpp | 18,501 | permissive | /*
* Copyright (c) 2013-2020, The PurpleI2P Project
*
* This file is part of Purple i2pd project and licensed under BSD3
*
* See full license text in LICENSE file at top of project tree
*/
#include <algorithm>
#include <random>
#include "I2PEndian.h"
#include "Crypto.h"
#include "Tunnel.h"
#include "NetDb.hpp"
#includ... |
8feecc7af34220b8d2abd8169a2ea734ad60abfd | d127c9863db563dc79bd123b5c7b03af6fcff2ef | templeblock/BeatFinder | /audioconv.cpp | C++ | cpp | 3,062 | permissive | #pragma comment (lib, "avutil.lib")
#include <iostream>
#include "audioconv.h"
using namespace std;
AudioTranscoder::AudioTranscoder(const char *input, AVCodecID codecID)
{
av_register_all();
decoder = new fileAudioDecoder;
encoder = new fileAudioEncoder;
this->inputFilePath = input;
this->codecID = codecID;
... |
fd1b47599e1b1c38acca0caaf20c3551a43d31cf | 5c9b5b5a78d67ee5e937f2d3a28d159744ac32ee | arifcep/WPEFrameworkPlugins | /TVControl/TableData/Parser/DVB/ParserDVB.cpp | C++ | cpp | 35,173 | permissive | #include "Module.h"
#include "ParserDVB.h"
using namespace WPEFramework;
#define READ_16(buf1, buf0) ((uint16_t)(buf1 << 8 | buf0))
#define READ_32(buf3, buf2, buf1, buf0) ((uint32_t)((buf3 << 24) | (buf2 << 16) | (buf1 << 8) | buf0))
#define GETBITS(Source, MSBit, LSBit) ( \
((((1 << (MSBit - LSBit... |
a1709d2207ff58594bee6c18c0c15b1ed034489b | 2bd1b32b1da3426b3c6a2ccc0f18f9dd067841ad | surajkoraon/LeetCode-Solutions | /July LeetCoding Challenge/Week 1 July 1st - July 7th/Plus One.cpp | C++ | cpp | 405 | no_license | class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int plus=1;
int x=1;
int n=digits.size();
for(int i=n-1;i>=0;i--)
{
plus=(digits[i]+plus)/10;
digits[i]=(digits[i]+x)%10;
x=plus;
}
if(plus)
{
... |
b1b75298173943dbef101ec1a38f566f6a4daea0 | 2b61a8a034f6c09ecadcc0e0e92575a826f114ff | JaminChan/eos_win | /externals/wasm-compiler/llvm/lib/Object/WasmObjectFile.cpp | C++ | cpp | 9,404 | permissive | //===- WasmObjectFile.cpp - Wasm object file implementation -----*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
395fc68c37d5bd0b07091fa7c73714329bbcba8b | 951b26dee45e9e6bb01193ab23b5bc74bda87664 | csdms/cca-spec-babel | /src/treeReader/ComponentData.cpp | C++ | cpp | 9,954 | no_license | #include "treeReader/ComponentData.hpp"
#define CD_DEBUG 0
class local_exception : public virtual std::exception {
private:
std::string msg;
public:
local_exception(std::string m) {
msg = m;
}
~local_exception() throw () {};
local_exception() {
msg = "no_message_defined";
}
virtual std::string what() { ret... |
a0f6100d7b9de61b30ed8fd65e431e78fb8a0215 | 7e480ec0d8852e3e0cbfeda497016bd67838f43e | blackblue2712/My_Study_CT | /dev c++/ktrachia het 3.cpp | C++ | cpp | 301 | no_license | #include <stdio.h>
#include <conio.h>
int main(){
int x;
int a,b,c;
printf("nhap vao so can kiem tra :");
scanf("%d",&x);
a=x/100;
b=(x/10)%10;
c=x%10;
printf("%d,%d,%d\n",a,b,c);
s=a+b+c;
printf("%d\n",s);
if((a+b+c)%3==0)
printf ("%d chia het cho 3",x);
else printf("%d khong chia het cho 3",x);
}
|
0ef22a488ea16c00137b1c17012d813ac6a97aa6 | bf2d21df5f25274de188e32ca3b8ccbfd51d2712 | AngelaCooljx/AirTicketOL | /main.cpp | C++ | cpp | 49,167 | no_license | #include <iostream>
#include <fstream>
#include <conio.h>
#include <cstdlib>
#include <string>
#include <ctime>
#include <stdio.h>
#ifdef _WIN32
#include <windows.h>
#else
#include <unistd.h>
#endif // _WIN32
using namespace std;
void sleepcp(int milliseconds)
{ //跨平台sleep函数
#ifdef _WIN32
Sleep(milliseconds);
... |
275629b1ac9afccb6c5a348f29bdaded5887581d | 31da9e0674f9bc506a19167c4059f3ecf05069a1 | chemiczny/automateusz_gto_d2 | /include/gto_d2_kit/d2_ee_ddpd_AB.hpp | C++ | hpp | 1,307 | no_license | #ifndef D2_EE_DDPD_AB_HPP
#define D2_EE_DDPD_AB_HPP
void second_derivative_ee_2212_12( const double ae,
const double xA,
const double yA,
const double zA,
const double be,
const double xB,
const double yB,
const double zB,
const double ce,
const double xC,
const double yC,
... |
aee72ee2506f54950f4425ea2aaeec88321a8f00 | d69cfce8aae716f4fa75d00515a56b72f7608925 | aman33459/ProgrammingContest | /codeforces/644/1.cpp | C++ | cpp | 2,427 | no_license | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
#define error(args...) { string _s = #arg... |
8cce4fca55af23fabc75c664a21d8c484f49ef15 | f5025269214b834decde7fa0dd60daaad5c8eb13 | MasterNodesME/mnme | /src/zmnmechain.cpp | C++ | cpp | 14,563 | permissive | // Copyright (c) 2015-2018 The PIVX developers
// Copyright (c) 2019-2020 The MasterWin developers
// Copyright (c) 2021-2021 The MasterNodesME developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "zmnmechain.h"
#... |
fb2914c2a5d90a8e15654f8009db90834f33876e | e09a60cf7ad44589b1670ac4e6da9260b4809b3c | PolarisYxh/phantomOmniRos | /openhaptics_3.4-0-developer-edition-amd64/opt/OpenHaptics/Developer/3.4-0/examples/HD/graphics/PointManipulation/src/PointManipulationUtil.cpp | C++ | cpp | 1,728 | no_license | /*****************************************************************************
Copyright (c) 2004 SensAble Technologies, Inc. All rights reserved.
OpenHaptics(TM) toolkit. The material embodied in this software and use of
this software is subject to the terms and conditions of the clickthrough
Development License Agr... |
fee488416f9574bf72462ca0d64d5ae6a8f42aab | 0a3e08b59e0b69fe9a0ec9420f1185cb5f503aa7 | chromium/chromium | /services/network/shared_dictionary/shared_dictionary_writer_on_disk_unittest.cc | C++ | cc | 39,054 | permissive | // Copyright 2023 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "services/network/shared_dictionary/shared_dictionary_writer_on_disk.h"
#include "base/functional/callback_helpers.h"
#include "base/memory/raw_ptr.h"
#include "base/... |
d2b0b67e7eba9f244cc1e4689c4a33c0dec900be | 29e55021c3827916091b1a0ac5dcb3798829895c | DRobDev/temp_the-girb | /source/improved/gameObjects/PlayerMain.cpp | C++ | cpp | 1,459 | no_license | #include "gameObjects\PlayerMain.h"
#ifdef _DEBUG
bool PlayerMain::alreadyCreated = false;
#endif // _DEBUG
PlayerMain::PlayerMain()
//TEMP: update with animated later
: CollisionSimplePhysics(
PreDefSprites::PLAYER_LVL1_IDLE_1, //player sprite
Collider::ColliderType::PLAYERBODY, //collider type
Vec2(500, 400)... |
bdd8c4e7a033b40b87268910bb53ab1c99e2a449 | db343f248287ddbdacedc39c1ed41eb229c45778 | tuyen1998/Juliet_test_Suite | /testcases/CWE762_Mismatched_Memory_Management_Routines/s01/CWE762_Mismatched_Memory_Management_Routines__delete_array_int64_t_realloc_51a.cpp | C++ | cpp | 2,808 | no_license | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE762_Mismatched_Memory_Management_Routines__delete_array_int64_t_realloc_51a.cpp
Label Definition File: CWE762_Mismatched_Memory_Management_Routines__delete_array.label.xml
Template File: sources-sinks-51a.tmpl.cpp
*/
/*
* @description
* CWE: 762 Mismatched Memory Manag... |
6349d5e3d7aee187a670fe3f65e2a738b08db222 | f62d4fb919eca6c5e5a655a8d52c3ec0c4a17f0c | toefel18/wadl-tool | /wadl/modelparser.cpp | C++ | cpp | 3,511 | no_license | #include "modelparser.h"
#include <xsd/cxx/tree/exceptions.hxx>
#include <xsd/cxx/parser/validating/parser.hxx>
#include "wadl.hxx"
#include "wadlparseexception.h"
#include <memory>
#include <iostream>
#include "resource.h"
using namespace std;
namespace wadl {
ModelParser::ModelParser()
{
}
Rest... |
cc6994e31b0ca0e6f65f29fe706a90bd3cc2d80e | 9b062b7577db443db1c0271010267a2a74207854 | KqSMea8/sstd_library | /sstd_boost/sstd/libs/safe_numerics/example/example11.cpp | C++ | cpp | 1,252 | permissive | #include <cassert>
#include <exception>
#include <iostream>
#include <cstdint>
#include <sstd/boost/safe_numerics/safe_integer.hpp>
int main(int, const char * []){
std::cout << "example 1:";
std::cout << "undetected erroneous expression evaluation" << std::endl;
std::cout << "Not using safe numerics" << ... |
76ed48cae818f7e1dd1e846559d3af369a35207b | 2189340e487922a35229ca5e876f00e13c15d8ca | Ankit1dubey/Hacktoberfest-Accepted | /Aman Dhattarwal CPP Codes/Functions/Functions_Alphabet_or_not.cpp | C++ | cpp | 367 | no_license | #include <iostream>
using namespace std;
void check(char ch)
{
if ((ch >= 97 && ch <= 122) || (ch >= 65 && ch <= 90))
{
cout << ch << " is an Alphabet";
}
else
{
cout << ch << " is not an Alphabet";
}
}
int main()
{
char ch;
cout << "Enter the element " << endl;
c... |
ad8790f76943ec99c66864443923469bf99b3646 | 706803eab8b24083379d0bf2137c7ae209d03254 | Kiritow/OJ-Problems-Source | /HDOJ/2982_autoAC.cpp | C++ | cpp | 3,566 | no_license | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <vector>
#include <math.h>
#include <deque>
#define LL long long
#define pii pair<int,int>
#define pdi pair<double,int>
#define INF 0x7f7f7f7f
using namespace std;
const int N=200;
int x[N], y[N], rudu[N];
int earn... |
120cdec30888736994e457ddd772918e3c4f344b | f6e9d911b006a9ad27392d355810488a02cda1dc | nandini12396/GraphColoring | /anderson_coarselock.cpp | C++ | cpp | 12,950 | no_license | #include <stdio.h>
#include <iostream>
#include <pthread.h>
#include <stdlib.h>
#include <list>
#include <vector>
#include <ctime> // std::time
#include <cstdlib> // std::rand, std::srand
#include <random>
#include <algorithm>
#include <iterator>
#include <math.h>
#include <time.h>
#include <fstream>
#inclu... |
d718ef0dfc6332d20d2afb54105783dac8cad8bb | 1d05b9a9d6732c633af23f803d222e119363fc81 | alexandervanrenen/Gamera-Database | /src/query/operator/InsertOperator.cpp | C++ | cpp | 2,233 | no_license | #include "InsertOperator.hpp"
#include "ProjectionOperator.hpp"
#include "harriet/Value.hpp"
#include "Operator.hpp"
#include "schema/RelationSchema.hpp"
#include "query/util/ColumnAccessInfo.hpp"
#include "query/util/GlobalRegister.hpp"
#include "segment_manager/SPSegment.hpp"
#include <iostream>
using namespace std;... |
fd53f6290e59cd36316053fd2f03a749a05efaa9 | 319c9e3ee161fb2f7ebe8ad6ebd3657a71ce4237 | ArimaTakeshi/ArimaTakeshi | /吉田学園情報ビジネス専門学校_有馬武志/Work5_2年_2Dシューティング/開発環境/BATTLESHIP/bullet.cpp | C++ | cpp | 10,780 | no_license | //=============================================================================
//
// バレットの処理 [bullet.cpp]
// Author : 有馬武志
//
//=============================================================================
#include "scene.h"
#include "scene2D.h"
#include "bullet.h"
#include "manager.h"
#include "renderer.h"
#include "... |
1824088ffca9b76c405cccb60ea97ea273ae9000 | 4bff3cb5893386e5f0ba6ef7941701096596dac2 | 3660628/chtmoneyhub | /moneyhub2.2/Security/BankDrv/ProcessFilter.cpp | C++ | cpp | 3,692 | no_license | /**
*-----------------------------------------------------------*
* 版权所有： (c), 2010 - 2999, 北京融信恒通科技有限公司
* 文件名： ProcessFilter.cpp
* 说明： 过滤进程ID存储。
* 版本号： 1.0.0
*
* 版本历史：
* 版本号 日期 作者 说明
* 1.0.0 2010.07.03 曹家鑫
*-----------------------------------------------------------*
*/
#include "nt... |
ea960abd0bed7ebe92a00bd4ef05d64d692095c5 | e814777880bc822d69666e9eb9cb32f6aafcc4ee | stdstring/leetcode | /Algorithms/Tasks.0001.0500/0208.ImplementTrie/solution.cpp | C++ | cpp | 2,111 | permissive | #include <string>
#include <vector>
#include "gtest/gtest.h"
namespace
{
class Trie
{
public:
/* Initialize your data structure here. */
Trie()
{
_prefixTree.emplace_back(alphabetSize + 1, unknownValue);
}
/* Inserts a word into the trie. */
void insert(std::string const &word)
{... |
05babf3796358c65cb97aec20a1bda7f90d81a8d | 000cbdebec425376d5b60602765f1a13b30dec01 | yuantao15/Fast-RTPS | /src/cpp/fastdds/domain/DomainParticipant.cpp | C++ | cpp | 8,639 | permissive | // Copyright 2019 Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// 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 re... |
d82a6cf7f81333af5cab7224569558c12960df8c | 1637b1042396c78199b131c85dcc5ada64b40ea3 | Mitarushi/SuperCon_2020 | /fugaku/main4.cpp | C++ | cpp | 11,394 | no_license | #include <stdio.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <queue>
#include <random>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
const int MAX_T = 100000;
const int MAX_DP = 1e9;
string s, t;
int s_cou... |
241dea0f3b98725f33e8e3f2a69512d8d7314fe8 | c3965ad5478e9372fcb7c928bace85fcf1a68c27 | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_LootCrate_Explosion_Yellow_functions.cpp | C++ | cpp | 1,592 | permissive | // ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_LootCrate_Explosion_Yellow_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//-------------------------------------------------------... |
0bec655fa4b6e64c5cd7ee697f5f04066d1aaee9 | c277f24665495d9fa54d7af1cf444f75583c609b | zlsun/leetcode | /371. Sum of Two Integers/solution.cpp | C++ | cpp | 448 | permissive | /** 371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.
Example:
Given a = 1 and b = 2, return 3.
Credits:Special thanks to @fujiaozhu for adding this problem and creating all test cases.
**/
#include <iostream>
#include "../utils.h"
using namespac... |
28021b786d79dd542d3b53de091be86802296538 | 1e4fd9f9aae248a4b19dc119f22459297aa9cc2f | iondune/Aqueous | /Aqueous/CGlyphNodeManager.cpp | C++ | cpp | 3,413 | permissive |
#include "CGlyphNodeManager.h"
#include <ionWindow.h>
#include "CProgramContext.h"
#include "CDataSet.h"
vec3f CGlyph::GetPosition() const
{
return Position;
}
color3f CGlyph::GetColor() const
{
return Color;
}
void CGlyphNodeManager::Init()
{
SingletonPointer<CSceneManager> SceneManager;... |
fc10e2fe102973ef9722c53954c964ed42573fff | 73438531a82d3fcb1d765b0eddd11fa7184251fd | enricoros/glow | /lib/Backends/OpenCL/OpenCLDeviceManager.cpp | C++ | cpp | 15,699 | permissive | /**
* Copyright (c) 2017-present, Facebook, 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 applicable ... |
b06139a644c512e317db219fb12cbf98be6a0982 | a203ecd641a91c81e9d38ebc10b19603103ef575 | jeongminhui99/ETH_ARP_Packet_Reader | /arp_read.cpp | C++ | cpp | 5,011 | no_license | #include <arpa/inet.h>
#include <net/ethernet.h>
#include <cstdio>
#include <iostream>
#include <cstring>
#include <pcap.h>
#include<netinet/in.h>
using namespace std;
#define ARPOP_REQUEST 1 /* ARP request. */
#define ARPOP_REPLY 2 /* ARP reply. */
struct arphdr
{
unsigned short int ar_hrd; /* Format of har... |
6887272527cdc9e52e4317948d1b722899d0c4c5 | 20ca8bf4aed2e0ff3bdd019d0474fe2f7681f583 | parkjungeun/Algorithm-Problem-Code | /SWEA/[SWEA]완전탐색그리디_조합적문제_조합최대합찾기_Bit.cpp | C++ | cpp | 739 | no_license | //조합 : 2개의 값을 더해 만들 수 있는 최대값 - Bit 부분집합예제
#include<iostream>
#define MAX_N 10
using namespace std;
int Nums[MAX_N];
int N;
int countBit(int n)
{
int cnt = 0;
while (n > 0)
{
if (n & 1)
cnt++;
n = n >> 1;
}
return cnt;
}
int solve()
{
int res = 0;
for (int i = 0; i < (1 << N); i++)
{
if (countBit(... |
6594dc3bfb5101ab34df1d49c258679c50407518 | 1f718643bc206e96d03ef9d2bd79999415e5ee04 | AztecProtocol/barretenberg | /cpp/src/barretenberg/proof_system/polynomial_store/polynomial_store.hpp | C++ | hpp | 1,383 | permissive | #pragma once
#include "barretenberg/common/assert.hpp"
#include "barretenberg/polynomials/polynomial.hpp"
#include <cstddef>
#include <map>
#include <string>
#include <unordered_map>
namespace proof_system {
template <typename Fr> class PolynomialStore {
private:
using Polynomial = barretenberg::Polynomial<Fr>... |
565aa8f2c599bdea6d766551788cf825b4ae34a6 | 407849f9136747bd17723e3bb37ad8f1e0473a22 | timzimmermann/hyrise | /src/lib/server/then_operator.hpp | C++ | hpp | 3,959 | permissive | #pragma once
#include <boost/thread/future.hpp>
// This code is inspired by the code examples of user Yakk on StackExchange
// https://codereview.stackexchange.com/q/23179
// https://stackoverflow.com/a/32320053
// It helps us to avoid boilerplate code in three ways:
// 1. It automatically 'get's the incoming future... |
0e017870c2848824efcfa5581acd1e81bc53713b | 722178e982dd8383ed7ea0b54bcd9e62e4cf285a | takaki2018/Takaiwa_Game | /吉田学園情報ビジネス専門学校_髙岩一稀/Square/開発環境/debugproc.cpp | C++ | cpp | 4,411 | no_license | //=============================================================================
//
// デバック表示処理 [debugproc.cpp]
// Author : itsuki takaiwa
//
//=============================================================================
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include "debugproc.h"
#include "mana... |
7776e7176942a4389db2f742e18c710b1c34e064 | e552f3309d6769ec4db5227fbcb0e1f5d111bd6b | fucoin/fucoin | /src/qt/signverifymessagedialog.cpp | C++ | cpp | 8,785 | permissive | #include "signverifymessagedialog.h"
#include "ui_signverifymessagedialog.h"
#include "addressbookpage.h"
#include "base58.h"
#include "guiutil.h"
#include "init.h"
#include "main.h"
#include "optionsmodel.h"
#include "walletmodel.h"
#include "wallet.h"
#include <QClipboard>
#include <string>
#include <vector>
Sign... |
ed5b94617865097108b45a1b1d32d54401600e8f | f5c0879cbdecfddfc740c0bf6323e62da6ef1273 | boostasoft/learningCplusplus | /getfunctionParam.cpp | C++ | cpp | 779 | permissive | #include <iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
char ** argv;
char ** tab[2];
int argc=13;
tab[0] = (char**)malloc(20*sizeof(char));
tab[1] = (char**)malloc(20*sizeof(char));
int i=0;
/* parcourir les arguments */
while( i != argc) ... |
7bb25080088915525b831969e78e9d2ddf65aa3e | da2806ab98418c0e03f24784db4221147feb2d65 | ric2b/Vivaldi-browser | /chromium/weblayer/browser/safe_browsing/real_time_url_lookup_service_factory.cc | C++ | cc | 3,490 | permissive | // Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "weblayer/browser/safe_browsing/real_time_url_lookup_service_factory.h"
#include "base/bind.h"
#include "components/keyed_service/content/browser_context_dependency_m... |
b8cf1405b7956034269dbb017a7cc078d8d7beb5 | bcb39b6ca5fe6496621024bfa3f3c8fb61bd53d9 | kingstop/830 | /server/gameserver/ObjectManager.cpp | C++ | cpp | 3,673 | no_license | #include "stdafx.h"
#include "player.h"
#include "session.h"
#define _SAVE_PLAYER_ONLINE_TIME_ (10 * 10 * _TIME_SECOND_MSEL_)
#define _ONCE_SAVE_PLAYE_COUNT 400
ObjectManager::ObjectManager()
{
gEventMgr.addEvent(this, &ObjectManager::saveAllPlayers, EVENT_SAVE_PLAYER_DATA_, _SAVE_PLAYER_ONLINE_TIME_, 0, 0);
}
Ob... |
15b10de2691fd8a7eda72d340f0090883cd8c5dd | 8940f6ff9e8cf9ec24fd15cb9888e89100a96588 | travellingdotgo/grpcin1 | /test/cpp/client/client_channel_stress_test.cc | C++ | cc | 11,516 | permissive | /*
*
* Copyright 2017 gRPC authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... |
e8b4c5f14813e428ada23efe12e85f1a5530e7da | 7e8a89f297020bf5c159c9a17fd23766d6102e1e | dennisehart/secondmachineprob | /Co_Lab3.cpp | C++ | cpp | 1,223 | no_license |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string Ename,payperi ;
int empid;
float income,latabs;
float const Philheal=1000,SSS=800;
cout<<"\n";
cout<<"Employee Name:"<<endl;
getline(cin,Ename);
cout<<"Payroll Period:"<<endl;
getline(cin,payperi... |
fe3a446c0d3aa020bff69c846251373197d0bc0f | 4d00829572ac864075fa1e79523f774429c61046 | bonescreater/bones | /bones/lua_context.cpp | C++ | cpp | 22,836 | permissive | #include "lua_context.h"
#include "bones.h"
#include "lua_check.h"
#include "script_parser.h"
#include "utils.h"
#include "core/logging.h"
#include "core/ref.h"
#include "core/encoding.h"
namespace bones
{
static const char * kBonesTable = "bones";
static const char * kCO2LOTable = "__co2lo";
static const char * kC... |
e8a30a5954d9aaafdd41f7db1346a3b453d646b5 | df5e51f7510ae23ecde243420a2dd882e0f64826 | ShorreMccolman/DarkAdventureUE | /Source/DAGame/UI/DAWidget.cpp | C++ | cpp | 1,912 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "DAWidget.h"
#include "DAButton.h"
#include "DASelectable.h"
#include "WidgetNavigation.h"
void UDAWidget::Accept()
{
if (CurrentHighlight) {
IDASelectable* TheInterface = Cast<IDASelectable>(CurrentHighlight);
if (TheInterfa... |
6aaa7fc2f4882099fd4fdb22bf5b37080a2dc335 | e014944c716e173940948859985a0201f426043d | ravikasyap97/mergesort | /biotonicsearch.cpp | C++ | cpp | 2,277 | no_license | /*Bitonic search: An array is bitonic if it is comprised of an increasing sequence
of integers followed immediately by a decreasing sequence of integers. Given a
bitonic array A of n distinct integers, describe how to determine whether a given
integer is in the array in O(logn) steps.*/
#include <iostream>
using name... |
bb50a73200c09d1d8c616853b5c87c4c9a7e60b4 | f0a9587b066e9d3c12637156f8e3e5ca59946746 | bitslab/CompilerInterrupts | /benchmarks/shenango/parsec/pkgs/libs/tbblib/src/src/rml/test/rml_omp_stub.cpp | C++ | cpp | 2,765 | permissive | /*
Copyright 2005-2010 Intel Corporation. All Rights Reserved.
This file is part of Threading Building Blocks.
Threading Building Blocks is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License
version 2 as published by the Free Software Foundat... |
3c0741de86970b722e9529e99068c0f7335ca05b | 48d144828005647773dc92caf4fb5ce04152ec05 | blizmax/ArkoseRenderer | /src/rendering/nodes/DiffuseGINode.cpp | C++ | cpp | 12,595 | permissive | #include "DiffuseGINode.h"
#include "CameraState.h"
#include "LightData.h"
#include "ProbeDebug.h"
#include "geometry/Frustum.h"
#include "utility/Logging.h"
#include <imgui.h>
#include <moos/random.h>
#include <moos/transform.h>
std::string DiffuseGINode::name()
{
return "diffuse-gi";
}
DiffuseGINode::DiffuseGI... |
1d93785041ad38b3088ba20398a98d81615df3e1 | 6f75304d2fd7475c5e45e0a535583f3acf387b99 | fayras/Fraktale | /ColorModes/ColorMode.hpp | C++ | hpp | 1,353 | no_license | #ifndef FRAKTALE_COLORMODE_HPP
#define FRAKTALE_COLORMODE_HPP
#include <QtGui/QRgb>
#include <memory>
struct FractalPixel;
/**
* Eine abstrakte Klasse für Farbgebungen.
*/
class ColorMode {
public:
/**
* Zur vereinfachten Schreibweise eines (smart) Zeigers auf ein ColorMode.
*/
typedef std::uni... |
6b442902b0119f4bd1b2da9ccfcd6bfa11823ca6 | f7aaac8a04cf3f677b33d28c1a845bebd68e19b7 | bobur554396/PPI2020FALL | /w9/8.cpp | C++ | cpp | 528 | no_license | #include <iostream>
using namespace std;
int f1(int a, int n){
int k = 1;
for(int i = 0; i < n; i++)
k *= a;
// 2^3
// k = 1 * 2 * 2 * 2
return k;
}
int f2(int a, int n){
if(n == 0)
return 1;
return a * f2(a, n - 1);
}
/*
1) f2(2, 3) => 2 * f2(2, 2); => 2 * 2 * 2 * 1
2) f2(2, 2) => 2 * f... |
e3fee82300142a6a5c061932143350ca9f39e0b2 | b7ce600d4a2952eecdbfa69aea9020b8cecea98f | Amenhotep19/shopper-mood-monitor-cpp | /src/main.cpp | C++ | cpp | 14,425 | no_license | /*
* Copyright (c) 2018 Intel Corporation.
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publis... |
5afa82a1c453d9c97e09174361b5ebbf3e69aff7 | f32b961d109f9227433f7d8cc8ed3bf28f13aded | helkebir/Lodestar | /Lodestar/blocks/aux/DirectedGraph.cpp | C++ | cpp | 3,243 | permissive | //
// Created by Hamza El-Kebir on 12/25/21.
//
#include "DirectedGraph.hpp"
ls::blocks::aux::DirectedGraph ls::blocks::aux::DirectedGraph::fromBlocks(const std::vector<BlockProto *> &blocks)
{
::std::vector<const BlockProto *> blks;
blks.reserve(blocks.size());
for (auto blk : blocks)
blks.push_... |
d762895ce246dbf9bde7ce60f43d1956058a48df | 4c2d221580feca0fa33654597b4c9e4aaf4fe29c | shwangdev/secure_index | /include/cli/basic_spirit.hpp | C++ | hpp | 4,310 | no_license | /*
* basic_spirit.hpp - Support for command interpreters which uses parsers
* based on Boost.Spirit
*
* Copyright 2010-2012 Jesús Torres <jmtorres@ull.es>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
*... |
b7f8653c1357f1e04427846a3f1b007dca8a42fb | a6b05cc3aab6e506fbdb90ebbb0950a1a76b1ed6 | Kimicz20/git-Fantasy | /Fantasy2.0/PBQL3.0/src/UAV/AP_RPM.cpp | C++ | cpp | 3,772 | no_license | // -*- tab-width: 4; Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*-
/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any lat... |
47afe5869e4cb8d669cf64b5893c6ab831959d37 | 2b2cc870885d9ed71cfb5365534d2f32de0639db | DoaaY98/doaas-codes | /fcfs_input.cpp | C++ | cpp | 233 | no_license | #include "fcfs_input.h"
#include "ui_fcfs_input.h"
fcfs_input::fcfs_input(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::fcfs_input)
{
ui->setupUi(this);
}
fcfs_input::~fcfs_input()
{
delete ui;
}
|
2ed62ee292be346ffa0fdf7e49f5fc57a6f50093 | f7b5897210fee6e00830f18bb1e6d69f1cf05882 | SlavaC1/ControlSW | /Trunk/ObjetFamily/Base/Sources/EdenSerialProtocol/EdenProtocolEngine.cpp | C++ | cpp | 25,847 | no_license | /********************************************************************
* Objet Geometries LTD. *
* --------------------- *
* Project: Q2RT *
* Module: Eden serial protocol engine c... |
c6153ae3047a4774e5e73f0af511c7d160e88b64 | 0a6969472d9312813129b8f0e214c7ee43e50fb8 | demirtasugur/geant4-education | /examples/Lesson_gps/src/ActionInitialization.cc | C++ | cc | 247 | no_license | //
// Created by mihail on 24.05.17.
//
#include "ActionInitialization.hh"
#include "PrimaryGeneratorAction.hh"
void ActionInitialization::Build() const {
PrimaryGeneratorAction *gun = new PrimaryGeneratorAction();
SetUserAction(gun);
}
|
1073b80ea06c36d6070ae049af4846d4e052e568 | 9a504e5c5b50b8ce6e9350a2763577a6c51f3d38 | telmotrooper/ine5425_genesys-gui | /genesys/parserBisonFlex/position.hh | C++ | hh | 4,842 | no_license | // A Bison parser, made by GNU Bison 3.0.4.
// Positions for Bison parsers in C++
// Copyright (C) 2002-2015 Free Software Foundation, Inc.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, ... |
fa394eada77f534fbb736eff9c4b912548ba42d9 | e6e17c6cf281f947942ff79fbffab878ec9763d0 | ssh352/lab616 | /cpp-ib/src/ib/marketdata.hpp | C++ | hpp | 1,517 | no_license | #ifndef IB_INTERNAL_MARKETDATA_H_
#define IB_INTERNAL_MARKETDATA_H_
#ifndef IB_USE_STD_STRING
#define IB_USE_STD_STRING
#endif
#include <Shared/Contract.h>
#include <Shared/EClient.h>
#include <Shared/Order.h>
#include <ib/services.hpp>
using namespace std;
namespace ib {
namespace internal {
class MarketDataImp... |
987a58909722cb6c664a3d010623e3a9c1a3dca1 | 27b3f3e0285102c40081153fc967e3fc4c39f121 | SajjadPSavoji/Mafia | /codes/villager.hpp | C++ | hpp | 241 | no_license | #ifndef VILLAGER_HEADER_GUARD
#define VILLAGER_HEADER_GUARD
#include "player.hpp"
class VILLAGER : public Player
{
public:
VILLAGER(std::string _name , Role _role):Player(_name,_role){}
virtual bool is_mafia(){return false;}
};
#endif |
b67a086058482120a9976a8aac7bf941e691d377 | f0966544badb68050a816339567f59b535a70cb4 | lang010/impala | /be/src/util/rle-test.cc | C++ | cc | 9,446 | no_license | // Copyright 2012 Cloudera 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 applicable law or agreed to in wr... |
5a60f4c416e8474203fbd7ecaa93a50b955f61e6 | 1356a2077f45412e38ec6a4fa9fb19cf07c5f1ce | nikk4s/LCD-clock | /main.cpp | C++ | cpp | 5,309 | no_license | // Code for LCD Interfacing with ATmega328P AVR microcontroller
#include <avr/io.h>
#define F_CPU 8000000UL // internal clock 8mhz no /8
#include <util/delay.h>
#include <string.h>
// Define registers
#define D_OUT PORTC
#define DATA PORTD
#define setDATA DDRD
#define setD_OUT DDRC
// define lcd control... |
2ffcf1db3bcbfdf0e6c96f35b3ad4bb00af97980 | 5ecc2db9bdb7de2633933194b9829556f1a7713f | UDC-GAC/tejas_knl | /Tejas-Simulator/PIN/pin-2.14/source/tools/CacheClient/mem_usage.cpp | C++ | cpp | 7,625 | permissive | /*BEGIN_LEGAL
Intel Open Source License
Copyright (c) 2002-2014 Intel Corporation. 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 noti... |
96366120f1c6b7ad750c91017924aa6724636d69 | ebc6af014c7e00c59b4a86f76d74f6bd266d720d | asardak/reindexer | /cpp_src/core/storage/leveldbstorage.cc | C++ | cc | 6,195 | permissive | #include "leveldbstorage.h"
#include "tools/slice.h"
#include <leveldb/comparator.h>
#include <leveldb/db.h>
#include <leveldb/iterator.h>
#include <leveldb/slice.h>
const char* storageNotInitialized = "Storage is not initialized";
void toWriteOptions(const StorageOpts& opts, leveldb::WriteOptions& wopts) { wopts.sy... |
dba18abb7596587b137e0a708b5b9895dd122ae9 | c81f5462e94100e64052a8a43af658265311ed3f | medusaGit/isoscatR | /src/scatR_util.cpp | C++ | cpp | 11,020 | no_license | #include <RcppArmadillo.h>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <boost/lexical_cast.hpp>
#include <boost/iostreams/filtering_stream.hpp>
#include <boost/iostreams/filter/gzip.hpp>
#include "scatR_util.h"
void open_cvfiles(GlobalParams &p, GlobalOptions &opt) {
p.cvfileStreams.resize... |
2fb671c3312d46c8466e734324eb83baabaa54a1 | 97320e44d31daaf4a19f1162b0eeb4f32b542eaf | zhuangli1987/LeetCode | /Subsets II.cpp | C++ | cpp | 748 | no_license | class Solution {
public:
set< vector<int> > s;
vector<vector<int> > ret;
void dfs(vector<int> &S, int pos, vector<int> v) {
if (pos < S.size()) {
dfs(S, pos + 1, v);
v.push_back(S[pos]);
dfs(S, pos + 1, v);
} else {
s.insert(v);
}
}... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.