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 |
|---|---|---|---|---|---|---|---|---|
ba2cbd0c62579282574322c99c48024b2c7b06db | 9eae302e28ba07f489608ea9e653307c3ffe9cbf | bitbd83/ndc | /src/qt/coincontroldialog.cpp | C++ | cpp | 30,957 | permissive | #include "coincontroldialog.h"
#include "ui_coincontroldialog.h"
#include "ndcbridge.h"
#include "init.h"
#include "bitcoinunits.h"
#include "walletmodel.h"
#include "addresstablemodel.h"
#include "optionsmodel.h"
#include "coincontrol.h"
#include <QApplication>
#include <QCheckBox>
#include <QClipboard>
#include <Q... |
50bcc09eb9e2c7dd735b5e61e3a3e5869319cf82 | 606945d55a44c4a95f982d6dba740316875600b5 | xuguocong/LeetCodeAnswer | /leetCodeProblem/T30.cpp | C++ | cpp | 2,028 | no_license | // 30. 串联所有单词的子串
// 给定一个字符串 s 和一些长度相同的单词 words。找出 s 中恰好可以由 words
// 中所有单词串联形成的子串的起始位置。
// 注意子串要与 words 中的单词完全匹配，中间不能有其他字符，但不需要考虑 words
// 中单词串联的顺序。
// 示例 1：
// 输入：
// s = "barfoothefoobarman",
// words = ["foo","bar"]
// 输出：[0,9]
// 解释：
// 从索引 0 和 9 开始的子串分别是 "barfoo" 和 "foobar" 。
// 输出的顺序不重要, [9,0] 也是有效答案。
// 示例... |
ed325f9433583172491eda1b200be6cc2e39572c | 56d1673df73079caa75c1a96e124dd95c2a7f12b | yanxiangrong/LampControl | /.pio/libdeps/nodemcuv2/ArduinoJson/src/ArduinoJson/Polyfills/type_traits/is_same.hpp | C++ | hpp | 435 | permissive | // ArduinoJson - https://arduinojson.org
// Copyright Benoit Blanchon 2014-2021
// MIT License
#pragma once
#include "integral_constant.hpp"
namespace ARDUINOJSON_NAMESPACE {
// A meta-function that returns true if types T and U are the same.
template<typename T, typename U>
struct is_same : false_type {
... |
463a3dd2e6a4d20b1ed059ed4a03d3cef90f42b7 | b76a70dfa991367a311f582ca1a41d032071c02c | sailfish009/binding_affinity_calculator | /lib/rosetta/source/src/protocols/denovo_design/components/NullPoseFolder.hh | C++ | hh | 1,956 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available
// (c) under license. The Rosetta software is developed by the co... |
dddc8734efd7510af60a83adc61d99044e35bc7b | 1c4b16c2f47374940d2ec4cc87d0247de4c26a16 | alexandreleroux/gdal | /gdal/ogr/ogrsf_frmts/pg/ogrpgtablelayer.cpp | C++ | cpp | 109,718 | permissive | /******************************************************************************
* $Id$
*
* Project: OpenGIS Simple Features Reference Implementation
* Purpose: Implements OGRPGTableLayer class, access to an existing table.
* Author: Frank Warmerdam, warmerdam@pobox.com
*
************************************... |
af505031d3c5223c639a45cee1cd277a7e4c8e10 | ac0a00c652faadf9c96f4e2c2b7f21158cb76817 | dlxj/doc | /lang/programming/directx/xp_dev/myastar/src/back/main.cpp | C++ | cpp | 13,324 | no_license | /*
NOTE: This code was written using Microsoft's Visual C++ v 6.0.
I don't know how well it will work with other compilers.
You also will need the Direct X 7.0 SDK, and to install the lib
and include files from the SDK to your C++ lib and include
folders. You can get the DirectX 7.0 SDK (large!) here:
http://d... |
6d664d57073356ec817bbe064ef725d742b623c8 | 6cc4a028a113b6d07133c348f9fb135c4114ac4a | jkuzm/2020repo | /Test1inRepo/Test1inRepo.cpp | C++ | cpp | 1,761 | no_license | // Test1inRepo.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include "Fraction.h"
#include <fstream>
using namespace std;
int main()
{
Fraction a(2, 3), b(5, 2), c(4, 3);
c = a * b;
c.print();
char str2file[] = "It\'s a test\nto write into file.";
ofs... |
241efc220fe057abd4659250f1a5342c5c8211dc | 693b484f6864f7ff9f94e9386c91c99302f4a495 | S2E/klee | /lib/Module/LowerSwitch.cpp | C++ | cpp | 5,002 | permissive | //===-- LowerSwitch.cpp - Eliminate Switch instructions -------------------===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===------------------------------------------------------... |
659ea62ae0fdb8219789c641b5aa2a863070f740 | 594fd34a564e0628253619e048f136bfca63b763 | xf6wang/ADT_Practice | /tictactoe.cpp | C++ | cpp | 5,215 | no_license | #include <iostream>
#define BOARD_LENGTH 3
extern void pretty_print(int board[]);
extern bool play(int board[]);
extern bool try_to_win(int b[]);
extern bool eliminate_threat(int b[]);
extern bool attack(int b[]);
extern bool claim_middle(int b[]);
extern int winner(int matrix[]);
extern void print_board(i... |
771563afd492891016068892adc3f6b8b343a1ab | 0d13bc9d55c99fcef7f453c559584dc4956805cf | SayYoungMan/BaekJoon_OJ_Solutions | /Codes/11047_Coin_0.cpp | C++ | cpp | 513 | no_license | #include <iostream>
#include <vector>
#define MAX_N 10
std::vector<int> coins (MAX_N + 5, 0);
int main() {
int n, k, ans = 0;
std::cin >> n >> k;
for(int i=0; i < n; i++) std::cin >> coins[i];
while (k > 0) {
int i = 0;
if (k >= coins[n-1]) i = n;
else {
while ... |
cb120431816e13ed531a318b4a7936720a4e7ca9 | 4c1c31219ff2f74fdfe932e4886a520df1d3ca89 | Tetheta/School-Work | /Programming Languages/Assignment4/Assignment4/Question4.cpp | C++ | cpp | 434 | no_license | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double x, y, z;
x = 4;
y = 21;
z = 100000000000000000.;
double xy = x + y;
double yz = y + z;
double sum1 = xy + z;
double sum2 = x + yz;
cout << setprecision(20) << sum1 << endl;
cout << setprecision(20) << sum2 << endl;
//Output:
/... |
27e47637d505f983cf695025cdc89df9bb85d435 | 22928e163b1d63f337aa60b0b7112ea0d12634d5 | rosoareslv/SED99 | /c++/imgui/2015/12/imgui_draw.cpp | C++ | cpp | 102,950 | no_license | // dear imgui, v1.48 WIP
// (drawing and font code)
// Contains implementation for
// - ImDrawList
// - ImDrawData
// - ImFontAtlas
// - ImFont
// - Default font data
#if defined(_MSC_VER) && !defined(_CRT_SECURE_NO_WARNINGS)
#define _CRT_SECURE_NO_WARNINGS
#endif
#include "imgui.h"
#define IMGUI_DEFINE_MATH_OPERATO... |
032f100514807ee32b2a653d3a50a80f4a2f9a3f | f3d602f4670c1c14f5cea4b39a6e25aded12c989 | arulagrawal/leetcode_may_2020 | /week4/day7_counting_bits/solve.cpp | C++ | cpp | 505 | no_license | class Solution {
public:
vector<int> countBits(int num) {
vector<int> ans(num + 1, 0);
if (!num)
return ans;
int groups = log2(num) + 1;
int n = 1;
for (int i = 0; i < groups; i++) {
int groupsize = pow(2, i);
for (int j = 0; j < group... |
e338d36e670529d6c6d784d2c2ae7ae9a9a527c5 | 29af68c017f17bb7b4a12c411cbc08112c960b3d | j-tamad/Gridcoin-Research | /src/script.cpp | C++ | cpp | 71,063 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <boost/foreach.hpp>
#include <boost/tuple/tuple.hpp>
#include <boost/tupl... |
2772fad21bcc35b0310a6b7c303f4c84c9dd046d | 5e04a5397fc85d7213a06319cacaad42510af6f9 | ArchSirius/log1000 | /tp5/SpaceMissionSimulator/tests/TestSpaceObjectFactory.cpp | C++ | cpp | 987 | no_license | /*
* File: TestSpaceObjectFactory.cpp
* Author: begooden
*
* Created on Nov 22, 2014, 7:58:02 PM
*/
#include "TestSpaceObjectFactory.h"
#include "../SpaceObjectFactory.h"
CPPUNIT_TEST_SUITE_REGISTRATION(TestSpaceObjectFactory);
TestSpaceObjectFactory::TestSpaceObjectFactory() {
}
TestSpaceObjectFactory::~Te... |
997eda59dc10d2ddf1e39dd85a0b855dcf16b4d2 | 7139e7266554ee1a499f5818fc4753df5cd90a92 | YChuan1115/mrpt | /libs/io/src/CFileGZInputStream.cpp | C++ | cpp | 2,946 | permissive | /* +------------------------------------------------------------------------+
| Mobile Robot Programming Toolkit (MRPT) |
| https://www.mrpt.org/ |
| |
| Cop... |
84ff9f4d51b2c7332317b6718295de0d61c8e798 | 61b94e060459c02aaf9db72aecbccb10a8cf43c7 | egranata/puppy | /tests/statdir/test.cpp | C++ | cpp | 2,009 | permissive | /*
* Copyright 2018 Google LLC
*
* 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 ... |
4823b21a741a6a2494636f13b66d52eb48a71410 | 6b72471c70c98406fe370e3e318dc2b0f7bbe6da | laurentlb/envoy | /test/integration/integration_test.cc | C++ | cc | 51,575 | permissive | #include "test/integration/integration_test.h"
#include <string>
#include "envoy/config/bootstrap/v3alpha/bootstrap.pb.h"
#include "envoy/config/route/v3alpha/route_components.pb.h"
#include "envoy/extensions/filters/network/http_connection_manager/v3alpha/http_connection_manager.pb.h"
#include "common/http/header_m... |
bdbc9819112aad9b2743d5678bcbd0f27b17dc0e | 681baf7a52cacfcf1dc950ae36a4be8bca91a1d3 | pbuttler/Vixen | /source/vcore/vix_enumutil.cpp | C++ | cpp | 1,159 | permissive | /*
The MIT License(MIT)
Copyright(c) 2014 Matt Guerrette
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, me... |
158c28a33ec02dafb8767be9d346503aa2773f85 | 08132f4aef52e99cf6b447273dc82cffa2c32078 | xeddmc/NoahGameFrame | /NFMidWare/NFItemBagPlugin/NFCItemCardConsumeProcessModule.cpp | C++ | cpp | 3,728 | permissive | // -------------------------------------------------------------------------
// @FileName : NFCItemCardConsumeProcessModule.cpp
// @Author : LvSheng.Huang
// @Date : 2013-10-02
// @Module : NFCCardItemConsumeProcessModule
// ----------------------------------------... |
bf8bfed00b758ecc90c8b0f00e65bacbcc07e5f5 | 883e0ced93715a6d50d82ce15372cc924d185130 | Shasthojoy/zircon | /kernel/syscalls/syscalls_vmar.cpp | C++ | cpp | 7,128 | permissive | // Copyright 2016 The Fuchsia Authors
//
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file or at
// https://opensource.org/licenses/MIT
#include <err.h>
#include <inttypes.h>
#include <trace.h>
#include <vm/vm_object.h>
#include <vm/vm_address_region.h>
#include <... |
d14aebd798a374ac4685df9c178165e1aea493ba | fee31ac9c3f154c477f3fc44587d3d16451d9dea | Nati-Ryuon/Shooters | /Shooters!/Vec2.cpp | C++ | cpp | 820 | no_license | #include "Vec2.h"
#include <math.h>
Vec2 operator+(const Vec2 & v1, const Vec2 & v2){
Vec2 v;
v.x = v1.x + v2.x;
v.y = v1.y + v2.y;
return v;
}
Vec2 operator-(const Vec2 & v1, const Vec2 & v2){
Vec2 v;
v.x = v1.x - v2.x;
v.y = v1.y - v2.y;
return v;
}
Vec2 operator*(const double d, const Vec2 & v1){
Vec2 v;... |
5fa5b6c183e6b78d1151d1940b7bab966c40f1e3 | ce8a583cbf6101817fe3d36b8abc62afc974aebc | tphong171/digital_image_processing | /Sources/18127051/18127051/ColorTransformer.cpp | C++ | cpp | 21,708 | no_license | #include "ColorTransformer.h"
#include <iostream>
using namespace std;
ColorTransformer::ColorTransformer()
{
// Constructor //
}
ColorTransformer::~ColorTransformer()
{
// Destructor //
}
// Hàm chuẩn hóa giá trị độ xám trong đoạn [0, 255] //
int validColorCode(int value)
{
if (value > 255) value = 255; // Nếu l... |
ddab16bd5a1c72ae9dc90e8ace423d40cd3760a7 | 568aefa933604e6d141705117a4f0687a909abdf | SCell555/hl2-asw-port | /src/game/server/hl2/weapon_shotgun.cpp | C++ | cpp | 22,516 | permissive | //========= Copyright © 1996-2005, Valve Corporation, All rights reserved. ============//
//
// Purpose: A shotgun.
//
// Primary attack: single barrel shot.
// Secondary attack: double barrel shot.
//
//=============================================================================//
#include "cbase.h"
#include "NP... |
ce521643c0d0b36902f9d27a35dc03d04a8dab13 | e1e165c8166e24ff248d149c4eb9db0f84a48ecd | kashif/CMake | /Source/cmGlobalNinjaGenerator.cxx | C++ | cxx | 65,924 | permissive | /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
file Copyright.txt or https://cmake.org/licensing for details. */
#include "cmGlobalNinjaGenerator.h"
#include "cm_jsoncpp_reader.h"
#include "cm_jsoncpp_value.h"
#include "cm_jsoncpp_writer.h"
#include "cmsys/FStream.hxx"
#include <algo... |
0914fa2a6285951aed7ad95d80d08181ca5a42c2 | 45f571fe40beb63773411273cdb2511edd25a8e3 | nbutacm/NBUTACM | /2019级/[标程]Div2 2019下半学期周赛(一)/G-贪心.cpp | C++ | cpp | 465 | no_license | #include <bits/stdc++.h>
#define ll long long
const int mod=1e9+7;
const int maxn=5e5+5;
using namespace std;
ll a,n,m,mi=0x3f3f3f3f,dp[maxn];
int main()
{
cin>>n>>m;
dp[0]=1;
for(int i=1;i<=n;i++){
cin>>a;
for(int j=m;j>=0;j--){
if(dp[j]==1){
dp[j+a]=1;
... |
557e05440d69f3b8ee51b64ec686e1037574aceb | fbcfff53e16abad7bf35c9fbd1defad11d129762 | devmentality/cpp-ft201-2019 | /Task 4/tsepov_artyom.cpp | C++ | cpp | 4,952 | no_license | #pragma comment(linker, "/STACK:16777216")
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <unordered_map>
#include <cmath>
#include <iterator>
#include <stack>
#include <bitset>
#include <unordered_set>... |
e194334c81b0b9ffec4150b0cf4b8919b368ea7b | eb2431e7b3bc2a55ae5a71b5c98dcf14e069e138 | gunner14/old_rr_code | /main_project/socialgraph/BirthdayRecommend/BirthdayRecommendCache/src/BirthdayRecommendCacheI.cpp | C++ | cpp | 5,671 | no_license | #include "BirthdayRecommendCacheI.h"
#include "ReplicaCluster/ServerState/src/client/cxx/ServerStateSubscriber.h"
using namespace xce::socialgraph;
using namespace xce::serverstate;
using namespace com::xiaonei::xce;
using namespace MyUtil;
using namespace xce::helper;
void MyUtil::initialize() {
ServiceI& service ... |
b1c8976f9ebfe01a056cba88181f9584fe71c93e | 601471091a3c52e0e07b94db179440ffd5b33c4f | lordstone/leetcode-Remove-Linked-List-Elements | /main.cpp | C++ | cpp | 703 | no_license | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(head == NULL) return NULL;
ListNode* tmp = new ListNode(0);
... |
3adf0b0a1f95bdf4b10dac1fb779313733caae86 | 014d6e4b32db5d4523aa183b2536e26bde382947 | flaviendelangle/PSTTango | /TangoDepthMap/app/src/main/cpp/camera_texture_drawable.cc | C++ | cc | 5,881 | no_license | /*
* Copyright 2014 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 applic... |
5cabda28c8c3604713517a2cd3127f90a4220963 | 708fb0a2f078550f14babc1b36dbdce4e1201b1a | LucasEBSkora/analisador-lexico-sintatico-POO | /include/ProcessadorTexto.hpp | C++ | hpp | 221 | no_license | #ifndef _PROCESSADOR_TEXTO_HPP_
#define _PROCESSADOR_TEXTO_HPP_
#include <fstream>
class ProcessadorTexto
{
private:
std::ifstream fonte;
public:
ProcessadorTexto(const char *caminho);
int executar();
};
#endif |
26e80d71a0d03e7e80358824bec22d6814094c2a | 6f2409574c384b05030701ed981a8c904b4a41eb | cassubian/detkcoin | /src/qt/bitcoingui.cpp | C++ | cpp | 30,114 | permissive | // Copyright (c) 2011-2013 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <QApplication>
#include "bitcoingui.h"
#include "transactiontablemodel.h"
#include "optionsdialog.h"
#include "abou... |
30d18a456eea8492bab8a5fd36b31c40fc832feb | 2c27cccaffd86e3cb30c052eef2e10027a30df95 | 0xF6/openvino | /inference-engine/tests/functional/plugin/gna/shared_tests_instances/behavior/cpp_holders.cpp | C++ | cpp | 728 | permissive | // Copyright (C) 2018-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include "behavior/cpp_holders.hpp"
using namespace BehaviorTestsDefinitions;
namespace {
const std::vector<std::vector<int >> orders = {
// 0 - plugin
// 1 - executable_network
// 2 - infer_... |
ac18e60d07730d1c085e69c2bf130e421e4e67c0 | 8f900f079092d49086188348ac6ad7dc26c3aacf | mvu/jugendprojekt | /Programme/JugendControllPanel/einstellunghauptlicht.cpp | C++ | cpp | 6,880 | no_license | #include "einstellunghauptlicht.h"
#include "ui_einstellunghauptlicht.h"
#define SlinderarduinoEnable false
//QThread cThread;
//Thread cObject;
EinstellungHauptlicht::EinstellungHauptlicht(QWidget *parent, steuerungThreadLicht *s, ModelThreadLicht *m) :
QDialog(parent),
ui(new Ui::EinstellungHauptlicht)
{
... |
8d996fa66cdae9846a1e6304bf73b11f80cd08e2 | 07cb22b16bb8a19ca7260004fb7c747ba8b769f2 | kushalraut40/cpp | /p_3_swap.cpp | C++ | cpp | 311 | no_license | //Program No. 3: Swap Two Numbers
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int a,b;
cout<<"\nEnter two numbers : ";
cin>>a>>b;
a=a+b;
b=a-b;
a=a-b;
cout<<"\nAfter swapping numbers are : ";
cout<<"\n First Number is "<<a;
cout<<"\n Second Number is "<<b;
return 0;
} |
4ec00b0f2bbb549d54f50a5aee22bf119f9b22a1 | cc2598d478c3cdbf4658e49f9b9cb91696f98c6f | MatrixHan/FK2DEngine2 | /FK2DEngine2/Source/Controls/FKMenuStrip.cpp | C++ | cpp | 1,208 | no_license | /**
* created: 2013-4-12 17:32
* filename: FKMenuStrip
* author: FreeKnight
* Copyright (C):
* purpose:
*/
//------------------------------------------------------------------------
#include "../../FK2DEngine2.h"
#include "../../Include/Controls/FKMenuStrip.h"
#include "../../Include/FKSkin.h"
//------------... |
c804d13695830025371e9cf800b1295919cd4c57 | 8af7a62cb2229b927764686d8a7dc9b5b2960c65 | igoroogle/codeforces | /div485/ZAD_Ediv1.cpp | C++ | cpp | 3,140 | no_license | #include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int DL = 1E7 + 3;
const int LEN = 100010;
const ll MOD = 1E9 + 7;
int parent[LEN];
ll ans[LEN], minDiv[DL], cnt[DL], a[LEN];
int color[LEN];
vector<int> g[LEN], askInd[LEN], askVal[LEN];
vector<ll> as... |
c493a6da8d95196939cb46894fff35ca5e7bafac | 4974ac3c744c0897dcf6751336c9634cd747e4ce | Shaman05/webkit | /Source/WebKit2/Shared/CoordinatedGraphics/threadedcompositor/ThreadedCompositor.cpp | C++ | cpp | 15,226 | no_license | /*
* Copyright (C) 2014 Igalia S.L.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following dis... |
7f50893dd328dc4c1f9571b022e6d390d33e27de | e8d2e00cf4658416f7dc01ce0f8892a739c11d09 | EmilWine/tensorflow | /tensorflow/core/kernels/linalg_ops_common.cc | C++ | cc | 11,416 | permissive | /* Copyright 2015 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... |
36e355198350b9b4255b626b5b416238d9080406 | a4145765b1b0310eb278e52956a0aca63cb6ba86 | Minssc/BJA | /old/9205.cpp | C++ | cpp | 959 | no_license | #include<iostream>
#include<queue>
#include<cstring>
using namespace std;
struct point{
int r,c;
int dist(const point &t){
return (abs(r-t.r)+abs(c-t.c));
}
bool operator==(const point &t) const{
return r==t.r&&c==t.c;
}
};
point D[101];
bool V[101];
point HOME,TARG;
vo... |
5df5e0ba0da2f2a251a9fac6213ea2e542c78776 | 6d9109c9209a653ed31e1d8529e8044c65c5bfd1 | Fifthrow/quickfix | /src/C++/MySQLLog.cpp | C++ | cpp | 7,782 | permissive | /****************************************************************************
** Copyright (c) 2001-2014
**
** This file is part of the QuickFIX FIX Engine
**
** This file may be distributed under the terms of the quickfixengine.org
** license as defined by quickfixengine.org and appearing in the file
** LICENSE includ... |
0fe9d43d431d4fbf03207b61e4885b40eb0fa52e | 0b8e0acc8f3b634a4bbc0ab1dfbbe92e4dfddca0 | tcOops/Wiki | /campusRecuirt/problem/Nowcoder/ClassicProb1/A.cpp | C++ | cpp | 879 | no_license | //https://www.nowcoder.com/question/next?pid=425653&qid=25285&tid=7720276
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
const int N = 20;
vector<int> g[N];
int sta[1<<N];
class FoldPaper {
public:
vector<string> foldPaper(int n) {
vector<str... |
6e9ff507474e7f060fdc9ee3d4c32519d4c3c62a | a7801c46aec4a789493793f4901a7ec56164d2f8 | cpausmit/MitEdm | /VertexFitInterface/src/TrackParameters.cc | C++ | cc | 7,378 | no_license | // $Id: TrackParameters.cc,v 1.2 2008/09/27 05:48:26 loizides Exp $
#include "MitEdm/VertexFitInterface/interface/TrackParameters.h"
#include "TMath.h"
#include "MitEdm/DataFormats/interface/Types.h"
#include "MagneticField/Engine/interface/MagneticField.h"
using namespace std;
using namespace TMath;
using namespace ... |
cbe176e9030201e3a671e3f5774fb6f937529732 | b77f3a807968459087185fff57353b4865c83dfa | andyvip/libcxxabi | /src/cxa_exception.cpp | C++ | cpp | 31,338 | permissive | //===------------------------- cxa_exception.cpp --------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//
// This file implements the "Exception ... |
a34707209edf100fda7dc3a0ed06f28b59d6280e | 8723e7043f8ec65d092861efd1e7fc15c98714da | MatthieuMv/openZia | /openZia/ByteArray.hpp | C++ | hpp | 275 | permissive | /*
** EPITECH PROJECT, 2020
** CPP_zia_2019
** File description:
** ByteArray
*/
#pragma once
#include <cinttypes>
#include <vector>
namespace oZ
{
/**
* @brief Simple vector of byte used as network buffer
*/
using ByteArray = std::vector<std::int8_t>;
} |
1e6ef096596a74609ee5b282f11882b9320aa2cd | 1737330c1d9fd42491a0078fc52595b04fd0d3e8 | ryomakawakami/FEHRobot | /Archive/2019-03-20_19-42-41 Some fixes/main.cpp | C++ | cpp | 18,054 | no_license | #include <FEHLCD.h>
#include <FEHIO.h>
#include <FEHUtility.h>
#include <FEHMotor.h>
#include <FEHServo.h>
#include <FEHAccel.h>
#include "pidlib.h"
#define MIN_SPEED 8
#define MIN_SPEED_TURNING 12
#define MIN_SPEED_SWEEP 12
#define MAX_SPEED 80
#define MAX_STEP 7 // Max change per iteration
#define LOOP_TIME 0.020... |
238576c239c9f2b6287c8f179a6ecea0b1d63740 | 06fb2de76245d20e3e65f3bae7baee2df76e23a2 | dheerajkhatri/bajinga | /leetcode/removeValinList.cpp | C++ | cpp | 1,276 | no_license | #include <bits/stdc++.h>
using namespace std;
struct ListNode{
int val;
ListNode* next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
if(head==NULL)return head;
if(head->next==NULL){
if(head->val==val)return NULL;
... |
532348782ecaf112c68e7157e0ec6ce68b605524 | 88aabf27c0339ebbefccef5f458b794aa3779c28 | beauby/folly | /folly/io/async/AsyncSSLSocket.cpp | C++ | cpp | 67,281 | permissive | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* 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 applic... |
f38ee161cd00fa96ea9ce0eae4d484bc62b30742 | 480fc9d3da438294e0b6584fe38c5dd2ab4cf36e | vonschwartzwalder/iProcessor | /script.cpp | C++ | cpp | 7,990 | no_license | // ---------------------------------------------------------------------
// script
//
// stack based language parser for using image processor
// variable declaration using def or operator =
// variable type is determined by content
// several mathematic operators defined (+,-,/,*,^,%)
// several mathematic functions d... |
700edfcb962efadfaa7ddc6afeae27a4b74ef362 | 02a3ef5ce15a0c93346c31adccc29822eb28a4cc | amitray1608/PCcodes | /atcoder/ABC193/B.cpp | C++ | cpp | 640 | no_license |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<array<int, 3>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
int price = INT_MAX;
for (int i = 0; i < n; i++) {
if ((double)(a[i][2]) > (double)(0.5 + a[i][0])) {
price = min... |
1370d9619a9ffa9273da22cc0230d835e2f4162b | 92d48b99e2d5042c8fd54840a68430908677a6cb | Ronny-22-Code/C-Plus-Plus-Programming-Codes | /Sum.cpp | C++ | cpp | 350 | no_license | //This program is to provide the sum of multiple of 3 and 5.
#include<iostream>
using namespace std;
int main()
{
int n,i,s=0;
cout<<"Enter the value of n:";
cin>>n;
for(i=1;i<=n;i++)
{
if((i%3==0)||(i%5==0))
{
s=s+i;
}
}
cout<<"The Sum of numbers is... |
730c1595a4b6b69b912198f4b0e51d049896733a | d2082c692a444111bfef33fb848d95f62031b271 | Gaffey/caffe_deploy | /src/caffe/layers/cudnn_lcn_layer.cpp | C++ | cpp | 3,401 | permissive | #ifdef USE_CUDNN
#include <vector>
#include "caffe/layers/cudnn_lcn_layer.hpp"
namespace caffe {
template <typename Dtype>
void CuDNNLCNLayer<Dtype>::LayerSetUp(const vector<Blob<Dtype>*>& bottom,
const vector<Blob<Dtype>*>& top) {
LRNLayer<Dtype>::LayerSetUp(bottom, top);
CUDNN_CHECK(cudnnCreateLRNDescript... |
0a44299e5661013b9b9903ec6ad0b77400c8ebdd | cf41c6101beedcf5c94f445696909c6a91752f1a | liux0229/cppcompiler | /final/tests-pa9/extras/400-integer-calculator-test-data-generator.cpp | C++ | cpp | 2,351 | no_license | #include <vector>
#include <random>
#include <iostream>
#include <sstream>
#include <stdexcept>
#include <algorithm>
using namespace std;
vector<string> opcodes = { "+", "-", "*", "/", "%", "==", "!=", "<", ">", "<=", ">=" };
vector<string> sizes = { "s1", "s2", "s4", "s8", "u1", "u2", "u4", "u8" };
unsigned long i... |
71fea4ad9412b3eafbb46702eed81f116abcc82d | f00b7bc2e632914e63f96b3636c8f3f8bd23570f | Sircrab/RayTracer | /main.cpp | C++ | cpp | 679 | no_license | #include <iostream>
#include "SceneParams.h"
#include "RenderParams.h"
#include "Renderer.h"
#include "Parser.h"
#include <time.h>
#include <stdlib.h>
int main(int argc, char* argv[]) {
srand(time(NULL));
auto renderParams = Parser::parse_params(argc, argv);
auto sceneMaterials = Parser::parse_materials(renderPa... |
7e5ac559bcdbdd8b19b65cb836c4a05e5f44b97b | 435b531105b1bcbb2bc66f2d2b301ba3b40baccc | peterhuene/puppetcpp | /lib/src/runtime/types/catalog_entry.cc | C++ | cc | 1,608 | permissive | #include <puppet/runtime/values/value.hpp>
#include <puppet/cast.hpp>
#include <boost/functional/hash.hpp>
using namespace std;
namespace puppet { namespace runtime { namespace types {
char const* catalog_entry::name()
{
return "CatalogEntry";
}
values::type catalog_entry::generalize() const... |
c459d401d426158f2958050eff9b57c4e5893a52 | f2b94a941e5b3cedd0f644c1b6b947160eee1927 | jstraco/ComS327 | /rlg327-s2021-1.05/npc.hpp | C++ | hpp | 1,829 | no_license | #ifndef NPC_H
# define NPC_H
# include <stdint.h>
# include "dims.hpp"
# define NPC_SMART 0x00000001
# define NPC_TELEPATH 0x00000002
# define NPC_TUNNEL 0x00000004
# define NPC_ERRATIC 0x00000008
# define NPC_BIT04 0x00000010
# define NPC_BIT05 0x00000020
# define NPC_BIT06... |
52f4d44169a952f0a24e9f6d2e634c3a27423845 | 3dc181a6780b16d7eb23bcca5dc79fd276966781 | MashoujiangPlusAI/openvino | /inference-engine/tests/functional/shared_test_classes/src/single_layer/lrn.cpp | C++ | cpp | 2,339 | permissive | // Copyright (C) 2018-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#include "shared_test_classes/single_layer/lrn.hpp"
namespace LayerTestsDefinitions {
std::string LrnLayerTest::getTestCaseName(const testing::TestParamInfo<lrnLayerTestParamsSet>& obj) {
double alpha, beta, bias;
size_t s... |
ddb56ac26fa0b36f91301ebca3c9a41ab341d88e | cf6d87e84f6fa50ae7468826eadf2ef884595cbf | junghyun87/jumping-into-cpp | /cpp_programming/ch5.hpp | C++ | hpp | 214 | no_license | //
// ch5.hpp
// cpp_programming
//
// Created by Junghyun Kwon on 1/7/16.
// Copyright © 2016 Junghyun Kwon. All rights reserved.
//
#ifndef ch5_hpp
#define ch5_hpp
#include <stdio.h>
#endif /* ch5_hpp */
|
008b6c4044dba1e6819981ee3c3f61a0a3895ed5 | bc13d837e3013b1e68abb04456996720ffbd30ff | SitadziMado/Olymp2018 | /Olymp/Utility.cpp | C++ | cpp | 1,051 | no_license | #include "Utility.h"
#include <locale>
#include <sstream>
#include <unordered_set>
#include <cctype>
std::string trim(const std::string& string)
{
std::string rv;
auto front = string.cbegin();
while (front != string.cend() && std::isspace(*front))
{
++front;
}
if (front == string.cend())
{
rv = std::st... |
c27aef2be8ff5c0866091f4927f4916ba367270d | 599c05376b61de5e241ac6ce856711aee447ffbf | neerajdas/boolberry | /src/miner/simpleminer.cpp | C++ | cpp | 22,764 | no_license | // Copyright (c) 2012-2013 The Cryptonote developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "common/command_line.h"
#include "misc_log_ex.h"
#include "simpleminer.h"
#include "target_helper.h"
#include "ne... |
96831e8ec18ad3f4fba2f24eebf22e5d5813491e | 386399e8748138558db3305f426cfe28a31caccf | KratosMultiphysics/Kratos | /applications/MeshMovingApplication/custom_utilities/mesh_velocity_calculation.cpp | C++ | cpp | 4,515 | permissive | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license:
// kratos/license.txt
//
// Main authors: Philipp Bucher
//
// System includes
// Exte... |
f406aef23bec3fd2a1e0e29e1d8089b870577551 | 100fba91ce104a10d42c76fd955c2b3181926dda | rverma510/a2oj | /1_Codeforces_Rating_Less_than_1300/Airport.cpp | C++ | cpp | 707 | no_license | #include<bits/stdc++.h>
using namespace std;
int main(){
priority_queue<int> maxPQ;
priority_queue<int, vector<int>, greater<int>> minPQ;
int i, n, m, mn = 0, mx = 0;
cin>>n>>m;
for(int i=0;i<m;i++){
int temp;
cin>>temp;
maxPQ.push(temp);
minPQ.push(temp);
}
i... |
3f16c5a70eca50c7ad427c1c74092abf64a476cb | 03356e6bfc1b463c95ecb54a5f57f910477893c3 | PennyBlack2008/WebservNote | /99_연습폴더/01_연습3번/srcs/server/Server.cpp | C++ | cpp | 2,569 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Server.cpp :+: :+: :+: ... |
204f60bc9f5436e43f47f63acd47bb63dae6630d | a6ae07042bf92281fe3c47a9388ac9c7e2f83f4a | yanhuashengdian/chrome_browser | /third_party/blink/renderer/core/html/image_document.cc | C++ | cc | 21,116 | permissive | /*
* Copyright (C) 2006, 2007, 2008, 2010 Apple 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this li... |
6d71d113f78e9c8dbad3acba3e649ba26c4bf380 | 23776aad32a860b6367744a52476373a641c0fff | balles333333/darkcoin | /src/init.cpp | C++ | cpp | 50,387 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "txdb.h"
#include "walletdb.h"
#include "bitcoinrpc.h"
#include "net.h"
#... |
a09f16f52d84e99a2a6a9d4fe42e2a62973d0401 | 9eb813cd2184784511c04164e2a7df0f55cc1aec | iiison/technical-interview-prep | /LeetCode/Smallest-Integer-Divisible-By-K.cpp | C++ | cpp | 749 | no_license | /* Given a positive integer K, you need find the smallest positive integer N such that N is divisible by K, and N only contains the digit 1.
Return the length of N. If there is no such N, return -1.
Example 1:
Input: 1
Output: 1
Explanation: The smallest answer is N = 1, which has length 1.
Example 2:
Input: 2
Outp... |
4b4f2edc3f5267abcd209b022d7bd75df0730c1d | 53283ad44fec46640024e722cc5395d646e80f3e | iPatulea/data.structures.homework1 | /tema1.cc | C++ | cc | 4,767 | no_license | /*Ionut Patulea
313CA*/
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include "stack.h"
#include "queue.h"
using namespace std;
class posta{
private:
queue<int> *q,qaux;
stack<int> *s,saux;
int **v;
public:
int n;
posta(int nr){
int i;
q=new queue<int>[nr];
s=... |
eb31fe37a44722e87836041a34368aedd10fd16f | 7fcb94615b8c5da8e12d22dd10e12e5e43336410 | jaccen2007/echo | /engine/core/render/base/editor/shader/shader_editor.cpp | C++ | cpp | 431 | permissive | #include "shader_editor.h"
#include "engine/core/editor/editor.h"
namespace Echo
{
#ifdef ECHO_EDITOR_MODE
ShaderEditor::ShaderEditor(Object* object)
: ObjectEditor(object)
{
}
ShaderEditor::~ShaderEditor()
{
}
// get camera2d icon, used for editor
const char* ShaderEditor... |
4445651afc330125683a73c644523e3c17e049ae | 0ac990619beacd395e420f3c0ed6f71eed00048c | Zeraka/myleetcode | /tooffer/t32_btree.cc | C++ | cc | 1,463 | no_license | //raw to offer 32
//从上到下打印二叉树
/*
从上到下打印二叉树，就是binaryTree的
"广度优先遍历"，
先用递归的方式打印
*/
#include<deque>
void PrintFromTopToBottom(BTNode * root);
int main()
{
}
//从上到下打印二叉树
void PrintFromTopToBottom(BTNode * root){
if(root == null)
return 1;
std::deque<BTNode*> dequeNode;
dequeNode.push_back(root)；//加入队列
while(deq... |
32600f9f91928f295489a4521b5c286cfd3d19e3 | 8bf5c349fd7600d9a639c9fc6ada181e6bf06fdc | vishu-garg/competetive-programming | /practice/597c.cpp | C++ | cpp | 2,764 | no_license | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#define err() cout<<"=================================="<<endl;
#define errA(A) for(auto i:A) cout<<i<<" ";cout<<endl;
#def... |
f1457e7dfb3a0b42956b51c1a8f1245a9a617333 | b0f82623dd01fb684a88f0c1b9be36679f2543b1 | Baltoli/llvm | /lib/Target/RISCV/AsmParser/RISCVAsmParser.cpp | C++ | cpp | 35,588 | permissive | //===-- RISCVAsmParser.cpp - Parse RISCV assembly to MCInst instructions --===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
d30d36535b0743e95ab427b2bd52e57bcf81bde0 | f36a26dfb81ff891b92d926913770672b7f2c8fa | bffcoin-project/bffcoin | /src/qt/bitcoinstrings.cpp | C++ | cpp | 13,602 | permissive | #include <QtGlobal>
// Automatically generated by extract_strings.py
#ifdef __GNUC__
#define UNUSED __attribute__((unused))
#else
#define UNUSED
#endif
static const char UNUSED *bitcoin_strings[] = {
QT_TRANSLATE_NOOP("bitcoin-core", ""
"%s, you must set a rpcpassword in the configuration file:\n"
"%s\n"
"It is recomme... |
31133ad18e7dd1b8bb24b96168c53e5b3a825987 | c7b26c3348908b6913145b87d3edf67de5dc9668 | symmetryyyyy/Vitis_Accel_Examples | /cpp_kernels/port_width_widening/src/host.cpp | C++ | cpp | 8,449 | permissive | /**********
Copyright (c) 2020, Xilinx, 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:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the fol... |
27b7d414e09a3aaeae3c6b187c184bf2d5accd2f | 82a03729efb8893c3d4aa6268df72db9f9c23311 | stockle/cpp_piscine | /rush00/src/Game.cpp | C++ | cpp | 2,141 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Game.cpp :+: :+: :+: ... |
9775d8997409c9a7dfa59fe4e85414ed89c7c1c6 | 49a3e9bf835327a794f5e261202735088a5cfb1d | para7/OpenSiv3D | /Siv3D/src/Siv3D/ByteArray/ByteArrayDetail.cpp | C++ | cpp | 2,343 | permissive | //-----------------------------------------------
//
// This file is part of the Siv3D Engine.
//
// Copyright (c) 2008-2019 Ryo Suzuki
// Copyright (c) 2016-2019 OpenSiv3D Project
//
// Licensed under the MIT License.
//
//-----------------------------------------------
# include <Siv3D/BinaryReader.hpp>
# include "... |
35eb1b41158e5957701fd94b92f6f04fc7342384 | 791ca616e01f42b7f69b87f287edd908fc2097c6 | nicolepav/Schoolwork | /LBCC_CS11/PAVLOVICH_72833_PROJECT03.cpp | C++ | cpp | 5,034 | no_license | /*
NAME: PAVLOVICH, NICOLE [0878228]
CLASS: 78233 CS11 PROF AZIZ LONG BEACH CITY COLLEGE
DATE: 10_04_2018
PROGRAM NAME: PAVLOVICH_72833_PROJECT03.cpp
*/
#include <iostream>
#include <iomanip>
#include <string>
#include <fstream>
using namespace std;
int main()
{
// File Header
cout << "-... |
e4fe526746566f45cfa46c1fa0e6e2f280dc0c1a | 7eb2f30aa58fa4c37272acdfcc99eadb794dfd97 | jaj58/robot-assignment | /final-assignment/final_code/stage-1-reading-obeying-bar-codes/button.hpp | C++ | hpp | 572 | no_license |
class c_button {
private:
int pin;
public:
void setup(int _pin) {
pin = _pin;
pinMode(pin, INPUT);
}
void wait() { // waits for button press...
debug_print("waiting for button press...");
while (digitalRead(pin) == HIGH) {
// loops untill button input is recieved (pressed)
}
dela... |
4bcf2d201a134d55798f686c2f291eb28fd68dcf | 138c2b49051ace8d7c4500740bfa6ab6c6f60977 | hgrahn/DV1581_testcode | /replace.cpp | C++ | cpp | 571 | no_license | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
int main()
{
std::vector<int> ivec{1,2,3,4,5,1,2,3,4,5};
std::cout << "Initial vector: {";
for (auto it = ivec.cbegin(); it != ivec.cend(); it++)
std::cout << *it << " ";
std::cout << "}" << std::endl;
// replac... |
13da680432da62c027e26af23d80926d26568474 | 196763247ec468669f3d958760b61b029aaac3a8 | femtomc/extending-jax | /lib/cpu_ops.cc | C++ | cc | 1,319 | permissive | // This file defines the Python interface to the XLA custom call implemented on the CPU.
// It is exposed as a standard pybind11 module defining "capsule" objects containing our
// method. For simplicity, we export a separate capsule for each supported dtype.
#include "kepler.h"
#include "pybind11_kernel_helpers.h"
u... |
6f23329e4efb36a3ee2373ba0ce60ebd52f2e423 | 2a457d6076cf41fe91a2ef2f7a80e4dd25a9e11e | Agibalova/client | /table.cpp | C++ | cpp | 2,179 | no_license | #include "table.h"
#include "ui_table.h"
#include <QDebug>
Table::Table(QWidget *parent) :
QWidget(parent),
ui(new Ui::Table)
{
ui->setupUi(this);
QStringList horizontalHeader;
horizontalHeader.append("Time");
horizontalHeader.append("ID");
horizontalHeader.append("x");
hor... |
f9137db3d113f10fdf1a07603606838700a36c6c | 86965e55065b09cbfce39185c0aa5bc5aab3b635 | dmaccormick/Computer_Animation_Techniques | /C - Keyframe Systems/GameState.cpp | C++ | cpp | 7,988 | no_license | #include "GameState.h"
#include "DisplayHandler.h"
#include "Collision.h"
#include "MathHelper.h"
#include <stdlib.h>
#include <time.h>
#include <fstream>
#include <istream>
int GameState::numStates = 0;
//Constructor: increments the static numStates variable, also stores the time this state is being laode... |
cc24e125219f32f9926e83fbd5b57e9c958fe22d | eedd7883dcd7d77d0374deb663ea54ab6ca8b5fa | The-8-Bit-Developers/Ninja-Quest | /NinjaQuest/src/Level3.cpp | C++ | cpp | 5,117 | no_license | #include "Level3.h"
#include <iostream>
#include "Engine.h"
#include "LuaComponent.h"
constexpr const char* level =
"222000000220000222"
"001110000000011100"
"111111100001111111"
"333333300003333333"
"333333333333333333"
"333333333333333333"
"333333333333333333";
int Level3::m_ShurikenType = 0;
void Level3::OnStar... |
dc23fb088357e41b9b55270fa7663e9bf12b5122 | 5989400bb71cdfa5f682194a2dbf9ef004220ccd | KvnSG/Algoritmo-Divide-y-Venceras | /main.cpp | C++ | cpp | 489 | no_license | #include <iostream>
#include "Punto.h"
using namespace std;
int main()
{
Punto P[] = {{65, 34}, {15, 80}, {56, 32}, {97, 12}, {43, 11}, {43, 34}};
int n = sizeof(P) / sizeof(P[0]);
cout<<"Dados los puntos: {65, 34}, {15, 80}, {56, 32}, {97, 12}, {43, 11}, {43, 34}"<<endl;
cout<<"Calcular cua... |
68ad417c2589f1c933009d160b88dfc4ccf9cd8f | 64f6896374b7368c3152bfa773b3d27f109142fd | starrify/chromium | /chromeos/crosapi/mojom/app_service_types_mojom_traits.cc | C++ | cc | 30,327 | permissive | // Copyright 2021 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 "chromeos/crosapi/mojom/app_service_types_mojom_traits.h"
#include <string>
#include <utility>
#include "base/strings/string_util.h"
namespace... |
04b9595fe97b9aa8b98401c5c7ed3343ed96e8ce | c5f6381d46bbf92af6e814b88809acee9366d989 | MicBosi/VisualizationLibrary | /src/vlGraphics/Rendering.cpp | C++ | cpp | 14,277 | permissive | /**************************************************************************************/
/* */
/* Visualization Library */
/* http://visualizationlibrary.org ... |
8be206be5b0c626e20a02a01fde9ddfc89a3ba4a | e4933801dd5f57d8d3102804815ae204e49248be | 1059444127/NH90 | /SDK_Perso/samplers/Radio/avTACAN_AN_ARN118.cpp | C++ | cpp | 4,412 | no_license | #include "stdafx.h"
#include "Avionics/Radio/avTACAN_AN_ARN118.h"
#include "ccModuleManager.h"
#include "Utilities/ccUtilities.h"
using namespace cockpit;
const float Y_CHNL = 0.93f;
const float X_CHNL = 0.87f;
avTACAN_AN_ARN118::avTACAN_AN_ARN118()
{
}
avTACAN_AN_ARN118::~avTACAN_AN_ARN118()
{
}
void avTACAN_A... |
675c47ff181b149d2212b922d61bb084359269a6 | efff97417760567a57f49303ea7aeffa61c472bd | utaihari/MyResearches.PRDC | /src/TEST/NMD_CLASSIFICATION.cpp | C++ | cpp | 6,897 | no_license | /*
* NMD_CLASSIFICATION.cpp
*
* Created on: 2016/10/09
* Author: uchinosub
*/
/*
* NMD_TEST.cpp
*
* Created on: 2016/08/03
* Author: uchinosub
*/
#include "../TEST.h"
#include "../util.h"
#include <iostream>
#include <fstream>
#include <map>
#include <tuple>
#include "../Debug.h"
using namespace ... |
3d32003c03fa21e2461ccc8725ee7c4458f36a75 | f81f55091e9b26db4489ecbb5f7ab73e24bfe55f | Dramacydal/wmv | /src/casclib/src/CascFiles.cpp | C++ | cpp | 31,727 | permissive | /*****************************************************************************/
/* CascFiles.cpp Copyright (c) Ladislav Zezula 2014 */
/*---------------------------------------------------------------------------*/
/* Various text file parsers ... |
de15ae256bff9de79cdec58a2421f93e515620ba | 8600a9ebc5b445547bcf4f4284bf8b4f3279070a | Arent128/AR-Shell | /tests/testConnector.cpp | C++ | cpp | 1,916 | no_license | #include "../src/SemiColon.h"
#include "../src/dPipe.h"
#include "../src/dAmpersand.h"
#include "../src/Executable.h"
#include "gtest/gtest.h"
TEST(SemiColonTest, ConstructionTest)
{
SemiColon* testSemi = new SemiColon();
SemiColon* semiTest = testSemi;
EXPECT_EQ(testSemi, semiTest);
}
TEST(SemiColonTest,... |
314ca229a61ea360cb1d6091abeaf4d6a7a68b7f | 99005ef4750e4a71b17bc69e8dbf9200538329c9 | claudehenchoz/ia | /include/art.hpp | C++ | hpp | 3,129 | no_license | #ifndef ART_HPP
#define ART_HPP
const int font_sheet_x_cells = 16;
const int font_sheet_y_cells = 7;
const int tile_sheet_x_cells = 21;
const int tile_sheet_y_cells = 13;
enum class TileId
{
empty,
player_firearm,
player_melee,
zombie_unarmed,
zombie_armed,
zombie_bloated,
cultist_firearm,... |
d95a88df1d1e6ad94d1904df272a5cd5ded7be49 | 405302bf3c994ea0ad53ae1c837dcafdce5f5e95 | metux/chromium-suckless | /third_party/WebKit/Source/platform/exported/WebAudioDevice.cpp | C++ | cpp | 1,660 | permissive | /*
* Copyright (C) 2010, 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of condition... |
1a586891e3099c6cc29bdd3ce33795a6c3b1d59e | 97cfa8d6ee38144ed102bd46c02007fe2bac6172 | NafisaTanta997/Hashing | /spell_check.cc | C++ | cc | 4,992 | no_license | // NAFISA TANTA
#include "quadratic_probing.h"
#include "linear_probing.h"
#include "double_hashing.h"
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
template <typename HashTableType>
void SpellChecker(HashTableType& dictionary, const string& dicti... |
dc3cc7cae5fddf31a31a4a9a020b8cd5f3c2ea89 | 904b1d84851293a02442d5ab5f8224b7e357b3c2 | zicanl/SANA | /src/methods/Method.hpp | C++ | hpp | 1,047 | no_license | #ifndef METHOD_HPP
#define METHOD_HPP
#include <string>
#include <iostream>
#include "../Graph.hpp"
#include "../utils/utils.hpp"
#include "../Alignment.hpp"
#include "../utils/Timer.hpp"
class Method {
public:
Method(Graph* G1, Graph* G2, string name);
virtual ~Method();
Alignment runAndPrint... |
2c3ae944006124a2ef572669e2855ed0a148e380 | 126e834fb0dac6c55e08f434008602efd380badf | mmatrosov/FKN2020 | /home2/by_user/Мамилов Ибрагим Мусаевич-83084825/A-34537289-gcc_docker2-OK.cpp | C++ | cpp | 329 | no_license | #include <iostream>
#include <set>
int main() {
std::set<int> usedIntegers;
int newInt;
while (std::cin >> newInt) {
if (usedIntegers.find(newInt) != usedIntegers.end())
std::cout << "YES\n";
else
std::cout << "NO\n";
usedIntegers.insert(newInt);
}
re... |
bd359eacb67aaa05b32eb40705e7fe27b29acd6a | a8104d4bc5ec228207068f10fb7c88e6b43278eb | cacharle/piscine_cpp | /cpp01/ex03/Zombie.cpp | C++ | cpp | 1,469 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Zombie.cpp :+: :+: :+: ... |
970fc3881eb05342a4197a721f689331464cadb1 | 30748ef2b6a8209d7726f1da8fa9959ed4edc4eb | dstronaut/Dron | /inc/Drone.hh | C++ | hh | 3,524 | permissive | #ifndef DRONE_HH
#define DRONE_HH
/*!
* \file Drone.hh
* File contains drone and drone interface class definition
*/
#include "Cuboid.hh"
#include "Screw.hh"
#include "Obstacle.hh"
/***************************************************
\brief Class of DroneInterface (used in collisions)
***************************... |
86c75650091a81b841012c9974a78e3d96ccf98f | c686535c47a1c32494b7ee064e38cd06bba35ec7 | dongfangzhou1108/online_calib | /src/imgHandler.cpp | C++ | cpp | 998 | no_license | #include "imgHandler.h"
using namespace std;
void imgHandler::readParameter(string& configPath){
cv::FileStorage fsSettings(configPath, cv::FileStorage::READ);
gaussianSize=fsSettings["gaussian_size"];
cannyThres=fsSettings["canny_threshold"];
contoursThres=fsSettings["contours_threshold"];
}
void imgHandler::run... |
e51d62dc9892a0553592a83e74092a3a4c998f2b | 86fdbb67696a03e3fb1f261da0f7f92962c01865 | jackgopack4/pico-blast | /source/src/app/cn3d/sequence_display.cpp | C++ | cpp | 52,398 | no_license | /* $Id: sequence_display.cpp 103491 2007-05-04 17:18:18Z kazimird $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government ... |
889c10ee57df63d0b7b66a953bd1598ef319a212 | 4853c2ac90a909410865bcd1ba83f8d7777d37d9 | TeamVault/tauCFI | /C++ Benchmark Programs/Benchmark Files 1/classtester/autogen-sources/source-14680.cpp | C++ | cpp | 3,081 | no_license | struct c0;
void __attribute__ ((noinline)) tester0(c0* p);
struct c0
{
bool active0;
c0() : active0(true) {}
virtual ~c0()
{
tester0(this);
active0 = false;
}
virtual void f0(){}
};
void __attribute__ ((noinline)) tester0(c0* p)
{
p->f0();
}
struct c1;
void __attribute__ ((noinline)) tester1(c1* p);
struct c1 : virtual... |
fec8e4f0b045f9915b26c0006540c7a6663b8c51 | a46d46e11c2bca60faf3d50ed2589a82dbecd9d3 | emersonkis/android_device_samsung_cooperve | /libgralloc/framebuffer.cpp | C++ | cpp | 11,120 | no_license | /*
* Copyright (C) 2008 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.