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 |
|---|---|---|---|---|---|---|---|---|
373f0150c495051bdf1e8b8d1fdbd862e5be7ef8 | 2a6b104d4d20586cc9dd0217ff4ce9bf6b5fe25a | vishalbelsare/arangodb | /arangod/RocksDBEngine/Listeners/RocksDBThrottle.cpp | C++ | cpp | 17,021 | 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... |
7da12b24a21b9ef46352e41b76bda6aa5785b52f | 4ee425b73ba7d7cd00b882283063715aa9730078 | Shrey-Viradiya/Alt-Ctrl-Advance | /Chapter5/Chapter5/main.cpp | C++ | cpp | 1,924 | permissive | #include<iostream>
#include<memory>
#include"Integer.h"
Integer operator +(int a, const Integer& b) {
return Integer(a + b.getValue());
}
std::ostream& operator << (std::ostream & out, const Integer& a) {
out << a.getValue();
return out;
}
std::istream & operator >> (std::istream & inp, Integer& a) {
int x;
std... |
074e808380c12fd547984fa844728dc47164ae27 | 5ddfa1c00602254fd9b7c829d69b3b24e707270d | JJingL/xla | /week14/循环不变代码外提.cc | C++ | cc | 14,937 | no_license | /* Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
6ee13d06563e4585dcaae02d825a1bfe4c6f2195 | 32b577c4f970a160b917367c24f7d19611bc5990 | csJd/oj-codes | /nowcoder/jzo.52.RegexMatch.cpp | C++ | cpp | 2,100 | no_license | /*
https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46
题目描述
请实现一个函数用来匹配包括'.'和'*'的正则表达式。模式中的字符'.'表示任意一个字符，而'*'表示它前面的字符可以出现任意次
（包含0次）。
在本题中，匹配是指字符串的所有字符匹配整个模式。例如，字符串"aaa"与模式"a.a"和"ab*ac*a"匹配，但是与
"aa.a"和"ab*a"均不匹配
*/
#include <cstring>
#include <iostream>
using namespace std;
class Solution {
public:
... |
0fe3dc31e0b4e971341c7853fc58085903a88292 | dd19bdeefd0fff9afb8aea70df39d679bb0d18cb | zuerchet/dubins | /test/circle_test.cpp | C++ | cpp | 6,122 | no_license | #include "dubins/Circle.hpp"
#include "dubins/Vector.hpp"
#include <gtest/gtest.h>
TEST(CircleTest, circle_cw_cw_tangent)
{
using namespace dubins;
CircleCW a{Circle{{0.0, 0.0}, 3.0}};
CircleCW b{Circle{{10.0, 0.0}, 3.0}};
auto c = calculate_transfer_line(a, b);
ASSERT_TRUE(c.has_value());
... |
f467fb5bff0b32fc2c9fe29acd4b3aea388fd8ca | ea0a43110116cb9d605a8468c74f92dd0b56719c | brycelelbach/nt2 | /modules/trigonometric/unit/scalar/fast_sincosd.cpp | C++ | cpp | 7,854 | permissive | //////////////////////////////////////////////////////////////////////////////
/// Copyright 2003 and onward LASMEA UMR 6602 CNRS/U.B.P Clermont-Ferrand
/// Copyright 2009 and onward LRI UMR 8623 CNRS/Univ Paris Sud XI
///
/// Distributed under the Boost Software License, Version 1.0
/// ... |
e083bffe4c06832ada55f6a3a3b54f2f0d80e235 | d95e53641a017cc6fb4f666525542ee461458282 | creek0810/Competitive-Programming | /UVA/441.cpp | C++ | cpp | 614 | no_license | #include<cstdio>
#include<vector>
using namespace std;
int num;
void dfs(int step,vector<int>&table,int loc,vector<int>&ans){
if(step == 6){
for(int i=0;i<6;i++){
if(i){
printf(" ");
}
printf("%d",ans[i]);
}
printf("\n");
}else{
for(int i=loc;i<num-5+step;i++){
ans[step] = table[i];
dfs(ste... |
bab502c50774d195376140f0d3009991081032ec | f1c188ed3700f052ddd0df9210594c9d7e8c76c1 | zgzjdx/Nachos3.4 | /lab4/demo1/code/userprog/processmanager.cc | C++ | cc | 5,939 | no_license | // processmanager.cc
#include <iostream>
#include "processmanager.h"
#include "system.h"
#include <stdio.h>
using namespace std;
//----------------------------------------------------------------------
// newProcess
// fork will call this to run
//------------------------------------------------------------------... |
7c8c29c26bcb50c5b2cf0cdd4600166631646184 | 1e2b444c1c41ac63ddb21b635e5400882af433a8 | Fluorz/TEK2 | /pool/cpp_d07m/ex02/Borg.cpp | C++ | cpp | 2,066 | no_license | /*
** EPITECH PROJECT, 2018
** cpp_d07m
** File description:
** Borg.cpp
*/
#include "Borg.hpp"
Borg::Ship::Ship()
{
this->_home = UNICOMPLEX;
this->_location = this->_home;
this->_side = 300;
this->_maxWarp = 9;
std::cout << "We are the Borgs. Lower your shields and ";
std::cout << "surrender yourselves... |
5967782050f31602cec10f0d897330e5409de21c | aaaa1618167a6354cdc9913842c39844a45215f1 | zhaohongqiang/software | /fishbowl/world.cpp | C++ | cpp | 2,236 | permissive | #include <unordered_map>
#include <functional>
#include <stdexcept>
#include "entity.hpp"
#include "world.hpp"
namespace cuauv {
namespace fishbowl {
world::world()
: next_entity_id(0)
, next_entity_observer_id(0)
{ }
world::~world()
{
for (auto it = entities.begin(); it != entities.end();) {
no... |
bcda678e3e2b1ea909d989d8480353a4a134251e | 54dbe6f393c1ffa2dbab4d1ec9f8bde8ea4caea1 | Mod233/tcp_monitor-cpp | /Split_flow.cpp | C++ | cpp | 13,976 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <pcap.h> /* if this gives you an error try pcap/pcap.h */
#include <errno.h>
#include <sys/socket.h>
#include <iostream>
#include <netinet/in.h>
#include <cstring>
#include <arpa/inet.h>
#include <netinet/if_ether.h> /* includes net/ethernet.h */
#include <netinet/ip.h>
#... |
1e916f11eeeeba385ae57781aed81b9051e6cdf4 | c71d15faaf6faf1a0dfd75d895a236ca27af3879 | cjmxp/pap_full | /gbk/server/Server/Server/Packets/CGExchangeOkIIIHandler.cpp | C++ | cpp | 38,220 | no_license | /*
客户端同意交易，可以换了
*/
#include "stdafx.h"
#include "CGExchangeOkIII.h"
#include "GCExchangeSuccessIII.h"
#include "GCExchangeError.h"
#include "GamePlayer.h"
#include "Obj_Human.h"
#include "Scene.h"
#include "Log.h"
#include "ItemOperator.h"
#include "HumanItemLogic.h"
#include "Obj_Pet.h"
#include "HorseFindMateModule... |
ddffba05054e1021797224c60deedd863ca3e86c | 0f0f0da5f3f592fbdf437a1d0f14f4090065c923 | netaudio/yasmine | /libyasmine/source/entry_point_impl.cpp | C++ | cpp | 1,983 | no_license | //////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// This file is part of the Seadex yasmine ecosystem (http://yasmine.seadex.de). //
// Copyr... |
638be927268a6c6c39c8cbc648fd5c818f44e8d7 | dd03971d1c7ce057e4a510a050f1b9dfb52891c9 | skyformat99/HashTable_Cpp | /Candy Warehouse (HashTable Implementation)/C++/datastructure.hh | C++ | hh | 1,954 | no_license |
#ifndef DATASTRUCTURE_HH
#define DATASTRUCTURE_HH
#include <string>
#include <iostream>
using std::string;
const std::string NOT_AVAILABLE = "Product not in warehouse.";
const std::string NOT_ENOUGH_CANDY = "Not enough candy available.";
class Datastructure {
public:
Datastructure();
~Datastructure();
... |
f5bebc21e6172d6dc91a38240fb594e8ee55b5d3 | 0ce9a617d4f2286e46ad3145d5dd816e336aa307 | WehNoBee/p1-18 | /Основы программирования/ЛЗ 31. Обработка таблиц/Matrix1.cpp | C++ | cpp | 1,103 | no_license | /* Programming Taskbook. Электронный задачник по программированию
(c) М. Э. Абрамян (Южный федеральный университет), 1998–2020 */
// Двумерные массивы (матрицы)
// http://ptaskbook.com/ru/tasks/matrix.php
/* Matrix1. Даны целые положительные числа M и N. Сформировать целочисленную матрицу размера M * N,
у которой... |
6ef0d1fd75f648ecfb1e014fb46764d95a6849ae | fddbd5affbb488de9b013002b33022514e9a2f3f | AmarM91/Object-oriented-Programming | /ZADATAK VIZE 16-2-2017/Vize_rjesenje.cpp | C++ | cpp | 19,872 | no_license | #include<iostream>
#include<string>
#include<vector>
#include<exception>
#include<thread>
#include<mutex>
#include<regex>
using namespace std;
//main je malo tricky postavljen pa treba paziti koje je vrijednosti poprimio odredjeni objekat i gdje se dodaje
const char* crt = "\n--------------------... |
7809661d43ac7f882ea4f1feae87fa5bb67700bf | 617d60f2548b37575d90d58bed7157d7ee8c620c | Swater96/ChronoEmu | /Trunk/src/chrono-logonserver/LogonOpcodes.cpp | C++ | cpp | 1,277 | no_license | /*
* Chrono Emulator
* Copyright (C) 2010 ChronoEmu Team <http://www.forsakengaming.com/>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* an... |
f66dcbb13dbf140c0349bd653ee50c99da3e5dce | a4fa2070d35019c515d10b8ca8eb7429accafebd | phuonglab/argon-rtos | /test/src/led_ringcoder.cpp | C++ | cpp | 10,844 | permissive | /*
* Copyright (c) 2013-2014 Immo Software
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* o Redistributions of source code must retain the above copyright notice, this list
* of con... |
1508ff12da9c4fdbce5083a8892fa2235f4ab466 | ea417cb6540e4d39b968a41918d32cb6ef1c635a | chuckrector/vccnow | /code/v1vc_macro.cpp | C++ | cpp | 8,443 | no_license | #include "v1vc_macro.hpp"
#include "compile.hpp"
#include "log.hpp"
#include "mem.hpp"
#include "util.hpp"
// -----------------------------------------------------------------------------
void
InitMacroPool()
{
Assert(!MacroPool.Base);
InitMemPool(&MacroPool, PoolBase(MACRO_POOL_INDEX), POOL_SIZE);
}
// NOTE(aen... |
472f1cab9f53f3db9dc521ba5337185c78f03259 | 8c15a3ff3441e191e299d845bb3e8d6f562cbd82 | Hyarius/Minecraft_clone | /Erelia/srcs/editor_inventory.cpp | C++ | cpp | 5,813 | no_license | #include "erelia.h"
jgl::String inventory_tab_text[] = {
"Blocs",
"Decor"
};
extern Vector2 library_nb_element;
extern Vector2 button_nb_element;
void editor_inventory_active_frame(jgl::Data param)
{
Editor_inventory* editor = param.acces<Editor_inventory*>(0);
Editor_inventory_tab* target = param.acces<Editor_i... |
a627c71504e871670f5712e0a14b472633cd28e2 | 2bf6ac4a53c0455a8147780ccecda3bb196e7d30 | tiqwab/atcoder | /abc213/c/main.cpp | C++ | cpp | 1,795 | no_license | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... |
dc7608eb5baab4dadb73f5df5b9a021ed1eb9085 | b996a699a9be25d40e3ee54375a216382766c211 | runngezhang/Algorithm | /Codeforces/Previous/Div II/166B_113.cpp | C++ | cpp | 844 | no_license | #include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
const int N = 100010;
struct point{double x,y;};
double xmult(point p1,point p2,point p0){
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int main ()
{
int i, j, k, n, m;
bool flag = true;
point cv[N];
for (... |
606f3efa56bb314adbe53059291b27bb07c9ec18 | 1f8691ab520e04b9522f2cae49723d90ca3ac4ef | yzq986/cntt2016-hw1 | /TC-SRM-561-div1-550/mhy.cpp | C++ | cpp | 4,452 | no_license | #include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <typeinfo>
#include <fstream>
using namespace std;
template <typename T> inline T sqr(const T &x){return x*x;}
struct Edge{int t,next;} G[105];i... |
d7762b2678ff2f5f82ae45673744729c580337f9 | 6621d0e85017a06f23bce1125c3eaf84c86f22e8 | SpinWaveGenie/SHUG2015Tutorial | /Example02/Villain/SC1Dispersion.cpp | C++ | cpp | 3,331 | permissive | #include <cmath>
#include <string>
#include "SpinWaveGenie/SpinWaveGenie.h"
#include "nlopt.hpp"
using namespace std;
using namespace SpinWaveGenie;
SpinWaveBuilder getBuilder(double theta_a, double theta_b, double gamma)
{
double eta,J;
eta = 4.0;
J = 1.0;
Cell cell;
cell.setBasisVectors(2.0... |
394a99039b9cc27347dfb62f6b1d5ceda5e4f033 | fd7ab298e200ccea58df53ace51d1771f75773b3 | mgnisia/hpx | /tests/performance/local/delay_baseline_threaded.cpp | C++ | cpp | 5,573 | permissive | // Copyright (c) 2011 Bryce Adelstein-Lelbach
//
// SPDX-License-Identifier: BSL-1.0
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#include "worker_timed.hpp"
#include <hpx/concurrency/barrier.hpp>
#include ... |
798f8f5fb2747cbf0a6d8cb0f838de8668844238 | 04c44488269eb55742ccc96728b86536c7eeef77 | pennyworth12345/ContactConfigCompare | /configs/Display3DENRequiredAddons.cpp | C++ | cpp | 7,531 | no_license | class Display3DENRequiredAddons: DisplaySimulated
{
authorEmpty = "Unknown";
iconAddon = "\a3\3DEN\Data\Controls\CtrlMenu\pictureCheckboxEnabled_ca.paa";
iconAddonMissing = "#(argb,8,8,3)color(0,0,0,0)";
idd = 322;
onLoad = "[""onLoad"",_this,""Display3DENRequiredAddons"",'3DENDisplays'] call (uinamespace getvari... |
295329b2ee7b75fc4e82dd6e64cd9c6a01df99d4 | bf4822c1cbfe9dd2281fdaa27b3ee335fb37cfcd | findMF/findMFBase | /src/base/basetest/difftest.cpp | C++ | cpp | 1,640 | permissive | // Copyright : ETH Zurich
// License : three-clause BSD license
// Authors : Witold Wolski
// for full text refer to files: LICENSE, AUTHORS and COPYRIGHT
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE Hello
#include <boost/test/unit_test.hpp>
#include "base/base/diff.h"
#include "base/resample/masscomparef... |
bdc3079b2c0d872346ddbb9f0e5861ed963e7c24 | acb173d61067707101a49f6326eda02439df56f3 | nicklyz/Distributed-and-Parallel-Computing | /lab5/example/test-cl.cpp | C++ | cpp | 15,827 | no_license | /*******************************************************************************
Vendor: Xilinx
Associated Filename: test-cl.c
Purpose: OpenCL Host Code for Matrix Multiply Example
Revision History: July 1, 2013 - initial release
****************************************... |
6c5fb4f94bcac1e564ad34b53827549ed598cdc1 | 110237ca43703d35d2264bf98057555733afda0b | cephdon/OpenSpin | /PropellerCompiler/DistillObjects.cpp | C++ | cpp | 11,830 | no_license | //////////////////////////////////////////////////////////////
// //
// Propeller Spin/PASM Compiler //
// (c)2012-2016 Parallax Inc. DBA Parallax Semiconductor. //
// Adapted from Chip Gracey's x86 asm code by Roy Eltham //
// Se... |
1f2cf5128ad8334ea5df70d7d532fb4267c0f1b3 | 4207b3946a6907ca4bd1051e1fa2b5b767ca92c0 | Sporknugget/Juliet_prep | /testcases/CWE762_Mismatched_Memory_Management_Routines/s04/CWE762_Mismatched_Memory_Management_Routines__new_array_delete_class_14.cpp | C++ | cpp | 4,017 | no_license | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE762_Mismatched_Memory_Management_Routines__new_array_delete_class_14.cpp
Label Definition File: CWE762_Mismatched_Memory_Management_Routines__new_array_delete.label.xml
Template File: sources-sinks-14.tmpl.cpp
*/
/*
* @description
* CWE: 762 Mismatched Memory Managemen... |
39b2bd84b8322badf2470154af9062322f6c22ae | 07e88e63909e133b8e8545e4edf18bdf463e359e | hackerlank/renyang-learn | /qt/qt4/HiTSim/src/main.cpp | C++ | cpp | 259 | no_license | #include "MainWindow.h"
#include <QApplication>
#include <QTime>
int main(int argc,char **argv) {
QApplication app(argc,argv);
qsrand(QTime(0,0,0).secsTo(QTime::currentTime()));
MainWindow *main = new MainWindow;
main->show();
return app.exec();
}
|
bcb3d6ece99f9c7248eba781449a793043350c79 | ddc84250c9212068e364135add561384d01f1e05 | jomolinare/gratis | /Sketches/libraries/EPD_FLASH/EPD_FLASH.cpp | C++ | cpp | 5,696 | no_license | // Copyright 2013-2015 Pervasive Displays, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at:
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law... |
1777d6b980d3bc0c61385f22339f0053716a376d | a1ce228094bfea18283d86d4f69a3a46e2bdd537 | ftiasch/mithril | /2012-08-11/F.cpp | C++ | cpp | 2,214 | no_license | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <c... |
f6dd60cc45ed8cb203bc41dce225b6055609f321 | 40f8fbba16551572ec7c16f2bfcc17edf82ddd0b | salpieiev/LearnGL2 | /LearnGL2/Renderer16.cpp | C++ | cpp | 11,367 | no_license | //
// Renderer16.cpp
// LearnGL2
//
// Created by Sergey Alpeev on 05.06.13.
// Copyright (c) 2013 Sergey Alpeev. All rights reserved.
//
#include "Renderer16.h"
#include "ParametricSurface.h"
#include "Shaders/CrudeBloomTextureShader.vsh"
#include "Shaders/CrudeBloomTextureShader.fsh"
#include "Shaders/CrudeBloom... |
434a283a19361be6d255a69e813ef969574df3e9 | 78b98f12ff739c96cb98cf533567043803b29354 | danemarguglio/C8Emulator | /main.cpp | C++ | cpp | 335 | no_license | #include <iostream>
#include "Graphics/SDLGraphics.h"
#ifdef main
#undef main
#endif
int main(int argc, char *argv[])
{
if (argc != 2)
{
std::cout << "Usage: ./Chip8 /binary/to/load" << std::endl;
return -1;
}
std::string binary_path = argv[1];
SDLGraphics gfx = SDLGraphics(binary_path);
gfx.eventLoop();... |
3a8dcc8914b5f8cbb168f6548f8810e33c061545 | dd9ec4bcf1e4320bb05926a5663cfa17e4c95621 | McStasMcXtrace/NJOY21 | /src/njoy21/input/ACER/Card8a/Iza02/test/Iza02.test.cpp | C++ | cpp | 1,073 | permissive | #define CATCH_CONFIG_MAIN
#include "catch.hpp"
#include "njoy21.hpp"
using namespace njoy::njoy21::input;
SCENARIO( "Iza02 input values", "[ACER], [Card8a], [Iza02]" ){
GIVEN( "valid iza02 values" ){
std::vector<int> validIza02{ 1001, 92235 };
THEN( "the returned class has the correct value" ){
for... |
26251d80205b249a46a8adb20c6c910bac6addd9 | f886dc891c6e1ac34bbcbf6a183a6b194ae15199 | johnathan79717/competitive-programming | /AtCoder/arc110/arc110_d/main.cc | C++ | cc | 6,633 | no_license | // Create your own template by modifying this file!
#include <string>
#include <vector>
#include <climits>
#include <cstring>
#include <map>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cassert>
#i... |
3fdca3db6950c3e78bad71e681dae852880885e9 | e05777fc8357e5e7bac046796ef4a00118949f35 | JellyBrick/libphpext | /src/object.cpp | C++ | cpp | 2,235 | permissive | #include "vendor.h"
#include "object.h"
#include "parameters.h"
#include "array_member.h"
namespace php {
value object::call(zval* obj, const string& name) {
value rv;
int r = call_user_function(EG(function_table), obj, name, rv, 0, nullptr);
// assert(r == SUCCESS && "调用方法失败");
exception::rethrow... |
d0f5a28c657615ab8679d23d96d5d91ec1f5e0ba | 45935a6bdb3eaa0416db1933e3052775e45f1bdf | razzie/librazzie | /examples/network/network.cpp | C++ | cpp | 4,231 | permissive | /*
Copyright (C) Gábor "Razzie" Görzsöny
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribu... |
6c03f88c563245b975405ada12d7c19f21f46252 | 3b5be8afca87f3d9496e41b0429d13488b9241d8 | Vizalt/Macacos | /Project_7_Solution/Source/ModuleEnemies.cpp | C++ | cpp | 6,163 | permissive | #include "ModuleEnemies.h"
#include "Application.h"
#include "ModuleRender.h"
#include "ModuleTextures.h"
#include "ModuleAudio.h"
#include "Enemy.h"
#include "Enemy_Purple.h"
#include "Enemy_Orange.h"
#include "Enemy_White.h"
#include "Enemy_Boss.h"
#define SPAWN_MARGIN 50
ModuleEnemies::ModuleEnemies(bool start... |
8b7c884560290848464c49edd75cb890116ff6c9 | 81c3f14a2527e663a568f1acc8ba4a7a8696ba8c | nperf/nclblast | /routines/level2/tpsv.cc | C++ | cc | 2,631 | permissive |
#include "routines.h"
void dtpsv(const v8::FunctionCallbackInfo<v8::Value>& info) {
const CLBlastTriangle uplo = static_cast<CLBlastTriangle>(info[0]->Uint32Value());
const CLBlastTranspose trans = static_cast<CLBlastTranspose>(info[1]->Uint32Value());
const CLBlastDiagonal diag = static_cast<CLBlastDiagonal>(info... |
c1ef028d8613edeb1994c3042bffb51579b36d34 | e7f9d84f48d0a7ce9b3fa26f5ef4557279b72742 | liqian/omim | /drape_frontend/circle_shape.hpp | C++ | hpp | 460 | permissive | #pragma once
#include "drape_frontend/map_shape.hpp"
#include "drape_frontend/shape_view_params.hpp"
namespace df
{
class CircleShape : public MapShape
{
public:
CircleShape(m2::PointF const & mercatorPt, CircleViewParams const & params);
void Draw(ref_ptr<dp::Batcher> batcher, ref_ptr<dp::TextureManager> textu... |
6625ac99f43433b0fbc7dbbf5c00894c8872d009 | d312d07956cf9b4823cbddd8aa1168945a5aabb8 | mldelibero/roboCooler | /code/tests/InitTests/initTests.cpp | C++ | cpp | 1,277 | no_license | #include <CppUTest/TestHarness.h>
#include <CppUTestExt/MockSupport.h>
#include "init.h"
#include "limitSwitchDriver.h"
#include "capTouchDriver.h"
#include "timer.h"
int32_t timer = -1;
extern CLimSwDriver* Opened_LimSwDriver;
extern CLimSwDriver* Closed_LimSwDriver;
TEST_GROUP(InitTests)
{
void setup()
{
... |
216b2cd2490d757660a916303640c3cb19d35295 | 3cfb00470eac4345433e1f9579519e180ad93924 | portegys/Affinity | /src/chemistry/thermal.cpp | C++ | cpp | 2,122 | no_license | /*
* This software is provided under the terms of the GNU General
* Public License as published by the Free Software Foundation.
*
* Copyright (c) 2006-2007 Tom Portegys, All Rights Reserved.
* Permission to use, copy, modify, and distribute this software
* and its documentation for NON-COMMERCIAL purposes and wi... |
cf6b5824f93db2f5336c9037eee416df123d5f36 | 5237fd10b2c1fb6636a64fa871d47125bbd392a5 | dhruwill/Codeforces | /dhruvil_11/122/A [Lucky Division].cpp | C++ | cpp | 741 | no_license | #include<bits/stdc++.h>
using namespace std;
#define pi pair<ll,ll>
#define pb push_back
#define eb emplace_back
#define rep(i,n) for(int i=0;i<n;i++)
#define frep(i,n) for(int i=1;i<=n;i++)
#define vll vector <pair < ll ,ll> >
#define ll long long int
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define... |
6b979f801af2fe0c3911d43a8c119b67b16e93bb | b12134d6db01c00384a15b06f234d4968cc887cb | twesd/editor | /ClientEngine/game/engine/Stage/UnitPart/UnitEvent/UnitEventOperator.cpp | C++ | cpp | 334 | permissive | #include "UnitEventOperator.h"
#include "../UnitBehavior.h"
UnitEventOperator::UnitEventOperator(SharedParams_t params) : UnitEventBase(params)
{
}
UnitEventOperator::~UnitEventOperator(void)
{
}
// Выполняется ли условие
bool UnitEventOperator::IsApprove( core::array<Event_t*>& events )
{
return true;
}
|
4a7d178fdf233b6b2599175c56386254c5409680 | 8ed946a81e71d72d166d1aaed1373dd5e4055cd0 | skull132/robot_center | /src/helpers/fs_helper.cpp | C++ | cpp | 400 | no_license | #include <helpers/fs_helper.hpp>
std::string getHomeDir()
{
const char *homedir;
if ((homedir = getenv("HOME")) == NULL)
homedir = getpwuid(getuid())->pw_dir;
return std::string(homedir);
}
// Awaiting C++17 to use std::filesystem
bool dir_exists(std::string &path)
{
DIR* dir = opendir(path.c_str());
... |
c8f097b0e571cac28f859132f803119958206d7a | 30413820859af1b7c0b1ecc2756dd5135cc2db3b | JetAr/ZLevelDbWin | /build/msvc9/test/test.cpp | C++ | cpp | 2,844 | no_license | // test.cpp : Defines the entry point for the console application.
//
#include <tchar.h>
#include <stdio.h>
#include <Windows.h>
#include <iostream>
#include <conio.h>
#include <stdio.h>
#include <stdlib.h>
#include "leveldb.h"
using std::cout;
using std::endl;
#if defined _DEBUG
#if defined LEVELDB_DLL
#pragma co... |
b5916ed57671c0be5af86cc2b778e76dc413ea6e | 4bbf65e2dd3af1c564f1f1bd819bccf409085b6f | fanll4523/algorithms | /Part11DP/01_万门大学邓哲也/code/dp/KOJ6023_MergeFruits.cpp | C++ | cpp | 1,092 | permissive | //
// 合并果子
// Created by lsg on 2021/10/8.
//
#include <iostream>
#include <climits>
using namespace std;
#define MAX_N 110
int n, a[MAX_N], s[MAX_N], f[MAX_N][MAX_N];
int solve()
{
for (int i = 1; i <= n; i++) {
f[i][i] = 0; // 区间长度只有1，即只有一堆，不需要额外费体力
}
for (int len = 2; len <= n; len++) { // 枚举... |
6eb4e13d97bc5fd497541b37cfb1c3d5d7db40fa | 5a06e7adf4d529fff5ee8bf9c6c4f2289aeaa56d | christian-lanius/CompArchCompetition | /cpu_calc.cpp | C++ | cpp | 1,217 | no_license | /**************************************/
/* You don't have to change this code */
/* Please modify the "gpu_calc.cu" */
/**************************************/
#include <stdio.h>
#include <stdlib.h>
void launch_cpu(int num, double *cpu_mat, double *cpu_convkernel, double *cpu_matDst)
{
////////// initializa... |
95635cf1e9e0f15580079cc301165375ade3055f | 2e3d547c5ab82edaa932cc2e8de805546163ac09 | zeroam/TIL | /cpp_tutorial/cpp_prime_plus/ch08/choices/choices.cpp | C++ | cpp | 612 | permissive | // choices.cpp -- 템플릿 선택
#include <iostream>
template <class T> // #1
T lesser(T a, T b)
{
return a < b ? a : b;
}
int lesser(int a, int b) // #2
{
a = a < 0 ? -a : a;
b = b < 0 ? -b : b;
return a < b ? a : b;
}
int main()
{
using namespace std;
int m = 20;
int n = -30;
double x = 15.5;
double y = 25.9;... |
1509879a25bd12fed4a89a263d6a42d3f49461af | 9b8f59563ddab27369900074f0fdb2da3353fa2d | NikolasMelui/chromium | /content/browser/renderer_host/render_widget_host_input_event_router.cc | C++ | cc | 78,201 | permissive | // Copyright 2015 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/render_widget_host_input_event_router.h"
#include <algorithm>
#include <deque>
#include <vector>
#include "base/... |
654a526b0b6ec869c423fb8e9e15c7880f0110d5 | 25a572bcc0c53dfc89f4f57d59e8ab89728ff07b | dmontesinos/Laboratori-de-Programaci- | /Tema 0/Exercici 10/Exercici10/Exercici10/main.cpp | C++ | cpp | 6,016 | no_license | #include "Empresa.h"
#include <iostream>
#include <math.h>
using namespace std;
void mostraBool(bool logic)
{
if (logic)
cout << "TRUE";
else
cout << "FALSE";
}
float testDadesComanda(Empresa e)
{
float reduccio = 0.0;
const int NPROVES_COMANDA = 5;
const int NPROVES_PRODUCTE = 3;
string nomClientTest[NPRO... |
6010eadb73ae0a4e729d2742a32bc02af11a9c29 | 96d3b932197ff6b10eadc5874697999ce6e37b7a | wuyongxiang/LazySnapping-Android | /app/src/main/cpp/native-lib.cpp | C++ | cpp | 3,320 | no_license | #include <jni.h>
#include <string>
#include <opencv2/core/core.hpp>
#include "Lazy-Snapping.h"
using namespace cv;
using namespace std;
extern "C"
JNIEXPORT jstring JNICALL Java_com_wyx_lazysnappingandroid_LazySnappingHelper_stringFromJNI(
JNIEnv* env
// jclass obj
) {
std::string hello = "Hello ... |
7d651494c7b4421c0f8e0f407d1f43ab1d9be3e1 | e0d04a3ea6d1839ca11a3b4a8db587f5eee8885b | alexandraback/datacollection | /solutions_2751486_0/C++/wardenlovemary/a_small.cpp | C++ | cpp | 832 | no_license | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int n,k;
string s;
bool vowel(char ch){
if(ch=='a')return true;
if(ch=='e')return true;
if(ch=='i')return true;
if(ch=='o')return true;
if(ch=='u')return true;
return false;
}
bool check(string s, int k){
int v[555]... |
3c750509770ed3c1750545d28b45afae82ff5de1 | 9aa3d1b526ee284c17d188373a45fd870fff366a | smorek-intel/level-zero-tests | /conformance_tests/core/test_p2p/src/test_p2p_mem_access.cpp | C++ | cpp | 20,867 | permissive | /*
*
* Copyright (C) 2019 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "gtest/gtest.h"
#include "utils/utils.hpp"
#include "test_harness/test_harness.hpp"
#include "logging/logging.hpp"
namespace lzt = level_zero_tests;
#include <level_zero/ze_api.h>
namespace {
enum MemAccessTestType { A... |
ae69d466f0d4db83de4608a5c0fb19466cf15c20 | 0fce175cc8ca5604331ca097c302b6486eccc2f6 | yang-r/ACM-ICPC | /与 或 异或.cpp | C++ | cpp | 1,106 | no_license |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int data[100005];
int nand[100];
int n, p;
// printf("%d",2^3^4^2);//a^b^a==b
while (scanf_s("%d%d", &n, &p) != EOF) {
memset(data,0,sizeof(data));
memset(nand,0,sizeof(nand));
int ... |
9bf0ee0392cff7e6e1da9d5da61f5a77fd32231c | efb54a727a699a90c6fb76d65fda5882410a6671 | paroj/opencv_contrib | /modules/dnn/src/layers/convolution_layer.cpp | C++ | cpp | 11,619 | permissive | /*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, instal... |
635420cf53b0b04b2fe9c4d3800c822ba27dc366 | 94aa5b76dcc8a623c8c261461bb33bb3a4d211b6 | grimtraveller/juce-samples | /SoundExplorer/Source/MainWindow.cpp | C++ | cpp | 552 | no_license | #include "MainWindow.h"
MainWindow::MainWindow() : DocumentWindow("Sound Explorer",
Colours::lightgrey,
DocumentWindow::allButtons)
{
setContentOwned(new MainContentComponent(), true);
setResizable(true, true);
centreWithSize(getWidth(), getHeight());
setVisible(true);
}
void MainWindow::closeButtonPressed()
{
... |
96d9624e565fa1d71b4132a02cbe35bfa3ec83bb | 9ff504c5c11bf6fb6a103a8accd85ede19b021e0 | amengol/Fanshawe_Game_Jam | /GameEngine_101/src/generalGLStuff.cpp | C++ | cpp | 1,857 | no_license | #include "globalOpenGL_GLFW.h"
std::string decodeGLErrorFromEnum(GLenum error, std::string &details)
{
std::string errText = "";
switch (error)
{
case GL_NO_ERROR:
details = "No error has been recorded.The value of this symbolic constant is guaranteed to be 0.";
return "GL_NO_ERROR";
break;
case GL_INVALID_... |
e925ce513c167dda6dd57553b2e75cc9b39edade | 7cfb41c616cdec7c01d6a63ad2a9387871506417 | sudkannan/leveldb | /util/env_posix.cc | C++ | cc | 24,593 | permissive | // Copyright (c) 2011 The LevelDB Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <pthread.h>
#include <stdio.h>
#incl... |
6a00fb61eea908e4335248c06db83679e47e155f | 3ede6de0180f00d3652b5bde8161f226d5437d1f | cegui/cegui | /cegui/src/ScriptModules/Python/bindings/output/CEGUI/ImagerySectionMap.pypp.cpp | C++ | cpp | 1,100 | permissive | // This file has been generated by Py++.
#include "boost/python.hpp"
#include "indexing_suite/container_suite.hpp"
#include "indexing_suite/map.hpp"
#include "generators/include/python_CEGUI.h"
#include "ImagerySectionMap.pypp.hpp"
namespace bp = boost::python;
void register_ImagerySectionMap_class(){
{ //::std... |
282b3e4c0c8fbfa00b84ad5c4c3e39bf407a19e3 | e434a357e784577376cf87975e2665708351f725 | kshav/My_codes | /File handling/bst.cpp | C++ | cpp | 1,789 | no_license | #include<iostream>
#include<fstream>
using namespace std;
ofstream fout;
ifstream fin;
struct node
{
float n;
node *left,*right;
}*temp,*start,*p,*root;
void func (node *k,node *pr)
{
if((pr->n)>(k->n))
{
if(k->right==NULL)
k->right=pr;
else
func(k->ri... |
7c8ce4a1e67e59ce8a15235972f20d81fa23d3b9 | 151c29cca93d8b0a4f203f70a13913cc5bd74ab4 | githubzhrm0/repro | /python/bindings/pymodule/_type_binding.cc | C++ | cc | 1,585 | permissive | #include <cstddef>
#include <cmath>
#include <sstream>
#include <pybind11/pybind11.h>
#include <pybind11/eigen.h>
#include <pybind11/stl.h>
#include "util/py_relax.h"
namespace py = pybind11;
using std::string;
using std::ostringstream;
using Eigen::MatrixXd;
/*
* Class which requires an integer for construction.... |
70deab80b2a04bee047c12952b2e2e447890f98c | e633d59e375e0993097afbfaa32f4e8f7e14224d | Kobayashi58843/Shader | /ProjectShooter/SourceCode/Resource.cpp | C++ | cpp | 5,696 | no_license | #include"Resource.h"
/*/========/ コンストラクタ /========/*/
Resource::Resource()
{
m_hWnd = nullptr;
m_pDevice11 = nullptr;
m_pContext11 = nullptr;
si.hWnd = nullptr;
si.pDevice = nullptr;
si.pDeviceContext = nullptr;
si.hWnd = nullptr;
si.pDevice = nullptr;
si.pDeviceContext = nullptr;
m_ppStaticModels = null... |
12d27104a5cec690447f6446f51b0d9e5cfe122a | fd01229e141d9edec69e33805a1ec4c2cfb8797d | titaniumbtc/src | /net.cpp | C++ | cpp | 58,436 | 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 "irc.h"
#include "db.h"
#include "net.h"
#include "init.h"
#include "addr... |
5cf98a869c60a6be44a0bb12e514e607b3f2d7e2 | 2b3a46e6915cddeb00601dd62d1c029e4f700607 | caosuomo/rads | /src/rads/chomp/include/capd/vectalg/ColumnVector.hpp | C++ | hpp | 1,088 | no_license | /// @addtogroup vectalg
/// @{
/////////////////////////////////////////////////////////////////////////////
/// @file ColumnVector.hpp
///
/// @author Daniel Wilczak
/////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2000-2005 by the CAPD Group.
//
// This file constitutes... |
475e1a5dcc997e5a669dd23b7d37f78fbec228ac | 73109820c66d8de3233bb3ef5f78e48ca277975f | DRG-Modding/Header-Dumps | /Current/ENE_BoughWasp_Swarm.hpp | C++ | hpp | 942 | no_license | #ifndef UE4SS_SDK_ENE_BoughWasp_Swarm_HPP
#define UE4SS_SDK_ENE_BoughWasp_Swarm_HPP
class AENE_BoughWasp_Swarm_C : public AInsectSwarmEnemy
{
FPointerToUberGraphFrame UberGraphFrame;
class UStatusEffectTriggerComponent* StatusEffectTrigger1;
class USphereComponent* DamageReceiveCollider;
class USphereC... |
23d540b6a639169b98a046f16868a809cec6d316 | 2a2b5fa0c44dc1ec2db05200705a5382db7d6565 | essarrdee/Schaak | /Schaak/Behaviour.cpp | C++ | cpp | 797 | no_license | #include "Behaviour.h"
#include <iostream>
#include <fstream>
#include "Logger.h"
Behaviour::Behaviour(std::string filename)
{
std::fstream f(filename);
f >> name;
LINFO("Name: ");
LAPPEND(name);
while(f.good())
{
std::string evalType;
f >> evalType;
std::pair<int,int> valuePair;
if(evalType == "enemy_... |
6958bd5e009b44623c2b75651da6b569492e4c4a | 062255071cd2a991241924e05abee8dee27410bb | nehamalcom/Competitive-Coding | /partitition2EqualSubset.cpp | C++ | cpp | 1,105 | no_license | class Solution {
public:
bool canPartition(vector<int>& nums) {
int n, sum, i, j;
n = nums.size();
i = 0;
sum = 0;
// get the sum of all the elements
while(i<n){
sum += nums[i];
i++;
}
// check if it is possible to have two sub... |
b075d821416f36899c1210a4e685eb4dce1fd559 | 432e6e80be909ce7bfb5c9e7bcc63be02774b923 | jensonch-wyze/hardware-peripheral-wifi | /rtt.cpp | C++ | cpp | 23,736 | permissive | #include <stdint.h>
#include <fcntl.h>
#include <sys/socket.h>
#include <netlink/genl/genl.h>
#include <netlink/genl/family.h>
#include <netlink/genl/ctrl.h>
#include <linux/rtnetlink.h>
#include <netpacket/packet.h>
#include <linux/filter.h>
#include <linux/errqueue.h>
#include <linux/pkt_sched.h>
#include <netlink/o... |
2c2e6d08c5920866f511f5bb736ede9d9b00d2c4 | c7238ccfe93aa2400db8a8a5fecb19e5c7c0d9d2 | CadQuery/pywrap | /opencascade/BVH_PairDistance.hxx | C++ | hxx | 3,506 | permissive | // Created by: Eugeny MALTCHIKOV
// Created on: 2019-04-17
// Copyright (c) 2019 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as ... |
781b700cf5cccfba77e6259a24f07ebcdb9a3a3f | def4b7ec64501c7b1b663937a56428521822ee46 | seandewar/sdgbc | /src/wxui/sfml_canvas.cpp | C++ | cpp | 2,330 | permissive | #include "wxui/sfml_canvas.h"
#ifdef __WXGTK__
#include <gdk/gdkx.h>
#include <gtk/gtk.h>
#endif
wxBEGIN_EVENT_TABLE(SfmlCanvas, wxControl)
EVT_IDLE(SfmlCanvas::OnIdle)
EVT_PAINT(SfmlCanvas::OnPaint)
EVT_SIZE(SfmlCanvas::OnSize)
EVT_ERASE_BACKGROUND(SfmlCanvas::OnEraseBackground)
EVT_SET_FOC... |
4cee2f3ac0553e719ebfaab630485110c646d81d | c8194e906d931e095ab702e3e82b2d46663904bc | reinhardtken/llvm-project | /lldb/source/API/SBType.cpp | C++ | cpp | 25,740 | permissive | //===-- SBType.cpp ----------------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
c18697423a52871db2da424f6b82c2c1b7ba5126 | 09ba47f26150d6960f21e7ea780a062136cd043a | Logo251/432-Routing-Switching-Software | /router.cpp | C++ | cpp | 5,955 | no_license | #include <cstdlib>
#include <string>
#include <iomanip>
using namespace std;
class Router {
public:
//Local variables
//5th spot is how many bits we deal with.
//each entry is 32 bits, which means max size is 4,294,967,295
u_int32_t table[4][5] =
{
{ 0xffffffff, 0xffffffff, ... |
e0f250b9cf30dec6161e86270b8e182c155b019a | dcd0955812241679fcbaff21fd2a8cb7f4cf048e | eaasna/low-memory-prefilter | /hashmap/lib/seqan3/include/seqan3/utility/parallel/detail/all.hpp | C++ | hpp | 882 | permissive | // -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2020, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2020, Knut Reinert & MPI für molekulare Genetik
// This file may be used, modified and/or redistributed under the terms of th... |
f211737ebdedc2f3630402dd5905b1658a9aa32c | 4fd7a0eb99ccdc4aa7e9ba3231db2e7c77c28a3b | Rizky1408/Tugas | /linked2Switch.cpp | C++ | cpp | 5,730 | no_license | #include <iostream>
using namespace std;
struct Buku
{
string judul, pengarang;
int tahunTerbit;
Buku *next;
};
Buku *head, *tail, *cur, *newNode, *del;
// prototype fungsi sederhana
void createSingleLinklist(string judul, string pengarang, int tahunTerbit);
// tambah di awal single linked list
void ad... |
1791e3347bf692ab091f1065ed28c5505561e5f5 | 4659ceace899a09a1f9fe4b910367fe3f92bcff4 | avalon-icpp-spr19/Bashlovkin-I | /05/for.cpp | C++ | cpp | 4,151 | no_license | #include <iostream>
# include < iomanip >
# include < string >
using namespace std;
int main()
{
setlocale(0, "");
/*Задание 1
Дано N(1 ≤ N ≤ 27).
Найти количество трехзначных натуральных чисел, сумма цифр которых равна N.
Тестовые данные Ожидаемый результат
1 1
27 1
5 ... |
f0312fab40daa9b09c28ed85a7835ae6c8ddc576 | 08cca03305ec4f36784c52af953c591898ae48e0 | sshampine/cPlusPrework | /01-Content/03-ArithmeticExpressions/main.cpp | C++ | cpp | 545 | no_license | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
cout << "Enter your home's value: $";
float value;
cin >> value;
cout << "Enter the tax rate: $";
float taxRate;
cin >> taxRate;
float assessedValue = (value * .6);
float propertyTax = assessedValue / 100 * taxRate;
cout << setpr... |
bd4cd8b1e18e17cc17aab152bff1e9505f25977a | 0720e2f023875adc13307f7ad2eafc5dfedad3a0 | stormtiti/carmen | /utils/dloop/src/DUtils/Random.cpp | C++ | cpp | 3,377 | no_license | /*
* File: Random.cpp
* Project: DUtils library
* Author: Dorian Galvez-Lopez
* Date: April 2010
* Description: manages pseudo-random numbers
*
*
* 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 So... |
5c2c7b8e01028cb35002119c429c984a1e870e87 | 21b3672925535c663e7a92f540b74b2488ab0072 | aboerzel/German_License_Plate_Recognition | /android/OpenCV/native/jni/include/opencv2/core/opencl/opencl_info.hpp | C++ | hpp | 7,997 | permissive | // This file is part of OpenCV project.
// It is subject to the license terms in the LICENSE file found in the top-level directory
// of this distribution and at http://opencv.org/license.html.
#include <iostream>
#include <opencv2/core.hpp>
#include <opencv2/core/ocl.hpp>
#ifndef DUMP_CONFIG_PROPERTY
#define DUMP_C... |
5164572a99840cc1861fc48eeccc657d8bc9ea7e | db9e587eb6ecd67ae616e430179c55202a65512b | merge-swap/fornix-wallet | /src/qt/optionsdialog.cpp | C++ | cpp | 11,361 | 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.
#if defined(HAVE_CONFIG_H)
#include "config/fornix-config.h"
#endif
#include "optionsdialog.h"
#include "ui_optionsdialog.h"
... |
9274d4d2ede83f348188a34d0f372d08d7351ecc | 70c3b81e38c147c95aef4846654db5d2d8ea1f88 | AnuragBarfa/lear11 | /media/documents/1st_febf2Xg.cpp | C++ | cpp | 543 | no_license | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;cin>>x;
int h,m;cin>>h>>m;
long long ans=0;
while(h!=7 && h!=17 && m!=7 && m!=17 && m!=27 && m!=37 && m!=47 && m!=57){
if(m>=x){
m=m-x;
ans++;
}
else{
if(h>0){
h=... |
5608c03bb8105fe0c8ae215346fde2deaae06618 | 800ee81b16a8f1bb707c5235820220e39a566657 | itsoulos/IntervalGenetic | /constrainedadam.cpp | C++ | cpp | 2,481 | no_license | #include "constrainedadam.h"
#include <math.h>
#include <omp.h>
ConstrainedAdam::ConstrainedAdam(Problem *p)
{
target = p;
learningRate = 0.25;
iterations = 100000;
gradient.resize(p->getDimension(),0.0);
M_0.resize(p->getDimension(),0.0);
U_0.resize(p->getDimension(),0.0);
rM = target->get... |
3b40c106f5234009482cb931f52c2ccd98b9e876 | 9f08860c6a79c3456b1a8356e64aedaad4f88074 | Rengaht/PBioMusic_src | /main.cpp | C++ | cpp | 1,410 | no_license | #include "ofMain.h"
#include "ofApp.h"
//========================================================================
string GlobalParam::ParamFilePath="_param.xml";
ofVec2f* PacMan::Direction=new ofVec2f[5]{ofVec2f(1,0),ofVec2f(1,1),ofVec2f(0,1),ofVec2f(-1,1),ofVec2f(-1,0)};
ofVec2f* PacMan::GDirection=new ofVec2f[5]... |
55659188f91030db01ecbe710e808a88667836e3 | ac2921de84aa7a4f43c47c1abdbc8ede73fc1360 | andrewlangemann/Cities3D | /trunk/Cities3D/src/Cities3D/LayoutManager.cpp | C++ | cpp | 4,841 | no_license | /*
* Cities3D - Copyright (C) 2001-2009 Jason Fugate (saladyears@gmail.com)
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
*... |
1b0e7bf37b97a1321430dae5288c5e74642cb80b | 3994803c645f114ad37bf34222c0a8316c8c56bb | GGBone/WM4 | /GeometryTool/LibGraphics/SceneGraph/Wm4Polypoint.cpp | C++ | cpp | 3,571 | no_license | // Geometric Tools, Inc.
// http://www.geometrictools.com
// Copyright (c) 1998-2006. All Rights Reserved
//
// The Wild Magic Version 4 Restricted Libraries source code is supplied
// under the terms of the license agreement
// http://www.geometrictools.com/License/Wm4RestrictedLicense.pdf
// and may not be copie... |
e2bcf71f1db1e8a207c5c2d5dd6cffe92b415a1f | 4b801a54d4ba5d1337bc054399f05925fa3cd7cd | maciekboni/PSU-CIDD-Malaria-Simulation | /src/Strategies/IStrategy.cpp | C++ | cpp | 424 | no_license | #include "IStrategy.h"
std::map<std::string, IStrategy::StrategyType> IStrategy::StrategyTypeMap{
{"SFT", SFT},
{"Cycling", Cycling},
{"AdaptiveCycling", AdaptiveCycling},
{"MFT", MFT},
{"MFTRebalancing", MFTRebalancing},
{"NestedMFT", NestedMFT},
{"MFTMultiLocation", MFTMultiLocation},
... |
32f184e33c239a8278d599abb6cf1709b0d7cb30 | 8062577988db59f64b74bddeee6fc672fdf53c75 | TheLaughingMan2501/CCCaster | /targets/DllAsmHacks.hpp | C++ | hpp | 21,822 | permissive | #pragma once
#ifdef STEAM_VER
#include "Constants_ST.hpp"
#else
#include "Constants.hpp"
#endif
#include "Exceptions.hpp"
#include <vector>
#include <array>
#define WRITE_ASM_HACK(ASM_HACK) \
do { ... |
4c36198c8b01d1cb12a77aed4f837f405276b498 | 4fa438ebdcf7a1c1c39e68f4a18af7ba4d736df0 | capmayer/paradigmas | /t8/template_gerator.cpp | C++ | cpp | 9,102 | no_license | #include <string>
#include <vector>
#include <iostream>
#include <sstream>
#include <fstream>
#include <FL/Fl.H>
#include <FL/Fl_Window.H>
#include <FL/Fl_Box.H>
#include <FL/Fl_Button.H>
#include <FL/Fl_Input.H>
#include <FL/Fl_Table.H>
using namespace std;
class GenericField {
private:
string id;
string l... |
4222fd31e07bb415c123f7801aaf0653b9a23c66 | 3d1da0abb78fd4c3ca155a813e7acabbb82a5f39 | airspeedswift/swift | /lib/SILOptimizer/Analysis/DifferentiableActivityAnalysis.cpp | C++ | cpp | 23,774 | permissive | //===--- DifferentiableActivityAnalysis.h ----------------------*- C++ -*-===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2019 - 2020 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LI... |
e379d4003e7a867a54d659a6fe9602900e9a6b30 | 514de42ae9884f01a1d0c2b1eeca3a0e10c03235 | sungsooha/PerformanceAnalysis | /include/chimbuko/message.hpp | C++ | hpp | 4,031 | no_license | #pragma once
#include <string>
#include <iostream>
#include <nlohmann/json.hpp>
namespace chimbuko {
enum MessageType {
REQ_ADD = 1,
REQ_GET = 2,
REQ_CMD = 3,
REQ_QUIT = 4,
REQ_ECHO = 5,
REP_ADD = 10,
REP_GET = 20,
REP_CMD = 30,
REP_QUIT = 40,
REP_ECHO = 50
};
enum ... |
2e9c556cf0844b2aed31ff6a406488d9debbd256 | 487a1ebf5b750cdfd4625850e44e6a3b120a2045 | tornado12345/ChakraCore | /lib/Runtime/Library/TypedArray.cpp | C++ | cpp | 138,407 | permissive | //-------------------------------------------------------------------------------------------------------
// Copyright (C) Microsoft. All rights reserved.
// Copyright (c) 2021 ChakraCore Project Contributors. All rights reserved.
// Licensed under the MIT license. See LICENSE.txt file in the project root for full lice... |
5e57c34dd60074c920292c8fe9260510b2e186c6 | 8c857e003639a2db05f11c3e3c93e8b455d0b035 | fsps60312/CSRT | /common/block/blocks.hpp | C++ | hpp | 1,423 | no_license | #pragma once
#include<common/visible_object.hpp>
#include<common/block/block.hpp>
#include<common/control.hpp>
#include<common/camera.hpp>
#include<deque>
#include<map>
namespace block {
bool IsCollidable(const glm::dvec3& position);
Block* GetBlock(const glm::dvec3& position);
glm::ivec2 GetPositionId(con... |
3c3227d8851176791e7e3d9aa5375807e4d34835 | ae2a3820fe00edf6020d1f093fbeee3d9929f449 | moteus/FastFormat | /include/fastformat/inserters/WindowsLargeIntegers.hpp | C++ | hpp | 3,717 | permissive | /* /////////////////////////////////////////////////////////////////////////
* File: fastformat/inserters/WindowsLargeIntegers.hpp
*
* Purpose: Inserter functions for Windows' large integer types.
*
* Created: 13th September 2010
* Updated: 30th November 2010
*
* Home: http://www.fastf... |
55833978587f59b30ee6f270295b0daa1f9fd52f | 1349fed877c18faa0370a45e7a0dd2d9b38763a5 | Xuhui-Wang/poj-solutions | /1731/1690613_AC_124MS_96K.cpp | C++ | cpp | 307 | permissive | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
void main()
{
char cOrder[220];
cin>>cOrder;
sort(cOrder,cOrder+strlen(cOrder));
//cout<<cOrder<<endl;
do
{
cout<<cOrder<<endl;
}while(next_permutation(cOrder,cOrder+strlen(cOrder)));
} |
92bdafbdc58ef617696cb136270f218e790dc600 | fc0bfaf277708d56ca0345274f4088960ceaed33 | KarinHaim/Transportation | /Tests/SearchTester.cpp | C++ | cpp | 23,758 | no_license | /*
#include <gtest/gtest.h>
#include "../Search.h"
#include "../Map.h"
*/
/*
* SearchTester is a test fixture class which includes tests of Search class using
* Google's Testing Framework.
*//*
class SearchTester : public testing::Test {
protected:
Map* map;
//Initializes the map each time a test is execu... |
faee512a15b6ec0f09a0ca83bde3492aabb91c55 | a7deb0b29a1ee7a23126e350e08e2df28c50e991 | chendingyan/CPP_CW2016 | /src/DynamicObject.cpp | C++ | cpp | 935 | no_license | #include "DynamicObject.h"
DynamicObject::DynamicObject(GoldMinerEngine * pEngine, int sizeX, int sizeY, int posX, int posY, int speed)
: HookableObject(pEngine, sizeX, sizeY, posX, posY),
m_pEngine(pEngine),
m_speed(speed),
direction(1)
{
}
DynamicObject::~DynamicObject()
{
}
void DynamicObj... |
8db2ffc46e22200ced10a726fc5d7f160604b0b2 | 3931751b691f22ffa22f2b730bc119af554ceebc | fervensong/allforonebusiness | /src/qt/transactiondesc.cpp | C++ | cpp | 14,781 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2019 The PIVX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "transactiondesc.h"
#i... |
5a3cc2a79195aa9758a160e80034027dcc21cc78 | 588d2a6bd9da58a2cc3861af66f1a63eea2af4b9 | JiangMingchen/PAT-Advanced-Level-Problems-using-Cpp | /28.cpp | C++ | cpp | 1,260 | no_license | #include<bits/stdc++.h>
using namespace std;
struct student
{
int id;
char name[100];
int grade;
};
bool cmp_id(student a, student b)
{
return a.id < b.id;
}
bool cmp_name(student a, student b)
{
if(strcmp(a.name, b.name) != 0)
return strcmp(a.name, b.name) < 0;
else
return a.id < b.id;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.