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 |
|---|---|---|---|---|---|---|---|---|
c9e4ee21683e0850dbd5441bd357b33ff6f412e3 | 483cb475949389eee98e0fbf89a5f1d33bfc25ea | Ry0/ODE | /etc/dice/many/many_dice.cpp | C++ | cpp | 16,420 | no_license | #include <ode/ode.h>
#include <drawstuff/drawstuff.h>
#include <time.h>
#define ROW 5
#define COL 5
#ifdef dDOUBLE
#define dsDrawBox dsDrawBoxD
#define dsDrawCylinder dsDrawCylinderD
#endif
static dWorldID world;
static dSpaceID space;
static dGeomID ground;
static dJointGroupID contactgroup;
//static int flag = 0... |
f7ca6fbfcb750f05135831d53154602b788d31e3 | c3e31dd73d2ea7e0ae72974701d1a156dadf7337 | kjnh10/pcw | /work/atcoder/abc/abc067/D/answers/424959_TusanHomichi.cpp | C++ | cpp | 1,524 | no_license | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int MAXN=1e5+5;
int N;
vvi T;
vi path;
int sz[MAXN];
bool dfs_path(int u, int p) {
if (u == N) {
path.push_back(N);
return true;
}
for (auto v : T... |
4ce3afbf9e80b1460e01a23959a5c85d900cda11 | 2a2ed97fa3b76c96239f1d0b06219d747813be4a | gajgeospatial/clBLAS-1.10 | /src/msvc1/include/AutoGemmKernelSources/zgemm_Col_CC_B1_ML048_NX048_KX01_src.cpp | C++ | cpp | 8,524 | permissive | /*******************************************************************************
* This file was auto-generated using the AutoGemm.py python script.
* DO NOT modify this file! Instead, make changes to scripts in
* clBLAS/src/library/blas/AutoGemm/ then re-generate files
* (otherwise local changes will be lost a... |
ce9676682fb3a8c5eed611dbf6e0d73c1db7ebc6 | 8e1d66b8a2c30cf4ab21d002728bcbf3ffc6e0a3 | OAID/Tengine | /source/device/vulkan/layer/innerproduct_vulkan.cpp | C++ | cpp | 15,838 | permissive | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* License); you ma... |
818c96edfb1b5de9d1484592816992eab36a6eea | 3b2fd5417fa30dfc95e0257b05094e8d175db34e | JaykayChoi/AlgorithmicProblem | /AlgorithmicProblem/Solved/Online Judge/Baekjoon/2918_POSLOZI.cpp | C++ | cpp | 1,475 | no_license | #include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
//https://www.acmicpc.net/problem/2918
struct Swap
{
int a, b;
Swap(int _a, int _b) : a(_a), b(_b) {};
};
int n, m;
vector<int> sortedSequence;
vector<Swap> swaps;
int minValue = 987654321;
vector<int> order;
bool ... |
bf5723a2cdd39be5911b84f3c58b4ff2535707ee | 3e1baf95990e4402e7bde2c6d3a8f6774fdcc721 | MTGermany/mic | /trunk/src/KernerCA.cpp | C++ | cpp | 6,899 | no_license | #ifndef KernerCA_CC
#define KernerCA_CC
// c
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
//alternatively there is <cstdio> which declares
//everything in namespace std
//but the explicit "using namespace std;" puts
//everything in global namespace
// c++
#include <iostream>
using nam... |
46c20e8a95a29d69b0a6f64ec099e7b5572ad063 | dcc4b15edd2321ea950c1fc90d2c4bb32a0ec5d2 | ayiksilver/SoftU2F | /SoftU2FDriver/SoftU2FDriver.cpp | C++ | cpp | 1,211 | permissive | //
// SoftU2FDriver.cpp
// SoftU2F
//
// Created by Benjamin P Toews on 1/12/17.
//
#include <IOKit/IOLib.h>
#include "SoftU2FDriver.hpp"
#define super IOService
OSDefineMetaClassAndStructors(SoftU2FDriver, IOService);
bool SoftU2FDriver::start(IOService *provider) {
IOLog("%s[%p]::%s(%p)\n", getName(), this, _... |
55b375222d06714002e0491fc5e4db5e48d021ee | 3223706d40a87831aac0c5d73b15acc009a2269e | caot/z3 | /src/qe/qe_lite.cpp | C++ | cpp | 87,620 | permissive | /*++
Copyright (c) 2012 Microsoft Corporation
Module Name:
qe_lite.cpp
Abstract:
Light weight partial quantifier-elimination procedure
Author:
Nikolaj Bjorner (nbjorner) 2012-10-17
Revision History:
--*/
#include "qe/qe_lite.h"
#include "ast/expr_abstract.h"
#include "ast/used_vars.h"
#include "ast... |
8f811b7510676f67404fdd54b2bb92674f2c45e4 | 676e356be7aed891b1dec0e42b39ae4c07dae752 | azureplus/chromium | /chrome/browser/chromeos/fileapi/external_file_url_request_job.cc | C++ | cc | 12,777 | 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/chromeos/fileapi/external_file_url_request_job.h"
#include <algorithm>
#include <vector>
#include "base/bind.h"
#include "base/... |
48031a04dbf295737ce22a8d373e6e2e56faf06f | 4ea1b902305513dc87d5abd1987ca9081b845f25 | YJL33/Image-Processing | /Project 1/ee569_hw1_p1.3/Demosaic_MHC.cpp | C++ | cpp | 10,513 | no_license | //
// main.cpp
// HW1_P1.3
//
// MHC Demosaicing
// Implement MHC demosaicing (424x636 Parrot image is defaulted)
//
// Input: Raw image, desired output file path, (Number of color channel), (input height), (output width)
// Output: MHC demosaic image
//
// Created by Yun-Jun Lee.
// Copyright (c) 2015 USC. All... |
3903db20c42a640380ecc0094a749fd1c4181640 | 770fbc26b4afa7c1cdf02ee28b40fa5ea23a3348 | Priyansh19077/Atcoder-DP-Contest | /I.cpp | C++ | cpp | 3,979 | no_license | /* Priyansh Agarwal*/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<algorithm>
#include<string.h>
#include<unordered_map>
#include<vector>
#include<unordered_set>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<map>
#include<chrono>
u... |
bd719589282ec83d398f7a25ea6633d3ca7ea6c5 | f3445d10250881608e1e5e74ba612009a3e97ae5 | aaronfedyan/r4intellij | /misc/graphics_device_library/Evaluator.cpp | C++ | cpp | 1,455 | permissive | #include "Common.h"
#include "Evaluator.h"
#include <R_ext/Parse.h>
namespace jetbrains {
namespace ther {
namespace device {
namespace evaluator {
namespace {
using jetbrains::ther::device::protector::ScopeProtector;
SEXP createSexp(const std::string &str, ScopeProtector *protector) {
SEXP result = Rf_allocVecto... |
2074c7b37c0c6044d25f63685f13381eea5bf1f3 | 0d62f016dd8cdd22330aeda4abde3b9664ff82c5 | tatiana-tumanova/Udacity-CPP1a-Optimization | /CPP1a-Optimization/sense.cpp | C++ | cpp | 667 | no_license | #include "stdafx.h"
#include "headers/sense.h"
using namespace std;
// OPTIMIZATION: Pass larger variables by reference
vector< vector <float> > sense(char color, vector< vector <char> > &grid, vector< vector <float> > &beliefs, float p_hit, float p_miss)
{
int height = grid.size();
int width = grid[0].size();
i... |
c73edc74e657604da9d8890d86ecef98810eeee9 | caea9599c1c7fcecce3ed6019412e1890a4a0ffb | zhengnengjin/mindspore | /mindspore/ccsrc/pre_activate/ascend/ir_fusion/confusion_mul_grad_fusion.cc | C++ | cc | 5,632 | permissive | /**
* Copyright 2020 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
41d81944c37588f07be169e5f4d48c409c18512f | 792cc4db1bea051b6388fdd9dabe6d298658f0e5 | adiog/date | /test/date_test/weekday_lessthan.fail.cpp | C++ | cpp | 1,270 | permissive | // The MIT License (MIT)
//
// Copyright (c) 2015, 2016 Howard Hinnant
//
// 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... |
6c68f969fbea73c6d37c9a17d749a3c3b0d7112d | 414b53992587f1c270d063a716e4810e145b6719 | FancyFlare/practice | /meeting_rooms.cpp | C++ | cpp | 1,083 | no_license | #include <iostream>
#include <map>
#include <vector>
using namespace std;
/*
* 252. Meeting Rooms
*
* Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings.
For example,
Given [[0, 30],[5, 10],[15, 20]],
return fa... |
a643a26659c369f534728a61188a94b409441019 | 88ef5e4099fcadfdcd9c730972b07db2216a252c | Henri512/OS1 | /Dusan Pavlovic 424-2012/src/system.cpp | C++ | cpp | 3,765 | no_license | #include "system.h"
#include "macros.h"
#include "schedule.h"
#include "thread.h"
#include <iostream.h>
#include <dos.h>
#include "event.h"
#include "IVTEntry.h"
volatile byte System::demanded_context_change = 0;
static volatile unsigned oldTimerSEG, oldTimerOFF;
static volatile unsigned lockFlag = 0;
vola... |
8de0131c91e60cc10ef73251f16ef5fa1bdbeb7f | e33d73ef35cf9a3382284862b3eb8be3d1b8b595 | msrLi/portingSources | /ACE/ACE_wrappers/ace/Time_Value.cpp | C++ | cpp | 9,867 | permissive | #include "ace/Time_Value.h"
#if defined (ACE_HAS_ALLOC_HOOKS)
# include "ace/Malloc_Base.h"
#endif /* ACE_HAS_ALLOC_HOOKS */
#if !defined (__ACE_INLINE__)
#include "ace/Time_Value.inl"
#endif /* __ACE_INLINE__ */
#include "ace/Numeric_Limits.h"
#include "ace/If_Then_Else.h"
#include "ace/OS_NS_math.h"
#include "ace/... |
f69291f59d3dc3a1880bb8ac663cd260ac00da42 | 9819efc137f5da18101f77286c7a60aabda9ff96 | jaidenmeiden/mov | /Space Invaders/src/Bunker.cpp | C++ | cpp | 9,211 | no_license | /** Definition of the class Bonus
Prefix: CBK_
@author Ramon Molla
@version 2011-07
*/
#include <Shoot.h>
#include <Bunker.h>
#include <TexturesManager.h>
#include <GameCharacters.h>
#include <SITexturesResources.h>
UGKS_String CBNK_TypeNames[CBNK_MAXTYPE] =
{
"BLANK",
"HOME",
"USER"
};
/// Bunker class defa... |
4f46d6d42f944969a4c8d1532132556b6d8b4ffb | 771f194d4295f72302baab7f5319582c8ad6aa4a | nawZeroX239/competitive-programming | /UVAOJ/524.cpp | C++ | cpp | 2,010 | no_license | #include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#incl... |
a93592df81fe47c36659de167f8a458ffedb5173 | 1286d1cf718e2144463d8982d6ea159db1e6de07 | Acesine/UVa | /369 - Combinations/main.cpp | C++ | cpp | 623 | no_license | #include <iostream>
#include <cstring>
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
bool checker[100];
while(N!=0 || M!=0)
{
memset(checker,1,M*sizeof(bool));
long long T = 1;
for(int i=N;i>=N-M+1;i--)
{
T *= i;
for(int j=M;j>=1;j--)... |
7aaa4b282b0ca8aab3c6c60d5b3c72d182cac0f7 | cb6c60d1e0864f088c41d99ab4977acce855fb93 | Jyunpp/Algorithm | /acmicpc.net August 2017/20170825/11758.cpp | C++ | cpp | 522 | no_license | //20170825 01:15 ~ 01:23
//기하 문제 복습 겸
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <iostream>
#include <stdio.h>
using namespace std;
int x[3], y[3];
int ccw(int x1, int y1, int x2, int y2) {
return x1*y2 - x2*y1;
}
int main() {
for (int i = 0; i < 3; i++)
scanf(" %d %d", &x[i], &y[i]);
int... |
b5bf6b5db9eeabaf607d9334797339f90461908c | 89945ee50d23641032118a7057fa7a266eb9b284 | lazarev-pv/robot-game | /Robot-Character/src/Generated/SaveParser.cpp | C++ | cpp | 7,489 | no_license | #include <cstring>
#include "SaveParser.h"
#include "util.h"
using namespace rapidxml;
using namespace std;
ChedSavedData::ChedSavedData()
:timeLine(0x0),properties(0x0),draw(0x0),camera(0x0),windows(0x0){}
ChedSavedData::ChedSavedData(ChedSavedData&& other)
:timeLine(other.timeLine),properties(other.properties),dra... |
08cfe1eb67c1fc1e2f6ac1989f31c4edb969d2a4 | c7a0352e473e98b98988d86ab2422360a1727b06 | saa27/Data-Structures | /Sorting Algo/Simple-sorting-algo.cpp | C++ | cpp | 627 | no_license | #include <iostream>
#include <cstdlib>
#define MAX 100
using namespace std;
int main(){
int n;
int a[MAX];
cout<<"enter size:"<<endl;
cin>> n;
for(int i=0;i<n;i++){
a[i] = rand();
}
for(int i=0;i<n;i++){
cout<<a[i] <<" ";
}
cout<<endl;
//sorting an array in as... |
8b95c1e186da1d8cbdab7d4359fa99b453774bad | 2948fa56d6f4f85997af84d32b896a8f79fe382c | pauladams8/chromium | /storage/browser/file_system/obfuscated_file_util_memory_delegate.cc | C++ | cc | 22,094 | 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 "storage/browser/file_system/obfuscated_file_util_memory_delegate.h"
#include <algorithm>
#include <utility>
#include "base/allocator/partition... |
08a920556fc4e4ed98ab237e0a304f82f97a549f | 407a3302211c25085d1121f4a882d2348e2e4d3a | sneumann/mzR | /src/pwiz/utility/misc/Container.hpp | C++ | hpp | 4,237 | no_license | //
// $Id$
//
//
// Original author: Matt Chambers <matt.chambers .@. vanderbilt.edu>
//
// Copyright 2008 Spielberg Family Center for Applied Proteomics
// Cedars Sinai Medical Center, Los Angeles, California 90048
// Copyright 2008 Vanderbilt University - Nashville, TN 37232
//
// Licensed under the Apache License... |
2dcc8b961807ec18a14e2e3b3cbc44da7ce3f7d3 | 3ca9ab7092bef76bdf032dfa0360f59c20708bbd | MattiasLiljeson/denLilleOstPojken | /CoreLib/src/Collectable.cpp | C++ | cpp | 1,732 | permissive | #include "Collectable.h"
void Collectable::InitTransformOrigin()
{
if(m_spriteInfo != NULL)
{
m_origin = m_spriteInfo->transformInfo;
m_elapsedTime=m_origin.translation[TransformInfo::X] + m_origin.translation[TransformInfo::Y];
}
}
Collectable::Collectable(): GameObject(NULL, NULL)
{
m_elapsedTime = 0.0f;
... |
cbd46add6467c318ba88ef80caac0b6efb51cde3 | 464d7937ea2908462cf0654471bdd1b319f71531 | AlsaceVeapon/AR_AprilTag | /AR_AprilTag/common/unionfind.cpp | C++ | cpp | 1,833 | no_license | /* Copyright (C) 2013-2016, The Regents of The University of Michigan.
All rights reserved.
This software was developed in the APRIL Robotics Lab under the
direction of Edwin Olson, ebolson@umich.edu. This software may be
available under alternative licensing terms; contact the address above.
Redistribution and use i... |
b6fe0a74e8e2eca82cf33390169aa5690349f4a1 | c92175a1e9a585b8c57e94b51386fdf28f4eddc8 | HarshitCd/Codeforces-Solutions | /Tanya and Toys.cpp | C++ | cpp | 355 | no_license | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m, a;
set<int> s;
cin>>n>>m;
vector<int> v(n), u;
for(int i=0; i<n; i++){cin>>a; s.insert(a);}
a=1;
while(m-a>=0){
if(s.find(a)==s.end()){u.push_back(a); m-=a;}
a++;
}
cout<<u.size()<<"\n";
for(int x... |
13fb2cc693e6e2caeb92b749fef2ed7186f468a5 | 36a2c17d1273369265f66f2c39f12117446314aa | SBU-Cpp-Club/cpp-exercises | /chapter-04/exercise-4.2-ac.cpp | C++ | cpp | 2,074 | no_license | #include<iostream>
#include<vector>
using std::cout;
using std::cin;
using std::endl;
using std::vector;
using std::begin;
using std::end;
// from 3.23
int main(){
int iread;
vector<int> v1;
vector<int*> pv1;
for (int i = 0; i < 10; i++){
v1.push_back(i);
}
cout << "Vector = ";
for (auto ... |
9889c2e66a81d8a01a8d0ecfab3e54f9352996cb | 94642bcf894c684dc0d78cc060ee6fcae8c5f5da | johnrsibert/admb | /tests/gtests/test_dvar_vector.cpp | C++ | cpp | 4,297 | permissive | #include <gtest/gtest.h>
#include <fvar.hpp>
extern "C"
{
void test_ad_exit(const int exit_code);
}
class test_dvar_vector:public ::testing::Test {};
TEST_F(test_dvar_vector, default_constructor)
{
dvar_vector v;
ASSERT_TRUE(v.va == NULL);
ASSERT_EQ(v.index_min, 0);
ASSERT_EQ(v.index_max, -1);
ASSERT_TR... |
f65c88731b45a43d107d04237beeccbd457d8404 | bfa4ce24fd67030bb6dc731b827010615f953232 | PanTomko/SimpleConsole | /SimpleConsole/src/Console.cpp | C++ | cpp | 8,761 | no_license | #include "Console.h"
// Macro for _setmode
#include <io.h>
#include <fcntl.h>
// file / io
#include <fstream>
#include <iostream>
#include "ConsoleModuleEvent.h"
using namespace sc;
Console::Console(Vector2D size, int font_size) {
// Setting up buffer and window
console_buffer_one = CreateConsoleScreenBuffer... |
add35d75ce5f460d0d835fb114a826059548dab6 | a8432339b5259a3f7d8ab8f01def6955cf448dbb | uralets/xray-16 | /src/Layers/xrRenderPC_GL/glResourceManager_Resources.cpp | C++ | cpp | 22,615 | permissive | #include "stdafx.h"
#pragma hdrstop
#ifndef _EDITOR
#include "../../xrEngine/Render.h"
#endif
#include "../xrRender/ResourceManager.h"
#include "../xrRender/tss.h"
#include "../xrRender/blenders/Blender.h"
#include "../xrRender/blenders/Blender_Recorder.h"
#include "../xrRenderGL/glBufferUtils.h"
#include "Layers/xrR... |
59c4fc72c52c1cbc448f4bca4b52fc0f4ba9017b | 844fe7a77c0b289db4676e6cee8f4a10d1789d3c | skononov/farich | /sim/src/RichPrimaryGeneratorMessenger.cc | C++ | cc | 2,449 | no_license | #include "G4UIcmdWithADoubleAndUnit.hh"
#include "G4UIcmdWithABool.hh"
#include "RichPrimaryGeneratorMessenger.hh"
#include "RichPrimaryGeneratorAction.hh"
RichPrimaryGeneratorMessenger::
RichPrimaryGeneratorMessenger(RichPrimaryGeneratorAction * action) :
richAction(action)
{
angleThetaCmd = new G4UIcmdWithADoubl... |
86da359de649007f18e7586733af28369334d0f8 | ac7b84c5b237c63825fc961a35370187483ded5d | bcjroberts/KarsioVS | /src/Game/Components/FloatingTextComponent.cpp | C++ | cpp | 1,279 | no_license | #include "FloatingTextComponent.h"
#include "../../Engine/Core.h"
#include "../../Engine/Entity.h"
FloatingTextComponent::FloatingTextComponent(Entity* relativeEnt, glm::vec3 color, float scale, std::string* text) : Component(FLOATING_TEXT) {
// Create text at the location where this is spawned
myRelat... |
b98a53503b6e6442b6e73776bd6d868b2d204d4e | 0218c664e3d9c98417829c0a70b033bd91aeb9fd | haolaoshi/winsock | /vs01-socket/chatViaDialog/client/ChatClient.cpp | C++ | cpp | 2,355 | no_license |
// ChatClient.cpp : 定义应用程序的类行为。
//
#include "stdafx.h"
#include "ChatClient.h"
#include "ChatClientDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CChatClientApp
BEGIN_MESSAGE_MAP(CChatClientApp, CWinApp)
ON_COMMAND(ID_HELP, &CWinApp::OnHelp)
END_MESSAGE_MAP()
// CChatClientApp 构造
CChatClientApp::CChatCl... |
6606f6ece780f5171a8a588ea58ae62de98f0272 | 65ac2a9d7a9e3c1ccdc122ac8743f6a1fecaae83 | purebloods/Codekata | /pro01.cpp | C++ | cpp | 332 | no_license | #include<iostream>
#include<cstring>
using namespace std;
int main()
{
char a[50],b[50];
cin.getline(a,50);
cin.getline(b,50);
int n,n1,n2;
n1=strlen(a);
n2=strlen(b);
n=(n1<n2)?n1:n2;
for(int i=0;i<n;i++)
{
if(a[i]==b[i])
cout<<a[i];
}
re... |
4a3ac5cf9d1a9a5bb888f0302f04a16e43252b5c | ede3fc074169bf0a1f22497ab79c774f33818e8b | OceanCodes/wdt | /Protocol.cpp | C++ | cpp | 20,238 | permissive | /**
* Copyright (c) 2014-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*/
#include <w... |
9c3ab6949dadcb1c09e8159d7e7ddfebb4192535 | bc8d36e2c90c98cdf973a3c9806203a961e28be2 | alnvnjr/MCAccel | /Emulations/build_dir.hw_emu.xilinx_aws-vu9p-f1_shell-v04261818_201920_1/link/vivado/vpl/prj/prj.srcs/sources_1/bd/pfm_dynamic/ip/pfm_dynamic_memory_subsystem_0/bd_0/ip/ip_2/src/xtlm_simple_memory_imp.cpp | C++ | cpp | 13,090 | no_license | // 67d7842dbbe25473c3c32b93c0da8047785f30d78e8a024de1b57352245f9689
#include "xtlm_simple_memory_imp.h"
#include "P2P_XTLM_extension.h"
#include <sstream>
#include <bitset>
class xtlm_simple_memory_imp::target_rd_util: public xtlm::xtlm_aximm_target_rd_socket_util {
public:
target_rd_util(sc_core::sc_module_name p_n... |
4e899f328db52a15cff19641daa2559a2ff920b5 | 54399d98285b70656dc1fa0cd87973acd4d24c87 | nv-chromium/chromium-crosswalk | /remoting/host/desktop_session_proxy.cc | C++ | cc | 19,775 | 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 "remoting/host/desktop_session_proxy.h"
#include "base/compiler_specific.h"
#include "base/logging.h"
#include "base/process/process_handle.... |
826587678b7d921ef3f855b2728610a1a16fe5d9 | f21352c2a9f931097a60de9c595d935b240a5720 | RunNJump/comsc210 | /LAB1/MyArray.cpp | C++ | cpp | 2,026 | no_license | // identification
// Programmer: Hongseok Jang
// Programmer's ID: 1560046
#include <iostream>
using namespace std;
#include <cstdlib> //atoi
class Array
{
int values[100];
int dummy;
public:
Array();
int capacity() const{return 100;}
int& operator[](int);
int operator[](int) const;
};
int main()
{
... |
ab890de61166c22115131f6b1ec15fe9a2b18792 | e09fba3f5aa686e6aa65c4f526e6e5f3766a446e | govorilka/fireworks | /laboratory/json_rpc/main.cpp | C++ | cpp | 244 | no_license |
#include <QtCore/QCoreApplication>
#include <QtCore/qdebug.h>
#include "jsonrpc.hpp"
int main(int argc, char *argv[])
{
QCoreApplication app(argc, argv);
//////////////////////
JsonRpc jsonRpc(&app);
return app.exec();
}
|
7050fee0625aaa2cdc86a5346cbe41bd8fac5f05 | 76186402bfb90afc5b05a47bbcc7a6bdecf8e463 | shashank077/Problems | /Chef_and_fruits.cpp | C++ | cpp | 653 | no_license | /*--------------------------------
Anshul Gangwar
Chandigarh University
--------------------------------*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define For(i,n) for(int i = 0;i < n;i++)
#define fr(i,a,b) for(int i = a;i <= b;i++)
#define Rfor(i,n) for(int i = n-1;i >= 0;i--)
#defi... |
e1e99a18743ecf7d68fd3a15e07656f1ee8e2a28 | c1648e0fa8b74ee071b1055b9a4ba3a0e8afda09 | brock7/TianLong | /Client/SceneEdit/Xerces/src/xercesc/validators/schema/identity/ValueStore.hpp | C++ | hpp | 5,424 | permissive | /*
* Copyright 2001-2004 The Apache Software Foundation.
*
* 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... |
7a33c0821a281a43d8c6e8e3560d1c26dcb3975e | 8ceb780c29431d52ca726c0e234f611b0dbc4bf7 | QDPeng/TFLite | /tflitelib/src/main/cpp/imageutils_jni.cc | C++ | cc | 6,059 | no_license | /* Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
8ab90bc6263cd35e438d2f7388e7827b7c380a1a | 31b62e7c59944ec767a4328ce1bd89345a4d991e | moos-ivp/svn-mirror | /ivp/src/app_bhv2graphviz/bhv2graphviz.cpp | C++ | cpp | 2,570 | no_license | #include "BehaviorSet.h"
#include "InfoBuffer.h"
#include "Populator_BehaviorSet.h"
#include "IvPDomain.h"
#include "StringTree.h"
#include "MBUtils.h"
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <cstdio>
int main(int argc, char* argv[])
{
if(argc != 3) {
std::cerr <... |
e4881bb948d2d5c6f1b1fe4494544d401d5a09fe | 2dc329ade8795790bde9df8357478d5b15797e38 | dingswork/Code | /UVa Online Judge/volume005/574 Sum It Up/program.cpp | C++ | cpp | 1,951 | no_license | // Sum It Up
// UVa ID: 574
// Verdict: Accepted
// Submission Date: 2016-08-17
// UVa Run Time: 0.040s
//
// 版权所有（C）2016，邱秋。metaphysis # yeah dot net
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#... |
08b167bb855312c4b8b72c14b38e9fdf26731e78 | dc11cc66e3bcd13c0098da4f2aeb9f0cf9b297d3 | DavidAlphaFox/notcurses | /src/tests/fds.cpp | C++ | cpp | 5,493 | permissive | #include "main.h"
#include <cerrno>
#include <mutex>
#include <cstring>
#include <fcntl.h>
#include <unistd.h>
#include <condition_variable>
static pthread_cond_t cond;
static pthread_mutex_t lock;
auto testfdcb(struct ncfdplane* ncfd, const void* buf, size_t s, void* curry) -> int {
struct ncplane* n = ncfdplane_p... |
0caea722e0db99e6966bf25c808862ff7e7e3370 | 77a1cfb2f43b3647e4c6a771b397277c6f41ee41 | aWilson41/GLEngine | /src/IO/AssimpPolyReader.cpp | C++ | cpp | 2,441 | no_license | #include "AssimpPolyReader.h"
#include "assimp/Importer.hpp"
#include "assimp/postprocess.h"
#include "assimp/scene.h"
#include "PolyData.h"
AssimpPolyReader::AssimpPolyReader()
{
outputData = std::make_shared<PolyData>();
}
void AssimpPolyReader::update()
{
if (fileName == "")
{
printf("AssimpPolyReader: No fil... |
27c911e953c4c08357b6a3c72b60abc876ee1809 | e9c7be0e98b571e2afa00a857e790906a38c90b0 | BioGearsEngine/core | /projects/biogears/libBiogears/unit/cdm/properties/test_core_SEScalarElectricCurrent.cpp | C++ | cpp | 2,692 | permissive | //-------------------------------------------------------------------------------------------
//- Copyright 2017 Applied Research Associates, 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... |
aa12941394d13b0f7ec45ff16736bcf2f3f76eeb | fc4f851f7a57a0cf58c06302af60188e295ef64e | rsazizov/gloom | /src/Main.cc | C++ | cc | 3,892 | no_license | #include "Level.hh"
#include "Wad.hh"
#include <GL/gl.h>
#include <GLFW/glfw3.h>
#include <cstdint>
#include <stack>
#include <iostream>
#include "RenderSystem.hh"
#include "VertexBuffer.hh"
#include "IndexBuffer.hh"
#include "RenderProgram.hh"
#include "InputSystem.hh"
#include "Camera.hh"
const float DOOM_SCALE = 1... |
cb6b117660a3d2d575209edf1fc2531d4f09c3b3 | 98f6f1f79a7c131e3cc887dd0bcb2f494836449a | SKantar/CrackingTheCoodingInterview | /04. Trees&Graphs/4_4.cpp | C++ | cpp | 1,468 | no_license | #include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
/************************************************************
* *
* Test *
* ... |
f50d89cede2538caddfac55b06b63b2d7a73281a | 2d810846f2059e78bdfeca81462d65ea5db94bc0 | Jianqiu-Wang/introtoCplusplus | /C++/code/3.4.3.cpp | C++ | cpp | 342 | no_license | /* Same with 3.4.2 except breaking out the loop if entering any negative number*/
#include <iostream>
using namespace std;
int main() {
while (true) {
int N;
cin >> N;
if (( N >= 0 ) && ( N % 5 == 0 )) {
cout << N << endl;
}
else if ( N <= 0 ) {
cout << "Goodbye!" << endl;
break;
}
else {
... |
6794bc45ed51182d36629cbf031f97a34137a275 | 7100ab0474b101b331047dfb8f268b2da1d39bed | kittusairam/C_RnD | /linked_list/src/SLL012Sort.cpp | C++ | cpp | 1,616 | no_license | /*
OVERVIEW: Given a single linked list of 0s 1s and 2s ,Sort the SLL such that zeroes
will be followed by ones and then twos.
You should only change the links and shouldnt swap the data. Basically no write operation should be done on data field.
INPUTS: SLL head pointer
OUTPUT: Sorted SLL ,Head should Final... |
dd21338ffbd0727cf5d532abb5661d34d0dc59a5 | 0c80755a09bb839eef61e32e6d4b42fbe986178e | alphaprime/nt2 | /modules/boost/simd/base/bench/ieee/simd/maxnummag.cpp | C++ | cpp | 1,990 | permissive | //==============================================================================
// Copyright 2003 - 2012 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2012 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// ... |
9b0b931fd97928bb4c637ddb35f00f588f8e4554 | e9c3c2a9b6b462740ade7834e33dd12a191974cf | xiaoqgao/windows_ce_5_121231 | /windows_ce_5_121231/WINCE500/PRIVATE/WINCEOS/COREOS/FSD/UDFS/udfsread.cpp | C++ | cpp | 4,671 | no_license | //
// Copyright (c) Microsoft Corporation. All rights reserved.
//
//
// This source code is licensed under Microsoft Shared Source License
// Version 1.0 for Windows CE.
// For a copy of the license visit http://go.microsoft.com/fwlink/?LinkId=3223.
//
//+------------------------------------------------------... |
854c5f9e14ea8467591e2ba9439b165e23927485 | e7dba56e3275cc4f9c5f86d7dfd3e217b6b239de | danieldzahka/cyclone | /core/cyclone_comm_dpdk.hpp | C++ | hpp | 19,665 | permissive | #ifndef _CYCLONE_COMM_DPDK_
#define _CYCLONE_COMM_DPDK_
#include<cinttypes>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <inttypes.h>
#include <sys/types.h>
#include <sys/queue.h>
#include <netinet/in.h>
#include <setjmp.h>
#include <stdarg.h>
#include <ctype.h>
#include <err... |
41717b5733a5481dbc559d312c82c961108f8fce | 57730a154b6e24c9c357e76a0de04ed53f15f173 | vishnupsingh523/My-Learning-Stage-of-Cplusplus | /Basics/PatternLoop.cpp | C++ | cpp | 456 | no_license | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
int a=n;
int arr[100][100];
// assigning value to the 1;
for(int i=0;i<n+n-1;i++)
{for(int j=0;j<n+n-1;j++)
arr[i][j]=a;
a--;
}
cout<<endl;... |
871f4e70b45f2d17d2e63b61a4670aefb788b3c4 | 13d38580f72244154a1bb9aad30ff8f3ec9ade77 | FuangCao/cavan | /cpp/Stack.cpp | C++ | cpp | 715 | no_license | /*
* File: Stack.cpp
* Author: Fuang.Cao <cavan.cfa@gmail.com>
* Created: 2013-07-24 19:05:01
*
* Copyright (c) 2013 Fuang.Cao <cavan.cfa@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 Soft... |
c2852e25f504216259716527eb6e151d37d4e1da | 286a0f901f8c47190c58f00328cac05cf70e48fc | Nozbe/zacs | /examples/native/ios/Pods/boost-for-react-native/boost/log/utility/unused_variable.hpp | C++ | hpp | 1,371 | permissive | /*
* Copyright Andrey Semashev 2007 - 2015.
* 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)
*/
/*!
* \file unused_variable.hpp
* \author Andrey Semashev
* \date 10.05.2008
... |
5d660f55e9204c77de11d4bb990318d1fb533c16 | f8c04365e60571defda3c17d87f11a47ee16a29c | keroro520/ACM | /hdu/hdu_4747.cpp | C++ | cpp | 4,466 | no_license | /*
线段树 区间乱搞 好题 思路题
题意：给定一个长度为 n 的非负数列，定义 mex(l, r) 为 l，r 区间里最小的没有出现的数字。求所有 mex(l, r) 的和
思路：比赛时想了一种分治区间的算法，虽然感觉可行，但是无奈细节巨烦，搞了3个小时都没搞出来！！！简单记录一下：以a[i]=0的i为中间分界线，把区间分成两部分，然后依次对两个区间找1,2,3...不断删区间，不断乱搞...
看了xiaodao的题解，巨赞。
***直接合并区间难以进行时。。利用离线先固定一个端点。。沿着另一个端点扫应该是接下来第一个要想的方法了***
先搞出mex[i]表示初始的mex(1,i)，已知是单... |
83df739bdb5bf7aa1db78b632fa1ef6c1405294c | 422bf00a5223b97503566c07cbf07e5a6c8e3f57 | chuhanpu/FNFUN | /SDK/FN_Border-StatRow-AffectedStatRowHighlight_classes.hpp | C++ | hpp | 673 | no_license | #pragma once
// Fortnite SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// BlueprintGeneratedClass Border-StatRow-AffectedStatRow... |
6ec7b89320b96f17e7e2cadcea0ae71e7ea126d8 | afcb90895c8117f1e36045fa6d276b34f718aec2 | lasseaeggen/stream-specialization-stack | /ss-scheduler/src/scheduler/scheduler_gams.cpp | C++ | cpp | 21,951 | no_license | #include "scheduler_gams.h"
using namespace SS_CONFIG;
using namespace std;
#include <unordered_map>
#include <fstream>
#include <list>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <algorithm>
#include "model_parsing.h"
#include "gams_models/softbrain_gams.h"
#include "gam... |
654f044fef0d85abe9b9cb2a2475b9e4badedfcb | 89b02834a1c106986ba32e79ccc521b65268ce83 | drinkingpanda/IBAMR | /examples/IBFE/explicit/ex8/example.cpp | C++ | cpp | 32,885 | no_license | // Copyright (c) 2002-2014, Boyce Griffith
// 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 o... |
45769a8b469ab230e604bf583eff49bd94a74041 | 53dfa1d372f953841335c338ec188ccf529a10a6 | rajeshwarn/formats-kaitai-io.github.io | /gif/src/cpp_stl/gif.cpp | C++ | cpp | 11,263 | no_license | // This is a generated file! Please edit source .ksy file and use kaitai-struct-compiler to rebuild
#include "gif.h"
gif_t::gif_t(kaitai::kstream* p__io, kaitai::kstruct* p__parent, gif_t* p__root) : kaitai::kstruct(p__io) {
m__parent = p__parent;
m__root = this;
_read();
}
void gif_t::_read() {
m_... |
ab36700e2126629cb767349ee69a76cc72b3fb11 | ea700664dddaefd5af5fc3c273f38abd2e22f2ed | ioqoo/PS | /2020 UCPC/base.cpp | C++ | cpp | 204 | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
return 0;
}
|
dc1442a8acbd6464b722af1ea13195cedf2ff85a | a92d8727c8c6a9ebbf219b6006cf6c8c0b87a458 | sgrady2/C-VtkVis | /VTK-build/Rendering/Volume/Testing/Cxx/vtkRenderingVolumeCxxTests.cxx | C++ | cxx | 10,939 | no_license | #include <ctype.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "/home/cheen/Desktop/410/VTK/Testing/Rendering/vtkTestingObjectFactory.h"
/* Forward declare test functions. */
int ProjectedTetrahedraZoomIn(int, char*[]);
int TestFinalColorWindowLevel(int, char*[]);
int TestFixedPointRayCastLi... |
6f9560b9ceadb44d7fbc9bb708b72cb0045c7d96 | d4e7835df563baf4f9ef2f2c306d3425387aad22 | niansa/xtd | /src/xtd.forms/src/xtd/forms/input_dialog.cpp | C++ | cpp | 6,580 | permissive | #define __XTD_FORMS_NATIVE_LIBRARY__
#include <xtd/forms/native/input_dialog.h>
#undef __XTD_FORMS_NATIVE_LIBRARY__
#include "../../../include/xtd/forms/application.h"
#include "../../../include/xtd/forms/button.h"
#include "../../../include/xtd/forms/system_texts.h"
#include "../../../include/xtd/forms/label.h"
#inclu... |
d4e32a9ceae3923122e35dbbbee587e8e63c5fc7 | a0031ff456712ff719ed216b833af65ddbb63878 | berniegao/godot | /tools/editor/project_export.cpp | C++ | cpp | 55,785 | permissive | /*************************************************************************/
/* project_export.cpp */
/*************************************************************************/
/* This file is part of: */
/* ... |
eb33a57fa7ff98e246a6855418f3300f6f2cef54 | 6008187bce6b240889894f7e148509e46f6f8d6b | sugawaratukasa/Jobi_SugawaraTsukasa | /吉田学園情報ビジネス専門学校_管原司/2年シューティング/ソースコード/魂首領/Mode/title.cpp | C++ | cpp | 4,532 | no_license | //******************************************************************************
// タイトル [title.cpp]
// Author : 管原 司
//******************************************************************************
//******************************************************************************
// インクルードファイル
//************************... |
beb5be890eb7986221a7e1ec9f3893bc198c95d1 | 8447d4fcea4c5ca2ce28c14bbcba28c6d7ef1c52 | zpt0219/llvm-project | /lldb/source/Plugins/SymbolFile/DWARF/DWARFUnit.cpp | C++ | cpp | 33,479 | permissive | //===-- DWARFUnit.cpp -----------------------------------------------------===//
//
// 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
//
//===---------------------------... |
5de379e6e4959845d5d995de60d830f7aacac2f3 | 31fda35e5923b713651d53f273c007f80e68b980 | SpirentOrion/osv | /core/semaphore.cc | C++ | cc | 1,693 | permissive | /*
* Copyright (C) 2013 Cloudius Systems, Ltd.
*
* This work is open source software, licensed under the terms of the
* BSD license as described in the LICENSE file in the top-level directory.
*/
#include <osv/semaphore.hh>
semaphore::semaphore(unsigned val)
: _val(val)
{
}
void semaphore::post_unlocked(uns... |
bb861abcc20d1559f6e5b96c264b4f709b35e2d2 | cb80e3f6db7ff46fe9b5ca51f900845fa7090c1a | zzmp/hifi | /libraries/ui/src/InfoView.cpp | C++ | cpp | 2,592 | permissive | //
//
// InfoView.h
//
// Created by Bradley Austin Davis 2015/04/25
// Copyright 2015 High Fidelity, Inc.
//
// Distributed under the Apache License, Version 2.0.
// See the accompanying file LICENSE or http://www.apache.org/licenses/LICENSE-2.0.html
//
#include "InfoView.h"
#include <SettingHandle.h>
#include ... |
2e2844f346d896b439c2121ccffdb53cdd29e7ac | 7ad7b1f2052114da00410f318cd0ab948cea612e | libbylg/DUILib-Lite | /DUILib/Utils/DPI.cpp | C++ | cpp | 6,402 | permissive | #include "Utils/DPI.h"
#include "Utils/VersionHelpers.h"
namespace DUI
{
//96 DPI = 100% scaling
//120 DPI = 125% scaling
//144 DPI = 150% scaling
//168 DPI = 175% scaling
//192 DPI = 200% scaling
typedef HRESULT(WINAPI* LPSetProcessDpiAwareness)(
_In_ PROCESS_DPI_AWARENESS value);
... |
c3b74b504578ffddd9686d23f714f1c6b48608bf | 0f533853780a30f0369b009861d83f9eab64f897 | piaoliushi/SmartServer | /net/client/dev_message/transmmiter/GlsqTransmmit.cpp | C++ | cpp | 19,291 | no_license | #include "GlsqTransmmit.h"
#include<QtCore/qmath.h>
namespace hx_net{
GlsqTransmmit::GlsqTransmmit(int subprotocol,int addresscode)
:Transmmiter()
,m_subprotocol(subprotocol)
,m_addresscode(addresscode)
{
}
GlsqTransmmit::~GlsqTransmmit()
{
}
int GlsqTransmmit::ch... |
957e9e7c36e43735f65029a7c7fcf6706f1c50da | 39fe24befbaaf82cbb805791251d62e393c30149 | gvnavin/ProblemsSolving | /src/com/leetcode/SimplyfyUnixPath.cpp | C++ | cpp | 879 | no_license | class Solution {
public:
string simplifyPath(string path) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int len = path.length();
assert(path[0] == '/');
int i,j;
i=1;
j=0;
while(i < len){
while(i<... |
9ff1358e8537010b361bd457a6177ee33777c92a | c9d5f405b5712c29d22fef36121b44b4764497c9 | petermarks/qlcplus | /qmlui/fixturemanager.cpp | C++ | cpp | 33,878 | permissive | /*
Q Light Controller Plus
fixturemanager.cpp
Copyright (c) Massimo Callegari
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.txt
Un... |
7d33a7d1fab566450d65e9b0dcc9ea2b36f6cd94 | c0edb58e2933690fb7376d20b3ccaeb9031dae58 | nishu112/Geek-Codes | /GeeksforGeeks/tempr.cpp | C++ | cpp | 1,325 | no_license | #include <bits/stdc++.h>
using namespace std;
#define pii std::pair<int,int>
#define vi std::vector<int>
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define each(it,s) for(auto it = s.begin(); it != s.end(); ++it)
#define ... |
72365d8801d6691e6ab3c723edc8647d03a1838a | 0a92cd64dbbd664c85c3fb0675c440297c74e66a | saeugetier/rastullahs-lockenpracht | /rl/engine/ui/src/SubtitleWindow.cpp | C++ | cpp | 1,341 | permissive | /* This source file is part of Rastullahs Lockenpracht.
* Copyright (C) 2003-2008 Team Pantheon. http://www.team-pantheon.de
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the Clarified Artistic License.
*
* This program is distributed in the hope that it will ... |
61fa21ef1d089396fd9b5d33bee3487f43809f55 | 58c68a12b2750905e185a4e5bd9d74cda8fb8a84 | zhangmengzxz/Tiger | /include/tiger/layers/cudnn/cudnn_tanh_layer.hpp | C++ | hpp | 1,136 | no_license | #ifndef TIGER_LAYERS_CUDNN_TANH_LAYER_HPP
#define TIGER_LAYERS_CUDNN_TANH_LAYER_HPP
#include "tiger/utils/cudnn.hpp"
#include "tiger/layers/neuron/tanh_layer.hpp"
#include "tiger/tiger.pb.h"
namespace tiger{
template <typename Dtype>
class CuDNNTanhLayer : public TanhLayer<Dtype>{
public:
explicit CuDNNTanhLayer(... |
06bf72812310f15a525e59fb147c324847a6af4c | ab9292617f02b16e03935eaa7d66832351c78c06 | lxq2537664558/GameProject3 | /Server/Src/DBServer/DBWriterManager.cpp | C++ | cpp | 2,731 | no_license | #include "stdafx.h"
#include "DBWriterManager.h"
CDBWriterManager::CDBWriterManager()
{
m_Stop = FALSE;
}
CDBWriterManager::~CDBWriterManager()
{
}
BOOL CDBWriterManager::Init()
{
m_pRoleDataWriter = new DataWriter<RoleDataObject>("Role");
m_pGlobalDataWriter = new DataWriter<GlobalDataObject>("Global");
m_p... |
1cad3af512038092fa65f35f8269ae455f9bcc56 | bd6a423fc79517050ab5627747ba2e3f3f8eba9c | tuanminhnguyen/Graphs-and-Operations-on-Graphs | /test_nodes.cpp | C++ | cpp | 2,959 | no_license | #include "CME212/Util.hpp"
#include "Graph.hpp"
static unsigned fail_count = 0;
template <typename T>
void sf_print(T a, std::string msg = "") {
(void) a;
std::cerr << msg << " [Success]" << std::endl;
}
void sf_print(bool sf, std::string msg = "") {
if (sf)
std::cerr << msg << " [Success]" << std::endl;... |
ca1241143d563a28b56158e81a62a50592ae1584 | e255a201d1cd3116998630867385beb8f124309e | Taysssir/Area | /evigilante_sdk/src/tcp/socket.hpp | C++ | hpp | 4,721 | no_license | #ifndef EOS_EVIGILANTE_SOCKET_HPP
#define EOS_EVIGILANTE_SOCKET_HPP
#include <vector>
#ifdef _WIN32
#include <basetsd.h>
#ifdef _WIN32_WINDOWS
#undef _WIN32_WINDOWS
#endif
#ifdef _WIN32_WINNT
#undef _WIN32_WINNT
#endif
#define _WIN32_WINDOWS 0x0501
#define _WIN32_WINNT 0x0501
#ifndef SHUT_RDWR
#define SHUT_RDWR 2
#e... |
2d9e0627099562ccd9e8d11a72a4b816a51e40db | d9caad22aa89c50b88c1a395072c325c5c129dc0 | MrCubble/Programas | /Dentista.cpp | C++ | cpp | 683 | no_license | #include <bits/stdc++.h>
using namespace std;
vector < pair <int, int> > consultas;
bool cmp(pair <int,int> a, pair <int, int> b)
{
return a.second <b.second;
}
int main()
{
int n;
scanf("%d", &n);
for(int i=0; i<n; i++)
{
int a, b;
scanf("%d %d", &a, &b);
consultas.push_... |
8d73faafb9a365607d8c83c4f0b1c73413b68423 | c0383c70f1b7747fd42aaad7417d91885d57d2fb | chicn/morizosan-learning-day | /cpp-time/reference/main.cpp | C++ | cpp | 753 | no_license | #include <iostream>
#include <utility>
using namespace std;
// pointer
void swap_ptr(int *a, int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
// reference
void swap_ref(int &a, int &b){
int tmp = a;
a = b;
b = tmp;
}
void f(int a, int &b, int c){
b += 10;
}
int main() {
int a = 10;
i... |
9f73edabf8722c2a7cf4e62e6830b316112cde90 | 8e263860adba57f0e6fb875435056ff5177a4e0b | JiajianZeng/ContextWithStructure | /src/caffe/layers/concat_layer.cpp | C++ | cpp | 4,003 | permissive | #include <vector>
#include "caffe/layers/concat_layer.hpp"
#include "caffe/util/math_functions.hpp"
namespace caffe {
template <typename Dtype>
void ConcatLayer<Dtype>::LayerSetUp(const vector<Blob<Dtype>*>& bottom,
const vector<Blob<Dtype>*>& top) {
const ConcatParameter& concat_param = this->layer_param_.c... |
e5f4c29ef8eb27a42decbd2ad834d0165ffd4c06 | 526fa82b2e049e0c8f21775043d471ac003223ad | mccdaq/uldaq | /src/net/NetDiscovery.cpp | C++ | cpp | 12,750 | permissive | /*
* NetDiscovery.cpp
*
* Author: Measurement Computing Corporation
*/
#include "NetDiscovery.h"
#include "../DaqDeviceManager.h"
namespace ul
{
pthread_mutex_t NetDiscovery::mDiscoveryMutex = PTHREAD_MUTEX_INITIALIZER;
std::vector<NetDiscovery::NetDiscoveryInfo> NetDiscovery::mAutoDiscoveryList;
std::vector... |
2a86c10f9cf1bcfcf5305ce3283269765520c21b | 508d026a6078280dde64a486eebc9a9222c6646f | daxingyou/cocos2d-x-games | /warrior/Classes/HelloWorldScene.cpp | C++ | cpp | 3,799 | no_license | #include "HelloWorldScene.h"
#include "cocostudio/CocoStudio.h"
#include "ui/CocosGUI.h"
#include "GameScene.hpp"
#include "LevelLayer.hpp"
#include "RecordLayer.hpp"
#include "Config.h"
USING_NS_CC;
using namespace cocostudio::timeline;
Scene* HelloWorld::createScene()
{
// 'scene' is an autorelease object
... |
bca4ada96ae6fa94ee05f8344835e839b5524cf4 | 29b18874d167500f4a6624af56a689aadf4327a0 | BigNewbiePlus/oclint-docker | /oclint-rules/rules/custom2/AbsolutePathToFileAndDirUsedRule.cpp | C++ | cpp | 2,901 | permissive | #include "oclint/AbstractASTVisitorRule.h"
#include "oclint/RuleSet.h"
using namespace std;
using namespace clang;
using namespace oclint;
class AbsolutePathToFileAndDirUsedRule : public AbstractASTVisitorRule<AbsolutePathToFileAndDirUsedRule>
{
public:
virtual const string name() const override
{
ret... |
02bb9116e7089a05dbe6316ad00fc71ebfb05daa | 9a2af4f594df8ef7df4826d55cb596fb2ebcf5a1 | potatoler/OI_Exercise | /填数游戏.cpp | C++ | cpp | 842 | no_license | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<climits>
#define int long long
using namespace std;
const int Mod = 1000000007;
int n, m;
inline int QuickPower(int a, int b){
int res = 1;
while(b){
if(b&1) res = res*a % Mod;
a = a*a % Mod;
b ... |
7cbd0705145bbce3dd2f7839c133042fb4e46662 | 9b65d39bf2ff8f44e8203b36ea2d0ada4190c441 | ebardes/dmxjoystick | /ola.cpp | C++ | cpp | 1,288 | no_license | #include "mac.h"
#if USE_OLA
#include <ola/Logging.h>
#include <ola/Callback.h>
using std::cout;
using std::endl;
bool eth::read(instance *in)
{
this->in = in;
wrapper.GetSelectServer()->Run();
return true;
}
bool eth::write(void)
{
wrapper.GetClient()->SendDMX(universe, buffer, ola::client::SendDMXArgs());
r... |
3562cfac2727cc9d955a2554dfa980bde172f21c | 0f909bbe7ce3a273935169b0862ada552cf4819f | RalucaPostolache/CaesarCipher | /CaesarCipher/main.cpp | C++ | cpp | 1,255 | no_license | #include <iostream>
#include <fstream>
#include <string>
#include "Caesar.h"
using namespace std;
int main()
{
string wordsToEncode[100];
string wordsToDecode[100];
string encodedWords[100];
string decodedWords[100];
Caesar driver;
int i = 0;
string task;
cout << "Would you like to encode (enter 'E'), decode... |
950958de4d28e56c7230df3eb86957788dc69bf6 | e1a448c47768b1ae1272dd8cb7db3f28580dfc75 | frankzhang99/HybridPlanning | /proactive/RPSTimeSeriesPredictor.cpp | C++ | cpp | 7,057 | no_license | //
// Copyright (c) 2015 Carnegie Mellon University. All Rights Reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this l... |
3bf59ca5535893b4eb0e686c5e3a91f29c1e6076 | 2f5efaf74f934a94b365d3246d1f7af577c2ef2a | emiraslan/E-olymp_solutions | /Solutions/2611_Reqem_Deyisdirme.cpp | C++ | cpp | 214 | no_license | #include <iostream>
using namespace std;
int main(){
string q;
char a , b;
cin >> q >> a >> b;
int n = q.size();
for(int i = 0 ; i < n ; i ++){
if( q[i] == a){
q[i] = b;
}
}
cout << q << endl;
}
|
3df5a0173ef319e79846a5c032066a4a91710ba1 | ad3e8e3de429f15f62147a86099c09de48bd2afb | Cosmin-Mihaila/POO-lab11-CPP | /main.cpp | C++ | cpp | 2,505 | no_license | #include "municipiu.hpp"
#include "capitala.hpp"
#include "tara.hpp"
int main()
{
Localitate **x = new Localitate*[4];
x[0] = new Localitate("Gaesti",10000,1500);
x[1] = new Oras(2500,"Picior de munte",5000,1000);
x[2] = new Municipiu("Muntenia",3000,"Dumbrava",5000,2500);
x[3] = new Ca... |
f57d4be69016fba74db6e97f61f92cddec07ac3d | 584106d3391b5c092d5a0f1c7980f98d32222f83 | VietHTran/pxCore | /remote/rtRemoteEnvironment.cpp | C++ | cpp | 6,809 | permissive | #include "rtRemoteEnvironment.h"
#include "rtRemoteConfig.h"
#include "rtRemoteServer.h"
#include "rtRemoteStreamSelector.h"
#include "rtRemoteObjectCache.h"
#include "rtError.h"
rtRemoteEnvironment::rtRemoteEnvironment(rtRemoteConfig* config)
: Config(config)
, Server(nullptr)
, ObjectCache(nullptr)
, StreamS... |
37c16fb2650579556b0ff99b4cc3d0d1b9967807 | 2c776ef42068b45aba288d288219434e7730ee0c | vijaygarg1/UT-Garg-EE382C-EE361C-Multicore | /cuda/NVIDIA_CUDA-7.5_Samples/1_Utilities/deviceQueryDrv/deviceQueryDrv.cpp | C++ | cpp | 14,604 | no_license | /*
* Copyright 1993-2015 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... |
3bc849c23f08e1d505e2fd931ff41f9b88d38f05 | 07a932d7275fef37918efad602213ec015538e8f | veqcc/atcoder | /atcoder/2018_6_2/c.cpp | C++ | cpp | 809 | no_license | #include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
ll N, ... |
bf061351d80ea2d09a6682e4e677b8552d4d5877 | fddf9cefde2292983cabcc7d6ea2df50f3b35bad | Abhi10arora/Anahita | /control_layer/level_mode_controller/src/Thruster.cpp | C++ | cpp | 1,491 | permissive | #include "level_mode_controller/Thruster.h"
using namespace std;
// tells the speed mode of the thruster
int Thruster::mode(int P)
{
if(P == 0)
return (int) Mode::STOP;
else if(P < 180)
return (int) Mode::LOW;
else if(P >= 180 && P < 220)
return (int) Mode::MED;
else
re... |
d7e34a957fac74dd33d145f154e2c95b1d3c0de0 | 323ae80a2eb62ec4290e3a725017cb887bfc3f1e | sam-jn/cp-contests-solutions | /codechef/LTIME86B/3.cpp | C++ | cpp | 3,712 | no_license | /*
AUTHOR : @sam_jn
*/
//lo + 1, hi, ret lo
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<pair<int, int>, null_type, less_equal<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define boost ios_base:... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.