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 |
|---|---|---|---|---|---|---|---|---|
4eac25f22033b61ce7c3938571fad9ebd3e1eb59 | 365ab3b624b22082af646f1e2cea540e82e27631 | WhiZTiM/coliru | /Archive/caee686e087bb3ca998d6b664121ddf7-32a6e5f2314a4a4ca8f18a71857ce8f2/main.cpp | C++ | cpp | 2,759 | no_license | #include <boost/exception/all.hpp>
#include <algorithm>
struct ExceptionBase : virtual std::exception, virtual boost::exception {};
struct SystemError : ExceptionBase {};
struct PermissionsError : SystemError {};
struct ImageError : ExceptionBase {};
struct ImageParseError : ImageError {};
struct InvalidExtension : I... |
6ecd9149b52a594bcd284eb76e3b7dfc0e4a3caf | f21657bc7a6633c9e0bdf95c9a9257c55f60e9f1 | pinetum/Rosa | /MyImage.cpp | C++ | cpp | 22,174 | no_license | #include "MyImage.h"
#include "MainFrame.h"
#include <wx/log.h>
#include <vector>
#include "math.h"
#include "myUtil.h"
#define HISTORGAM_IMG_WIDTH 512
#define HISTORGAM_IMG_HEIGHT 300
#define HISTORGAM_LINE_THICKNESS 1
MyImage::MyImage()
{
m_oralCancerKdeMode = -1;
title = "NULL";
}
MyImage::MyImage(cv::... |
0855d7c68432b1868627c56328f53da6d664a1a0 | 85794014e06fb7f50c8548bae1c9b5d42adad670 | eshafeeqe/SceneGraphRendering | /Examples/ModelViewer/main.cpp | C++ | cpp | 4,386 | no_license | #include <iostream>
#include <chrono>
#include <thread>
#include <Eigen/Eigen>
#include <pangolin/pangolin.h>
#include <pangolin/display.h>
#include <SceneGraph/SceneGraph.h>
#include <assimp/postprocess.h>
#include <assimp/Exporter.hpp>
using namespace std;
using namespace pangolin;
void Usage() {
cout << "Usa... |
639ce8ef6cefc9e056acb2c7f4e9e6c385e7fdb8 | 5574a4fac6a4c34377bdf99bb9af483f98afd86e | votegrasp/simulation_grasping | /franka_vision_manipulation/franka_tminplan/src/test_gripper_node.cpp | C++ | cpp | 1,226 | no_license | #include <iostream>
#include <sstream>
#include <string>
#include <thread>
#include <franka_tminplan/test_gripper.h>
int main(int argc, char **argv)
{
ros::init(argc, argv, "gripper_publisher");
ros::NodeHandle n("~");
double width, epsilon_inner, epsilon_outer, speed, force;
n.getParam("epsilon_inner", e... |
3d82533f9904183529623231d855424914b60779 | e127aa6432a5619dccde417c9e5db8b4dd92256c | seccijr/es.upm.euitt.pfg.comm | /src/WiFlyWiFi.cpp | C++ | cpp | 3,385 | no_license | #include <WiFlyWiFi.h>
#include <Arduino.h>
#include "utility/WiFlyDrv.h"
#include "utility/wfl_definitions.h"
#include "utility/wfl_spi.h"
#include "utility/wfl_types.h"
int WiFlyWiFiClass::begin(char *ssid) {
uint8_t status = WFL_IDLE_STATUS;
uint8_t attempts = WFL_MAX_ATTEMPT_CONNECTION;
WiFlyDrv::init(... |
d71adf3c4cc8d7d22e9bbc1697b0800be84e9e40 | 491f62eef1f9e76d9ac08f6942a46989264987ba | rakesh-iiest/tqec | /geometry.cpp | C++ | cpp | 2,636 | no_license | #include <stdio.h>
#include <string>
#include <algorithm>
#include "cnotcounter.h"
#include "geometry.h"
#include "gatenumbers.h"
#include "circuitmatrix.h"
int geometry::addIOPoint(convertcoordinate& ioc, bool isInit)
{
int ioIndex = addCoordinate(ioc);
io.push_back(ioIndex);
return ioIndex;
}
bool geometry::rem... |
e2926767b535598f0da1afa4d804c6058990802a | f93c0385632712eff337d41980f2b8694d6091b0 | puyuliao/ZeroJudge | /a569.cpp | C++ | cpp | 1,119 | permissive | #include <stdio.h>
#include <stdint.h>
#define MAXN 10000001
char in[100000];
int a[10001];
int atop = 0;
int prime[2000000];
int ptop;
unsigned int bs[MAXN>>5]={0xc0000000};
int cnt;
inline bool test(int n){
int p = n&31;
p = 1 << (31-p);
return (bs[n>>5]&p)!=0;
}
inline void settrue(int n){
... |
a8072fb6d0f5189987e0468dd95e6789d036262c | 9aa40d89f805a51f223610986e2da1bde6780aa4 | lsh9034/Baekjoon-Code | /백준/Cubeditor.cpp | C++ | cpp | 1,319 | no_license | //pi를 구해야되지만 0번지부터 시작하는 접미사로만 구하는게 아니라 모든 부분문자열이기떄문에 0번지부터 끝까지 시작점을 두면서 접미사를 구하고 이를
//통해 pi를 구하는 문제 주의할 점은 pi[begin+match-1]에서 대괄호안에 절대 +i를 하면 안됀다는 것이다. 저걸해도 머릿속으로 생각되는 예제들은
//다 통과하지만 예외가 분명있다. 만약 2번지부터 접미사를 구한다고하면 2번지와 3번지가 일치하면 2번째 문자에 대한 pi값이기 때문에 pi[1]에 들어가야된다.
#include<iostream>
#include<vector>
#include<string>
... |
0f52723430cc25e042745bf2a3977fd07700215d | 0b8af2efb707b1e509191ec495ff87d49a85e97d | niranjani999/IPMP | /Week_6/Trees_15.cpp | C++ | cpp | 956 | no_license | class Solution {
public:
int inorder_p(TreeNode* root) {
root = root->left;
while(root->right) root = root->right;
return root->val;
}
int inorder_s(TreeNode* root) {
root = root->right;
while(root->left) root = root->left;
return root->val;
}
TreeNode... |
bd1230ba92168e9fce89f6b16222fcf28c8fbcf1 | 855f4f17113d5d8c960835c6adf065b18bd12046 | oesteban/AutoReg | /Code/src/vphSISCOMTest.cxx | C++ | cxx | 34,155 | no_license | /*
Copyright (c) 2010, Oscar Esteban - oesteban@die.upm.es
with Biomedical Image Technology, UPM (BIT-UPM)
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... |
6d0f56c8e3611055572354666223d9472c01f4fd | 422d277434082452505e5dd3def882a59350d757 | linuxmao-org/regrader-port | /utils/sources/rescc.cpp | C++ | cpp | 4,443 | permissive | /**
* The MIT License (MIT)
*
* Copyright (c) 2019 Jean Pierre Cimalando
*
* 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 ... |
cba497eb4e112e61cb692fcad74e3ffae5d5dec0 | 80927c00ee6e5f3bc2f69142708fecfea04a2a1f | tomershahr/Compi | /tables.cpp | C++ | cpp | 5,359 | no_license | #include <string>
#include <vector>
#include <iostream>
#include "hw3_output.hpp"
enum scope_type{regular_scope,while_scope,switch_scope};
using namespace std;
using namespace output;
class Entry{
public:
string name;
string type;
int offset;
vector<string> args_types;
bool is_func;... |
b5c717bb63c9ad81802ebabca2cf5de217dd95c1 | f7635b73bdb246b1930ef6406b835fe50d1d1cd6 | CORP-RESELLER/rippled | /src/ripple/test/jtx/impl/Env_test.cpp | C++ | cpp | 19,934 | permissive | //------------------------------------------------------------------------------
/*
This file is part of rippled: https://github.com/ripple/rippled
Copyright (c) 2012, 2013 Ripple Labs Inc.
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby ... |
e7007d4867d1996153b70d1eb6933fe8c765606c | 0c152d2bb6ab6093ad77a1e5ec2015631887d5c9 | skeeter0/crane | /ZFNestHandlers/dllmain.cpp | C++ | cpp | 686 | no_license | // dllmain.cpp: DllMain 的实现。
#include "pch.h"
#include "framework.h"
#include "resource.h"
#include "ZFNestHandlers_i.h"
#include "dllmain.h"
#include "xdlldata.h"
CZFNestHandlersModule _AtlModule;
class CZFNestHandlersApp : public CWinApp
{
public:
// 重写
virtual BOOL InitInstance();
virtual int ExitInstance();
... |
649f6c41d7666c35b834e78f4e1c741f86d95928 | f996edc17928de1a013d15ca5478c2d6cdae1423 | zenoalbisser/chromium | /cc/tiles/picture_layer_tiling_perftest.cc | C++ | cc | 6,029 | permissive | // Copyright 2013 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 "cc/debug/lap_timer.h"
#include "cc/resources/resource_provider.h"
#include "cc/resources/scoped_resource.h"
#include "cc/test/fake_display_list_... |
54b430caa0abcc792c60b74174bfda19dc3afa9c | 76a11854660c220d73e3257d5e65e3b93d9de8f0 | RaulGalvanBazan/CompuGraficaAvanzada | /07-Colisiones/src/main.cpp | C++ | cpp | 77,703 | no_license | #define _USE_MATH_DEFINES
#include <cmath>
//glew include
#include <GL/glew.h>
//std includes
#include <string>
#include <iostream>
//glfw include
#include <GLFW/glfw3.h>
// program include
#include "Headers/TimeManager.h"
// Shader include
#include "Headers/Shader.h"
// Model geometric includes
... |
7516a8a28f5e5ab64b9ccd9726487c33510db99c | f156a21205bc78be5aa35bc5e12a2b905fc18d3c | AnhVietPham/Programming-Exercise | /recursion/two-dimensional-array.cpp | C++ | cpp | 5,146 | no_license | #include <iostream>
#include <limits.h>
using namespace std;
/*
1/ Input two dimensional array
2/ Output two dimensional array
3/ Sum of all element in two dimensional array
4/ Min and Max in two dimensional array
5/ Quantity of even number in two dimensional array
6/ Arrange incresing and decresing two dimensional ar... |
bab35f465d6b4ef5d29be22d303bc2b336bbba73 | c150d9256d923bf6b71179d439d8ba9c7bab654d | NeuroRoboticTech/AnimatLabVersion1 | /VS7/Libraries/StdUtils/StdAvi.cpp | C++ | cpp | 17,537 | no_license | /* CStdAvi.cpp
A C++ class for creating AVI files
Copyright (c) 2002 Lucian Wischik. (99% of StdAvi.cpp is based on code from
Lucian Wischik)
Copyright (c) 2004, 2005 René Nyffenegger (adding C++ class features)
This source code is provided 'as-is', wi... |
18d71e0cd57a698e0bbc2bc9199ce32898866df9 | 149ca3cd1466d4044a8787edaee81522357e2c35 | shinichirotakeda/oistapp | /Module/include/OISTReadDataFile_NT.hh | C++ | hh | 870 | no_license | #ifndef OISTAPP_OISTReadDataFile_NT_H
#define OISTAPP_OISTReadDataFile_NT_H 1
#include "ReadDataFile.hh"
#include <cstdint>
#include <memory>
class TChain;
namespace oistapp {
class OISTReadDataFile_NT : public comptonsoft::ReadDataFile
{
DEFINE_ANL_MODULE(OISTReadDataFile_NT, 1.0);
public:
OISTReadD... |
3d70bcebe06897fdbf6b5cfb0831d90441b412b6 | 46e822c21c02eb9554f37385f53bb50922bd8e92 | SuryankDixit/Problem-Solving | /MATHS/lc-1267-count-servers.cpp | C++ | cpp | 1,055 | no_license | class Solution {
public:
int countServers(vector<vector<int>>& grid) {
map<int,int> r,c;
vector<int> row,col;
int ans=0;
for(int i=0;i<grid.size();i++){
int sum = accumulate(grid[i].begin(),grid[i].end(),0);
// r[i] =sum;
if(sum>1){
... |
0bcbd6c6de0c86c0d38b24dbc11bd46067fdb64d | 172f006511b3f94ea035005dc05ae3be61ca202d | liuwenye2010/prj_cpp | /stl/transformers/binary-transformation.cpp | C++ | cpp | 766 | no_license |
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
using namespace std;
template <typename T>
class embiggen {
T _accum = 1;
public:
T operator() (const T & n1, const T & n2) { return _accum = n1 * n2 * _accum; }
};
template <typename T>
void disp_v(vector<T> & v) {
if(!v.si... |
e611ec83c6d5ffc580dce1fe501d1025bd165743 | d0e6e5d9cbb529094b51454128f5959efa7d12e9 | almostinf/EGE-C- | /EGE C/24/24_count_2_simular.cpp | C++ | cpp | 584 | no_license | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
int main() {
ifstream file("24_count_2_simular.txt");
string str;
file >> str;
map<char, int> mp;
vector<int> vec;
for (int i = 1; i < str.size() -... |
074bc78df75040a6ff83524ce8eeebc089e8c570 | 15c2d15b77e439032b18a24a80531b0e3a518d40 | sbillah/GeneralUtility | /alg/alg/manual_recursive/example2.cpp | C++ | cpp | 2,282 | no_license | //task:
//Implement traverse a tree
// trav (t.lc)
// print t.v
// trav (t.rc)
//
//requirements:
// use recursive thinking
// but without real - recursive, i.e. need manual construct a stack
//
#include "stdafx.h"
#include "assert.h"
#include "memory.h"
struct Node
{
Node *lc, *rc;
int v;
};
struct Placeholder
{... |
7a87ac122f7b45ed31af3382569f56324a3d942c | 8427d0ccccb6c784a1b929a0fe298690a98f38b9 | TonyYHsieh/rocBLAS | /library/src/check_numerics_vector.cpp | C++ | cpp | 12,983 | permissive | /* ************************************************************************
* Copyright (C) 2020-2023 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
* ... |
e3fb9c484e38e1341e94b6418434dafd203440e5 | d830cc0ecebb1284008b66370900f8dd25189f8a | aeremin/Codeforces | /alexey/Solvers/6xx/611/Solver611F.cpp | C++ | cpp | 3,748 | no_license | #include <Solvers/pch.h>
#include "algo/number_theory/residue.h"
using namespace std;
// Solution for Codeforces problem http://codeforces.com/contest/611/problem/F
class Solver611F {
public:
void run();
int64_t patternLen, width, height;
string pattern;
void prolongArray(vector<int64_t>& times, ... |
9eb72b33f36e22d4b7f6ba71c6733807b6da757a | 94e60c552cfca0c0ca138669f99d8108da345dba | FeiZhan/Algo-Collection | /answers/lintcode/Merge Intervals.cpp | C++ | cpp | 823 | permissive | /**
* Definition of Interval:
* classs Interval {
* int start, end;
* Interval(int start, int end) {
* this->start = start;
* this->end = end;
* }
*/
class Solution {
public:
/**
* @param intervals: interval list.
* @return: A new interval list.
*/
... |
b7a3284210302bf75f05e2946246307c2dcfb265 | 95a83d55c2957115b937e35b35ec419a8972fc89 | wuyou33/pi-cnn | /Thirdparty/cuda_utils_5.0/examples/deviceQueryDrv/deviceQueryDrv.cpp | C++ | cpp | 12,381 | no_license | /*
* Copyright 1993-2012 NVIDIA Corporation. All rights reserved.
*
* Please refer to the NVIDIA end user license agreement (EULA) associated
* with this source code for terms and conditions that govern your use of
* this software. Any use, reproduction, disclosure, or distribution of
* this software and related... |
ac8d0b73e0441513416df9292aa971b462694445 | 180bd5602fe41c4e0988f6f9d1062ab6f94c9f45 | xbigot/emtg | /tags/stable_10_3_2014/src/mission.cpp | C++ | cpp | 97,478 | permissive | /*
* mission.cpp
*
* Created on: Jul 17, 2012
* Author: Jacob
*/
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <set>
#include "journey.h"
#include "mission.h"
#include "missionoptions.h"
#include "file_utilities.h"
#include "universe.h"
#include "EMTG... |
374e85ea15541ae525d2fb90482fe174b5879b7e | eba88c92589b24eb17b47902c9bff65ea104810f | arangodb/arangodb | /3rdParty/boost/1.78.0/libs/metaparse/tools/benchmark/include/benchmark_util.hpp | C++ | hpp | 17,636 | permissive | // Copyright Szabolcs Toth (thszabi@gmail.com) 2016.
// Copyright Abel Sinkovics (abel@sinkovics.hu) 2016.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/metaparse/string.hpp>
templ... |
8b1c703943dcd9d2d509e269d854b76f7dd311ca | 74a5336c9c55cbaf40ea8ed49d7b440af876d8f2 | yangkang411/ACFLY-Modified | /Modes/MSafe.cpp | C++ | cpp | 14,081 | no_license | /*
MSafe安全模式
用户模式一定时间不进行控制
或调用enter_MSafe会进入此模式
进入安全模式后（ForceMSafeCtrl）
用户模式控制将失效
用户模式同时进行水平（XY位置或姿态）
和垂直高度控制可退出MSafe获得控制权
！！不建议一般用户更改此文件！！
！！此文件需经过验证再发布！！
*/
#include "Basic.hpp"
#include "Modes.hpp"
#include "FreeRTOS.h"
#include "task.h"
#include "Receiver.hpp"
#include "ControlSystem.hpp"
#include "... |
dc42d8673f177c02c211a367be3cf227d77ef4dd | 8ae2768f9eef8883f672afae889a20cb49951e4e | yuanhn5206/kafka_cpp | /consumer/bench/src/server.cpp | C++ | cpp | 1,217 | no_license | #include "server.h"
#include <iostream>
#include <sstream>
#include <string>
Server::Server()
{
running_ = false;
}
Server::~Server()
{
}
void Server::open()
{
if (true == running_) return;
running_ = true;
std::thread t(std::bind(&Server::run, this));
t.detach();
}
void Server::run()
{
... |
39ee76d692ae3c44a9a209e302bd94b057ea72a5 | 162e67ff441e78a756dd9cb6c80cc1cc5a099ec8 | ccdxc/logSurvey | /data/crawl/git/new_hunk_4092.cpp | C++ | cpp | 1,038 | no_license | #include "cache.h"
#include "string-list.h"
void write_list(const struct string_list *list)
{
int i;
for (i = 0; i < list->nr; i++)
printf("[%d]: \"%s\"\n", i, list->items[i].string);
}
int main(int argc, char **argv)
{
if (argc == 5 && !strcmp(argv[1], "split")) {
struct string_list list = STRING_LIST_INIT_DU... |
d1d8e7c8865db483ea59199f8e3cf77ae1305e2b | 4b654de6ecb4b9bf6d53a135d7d95b1ef266d861 | taptalk-io/taptalk.io-ios | /Pods/Realm/core/realm-sync.xcframework/watchos-armv7k_arm64_32/Headers/realm/sync/instruction_applier.hpp | C++ | hpp | 6,568 | permissive | /*************************************************************************
*
* Copyright 2017 Realm 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/lice... |
11e044071a162a8203c04dcc959b074499299791 | aab26498a9b8c56b338e4693c0e5403655ccaa1f | jjzhang166/WinNT5_src_20201004 | /NT/com/ole32/stg/h/wdocfile.hxx | C++ | hxx | 15,064 | no_license | //+--------------------------------------------------------------
//
// Microsoft Windows
// Copyright (C) Microsoft Corporation, 1992 - 1992.
//
// File: wdocfile.hxx
//
// Contents: CWrappedDocFile class header
//
// Classes: CWrappedDocFile
//
// History: 06-Jan-92 DrewB Created
//
//-------------... |
f0dbf11779bdb46944ac8f9346a6b5dae2455d1f | 83c4e3716d4b492efe3bb3665416030818f96d67 | mmcilroy/hulk_fix | /test/test_decoder.cpp | C++ | cpp | 1,509 | no_license |
#include <hulk/fix/decoder.h>
#include <cassert>
using namespace hulk;
size_t num_decoded = 0;
std::string msg;
void build_message( std::string& str )
{
str.append( "8=FIX.4.2" ); str.append( "\x1" );
str.append( "58=TEST" ); str.append( "\x1" );
str.append( "10=000" ); str.append( "\x1" );... |
8eb7e2e67f8083fd3c8379093b8144929246283d | 119f4691dd94592d0f9282013dd13805a6460b80 | mililanirobotics/FRC2019 | /PGFRC2019timedRobot/src/main/cpp/Robot.cpp | C++ | cpp | 7,410 | no_license | /*----------------------------------------------------------------------------*/
/* Copyright (c) 2017-2018 FIRST. All Rights Reserved. */
/* Open Source Software - may be modified and shared by FRC teams. The code */
/* must be accompanied by the FIRST BSD license file in the root directory of... |
19bc1af29be28e0bc51a1310cc26f9ce9dc96334 | 686a68910b27a02844b6bcaf3663d0d5f0d13b5d | nlatham1999/guwt-mobile-app | /Library/Il2cppBuildCache/iOS/il2cppOutput/UnityEngine.UIModule_Attr 2.cpp | C++ | cpp | 120,599 | no_license | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <limits>
#include <stdint.h>
// System.Char[]
struct CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34;
// System.Type[]
struct TypeU5BU5D_t85B10489E46F06CEC7C4B1CCBD0E01FAB6649755;
// System.Reflection.Bin... |
b0139e89b71888972c2985a8373d92f1070fec92 | 359b325cea2b19a9a85c79762ac3f2d56ee8cf7a | moguigame/moguigame | /Mogui/socket/IOCP.cpp | C++ | cpp | 12,832 | no_license | #include "SocketDefine.h"
#include "IOCP.h"
#include "Connect.h"
#include "MoguiFunc.h"
namespace Mogui
{
extern void Mogui_InitLogger(const char* prefix, int level);
extern void Mogui_FiniLogger(void);
extern void Mogui_Log( char* szstr, ...);
extern void Mogui_Debug( char* szstr, ...);
extern void Mogui_Error( ... |
6417c0aa25ef49937ef8a7230c0507266f95ae8c | bd438922ef3e5e07c634fda7cb1119e23013e67e | fourseaLee/websocket | /relay/src/warnings.cpp | C++ | cpp | 2,684 | no_license | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2017 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <sync.h>
#include <util.h>
#include <warnings.h>
CCriticalSection cs_wa... |
c0c5dde6e76794a6663a32a51c0ac5e9c99118d0 | f0d74cd4407d858d4784701e9b47fac6a67642ee | nghiaviminh/GPTP | /GPTP/hooks/orders/spidermine_inject.cpp | C++ | cpp | 1,117 | no_license | #include "spidermine.h"
#include "../../hook_tools.h"
namespace {
void __declspec(naked) SpiderMine_EnemyProcWrapper() {
static CUnit* spiderMine;
static CUnit* target;
static Bool32 result;
__asm {
MOV spiderMine, EDX
MOV target, ECX
PUSHAD
}
result = hooks::SpiderMine_EnemyProc(spide... |
4ffb7f2b294d176c4ffc30f3a4ef5189fc451238 | df8947e8a34869b390666cd31d324e599dae8b9e | liviutzman/ygopro | /gframe/duelclient.cpp | C++ | cpp | 115,065 | no_license | #include "duelclient.h"
#include "client_card.h"
#include "materials.h"
#include "image_manager.h"
#include "single_mode.h"
#include "../ocgcore/field.h"
#include "../ocgcore/duel.h"
#include "game.h"
#include "replay.h"
#include "replay_mode.h"
namespace ygo {
unsigned DuelClient::connect_state = 0;
unsigned char Du... |
a5966ae4c6de2547fe54b0a8e08973fe387bc9fa | 757e564d1b3a192f148d76b57e35134aafe0e55b | kenny8654/CodesBackUp | /C++/TOJ/123.cpp | C++ | cpp | 2,539 | no_license | // by. MiohitoKiri5474
#include<bits/stdc++.h>
#pragma GCC optimize ( "O3" )
#pragma loop_opt ( on )
using namespace std;
typedef long long LL;
// define tools
#define REPP(i,f,s) for ( int i = f ; i < s ; i++ )
#define REPM(i,f,s) for ( int i = f ; i >= s ; i-- )
#define REPALL(i,n) for ( auto &i: n )
#define debu... |
6f041ad8a609dc8e87872a18f1ea9a7ed2a7db13 | 1f941bce57b91eda05d770c55155e82e05010a5e | Mrxiang-Plus/keypoint | /src/demo12_1.cpp | C++ | cpp | 8,565 | no_license | //
// Created by xiang on 2019/10/22.
//
/*
* 测试fast，Harris，shi-Tomasi角点在纯光流下的稳定性
* 多数据集测试
*
*/
#include <iostream>
#include <fstream>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/features2d/features2d.hpp>
#include <opencv2/video/video.hpp>
#include <opencv2/calib... |
e2a15274c28507df2627b3197ad593d7cc07182b | 6a73aab3b6ae272c29ef65f90b3326d49c48dda1 | htrcoin/htrcoin | /src/qt/coincontroldialog.cpp | C++ | cpp | 35,402 | permissive | #include "coincontroldialog.h"
#include "ui_coincontroldialog.h"
#include "addresstablemodel.h"
#include "bitcoinunits.h"
#include "base58.h"
#include "core.h"
#include "guiutil.h"
#include "init.h"
#include "optionsmodel.h"
#include "walletmodel.h"
#include "coincontrol.h"
#include "wallet.h"
#include "darksend.h"
... |
5a32a0955b5e0987c1f3f98e9b605817d80f0ebf | e39e99b40f6603bc0bcadf49c4b337e620f6cf7f | sisPedro/Alien-triste | /Errors.cpp | C++ | cpp | 324 | no_license | #include "Errors.h"
#include <iostream>
#include <SDL.h>
#include <cstdlib>
//imprime errores de mensaje
void fatalError(std::string errorString)
{
std::cout << errorString +SDL_GetError()<< std::endl;
std::cout << "Enter Enter to quit... " << std::endl;
int tmp;
std::cin >> tmp;
SDL_Quit();
exit(1)... |
3133c9bb95780e37d5e6e10c973869717b60956c | 99c46df5ebefebb8bf65ad1ab5165269595b3767 | itfanr/GeometricTools | /GTEngine/Source/Graphics/DX11/GteDX11TextureDS.cpp | C++ | cpp | 5,056 | no_license | // David Eberly, Geometric Tools, Redmond WA 98052
// Copyright (c) 1998-2018
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// File Version: 3.0.1 (2016/11/13)
#include <GTEnginePCH.h>
#includ... |
b1a15a8e0550cf6ba5d3348222c776f4aea51f9c | 06606155389bbccac91cbadc1151717e7e5c5a07 | kcirtaptrick/comsc210 | /Carrano/Chapter11/bubbleSort.cpp | C++ | cpp | 1,502 | no_license | // Created by Frank M. Carrano and Tim Henry.
// Copyright (c) 2016 __Pearson Education__. All rights reserved.
// Listing 11-2.
#include <iostream>
#include <string>
/** Sorts the items in an array into ascending order.
@pre None.
@post theArray is sorted into ascending order; n is unchanged.
@param theArray... |
4cde29ea617731560b372e8279d96e118574feb3 | 3168ee2766bb796cc9ecc547e740b6ef5b236db5 | Vvoox/Short_Path | /sommet.cpp | C++ | cpp | 4,800 | no_license | #include "sommet.h"
Sommet* Sommet::startNode = NULL;
Sommet* Sommet::endNode = NULL;
qint32 Sommet::selectedNb = 0;
Sommet::Sommet(qreal x, qreal y, qreal node_id)
{
this->ItemX = x;
this->ItemY = y;
Id = node_id;
Pressed = false;
isMoving = false;
Selected = false;
colored ... |
48814861f5b903f57f5ce0333c93614ff5dd4f4e | c12374b4fda33cedb986ed8576b5df95fecab34d | flying-dutchmen/3DS_w3Browser | /10.6.0/WKC/WebKit/WKC/WebCoreSupport/DragClientWKC.cpp | C++ | cpp | 4,623 | no_license | /*
* Copyright (C) 2007 Apple Inc. All rights reserved.
* Copyright (C) 2007 Holger Hans Peter Freyther
* Copyright (c) 2010 ACCESS CO., LTD. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* ... |
cd1b691393dc4fab8a8ff18a330d561521d96c11 | 53292d66f9c2dba345dc28e8979e5786b6cf420b | yar0slava/KMA_POOP_2020 | /Lab_1/build-PhoneBook-Desktop_Qt_5_15_0_MinGW_64_bit-Debug/debug/moc_finddialog.cpp | C++ | cpp | 3,552 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'finddialog.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.15.0)
**
** WARNING! All changes made in this file will be lost!
*********************************************************... |
26e8b8d6db4d7d499d7e6147f84a2bc2e6f2b198 | 350ddbd81eb172c70c6a605c8e9972b187d2fa31 | gagbo/lib-ledger-core | /core/src/wallet/ethereum/explorers/api/EthereumLikeTransactionParser.cpp | C++ | cpp | 9,726 | permissive | /*
*
* EthereumLikeTransactionParser
*
* Created by El Khalil Bellakrid on 14/07/2018.
*
* The MIT License (MIT)
*
* Copyright (c) 2018 Ledger
*
* 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... |
5a83f8af9e3b22fe71c3df29406204fe26f5c0b8 | 10a443cc68dd54563da246cc1e35d2a552caa6e2 | zionlang/zion | /src/resolver_impl.cpp | C++ | cpp | 4,205 | permissive | #include "resolver_impl.h"
#include <string>
#include "dbg.h"
#include "llvm_utils.h"
#include "user_error.h"
namespace zion {
namespace gen {
StrictResolver::StrictResolver(llvm::Value *llvm_value)
: llvm_value(llvm_value) {
}
StrictResolver::~StrictResolver() {
}
llvm::Value *StrictResolver::resolve_impl(l... |
b41bebc1225ba9345469660bbba5072e08d0df59 | 9a0c43455ff7225c9a62760f387e17575a0a2e08 | iaojnh/ICPC-template | /!绪论/_.cpp | C++ | cpp | 505 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pw(x) (1ll << (x))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define r... |
4531ad91532c5c3377571254af223eb6e8a69969 | da32cd1c5ff74f36fda3e3e82edebf8e9d5b4205 | cvera020/COP4610 | /threads/synch.cc | C++ | cc | 5,473 | permissive | // synch.cc
// Routines for synchronizing threads. Three kinds of
// synchronization routines are defined here: semaphores, locks
// and condition variables (the implementation of the last two
// are left to the reader).
//
// Any implementation of a synchronization routine needs some
// primitive atomic operatio... |
8f7ff54a7358a5a537330b990bb78a2922e43702 | ca88bf16df1aefd1b110638ad55155d2c414f842 | pauladams8/chromium | /chrome/browser/ui/views/tabs/tab_animation.cc | C++ | cc | 2,567 | permissive | // Copyright 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 "chrome/browser/ui/views/tabs/tab_animation.h"
#include <algorithm>
#include <utility>
#include "base/cxx17_backports.h"
#include "chrome/brows... |
2dc12d286d8f9e75367ae12a6dc42dc83a3f2b4d | ca52a65e00390a1389e01264402542650b03de46 | xrLil-Batya/gitxray | /net.ssa/xr_3da/quatern.cpp | C++ | cpp | 21,220 | no_license | /****************************************************************************************/
/* QUATERN.C */
/* */
/* Author: Mike Sandige ... |
7dc0654a5a2f7a0de92cf2db16157c6d4360d0ad | 3818fe548124134d657eaef2117c52b12e0e3085 | PaddlePaddle/PaddleSeg | /test_tipc/serving_cpp/general_seg_op.cpp | C++ | cpp | 6,520 | permissive | // Copyright (c) 2020 PaddlePaddle 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... |
954c5f562fb7d8074b7e45503b20abc5c871a787 | bca90fc737652d991789aba9a3f3ce8812282037 | Project-OSRM/osrm-backend | /unit_tests/util/query_heap.cpp | C++ | cpp | 4,043 | permissive | #include "util/query_heap.hpp"
#include "util/typedefs.hpp"
#include <boost/mpl/list.hpp>
#include <boost/test/unit_test.hpp>
#include <algorithm>
#include <limits>
#include <random>
#include <vector>
BOOST_AUTO_TEST_SUITE(binary_heap)
using namespace osrm;
using namespace osrm::util;
struct TestData
{
unsigne... |
8af99305131855899c3e7c3725df2f67e1464902 | 303649a97599b6f1f02b55a2c66ece38d8eadaf4 | QPC-database/aws-sdk-cpp | /aws-cpp-sdk-opsworkscm/source/model/AssociateNodeResult.cpp | C++ | cpp | 1,000 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/opsworkscm/model/AssociateNodeResult.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <aws/core/AmazonWebServiceResult.h>
#include <aws/core/utils/StringUtils.h>
#include <aws... |
1c4049a9c534c2c2125a6586bae8bc72568e846a | 2160dddb58694f8004388566d4032ebd5b7d944f | JTAG-Romney/scholarshipcoin | /src/qt/paymentserver.cpp | C++ | cpp | 29,402 | permissive | // Copyright (c) 2011-2018 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H)
#include <config/bitcoin-config.h>
#endif
#include <qt/paymentserver.h>
#include <qt/bitcoinunit... |
d241d565f0627aa036dd61b4b22cf9d069628f93 | 498759e29c6acbdcfc4b9a001e6d0581140c5c1b | karunmatharu/Android-4.4-Pay-by-Data | /external/chromium_org/third_party/WebKit/Source/modules/webdatabase/sqlite/SQLiteFileSystemPosix.cpp | C++ | cpp | 6,984 | permissive | /*
* Copyright (C) 2009 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditio... |
e94684ae0da8ffb9a39e4442686d56c0f3e70f72 | 2a2e11ada116362d0f400fa6b8a4577db4748c93 | uri-cs/212-spring-2020 | /lab-04/calculator.cpp | C++ | cpp | 1,405 | no_license | #include <iostream>
#include <stack>
#include <string>
std::stack<std::string> reverseStack(std::stack<std::string> myStack){
std::stack<std::string> flippedStack;
while (!myStack.empty()) {
flippedStack.push(myStack.top());
myStack.pop();
}
return flippedStack;
}
std::stack<std::string> fillStack(){... |
767b65773587929499c80ee5fb3fefc2dd8501a6 | 467f866d0f015c504ee7035e9b1859e607db1241 | SyedAman/Object-Oriented-Programming-NYU | /CS 1124/Homework/Old/HW07/polynomial.cpp | C++ | cpp | 2,554 | no_license | #include <iostream>
#include <vector>
class Polynomial
{
public:
Polynomial() {}
Polynomial(std::vector<int> coefficients) : degree(sizeof(coefficients) - 1) {}
Polynomial& operator=(const Polynomial& polynomial)
{
return *this;
}
Polynomial& operator+=(const Polynomial& polynomial)
{
}
Polynomial& ope... |
539046b6dfdc1626ce7dbeb24ddb5ccbb55f2580 | 83ef876b6b5de50d9660049a22d09568c9c96896 | monta0315/atcoder_begin | /200/b.cpp | C++ | cpp | 867 | no_license | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fore(i,a) for(auto &a:a)
#define e(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define out(s) cout << s << endl
#define decimal10(s) cout << fixed << setprecision(10) << s << endl
#define two... |
eab91af454c4aa393880fdfce92c35712de8e515 | b361c1755cad77f30ff3b9f0731f0923caefccc2 | TraxNet/ShadingZenCpp | /include/shz/math/math.hpp | C++ | hpp | 2,836 | permissive | #ifndef __SHZ_MATH__
#define __SHZ_MATH__
#include <math.h>
#include <shz/math/types.hpp>
/*
TODO: There is a hidden problem with all this classes if mixed with C++ STL containers. The default std::allocator
does not have the memory alignment constraint we need, so any object that has a shz::math::vector, shz::math... |
32b2d5a23982c3d4e5822dcac5b8aa70e35dea09 | 54812baea78244d6b25283fcf6e2d9289fe81086 | mamunhpath/leet-code | /task-scheduler-2.cpp | C++ | cpp | 693 | no_license | // https://leetcode.com/problems/task-scheduler/
class Solution {
public:
int leastInterval(vector<char>& tasks, int n) {
vector<int> counts(26, 0);
int maxCount = 0, points = 0;
for(char t : tasks){
int c = ++counts[t - 'A'];
if (c > maxCount){
... |
a5d6335b62aa44ca143705e340072256283b318a | f87ddde30eb787332fa85c3151854ec74fae12d1 | thisisronak/Algorithms | /contests/codeforces/285A.cpp | C++ | cpp | 319 | no_license | #include <bits/stdc++.h>
using namespace std;
#ifdef CORLEONE
#define d(b) cerr<< #b << " " << b << endl
#else
#define d(b)
#endif
int main(){
int n, k;
cin>>n>>k;
int a = 1e5;
cout<<a<<" ";
for(int i=0;i<n-1;i++){
if(k){
cout<<--a<<" ";
--k;
}
else
cout<<++a<<" ";
}
} |
8a02322d24b27e9b03b40a7bcca06a40777cb444 | 42fdfa05968804732d3b96ee6bb27494a1249902 | yachtcaptain23/browser-android-tabs | /chrome/browser/ui/cocoa/apps/quit_with_apps_controller_mac.cc | C++ | cc | 7,840 | permissive | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/cocoa/apps/quit_with_apps_controller_mac.h"
#include "base/command_line.h"
#include "base/i18n/number_formatting.h"
#include ... |
94741de5c903c7265929f39b81e9ad1061749db7 | b13c8c28955aead92f32486511765a39f54f72c9 | mliszcz/AR2015 | /lab01/src/lab01-par.cpp | C++ | cpp | 7,299 | no_license | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <cmath>
#include <mpi.h>
double*** createDataBuffer(int K, int N, int M) {
double*** data = new double**[K];
for (int k=0; k<K; ++k) {
data[k] = new double*[N];
for (int n=0; n<N; ++n) {
data[k][n] = new double[M];
... |
6ed6f806c5ab5df0513886134acfbec5d9eac629 | 28d8d3bb88fe80e7e2467ae16f674ceb4f929dd8 | Luyaoz3283/Game230_Asteroid | /Asteroids/Asteroids/Asset.cpp | C++ | cpp | 1,935 | no_license | #include <iostream>
#include "Asset.h"
Asset::Asset()
{
}
Asset::~Asset()
{
}
void Asset::loadTexture(string textureName, string FileName)
{
sf::Texture curTex;
if (curTex.loadFromFile(FileName)) {
(textureMap)[textureName] = curTex;
}
else {
cout << "load not successful:" << FileName;
}... |
094ed733070428e39a4bc791a0ad685ba4763e65 | cb334f5318959da93f78ae3b43a71e33438a7e2b | Sekikazu/ModelViewer | /ModelViewer/FSLibCamera.cpp | C++ | cpp | 2,888 | no_license | #include "FSLibCamera.h"
bool CAMERA::Init(float wndW, float wndH) {
// ViewPort
viewPort;
viewPort.Width = wndW;
viewPort.Height = wndH;
viewPort.MinDepth = 0.0f;
viewPort.MaxDepth = 1.0f;
viewPort.TopLeftX = 0;
viewPort.TopLeftY = 0;
extern ID3D11DeviceContext* DeviceContext;
DeviceContext->RSSetViewports... |
fc4e81cf66a935ee02ae4286e900e2adbb9f0ad4 | b66dbf339b54c89ad3fc3fc9a6a4e7476b8d21e3 | MyroslavShymon/Algorithms | /src/wasm/src/sorts.cpp | C++ | cpp | 583 | no_license | #include "../include/sorts.h"
#include "../include/User.h"
#include "../include/globals.h"
void bubbleSort(User* a[], const int size) {
for (int i = 0; i < size - 1; i++) {
for (int j = 0; j < size - i - 1; j++) {
if(field == "age"){
if (a[j]->age() > a[j + 1]->age()) {
User* temp = a[j];
a[j] = a[... |
674bb6e9600bcfe4303acabd075095d737015994 | 6cb288a41854f87a7410a1d3c20c42b3356c1f5c | JiahaoLi-gdut/CAFFE-DACH | /include/caffe/layers/flatten_layer.hpp | C++ | hpp | 2,199 | permissive | #ifndef CAFFE_FLATTEN_LAYER_HPP_
#define CAFFE_FLATTEN_LAYER_HPP_
#include <vector>
#include "caffe/blob.hpp"
#include "caffe/layer.hpp"
#include "caffe/proto/caffe.pb.h"
namespace caffe {
/**
* @brief Reshapes the input Blob into flat vectors.
*
* Note: because this layer does not change the input values -- mer... |
0ad1f72407ad07babe1c7e233c5dc86e869acfb2 | 536bf896f0debf39c139393f082377fc482f0d5d | anssshu/Utkarsh2D | /src/libs/functions/load_obj.hpp | C++ | hpp | 528 | no_license | /*
This file contains all the helper functions for the current application
*/
#pragma once
#include <fstream>
#include <sstream>
#include <assimp/Importer.hpp>
#include <assimp/scene.h>
#include <assimp/postprocess.h>
#include <SDL2/SDL.h> /* macOS- and GNU/Linux-specific */
#include <SDL2/SDL_opengles2.h>
#include ... |
fed1f71ae0883bf3ef8b9f47e5b53642fa4f0776 | 0c198513cecd644f4936171e093a73b5431ea952 | 1160208849wfl/cpp-primer5e | /src/chapter7/account/main.cc | C++ | cc | 1,537 | no_license | /*
* This file contains code from "C++ Primer, Fifth Edition", by Stanley B.
* Lippman, Josee Lajoie, and Barbara E. Moo, and is covered under the
* copyright and warranty notices given in that book:
*
* "Copyright (c) 2013 by Objectwrite, Inc., Josee Lajoie, and Barbara E. Moo."
*
*
* "The authors and publishe... |
defd09e924533e537c7385498a3ccb20f920f0d2 | d49d23d1fedeabf42088f87abeaa1218e4d2f9fa | IsraMekki/tiramisu_code_generator | /cmake-build-debug/programs_tiling/function14605/function14605_schedule_6/function14605_schedule_6_wrapper.cpp | C++ | cpp | 1,058 | no_license | #include "Halide.h"
#include "function14605_schedule_6_wrapper.h"
#include "tiramisu/utils.h"
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <fstream>
#include <chrono>
#define MAX_RAND 200
int main(int, char **){
Halide::Buffer<int32_t> buf00(256);
Halide::Buffer<int32_t> buf01(64, 2... |
3439b14fd904d97170a09c05ddd301afd770bbce | d5ff63fee2cd59a68b42de03622560ec51e1ef29 | Kyrzon/-AI | /Multi-agent system/Agents/Agents/main.cpp | C++ | cpp | 2,687 | no_license | #include <iostream>
#include <string>
#include <fstream>
#include <sstream>
#include <exception>
#include <vector>
#include "CChessBoardAgent.hpp"
#include "CQueen.hpp"
std::vector< std::pair< DWORD64, DWORD64 > > GetSolution(std::vector< std::pair< int, int > > initialArrangement, int boardSize)
{
CChessBoard chess... |
120949dd7035d968f17013f7398112456e91a8ea | e863e2afc9df6827b43766f335fe5119899823e9 | ZsgsDesign/My_ACM_Life | /水题/赛前练习赛/source/172.16.4.36_张昊/pyramid.cpp | C++ | cpp | 1,370 | permissive | #include<bits/stdc++.h>
using namespace std;
string ti[6];
struct stu{
string name;
int a[6];
} st[20001];
struct mm{
string na;
int index;
} py[6];
bool cmp1(stu a,stu b){
if(a.a[1]!=b.a[1])return a.a[1]>b.a[1];
else return a.name<b.name;
}
bool cmp2(stu a,stu b){
if(a.a[2]!=b.a[2])return a.a[2]>b.a[2];
els... |
779e9b390ef4c0faa001a10fe919f52e50b6876c | 821d34cccc2bf906f000118609a8786625093920 | pwnzen-mobile/llvm-slicer | /lib/Fuzzer/FuzzerDriver.cpp | C++ | cpp | 9,210 | permissive | //===- FuzzerDriver.cpp - FuzzerDriver function and flags -----------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
878431b1af95bcd1f36ca585f895cf166cbb9d22 | 99f6532b3a62640fb036c3d0c645a9c0ba692040 | codemercenary/autowiring | /src/autowiring/test/AutoFilterDescriptorTest.cpp | C++ | cpp | 2,012 | permissive | // Copyright (C) 2012-2015 Leap Motion, Inc. All rights reserved.
#include "stdafx.h"
#include "TestFixtures/Decoration.hpp"
#include <autowiring/AutoFilterDescriptor.h>
class AutoFilterDescriptorTest:
public testing::Test
{};
TEST_F(AutoFilterDescriptorTest, DescriptorNonEquivalence) {
AutoFilterDescriptor descs... |
172861764be94778e3a4c269624f8738df0e6df7 | 99ba8eb6728cd9e35b1897a69aab28d994ce216f | tingelst/game | /src/motor_estimation_valkenburg_dorst.cpp | C++ | cpp | 2,133 | no_license | #include "game/vsr/vsr.h"
#include <game/vsr/cga_op.h>
#include <game/vsr/generic_op.h>
#include <pybind11/numpy.h>
#include <pybind11/pybind11.h>
#include <Eigen/Dense>
#include <Eigen/Eigenvalues>
#include <iostream>
using vsr::cga::Gen;
using vsr::cga::Vec;
using vsr::cga::Biv;
using vsr::cga::Pnt;
using vsr::cga... |
38434d6c4aa1d8f4d8651b219c0afabc4e89c66a | a3050900d3f5757b0ead30f0ba3c2d15846b77d7 | alfarouquty/Tugas- | /BAB3 LAT2.cpp | C++ | cpp | 277 | no_license | #include <stdio.h>
#include <conio.h>
#include <iostream>
using namespace std;
main (void){
int nilai;
cout<<"masukkan nilai : ";
cin>>nilai;
cout<<endl;
if (nilai>50)
{
cout<<"Selamat, Anda lulus...";
} else
{
cout<<"Maaf, Anda gagal...";
}
}
|
8b14a3617cf2916eb2baf025dbdb862c1c0dd125 | 82ff874565045a41b66d2ad0e6975b1361dae235 | szmybs/PhysIKA_Cloud | /Cplusplus/EvolutionBasedPhysics/Extern/Discregrid/discregrid/src/geometry/mesh_distance.cpp | C++ | cpp | 7,518 | permissive |
#include <geometry/mesh_distance.hpp>
#include <mesh/triangle_mesh.hpp>
#include "point_triangle_distance.hpp"
#include <limits>
#include <functional>
using namespace Eigen;
namespace Discregrid
{
MeshDistance::MeshDistance(TriangleMesh const& mesh, bool precompute_normals)
: m_bsh(mesh.vertex_data(), mesh.face_d... |
25c36a6f2692806c5314819dc596fd3372e72e59 | 6d1e47d465dc0ec8051e348918f5ae633f4b9b8e | camike/chromium | /content/browser/renderer_host/media/media_stream_manager.cc | C++ | cc | 112,386 | permissive | // Copyright (c) 2012 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/media/media_stream_manager.h"
#include <stddef.h>
#include <stdint.h>
#include <algorithm>
#include <cctype>... |
ae4a1d4a6a172e5d66945dd00fbcc69995938406 | a88166e8a037c7d92a4243edb8410882438c1b47 | NilanshBansal/DataStructures | /stacks/stackUsingArray/stackUsingArray.cpp | C++ | cpp | 1,192 | no_license | #include<iostream>
using namespace std;
template <typename T>
class StackUsingArray {
T *data;
int nextIndex;
int capacity;
public:
StackUsingArray(){
data = new T[4];
nextIndex = 0;
capacity = 4;
}
int size(){
return nextIndex;
... |
236fffb9ba7cbaef6462f4cfa8b57b52a87e4cc3 | 822a6d635f4eac55ca68b031303dd697aeb54b6a | flyfaster/toysrc | /mytoybox/tree/bst.cpp | C++ | cpp | 7,681 | no_license | #include <iostream>
#include <cstddef>
#include <queue>
#include <stack>
#include <list>
#include <tuple>
#include "basictreenode.h"
#include "traverse_tree.h"
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MODULE bst
#include <boost/test/unit_test.hpp>
#include <boost/test/results_reporter.hpp>
using namespace std;
... |
58097ab1a4bfd8c794748cfd7ac7cdbab22d74af | dca2dce333a4adaa367df55a04f9d53dd684a8c1 | FeiLuo/xpathDemo | /vendors/XQilla-2.3.3/src/functions/FunctionSin.cpp | C++ | cpp | 1,545 | permissive | /*
* Copyright (c) 2004, 2015 Oracle and/or its affiliates. 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-... |
4532e33e7ef99d1410bb2d411c3db70bb0227915 | 8445dd715dacefc7914da7f349300c96a46595d0 | oscarknagg/ray | /src/ray/object_manager/test/get_request_queue_test.cc | C++ | cc | 11,349 | permissive | // Copyright 2017 The Ray Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to i... |
2af82c38182d0bc773f36f2a4492f678f9ed4339 | 7c75fee118f5e9bc28daef0487e59bdb114b05f1 | tatt61880/atcoder | /submissions/typical90_bd/main.cpp | C++ | cpp | 57,539 | no_license | #if 0 // Kuin Programming Language v.2021.6.17
func main()
var n: int :: cui@inputInt()
var s: int :: cui@inputInt()
var ab: [][]int :: #[n + 1, 2]int
for i(1, n)
for iab(0, 1)
do ab[i][iab] :: cui@inputInt()
end for
end for
; dp[i][j] = i日目まででｊ円分購入
var dp: [][]bool :: #[n + 1, s + 1]bool
do dp[0][0] :... |
d1299c66f3a65c88cc642a4e9a7a91025788e04e | 98493649f5f948b7a6771761a29dcb4f49f99b72 | ordinary-developer/education | /cpp/std-17/m_bancila-modern_cpp_programming_cookbook/ch_04-preprocessor/01-conditionally_compiling.cpp | C++ | cpp | 1,801 | permissive | namespace example_01 { // -> avoiding duplicated macro definitions
#if !defined(_UNIQUE_NAME_)
#define _UNIQUE_NAME_
class foo {};
#endif
void run() {
foo{};
}
} // example_01
#include <iostream>
namespace example_02 { // -> using various compilers
void run() {
#if defined _MSC_VER
std::cout << "visual c... |
35c66033861280de014fb1607b79f3e02a95ad3d | 979df0c363bd6e40dd5e784b0efa76453a766c74 | cesarsampedro/Arcanoid | /Arcanoid/App.cpp | C++ | cpp | 3,501 | no_license | #define SDL_MAIN_HANDLED
#include <SDL.h>
#include <iostream>
#include "Timer.h"
#include "Bar.h"
#include "Ball.h"
#include "Block.h"
bool Running = true;
enum GameState_t
{
Starting,
Playing,
Dead
};
// HandleEvents
//----------------------------------------
int HandleEvents(SDL_Event* e... |
8b351300a6277aecc27c1f5d64a136ae966c44dd | 203a7a74c5af5cd58d2b1c2866a74fddf919a479 | asdfzz/platform_frameworks_base | /services/surfaceflinger/SurfaceFlinger.cpp | C++ | cpp | 88,391 | permissive | /*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
b27d26cdc28d2a0b790203f1fd9885f1ae49d57c | 519d4d09052554529d919c040dba0ecb671c5bd4 | alexandraback/datacollection | /solutions_5708284669460480_1/C++/DiegoCR/B.cpp | C++ | cpp | 1,339 | no_license | #include <bits/stdc++.h>
using namespace std;
string k, l;
int freq[555];
int K, L, S;
bool can ( int p ) {
for ( int i = 0; i < L - p; i ++ )
if ( l[i] != l[i + p] )
return false;
return true;
}
int main() {
freopen ( "B.in", "r", stdin );
freopen ( "SalidaB2.txt", "w", stdout );... |
a87cf7190ecfd2c9acae6d731bbe8cb553e81ab3 | 7051f182e8faf71fc5e7595e9251fb203568e741 | kingstertime/parallel-programming-2020 | /Lesson9/task2.cpp | C++ | cpp | 917 | no_license | #include "mpi.h"
#include <locale.h>
#include <iostream>
#include <stdio.h>
#include <time.h>
void fill_array(int* array, long int length, int seed = 0)
{
srand(clock() + seed);
for (int i = 0; i < length; i++)
array[i] = (rand() % 1000) - 500;
}
int main(int argc, char** argv) {
MPI_Init(&argc, &argv);
int r... |
c32156be0f3d12b42ce669ef435108caee769b7f | 0c85c4e95add3f4a87ec2ba37fc7c108d11ddf67 | huangshenno1/algo | /soj/1083.cpp | C++ | cpp | 2,989 | permissive | #include <iostream>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn = 210;
int m,n;
map<int,string> dic;
int c[maxn],next[maxn];
bool g[maxn][maxn],vis[maxn];
queue<int> Q;
bool flag;
void init()
{
int i,j,temp,count;
string s;
... |
8e0241516e8265487db15f428861134757719980 | e4446ebf7851c497d8d573e1f98fee4004ad7c26 | ceasaw/BoxWorld | /BoxWorld/BoxWorld1.1/CEnemyAI/CBlockMonsterAI.cpp | C++ | cpp | 5,326 | no_license | #include"CEnemyAI/CBlockMonsterAI.h"
#include"BasicTools/BasicTools.h"
CBlockMonsterAI::CBlockMonsterAI(Enemy_Attributes bean) :CEnemyAI(bean)
{
if (bean.type == ENEMY_TYPE::BLOCKMONSTER2) {
vector<BmpPic*> pictures;
BmpPic* bmpPic;
CBitmap* bmp = GameManager::getInstance()->GetResource()->GetMonsterBmp()... |
173d9a130e5af47859c8046522c87b6e91f25682 | 18bf63ce4173599480d470f596896ab6031314dd | webscale-networks/mod_pagespeed | /pagespeed/apache/header_util.cc | C++ | cc | 8,587 | permissive | // Copyright 2010 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
20dc56e18c81b587718b31ace3d60d17890eb1ca | b63fec1b8c1181494ddf23c27565effd30c308bd | Cirnoo/game-server | /tcpnet.cpp | C++ | cpp | 1,465 | no_license | #include "tcpnet.h"
#include "Packdef.h"
#include <QDebug>
#include "data.h"
#include "mythread.h"
#include "clientmanager.h"
#include "roominfo.h"
TCPNet::TCPNet(Data & d):data(d)
{
server = new QTcpServer(this);
server->listen(QHostAddress::Any,_DEF_SERVERPORT);//监听的端口号
PRINT("等待连接...")
//my_thread_r... |
84c75134533565c2868f2b8f71fa03acc618d549 | 76fd25caf5a1f9d7d8d135a3ca588c02384a2c49 | MTASZTAKI/ApertusVR | /plugins/render/ogreRender/3rdParty/ogre/RenderSystems/GLES2/src/OgreGLES2HardwareIndexBuffer.cpp | C++ | cpp | 12,422 | permissive | /*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2014 Torus Knot Software Ltd
Permission is hereby granted, free of charge, to any person ... |
9bea1f0d1da47181c4b101c99a5a3108215315ff | 35451ad6535eb6abb7ad223a7dcb2cba6b4fbc19 | Haozhuo/practice | /c++/dynamic_programming/q152.cpp | C++ | cpp | 906 | no_license | int maxProduct(vector<int>& nums) {
if(nums.size()==0)
return 0;
int r = nums[0];
int imax = r;
int imin = r;
for(int i = 1; i < nums.size(); i++){
if(nums[i] < 0)
swap(imax,imin);
imax = max(nums[i],imax*nums[i]);
imin = min(nums[i],imin*nums[i]);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.