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 |
|---|---|---|---|---|---|---|---|---|
fe99e0e8ca3c54901dd49f879686aa57552853a6 | 4a21569bfffa23ca7cd9dd99c9605648133be602 | minus3theta/contest | /atcoder/abc/046/c.cpp | C++ | cpp | 662 | no_license | #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <vector>
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
using namespace std;
typedef long long ll;
ll divceil(ll x, ll y) {
return (x + y - 1)... |
890ff1d0035151431682770ca94760acdfa705b4 | 60ef9f9ccb9fb1651b47b2c33003dbccfc3736e7 | kissen/serenity | /Userland/Libraries/LibWeb/CSS/StyleProperties.cpp | C++ | cpp | 27,636 | permissive | /*
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <AK/TypeCasts.h>
#include <LibCore/DirIterator.h>
#include <LibGfx/FontDatabase.h>
#include <LibWeb/CSS/StyleProperties.h>
#include <LibWeb/FontCache.h>
#include <LibWeb/Layout/BlockBox.h>
#incl... |
31ab0d63c0112a77ed73a916c0c6840443992e80 | f07b1993a89c7748ab021c6aacc494136c9e10ed | provingground-moe/qserv | /core/modules/qana/TablePlugin.cc | C++ | cc | 12,485 | no_license | // -*- LSST-C++ -*-
/*
* LSST Data Management System
* Copyright 2013-2016 AURA/LSST.
*
* This product includes software developed by the
* LSST Project (http://www.lsst.org/).
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as publ... |
256fedc972167a8c5c04452eca22f4f1c4bea2c1 | 7bfb526bb789726b2826d633ef27c42eafbef292 | selonsy/cplusplus | /Messy_Test-master/demo/DesignPatternsTest/AbstractFactory.hpp | C++ | hpp | 2,691 | permissive | #ifndef FBC_MESSY_TEST_ABSTRACT_FACTORY_HPP_
#define FBC_MESSY_TEST_ABSTRACT_FACTORY_HPP_
#include <iostream>
// =======================================
//用户抽象接口
class IUser
{
public:
virtual void GetUser() = 0;
virtual void InsertUser() = 0;
};
//部门抽象接口
class IDepartment
{
public:
virtual void GetDepartment() = ... |
55ee2f38443e952832aa6c5a170fc17c4ccb6328 | 4c1e9102985dd15ef30fc4177e2db26a3a50cd5d | nagrath/iqcash | /src/activemasternode.cpp | C++ | cpp | 10,397 | permissive | // Copyright (c) 2014-2017 The Dash Core developers
// Copyright (c) 2018 The IQcash Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "activemasternode.h"
#include "masternode.h"
#include "masternode-sync... |
c5ae6aded7595a2e8a21a7d45ab72d5b0216541d | 7846d62b56c33fede34de48796af834b59e7dc55 | Why1221/MP-RW-LSH | /ANNS_E/A-iDEC/3rd_party/highfive/bits/H5Easy_vector.hpp | C++ | hpp | 3,367 | no_license | /*
* Copyright (c), 2017, Adrien Devresse <adrien.devresse@epfl.ch>
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
*/
#ifndef H5EASY_BITS_VECTOR_HPP
#define H5EASY_BITS_VECTOR_HPP
#include... |
30a976f8eda3dd431b38973f5a050908c8f40abb | ba1ceffa7c68e7c6ff99997c146a0d7630218c91 | adinarad-dev/LeetCode-Solutions | /1632. Rank Transform of a Matrix/C++_solution_Sort&UnionFind.cpp | C++ | cpp | 1,422 | no_license | class Solution {
public:
vector<vector<int>> matrixRankTransform(vector<vector<int>>& mat) {
int m= mat.size();
int n = mat[0].size();
vector<vector<int>> ans(m, vector<int>(n, 0));
vector<int> rank(n+m, 0);
map<int, vector<pair<int, int>> >mpp;
... |
c46a8ea274271c641d3853b209d616f599413efa | 166d12b59b09af2246a4cde129e8154d70a1144f | cjdool/C-Basic | /lec-08/univ.hpp | C++ | hpp | 11,704 | no_license | //
// univ.h
// univlist
//
// Created by 장주현 on 2/22/19.
// Copyright © 2019 장주현. All rights reserved.
//
#ifndef univ_h
#define univ_h
#include "Node.h"
#include <iostream>
/*unvlist is double linked list of Node with operation overloading*/
/*unvlist sequential access only*/
template<typename A>
class unvlist ... |
6304d61f8e6adfb6a41ddb12f2dac58c0af24240 | c661870a084faf1bbe4de1398b92a33a446e439d | juno181/spine | /register_types.cpp | C++ | cpp | 8,312 | permissive | /******************************************************************************
* Spine Runtimes Software License v2.5
*
* Copyright (c) 2013-2016, Esoteric Software
* All rights reserved.
*
* You are granted a perpetual, non-exclusive, non-sublicensable, and
* non-transferable license to use, install, execute, ... |
876f758ab10e8ee17a22a476fe64397436a4b211 | da4c70279c0ca474870d4322aed3e70ead044b90 | MVPet/Project-V | /Source/CrossCutter.cpp | C++ | cpp | 2,467 | no_license | #include "CrossCutter.h"
#include <iostream>
CrossCutter::CrossCutter() {
name = CROSS_CUTTER;
}
CrossCutter::~CrossCutter() {
}
void CrossCutter::Load() {
std::string charPath = "Textures/Chars/Kyosuke/Projectiles/" + name + "/";
spawnOffset = sf::Vector2f(86.f, 60.f);
SetMaxDurability(1);
Animation* temp;
... |
12b423517fb94cf9f7efe91396ede5a101462ff3 | d249a71c75f1082475c995aeddbff235c5c47ee4 | Weak-Chicken/Algo_every_day | /LeetCode/c++/3_Longest Substring Without Repeating Characters.cpp | C++ | cpp | 586 | permissive | class Solution
{
public:
int lengthOfLongestSubstring(string s)
{
int res = 0; string searched = "";
for (int i = 0; i < s.size(); i++)
{
for (int j = 0; j < searched.size(); j++)
{
if (s[i] == searched[j])
{
... |
307a9b8335193bac5b933cc6b31721c3312160fa | dfe0651acfa4e97cd8d904b85e09aa835786868d | billyquith/ponder | /include/ponder/detail/valueref.hpp | C++ | hpp | 3,377 | permissive | /****************************************************************************
**
** This file is part of the Ponder library, formerly CAMP.
**
** The MIT License (MIT)
**
** Copyright (C) 2009-2014 TEGESO/TEGESOFT and/or its subsidiary(-ies) and mother company.
** Copyright (C) 2015-2020 Nick Trout.
**
** Permission is... |
41ba18e8e37af31a54306c52b7152af11ec581f1 | 9a69f98638ada450a551e91ce05ebfd0c5f9c959 | oydang/CS4701-pokemon-AI | /Tracer-VisualboyAdvance1.7.1/Tracer-VisualboyAdvance1.7.1/source/src/gb/gbDis.cpp | C++ | cpp | 6,237 | permissive | /*
* VisualBoyAdvanced - Nintendo Gameboy/GameboyAdvance (TM) emulator
* Copyrigh(c) 1999-2002 Forgotten (vb@emuhq.com)
*
* 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 ... |
909ab720c65ba0d7c8930564d0d458ad92f98000 | 3d1f1ef585504e68d9bb19b9ba4d620861422bcd | yyuzhong/flexcore | /flexcore/extended/visualization/visualization.hpp | C++ | hpp | 466 | permissive | #ifndef SRC_VISUALIZATION_HPP_
#define SRC_VISUALIZATION_HPP_
#include <flexcore/extended/base_node.hpp>
#include <iosfwd>
#include <memory>
namespace fc
{
namespace graph{ class connection_graph; }
class visualization
{
public:
visualization(const graph::connection_graph& graph, const forest_t& forest);
~visual... |
3bc0cc0ea3c52ccc36d5c253536fc8a89a798cf3 | 2dbbf37caf04c55b9d31c297c013aa6f2d0e7dbe | misswhite/skia | /src/gpu/ops/GrSmallPathRenderer.cpp | C++ | cpp | 43,112 | permissive | /*
* Copyright 2014 Google Inc.
* Copyright 2017 ARM Ltd.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "src/gpu/ops/GrSmallPathRenderer.h"
#include "include/core/SkPaint.h"
#include "src/core/SkAutoMalloc.h"
#include "src/core/SkAutoPixmapSt... |
299b68f17fc7b9934b92b8821729c5616b25c15c | 2ea289dbd31dac4cd84e714fb3f560b913d64341 | SWG-Source/client-tools | /src/external/3rd/library/atlmfc/src/atl/atls/atlstr.cpp | C++ | cpp | 632 | no_license | // This is a part of the Active Template Library.
// Copyright (C) Microsoft Corporation
// All rights reserved.
//
// This source code is only intended as a supplement to the
// Active Template Library Reference and related
// electronic documentation provided with the library.
// See these sources for detailed inform... |
e82541f65db6c1b29eaaa68bb8f2e7fdf32652cb | ecf54f9dcd294d794cb787168436a62b7e823f3b | dexter3k/AVM2 | /source/main.cpp | C++ | cpp | 1,572 | permissive | #include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#include "common/ByteBuffer.h"
#include "common/FileUtil.h"
#include "utils/Dump.h"
#include "vm/Abc.h"
#include "vm/VirtualMachine.h"
void printUsage(std::string const & program)
{
std::cout << "Usage:\n"
<< " " << program << " <filename.... |
5f2c88c1aa475bc95ccc7ca1184116aab155f7dd | 086d9164dc9b8d72c0708a3b41d33996e76eb29e | zhmu/ananas | /external/gcc-12.1.0/libstdc++-v3/src/c++98/list_associated-2.cc | C++ | cc | 1,244 | permissive | // Default definitions when using namespace associations, list -*- C++ -*-
// Copyright (C) 2011-2022 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as pu... |
9a925df7a146839b90fb1608004df26e77ae5da5 | d4199ab43f108f836d46ea7792394efc6c984a85 | lazybobcat/ld41 | /systems/PlayerControlledSystem.cpp | C++ | cpp | 1,150 | no_license | //
// Created by loic on 21/04/18.
//
#include "PlayerControlledSystem.hpp"
#include "../components/PlayerControlled.hpp"
#include "../components/SpeedComponent.hpp"
#include "../components/Body.hpp"
#include "../components/PlayerAnimation.hpp"
void PlayerControlledSystem::update(EntityManager &entityManager, Fluffy:... |
1f566cd0b096c5397005b9face19e1916f950af3 | 438794bc128963c69f6c6abc96edbed978f2a862 | Alyonkachocolate/untitled15 | /main.cpp | C++ | cpp | 5,765 | no_license | #include <iostream>
#include <string>
#include <random>
#include <bitset>
using std::cout;
using std::cin;
using std::endl;
using std::string;
using std::getline;
using std::bitset;
int main() {
setlocale( LC_ALL,"Russian" );
unsigned int VI=485;
std::uniform_int_distribution<> range{0, 0xFFF};
std::de... |
141681aa94dca2665d64035fc2178ba9ddf111d3 | f5b2f2f82d26b08d0b3b95ea8cd8d185ef3748c2 | jigyasa3003/Algorithms | /Исходники Трухановича Влада/Strings/suf_aut/3 - min_lex_shift.cpp | C++ | cpp | 945 | no_license | #include <string>
#include <map>
#include <iostream>
#include <memory.h>
using namespace std;
#define N 111111
struct _SA{
int link,len;
map<char,int> next;
} st[N+N];
int sz,last;
void init(){
last=0;
sz=1;
st[0].link=-1;
st[0].len=0;
}
void ins(char c){
int cur=sz++;
st[cur].len=st[last].len+1;
int p;
fo... |
2990101fdf7e604a587559cbd25bbd24dfdf7443 | caa893c289828adc4854d61c09d283709f3e8d45 | zgsxwsdxg/clDNN | /kernel_selector/core/actual_kernels/convolution/convolution_kernel_yxfb_yxio_b1_block.cpp | C++ | cpp | 3,093 | permissive | /*
// Copyright (c) 2016 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 o... |
eeed23a6144102006a519dcbb8012434973b7cb7 | 60fd28e7f8e13295e7825f5eb36db178ca132413 | crosswalk-project/chromium-crosswalk-efl | /chrome/browser/net/pref_proxy_config_tracker_impl_unittest.cc | C++ | cc | 17,480 | permissive | // Copyright (c) 2011 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/net/pref_proxy_config_tracker_impl.h"
#include "base/command_line.h"
#include "base/files/file_path.h"
#include "base/messag... |
e83bd317e95e93c9a817aee9dbde6661282c1ebe | 62a0bedf11798c2e6d4576779916105acbb383d7 | matthewmcc/BlackJackCardCount | /BlackJackCardCount/Dealer.cpp | C++ | cpp | 1,020 | no_license | #include "stdafx.h"
#include "Dealer.h"
#include "HandScoreCalculator.h"
Dealer::Dealer()
{
ScoreCalculator = HandScoreCalculator();
}
Dealer::~Dealer()
{
}
void Dealer::addCardToHand(Card &newCard)
{
CardsInHand.push_back(newCard);
};
void Dealer::addUpCard(Card &newCard)
{
CardsInHand.push_back(newCard);
UpCa... |
c23dbb4d7577f273f5c03102525e82c4ef5e6fee | 233bb271f0473c81c0b9351326d4dedc93fbc7bc | David-Wong-Cascante/JuniorEngine | /Junior_Core/Src/Source/ParticleEmitter.cpp | C++ | cpp | 7,245 | permissive | /*
* Author: David Wong
* Email: david.wongcascante@digipen.edu
* File name: ParticleEmitter.cpp
* Description: Emits the particles
* Created: 6 May 2018
* Last Modified: 10 May 2019
*/
// Includes
#include "ParticleEmitter.h"
#include <math.h> // atan2
#include "LinearMath.h" // Linear Math
#include "GameObje... |
bfcd82e7eb00801ad7ec42f21bfc0cb3ab3b7a2c | c524a01eb59a66fdca773afdc1bbdc0b67b67546 | tvtoon/dynarmic | /frontend/A32/exception_generating.cpp | C++ | cpp | 1,219 | permissive | /* This file is part of the dynarmic project.
* Copyright (c) 2016 MerryMage
* SPDX-License-Identifier: 0BSD
*/
#include "config.h"
#include "translate_arm.h"
namespace Dynarmic::A32 {
// BKPT #<imm16>
bool ArmTranslatorVisitor::arm_BKPT(Cond cond, Imm<12> /*imm12*/, Imm<4> /*imm4*/) {
if (cond != Cond::AL &... |
18c090903f1e9a6202db362bf2f902ba2a1ae245 | 550d00f0a39a6e2353f86005da98d100c14b5ceb | sixspeedchips/tic_tac_toe_mcts | /src/model/tree.cc | C++ | cc | 589 | no_license | //
// Created by finn on 1/9/20.
//
#include <stack>
#include "tree.h"
#include "utils.h"
tree::tree(node *root) {
this->root = root;
}
void tree::traverse() {
deque<node*> queue;
queue.push_back(this->root);
node* curr;
while(!queue.empty()){
curr = queue.at(0);
queue.pop_front();
for(auto el... |
ff3aad9793b6cd1e49caa0046a0e5e17b8181f6c | b8f9bf8fae0d99a0bc1aad2cb36e65bb091c6637 | Sezon2/protobuf | /src/google/protobuf/io/io_win32.cc | C++ | cc | 11,857 | permissive | // Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// ... |
55513d9379b6d12acfe62f51cde995946530a7fb | 43f776f968db4d053e1226c5716a1db153fad612 | jiahuipeng/GASDocumentation | /Source/GASDocumentation/Private/GDEngineSubsystem.cpp | C++ | cpp | 260 | permissive | // Copyright 2020 Dan Kestranek.
#include "GDEngineSubsystem.h"
#include "AbilitySystemGlobals.h"
void UGDEngineSubsystem::Initialize(FSubsystemCollectionBase& Collection)
{
Super::Initialize(Collection);
UAbilitySystemGlobals::Get().InitGlobalData();
}
|
76d332fabd80a3d50b157f98f6a034c09d9f6490 | 24aec0a16a3980537f252c1f0c1b7f5832374219 | hellocomrade/happycoding | /leetcode/MaximumAverageSubarray2.cpp | C++ | cpp | 4,483 | no_license | #include <vector>
#include <limits>
#include <algorithm>
using namespace std;
//https://leetcode.com/problems/maximum-average-subarray-ii
/*
644 Maximum Average Subarray II
Given an array consisting of n integers, find the contiguous subarray whose length is greater than or equal to k that has the maximum average va... |
79ecd2627238dc8a46ae5c1b69acb2936bcfb460 | 1ac6f91d6201e32d9e0329241aa6d27b63709ad3 | skywhat/leetcode | /Cpp/684.cpp | C++ | cpp | 1,963 | no_license | // In this problem, a tree is an undirected graph that is connected and has no
// cycles.
//
// The given input is a graph that started as a tree with N nodes (with distinct
// values 1, 2, ..., N), with one additional edge added. The added edge has two
// different vertices chosen from 1 to N, and was not an edge that... |
c70e30d92fbe7454ba58eaea3118d2ae1c6c2805 | 0baca36db5ff394eee550228cafa5e82fc1ab81b | Qt-Widgets/LibQQt-Widgets-Collection | /src/exquisite/qrcode/qrdecode/zxing/zxing/datamatrix/DataMatrixVersion.cpp | C++ | cpp | 7,410 | permissive | /*
* Version.cpp
* zxing
*
* Created by Luiz Silva on 09/02/2010.
* Copyright 2010 ZXing 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
*
* ... |
92cf3d9a8f8d64d35fdae6f95ef68c54d225833d | 9c82041e4461f7932ba5654cc98165f5dc92a109 | hinnie123/PWND_SDK | /SDK/PWND_Niagara_parameters.hpp | C++ | hpp | 6,186 | no_license | #pragma once
// PWND (4.17.2.0) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "../SDK.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Parameters
//---------------------------------------------------------------------------
// Function Niagara.Niag... |
3090ac5137cccbde83572400a0e512e9425cda24 | 13e6e30aedc9bc2f66093dd63266b2e3226a64b0 | vmuthuk2/GEH_3_Node | /GEH-slave-3/Broker/src/device/CMqttAdapter.hpp | C++ | hpp | 5,063 | no_license | ////////////////////////////////////////////////////////////////////////////////
/// @file CMqttAdapter.hpp
///
/// @author Thomas Roth <tprfh7@mst.edu>
///
/// @project FREEDM DGI
///
/// @description Implementation of an asynchronous PAHO MQTT client in DGI.
///
/// These source code files were cr... |
0dfbe614873205bfa55ac3700b361aa19301580b | b3e1f14e1c6061be070c021ec237bda26f9860f0 | CatrielCarbonera/HexMeshing | /FourSplitPyramid/src/SplitQuad.cpp | C++ | cpp | 6,747 | no_license | //
// Copyright 2005-2006 @ C. Carbonera All rights reserved
// 11300 Rupp Drive
// Burnsville, MN 55337
// catriel.carbonera@comcast.net
// This file can be freely redistributed for research and academic purposes only
// undser the condition that the copyright notices, including this header, "
// are... |
88cac426e4fad4c244f656dc71b4b0bbbdf6b43d | c5ab5cd1eeb1b312d643e3c311d056179d5fecb0 | ShutongZHENG/Traitement-d-Images-Numeriques | /sobel.cpp | C++ | cpp | 594 | no_license | #include <stdexcept>
/** @file
* Filtres de Sobel
**/
#include <cmath>
#include "sobel.h"
ImageGris intensiteH(ImageGris img) {
// Remplacer la ligne suivante par le code adéquat
throw runtime_error("Fonction intensiteH non implanté ligne 10");
}
ImageGris intensiteV(ImageGris img) {
// Remplacer la lig... |
7879ed1e707b70ca02d25db37b0ba2ff21abfd53 | cb504c55af9c8b7edc62c28ec4d3d4172db01c4f | Eduardo359/bitcoin-abc | /src/test/net_tests.cpp | C++ | cpp | 11,676 | permissive | // Copyright (c) 2012-2019 The Bitcoin Core developers
// Copyright (c) 2017-2019 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <net.h>
#include <addrdb.h>
#include <addrman.h>
#include <chainpa... |
9c37d5304c8627ed031a1884a42149e7694c5905 | b81f0a2839b1d3ba49ec9139baa749bc1fa62582 | isabella232/house-of-life-chromium | /chrome/browser/tabs/default_tab_handler.cc | C++ | cc | 7,021 | permissive | // Copyright (c) 2011 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 "base/metrics/nacl_histogram.h"
#include "chrome/browser/tabs/default_tab_handler.h"
#include "chrome/browser/tabs/tab_strip_model.h"
#includ... |
2d3c65cdefed552c82c44534b7857ae22740aa3b | 3a0e49d2f4e56d0f8b766c11fa64bd732d645fb8 | matbot/Simple-Cpp | /stackNqueue/intQueue.cpp | C++ | cpp | 1,243 | no_license |
#include "intQueue.hpp"
#include <iostream>
using std::cout;
using std::endl;
/****************
* Constructor
* ************/
IntQueue::IntQueue()
{
front = NULL;
back = NULL;
}
/***************
* Destructor
* ************/
IntQueue::~IntQueue()
{
clear();
}
/********************************************
* e... |
e1acbfe24225c3520de8d792630d40b92142e8a8 | bfafcf532e389b943da0628fde27a8f78fdf4db0 | de-passage/parsers.cpp | /include/parsers/description/as_range.hpp | C++ | hpp | 1,483 | permissive | #ifndef GUARD_PARSERS_DESCRIPTION_AS_STRING_VIEW_HPP
#define GUARD_PARSERS_DESCRIPTION_AS_STRING_VIEW_HPP
#include "../range.hpp"
#include "./modifiers.hpp"
#include "../interpreters/make_parser.hpp"
#include "../interpreters/range_parser.hpp"
namespace parsers::description {
template <class T>
struct as_range
:... |
65da14972a9b59d0dbde452b200182657a4df53b | 958e71aaa453742d73e3b86ffefa841cdc945489 | maeikei/xclang | /test/xclang-help.cpp | C++ | cpp | 15,207 | no_license | OVERVIEW: clang LLVM compiler
USAGE: clang [options] <inputs>
OPTIONS:
-### Print the commands to run for this compilation
-E Only run the preprocessor
-F <value> Add directory to framework include search path
-H Show header includes an... |
49833d616738fd3afafa6812ef101f4e69236f78 | 311cf8aed9e3fbea039687e56fb0c5b7b0bc1baf | zussel/hana | /test/detail/struct_macros.adapt.cpp | C++ | cpp | 1,795 | permissive | /*
@copyright Louis Dionne 2015
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*/
#include <boost/hana/concept/struct.hpp>
#include <boost/hana/assert.hpp>
#include <boost/hana/core/models.hpp>
#include <boost/hana/string.hpp>... |
903fd9e5989229af4e6a1de5ddd8ec9bdac0fa38 | 390209b8c75e48faa869f8ebc06db091c270ac12 | 15831944/LuGongDaCode | /Disturb/lib/dsp/Ols_filter.cpp | C++ | cpp | 3,412 | no_license | #include <dsp/Ols_filter.hpp>
#include <iostream>
#include <memory.h>
#include <stdlib.h>
#define MAX_MEM_SIZE 65536
namespace asp {
Ols_filter::Ols_filter(CDSignal &taps) {
_M = taps.size();
_N = GetOptimalFFTSize(_M);
_VL = _N - _M + 1;
std::cout << "M=" << _M << " N=" << _N <<... |
86ef96da28f544115a9ddce9153fd84082b82d93 | c51fda5224b97a954b99c436d216c891b7627591 | cms-sw/cmssw | /FWCore/ServiceRegistry/test/servicesmanager_t.cppunit.cc | C++ | cc | 7,761 | permissive | /*
* servicesmanager_t.cppunit.cc
* CMSSW
*
* Created by Chris Jones on 9/5/05.
*
*/
#include "FWCore/ServiceRegistry/interface/ServiceToken.h"
#include "FWCore/ServiceRegistry/interface/ServicesManager.h"
#include "FWCore/ServiceRegistry/interface/ActivityRegistry.h"
#include <cppunit/extensions/HelperMacros... |
b14c0891192d1013e1af3e5dde4f8ae73a9f75bf | 63eb168029dfdcc3abcdd66fbd7b4307bf787091 | BackupTheBerlios/conglomerate-svn | /trunk/ogreopcode/example/src/ogreOpcodeExampleApp.cpp | C++ | cpp | 17,308 | no_license | #include "ogreOpcodeExampleApp.h"
#include "NikkiDotscene.h"
using namespace nikkiloader;
//-------------------------------------------------------------------------------------
OgreOpcodeExampleApp::OgreOpcodeExampleApp(void)
: OgreOpcodeExample(),
mCollideContext(0),
mRobotCollObj(0),
mPlayAnimation(fal... |
ded70d03a1524944bc2f04d576cd36b287bc59fd | cfc67e93af6f87b6b856e6d5012220e629f9d669 | wakeup5/Learning-3D-Lesson | /D3DX9 basic/cGizmoManager.cpp | C++ | cpp | 8,362 | no_license | #include "StdAfx.h"
#include "cGizmoManager.h"
cGizmoManager::cGizmoManager(void)
{
}
cGizmoManager::~cGizmoManager(void)
{
}
HRESULT cGizmoManager::Init( LPDIRECT3DDEVICE9 pDevice )
{
m_pDevice = pDevice;
float intervalAngle = ( D3DX_PI * 2.0f ) / CIRCLEGIZMO_SEGMENTS;
//Circle 을 그리기 위한... |
37f55a8ba2a6f24ef172a7cca772b5fe91fa5cab | 420cdddee928654882a98f6fefcfbdbdb8f733d7 | ln0119/tensorflow-fast-rcnn | /tensorflow/core/kernels/aggregate_ops.cc | C++ | cc | 5,142 | permissive | /* Copyright 2015 Google Inc. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in ... |
0b205866289773eabd318baddd8602ff8616fd89 | 06afcae1a3530e206b3a2e26a6b9af98bb4219f2 | prutskov/omniscidb | /Tests/UpdelStorageTest.cpp | C++ | cpp | 45,214 | permissive | /*
* Copyright 2017 MapD Technologies, 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 o... |
963b3f58ad3f4604a9e00678789b78187ff811cb | a060a5043d388eb91c70aa616b8a35ec784e7b23 | reikdas/AlgoLab | /Assignment 3/test4.cpp | C++ | cpp | 698 | no_license | #include <iostream>
#include <vector>
int inf = 1;
int min(std::vector<int> &&arr)
{
int ans = arr[0];
for(int i = 1; i < arr.size(); i++)
if(ans > arr[i])
ans = arr[i];
return ans;
}
int find(std::vector<std::vector<int>> &arr, int m, int n)
{
if(m < 0 || n < 0)
return inf;
if(m == 0 && n == 0)
return ar... |
01e3a0bf33565472d3a517cd405217efdb17b5ee | 9a20de4ee081a036e42a2b57fcfce5f58275cebb | Congee/leetcode | /src/68.text-justification.cpp | C++ | cpp | 1,892 | no_license | #ifdef __LOCAL__
#include <leetcode.h>
#endif
class Solution {
vector<string> words;
public:
vector<string> fullJustify(vector<string>& __words, size_t maxWidth) {
words = std::move(__words);
int n = words.size();
// case we cannot evenly distribute words
// x__xx_x
//
// case words[i] ==... |
a46e350d50b0ad723c0888d1e014cf65cdbe0ed2 | 8e0df92a1aeb8d101b1d902aac0e582c9fe9c3f4 | xUhEngwAng/oj-problems | /thuoj/moocdsa1/train.cpp | C++ | cpp | 833 | no_license | //#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(){
int n, m;
scanf("%d %d", &n, &m);
int *input = new int[n];
int *output = new int[n];
int pr2input = -1, pr2output = 0, nr = 0, ix;
for (int ix = 0; ix != n; ++ix)
scanf("%d", &output[ix]);
bool *operation = new bool[2 * n]; //0 for push, 1 f... |
77ae5e075c6c973eba63323fb8d95a9eca3ba5bf | 602d840528b24b8a452d5acc5ee43e4db5be3b62 | bju2000/android_hardware_intel | /libcamerausb/PictureThread.cpp | C++ | cpp | 14,303 | no_license | /*
* Copyright (C) 2011 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
08bca9d702341cc38a7ed871e60fd989b9e8adec | 03fa2f68a329b71c0a35dfc49265e78e63b73766 | wavicom/wavi | /src/test/util_tests.cpp | C++ | cpp | 21,371 | permissive | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "util.h"
#include "clientversion.h"
#include "primitives/transaction.h"
#include "random.h"
#include "sync.h"
#incl... |
0cf00acf8ce7ac0abb334a2cd1339dffaad981fe | eb47549e7b7c2aae6722150457bc01836bfa28bb | e-thereal/capputils | /capputils/attributes/NotAttribute.cpp | C++ | cpp | 1,093 | no_license | /*
* NotAttribute.cpp
*
* Created on: Mar 6, 2014
* Author: tombr
*/
#include <capputils/attributes/NotAttribute.h>
#include <capputils/Verifier.h>
namespace capputils {
namespace attributes {
NotAttribute::NotAttribute(AttributeWrapper* first, const std::string& message)
: first(first->attribute), mes... |
c9f4b33b837ae0509f352a345878bc0a567f2d57 | 40384cfb27d5c0590f7deb69b8e7393ed9acd82e | longstl/mus12 | /_Library/_Include/boost/random/detail/seed.hpp | C++ | hpp | 5,204 | no_license | /* boost random/detail/seed.hpp header file
*
* Copyright Steven Watanabe 2009
* Distributed under the Boost Software License, Version 1.0. (See
* accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
* See http://www.boost.org for most recent version including documentation.
*
... |
3b957b7d4b161270a094010cbf0ab5f954b1ab7f | 301d70b5f499cd05368fed488d351240ad8ec0e0 | msrLi/portingSources | /ACE/ACE_wrappers/TAO/tao/AnyTypeCode/ExceptionA.cpp | C++ | cpp | 2,386 | permissive | // -*- C++ -*-
#include "tao/AnyTypeCode/ExceptionA.h"
#include "tao/AnyTypeCode/Any_Dual_Impl_T.h"
#include "tao/SystemException.h"
#include "tao/ORB_Constants.h"
#include "tao/CORBA_String.h"
#include "tao/CDR.h"
#include "tao/debug.h"
#include "ace/Malloc.h"
#include "ace/SString.h"
#include "ace/OS_NS_string.h"
#... |
a94df003f11f0ad3daeab2114227f6b86c5b347a | afb5b261e86e13ecad191ff9ea0d43de729fe41f | metux/chromium-suckless | /content/shell/common/layout_test/layout_test_messages.cc | C++ | cc | 1,116 | 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.
// Get basic type definitions.
#define IPC_MESSAGE_IMPL
#include "content/shell/common/layout_test/layout_test_messages.h"
// Generate constructors.
#inc... |
1191f23dfbc7309242da3da0e5169544487a219f | 086bd32c2763af6f4cd31c82b23610f1ec855ca6 | Olafyii/SJTU_OJ | /1015.cpp | C++ | cpp | 746 | no_license | #include <iostream>
#include <string.h>
using namespace std;
int main()
{
char a[302], b[302], res[606];
int sum[606] = {};
scanf("%s", &a);
scanf("%s", &b);
int lena = strlen(a), lenb = strlen(b), carry = 0, i, tmp;
for (int i = 0; i < lena; ++i)
for (int j = 0; j < lenb; ++j)
sum[i + j] += (a[lena - 1 - i... |
56d46cac1aa6d3c33e71d98b245f1e34217a60e0 | 10e0b50ba9878b7465c75d540c91cae81377e17d | 11im/algoritm_study | /7.20/1-2(leetcode 1921).cpp | C++ | cpp | 656 | no_license | // 7.20 1921. Eliminate Maximum Number of Monsters https://leetcode.com/contest/weekly-contest-248/problems/eliminate-maximum-number-of-monsters/
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int> dist;
vector<int> speed;
int count = 0;
priority_queue<int> PQ;
class Solution {
pu... |
3a97b250f831e912d53c1700d6c7d4daf3381038 | 385a71ec2434027afae6010857fc6ee776079be7 | rgbsky/widora-esp-air-v6-ble | /ESP32BleAdvertise.cpp | C++ | cpp | 4,454 | no_license | // Copyright 2015-2016 Espressif Systems (Shanghai) PTE LTD
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by app... |
9974749a2e8d3b01bbf412481627657b7152b0bf | 320a732f20d547063edaa42589b0e96c9b0ed483 | hexagonal-sun/mattuliser | /examples/polycurve/main.cpp | C++ | cpp | 3,371 | no_license | /****************************************
*
* main.cpp
* polycurve program entry point.
*
* This file is part of mattulizer.
*
* Copyright 2011 (c) Matthew Leach.
*
* Mattulizer is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* th... |
7df2e83c183e8309860010b83e41f9e31c6987fe | 47aecc18b5f32891e0004f1ba8d12020203118fe | bartokm/GbbMET | /analyzer/input/BTCalibrationStandalone.cpp | C++ | cpp | 19,394 | no_license | #include "BTCalibrationStandalone.h"
#include <iostream>
#include <exception>
#include <algorithm>
#include <sstream>
BTEntry::Parameters::Parameters(
OperatingPoint op,
std::string measurement_type,
std::string sys_type,
JetFlavor jf,
float eta_min,
float eta_max,
float pt_min,
float pt_max,
float ... |
7f2b266ff9ca7bf90f2742c4c3370849151d9354 | c434348528da71e075e34000c6bbcf1f2a6586d3 | freddyox/pong-dev | /include/Paddle.hh | C++ | hh | 1,145 | permissive | #ifndef PADDLE_HH
#define PADDLE_HH
//#include <SFML/Window.hpp>
#include <SFML/Graphics.hpp>
#include <string>
#include <map>
#include <vector>
class Paddle : public sf::Transformable, public sf::Drawable
{
private:
int displayx, displayy;
float mvelocity, mtime, posAcc, negAcc;
float Px, Py; // dimensions of ... |
9f455aad1628a72335c13dc4246002a5afd5bbee | 7fd1fc8e2630ca1f216fe83433ed0749ae8fef00 | bzquan/GherkinEditor | /TestModelForCPP/AbstractBDDTest.cpp | C++ | cpp | 2,486 | permissive | #include <locale>
#include "EventAggregator4BDDTest.h"
#include "StepParameters.h"
#include "StepParser.h"
#include "RegexSubstituter.h"
#include "AbstractBDDTest.h"
#include "UndefinedStepException.h"
using namespace bdd;
void AbstractBDDTest::SetUp(std::wstring feature_name)
{
EventAggregator4BDDTest::SetupEven... |
1f0db8163c271016650e3975f1cdad788ce59529 | e88755156070ffd4e5d847cf112e51682abc578a | YooHyeonJu/Win32API | /SocketClient/SocketClient/HttpClient.cpp | C++ | cpp | 3,510 | no_license | #include <windows.h>
#include <wininet.h>
#include <stdio.h>
LRESULT CALLBACK WndProc(HWND, UINT, WPARAM, LPARAM);
HINSTANCE g_hInst;
const char* lpszClass = "HttpClient";
int APIENTRY WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance
, LPSTR lpszCmdParam, int nCmdShow)
{
HWND hWnd;
MSG Message;
WNDCLASS WndCl... |
a618a12f0dd78a40fac667a180e745cc17d11072 | 108d8e7ff025e73f9d1cf5df9d1392d1282cc2de | jeperez/scout-win | /core-scout-win32/win_http.cpp | C++ | cpp | 10,049 | no_license | #include <Windows.h>
#include <Winhttp.h>
#include <stdio.h>
#include "win_http.h"
#include "api.h"
#undef _GLOBAL_VERSION_FUNCTIONS_
#include "version.h"
HINTERNET hGlobalInternet = 0;
HINTERNET hSession = 0;
HINTERNET hConnect = 0;
extern PDYNAMIC_WINHTTP dynamicWinHttp;
extern PDYNAMIC_WINSOCK dynamic... |
9ebddb9965a7261c4376104dccbde8802fc6ba5c | ebebe611304378f6e13fd157f2a0e28392f8ac06 | phartley1/df | /readfile.cpp | C++ | cpp | 215 | no_license | void readFiletoArray(string filename, int* data)
{
ifstream file1(filename);
file1.open(filename)
int i = 1;
while(!file1.eof())
{
file1 >> data[i];
i++;
}
file1.close();
return 0;
}
|
c0716f3ce10e35cd0c6384bd82c83bbbbbf1392c | 7dac9a559ba6c6baa95066ef6a41eae2a64e41a4 | javiroman/programming | /Erlang/Mesos/mdevilliers-erlang-mesos/c_src/scheduler_c_api.hpp | C++ | hpp | 2,555 | permissive | // -------------------------------------------------------------------
// Copyright (c) 2015 Mark deVilliers. All Rights Reserved.
//
// This file is provided to you 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 ... |
cdbe4fe76693a8389f7a15b551bbb53701df0afa | d45bf2ef4e84b37eccd748a4c6f38addc7e35ae8 | JackDanger/love | /src/modules/graphics/opengl/SpriteBatch.cpp | C++ | cpp | 2,716 | permissive | /**
* Copyright (c) 2006-2009 LOVE Development Team
*
* 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.
*
* Permission is granted to anyone to use this software for any purpose,
... |
c678710f9f1639782a2117564da4e16aa55086e0 | 2537224101566e36104a0c4ff1f3db24c6529979 | zhangquan0126/hot | /tests/idx/map-helpers-test/src/idx/maphelpers/STLLikeIndexTest.cpp | C++ | cpp | 2,727 | permissive | //
// Created by Robert Binna
//
#include <map>
#include <boost/test/unit_test.hpp>
#include <idx/contenthelpers/IdentityKeyExtractor.hpp>
#include <idx/maphelpers/STLLikeIndex.hpp>
namespace idx { namespace maphelpers {
BOOST_AUTO_TEST_SUITE(STLLikeIndexTest)
template<typename ValueType> void checkSearchResult... |
0546d76619a737a4c7714158bcf8a0acff184a66 | f4688ad83df33642e1ae086995e3151fa9d694e5 | ifsource/zerohourcash | /src/consensus/consensus.cpp | C++ | cpp | 978 | permissive | #include <consensus/consensus.h>
#include <primitives/transaction.h>
#include <policy/policy.h>
/** The maximum allowed size for a serialized block, in bytes (only for buffer size limits) */
unsigned int dgpMaxBlockSerSize = 8000000;
/** The maximum allowed weight for a block, see BIP 141 (network rule) */
unsigned in... |
bd02233077ee47c1509676d78661d7878527bdd7 | bc15051349bd367dec85b6141eaa2de7fadbbb63 | akashiitj/dsaprogram | /graph/cormen/prims pq.cpp | C++ | cpp | 2,622 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll mod= 1000000007;
//cout<<fixed<<setprecision(6)<<ans<<"\n";
#define frmlty int test_case;cin>>test_case;while(test_case--)
#define vi vector<int>
#define vs vector<string>
#define... |
a079cbf27d7a68f3bd755054f5d536991f0cc79c | 210bbb57fd5d3bd543320733a0cabd70ff09c28f | huangguojun/myvtk | /Cxx/IO/ImageWriter.cxx | C++ | cxx | 4,552 | no_license |
#include <vtkActor.h>
#include <vtkNamedColors.h>
#include <vtkPolyDataMapper.h>
#include <vtkProperty.h>
#include <vtkRenderWindow.h>
#include <vtkRenderWindowInteractor.h>
#include <vtkRenderer.h>
#include <vtkSmartPointer.h>
#include <vtkSphereSource.h>
#include <vtkBMPWriter.h>
#include <vtkImageWriter.h>
#includ... |
a3c74cdc8e67eddfcce411c6c2c3890c78a1edf4 | 0d1630409553b7356fd9c66563a0122caaf8244d | JackHaoyingZhou/Surgical_Scene_Reconstructor | /src/MyReconstr_Imagefunc.cpp | C++ | cpp | 18,949 | no_license | #include "myproject/MyReconstr_Imagefunc.h"
MyReconstr_Imagefunc::MyReconstr_Imagefunc()
{
this->sigma = DEFAULT_IMAGE_FUNC_SIGMA;
this->I2 = cv::Mat::eye(2,2, CV_32F);
this->I3 = cv::Mat::eye(3,3, CV_32F);
this->I4 = cv::Mat::eye(4,4, CV_32F);
this->epsilon = 0.000001;
this->pi = M_PI;
}
MyReconstr_Imagefunc... |
12f17d4977f530e0acc8f2690e5c033f0bdf26ff | 3edfca995fa44c912afdb63cddc98f62d8e8faa9 | nhutkhanhng/SocketWin32 | /TankClient/Src/Client.cpp | C++ | cpp | 1,611 | no_license | #include <TankClientPCH.h>
bool Client::StaticInit( )
{
// Create the Client pointer first because it initializes SDL
Client* client = new Client();
if( WindowManager::StaticInit() == false )
{
return false;
}
if( GraphicsDriver::StaticInit( WindowManager::sInstance->GetMainWindow() ) == false )
{
... |
d2a3ec79053b9a6f7719edb3c31d32b0add6bba6 | e02d962620911870f1ae7cc3bbc992cb92ae2bc0 | Jecklin/Uno_game_win32 | /CStateAdd.cpp | C++ | cpp | 299 | no_license | #include "CStateAdd.h"
CStateAdd::CStateAdd(FSM *fsm):CAbState(fsm)
{
;
}
void CStateAdd::onStateEnter()
{
;
}
void CStateAdd::onStateTick()
{
m_pfsm->curPlayerInCard();
m_pfsm->transState(m_pfsm->State_Wait);
}
void CStateAdd::onStateExit()
{
;
}
|
d763a3e29e4d22e0116b0cd7d68ff7e432cfee41 | 18d1f7d687412f1e0b5cfe944915bf7974640be6 | jcd1994/MatlabTools | /Compiled/blaze-3.2/blazetest/src/mathtest/dmatdmatmax/HDaLDb.cpp | C++ | cpp | 4,047 | permissive | //=================================================================================================
/*!
// \file src/mathtest/dmatdmatmax/HDaLDb.cpp
// \brief Source file for the HDaLDb dense matrix/dense matrix maximum math test
//
// Copyright (C) 2012-2017 Klaus Iglberger - All Rights Reserved
//
// This file is... |
b06161511cb4f831b94876845d6ca4a2fb3cfeb8 | 43ca99412a660abcb49d42889c80582594fe12e1 | LesleyWheat/Capstone-DogDrone | /Proof-of-Concept/Accel-Integrate/Arduino-side/main/input_9dof.cpp | C++ | cpp | 3,261 | no_license | #include <Wire.h>
#include <Adafruit_Sensor.h>
#include <Madgwick.h>
#include "arduino.h"
#include "input_9dof.h"
void dof::init(){
//Serial.begin(115200);
//while (!Serial) {
//; // wait for serial port to connect. Needed for native USB port only
//}
//Serial.println(F("Adafruit AHRS Fusion Examp... |
5c3a25e4e3dd77e0daa54a89919b8b9ccac77fd3 | a65281a260fbf9d0327906358d58e0a18bd1a943 | WhiteFeather27/tensorflow | /tensorflow/core/kernels/data/range_dataset_op.cc | C++ | cc | 10,794 | permissive | /* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
0a22e919b62a0e7d3e86c505bf13aa39cb84bae4 | 9af34921902f4bafcad1ca6e667972ff26127294 | Mmoke-Nape/photography_website | /windows/runner/main.cpp | C++ | cpp | 1,279 | no_license | #include <flutter/dart_project.h>
#include <flutter/flutter_view_controller.h>
#include <windows.h>
#include "flutter_window.h"
#include "utils.h"
int APIENTRY wWinMain(_In_ HINSTANCE instance, _In_opt_ HINSTANCE prev,
_In_ wchar_t *command_line, _In_ int show_command) {
// Attach to console w... |
099c89edea920d0ab40c291fc315f99caee607f5 | 41a7f062ca837521f14aec0e9e65c0f0b6414dbd | ahcox/stlab-experiments | /junk.cpp | C++ | cpp | 4,458 | no_license | //
// Created by Andrew Cox in 2017.
//
#if 0
// Stress test that background work is canceled when the transaction counter is changed:
for(int i = 0; i < 100; ++i)
{
auto futureTiles = async_tiled::mandelbrotAsyncTiled(-2, 1, 1.5001f, -1.4999f, 32, transaction, transaction, tileGridDims, spec, til... |
6640ca1a2d698ba08b8d62456c8299fbb43ca0e3 | ca555089318c0d79e011cf2763c07aac75ba97b4 | KristianI/XDNA | /src/net.cpp | C++ | cpp | 74,164 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2017-2020 The XDNA Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file ... |
9b50773dbb2b5dac351f65e9bbfa3aba623f3303 | d7fb7fb1b205793d57aa7a718543026479b88f72 | prasadheeramani/OpenCV-Workshop | /binary_image_trackbars.cpp | C++ | cpp | 965 | no_license | #include<opencv2/core/core.hpp>
#include<opencv2/highgui/highgui.hpp>
#include<opencv2/imgproc/imgproc.hpp>
using namespace std;
using namespace cv;
int main(int argc, char **argv){
Mat img;
img = imread(argv[1], CV_LOAD_IMAGE_COLOR);
Mat img1(img.rows, img.cols, CV_8UC1, Scalar(0));
cvtColor(img, img... |
349ea7587a4b58da34feb793ecc03783623ef86c | d2b1850678cda95c944282380c63d10b09f466cd | dnfwlq8054/coding_test | /programers/level2/Skill_Tree.cpp | C++ | cpp | 782 | no_license | #include <string>
#include <vector>
#include <algorithm>
#define ARPABAT 26
using namespace std;
int solution(string skill, vector<string> skill_trees) {
int answer = 0;
int arpabat[ARPABAT];
for(int i = 0; i < ARPABAT; i++)
arpabat[i] = -1;
for(int i = 0; i < skill.size(); i++){
int... |
233be419ea100e5e085e078d5dbfb7e3bc249528 | 6b63ad6d4a2272adc8344da8960b0e221a2d51ce | mojoe12/UVa | /formula1.cpp | C++ | cpp | 1,048 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[]) {
while (true) {
int nraces, npilots;
cin >> nraces >> npilots;
if (nraces == 0 && npilots == 0) break;
vector< vector<int> > results (nraces, vector<int> (npilots));
for (int i = 0; i < nraces; i... |
703599aa2326a769165bdc65bd79a9fcfd086529 | ad540132d38f55a75ee129d3f75c1468e5305077 | giordi91/machine-learning | /tests/src/matrix_transpose_tests.cpp | C++ | cpp | 742 | permissive | #include "test_utils.h"
#include <mg_ml/cpu/matrix_functions.h>
TEST(matrix_transpose, naive) {
std::vector<float> A;
std::vector<float> Aref;
std::vector<float> out;
A.reserve(1024*32);
Aref.reserve(32*1024);
out.resize(32*1024);
const std::string Arefpath{"tests/A_transposed_32_1024.txt"};
const s... |
a71bd1c5564b37dbabd9152142e6c44714c634b6 | 4095bbb7674a73d632949afaf8410d0ae3ca723e | ecshenryho/EPP | /Problem Solution/pointer and reference/FileWriting.cpp | C++ | cpp | 805 | no_license | //
// main.cpp
// FileWriting
//
// Created by Charles Bucher on 1/25/17.
// Copyright © 2017 Charles Bucher. All rights reserved.
//
// writing on a text file
#include <iostream>
#include <fstream>
using namespace std;
int main(void){
ifstream inFile;
ofstream outFile, dupFile;
outFile.open... |
f7493fbb54441fbe49162a38c4d701d48db8a317 | 3d631e2c4803dfa88704854a05887725cb93cea5 | TeoPaius/Projects | /c++/Diverse problems and algorithms/Ore particular/extra/14.01/14.01/autostrazi/autostrazi2.cpp | C++ | cpp | 1,226 | no_license | // Constantin Galatan
// Complexitate: O(N*K*S*S)
#include <vector>
#include <iterator>
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("autostrazi.in");
ofstream fout("autostrazi.out");
#define Mod 30011
using VI = vector<int>;
VI r;
vector<VI> G;
int N, K, S;
VI Df(int x, int fa... |
b45ba521276591a2cb306614d467185c0af016f3 | 9219ce4c4d113dbe0afd2a4d3267c3c59b2942e2 | Zixuan-QU/Leetcode | /Code/isInterleave.cpp | C++ | cpp | 632 | no_license | //DP
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
if(s3.size()!=s1.size()+s2.size()) return false;
vector<bool>f(s2.size()+1);
for(size_t j=0;j<s2.size()+1;j++){
if(s2.substr(0,j)==s3.substr(0,j)) f[j]=true;
else f[j]=false;
}... |
780020587e951f1eea2705f4d6146b6e4b75f2d0 | 43497346a6d8d5970268ce98d0b76002edb73aa7 | Zeks/douml | /genplugouts/sm/UmlBasePackage.cpp | C++ | cpp | 4,729 | no_license |
#include "UmlBasePackage.h"
#include "UmlPackage.h"
#include "UmlDiagram.h"
#include "MiscGlobalCmd.h"
#include "UmlCom.h"
////#include "Tools/ApiCmd.h"
#include "PackageGlobalCmd.h"
////#include "Tools/ApiCmd.h"
//Added by qt3to4:
#include <Q3CString>
UmlPackage * UmlBasePackage::create(UmlPackage * parent, const ch... |
11c73f27c2b7ac2e8793e297c8b732b83b17e677 | 35990d41c89989d33fd563d3e95c220c345e44bc | sngvahmed/Problem | /solving problem/greedy/Simple Molecules.cpp | C++ | cpp | 1,901 | no_license | #include <cstring>
#include <string.h>
#include <map>
#include <deque>
#include <queue>
#include <stack>
#include <sstream>
#include <bitset>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <ve... |
9e0408b79fa2c8925b3e43f71894958ac929ce81 | a3a2ca459f0894623f6d4c9ced0af5596247a3ce | Aaditya-Singh/Competitive-Coding | /largest_square.cpp | C++ | cpp | 1,308 | no_license | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
void print(vector<int>&A){
for(int i=0; i<A.size(); i++) cout << A[i] << " ";
cout << endl;
}
int level_max_side(int n, vector<int>&A){
int i=0, max_side=0; stack<int>S;
vector<int>sides(n, 0);
for(i=0; i<n; i++){
while(!S.e... |
7d2a29d6999fa7b523002118fc861bda5864bd33 | e5bedf86ae4c68f56fffdae627982c5f7e70eea6 | hello-world00/acmp | /Курсы/Решение олимпиадных задач/Теория графов - 1/Представление графа/D.cxx | C++ | cxx | 318 | no_license | #include <stdio.h>
int main()
{
int N, a;
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
int counter = 0;
for (int j = 0; j < N; j++)
{
scanf("%d", &a);
if (a)
counter++;
}
printf("%d ", counter);
}
return 0;
} |
19d12ddddb38e25ba4e3925acc8258846938248e | 369fcf6b882ec90b87e620d6ff9aa279a368d308 | operativeF/Kvasir | /Lib/Chip/Unknown/STMicro/STM32L063x/TIM21.hpp | C++ | hpp | 11,798 | permissive | #pragma once
#include <Register/Utility.hpp>
namespace Kvasir {
//General-purpose-timers
namespace Tim21Cr1{ ///<control register 1
using Addr = Register::Address<0x40010800,0xfffffc00,0x00000000,std::uint32_t>;
///Counter enable
constexpr Register::FieldLocation<Addr,Register::maskFromR... |
98116331c4869dffb522cb980182b55c08d8b931 | 86723192c2084576ee3e6f4208453c806942d15a | quabqi/behaviac | /test/btunittest/behaviac_generated/behaviors/generated_behaviors_7.cpp | C++ | cpp | 115,646 | permissive | #include "generated_behaviors_7.h"
namespace behaviac
{
// Source file: node_test/selector_loop_ut_3
class Action_bt_node_test_selector_loop_ut_3_node5 : public Action
{
public:
BEHAVIAC_DECLARE_DYNAMIC_TYPE(Action_bt_node_test_selector_loop_ut_3_node5, Action);
Action_bt_node_test_selector_loop_ut_3_node5()
... |
a85d20fec3b6076af9e8d9cd4f6eab4690595968 | 629f893587ff267f76b23e6d8878a22bc2454f5a | lkolt/corecvs | /core/kltflow/kltGenerator.cpp | C++ | cpp | 921 | no_license | /**
* \file kltGenerator.cpp
* \brief Add Comment Here
*
*
* \ingroup cppcorefiles
* \date Feb 23, 2010
* \author Rastorguev Alexei
* \author Alexander Pimenov
*/
#undef TRACE
#include "core/utils/global.h"
#include "core/math/mathUtils.h"
#include "core/buffers/mipmapPyramid.h"
#include "core/kltflow/kltGe... |
1912e909370cb50f1502f12d956df5d413c9312d | 8652fa10bba7de87135a6aaf0dca74411ba354d9 | psmaxwell/MLIA | /jsvm/svm-train.cpp | C++ | cpp | 2,346 | no_license | #include "svm.h"
using namespace std;
SvmParameter param;
void exit_with_help()
{
printf(
"Usage: svm-train [options] training_set_file [model_file]\n"
"options:\n"
"-t kernel_type : set type of kernel function (default 2)\n"
" 0 -- linear: u'*v\n"
" 1 -- polynomial: (gamma*u'*v + coef0)^degree\n"
... |
6f531c6dde6b7fa84eaeba4b074d9037d159106d | 2a4710b9db883fabf3b8b3b5f1fee6fed07464cf | rishisek/cinder-engine | /src/ikaruga/app/background_manager.cc | C++ | cc | 2,285 | no_license | //
// Created by rishi on 03-05-2021.
//
#include "ikaruga/app/background_manager.h"
#include <cinder/app/AppBase.h>
#include <cinder/Rand.h>
namespace ikaruga::app {
const ci::gl::Texture2dRef &BackgroundManager::GetOddBackground() {
static ci::gl::Texture2dRef bg_texture_odd =
ci::gl::Texture2d::create(loadI... |
4c0649dd9a41a414ba5f3683c6d346ae7462dc4e | 3a553c394ba19c5f4e6f634685d7980e118ca0f8 | UndarkAido/echo-bot-pretty | /main.cc | C++ | cc | 5,698 | permissive | #include <iostream>
#include <fstream>
#include <boost/asio.hpp>
#include <discordpp/bot.hh>
#include <discordpp/plugin-overload.hh>
#include <discordpp/rest-beast.hh>
#include <discordpp/websocket-beast.hh>
#include <discordpp/plugin-responder.hh>
#include <discordpp/plugin-pretty.hh>
namespace asio = boost::asio;
... |
c022a8b495657db1e1b9d97e12e47e835f4e09f6 | f59c5da6c9262ea0c72a756b1d47afe80c2ca6a8 | bkahlert/seqan-research | /raw/pmsb13/pmsb13-data-20130530/sources/6ndbc4zuiueuaiyv/2013-04-09T14-14-31.244+0200/sandbox/my_sandbox/apps/rev_com/rev_com.cpp | C++ | cpp | 1,094 | permissive | #include <seqan/sequence.h>
#include <seqan/basic.h>
#include <iostream>
#include <seqan/file.h>
#include <seqan/modifier.h>
using namespace seqan;
Dna getRevCompl(Dna const & nucleotide)
{
if(nucleotide == (Dna)'A')
return (Dna)'T';
if(nucleotide == (Dna)'T')
return (Dna)'A';
if(nucleotid... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.