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 |
|---|---|---|---|---|---|---|---|---|
5e044a83867a038b87c55e5d1efa1be2ec1f5505 | 9af6d8789bbb7d93cf24319a8781ccf7a57447c9 | AnvilOnline/AnvilClient | /AnvilEldorado/Source/Blam/Game/Stats/PlayerStats.hpp | C++ | hpp | 803 | permissive | #pragma once
#include "WeaponStats.hpp"
#include <Blam\Game\Damage.hpp>
#include <Blam\Game\Medals.hpp>
#include <cstdint>
namespace Blam::Game::Stats
{
struct PlayerStats
{
uint8_t Unknown0[0xC];
int16_t Score;
uint16_t Unknown1;
int16_t Kills;
uint16_t Assists;
uint16_t Deaths;
uint16_t Betrayals;... |
87fffadeb484b2865047b3364e43976b3bc9ae8c | ea25ced43a4614ed441bc113db5bd4eb3c62e9d1 | minghuam/hand-detection | /src/color_feature.hpp | C++ | hpp | 848 | no_license | /** @file color_feature.hpp
* @brief ColorFeature class header.
* @author minghuam
*/
#ifndef __COLOR_FEATURE_HPP
#define __COLOR_FEATURE_HPP
#include <iostream>
#include "feature.hpp"
#include "image_cache.hpp"
/* color space enum defines */
enum COLOR_SPACE{
CS_RGB,
CS_LAB,
CS_HSV
};
/**
* @brief RGB/HSV Color... |
a4ee976565fe55b5a068d571a2ade7b2ef7cb9fa | c041651a33279c9bca7c90efa1a12fc2440d0c8f | rishavjnv12/Code-backup | /november/final.cpp | C++ | cpp | 2,176 | no_license | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mx = 3*1e5;
const int mod = 4294967295;
int mx_level = 0;
int n,q;
vector<int> tree[mx+1];
vector<vector<int>> lvl;
vector<int> memo[mx+1];
int w[mx+1],par[mx+1],level[mx+1],vis[mx+1],ans[mx+1],till[mx+1],idx[mx+1];
bool known[mx+1];
int ad... |
aa3d0867fe845597ec11e0a0b8d8ac70a05b482a | db718d4823f6e1506a8301e3381eb912893ce966 | vthemelis/hhvm | /hphp/runtime/ext/server/ext_server.cpp | C++ | cpp | 10,451 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-present Facebook, Inc. (http://www.facebook.com) |
| Copyrigh... |
60d2029b17e071c50c3e2686a4580aa3dd44e7b3 | 52951758274447e8be27cea4e6569ec734d88a93 | naumushv/cpp-yellow-belt | /week 1/mass of blocks/mass of blocks.cpp | C++ | cpp | 839 | no_license | #include <iostream>
#include <limits>
#include <vector>
using namespace std;
struct capacity{
int64_t W, H, D;
};
int main() {
int n, r;
vector<capacity> v1;
try {
cin >> n >> r;
if (n < 0 || r < 0) throw;
for (int i=0; i < n; i++){
if (cin.fail() || cin.eof()) throw;
capacity cap;
cin >> cap.W >... |
69715122cdbdd119cc7cfc3071d4d46ab7467032 | d80ed6d440263d5f26ef61194a46fcff248d7453 | WestRyanK/Rodent-VR | /RodentVR/Intermediate/Build/Win64/RodentVR/Inc/Engine/InterpTrackFloatBase.gen.cpp | C++ | cpp | 6,422 | no_license | // Copyright Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
========================================================================... |
e3e31f8f01984cfee584efb0123cc87a02e2dc4f | 70690aec02e41f4492a91154918a68233281f42a | Emtiaj-Ahmed/Lightoj | /1072.cpp | C++ | cpp | 295 | no_license | #include<stdio.h>
#include<math.h>
#define pi 3.14159265359
int main()
{
double r,R,deg,rad;
int n,t,i;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%lf%d",&R,&n);
deg=(360/(2.0*n));
rad=(pi*deg)/180;
r=(R*sin(rad))/(1+sin(rad));
printf("Case %d: %.10lf\n",i,r);
}
return 0;
}
|
9267ba7fcf011e5e1337a7d2a5a2a476f399c105 | eafdc4c3d13e56eb5cdc951dfdb2220d87c39041 | revery-ui/esy-skia | /src/utils/SkParseColor.cpp | C++ | cpp | 21,234 | permissive | /*
* Copyright 2006 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkParse.h"
#ifdef SK_DEBUG
#include "SkString.h"
#ifdef SK_SUPPORT_UNITTEST
// compress names 6 chars per long (packed 5 bits/char )
... |
d80ad743d127aa264267016699260eca06022cb6 | 9d37954cd5bc83c17af8af62d9c358f8e39e8110 | williamhampton/C | /cpp_review/cpp_1/square.cpp | C++ | cpp | 213 | no_license | #include <iostream>
using namespace std;
int main(){
int value,square;
cout << "Give me a Number to square\n";
cin >> value;
square = value*value;
cout << "The value squared is: "<<square;
return 0;
}
|
6cc79358253ab083daefbb7c02ca069955d02ac6 | 97cee1e76f86ad7e8627f520571b165c1ba894fe | akawashiro/competitiveProgramming | /probrems/AOJ1075.cpp | C++ | cpp | 942 | no_license | //AOJ1075
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int n,m;
int x[30],y[30],r[30],c[30],sc[900][2],up[30];
char dp[1<<24];
int rec(int left){
if(dp[left]!=-1) return dp[left];
int res=n-__builtin_popcount(left);
for(int i=0;i<m;i++){
int a=sc[i][0],b=sc[i][1];
if((left&(1<... |
7a7982e066d80be8291be1820c5483c4120b8d77 | 2210edcd9bcaabb6fba593494c57d7cb4b24ab0c | windystrife/UnrealEngine_NVIDIAGameWorks | /Engine/Source/ThirdParty/IntelTBB/IntelTBB-4.0/src/test/test_rwm_upgrade_downgrade.cpp | C++ | cpp | 2,436 | permissive | /*
Copyright 2005-2012 Intel Corporation. All Rights Reserved.
The source code contained or described herein and all documents related
to the source code ("Material") are owned by Intel Corporation or its
suppliers or licensors. Title to the Material remains with Intel
Corporation or its supplier... |
39d4056214252adbb899d8c705fc24162a68d8a6 | a5bc10dbbdb2390d5b69ed426eee071e26d230e2 | Thelm76/webots | /src/webots/nodes/WbMotor.cpp | C++ | cpp | 18,112 | permissive | // Copyright 1996-2019 Cyberbotics 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 or agr... |
cd63fe8cbdf69505569b63b211a0d934e68a3888 | 8e34bc351e2a47a698cdd035d0cac886c43d2d3f | NicolasBeltran70/C | /vectores y matrices/numero mayor.cpp | C++ | cpp | 465 | no_license | #include<iostream>
#include<stdlib.h>
using namespace std;
int main (){
int numeros[100],n,mayor=0;
cout<<"Digite el numero de elementos del arreglo: ";
cin>>n;
cout<<endl;
for(int i=0;i<n;i++){
cout<<"Digite el numero "<<i+1<<" : ";
cin>>numeros[i];
if(numeros[i]>mayor){
may... |
cd0da010a9a00754d58a743d086926f07ac7ea2d | 7a82e7a643c0e730ab0fda6a76d89071b8fe9a15 | Vizionnation/chromenohistory | /chrome/browser/chromeos/printing/synced_printers_manager_unittest.cc | C++ | cc | 9,341 | permissive | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/printing/synced_printers_manager.h"
#include <algorithm>
#include <memory>
#include <utility>
#include "base/bind.h"
#... |
ff50a7e9c200569b7c2783910ef581924e3eebba | a8d6fa513961f77f1680d2afc0d8a1a57b62ffb3 | kiwiwin/topcoder | /srm_156_div2_300.cpp | C++ | cpp | 396 | no_license | #include <vector>
#include <algorithm>
using namespace std;
class DiskSpace{
public:
int minDrives(vector <int> used, vector <int> total){
sort(total.begin(), total.end());
int space = 0;
for (int i = 0; i < used.size(); i++)
{
space += used[i];
}
int full = 0;
int j = total.size() - 1;
while(0 < s... |
679617063e9ecfe68104e8d40213cedc695c0ab3 | ba635a7b078068e18f7af5b9ad6c1f5d86d4a125 | lazybetrayer/leetcode | /ugly-number-ii.cc | C++ | cc | 460 | no_license | // https://leetcode.com/problems/ugly-number-ii/
class Solution {
public:
int nthUglyNumber(int n) {
vector<int> v{1};
v.reserve(n);
int i = 0, j = 0, k = 0;
while (v.size() < n) {
int m = min(v[i] * 2, min(v[j] * 3, v[k] * 5));
v.push_back(m);
i... |
907a7e1232e606244dddd06c0a2cf7a61037f644 | 4f59c2bbb2ba4c4e5030d19106583de5bcbfdaa8 | ChaoticRoman/kurz_c | /arrays/cpp/tictactoe1D_hotovo.cpp | C++ | cpp | 2,179 | no_license | #include <iostream>
#include <random>
#define N 10
#define volne '_'
#define hrac 'x'
#define pocitac 'o'
#define remiza '!'
using namespace std;
void tiskni_pole(const char pole[N]) {
for(int i=0; i<N; ++i) cout << i;
cout << endl;
for(int i=0; i<N; ++i) cout << pole[i];
cout << endl;
}
char... |
7324000b66da5e84956a408ce458c0383c189bb5 | 11e6b0d255e78287cebcb96c7aebb0b8fce1e489 | ehnryx/acm | /kattis/slikar-lca.cpp | C++ | cpp | 1,973 | no_license | #include <bits/stdc++.h>
using namespace std;
//%:include "utility/fast_input.h"
//%:include "utility/output.h"
%:include "graph/breadth_first.h"
using ll = long long;
using ld = long double;
constexpr char nl = '\n';
constexpr int MOD = 998244353;
constexpr ld EPS = 1e-9L;
random_device _rd; mt19937 rng(_rd());
... |
d2ead4a47619238b3b18ac873ba120932667be06 | d1d7699323f1252dafc99cd4fb90bc1996489746 | LDlornd/OI-Memory | /QuestOJ/[JXOI2018模拟]3-7/[JXOI2018模拟]变量/未命名1.cpp | C++ | cpp | 1,793 | no_license | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n, sum, a[10], mp[5][5];
bool vis[10], vmap[5][5];
void print()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++) printf("%d ", mp[i][j]);
printf("\n");
}
}
bool check(int cnt)
{
int ch=0, flag=0;
if(cnt<=n+1... |
c52208c41e24d241ddbea78f490f27a5d3f159f4 | 145232c1ea1377ced16191515d0301bca5398cec | AudioBucket/AudioTK | /ATK/Core/ComplexConvertFilter.cpp | C++ | cpp | 2,027 | permissive | /**
* \file ComplexConvertFilter.cpp
*/
#include <ATK/Core/ComplexConvertFilter.h>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
namespace ATK
{
template<typename DataType_>
RealToComplexFilter<DataType_>::RealToComplexFilter(std::size_t nb_channels)
:Parent(2 * nb_channels, nb_ch... |
fb558e98f6463646aa5260a8ecc7e27af1dbe192 | b57e9e892c75cc9f39614a95456f32efda171fe6 | Apex5803/hailstorm | /src/Commands/MoveMagiKarpetIn.cpp | C++ | cpp | 540 | no_license | /*
* MoveMagiKarpetAuto.cpp
*
* Created on: Feb 21, 2017
* Author: first
*/
#include <Commands/MoveMagiKarpetIn.h>
MoveMagiKarpetIn::MoveMagiKarpetIn() {
// TODO Auto-generated constructor stub
Requires(Robot::magiKarpet.get());
}
void MoveMagiKarpetIn::Initialize(){
}
void MoveMagiKarpetIn::Execute(... |
4a62aa3e9f47d9404facec8e7631bc865f79717f | aa69c83d71a451acadefebccf48ca8b6d67e7d28 | iridium-browser/iridium-browser | /chrome/browser/ash/system_extensions/api/window_management/cros_window_management_context_factory.cc | C++ | cc | 2,114 | permissive | // Copyright 2022 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ash/system_extensions/api/window_management/cros_window_management_context_factory.h"
#include "base/no_destructor.h"
#include "chrome/browser/ash/sys... |
778970e491c9bcb1cf0210e9d370729c43ac45fe | 696692d38d52261dc3bd42cb1c3cf2c4f6528db1 | JeongJinLee/algorithm | /acmicpc code/2456.cpp | C++ | cpp | 2,706 | no_license | #include <stdio.h>
int arr[3] = { 0, };//각 0,1,2의 점수를 저장하는 배열
int arr2[3][3] = { { 0, }, };//각 0,1,2, 후보의 1,2,3점 카운트
int main(void) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++){
int a, b, c;
scanf("%d %d %d", &a,&b,&c);
arr[0] += a;
arr[1] += b;
arr[2] += c;
arr2[0][a - 1]++;
ar... |
8c256d9ed59e43e02018e8fdefef839e1d259ac9 | eb43e46ce8e29eff1df8668c5235068748b9bd1b | niuxu18/logTracker-old | /second/download/httpd/gumtree/httpd_patch_hunk_2910.cpp | C++ | cpp | 512 | no_license | continue;
}
/* if we get here, the main entry rule was a match */
/* this will be the last run through the loop */
#if MIME_MAGIC_DEBUG
- ap_log_rerror(APLOG_MARK, APLOG_DEBUG, 0, r,
+ ap_log_rerror(APLOG_MARK, APLOG_DEBUG, 0, r, APLOGNO(01533)
... |
1684b3756cb178e2a8f15785404a29ef5a67054a | aa4d9e61997c92def458fe1e754dda269c0f6a09 | zapplelove/IJRR_WBLC | /DynaController/NAO_Controller/TestSet/WalkingTest.cpp | C++ | cpp | 6,851 | no_license | #include "WalkingTest.hpp"
#include <NAO_Controller/NAO_StateProvider.hpp>
#include <NAO_Controller/CtrlSet/BodyCtrl.hpp>
#include <NAO_Controller/CtrlSet/SingleContactTransCtrl.hpp>
#include <NAO_Controller/CtrlSet/BodyFootPlanningCtrl.hpp>
#include <ParamHandler/ParamHandler.hpp>
#include <Planner/PIPM_FootPlacemen... |
2566d9bddb65f458acc2d8aca21807361cedf639 | f4a5fa0a40f0fec782f3b68e19acd48114f979d1 | akertesz/oneAPI-samples | /DirectProgramming/DPC++FPGA/Tutorials/DesignPatterns/triangular_loop/src/triangular_loop.cpp | C++ | cpp | 9,058 | permissive | //==============================================================
// Copyright Intel Corporation
//
// SPDX-License-Identifier: MIT
// =============================================================
#include <CL/sycl.hpp>
#include <CL/sycl/INTEL/fpga_extensions.hpp>
#include <chrono>
// dpc_common.hpp can be found in the... |
0a8faa9aeb57ad233999c3d663403f9f8756ccdd | 93818feae18357df446a7606d67b83502b5fb15e | RanjithkumarRagavan/platform_development | /tools/emulator/opengl/host/libs/Translator/GLcommon/GLEScontext.cpp | C++ | cpp | 17,176 | no_license | #include <GLcommon/GLEScontext.h>
#include <GLcommon/GLfixed_ops.h>
#include <GLES/gl.h>
#include <GLES/glext.h>
//decleration
static int findMaxIndex(GLsizei count,GLenum type,const GLvoid* indices);
static void convertDirectLoop(const char* dataIn,unsigned int strideIn,void* dataOut,unsigned int nBytes,unsigned int ... |
4de9250dd3f43ba0b1e55aee18560f0d18500648 | c6a77a8de61f885f6878e6391d6457d8060543f3 | OSU-CS162-W17/class-basics | /student.hpp | C++ | hpp | 2,286 | no_license | /*
* This file contains a class definition for representing a student. The
* implementation for this class is in student.cpp.
*/
#ifndef STUDENT_HPP
#define STUDENT_HPP
/*
* Here's the class we'll use to represent a student. It contains four data
* members, one to hold the student's name and one for their ID n... |
202d535e72cab78350b00365f4dbba1c61aec7a9 | 3b59ffa1fe3d1c847bfefdc5694a5a1fa1f640a0 | xtudbxk/cython_wrapper_for_permutohedral_lattice | /src/modified_permutohedral.cpp | C++ | cpp | 22,562 | no_license | #ifdef __SSE__
// SSE Permutoheral lattice
# define SSE_PERMUTOHEDRAL
#endif
#if defined(SSE_PERMUTOHEDRAL)
# include <emmintrin.h>
# include <xmmintrin.h>
# ifdef __SSE4_1__
# include <smmintrin.h>
# endif
#endif
#include<vector>
#include"modified_permutohedral.hpp"
/***********************************************... |
1350dd24fe4351b082d47a98d90739b82dec1e6f | 22bcbb9182e95f7f47ea3045808fa04f8f461ca5 | ArmandoReyesRepo/Cplusplus3 | /Chapter 12/04 tryblkfnc/tryblkfnc.cpp | C++ | cpp | 473 | no_license | // A try block can be localized to a function.
#include <iostream>
using namespace std;
// A try/catch is reset each time a function is entered.
void Xhandler(int test)
{
try
{
if(test) throw test;
}
catch(int i)
{
cout << "Caught One! Ex. #: " << i << '\n';
}
}
... |
9979f5eaf49b4b5610d8f92c18d30aa89dfd3d76 | ed258d99ef7fa664080cac40a1b3a9bfd9aa85ef | anindya028/Programming-Contest-Problems | /UVa/v109/10929.CPP | C++ | cpp | 554 | no_license | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
char s[1001];
int i,sum1,sum2,length,dif;
void main()
{
while(scanf("%s",s)==1)
{
if(s[0]=='0'&&s[1]=='\0')break;
length=strlen(s);
for(i=sum1=0;i<length;i+=2)
{
sum1+=(s[i]-'0');
}
for(i=1,sum2=0;i<l... |
2e90ae600eb8d9e30d696dd4a65574220e423890 | aea1a26ff7a7fdbcc5e448c81a014d783695c093 | sailfish009/binding_affinity_calculator | /lib/rosetta/source/src/basic/tensorflow_manager/TFDataTypeDetector.hh | C++ | hh | 2,303 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
1d9d9ab887eb7baae18f6f2464d2f713192f16c0 | 793a799fcdcbb24366425251ef22d02bcd30851c | bas051969/PropWare | /Examples/PropWare_MAX6675/MAX6675_Demo.cpp | C++ | cpp | 2,655 | permissive | /**
* @file MAX6675_Demo.cpp
*
* @author David Zemon
*
* @copyright
* The MIT License (MIT)<br>
* <br>Copyright (c) 2013 David Zemon<br>
* <br>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 t... |
91052b93050e8fd53666293c5c1acd58975664e0 | b154a5bb9810ab2814c16eb4aeffd2afafa0223f | MiT-HEP/MitEwk13TeV | /EleScale/EnergyScaleCorrection_class.cc | C++ | cc | 17,496 | no_license | #include "EnergyScaleCorrection_class.hh"
#include <RooDataSet.h>
#include <RooArgSet.h>
#define NGENMAX 10000
// for exit(0)
#include <stdlib.h>
// for setw
#include <iomanip>
//for istreamstring
#include <sstream>
//#define DEBUG
//#define PEDANTIC_OUTPUT
//
//#include "FWCore/ParameterSet/interface/FileInPath.h"
... |
4b9a4040964698913f1aa1766074a9cc33eb87f8 | b61ceec902e14a22d3311d4c13f5cb63ce8a4388 | HaelC/LeetCode | /C++/1312. Minimum Insertion Steps to Make a String Palindrome/candidate.cpp | C++ | cpp | 425 | no_license | class Solution {
private:
int insertions(string& s, int i, int j) {
if (i >= j) {
return 0;
}
if (s[i] == s[j]) {
return insertions(s, i + 1, j - 1);
}
else {
return min(insertions(s, i + 1, j), insertions(s, i, j - 1)) + 1;
}
}... |
e7083f2476cdeca77bbd7296af775d9b1656e417 | 5efa370fd05f2327fc621049b731ea7ca2639710 | Cyprella/suc | /src/nyx-cli.cpp | C++ | cpp | 12,310 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Copyright (c) 2017-2018 The Nyx Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licen... |
ef63ed6e8da73ef0edc0d056ef9eaa0cc934aab3 | 6d3f4d8c6588035506444ca6d5b9284ef5ad4727 | jyami-kim/c_language | /10. Pointer/lab10_2_my.cpp | C++ | cpp | 1,001 | no_license | #include <stdio.h>
#define MAX_ROW 10
#define MAX_COL 10
int main(int argc, char **argv) {
int A[MAX_ROW][MAX_COL];
int B[MAX_ROW][MAX_COL];
int rowa, cola, rowb, colb;
int i, j;
printf("A row?\n");
scanf("%d", &rowa);
printf("A col?\n");
scanf("%d", &cola);
for (i = 0;i < rowa;i++) {
... |
dd50771672d0b55c79d7eeb006589c9317339780 | bc8305d7ff018d22eee536e66689b6b35cf18280 | asadnorouzi/roboerectus-atwork | /src/aricc_control/aricc_lowpass_filter/src/main.cpp | C++ | cpp | 1,940 | no_license | #include <ros/ros.h>
#include <geometry_msgs/Twist.h>
namespace aricc_control{
class LowPassController{
private:
double t_; //sec
double dt_; //ms
double x_, y_, theta_, eps_;
double rate_;
std::string pub_topic_, sub_topic_;
ros::Publisher pub_;
ros::Subscriber sub_;
ros::NodeHandle nh_, pnh_;
voi... |
a05f225ec3d8046a2c41895b3f74bd12803ab044 | 25ccdb03804036e2cb6c7f9c1e0caeae6e77dd1c | otcshare/chromium-src | /third_party/blink/renderer/modules/webgl/webgl_compressed_texture_etc.cc | C++ | cc | 1,757 | permissive | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/modules/webgl/webgl_compressed_texture_etc.h"
#include "third_party/blink/renderer/modules/webgl/webgl_rendering_con... |
52d5a1cdc9c2f25d4fbf02b10b5befaca96d30ea | 77e6871a8193bf8e2ac2fee6ec4afb500796ce70 | Dayu0501/daily_practise | /mysql_uuid/json/json_reader.cpp | C++ | cpp | 20,986 | no_license | #include "reader.h"
#include "value.h"
#include <utility>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <iostream>
#include <stdexcept>
#if _MSC_VER >= 1400 // VC++ 8.0
#pragma warning( disable : 4996 ) // disable warning about strdup being deprecated.
#endif
namespace Json {
// Implementation o... |
1cd3e0dc2ff093299917dd605983cddf45dec973 | baf4cd379cb2f66373bdef89720d59c3f6e2db02 | ku-alps/sw17_sanhae | /Baekjoon/내려가기/sol1.cpp | C++ | cpp | 658 | no_license | // https://www.acmicpc.net/problem/2096
#include<ios>
#include<algorithm>
int n, a[3], i, ii, j, dx[3][2], dn[3][2], f, mn = 1e6, mx;
int main() {
scanf("%d", &n);
while (n--) {
scanf("%d%d%d", a, a + 1, a + 2);
dn[0][f] = dn[1][f] = dn[2][f] = mn;
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++) {
... |
c048b6722e8b4ffc12a7646d03999e5757b64b9f | 63c930e45178cf7675b5fdb19a15bf476135ed2f | Kiritow/OJ-Problems-Source | /HDOJ/3006_autoAC.cpp | C++ | cpp | 690 | no_license | #include<stdio.h>
#include<string.h>
int s[1<<15];
int n,m,k,element;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
int ans=0;
memset(s,0,sizeof(s));
while(n--)
{
int set=0;
scanf("%d",&k);
while(k--)
{
... |
78866f9734d39a068a5804b51e7e7a6fbc6fffab | 59dd29cea1e9ef615acf48e027a0b9e97ad1f7c0 | alice965/LaonSillv2 | /LaonSill/src/layer/RecallLayer.cpp | C++ | cpp | 7,721 | permissive | /*
* RecallLayer.cpp
*
* Created on: Aug 9, 2017
* Author: jkim
*/
#include <opencv2/core/core.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <opencv2/highgui/highgui.hpp>
#include "RecallLayer.h"
#include "PropMgmt.h"
#include "SysLog.h"
#include "StdOutLog.h"
#include "IO.h"
#include "MemoryMgmt.h"... |
b19ee196a773eab381ff6a78c813ef409d22d663 | 8a6162786437052ca2401840d252e51744911997 | rabbit090/taekwindow | /src/comctl.hpp | C++ | hpp | 321 | no_license | #ifndef COMCTL_HPP
#define COMCTL_HPP
#include <windows.h>
#include <commctrl.h>
/* Initializes the Common Controls library.
* Any class using the common controls should ensure that an object of this class
* exists during its lifetime.
*/
class CommonControls {
public:
CommonControls();
};
#endi... |
2d4593086ea1611355aa96467fd31d4c43bd8b03 | 0e051c396f39e9d4a773e347a5bb7a6f4c23f779 | Outlande/loop_hfnet | /fund_mat/fundmental_matrix.cpp | C++ | cpp | 17,637 | no_license | #include <random>
#include <fundmental_matrix.h>
/*初始化函数*/
fund_mat::fund_mat(const std::vector<cv::KeyPoint> &img_kpt,
const std::vector<cv::KeyPoint> &query_kpt,
const std::vector< cv::DMatch > &match_result,
float sigma, int iterations)
:mvKeys1(img_kpt), mvKeys2(query_kpt), mvMatc... |
c733b80fd4c96ad6b1a599a039a47056cfb48754 | 8d4fcca0a38514914d788b942c8b5205d102a19d | hmzakhalid/Unix-Threads-and-Processes-C-Programs | /NamedPipes/ArraySum/SumRead.cpp | C++ | cpp | 630 | no_license | #include<iostream>
#include<unistd.h>
#include<time.h>
#include<sys/stat.h>
#include<sys/types.h>
#include<errno.h>
#include<fcntl.h>
using namespace std;
int main(){
int arr[5], sum = 0;
srand(time(NULL));
int fd = open("sum", O_RDONLY);
if(fd == -1) return 1;
for(int i=0; i<5; i++){
arr... |
80c463d7b65073adb2729b7d9073b34f7aecceea | b12a61a8908ffb17d283d997ac266361e2041b63 | freeeebird/manoi | /src/windows/AssemblyInfo.cpp | C++ | cpp | 1,308 | no_license | //#include "stdafx.h"
using namespace System;
using namespace System::Reflection;
using namespace System::Runtime::CompilerServices;
using namespace System::Runtime::InteropServices;
using namespace System::Security::Permissions;
//
// General Information about an assembly is controlled through the following
// set o... |
2a713c8c5b4a72263e9282024b318c5459e27ce4 | 05ed5ac74ba9c47b395c4657f8014816803d125e | iridium-browser/iridium-browser | /ash/capture_mode/test_capture_mode_delegate.cc | C++ | cc | 6,821 | permissive | // Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/capture_mode/test_capture_mode_delegate.h"
#include "ash/capture_mode/capture_mode_types.h"
#include "ash/capture_mode/fake_video_source_provider.h"
#include "as... |
1e07f22db08a705c2fc1d5d923a9d700e0e7fa09 | e62ab2302850115201794b051617a8d95c2e34e2 | sanchit-ahuja/cppcode | /mergesort.cpp | C++ | cpp | 1,502 | no_license | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(in... |
3fb00e7fe5d4412b3b31dc76cb13a8242aaa7190 | 238e0accae944fad81580115916f0460bbebce53 | seanyen/logging-log4cxx | /src/main/cpp/defaultrepositoryselector.cpp | C++ | cpp | 1,164 | permissive | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may ... |
5c7a7d915bd51a3818ef70bcd2725f2aae1e2a25 | ee00320e2b0dc28a2cd285f6feaaf5e9cd0ab073 | d8euAI8sMs/ss-10-tetrode | /src/tetrode/tetrode.cpp | C++ | cpp | 2,870 | permissive | // tetrode.cpp : Defines the class behaviors for the application.
//
#include "stdafx.h"
#include "tetrode.h"
#include "tetrodeDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// CTetrodeApp
BEGIN_MESSAGE_MAP(CTetrodeApp, CWinApp)
ON_COMMAND(ID_HELP, &CWinApp::OnHelp)
END_MESSAGE_MAP()
// CTetrodeApp constr... |
836dd7ef6ad1d9143169596209f08aec80ad6e57 | a6c47bcb4cfe9993d16aea940a606d38f13ac815 | zacharyvincze/chip8 | /src/easylogging++.cpp | C++ | cpp | 138,656 | no_license | //
// Bismillah ar-Rahmaan ar-Raheem
//
// Easylogging++ v9.96.7
// Cross-platform logging library for C++ applications
//
// Copyright (c) 2012-2018 Amrayn Web Services
// Copyright (c) 2012-2018 @abumusamq
//
// This library is released under the MIT Licence.
// https://github.com/amrayn/easyloggingpp/blob/mas... |
bd0d3301ee2eac53c55769c83f29349cc7e20919 | b001b5b6f6b4d9b5146bf1bb0714dc19e022a41c | swang109/leetcode | /reverse_linked_list.cpp | C++ | cpp | 371 | no_license | struct ListNode{
int val;
ListNode* next;
ListNode(int x):val(x), next(NULL) {}
};
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode *pre=NULL, *cur=head, *next;
while(cur!=NULL){
next=cur->next;
cur->next=pre;
pre=cur;
... |
c49e5c7515e90e58eb5ef171353b4b8c357f85bc | 10ad0dbbff45196b2df922e83443af1bd3cc25a0 | AndyJMR/ITK | /Examples/RegistrationITKv4/ImageRegistration5.cxx | C++ | cxx | 29,667 | permissive | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* h... |
6ba3af4388e3930d5c3e2c9e0e27702891be3d7d | 5baa443f159c33e2feee33420eca95b46f06f743 | BarefootBKK/Gobang-Star-theme | /Gobang Online/Gobang Online/Onlinepvp.cpp | C++ | cpp | 3,268 | no_license | // Onlinepvp.cpp
#include "Onlinepvp.h"
#include"chessboard.h"
// 构造函数
Onlinepvp::Onlinepvp(QWidget *parent)
: QWidget(parent)
{
ui.setupUi(this);
this->initData(); // 初始化数据
}
// 初始化数据
void Onlinepvp::initData()
{
// 固定窗口大小
this->setMinimumSize(1250, 900); // 窗口最小尺寸
this->setMaximumSize(1250, 900); // 窗口最大尺寸
... |
60c514e38e9a29a1ed1e8bb638de3560aa81065d | fc38de0e1b85597c01e35a280b92b891ffa0a9b3 | zhjwustc/cvpr17_iter_deblur_matcaffe | /include/caffe/layers/learncrf_layer.hpp | C++ | hpp | 1,516 | no_license |
/*
* Author: Liangji
* Email: liangji20040249@gmail.com
*/
#ifndef CAFFE_LEARNCRF_LAYER_HPP_
#define CAFFE_LEARNCRF_LAYER_HPP_
#include <vector>
#include "caffe/blob.hpp"
#include "caffe/layer.hpp"
#include "caffe/proto/caffe.pb.h"
namespace caffe {
template <typename Dtype>
class LearnCRFLayer : public Layer<Dt... |
e2aaf894484fce0ae7749ed5ee81a169fd7debcf | d5f1e3d9bf67a6d2f7db15bb57cc1c3c9f80b5a8 | Kanma/Athena-Graphics | /scripting/Athena-Graphics/Debug/AudioSource.cpp | C++ | cpp | 2,499 | permissive | #include <Athena-Graphics/Debug/AudioSource.h>
#include <Athena-Graphics/Scripting.h>
#include <Athena-Scripting/Utils.h>
#include <Athena-Scripting/ScriptingManager.h>
#include <v8.h>
using namespace Athena::Graphics::Debug;
using namespace Athena::Entities;
using namespace Athena::Scripting;
using namespace v8;
/*... |
39bd6efa7d8ab75174a52b0f3c838ae4dadb148c | 9b0b64ce6e21faab5a24b396fd9d4db665e3a080 | longfem/ACE-toolkit | /tests/Compiler_Features_26_Test.cpp | C++ | cpp | 1,939 | no_license | /**
* This program checks if the compiler doesn't have a certain bug
* that we encountered when testing C++11 features
*/
#include "test_config.h"
#if defined (ACE_HAS_CPP11)
#include <memory>
int
run_main (int, ACE_TCHAR *[])
{
ACE_START_TEST (ACE_TEXT("Compiler_Features_26_Test"));
int ret... |
066084d6ac9180d5fec9025504176499ca9d6c81 | fd2f4220b18f417732ba7285d2b461b547156a11 | tushitgarg/algorithmic-programming | /Code/WorkspaceB/C++_Files/CC/FIREESC.cpp | C++ | cpp | 1,214 | no_license | /*
input
3
4 2
1 2
2 3
5 3
1 2
2 3
1 3
6 3
1 2
3 4
5 6
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define MOD 1000000007
//Created by Shreyans Sheth [bholagabbar] using Sublime 3 and SublimeInput Plugin
int u[100001];
int r[100001];
int cal[100001];
inline void ur_in... |
ed63a94a5eec99bc338227f86312d8af36a220c8 | 566f3b8b6a370a70f3bc15d6c69a0918f2c4aa23 | aajjbb/contest-files | /Codeforces/NoRepetitions.cpp | C++ | cpp | 278 | permissive | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
int N;
Int P;
int main(void) {
scanf("%d", &N);
Int ans = 0;
for (int i = 0; i < N; i++) {
scanf("%I64d", &P);
ans ^= P;
}
printf("%I64d\n", ans);
return 0;
}
|
14c863195100714c880e8a4995d74213e6e9df43 | bfb0a1daacea300a9fe1b858dd27fe70e6f1a704 | AlexDmr/b207 | /Route 66/slimlib/slimcore/sources/slimsocket.cpp | C++ | cpp | 18,912 | no_license | #include "../includes/slimsocket.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#if defined(WIN32) || defined(_WIN32_WCE)
WSADATA WSAData;
bool winsock_initialised = false;
#endif
char *slimGetHostIp(const char *hostname)
{
struct hostent *phe;
char *ip;
#if defined(WIN32)... |
1fd1fe14d4a7e5635d22b9c4a726ac1e2f613961 | 6e4de5be698cbd9c9a5872d80e20dad25cbfd390 | miner34006/Feed-forward-neural-network | /src/training/digitRecognitionTraining.hpp | C++ | hpp | 723 | no_license | //
// Created by Богдан Полянок on 29.10.2017.
//
#ifndef COURSE_PROJECT_RECOGNITIONTRAINING_HPP
#define COURSE_PROJECT_RECOGNITIONTRAINING_HPP
#include "training.hpp"
class DigitRecognitionTraining: public Training{
public:
DigitRecognitionTraining(const std::shared_ptr<NeuralNetwork> &neuralNetwork,
... |
b45ace3d9934696f8c86ee1aa60c7da1750d01e5 | 46da66b6f41f2de584adfd793b8636bc9f765c2a | yoonBot/Computer-Science-and-Engineering | /C++ Primer Plus/Ch.3 - Dealing with Data/3.04_hexoct2.cpp | C++ | cpp | 614 | permissive | // hexoct2.cpp -- display values in hex and octal
// @reproduced by yoonBot
#include <iostream>
using namespace std;
int main()
{
using namespace std;
int chest = 42;
int waist = 42;
int inseam = 42;
cout << "Monsieur cuts a striking figure!" << endl;
cout << "chest = " << chest << " (decima... |
db4770d34b463ad2b2b7b906a4b2e552e3ae75d8 | f16d5a6b19837adc59ed32ed99ec0f4f04a23ce0 | annamuscarella/catDetection | /main.cpp | C++ | cpp | 6,412 | no_license | #include <iostream>
#include <opencv2/opencv.hpp>
#include "FaceDetector.h"
#include "CatDetector.h"
#include <opencv2/tracking.hpp>
#include <opencv2/core/ocl.hpp>
using namespace cv;
using namespace std;
FaceDetector faceDetector;
CatDetector catDetector;
bool display = true;
char* getCmdOption(char ** begin, cha... |
c71e3a05333d61576a8e251303db2a559f850b34 | 51dd59b5e254301cdc7e66a4487a238c62280ab2 | didrlgus/algorithm-practice | /baekjoon/17836.cpp | C++ | cpp | 2,359 | no_license | // 공주님을 구해라!
#include<bits/stdc++.h>
using namespace std;
const int INF=987654321;
int n,m,t,gram,arr[105][105],dy[]={0,0,1,-1},dx[]={1,-1,0,0},visited[105][105],visited2[105][105];
vector<int> wall;
queue<pair<int,int>> q,q2,q3;
int bfs1(int y,int x) {
visited[y][x]=1;
q.push({y,x});
while(!q.empty()) {
... |
104d6a2f8dcd84b682af8251520fa3d33010889e | 71db82120508d56cb754cc2bd5e75cfd37826b39 | jwuttke/daquiri-qpx | /tests/core/consumer.cpp | C++ | cpp | 2,094 | permissive | #include <gtest/gtest.h>
#include <core/consumer.h>
using namespace DAQuiri;
class MockConsumer : public Consumer
{
public:
MockConsumer() {}
MockConsumer* clone() const override { return new MockConsumer(*this); }
bool accept_events{false};
size_t accepted_spills{0};
size_t accepted_events{0}... |
a74ef184c1b867d46bc1a6d699af79d9a278386c | e6fbffe7611c4d7870c4441a53b252e7b7980085 | Joao-Luz/graduacao | /progcomp/aula2/request_for_proposal.cpp | C++ | cpp | 1,417 | no_license | #include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int main(){
int requirements, proposals;
scanf(" %d %d", &requirements, &proposals);
int rfp = 1;
while(requirements != 0 && proposals != 0){
double max_compliance = -1;
double min_price = -1;
strin... |
4b6f8944495a0ce3c799fe0bb30173887af39b6f | d516392d164e7f4a2fa479d4d9181317bf113f3e | HEARTS-brl/HEARTS-brl | /hearts_tools/src/lineransac.cpp | C++ | cpp | 3,807 | no_license | ///LINE FITTING USING RANSAC
#include "hearts_tools/lineransac.h"
//Random sampling n numbers out maxn
cv::Mat randomSample(int n, cv::Mat points)
{
cv::Mat sample;
std::vector<int> rand_x;
int x;
bool isReg;
int H = points.rows;
for(int i = 0; i < n; i++ )
{
do{
isReg = false;
x = rand() % H;
fo... |
28bfeae2344365d6f09ce853169a072953762b48 | fa2370817b18bfb79026c52a4bdad65db11e7c17 | killvxk/DLLDependencyViewer | /DLLDependencyViewer/DLLDependencyViewer/src/nogui/array_bool.cpp | C++ | cpp | 975 | no_license | #include "array_bool.h"
#include <climits>
int array_bool_space_needed(int const number_of_bools)
{
if(number_of_bools == 0)
{
return 0;
}
else
{
return ((number_of_bools - 1) / (static_cast<int>(sizeof(unsigned)) * CHAR_BIT)) + 1;
}
}
void array_bool_set(unsigned* const arr, int const id... |
1fa33932a8c5ee01f85816436db163e2b2e2906a | 0c2f91d90fd6592b0d80b37b41d4f7f7581ccde8 | lydia680/chromium | /chromeos/services/libassistant/conversation_controller.cc | C++ | cc | 14,744 | permissive | // Copyright 2020 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chromeos/services/libassistant/conversation_controller.h"
#include <memory>
#include "base/sequence_checker.h"
#include "base/strings/string_n... |
3c1d84231630d0b9837c6bc35c1beb6a2ce99523 | 3acdff906cd4720d858bd02e4bdb783500e8c01b | rusingineer/mpcbe-code | /src/apps/mplayerc/Misc.cpp | C++ | cpp | 11,690 | no_license | /*
* (C) 2016-2017 see Authors.txt
*
* This file is part of MPC-BE.
*
* MPC-BE is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later v... |
9f404f939a1aad661cd0792063ba2e215f822d30 | 5447b7c401ef5be90d13df13c0042624422787c9 | zhengyhn/leetcode | /out/production/leetcode/io/github/zhengyhn/leetcode/spiral_matrix_iii/spiral-matrix-iii.cpp | C++ | cpp | 1,611 | permissive | #include <iostream>
#include <vector>
#include <map>
using namespace std;
class Solution {
public:
vector<vector<int>> spiralMatrixIII(int R, int C, int r0, int c0) {
vector<vector<int>> ret;
int numVisit = 0;
int r = r0;
int c = c0;
vector<int> dirR = {0, 1, 0, -1};
vector<i... |
ceecbe228e173d11e8ad31ed1074e978d433ff64 | b86b911fd34a1f4ddae22cf4154e77a1b9a7cd9b | anhmt90/db-implementation | /task5/src/Schema.cpp | C++ | cpp | 1,782 | no_license | #include "Schema.hpp"
#include <sstream>
std::string type(const Attribute& attr) {
parserTypes::Tag type = attr.type;
switch(type) {
case parserTypes::Tag::Integer:
return "Integer";
case parserTypes::Tag::Numeric: {
std::stringstream ss;
ss << "Numeric(" << attr.len << "... |
42814ceb35a03db93e95c3b0a4a5977346708a38 | 6478259a3a57f761d0f2d686e3b2a4b2180dc8c0 | bruce3557/Uva-Online-Judge | /uva_516.cpp | C++ | cpp | 1,580 | no_license | #include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#define MAX (32767)
using std::vector;
int n;
int pcnt,prime[5000];
int cnt[5000];
bool notp[33000];
struct node {
int num, count;
node() {
count=0;
}
bool operator < (const node &t) const {
return num > t.num;... |
da60f2df95dd8806036006ca276aedacfcb644e3 | c7273ae4f1bdd639f4c82f1581229e272d622f98 | Lut1n/GeneticImgProc | /texture_operations/texture_mixing.hpp | C++ | hpp | 888 | permissive | #ifndef TEXTURE_MIXING_HPP
#define TEXTURE_MIXING_HPP
#include <SFML/Graphics.hpp>
// --------------------------------------------------------------------------
// Helper class - give functions for texture mixing
class TextureMixing
{
public:
TextureMixing();
virtual ~TextureMixing();
void initialize();
... |
a70571d96681618fc41ee13765e33e7ec1d505f2 | bd22abb698e60475816dd29e9d48c989e75eb691 | morgenthum/coldspot | /src/jvm/classfile/MethodInfo.hpp | C++ | hpp | 2,016 | no_license | ////////////////////////////////////////////////////////////////////////////////
// //
// ColdSpot, a Java virtual machine implementation. //
// Copyright (C) 2014, Mario Morgenthum ... |
42beaaebb60ffb09d6bb8bd78cbbd84d2863b851 | fdc2a9ddec0f4300f7510d61bd920776ffa797c5 | aris-koning/duckdb | /src/parser/transform/expression/transform_cast.cpp | C++ | cpp | 999 | permissive | #include "duckdb/common/limits.hpp"
#include "duckdb/parser/expression/cast_expression.hpp"
#include "duckdb/parser/expression/constant_expression.hpp"
#include "duckdb/parser/transformer.hpp"
using namespace duckdb;
using namespace std;
unique_ptr<ParsedExpression> Transformer::TransformTypeCast(PGTypeCast *root) {
... |
3611073d0c3678714ca257f1fabe0af9958f85f1 | 8633c770a8ab808b81f43ce43d44ce3fb5fa9d42 | wuhengzhi/chromium-crosswalk | /chrome/browser/android/chrome_feature_list.cc | C++ | cc | 3,172 | permissive | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/android/chrome_feature_list.h"
#include <stddef.h>
#include <string>
#include "base/android/jni_string.h"
#include "base/featu... |
b273ae25434e99d8decd4df6ae891527c9a7c5c8 | 1228bbfbefe915ad1309296693f3ff194993ad17 | ahmedtahami/OOPF20 | /Lab4/Q3/Source.cpp | C++ | cpp | 1,230 | no_license | #include<iostream>
#include "ComplexN.h"
#include "Employee.h"
#include "Car.h"
using namespace std;
int main()
{
char* car1Name = new char[5] {"Vitz"};
char* car1Manufacture = new char[7] {"Toyota"};
char* car1Color = new char[5] {"Blue"};
Car car1(car1Name, car1Manufacture, car1Color, 2008);
cout << "Before Chan... |
f08e43710ce8bab4f3694aa6cce116335fbf1c19 | a6dda8c534c5fa1b132a7f3e4ceb6d3b3f335882 | jontromanab/aikido | /include/aikido/rviz/InteractiveMarkerViewer.hpp | C++ | hpp | 2,089 | permissive | #ifndef AIKIDO_RVIZ_INTERACTIVEMARKERVIEWER_HPP_
#define AIKIDO_RVIZ_INTERACTIVEMARKERVIEWER_HPP_
#include <atomic>
#include <set>
#include <thread>
#include <dart/dynamics/Frame.hpp>
#include <dart/dynamics/SmartPointer.hpp>
#include <interactive_markers/interactive_marker_server.h>
#include <ros/ros.h>
#include <a... |
c2638668cad7212e6409298ec92106322d11ffe0 | eca3a91101f0e6577694f2ddd6b07e93a23af0f9 | Gmeaders/School-Projects | /212/Labs/Lab13/decode.cpp | C++ | cpp | 675 | no_license | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
struct Node {
char letter; // the character labeling the edge to this node's parent
int parent;
Node (char _letter, int _parent)
{
letter = _letter;
parent = _parent;
}
};
vector<Node> nodes;
void print(int number)
{
... |
5a94f2f656c8e213dc6bbdafcb727699f483e9e8 | 5e39f7cb2054d0a6e0bfca0ac18bd547ac0a3e53 | paduraru2009/river | /revtracer/revtracer.cpp | C++ | cpp | 12,398 | permissive | #include "revtracer.h"
#include "execenv.h"
#include "callgates.h"
#include <x86intrin.h>
//void InitSymbolicHandler(ExecutionEnvironment *pEnv);
//void *CreateSymbolicVariable(const char *name);
namespace rev {
/* Kernel32.dll replacements *********************************************************/
... |
36f7c0c3117935983be29110f5380e34ac28bf51 | 9c1acb2948944803ad4f370ef20c0ef53f6fd5da | cheateronly123/ftp_loader | /ftp_cheat/Hacks/Glow.cpp | C++ | cpp | 10,418 | no_license | #include <algorithm>
#include <array>
#include <memory>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#include "../nlohmann/json.hpp"
#include "../imgui/imgui.h"
#include "../ConfigStructs.h"
#include "../InputUtil.h"
#include "Glow.h"
#include "../Helpers.h"
#include "../Interfaces.... |
497b6e0adfe9c801ccfd5aea79d66dd848cfe48a | d00bb4c4a13dd5d0fafc521479c4b4be2391a826 | zeliard/aws-sdk-cpp | /aws-cpp-sdk-redshift/source/model/RevokeSnapshotAccessResult.cpp | C++ | cpp | 2,021 | permissive | /*
* Copyright 2010-2015 Amazon.com, Inc. 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.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file... |
a4a509a9d1f55eee3026db82c67c84a3cbd46ee0 | 93ae51f742b3a7073ed335f4e8a731df3e56f0f2 | wwlovepingping/__Git | /Windows/Game/DEMO_02_03/DEMO_02_03/WinMain.cpp | C++ | cpp | 2,149 | no_license | #define WIN32_LEAN_AND_MEAN // just say no to MFC
#include <windows.h>
#include <windowsx.h>
#include <stdio.h>
#include <math.h>
#define WINDOW_CLASS_NAME "WINCLASS1"
// 全局变量
HINSTANCE hInst;
// 函数声明
ATOM MyRegisterClass(HINSTANCE hInstance);
BOOL InitInstance(HINSTANCE hInstance, int nCmdShow);
LRESULT ... |
7c381d2c31ab5bb7b87157e726421f7992edc9d8 | 57344817f4a81ee29e245b55941f2289140f3532 | zanzo420/SoT-SDK-CG | /Internal/SDK/BP_FishingFish_AncientScale_03_Colour_01_Almond_functions.cpp | C++ | cpp | 1,053 | no_license | // Name: Sea of Thieves, Version: 2.2.0.2
#include "../pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//-----------------------------------------... |
b573db79c2688eb28c9f4329ff8827ce2a10d4d5 | e572c1ffe355271131145d78e203924f1e1f53b3 | praveendareddy21/CSCI-580-AI-Robot-Localization-Hidden-Markov-Model- | /robot.cpp | C++ | cpp | 7,291 | no_license | /*
* robot.cpp
*
* Created on: Oct 5, 2016
* Author: Praveen
*/
#include"robot.h"
#include <bitset>
#include<iostream>
#include<exception>
#include<sstream>
#include<math.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<stdlib.h>
using namespace std;
/********************... |
fa9b733aff6e78dcb03a56de7274075f828ed9f0 | 5c2d5cb5ae3ae21263a55f1125f283ca11ee2bde | ChenPaulYu/APCS | /0719/4.3.cpp | C++ | cpp | 242 | no_license |
#include<iostream>
using namespace std;
int main()
{
int y;
while(cin>>y){
if(((y%4==0)and(y%100!=0))||y%400==0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
return 0;
}
|
e67555a092209f0c100b5e8c2323b77272572745 | fe0f92402d36be5c06e32a7a9218abe8311140fb | mynew3/wotlk-core-1 | /src/scripts/Kalimdor/zone_silithus.cpp | C++ | cpp | 56,050 | no_license | /*
* Copyright (C) 2014-2017 SWPCore <http://www.wowswp.com/>
* Copyright (C) 2008-2017 TrinityCore <http://www.trinitycore.org/>
* Copyright (C) 2005-2009 MaNGOS <http://getmangos.com/>
*/
/* ScriptData
SDName: Silithus
SD%Complete: 100
SDComment: Quest support: 8304, 8507.
SDCategory: Silithus
EndScriptData */
... |
b4e1fe2a119ceb3d5c4610b217f824532bdc4054 | 9543843c2577baf862392ea7e3e6227487f6c5df | cxzhangqi/UnderSeaModelingLibrary | /sensors/orientation_HLA.cc | C++ | cc | 747 | permissive | /**
* @file orientation_HLA.cc
*/
#include <usml/sensors/orientation_HLA.h>
using namespace usml::sensors ;
/**
* Empty constructor
*/
orientation_HLA::orientation_HLA()
: orientation()
{
}
/**
* Constructor
*/
orientation_HLA::orientation_HLA(
double heading, double pitch, double roll )
: orient... |
547a5943ddcc0ea3e799393df08563b750a5fafa | 7f047340ec0fe0aab73c42af312cb4753c755412 | pragya-chauhan/dsa | /DSA/Graphs/CheckForBipartiteness.cpp | C++ | cpp | 1,342 | permissive | class Solution {
public:
// vector<int> getIntialColoring(vector<vector<int>>& graph) {
// int n = graph.length()
// vector<int> coloring(n);
// for(int i=0; i<n; i++) {
// coloring[i] = 0;
// }
// }
int oppositeColor(int Prevnode, vector<int> coloring) {
return coloring[Prevnode] == 1 ? 2 : 1;
}
... |
41fe3bce567023d67441ca83e0da21c4bd418a3e | 1148f1f37f028a45e84e8f542704e03c00df2746 | zeroIndex0/BitmapFractalGenerator | /ZoomList.cpp | C++ | cpp | 783 | no_license | //
//
//
// ZoomList.cpp
// Notes: x
#include "ZoomList.h"
namespace fractal {
ZoomList::ZoomList(int width, int height) : m_width(width), m_height(height) {
}
void ZoomList::add(const Zoom &zoom) {
zooms.push_back(zoom);
m_xCenter += (zoom.x - m_width / 2) * m_scale;
m_yCe... |
3776c505cdeb88c6af09124a3fe7fe2d35d3dcb4 | 4737491127d753181a21d99c7a25b925af6bac28 | alexandraback/datacollection | /solutions_5648941810974720_1/C++/xfighter/A.cpp | C++ | cpp | 1,383 | no_license | #include <cassert>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
class Solver {
public:
void Solve() {
vector<pair<string, int>> order = {
{"ZERO", 0},
{"TWO", 2},
{"FOUR", 4},... |
d2c2c4345474a11acf68d8bb9accdc7c896c1960 | f13569d49c3997e973a833be87b0bfcd69627576 | hieu-ln/IT81-03 | /Code C6/BacGiang_C6_Bai5.cpp | C++ | cpp | 3,297 | no_license | #include <iostream>
#include <stdio.h>
#include <fstream>
#include <sstream>
#include <iomanip>
using namespace std;
//Khai bao ma tran
#define MAX 20
int a[MAX][MAX];
int n;
char vertex[MAX];
void initGraph()
{
n = 0;
}
void inputGraphFromText()
{
string line;
ifstream myfile("matrantrongso1.txt");
if(myfile.is... |
4f23739ad9f5b5f5035893287b87acbfd730fc45 | 046dcb7f8c2ad2f78652ba0c153e0afdd0c7b5c7 | xiaoshui208/WaykiChain-1 | /src/rpc/rpctx.cpp | C++ | cpp | 133,709 | permissive | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2017-2018 WaykiChain Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php
#include "txdb.h"
#include "base58.h"
#include "rpcserver.h"
#include "init.h"
#include ... |
20351246bc78bd6b23a0a225ad7c468f7c647ce1 | 3524b0b3a3292a2a8e296cc85ef88ab0b4334dd6 | RomMarie/open_rm | /src/Geometrie/distances.cpp | C++ | cpp | 706 | no_license | #include <open_rm/Geometrie/distances.h>
namespace rm{
namespace Geometrie{
namespace Distances{
cv::Point2d defaultProjection;
/*!
* \brief Détermine la distance entre un point et un segment
* \param p Point quelconque du plan
* \param p1 Première extrémité du segment
* \param p2 Seconde extrémité du segment
* \... |
a49ccbc74aec6c0a158409a0dc3216b7779470db | 9817116e0e252b1e5ab11b5b30c44cad156e93a2 | gaojun0816/native_disclosure_bm5 | /app/src/main/cpp/native-lib.cpp | C++ | cpp | 2,199 | no_license | #include <jni.h>
#include <string>
#include "registration.h"
extern "C" JNIEXPORT jstring JNICALL
Java_lu_uni_jungao_bm5_NativeDelegator_sStringFromJNI(
JNIEnv *env,
jclass /* cls */) {
std::string hello = "Hello from C++ static method";
return env->NewStringUTF(hello.c_str());
}
extern "C" JN... |
0225536b7580dfc28c14c54dc0f74951156f3aef | 19d813a0b6b453965fa0e046a8b4e4fce27c46d8 | grodansparadis/vscpl1drv-xap | /common/xapobj.cpp | C++ | cpp | 39,337 | permissive | // xapobj.cpp:
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version
// 2 of the License, or (at your option) any later version.
//
// This file is part of the VSCP (http://www.vs... |
d4e9712f401a8ce6236483e8f2045bdea68bdfd4 | 1f5133b630764195a69ec3fed66f23eca636a91a | gahansen/Albany | /src/InitialCondition.cpp | C++ | cpp | 11,392 | permissive | //*****************************************************************//
// Albany 3.0: Copyright 2016 Sandia Corporation //
// This Software is released under the BSD license detailed //
// in the file "license.txt" in the top-level Albany directory //
//**************************************... |
93d4e3e6b27cbcbd0c039b780350edb989b1f537 | 65c74fe73ca44d5d5faf4d2a722ae1c2f7b8141f | DarkCodez/TCF-SDK | /SDK/TCF_ST_EffortDataTableRow_classes.hpp | C++ | hpp | 207 | no_license | #pragma once
// The Cycle Frontier (1.X) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "TCF_ST_EffortDataTableRow_structs.hpp"
namespace SDK
{
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.