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 |
|---|---|---|---|---|---|---|---|---|
42880a048b0bd4c0f214042854643a992a0755d0 | 124b1b388e971e3bbccb66a24aad262e20da8fbb | CalebSerafin/A3-Antistasi | /A3-Antistasi/MissionDescription/params.hpp | C++ | hpp | 16,183 | permissive | // Real defaults are set in functions/init/fn_initParams.sqf and should match the descriptions below
// 9999 is a special value that causes that parameter to be loaded from the last save, if any
// 9998 is a reserved value and should not be used
class Params
{
class howTo0
{
title = "HOW TO USE ANTISTA... |
26fb70a50bd2e942fe6f8e2ab3a3de74d7b45d22 | 3261fe244182d1f3009ce4451d176aaa4f0ec889 | yfnn/find_head | /find_head/paramsCalculate.cpp | C++ | cpp | 5,256 | no_license | #include <opencv2/core/core.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <iostream>
#include "object.h"
#include "getHeightmap.h"
using namespace cv;
using namespace std;
void paramsCalculate(Mat heightmap_d, Mat heightmap_head, Obj& object)
{
int x, y;
int w, h;
float... |
54352b642f7924b28deb2e55a86084e744c1b4f1 | bb4ff9078d07e7a5b2d33f682119fc336daad1b2 | fernando10/Chameleon | /tests/tests-observation_generator.cpp | C++ | cpp | 8,230 | no_license | // Copyright 2017 Toyota Research Institute. All rights reserved.
//
#include "catch.hpp"
#include "chameleon/path_generator.h"
#include "chameleon/world_generator.h"
#include "chameleon/observation_generator.h"
#include "chameleon/data_generator.h"
using namespace chameleon;
TEST_CASE("Only visible landmarks should... |
57ff0a6ebb184e9b5bc6a152443bc70c4197cbaf | 71f4bea020b49da0ab8dc4d4b71e4520e0e3a89d | JateNensvold/logcabin | /Storage/SegmentedLogTest.cc | C++ | cc | 45,186 | permissive | /* Copyright (c) 2012-2014 Stanford University
* Copyright (c) 2015 Diego Ongaro
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE ... |
544b6694f3afa8d02475f95c6a127993aa020fcd | bf8fc7945dd53179773c6c958f6a788723288a14 | Saurav1905/GDevelop | /Core/GDCore/Extensions/Builtin/VariablesExtension.cpp | C++ | cpp | 10,417 | permissive | /*
* GDevelop Core
* Copyright 2008-2016 Florian Rival (Florian.Rival@gmail.com). All rights
* reserved. This project is released under the MIT License.
*/
#include "AllBuiltinExtensions.h"
#include "GDCore/Tools/Localization.h"
using namespace std;
namespace gd {
void GD_CORE_API BuiltinExtensionsImplementer::Im... |
0b545a844a41e74dae1d23c58e3fe968c444bcdc | 27cba0c1da42e5ed6e387a61b34b6262873de5a7 | AbhishekBachare/C-Calculator | /main.cpp | C++ | cpp | 2,460 | no_license | #include <iostream>
#include<cmath>
using namespace std;
int main()
{
//-------defining variables and initializing them-------------
double num1,num2;
char operation,redo;
//--------Printing my name on screen----------------
cout<<"Welcome to the Calculator program v.1.0 written by Your Name"<<endl;
c... |
a769aa49d7f6d1f9ebed44e22a0431955ed23515 | 06833761c85484f90bd80094f01b5626b89adf9a | fatOrange/HIP | /tests/src/texture/simpleTexture3D.cpp | C++ | cpp | 5,133 | permissive | /*
Copyright (c) 2019-present Advanced Micro Devices, Inc. All rights reserved.
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,... |
ee0facf8cc0a5ca4b8e5179acea83b060dc53454 | 83604a26bb0d671664deaf7354402b471129bbe6 | yanghongkjxy/palo | /be/test/olap/lru_cache_test.cpp | C++ | cpp | 15,723 | permissive | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
4d2d67b903b01c635bd1ce71a3beba0069502543 | e7bccdcf4b9dd423af6668ca2ba14b0d01f058fd | svn2github/OpenMPT | /tags/1.27.02.00/mptrack/FileDialog.cpp | C++ | cpp | 5,240 | permissive | /*
* FileDialog.cpp
* --------------
* Purpose: File and folder selection dialogs implementation.
* Notes : (currently none)
* Authors: OpenMPT Devs
* The OpenMPT source code is released under the BSD license. Read LICENSE for more details.
*/
#include "stdafx.h"
#include "FileDialog.h"
#include "Mptrack.h"
#... |
176d71b7738fced5fed1a9dfcf68e5e06595cc11 | b0fd60c49791c6a3fb89c82fb033fd360cc1f137 | PedroAngeli/Competitive-Programming | /Solutions/cses/Graph Algorithms/road_construction.cpp | C++ | cpp | 2,005 | no_license | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define f first
#define s second
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define ... |
33bfe694569cbb8e4eeb11941c93dd66f33d434e | 0059e5ffa9b0806ac85aa5cd74e1f86daf9a5d7e | devid00000/LuckyBox | /adc.cpp | C++ | cpp | 3,044 | no_license | #include "adc.h"
Adafruit_ADS1115 ads;
void adcInit() {
ads.begin();
ads.setGain(GAIN_ONE);
}
// чтение всех внешних каналов АЦП
void adcLoop() {
uint16_t data;
if (millis() - adcTimeRead >= 1000) {
adcTimeRead = millis();
//Serial.println("Start");
data = ads.readADC_SingleEnded(AN0);
data = ads.readADC_... |
f76fb9a0b9199e4e1aec17d81912ed92fd2027f8 | 20cb51dcaaa26886a520c76f0e97fbf14cbc6c02 | SW0000J/PS | /BOJ/2000/2981.cpp | C++ | cpp | 750 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
int gcd(int x, int y) {
while (y != 0) {
int buf = x % y;
x = y;
y = buf;
}
return x;
}
int main() {
ios::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
int N; cin >> N;
vector<int> v(N);
for (int... |
f5a233b7f2a3540c3cf28990f1783539cbbb1963 | c9c9edf0ef32067964ce7b962e2802c7187386e0 | fawdlstty/quiche | /quic/qbone/bonnet/tun_device_packet_exchanger.cc | C++ | cc | 3,069 | permissive | // Copyright (c) 2019 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 "net/third_party/quiche/src/quic/qbone/bonnet/tun_device_packet_exchanger.h"
#include <utility>
#include "net/third_party/quiche/src/common... |
2e89aa834870320e77460ce6cee06e1583d34923 | f4b9a1ba5502849b870c531bef90d9b214e60490 | raghumdani/typocoder | /Solutions/519.cpp | C++ | cpp | 1,051 | no_license | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N], cnt[N];
set <int> ids;
int main()
{
int n;
scanf("%d", &n);
assert(1 <= n && n <= 100000);
memset(cnt, -1, sizeof(cnt));
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
assert(1 <= a[i] && a[i] <= ... |
0a3260cf4708aad646593e5bea590ae069be80a8 | 15913de5d1f12bdb01d9ff30c08b16604d0bacb5 | NNNewbie477/Data-Sructures-and-Algorithms-Basic-in-C- | /TreeWalk.cpp | C++ | cpp | 1,026 | no_license | #include <stdio.h>
#define MAX 10000
#define NIL -1
struct Node{int p, l, r;};
struct Node T[MAX];
int n;
void PreParse(int u){
if(u == NIL) return;
printf(" %d", u);
PreParse(T[u].l);
PreParse(T[u].r);
}
void InParse(int u){
if(u == NIL) return;
InParse(T[u].l);
printf(" %d", u);
In... |
e50515f5947ebcd04738028f252648fda7b7f99f | b087b3abc8294acff9d694fd2f6abedb041be85e | sympiler/sympiler | /sparse_blas/other_operations.cpp | C++ | cpp | 2,995 | permissive | //
// Created by kazem on 6/16/20.
//
#include <aggregation/def.h>
namespace sym_lib{
void csr_add_diag(int n, const int *Ap, const int *Ai, const double *Ax,
double* d){
for (int i=0; i<n; i++){
// Bp[i] = Ap[i];
for(int j=Ap[i]; j<=Ap[i+1]; j++){
d[i] += Ax[j];
}}}
void mat_pr... |
440fab1c632072ab4432d83e86522fa957e8263f | e8476799078df3da40f87a92fc1e1319ab9e56a8 | geosidnei/cpp | /13 FOR 7ago2019.cpp | C++ | cpp | 281 | no_license | //aula 13 - 7/ago/2019
//loop - comando for
//1░ programa
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int i=1;
//for (parte1;parte2;parte3)
for (i; i<=50; i++)
{
//faša algo aqui
cout <<i<<endl;
}
return 0;
} |
51376f2961ba28ef02871bf0dff153803860c7d8 | 52ae52cac4bbd9843dfd9b758bdde43fab975819 | OS2World/LIB-PM-Kronis_Classes | /source/krbwin.cpp | C++ | cpp | 7,800 | permissive | // Kroni's Classes: objects for buffered twodimensional graphics
// (c) 1997 Wolfgang Kronberg
// file: krbwin.cpp
#include "krbwin.hpp"
#define INCL_GPIBITMAPS // For GpiQueryDeviceBitmapFormats & Co.
#include <os2.h>
#include <ithread.hpp> // IThread
#include <ig... |
a44f7ec354d7ba6272d36c98c4ca082ad9efe219 | 49eccc7a608d52257733ec57e6442a7e1f0a965d | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-sagemaker/source/model/ModelPackageStatusItem.cpp | C++ | cpp | 1,863 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/sagemaker/model/ModelPackageStatusItem.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aw... |
3fcb23242ada0c4decafc2190424fd44c8310c71 | 38a3e997faa1a262af62c5fd311f69b82a9d9ada | ab-vm/ab | /core/include/Ab/Wasm/ExprReader.hpp | C++ | hpp | 1,186 | no_license | #ifndef AB_WASM_EXPRREADER_HPP_
#define AB_WASM_EXPRREADER_HPP_
#include <Ab/Config.hpp>
#include <Ab/Wasm/ExprDispatch.hpp>
#include <Ab/Wasm/Expression.hpp>
namespace Ab {
namespace Wasm {
/// Read the Expression that corresponds to the opcode, and call the function on expr.
template <OpCode op>
struct ReadExpr {
... |
2f77024b41bbe2579b603bb4d4ff1b60c8e24d80 | f4fa559d05f2b7e307418a2bb5f85378b0ba6ec5 | FrostBitCrypto/FrostBit | /fstbt/lib/utility.cpp | C++ | cpp | 2,348 | permissive | #include <iostream>
#include <fstbt/lib/utility.hpp>
namespace rai
{
namespace thread_role
{
/*
* rai::thread_role namespace
*
* Manage thread role
*/
static thread_local rai::thread_role::name current_thread_role = rai::thread_role::name::unknown;
rai::thread_role::name get (void)
{
return current_threa... |
20af05571b7973ec4201a30e84d168b6f5c7333d | 41af26c5458c71581028cab2b807c6b1de16cffb | Siocnarff/VierEenTwee | /src/ppl/Person.cpp | C++ | cpp | 1,224 | no_license | #include "Person.h"
#include <utility>
#include <iostream>
using namespace ppl;
Person::Person(std::string n, bool hasDegree, int s) : name(std::move(n)), degree(hasDegree), skillLevel(s) {
id = generateId();
}
std::string Person::getName() {
return name;
}
bool Person::hasDegree() const {
return degree;
... |
a397a85e6f718585f927124fe3ca19334c464ce1 | 4cf4cbc2780a6daeb0e70e3f6b33ccb2295c0c40 | microcash-dev/DRACHMacoin | /src/qt/bitcoinunits.cpp | C++ | cpp | 4,352 | permissive | #include "bitcoinunits.h"
#include <QStringList>
#include <QLocale>
BitcoinUnits::BitcoinUnits(QObject *parent):
QAbstractListModel(parent),
unitlist(availableUnits())
{
}
QList<BitcoinUnits::Unit> BitcoinUnits::availableUnits()
{
QList<BitcoinUnits::Unit> unitlist;
unitlist.append(BTC);
... |
85fc7226bc6f4612f8e7d59c4d9f52218ddf4a68 | 177de892a3808e221117e41313d3681d618fc58c | ArnaudDroxler/Cuda | /WCuda/Tuto_Image_Cuda_Demo/src/cpp/core/mainImage.cpp | C++ | cpp | 2,217 | no_license | #include <iostream>
#include <stdlib.h>
#include <string.h>
#include "Device.h"
#include "cudaTools.h"
#include "MandelbrotProvider.h"
#include "RipplingProvider.h"
#include "RayTracingProvider.h"
#include "Settings_GPU.h"
#include "Viewer_GPU.h"
using namespace gpu;
using std::cout;
using std::endl... |
2beca34c7d1a1fefd743311b52765311deb21d6d | a96d8d3562e97947ce5efa2089b51aad56c79f6f | NicolasRochaPacheco/robot_toolkit | /include/robot_toolkit/navigation_tools/laser/naoqi_depth2laser_converter.hpp | C++ | hpp | 2,783 | no_license | //======================================================================//
// This software is free: you can redistribute it and/or modify //
// it under the terms of the GNU General Public License Version 3, //
// as published by the Free Software Foundation. //
// This software is... |
598d8c4df387c78a9f85421f485c1e5449859bf5 | 41adb2f5753f8c5cbdae74133c60f713c7af0e08 | hnuyx/work | /other/test/001-ccp/h-test-string.cpp | C++ | cpp | 251 | no_license |
#include <string>
#include <stdio.h>
using namespace std;
int main()
{
string s = "";
string d = " edf";
string e = " kfd";
s += "abc";
s += " ";
s += "bcd";
s += d + e;
printf("%s\n", s.c_str());
return 0;
}
|
d82c92cd25e6f55a56e66fcddf8db0876b34a6d1 | 61add8df10c5c1a7544a86c10f24de00a255abd0 | pzugel/Biogas_Control_Panel | /output_reader/biogas_output_reader.cpp | C++ | cpp | 8,077 | no_license | /*
* Copyright (c) 2020: G-CSC, Goethe University Frankfurt
* Author: Paul Zügel
*
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public Li... |
8c54d44d579cf670f2495a8ab5e577a95cfc180d | 599cdec8358cb7aa60660bbc6c196ed2630edb30 | rogerta97/FlyEngine | /FlyEngine/Source/UI_Button.cpp | C++ | cpp | 13,581 | permissive | #include "UI_Button.h"
#include "DisplayImageAction.h"
#include "ModuleInput.h"
#include "Texture.h"
#include "FlyObject.h"
#include "MyFileSystem.h"
#include "ResourceManager.h"
#include "ChangeRoomAction.h"
#include "ModuleWorldManager.h"
#include "Gizmos.h"
#include "Application.h"
#include "ModuleImGui.h"
#include ... |
defbb2558a2c91f40d9111bae9a7266fb80f5c84 | 65b6e1cba73c3e59ebb53681a7e762116dbd446c | bin-dot/tugas-ke-4 | /tugas ke 5.cpp | C++ | cpp | 697 | no_license | /* Menghitung jumlah deret */
/* Sitti Aulia Sabina Rahmannissa */
/* 20051397016 */
#include <iostream>
#include <conio.h>
using namespace std;
main ()
{
cout << "program menghitung deretan \n";
cout <<"---------------------------------- \n";
int a=0,b,c,n,i, jumlah=0;
cout << "deret bilangan = 3,7,... |
a6c4667ee32f3692d88bbae24f2ecde95ffeeb1a | 17eb5c0ea3b71336604b2bc9454cce6f1c8d7896 | xrLil-Batya/gitxray | /net.ssa/xrStalkerOld/xrGame/PHElement.cpp | C++ | cpp | 41,982 | no_license | #include "StdAfx.h"
#include "PHDynamicData.h"
#include "Physics.h"
#include "tri-colliderknoopc/dTriList.h"
#include "PHFracture.h"
#include "PHContactBodyEffector.h"
#include "MathUtils.h"
#include "PhysicsShellHolder.h"
#include "game_object_space.h"
#include "../skeletoncustom.h"
#include <../ode/src/util... |
3c8617c194645218a7f138be8c37bcde4cd19f15 | a32a7bfe07bec3294b9fa0c66695543b04f23049 | allending/clang | /lib/Driver/WindowsToolChain.cpp | C++ | cpp | 11,381 | permissive | //===--- ToolChains.cpp - ToolChain Implementations -----------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
1e418319c399fe8f9f6a2407be31485a99414ab1 | 00d2c42cea1526dafbff0b21fe336f1cb9420322 | isoundy000/ouzel | /ouzel/assets/Cache.hpp | C++ | hpp | 5,755 | permissive | // Copyright (C) 2017 Elviss Strazdins
// This file is part of the Ouzel engine.
#pragma once
#include <memory>
#include <string>
#include <map>
#include "utils/Noncopyable.hpp"
#include "assets/LoaderBMF.hpp"
#include "assets/LoaderImage.hpp"
#include "assets/LoaderMTL.hpp"
#include "assets/LoaderOBJ.hpp"
#include "... |
926bce05850e5a3bbaffe43ad129d016e1a1479c | 6ae8152b8c6fa3f3f74d1b788c992f988c31944e | xianggong/m2s-bench-amdapp-2.9-si | /RecursiveGaussian/RecursiveGaussian.hpp | C++ | hpp | 8,310 | no_license | /**********************************************************************
Copyright ©2014 Advanced Micro Devices, Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
• Redistributions of source code mu... |
7f74515368e88ab2eca5049b236af1077bcc4506 | 9e4b2946a09a72ffadd9e5a70aeca12f7af8272d | PortlandStatePowerLab/doe-egot-dcm | /src/ecs/include/ecs/dcm_components_module.hpp | C++ | hpp | 3,370 | permissive | #ifndef __DCM_COMPONENTS_MODULE_H__
#define __DCM_COMPONENTS_MODULE_H__
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <flecs.h>
#include <sep/models.hpp>
#include <command_pattern/dcm_commands.hpp>
#include "der_sim_module.hpp"
#include "der_components_module.hpp"
namespace dcm
{
class dcm_compo... |
b38c399d9f816656a12b60cd23085f4242db61a2 | 1a51375b0c67dadfebc3f16c3a7a853f21df7c2c | ClementGermain/FollowMe | /src/pi/utils/PeriodicThread.hpp | C++ | hpp | 833 | permissive | #ifndef __PERIODIC_THREAD_HPP__
#define __PERIODIC_THREAD_HPP__
#include "Thread.hpp"
/**
* Thread that executes a task with constant period.
*/
class PeriodicThread : public Thread {
public:
/** Create a thraad that executes a periodic task.
* param: Period in millisecond between two calls of loop() **/
P... |
f14b24c2e34ce308ee662907b72e28e531cc021f | 6a271fb91f763f531488fb4adc92b276e54bff2d | prittt/GRAPHGEN | /src/GRAPHGEN/image_frequencies.cpp | C++ | cpp | 13,437 | permissive | // Copyright (c) 2020, the GRAPHGEN contributors, as
// shown by the AUTHORS file. All rights reserved.
//
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
#include "image_frequencies.h"
#include <iostream>
#include <limits>
#include <filesystem>
#include <algori... |
aa738ce99cde526e0c3e0414c40307df1737c186 | 69b22981de209444ab695f112604d2b0240301ec | npukujui11/Leetcode_practice | /84.柱状图中最大的矩形.cpp | C++ | cpp | 1,050 | permissive | /*
* @lc app=leetcode.cn id=84 lang=cpp
*
* [84] 柱状图中最大的矩形
*/
// @lc code=start
class Solution {
public:
int largestRectangleArea(vector<int>& heights) {
stack<int> stac_k;
stac_k.push(-1); // 防止栈空
int height, width, max_area = 0;
for(int i = 0; i < heights.size(); i++){ // 遍... |
353fb542cfa7a040ea0c4b4277befa02a59378d5 | ef517bfb2b4d8dae9c39a633f71138d66e8536a9 | simonecid/cmssw | /RecoPixelVertexing/PixelLowPtUtilities/src/StripSubClusterShapeTrajectoryFilter.cc | C++ | cc | 17,788 | permissive | #include "RecoPixelVertexing/PixelLowPtUtilities/interface/StripSubClusterShapeTrajectoryFilter.h"
#include <map>
#include <set>
#include <algorithm>
#include "DataFormats/TrackerCommon/interface/TrackerTopology.h"
#include "DataFormats/TrackerRecHit2D/interface/ProjectedSiStripRecHit2D.h"
#include "DataFormats/Track... |
6c40443ec34165fbf47ab266bc845aa00f90e1a6 | d757b87dcebd1c5795f51a936f2edc954f721caa | heyuanYao-pku/Proximal | /TestLogistic/TestLogistic.cpp | C++ | cpp | 1,740 | no_license | #include<Eigen/dense>
#include<iostream>
#include<ctime>
#include "Scenario.h"
#include "Normlizer.h"
#include "LineSearch.h"
#include "Evaluate.h"
int main() {
// 创建 f(x)
Logistic<Eigen::MatrixXd>* LS = new Logistic<Eigen::MatrixXd>("data/a1a.txt");
const auto [m, n] = LS->Solution_Size();
// 创建 h(x)
Normliz... |
d8bb53b32a0bf4ca5a5a85327f2e375d6a65f153 | 0151dee8eba276fa608a82e2c8bbceccd14d8e61 | fengjixuchui/AllMemPro | /MemoryMon/V2PMap.cpp | C++ | cpp | 3,070 | permissive | // Copyright (c) 2015-2016, tandasat. All rights reserved.
// Use of this source code is governed by a MIT-style license that can be
// found in the LICENSE file.
/// @file
/// Implements the V2PMap2 class.
#include "V2PMap.h"
#include "../HyperPlatform/HyperPlatform/common.h"
#include "../HyperPlatform/HyperPlatform... |
15c0c6ad3e94df9ff363e7f79161ef96b6cd2a01 | 83f4eafa38c45cf8e7a828d7620d40b2215a21da | Deadmanovi4/mmo-resourse | /MinsiCode/MsCode/MsBaseErrorCode.cpp | C++ | cpp | 1,104 | no_license | #include "Precompiled.h"
extern LPTCHAR szMsErrorCodeName[MS_ERROR_MAX_COUNT+2] =
{
_T("未知错误"), _T("操作成功"), _T("发生异常"), _T("权限错误"),
_T("空闲不足"), _T("数据不足"), _T("未初始化"),
//_T("?"), _T("?"), _T("?"), _T("?"),
_T("ERROR_END")
};
extern LPT... |
62ca1a27cd5e9e3063154d941893cdf83a123d01 | 04e227add4bdbf5f984634665b33626d376abeff | skinnari/cmssw | /SimGeneral/MixingModule/plugins/HiMixingModule.cc | C++ | cc | 10,984 | permissive | // -*- C++ -*-
//
// Package: HiMixingModule
// Class: HiMixingModule
//
/**\class HiMixingModule HiMixingModule.cc HeavyIonsAnalysis/HiMixingModule/src/HiMixingModule.cc
Description: <one line class summary>
Implementation:
<Notes on implementation>
*/
//
// Original Author: Yetkin Yilmaz
// ... |
950f67156f79345ff6101bab40e2a2bde8a41b5e | d3d991a22db05612c812b1a0b9ac363ac3802fda | pwjones/ccv_pgr | /libs/OSC/oscpacklib/oscpacklib/ip/win32/UdpSocket.cpp | C++ | cpp | 14,913 | permissive | /*
oscpack -- Open Sound Control packet manipulation library
http://www.audiomulch.com/~rossb/oscpack
Copyright (c) 2004-2005 Ross Bencina <rossb@audiomulch.com>
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files
(the "Software"), to ... |
c46a5129bd6fead05137e33b02b8387a3ae877c8 | 3565fcc6c6ac70f6f2ac48008bc224993c822eb4 | roussukke/Yorozuya | /library/ATF/DispHTMLBody.hpp | C++ | hpp | 265 | permissive | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <IDispatch.hpp>
START_ATF_NAMESPACE
struct DispHTMLBody : IDispatch
{
};
END_ATF_NAMESPACE
|
a9357b2a7e6e7a48a8add4c12871a8e62b55ce60 | 02fb121cca876dc962154ab4a0362eec26d06aae | dangdang1250/LearnCPP | /others/solution.cpp | C++ | cpp | 249 | no_license |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <iostream>
#include <string>
#include <list>
#include <memory>
using namespace std;
void solution(){
// white board
}
|
57d74f541ca4bd2569a62a986d8b434f0eed78e5 | bed93de70ee996552dbb78485578ddd6ae13b889 | antoshkaplus/Ant | /app/segment_intersections/comparable.hpp | C++ | hpp | 1,744 | no_license | // ===================================================================
//Comparable.h - Class for comparing AVL tree nodes
// Written by Brad Appleton (1997)
// http://www.bradapp.com/ftp/src/libs/C++/AvlTrees.html
#ifndef COMPARABLE_H
#define COMPARABLE_H
#include <ostream>
using namespace std;
// cmp_t is an enum... |
9e12c77be3666f24a68f9f3231e04c506c581892 | e588a2a43175e96173fb792b303236330013d875 | DaeunOh/ALGORITHM | /BOJ/[SW, 2003] 수들의 합2.cpp | C++ | cpp | 4,548 | no_license | // 소요시간: 12분
// 실행시간: 0ms
/*
시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
0.5 초 128 MB 14015 6829 4674 50.497%
문제
N개의 수로 된 수열 A[1], A[2], …, A[N] 이 있다.
이 수열의 i번째 수부터 j번째 수까지의 합 A[i]+A[i+1]+…+A[j-1]+A[j]가 M이 되는 경우의 수를 구하는 프로그램을 작성하시오.
입력
첫째 줄에 N(1≤N≤10,000), M(1≤M≤300,000,000)이 주어진다.
다음 줄에는 A[1], A[2], …, A[N]이 공백으로 분리되어 주어진... |
75102d9e834e51125cf2613840df45d7218a2e1e | c3eb931ec826d26854fa5f47110f8427a8c330ce | tetat/Codeforces-Problems-Sol | /Difficulty1200/1149A.cpp | C++ | cpp | 1,308 | no_license | /// Problem Name: Prefix Sum Primes
/// Problem Link: https://codeforces.com/problemset/problem/1149/A
/**
* winners never quit
**/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long Long;
const int N = 1e5;
bool mark[400001];
int len = 40... |
1237fdc7fc86abde253d631066515ec10b958b3d | a21ecd51ec0b60e25f9cfe86c431a9398f777ffa | Valentineed/Asteroid | /Asteroids/BulletEntity.cpp | C++ | cpp | 835 | no_license | #include "pch.h"
#include "BulletEntity.h"
namespace Asteroids
{
BulletEntity::BulletEntity(sf::Sprite * sprite, float speed)
{
m_movement.SetSprite(sprite);
m_movement.SetScale(1);//TODO
m_movement.SetMovement(0, -speed);
}
void BulletEntity::SetSideScrolling(float sideMove)
{
m_movement.SetSideMovement... |
237e33bf40ab5ef3066c645a1142d5f4aa0869b2 | 9dd3422c64eb5a247a959497dce20972beb3fc74 | markferreiro/PRO2-Gestor-de-textos | /Conjunt_cites.hh | C++ | hh | 3,155 | no_license | /** @file Conjunt_cites.hh
@brief Especificaci� de la classe Conjunt_cites
*/
#ifndef CONJUNT_CITES_HH
#define CONJUNT_CITES_HH
#include <vector>
#include <string>
#include <sstream>
#include <map>
#include "Cita.hh"
#include "Autor.hh"
#include "Conjunt_autors.hh"
using namespace std;
/*
* Classe Conjunt_cites
... |
47c299b006788cad91c1222dfcf7d8769a70d9d2 | f3485e03d0aefe2fed3c59980fa4e721dd46a2d7 | UmangGanvir/data_structures_and_algorithms | /problems/backtracking/generate_all_permutations_of_string.cpp | C++ | cpp | 829 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
void printStringVector( vector<string> vec ){
int n = (int) vec.size();
for( int i=0; i<n; i++ )
cout<<vec[i]<<endl;
cout<<endl;
}
void swapForAllLR( string& currStr, int l, unsigned long int r, vector<... |
5eb8d2cb05dcc1773db9845030082fd6fc259898 | 162bc53bd6320b8639ac04472a7f379c1149d42e | leloykun/admu-progvar-notebook | /code/other/dates.cpp | C++ | cpp | 566 | no_license | int intToDay(int jd) { return jd % 7; }
int dateToInt(int y, int m, int d) {
return 1461 * (y + 4800 + (m - 14) / 12) / 4 +
367 * (m - 2 - (m - 14) / 12 * 12) / 12 -
3 * ((y + 4900 + (m - 14) / 12) / 100) / 4 +
d - 32075; }
void intToDate(int jd, int &y, int &m, int &d) {
int x, n, i, j;
x = j... |
a4be68461123f9d17b3f433ba7176802a4a2ce55 | 17c6587113390d802991e6a5c43838362fa77264 | chemiczny/automateusz_gto_d2 | /include/gto_d2_kit/d2_ee_pdsp_DD.hpp | C++ | hpp | 683 | no_license | #ifndef D2_EE_PDSP_DD_HPP
#define D2_EE_PDSP_DD_HPP
void second_derivative_ee_1201_44( const double ae,
const double xA,
const double yA,
const double zA,
const double be,
const double xB,
const double yB,
const double zB,
const double ce,
const double xC,
const double yC,
... |
4cbc07498768c1d0c798d8d921a3e69d64e72864 | ec014737d678ec588f05cfd7e519e55f4ae606d7 | rajatkhanna1999/CompetitiveCoding | /Codechef/CCData&AlgoProgramme/ANARC09Astack.cpp | C++ | cpp | 4,704 | no_license | // #include <bits/stdc++.h>
// #include <vector>
// #include <set>
// #include <map>
// #include <string>
// #include <cstdio>
// #include <cstdlib>
// #include <climits>
// #include <utility>
// #include <algorithm>
// #include <cmath>
// #include <queue>
// #include <stack>
// #include <iomanip>
// #include <ext/pb_d... |
6fc85c1cc6463ae608621b2ac06dcf2db64187e0 | 79444eedaeba8bfd45b0bae5508ad68bdb563bba | tr4ceflow/Nanomite | /qtNanomite/clsAPIImport.cpp | C++ | cpp | 4,600 | no_license | /*
* This file is part of Nanomite.
*
* Nanomite is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Nanomite i... |
7c4e8bbf6d7b073334127e0142b8b641a0d0af66 | 3f991121f02abbffaecccc2afd76279d53f3094c | cjones051073/cfit | /include/cfit/coef.hh | C++ | hh | 4,813 | no_license | #ifndef __COEF_HH__
#define __COEF_HH__
#include <complex>
#include <cfit/parameter.hh>
class Amplitude;
class Resonance;
class Fvector;
class CoefExpr;
class Coef
{
private:
Parameter _real;
Parameter _imag;
public:
Coef( const Parameter& real, const Parameter& imag )
: _real( real ), _imag( imag )
{}
... |
9ff098f95de28edda848fb7e33092ac3da7bd59a | 3226805ddfb691767686f256d34320f33f894865 | HenryDzy/Meta-Vision-Solais | /src/Executor.cpp | C++ | cpp | 12,329 | no_license | //
// Created by liuzikai on 4/18/21.
//
#include "Executor.h"
#include "Utilities.h"
#include <iostream>
namespace meta {
Executor::Executor(OpenCVCamera *openCvCamera, MVCamera *mvCamera, ImageSet *imageSet, VideoSet *videoSet,
ParamSetManager *paramSetManager,
ArmorDetector *... |
93a522da5f2264837e5685a583d8f3aaa508afb7 | 1fd19449a1f7620eabd68a20f3e0a170e7e5cb03 | rresol/Practice | /interviewbit/once.cpp | C++ | cpp | 288 | no_license | #include<bits/stdc++.h>
using namespace std;
#define N 32
int getSingle(int arr[], int n)
{
int result =0;
for(int i=0;i<N;i++)
{
for(int j=0;j<n;j++)
{
sum+=((1<<i)&&arr[j]);
}
if(sum%3)
results |= (1<<i);
}
return result;
}
int main()
{
int
}
|
81381e957c5afbaf75dea43d40cae283c62d2303 | 210fd93508dec0ee3c8ac9fcf9a0f29006cf92fb | shadowlink0122/VoiceRecorder | /mouse.hpp | C++ | hpp | 1,105 | no_license |
#pragma once
struct mouseParam{
int x;
int y;
int event;
int flags;
};
void CallBackFunc(int eventType, int x, int y, int flags, void* userdata){
mouseParam *ptr = static_cast<mouseParam*> (userdata);
ptr->x = x;
ptr->y = y;
ptr->event = eventType;
ptr->flags = flags;
}
bool cli... |
5f168699b2b5fb95910ab362044767b601c34514 | 5d6da303cc6936805abb1af77306a6109897c77a | zhu-he/ACM-Source | /hdu/1014.cpp | C++ | cpp | 267 | no_license | #include <cstdio>
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b, a % b);
}
int main()
{
int STEP, MOD;
while (scanf("%d %d", &STEP, &MOD) == 2)
{
printf("%10d%10d %s\n\n", STEP, MOD, gcd(STEP, MOD) == 1 ? "Good Choice" : "Bad Choice");
}
return 0;
}
|
aa97a8e708144734fcf5541e6702e8bddd691455 | 16835c09967a829af5823aa9a03232a800cb78b0 | obie00/ImageClassTraining | /ImageClassTraining/ImageClassTraining.cpp | C++ | cpp | 986 | no_license | #include "opencv2/core.hpp"
#include "opencv2/imgproc.hpp"
#include "opencv2/highgui.hpp"
#include <iostream>
#include "fileManager.h"
#include "ImageClassManager.h"
using namespace cv;
int main()
{
std::cout << "I am Ironman!\n";
//imread("C:\\Users\\omoob\\Desktop\\TTTtraining\\trainO\\imO" + std::to_string(i+27)... |
4cdc4d2c3d63d1fdbe886c7ade7ed3c177507ca4 | f9fcdc63d89c9e9f078c67489cf5dc9a6776b92d | rabelhmd/UVA-Solutions | /UVA_12582 - Wedding of Sultan.cpp | C++ | cpp | 783 | no_license | #include "bits/stdc++.h"
using namespace std;
#define LL long long int
int main()
{
LL N, Case = 0;
cin >> N;
cin.ignore();
while(N--)
{
string str;
cin >> str;
stack <char> St;
map <char, int> M;
St.push(str[0]);
Case++;
for(int i = 1; i < s... |
13803f134e0887f88727f59d6863ef75821ba202 | da8cec05c2faddc08478421eca87239e502e7574 | rivertoday/opencvtest | /imgproc_samples/findContours_demo.cpp | C++ | cpp | 2,025 | no_license | /**
* @function findContours_Demo.cpp
* @brief Demo code to find contours in an image
* @author OpenCV team
*/
#include "opencv2/imgcodecs.hpp"
#include "opencv2/highgui.hpp"
#include "opencv2/imgproc.hpp"
#include <iostream>
using namespace cv;
using namespace std;
static Mat src_gray;
static int thresh = 100;
... |
e07f18a13f6a68d43b2a90f55ea1cc7b2cc6eb37 | 0a5f28e9c5d2447cf7f0cbe3e3fac76887173818 | ufaith/mir2x | /client/src/followuidmagic.hpp | C++ | hpp | 2,417 | no_license | /*
* =====================================================================================
*
* Filename: followuidmagic.hpp
* Created: 12/07/2020 21:19:44
* Description:
*
* Version: 1.0
* Revision: none
* Compiler: gcc
*
* Author: ANHONG
* Email: anhonghe... |
03582c71d978f5f39dc9c8fdabd850085525dff4 | 303c303233da7d9de0ab03c881d305f37fa7fde6 | avishag410/Reviiyot | /src/Game.cpp | C++ | cpp | 6,462 | no_license | #include <iostream>
#include <Player.h>
#include <Deck.h>
#include <Game.h>
#include <GameManager.h>
#include <fstream>
#include "../include/Game.h"
using namespace std;
Game::Game(char* configurationFile)
:players(), deck("", 0), maxNumber(0), printMode(0), turnsCounter(0), configurationPath(configurationFil... |
9b18c4321e67bb5bde80577eb096f692950f02e4 | 2b875f84d673cf881d74884427ab48d920156537 | VeriSilicon/tensorflow | /tensorflow/core/profiler/internal/cpu/python_tracer.cc | C++ | cc | 3,181 | permissive | /* Copyright 2020 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... |
e68452e5166d19e2ce1d91c550f7924acd4a2f94 | 5b0ec74b17494a1d149432036c8dcc330acbf841 | vickymhs/CodeForces-Submissions | /fedor_new_game.cpp | C++ | cpp | 720 | no_license | #include<bits/stdc++.h>
using namespace std;
int n,m,k,i,j,x,d,l,c,cw;
string s[2000],temp;
int main()
{
cin>>n>>m>>k;
for(i=0;i<=m;i++)
{
cin>>x;
temp.clear();
while(x>0)
{
d=x%2;
if(d==0)
temp+='0';
else
temp+='1';
x=x/2;
}
//cout<<temp<<endl;
s[i]=temp;
for(j=0,l=s[i].length()... |
60fcd3813ab6a24f58ef4aa457dcca696f8febdf | 38b0b7b1640534286671b4a2f3190874c28afe7d | useyourfeelings/POJ | /1028/1275171_AC_15MS_220K.cc | C++ | cc | 1,070 | no_license | #include<iostream>
#include<vector>
#include<cstring>
using namespace std;
int main()
{
string command;
string url;
string current("http://www.acm.org/");
vector<string> f;
vector<string> b;
while(cin>>command)
{
if(command == "FORWARD")
{
if(f.empty())
... |
5d4eeecb45df960bdee2bd3c066c8aefd2a60a26 | 130ffd40ff29472e666f10a4bd7ef753d8d3a3b1 | aghayoor/BRAINSTools | /BRAINSSurfaceTools/BRAINSSurfaceRegister/ResampleQuadEdgeMesh/ResampleQuadEdgeMesh.cxx | C++ | cxx | 3,472 | no_license | /*=========================================================================
Program: BRAINS (Brain Research: Analysis of Images, Networks, and Systems)
Module: $RCSfile: $
Language: C++
Date: $Date: 2011/07/09 14:53:40 $
Version: $Revision: 1.0 $
Copyright (c) University of Iowa Department of Radio... |
eb9dcd7bd2b8ae4901253ef21fa12ae9d207eadc | ac789504e9b64ab8454a7f2bf4ed46bc19c4b87c | cmbruns/gz3doom | /src/gl/textures/gl_hwtexture.cpp | C++ | cpp | 12,466 | no_license | //
//---------------------------------------------------------------------------
//
// Copyright(C) 2004-2016 Christoph Oelckers
// All rights reserved.
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free ... |
5f73b6c6c73335998370fd0c23c067919c6a7ad1 | 586a35667709cb58d9008c2dc79f553b27a7a2bb | zhouxs1023/GTE | /Samples/Intersection/MovingSphereTriangle/MovingSphereTriangleMain.cpp | C++ | cpp | 906 | no_license | // David Eberly, Geometric Tools, Redmond WA 98052
// Copyright (c) 1998-2020
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
// https://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// Version: 4.0.2020.01.10
#include "MovingSphereTriangleWindow3.h"
#inclu... |
df955e04ec8911eaba570fabe7fea22c09c69224 | 1b0e23667d5aabd64e5060337f59c76eb50c3ca9 | KratosMultiphysics/Kratos | /applications/SolidMechanicsApplication/custom_processes/assign_torque_field_about_an_axis_to_conditions_process.hpp | C++ | hpp | 8,245 | permissive | //
// Project Name: KratosSolidMechanicsApplication $
// Created by: $Author: JMCarbonell $
// Last modified by: $Co-Author: $
// Date: $Date: January 2018 $
// Revision: $Revision: 0.0 $
//
//
#if !defin... |
a3173cc7389632eb4003c27684f5b09194afd848 | 8d98ae757317909364cf15bfe9b4c5743d1e9469 | rheehot/talkheui | /extlib/u5e/codepoint_decomposition.hpp | C++ | hpp | 1,842 | permissive | #ifndef INCLUDED_U5E_CODEPOINT_DECOMPOSITION
#define INCLUDED_U5E_CODEPOINT_DECOMPOSITION
#include <iterator>
#include <algorithm>
#include <experimental/string_view>
#include <u5e/codepoint.hpp>
#include <u5e/props/compatibility_and_canonical_decomposition_mapping.hpp>
#include <u5e/utf32ne_string_view.hpp>
namespa... |
41c6a65068d5c2f83e8e9ad6c4fdd630439043ab | 87240d2245c7a9cfad6ef8b9d161079189363777 | solisoft/arangodb | /arangod/Pregel/AlgoRegistry.cpp | C++ | cpp | 6,884 | permissive | ////////////////////////////////////////////////////////////////////////////////
/// DISCLAIMER
///
/// Copyright 2014-2021 ArangoDB GmbH, Cologne, Germany
/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany
///
/// Licensed under the Apache License, Version 2.0 (the "License");
/// you may not use this file except... |
cb93f7dfc4966243921f2ff9ee7d29131429827f | 9a1264ae9cb7cb68e51025a10cd318d50398091c | eyangch/competitive-programming | /USACOcontests/silver/2012.11/distant.cpp | C++ | cpp | 2,385 | permissive | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> ... |
dc9f6ff9eceac0b7214d713a93ba2fa990d36789 | 84ad0c156ad208b69cf0ff572080bc4b216109c8 | SoftwareNetwork/specifications | /2d/38/c7/8b/9752b0fcc736bad135e0dcd2cb9ff6515ceda507811c89531c17bbd0de981dee31c759451a0e557a2d9e030353ceeb4d364c5727b424c1123d003f0c/sw.cpp | C++ | cpp | 314 | no_license | void build(Solution &s)
{
auto &re2 = s.addTarget<StaticLibraryTarget>("google.re2", "2022.12.1");
re2 += Git("https://github.com/google/re2", "{M}-{m:02}-{p:02}");
re2 += cpp11;
re2.ImportFromBazel = true;
re2.BazelTargetName = "re2";
re2.Public += "."_idir;
re2 += "NOMINMAX"_def;
}
|
02b86e4a9736deb6541d8200cfde4270e148fc5b | 42994917d2fbca822e4eba27eda56633e162588c | kainino0x/deqp | /modules/gles2/functional/es2fShaderBuiltinVarTests.cpp | C++ | cpp | 22,309 | permissive | /*-------------------------------------------------------------------------
* drawElements Quality Program OpenGL ES 2.0 Module
* -------------------------------------------------
*
* Copyright 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not ... |
8318cc03e4f649742f5b753dca5a539e883ca544 | e1dfd093133bfb06cb60f89cdbe813f42a62fb2d | treverson/HyperExchange | /libraries/crosschain/include/graphene/crosschain/crosschain_impl.hpp | C++ | hpp | 6,448 | permissive | /*
* Copyright (c) 2015 Cryptonomex, Inc., and contributors.
*
* The MIT License
*
* 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... |
e6e6a996542441c7c7f9540599732d2952aabe0a | d70da5af80b0f9c7607150988b30ec6f735ec05f | loimu/k3b | /src/rip/k3baudiorippingdialog.cpp | C++ | cpp | 17,565 | no_license | /*
SPDX-FileCopyrightText: 2003-2009 Sebastian Trueg <trueg@k3b.org>
SPDX-FileCopyrightText: 2010 Michal Malek <michalm@jabster.pl>
SPDX-FileCopyrightText: 1998-2009 Sebastian Trueg <trueg@k3b.org>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "k3baudiorippingdialog.h"
#include "k3baudioripjo... |
d4e3beace158509ecf3719732c8cb94a111b78f7 | 1d790db6235c2a56241e13e9b6b4bed6a5d1c01c | zg2nets/windows-backend | /Dali/dali-core/dali/internal/event/events/touch-data-impl.cpp | C++ | cpp | 4,086 | no_license | /*
* Copyright (c) 2017 Samsung Electronics Co., 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 a... |
ec4134c766507def6f5e7a520e74fc79e658a536 | 692c52cadfdd275022bab56d02991b672abb3f1e | graphcore/popart | /willow/include/popart/popx/op/absx.hpp | C++ | hpp | 608 | permissive | // Copyright (c) 2018 Graphcore Ltd. All rights reserved.
#ifndef POPART_WILLOW_INCLUDE_POPART_POPX_OP_ABSX_HPP_
#define POPART_WILLOW_INCLUDE_POPART_POPX_OP_ABSX_HPP_
#include <popart/popx/op/elementwisex.hpp>
namespace snap {
namespace program {
class Sequence;
} // namespace program
} // namespace snap
namespace ... |
adbe386a73bb13acb0dd6d560497582bb9508972 | 2182f4b50ba2ac88278be83da607c08684c68ce3 | flpfrnc/LP1-2019.2 | /Classes/carro.cpp | C++ | cpp | 644 | no_license | #include "carro.hpp"
void Carro::setDoors(int doors){
this->doors = doors;
}
void Carro::setColor(string color){
this->color = color;
}
void Carro::setPlate(string plate){
this->plate = plate;
}
void Carro::setSpeed(double speed){
this->speed = speed;
}
int Carro::getDoors(){
return... |
40ab92b9b94916d6a7c3014d5795582791ee8484 | 5d6101a1a1065126d2249edd2eeb725242cf3c4b | JessHG04/Pengo | /class/Bloque.cpp | C++ | cpp | 648 | no_license | #include "Bloque.h"
Bloque::Bloque(sf::Texture* texture, int x, int y, bool borde) {
direccion = -1;
velocidad = 250.0f;
movimiento = false;
posicion = new sf::Vector2i(0, 0);
sprite = new sf::Sprite(*texture);
if(borde){
sprite->setTextureRect(sf::IntRect(0*16, 6*16, 16, 16));
}els... |
13b753c89ec33df037e121c9301000c9371a2fbf | 16b393d42aa6a904020ffe8cc9494f62069403c8 | Brehm1983/Coding-Tree | /LeetCode/27. Remove Element.cpp | C++ | cpp | 339 | no_license | class Solution {
public:
int removeElement(vector<int>& nums, int val) {
vector<int>::iterator it;
it = nums.begin();
for(int i=0;i<nums.size();i++){
if(nums[i]==val){
nums.erase(it+i);
i--;
}
}
return nums... |
6a046e1590671a455fccf7f2d54a241cefba9bbb | bacdd2398e5320543bc754a95a6ba1cb5e45718b | KoviRobi/clang | /test/CodeGenCXX/cheri-struct-layout.cpp | C++ | cpp | 3,597 | permissive | // RUN: %clang_cc1 -triple cheri-unknown-freebsd -fno-rtti -std=c++14 -target-abi purecap -fsyntax-only -fdump-record-layouts %s -emit-llvm -o /dev/null | FileCheck %s
// CHECK: *** Dumping AST Record Layout
// CHECK-NEXT: 0 | class error_category
// CHECK-NEXT: 0 | (error_category vtable pointer... |
37032d554806612079eff6890d532b0321b19d37 | 76b472f6ff0c52de6adf548938667563896758cf | bishtranjan1/chromium | /components/viz/service/gl/gpu_service_impl.cc | C++ | cc | 25,607 | permissive | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/viz/service/gl/gpu_service_impl.h"
#include <memory>
#include <utility>
#include "base/bind.h"
#include "base/command_line.h"
#incl... |
6d181fb9c7fb081b5f84079134c926cfc7e6ae14 | f391aeeb4c38653b91c642f0921af68d6e8ee3c5 | cfranc0/Rail | /Line/RailLine.cpp | C++ | cpp | 4,745 | no_license | /**
*@author Leonardo Pinton, 1230955
*@code RailLine.cpp
*/
#include "RailLine.h"
using namespace std;
/* Constructors of the derived classes */
RailLine_piece_standard::RailLine_piece_standard(int _from, int _to) {
from = _from;
to = _to;
pieceType = 0;
doesBlockTraffic = true;
railSpeedLimi... |
f7b2c433182193522ea643b6e3570b36ae4086e6 | 5562e06d5541a7f29654adbb9c42384db00f997e | liang0/chromium | /components/signin/public/identity_manager/identity_test_utils.cc | C++ | cc | 20,152 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/signin/public/identity_manager/identity_test_utils.h"
#include <vector>
#include "base/guid.h"
#include "base/run_loop.h"
#include ... |
b85d8eda6aba5cd268d05d41ebf1fc75139fd537 | 4c5a0e0b1f85b387176e68503ecfbbfd6d38d41f | StetsonMathCS/MyCultural.Events | /RSSdownloader/RSSDownloader.cpp | C++ | cpp | 1,201 | no_license |
#include "curl/curl.h"
#include <stdio.h>
#include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
char url[] = "https://www.stetson.edu/programs/calendar/rss/cultural-credits.rss";
static size_t WriteCallback(void *contents, size_t size, size_t nmemb, void *userp)
{
((std::string*)userp)->app... |
1e3502c360a4f58049209e4848bf69dcba0c8cfd | 61bc8feecfadbf2f6dcdc5c920975af7555b227d | olhagrubryn/OlhaGrubrynUni | /SR_1_Grubryn_Olha/SR_1_Grubryn/1.cpp | C++ | cpp | 510 | no_license |
#include <iostream>
#include<stdio.h>
#include<windows.h>
using namespace std;
int main1() {
SetConsoleOutputCP(1251);
SetConsoleCP(1251);
int num, i, couter, a = 1;
cout << "Ââåä³òü ÷èñëî: "; cin >> num;
for (i = 1; i <= num; i++)
{
for (couter = 1; couter <= i; couter++)
{
... |
af9abf3ef966830f0a4c8ddc578441738123dd3d | b60721b3a024cb24cab2c5904c682ca4a386398f | liang0/chromium | /content/browser/renderer_host/policy_container_navigation_bundle_unittest.cc | C++ | cc | 20,851 | 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 "content/browser/renderer_host/policy_container_navigation_bundle.h"
#include <iosfwd>
#include <utility>
#include "base/files/file_path.h"
#in... |
5616886bb652705ed628ea3d09b82b935308fad2 | fe456cd763723b0f9b5fe88fa9bfbaeb09f0d9fd | Mae-2018/OpenCV_Mosaic | /opencv2.framework/Versions/A/Headers/stitching/detail/seam_finders.hpp | C++ | hpp | 10,238 | no_license | /*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, instal... |
a6970984517d6ac982b77c9a379aa197fa1f3e65 | f7f1df902d991a4723d63df0a172f1f34b61068e | tjd229/Algorithm | /codeforce/1701C.cpp | C++ | cpp | 1,138 | no_license | //bs
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <set>
#include <map>
#include <queue>
#include <unordered_map>
#include <tuple>
#include <numeric>
#define ll long long
#define pii pair<int,int>
using namespace std;
int a[... |
c89a627d4a04d09405e5b4c0930dee4e972d5444 | 7b79468875fd722583cb4e0f9c09af1af1e44dc8 | aharthcock/phantomjs | /src/qt/qtwebkit/Source/WebCore/Modules/webdatabase/DatabaseTask.cpp | C++ | cpp | 6,414 | permissive | /*
* Copyright (C) 2007, 2008, 2013 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 lis... |
68580e4ffa695198b90a08b86929a502602a3c81 | 10ef30f65e079afca9fee2592637aed27b01955c | frankbozar/Competitive-Programming | /Solo Practice/Codeforces/AC/731D-2.cpp | C++ | cpp | 2,330 | no_license | #include<cstdio>
#include<cstdlib>
#include<vector>
using namespace std;
struct treap
{
struct node
{
int pri, key;
node *l, *r;
node(int _key)
{
pri=rand();
key=_key;
l=r=NULL;
}
} *root;
treap(int n)
{
... |
2f97d6cf70d7a8aa0fec1551b23fa3ba8a4532c5 | 059f97a585e827f3645a50c867b96570b8cba298 | alexandraback/datacollection | /solutions_5708921029263360_0/C++/bangcoder/ScratchPad.cpp | C++ | cpp | 2,269 | no_license | #include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <functional>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <iostream>
#define ENP printf("**Entry Point**\n")
#define A first
#define B secon... |
10a7ff35a02f706de2a022532b5ddc34ec60f1cb | 129c7c7894d960e07509507c9546186c7929b2d8 | Ricardokevins/NJU_2020Spring_Advanced-Programming | /project2/.history/main_20200406215359.cpp | C++ | cpp | 380 | no_license | #include <Windows.h>
#include<
void modeset(int w,int h) {
HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE);
COORD size = {w, h};
SetConsoleScreenBufferSize(hOut,size);
SMALL_RECT rc = {1,1, w, h};
SetConsoleWindowInfo(hOut ,true ,&rc);
system("cls");
return;
}
int main(){
modeset(100,180);
for(int i(0);i<3;i... |
a9bb86dd55932f0f37b9b34f6aaba14ba7f50589 | 0ff5be7f7992bf5acca5b25caefdcbb19ec4467f | TITANCollaboration/decayspec_8pi_geant4sim | /src/PrimaryGeneratorAction.cc | C++ | cc | 1,149 | no_license | #include "PrimaryGeneratorAction.hh"
#include "PrimaryGeneratorGun.hh"
#include "PrimaryGeneratorSource.hh"
#include "PrimaryGeneratorMessenger.hh"
#include "G4GeneralParticleSource.hh"
#include "G4ParticleGun.hh"
#include "G4Event.hh"
PrimaryGeneratorAction::PrimaryGeneratorAction()
{
gpsGun = new G4GeneralParticl... |
84c49964c3109aaf3ed60a6ac74d45edf3f1528d | 982e85dcc82ab34fb966d555e6e48cb8d81917cd | otcshare/chromium-src | /gpu/command_buffer/service/raster_decoder_unittest_base.cc | C++ | cc | 9,040 | permissive | // Copyright 2018 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "gpu/command_buffer/service/raster_decoder_unittest_base.h"
#include <stddef.h>
#include <stdint.h>
#include <algorithm>
#include <memory>
#include <string>
#include... |
9b9d9db9930e21de21291b2ca07934fbcd6b96f2 | 91f35eee1d80b8010102651ca6bcfa7099814877 | PDi-Communication-Systems-Inc/lollipop_external_chromium_org | /third_party/WebKit/Source/modules/indexeddb/IDBObjectStore.cpp | C++ | cpp | 27,683 | 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 condit... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.