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 |
|---|---|---|---|---|---|---|---|---|
cc32279b68a3aae0ad5c812e6735dc0791e7d86b | 1fea03b8bdcf1cab50f141428098665ee133efb1 | FIBOSIO/fibjs_vender | /v8/src/builtins/builtins-object-gen.cc | C++ | cc | 52,579 | no_license | // Copyright 2017 the V8 project 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 "src/builtins/builtins-utils-gen.h"
#include "src/builtins/builtins.h"
#include "src/code-stub-assembler.h"
#include "src/factory-inl.h"
#inclu... |
d51ebf9f60e431b5e2740ccfeacd2315e170ea15 | 67760df2eb0a1c5ec519b9d448acf20ec9e42ac5 | nickwn/TeamBlueCV | /src/main1.cpp | C++ | cpp | 7,513 | no_license | #include <opencv2/opencv.hpp>
#include <iostream>
#include <memory>
#include <climits>
#include "GUIManager.hpp"
#include "NetworkController.hpp"
#include "CmdLineInterface.hpp"
#include "TargetProcessor.hpp"
#include "TargetDetector.hpp"
#include "Target.hpp"
#define EPSILON 5 // Minimum error value
#define CAM_ANGL... |
17a36c88dce20bad9c5667fd89dcf890019a8b00 | 244e4e7d929a4df9430d9199fa75e0bf844f44cb | jtlap/nt2 | /modules/test/benchmark/include/nt2/sdk/bench/metric/gb_per_second.hpp | C++ | hpp | 2,090 | permissive | //==============================================================================
// Copyright 2009 - 2013 LRI UMR 8623 CNRS/Univ Paris Sud XI
// Copyright 2012 - 2014 MetaScale SAS
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICEN... |
812d9b1508b5394b51791d9f33d2960d4c2a62e3 | 98f18f623e0aef8c279d02d93ea3cf2d8aec79c1 | Bhawana15/Data-Structures-in-C-Cpp | /queue/queue_using_SLL.cpp | C++ | cpp | 1,536 | no_license | // QUEUE REPRESENTATION USING A SINGLY LINKED LIST - CREATION, INSERTION AND DELETION
#include <bits/stdc++.h>
using namespace std;
typedef struct Node {
int data;
struct Node* next;
Node (int x) {
data = x;
next = NULL;
}
} node;
class Queue {
public :
node *front, *rear;
Queue () {
... |
61bb2c8a52a75a56b016646fa80930ae39f34376 | 0135d64dcc95f0b354e25e08063c9efd95cdc3cb | GuodongQi/LeetCode | /by_tags/排序/7_Sort_Colors.cpp | C++ | cpp | 331 | no_license | class Solution {
public:
void sortColors(vector<int>& A) {
int red = 0, blue = A.size()-1;
for(int i =0; i<blue + 1;){
if(A[i] == 0)
swap(A[i++], A[red++]);
else if(A[i]==2)
swap(A[i], A[blue--]);
else
i++;
... |
95e81f18d67986e15af545a3829df59e461ebb4f | db8175ce0650d9230a6f9a82f0de76eac7d31936 | genix-project/genix | /src/llmq/quorums_utils.cpp | C++ | cpp | 4,096 | permissive | // Copyright (c) 2018-2019 The Genix Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "quorums.h"
#include "quorums_utils.h"
#include "chainparams.h"
#include "random.h"
#include "validation.h"
namespac... |
aa37d5e848aec2a315e9654b9f14eadd216e8a04 | dd00175ce86e693f22ce3d90fb337396784ba34d | livpz/C-Practice | /TPoint.cpp | C++ | cpp | 2,540 | no_license | #include<iostream>
#include<TPoint.h>
#include<Tball.h>
#include<string>
using namespace std;
int main(void)
{
cout << "YNWA!" << endl<<endl;
cout << "At first,we'll test the function of TPoint:";
TPoint<double> p1; //无参构造不需要（）
TPoint<double> p2(5, 6, 7); //点构造函数调试
cout << "This is the Tpoint p1:" <... |
48dc46cb2d0b5058364f09fe4be62e1b14edbbc1 | eb398952d8a692c7493d0a2f7f33992b7be24ec4 | cpvrlab/SLProject | /apps/app_demo_slproject/glfw/AppDemoMainGLFW.cpp | C++ | cpp | 22,105 | no_license | //#############################################################################
// File: AppDemoMainGLFW.cpp
// Purpose: The demo application demonstrates most features of the SLProject
// framework. Implementation of the GUI with the GLFW3 framework
// that can create a window and rece... |
0156284087f4ff502ab992128a562d44dd8a6e1d | d02654c5314a8a1b885c855d741564f9a4b0770d | aldhinya/Struktur-Data | /LinkedList/Single Linked List/Tambah Belakang.cpp | C++ | cpp | 1,171 | permissive | #include <iostream>
#include <stdio.h>
using namespace std;
struct nama_struct {
int data;
nama_struct *next;
};
nama_struct *node, *head = NULL, *tail = NULL;
main () {
bool exit = false;
int chooseMenu;
do{
printf("MENU\n1. Tambah Belakang\n2. Lihat\n3. Exit\nPILIH : "); cin >> chooseM... |
868b2573845e6e9bb986c3854bc16bc18abb7d4f | d82a71abae0dcf05cf3efb7a74cd7245a0300218 | linkfqy/OJ_code_backup | /HDU/1392.cpp | C++ | cpp | 1,187 | no_license | #include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const double eps=1e-7;
const int maxn=105;
int n;
struct point{
double x,y;
point() {}
point(double a,double b):x(a),y(b) {}
bool operator<(const point&b)const{
if (x<b.x) return 1;
if (x>b.x) return 0;
return y<b.y;
}
point operator-... |
615cbe245c343083283a632db8e5a937e69095b9 | cab198735387db3ccd7c9c2d8c397d155ca34e7b | TrellixVulnTeam/Chromium_7C66 | /mojo/public/cpp/bindings/tests/request_response_unittest.cc | C++ | cc | 4,404 | 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 <stdint.h>
#include <utility>
#include "base/message_loop/message_loop.h"
#include "base/run_loop.h"
#include "mojo/public/cpp/bindings... |
73ed32f50f25f76377e6a46645effa39b03565d6 | 4401ac4d605e2ab8967db8250cb00e47324825c2 | CaoZhongZ/oneDNN | /src/cpu/x64/jit_uni_batch_normalization.cpp | C++ | cpp | 84,548 | permissive | /*******************************************************************************
* Copyright 2017-2021 Intel Corporation
*
* 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.apa... |
0fac0fde95d23d0ae50288410af2375832adfacd | 12309235faf4bac74d811d4b1f54927b68b3fd5e | sfbeyond/frog-fu-youvisio | /FrogFu/FrogFu/Classes/Animations/MuteMusic.hpp | C++ | hpp | 828 | permissive | //
// MuteMusic.hpp
// FrogFu
//
// Created by Vladimir Bodurov on 12-12-25.
// Copyright (c) 2012 Vladimir Bodurov. All rights reserved.
//
#ifndef FrogFu_MuteMusic_hpp
#define FrogFu_MuteMusic_hpp
#import "Factory.hpp"
#import "BaseAnimation.hpp"
#import "Interfaces.hpp"
class MuteMusic : public BaseAnimation{... |
70703656797337851cbf3d608601c747e05d269f | 4423250c845175b071627d2f9036d45af2bf2b1a | Lanxin123/offer | /05从尾到头打印链表/STL_Solution.cpp | C++ | cpp | 363 | no_license | #include "stdafx.h"
#include <iostream>
#include<list>
#include <algorithm>
using namespace std;
void PrintList(int num)
{
cout << num<<" ";
}
int main()
{
list<int> Positive{ 2,5,8,10,11,13 };
reverse(Positive.begin(), Positive.end());
for_each(Positive.begin(), Positive.end(), PrintList);
}
//此方法纯属投机取巧，面试都怕... |
2533184e09076d9e87f3c723a5f31492b9e0cf0b | 7a56c16c3fbce8e5a4f7786877371011f430c3c5 | xibeilang524/PSM | /WFTTNN/WFTTNN/CoolTabCtrl.cpp | C++ | cpp | 13,421 | no_license | ////////////////////////////////////////////////////////////////
// CoolTabCtrl.cpp : implementation file //
// //
// Copyright 2001 WangJun //
// All Rights Reserved. //
// //
// Email: wangjun98@sohu.com //
// URL: www.vckbase.com ... |
11e6a796cbfb6ad51750f952a52f5ba00734ee68 | b69fcf2a5a13fedede5e0bd3f2a8c974d78a1a64 | artbez/origin | /1 семестр/HW2/task3/task3.cpp | C++ | cpp | 785 | no_license | #include <stdio.h>
#include <string.h>
void partition(int number, int max, char str[]);
int main()
{
int number = 0;
printf("Enter a number\n");
scanf("%d", &number);
const int size = 1000;
for (int i = 1; i <= number; ++i)
{
char str[size] = "";
partition(number, i, str);
... |
05d7d9875aee6c5ff939ce1dd3c453e6df9bc4ee | 66d24326d82cffdd33086e04dfb1864ad22aa0fc | BearIvan/Stalker | /stalkercop/source/UI_IB_Static.cpp | C++ | cpp | 617 | no_license | // File: UI_IB_Static.h
// Description: Inheritance of UIInteractiveBackground template class with some
// CUIStatic features
// Created: 09.02.2005
// Author: Serge Vynnychenko
// Mail: narrator@gsc-game.kiev.ua
// Copyright 2005 GSC Game World
#include "StdAfx.h"
#include "ui\\ui_IB_Static.h"
void CUI_IB_St... |
43e70dba7de22a1c6e58bdadd9d0a35695603476 | 5bfa2df4b4878aeb9d3c2a8446125e064c369e0f | Sonu08-Sto/Data-Structure-Algorithms | /count_ninarysecrh.cpp | C++ | cpp | 601 | no_license | #include<iostream>
using namespace std;
int getcount(int arr[],int N)
{
int low=0;
int high=N-1;
while(low<=high)
{
int mid=(low+high)/2;
if(arr[mid]==1 && arr[mid+1]==1 && mid +1 <N)
{
low =mid+1;
}
else if(arr[mid]==0)
{
... |
2dbf11550bb7073c3eeb8df0b3ed82b8917d5386 | 0a90d414a1f0228659f9c20d6dd6b3d1f86fff5e | jarmovh/naali | /UiModule/Ether/View/ControlProxyWidget.cpp | C++ | cpp | 26,297 | permissive | // For conditions of distribution and use, see copyright notice in license.txt
#include "StableHeaders.h"
#include "DebugOperatorNew.h"
#include "ControlProxyWidget.h"
#include "Ether/View/InfoCard.h"
#include "Ether/View/ActionProxyWidget.h"
#include <QGraphicsDropShadowEffect>
#include <QGraphicsSceneMouseEvent>
#i... |
a7dff43abdd2614db481e209af1427c0738c6b94 | eb308a8c0503dca1b9fb1964c4e731d176c3276d | amitkumaar/osv | /bsd/sys/netinet/tcp_output.cc | C++ | cc | 44,535 | permissive | /*-
* Copyright (c) 1982, 1986, 1988, 1990, 1993, 1995
* The Regents of the University of California. 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 mu... |
ce0810606d8754699ca6b84e12eeedd89830b802 | 86a292ec8f71657255879efd34dfdeacefbe6013 | strangeroad/internship-2014 | /src/cgi/txproj_list.cpp | C++ | cpp | 2,350 | no_license | /*
* =====================================================================================
*
*
* Filename: txproj_list.cpp
*
* Description: 返回json
*
* Version: 1.0
* Created: 2014年08月17日 10时53分30秒
* Revision: none
* Compiler: gcc
*
* Author: pythonwood (wws... |
749c75f797fa12eea6ff12c7ad88508ba07afaed | c7b463b5455ad3b1ea575b4188aca4555b41f1dd | p4j4dyxcry/TsFramework | /TSFrameWork/TSFrameWork/Source/TsUT/TsTimer.cpp | C++ | cpp | 909 | no_license | #include "TsUT.h"
using namespace std::chrono;
template < typename T>
TsF64 TsTimer::Elpased()const
{
auto d = std::chrono::system_clock::now() - m_startTime;
return (TsF64)duration_cast<T>(d).count();
};
TsF64 TsTimer::ElpasedSeccond()const
{
return Elpased<seconds>();
}
TsF64 TsTimer::ElpasedmSecond()... |
c508a7d126ecf14f7bf3995f9509ccc8e4ebf102 | f8baab164a30b20bdede418f15d9a85754d69502 | sudarshanpsl/llvm-project | /lldb/source/Plugins/Platform/Android/AdbClient.cpp | C++ | cpp | 19,671 | permissive | //===-- AdbClient.cpp -------------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
fec78e3b767a9cbf38c0e729277ee5b892cfd45a | c2fab3988bf909e3c5f76622daa99a2fcf611535 | hussien/marius | /src/cpp/python_bindings/model_wrap.cpp | C++ | cpp | 472 | permissive | //
// Created by Jason Mohoney on 3/23/21.
//
#include <pybind11/pybind11.h>
#include <pybind11/stl.h>
#include "model.h"
namespace py = pybind11;
void init_model(py::module &m) {
py::class_<Model>(m, "Model")
.def(py::init<Encoder *, Decoder *>(), py::arg("encoder"), py::arg("decoder"))
.def("t... |
ce7a3a0595ed4883d25ab2973f2fe598f5296ae6 | d8b13864f2e5ccde516c2be3ea530dbfcfc92be0 | gfdac/AudioTK | /ATK/Special/ConvolutionFilter.cpp | C++ | cpp | 5,491 | permissive | /**
* \file ConvolutionFilter.cpp
*/
#include <ATK/Special/ConvolutionFilter.h>
#include <cassert>
#include <algorithm>
namespace ATK
{
template <typename DataType>
ConvolutionFilter<DataType>::ConvolutionFilter()
:Parent(1, 1)
{
}
template<typename DataType_>
void ConvolutionFilter<DataType_>::se... |
9b8dafda08ca0b0d4ea0b6a88feee443eb9bab2b | 69a0c3cfc51ec59bde00dd333cebc17633e5557e | SteffenPL/limpEngine | /LuaInterface-1.0/include/luaFunctions.hpp | C++ | hpp | 6,176 | no_license | #ifndef LUA_FUNCTIONS_HPP
#define LUA_FUNCTIONS_HPP
#include "lua.hpp"
#include "luaStack.hpp"
#include "luaTypes.hpp"
using LuaCFunction = int (*)(lua_State*);
#define LuaMethod(T , R_Args , Function ) LuaFunctionHelper<T,R_Args>::LuaCFunction< &T::Function >
#define LuaStaticFunction( R_Args , Functio... |
85af74e754d04aa156b454a2755ff9b00a875e53 | 78e63e04a9012d40d16f213b791ce83f2e1a72b2 | FutureInfinity/Darkness | /darkness-engine/src/engine/graphics/Queue.cpp | C++ | cpp | 6,306 | permissive | #include "engine/graphics/Queue.h"
#include "engine/graphics/Common.h"
#include "engine/graphics/Barrier.h"
#include "engine/graphics/Device.h"
#include "engine/graphics/SwapChain.h"
#include "engine/graphics/CommandList.h"
#include "engine/graphics/Resources.h"
#if defined(_WIN32) && !defined(VULKAN)
#include "engine... |
27ec093c0dbcfeebf4956b3d2cc2053a4c33a33e | 444a449b10ae7ddcc30669f5311c2e18ee1af450 | AngryConst/SyncList | /src/tsettingswindow.cpp | C++ | cpp | 20,443 | no_license | #include "tsettingswindow.h"
#include "ui_tsettingswindow.h"
#include "tlog.h"
#include "logcategories.h"
#include <QElapsedTimer>
#include <QtConcurrent/QtConcurrent>
#include <QFileDialog>
//#include <QtAlgorithms>
#include <QInputDialog>
#include <QMessageBox>
#include <QRegExpValidator>
//************************... |
0b85bb12d27fa53963cfdd003df882065903730b | ee2e83087bd285bacc3c449c694429c93be10aa6 | zanzo420/Sea-Of-Thieves-SDK | /SDK/BP_FishingFish_Islehopper_03_Colour_05_Amethyst_functions.cpp | C++ | cpp | 1,300 | permissive | // Name: SeaOfThieves, Version: 2.0.23
#include "../pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//--------------------------------------------... |
9ec2703a75a5d8556ce48f41189dfbecd72d98f3 | a41d64722d093bc7f00a7e8c30bd2d7f64ef46f4 | Twinparadox/AlgorithmProblem | /Baekjoon/11501.cpp | C++ | cpp | 858 | permissive | // 모든 기간의 가격을 알고 있음
// 특정 구간에서의 등락에 대해서도 사고 파는 작업을 진행해야 함
// 뒤에서부터 지역의 최댓값을 갱신해나가면서 진행하면 됨
// 최대치에서 감소하는 구간이 나타날 떄마다, 이익에 (최대주가 - 해당 시점 주가)를 더해주면 최적의 답
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
int N, T;
cin >> T;
while (... |
f6c82724c9e4d3f62b2c871a1f89235ddbf80428 | 2e2663dd11182d20216e8a47e80a54decb7725ae | vmartinez40/school | /211/lab13_lookup/lookup.cpp | C++ | cpp | 1,231 | no_license | #include"location.h"
#include<vector>
#include<iostream>
#include<map>
#include<string>
using namespace std;
int main()
{
map < string, Location * > my_map;
vector < string > place_holder;
Location *location;
double latitude;
double longitude;
string place;
while (cin >> latitude)
{
... |
94361d0b96b598380df8f2dec4a285438e8161bc | 8d6494adca1b0eff8f6b4a0d2d355d0120c890ad | husixu1/LC | /114_M_Flatten_Binary_Tree_to_Linked_List.cpp | C++ | cpp | 968 | no_license | #include <iostream>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
void flatten(TreeNode* root) {
if(!root)
return;
helper(root);
}
TreeNode *help... |
bea4eeca50d8e21e004a26e61c59af6ea3c400a9 | a01ce7ff820b644b716c2158c3360bf411d43e44 | callumjago/COP3503-Term-Project | /src/battleship_sim.cpp | C++ | cpp | 5,665 | no_license | #include "../include/board.h"
#include "../include/ship.h"
#include "../include/user.h"
#include "../include/display.h"
#include "../include/turn.h"
#include <unistd.h>
int main(int argc, char *argv[1]){
//Creates a user_one to play the game
User user_one = User();
//User user_two = User();
//Creates a Turn objec... |
8c4f530027f79bf807b5fdd998bf484589b02ad4 | 68599fa00d7055395ea0def483c1fc81c03da14f | jigneshBadrakhiya/framelesshelper | /examples/Win32Demo/widget.cpp | C++ | cpp | 25,089 | permissive | /*
* MIT License
*
* Copyright (C) 2020 by wangwenx190 (Yuhang Zhao)
*
* 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
* t... |
95ecdab4d9a0ab3a52ce4f7e3cf951144131b620 | 47b59cf0de2f49cddfe33f4f11e3f1c45b50bcd2 | swaphack/CodeLib | /Foundation/Math/Basic/Collection/Node.cpp | C++ | cpp | 243 | no_license | #include "Node.h"
using namespace math;
Node::Node()
{
}
Node::~Node()
{
}
Node& Node::operator=(const Node& node)
{
this->setName(node.getName());
this->setUserData(node.getUserData());
this->setTag(node.getTag());
return *this;
}
|
b97b92c6086bbb9e833cbd37c84b4f1dd8db1b27 | 4c7c745994262b6e2602a5f46b52429e80dbc511 | tabris233/template | /Math/inverse.cc | C++ | cc | 535 | no_license | 1.exgcd
void exgcd(int a,int b,int &d,int &x,int &y){
if(b==0) {
x = 1,y = 0,d=a;
return ;
}
exgcd(b,a%b,d,x,y);
int t = x;
x = y;
y = t - ( a / b ) * y;
return ;
}
int inv(int a){
int x,y,d;
exgcd(a,MOD,d,x,y);
if(d==1) return (x%MOD+MOD)%MOD; //返回最小正整数解
r... |
aca1849b29046492033a3db555906c96ef7e63fe | 88f0baabd506c8b74cb98ac89909dc69aea1c7c3 | marco-c/gecko-dev-wordified-and-comments-removed | /third_party/aom/common/webmdec.cc | C++ | cc | 6,758 | permissive | #
include
"
common
/
webmdec
.
h
"
#
include
<
cassert
>
#
include
<
cstring
>
#
include
<
cstdio
>
#
include
"
third_party
/
libwebm
/
mkvparser
/
mkvparser
.
h
"
#
include
"
third_party
/
libwebm
/
mkvparser
/
mkvreader
.
h
"
namespace
{
void
reset
(
struct
WebmInputContext
*
const
webm_ctx
)
{
if
(
webm_ctx
-
>
read... |
24480daeda4d6cdd1125c74bd3c89caeaa0df0dc | 84e5cfca7b392cd1639a4592ac0f76c20f7ac309 | mkrivos/poco | /Data/MySQL/src/Utility.cpp | C++ | cpp | 1,109 | permissive | //
// Utility.cpp
//
// Library: Data/MySQL
// Package: MySQL
// Module: Utility
//
// Implementation of Utility
//
// Copyright (c) 2006, Applied Informatics Software Engineering GmbH.
// and Contributors.
//
// SPDX-License-Identifier: BSL-1.0
//
#include "Poco/Data/MySQL/Utility.h"
#include <mysql/mysql.h>
name... |
397ce9d7cb9f0d74753b3a55fd5481950c3c97f0 | 1e8137e9274db5664092651507460ea731351084 | sum-catnip/smoll-pattern-scanner | /smollpt.cpp | C++ | cpp | 4,439 | no_license | #include <Windows.h>
#include <iostream>
#include <iterator>
#include <sstream>
#include <cstddef>
#include <vector>
enum class byte_type { value, wildcard };
struct pattern_byte {
pattern_byte(byte_type _type, std::byte _byte = (std::byte)0) : type(_type), byte(_byte) {}
pattern_byte(byte_type _type, std::string... |
144077bac0de3966b0d800710cf93783cfb979f5 | 3d284d2b7e2289408d2e3a54756b013af4529956 | SheripallyChandana/MissionRnD-C-LinkedLists-Worksheet | /src/012sllSort.cpp | C++ | cpp | 907 | 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.
INPUTS: SLL head pointer
OUTPUT: Sorted SLL ,Head should Finally point to an sll of sorted 0,1,2
ERROR CASES:
NOTES: Only 0,1,2, will be in sll nodes
*/
#include <stdio.h>
#include <m... |
2a23f5bec79a6ca1fd596e84aff4be095d7a94e1 | 334d27fea8878bf68947ecfd9925863364fa52e8 | naturalatlas/node-gdal | /deps/libgdal/gdal/ogr/ogrsf_frmts/htf/ogrhtflayer.cpp | C++ | cpp | 23,102 | permissive | /******************************************************************************
*
* Project: HTF Translator
* Purpose: Implements OGRHTFLayer class.
* Author: Even Rouault, <even dot rouault at mines dash paris dot org>
*
******************************************************************************
* Copyri... |
05e1ad9a237af9909e1f03793ffdeabbfa99884c | 2bf6258120aa97f8f2bb5956947bf3f6005a0b29 | WongHozy/Kraken_Test | /Encrypt_Decrypt/Make_AES_SO/PKCSNPadding.cpp | C++ | cpp | 1,447 | no_license | #include "PKCSNPadding.h"
void pkcs5Padding_encode(char* szDataIn, size_t strLen, int block_num, int block_size)
{
int padding = block_size - (strLen % block_size);
if (padding == 0)
{
padding == block_size;
}
for (size_t i = 0; i < padding; i++)
{
szDataIn[strLen + i] = padding;
}
szDataIn[strLen + padd... |
fdcd4c3256d97795616d229a7e815ae9fe66d6fd | d955ec1f085854630ea7269e1b9f0747ae292b0a | TsungHuaLee/HW_581 | /freshman/midterm1/binary conversion.cpp | C++ | cpp | 615 | permissive | #include<iostream>
#include <string>
#include <bitset>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
unsigned long long int N;
while(cin>>N)
{
if(N==0)
break;
unsigned long long int sum=0,i;
for(i=0;i<N;i++)
{
string binary;
... |
26ce1085e6d95a39f6eb146df97f2c853401b61b | db9b89e4cb8558e1d635fafb81a4abde65bd929b | mitkatch/BPE | /pagebuilder/PageArrayConverter.cpp | C++ | cpp | 4,263 | no_license |
/************************************************************************
||
|| DATE: $Date: 2006/04/06 17:57:30 $
|| SOURCE: $Source: /repository/projects/Canpx/pagebuilder/PageArrayConverter.cpp,v $
|| STATE: $State: Exp $
|| ID: $Id: PageArrayConverter.cpp,... |
2cf3310b6e96f3450109b9a42e431bc2574a8ee5 | 261dee6f032b4e41e657f85758d9c8690edbb008 | vipulkumbhar/openpilot | /selfdrive/ui/android_ui.cc | C++ | cc | 7,709 | permissive | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <sys/resource.h>
#include "common/util.h"
#include "common/utilpp.h"
#include "common/params.h"
#include "common/touch.h"
#include "common/timing.h"
#include "common/swaglog.h"
#include "ui.hpp"
#include "paint.hpp"
// Includes for light sensor
#inclu... |
a3d492b1ba777e63270c4e39a0a3d9c88bbe07f1 | 2d4fc6f6d7c8f6f5b190f182e3632c8684ba9c1f | haseebshaik00/Electricity-Supply-Management-System | /sourcecode(1).cpp | C++ | cpp | 41,648 | no_license | #include<fstream>
#include<iostream>
#include<conio.h>
#include<stdio.h>
#include<windows.h>
#include<string.h>
#include<ctype.h>
using namespace std;
void gotoxy(int x, int y)
{
COORD ord;
ord.X = x;
ord.Y = y;
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), ord);
}
void loading(... |
bc55c178b9590766114fe9d75f2ee1e033f25897 | c0ba3d38bfb491fa266a1162dd82de418657980f | graft-community/GraftNetwork | /tests/unit_tests/thread_group.cpp | C++ | cpp | 5,438 | permissive | // Copyright (c) 2014-2017, The Monero Project
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are
// permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
/... |
f9c4dd806ba36212024ebf0aca3d96e4456cd118 | 731e20df3506b5c2c27e72b6b1da7fdd4decfbf1 | Dushistov/flapigen-rs | /macroslib/tests/expectations/callback_with_several_traits.cpp | C++ | cpp | 395 | permissive | "static void f(std::unique_ptr<MyObserver> a0) noexcept;";
r#"template<bool OWN_DATA>
inline void TestWrapper<OWN_DATA>::f(std::unique_ptr<MyObserver> a0) noexcept
{
C_MyObserver tmp = MyObserver::to_c_interface(std::move(a0));
const struct C_MyObserver * const a00 = &tmp;
Test_f(std::... |
8f1bb0b4cda4bc530d9deb8a9a93be0c22910bf1 | 7d5411e3bc70e04a98ecbf9df79e4b243ede762f | huningxin/chromium-src | /chrome/browser/ui/views/omnibox/omnibox_match_cell_view.cc | C++ | cc | 18,127 | permissive | // Copyright (c) 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/views/omnibox/omnibox_match_cell_view.h"
#include <algorithm>
#include "base/macros.h"
#include "base/metrics/field_tria... |
af33cc0d2510846037b3dcb818364243659bfc22 | 8e489ffaff4ad67e017a0bd15b8c6d41b7d93c6f | Ricardogll/Dev | /GameDev_Repaso/GameDev_Repaso/Source.cpp | C++ | cpp | 1,238 | no_license | #include<iostream>
//class vec3 {
//private:
// int x;
// int y;
// int z;
//
//public:
// void setX(int ax) {
// x = ax;
// }
//
// int retX() { return x; };
//};
//
//int main() {
//
// int a = 0, b = 1, c = 2;
// vec3 vec;
//
// vec.setX(a);
// std::cout << vec.retX() << std::endl;
// vec.setX(b);
// std::cout ... |
2f845ac20a8d2507ced2b623b146d5ee43767ce7 | 680eb67a323d864a4ddb370e71bba664d920f5ce | yuriy0/cs3gc3-project | /src/state.cpp | C++ | cpp | 8,393 | permissive | #include "state.h"
#include <iostream>
#include <sstream>
#include <GL/gl.h>
#include <GL/glu.h>
#include <GL/glut.h>
using namespace std;
state::state(int n) : numPlayers(n) {
init();
}
state::state() : state(3) { }
void state::resetPuck() {
puck = circle(Puck, vec2(0,0), puckRadius);
pu... |
ea3dd60531af52ce81a9cbec4a1fe730a003e891 | b45249ee31284e191277014482bf8741f78f6bb3 | jazzboysc/RTGI | /Framework/Math/Source/Private/RNG.cpp | C++ | cpp | 4,265 | no_license | //----------------------------------------------------------------------------
// Graphics framework for real-time GI study.
// Che Sun at Worcester Polytechnic Institute, Fall 2013.
//----------------------------------------------------------------------------
// This part of RTGI is based on PBRT.
/*
pbrt source... |
cc9e861d1f5cbc52a18153fc9d17d7546445007d | 1d2c94e37ae5c6976c2eb69ae9dda8985432cd78 | kssenii/ClickHouse | /libs/libcommon/src/JSON.cpp | C++ | cpp | 19,208 | permissive | #include <string>
#include <string.h>
#include <Poco/UTF8Encoding.h>
#include <Poco/NumberParser.h>
#include <common/JSON.h>
#include <common/find_symbols.h>
#include <common/preciseExp10.h>
#include <iostream>
#define JSON_MAX_DEPTH 100
POCO_IMPLEMENT_EXCEPTION(JSONException, Poco::Exception, "JSONException")
/... |
c14ea805fdd90572a7cff37e544305866b19c501 | 3ea332398649259fef34dd9b9a4322bbca2a9455 | io-eft/di-software-development | /properties.hpp | C++ | hpp | 487 | no_license | #ifndef __PROPERTIES_HPP
#define __PROPERTIES_HPP
#include <iostream>
#include <stdlib.h>
#include <string.h>
class Properties
{
int numberOfProperties;
int* type;
void** prop;
public:
Properties(int i);
~Properties();
void setStringProperty(char* property, int index);
void setInteg... |
58719c170d6368c38030f6cede3b8909052e3383 | e482a8764078097c6eb1393392f2b524af92109d | uzsolt/herbstluftwm | /src/rulemanager.cpp | C++ | cpp | 7,851 | permissive | #include "rulemanager.h"
#include <string>
#include "completion.h"
#include "globals.h"
#include "ipc-protocol.h"
#include "utils.h"
using std::string;
using std::to_string;
using std::endl;
/*!
* Implements the "rule" IPC command
*/
int RuleManager::addRuleCommand(Input input, Output output) {
Rule rule;
... |
e1e91dc6051e46ab344d8255a3e36866dcd8223c | d229bf86a90c79fa3c03e3f82705f2577e844e41 | coderwhocode/ccrma | /250a/lab2/arduino-0019/libraries/Ethernet/Server.cpp | C++ | cpp | 1,707 | no_license | #include "w5100.h"
#include "socket.h"
extern "C" {
#include "string.h"
}
#include "Ethernet.h"
#include "Client.h"
#include "Server.h"
Server::Server(uint16_t port)
{
_port = port;
}
void Server::begin()
{
for (int sock = 0; sock < MAX_SOCK_NUM; sock++) {
Client client(sock);
if (client.status() == SnSR... |
260f6d216f5919eca05b4298e4a9edaff1e80f69 | 18c31c93e6b1b580c17ff9a50981ec428a64dcb6 | SubspaceBob/cpp_bootcamp | /assignments/day2/day2_a1.cpp | C++ | cpp | 1,088 | no_license | #include <iostream>
main(){
std::cout << "Give a number between 0 and 10" << std::endl;
int input;
std::cin >> input;
std::cout << "Give a number for first dimension" << std::endl;
int dim1;
std::cin >> dim1;
std::cout << "Give a number for second dimension" << std::endl;
int dim2;
... |
b6bcae6c8a369541c9537dc4c410a618371677a4 | 6f1609742a762838b506bbedc5a04a110fa67c0d | psuplus/LLVMFaultLoc | /DependenceAnalysis/llvm-deps/sensitivity-tests/struct_test/main.cpp | C++ | cpp | 533 | permissive |
using namespace std;
typedef struct {
int a;
int b;
int c;
} Pt;
typedef struct {
int a;
int b;
int c;
Pt* p;
} Point;
int main(void)
{
Point z;
z.p = new Pt;
int key = 4; // tainted value
z.a = key; // z.a tainted
z.b = 0;
z.c = 3;
z.p->a = 2;
z.p->b = key;// z.p->b tainted
z.p-... |
3cf155034b0d21a451b899d648906384515cdedc | 577ddebc9a3cc2e936c1d86a72916e34ae56a866 | EscapeTechnologies/opengl_rendering_playground | /opengl_hello_rectangle/src/main.cpp | C++ | cpp | 2,429 | no_license | // Created By: Vineeth Yeevani
// Date: July 31, 2018
// Description: An OpenGL Extension loader test with GLEW
#include <X11/X.h>
#include <X11/Xlib.h>
#include <iostream>
#include <GL/glew.h>
#include <GL/gl.h>
#include <GL/glx.h>
#include <GL/glu.h>
#include <JarvisRenderer.h>
#include <thread>
#include <chrono>
u... |
6d8b8849ef9f5b70cef3f464040faf4b27f8d0ee | d1cdc6a811d472b82752107a96f19dadad27de6d | wvu-robotics/pollination-drive-base | /hw_interface/src/base_interface.cpp | C++ | cpp | 4,928 | no_license | #include <ros/ros.h>
#include <hw_interface/base_interface.hpp>
#include <boost/accumulators/statistics/mean.hpp>
base_classes::base_interface::base_interface() :
lastTimeMetric(ros::Time::now()),
acc(boost::accumulators::tag::rolling_window::window_size = 150)
{
enabled = true;
}
bool base_classes::ba... |
093593af65d8b76775c84e9761d40b3e1a00f0e4 | 8cee4730cba3fa3182af5b7ac738fcc203057a20 | zbalda/call-of-2d-zombies | /cpp/src/game_objects/components/graphics_components/Player_Graphics_Component.cpp | C++ | cpp | 775 | no_license | // Honor Pledge:
//
// I pledge that I have neither given nor
// revieved any help on this assignment.
//
// zbalda
#include "Player_Graphics_Component.h"
//
// Player_Graphics_Component
//
Player_Graphics_Component::Player_Graphics_Component (int r, int g, int b, int a)
: R (r)
, G (g)
, B (b)
, A (a)
{
}
/... |
79a89502bf3e3b18d0bfa251f21f6ddc67ceb65b | 4a2606c1450749a0e3c0763b9b330b65027260eb | RalenskiDoucet/Loops-cpp | /Loops cpp/loops.cpp | C++ | cpp | 957 | no_license | #include <iostream>
int main()
{
//1. What is the out put of the following code samples?
//a.
for (int i = 0; i < 100; i++)
{
std::cout << i << std::endl;
}
//b.
for (int i = 100; i >= 0; i -= 2)
{
std::cout << i << std::endl;
}
//c.
int iter = 0;
while (iter != 25)
{
std::cout << iter << std::e... |
2f2006afe12770aca5ed7fd2f1d8a8303218ddc9 | 9f63a2f880bdb9b6d588376d330fd415edb99fec | svn2github/cpp-sp | /branches/REL_2/fastcgi/shibresponder.cpp | C++ | cpp | 13,518 | no_license | /**
* Licensed to the University Corporation for Advanced Internet
* Development, Inc. (UCAID) under one or more contributor license
* agreements. See the NOTICE file distributed with this work for
* additional information regarding copyright ownership.
*
* UCAID licenses this file to you under the Apache License... |
22494d0b8d24697810eadb8eac286ce09e580ba6 | d72f5334ef32469c8301f4875c4bedd483c078c9 | piaoliangkb/cppprimer | /chapter3/3-45.cpp | C++ | cpp | 620 | no_license | #include <iostream>
using namespace std;
int main()
{
int ia[3][4] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
// 范围for语句，使用auto的时候范围for循环必须添加引用
for (auto &row: ia)
for (auto col: row) cout << col << " ";
cout << endl;
// 普通for语句，下标运算符
for (size_t i=0; i<3; ++i)
for (size_t j=... |
bd5e06c1748ad371f61de4a9c8be7f88e634e6f2 | 78bdc447d8e60c94f42aa543dfab4bd65d78af01 | SachiSakurane/libmk2 | /include/mk2/simd/intrin/wrapper/intel/assignment.hpp | C++ | hpp | 2,998 | permissive | //
// Created by Himatya on 2018-10-30.
//
#pragma once
#include <mk2/preprocessor/template_wrapper.hpp>
#include <mk2/simd/intrin/include.hpp>
#include <mk2/simd/intrin/type_traits/alignment.hpp>
#include <mk2/simd/intrin/type_traits/bit_type.hpp>
#include <mk2/simd/intrin/utility/archtecture_requirement.hpp>
names... |
7a6d15961df04867b500cac19fa9e026fd17f97b | dce6a81db35c9c59a7fab6c8fcf3c73dd13cb811 | conceptslearningmachine-FEIN-85-1759293/lms | /MEIClient/AMTHIClient/Src/AmtAnsiString.cpp | C++ | cpp | 1,442 | permissive | /* SPDX-License-Identifier: Apache-2.0 */
/*
* Copyright (C) 2010-2015 Intel Corporation
*/
#include <string.h>
#include "AmtAnsiString.h"
#include "MEIClientException.h"
#include <climits>
using namespace std;
using namespace Intel::MEI_Client::AMTHI_Client;
using namespace Intel::MEI_Client;
AmtAnsiString::AmtAns... |
a526b556204200c2b97b718b597e1626f9e8b493 | 645a8a68c226d1cb928b5b3a0ffddd1ba615ef09 | subramanian252/battletank | /battletank/Source/Battletank/Private/TankTrack.cpp | C++ | cpp | 1,503 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "TankTrack.h"
#include"Battletank.h"
UTankTrack::UTankTrack()
{
PrimaryComponentTick.bCanEverTick = false;
}
void UTankTrack::BeginPlay()
{
OnComponentHit.AddDynamic(this, &UTankTrack::OnHit);
}
void UTankTrack::OnHit(UPrimit... |
b7e7c7cf22d4843be475ca2cd49f6fbf375aafec | f466cfd410628b7f04a690d1344278b72f2ce1ae | bkahlert/seqan-research | /raw/workshop13/workshop2013-data-20130926/sources/74sudqshs06shyg7/30/sandbox/my_sandbox/apps/second_app/second_app.cpp | C++ | cpp | 3,614 | permissive | #include <iostream>
#include <seqan/sequence.h>
#include <seqan/file.h>
using namespace seqan;
// Function to print simple alignment between two sequences with the same length
template <typename TText1, typename TText2>
void printAlign(TText1 const & genomeFragment, TText2 const & read)
{
std::cout << "Align... |
c67c0fe1345a53ead018424a00e5b502c716b823 | 1f1d939eb083d2a5854524560f8bb8e8edd208de | csimstu/OI | /poj/p1000.cpp | C++ | cpp | 412 | no_license | #include <cstdio>
#define INPUT "t.in"
#define OUTPUT "t.out"
#define STDIO
namespace Solve
{
int a, b;
void solve(FILE *fin, FILE *fout);
}
void Solve::solve(FILE *fin, FILE *fout)
{
fscanf(fin, "%d%d", &a, &b);
fprintf(fout, "%d\n", a + b);
}
int main()
{
#ifdef STDIO
Solve::solve(stdin, stdout);
#else
FILE ... |
d82da637dcbbc1713b8f6633a1d3e9db09717fff | 380c21f2bc3b7b33f05a5710047ecb8e123aa8cd | LIMXTEC/LasVegasCoin2 | /src/qt/transactiontablemodel.cpp | C++ | cpp | 26,689 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "transactiontablemodel.h"
#include "addresstablemodel.h"
#include "guiconstants.h"
#include "guiutil.h"
#include "op... |
0310862e39f5a2184e65ecdf30fb4b3fa010c99c | f6b8cc962d3f4afddca8d98c17e1eba1a874ba9e | Chingliu/console2 | /src/ConsoleHook/ConsoleHandler.cpp | C++ | cpp | 28,487 | no_license | #include "stdafx.h"
#include "../shared/SharedMemNames.h"
#include "ConsoleHandler.h"
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////... |
8cf596dd838b75e820618b97e75ada2533fd69f0 | 4682d3776c35cf54eb83781f7f9bd6a21e73d28d | nechosa/walker | /cocos2d/cocos/editor-support/cocostudio/CCUtilMath.cpp | C++ | cpp | 2,633 | permissive | /****************************************************************************
Copyright (c) 2013-2016 Chukong Technologies Inc.
http://www.cocos2d-x.org
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 Sof... |
89f2222a9ae6898121b42685c9ce26355bc5c425 | 528ac3aaa37143e6ea5543fba4666ecf6dabe14e | yuta884/Project-StoryTeller- | /storyTeller/Classes/Scene/Stage.hpp | C++ | hpp | 267 | no_license | //
// Stage.hpp
// storyTeller
//
// Created by vantan on 2016/09/06.
//
//
#ifndef Stage_hpp
#define Stage_hpp
#include <cocos2d.h>
USING_NS_CC;
class Stage : public Layer
{
public:
bool init();
CREATE_FUNC(Stage);
};
#endif /* Stage_hpp */
|
445b4d8336c8ff715b922d6a52ee1f9dd5f084e6 | 22bfdf8a30c13562394f275a7c3a2710c13228c3 | llucasgregorio/C- | /Programa_Media2.cpp | C++ | cpp | 336 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
int main(){
system("color 5");
int entrada,i;
float soma=0;
setlocale(LC_ALL, "Portuguese");
for(i=1;i<=4;i++){
printf("Informe o %i valor\n",i);
scanf("%i",&entrada);
soma=soma+entrada;
}
printf("media= %.2f", soma/4);
system("p... |
b725db64013ef8704a611f45e2cfa355cf946e7e | 813c10ae7d8fb6dba7b460b336694a2f8ce1f283 | darshil179/ElevateInterior | /GreenifyGardenapp-master/app/src/main/cpp/native-lib.cpp | C++ | cpp | 288 | no_license | #include <jni.h>
#include <string>
extern "C" JNIEXPORT jstring
JNICALL
Java_designengineeeringgroup_greenify_1gardenapp_LoginPage_stringFromJNI(
JNIEnv *env,
jobject /* this */) {
std::string hello = "Hello from C++";
return env->NewStringUTF(hello.c_str());
}
|
e87f61403bbbe54d42ea53ba67c0277818d2a44c | a3e6f03a75a39c6dccdadced1dd8c9de44da9feb | raajay/pmls-caffe | /ps-thin/src/petuum_ps/thread/row_oplog_recycle.hpp | C++ | hpp | 1,727 | permissive | #pragma once
#include <boost/noncopyable.hpp>
#include <queue>
#include <petuum_ps/include/configs.hpp>
#include <petuum_ps/util/stats.hpp>
#include <petuum_ps/oplog/create_row_oplog.hpp>
#include <petuum_ps/thread/context.hpp>
namespace petuum {
class RowOpLogRecycle : boost::noncopyable {
public:
RowOpLogRecycl... |
71d9d1fddce262376b7e489e6f295214cede1fc5 | b0647c91f9710dd5fde20bf37de8e5237b452933 | fairlight1337/GDAPlanner | /src/gdaplanner/problems/PDDL.cpp | C++ | cpp | 2,437 | permissive | #include <gdaplanner/problems/PDDL.h>
#include <iostream>
namespace gdaplanner {
namespace problems {
PDDL::PDDL() {
}
PDDL::~PDDL() {
}
void PDDL::setIdentifier(std::string strIdentifier) {
m_strIdentifier = strIdentifier;
}
void PDDL::setDomain(std::string strDomai... |
7588ef9fbeae2fc4369b7aa82bfa4a9f45af4f27 | b722e1260f6a8693553e522b3bd9e0c242375476 | greenfox-zerda-sparta/besszerf | /week-03/Day-1_new/03.cpp | C++ | cpp | 752 | no_license | #include <iostream>
using namespace std;
int main() {
int* pointer = NULL;
/**
* Please create a program that asks for a count when it starts.
* It should ask for a number count times, then it shoud print the average of the nubmers.
* It should delete any dynamically allocated resource before the program... |
02f8fa4a70b0d3620fa33a30ba07e76ddba4e80a | f75d5b0fe3352bb115f77857249127f1d6113c46 | haodafan/cs343 | /a6/driver.cc | C++ | cc | 3,478 | no_license | // PROGRAM MAIN
#include "MPRNG.h"
//MPRNG mprng;
// Include everything?
#include "bank.h"
#include "cardoffice.h"
#include "conductor.h"
#include "config.h"
#include "global.h"
#include "groupoff.h"
#include "nameserver.h"
#include "parent.h"
#include "printer.h"
#include "student.h"
#include "timer.h"
#include "tra... |
c95783b0ae27db37c83f324696465e4b633be3e6 | 320da473013d4a3d205783574e1ad27666e2f5f8 | RT-1904129/Competitive-programming | /Total Number of Subarrays Divisible by K.cpp | C++ | cpp | 845 | no_license | #include<iostream>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long int rt;
rt Total_Number_of_Subarrays_Divisible_by_K(vector<rt>arr,rt k){
rt curr_sum = 0;
rt count = 0;
unordered_map<rt,rt> map;
for(int i=0;i<arr.size();i++){
curr_sum +=... |
c6e62933e262ab30faeb5cdb482370d2cf1d6b0a | 6783c0b529feb7eefad4d25fade3b88bd3eff34b | xeon2007/WSProf | /Projects/Connect/src/Facade/TestFacade/TestFacadeDocumentProvider.cpp | C++ | cpp | 4,972 | no_license | #include "StdAfx.h"
#include "TestFacadeDocumentProvider.h"
TestFacadeDocumentProvider::TestFacadeDocumentProvider(const std::tstring& name) : TestCase(name)
{
}
TestFacadeDocumentProvider::~TestFacadeDocumentProvider()
{
}
BEGIN_TEST_SUITE(TestFacadeDocumentProvider)
ADD_TEST_METHOD(TestRequiredInterfacesImplemet... |
b33d5aa623ef10b28518dd3f798ea89a48f4f316 | 2881db1d02f3a3dfe135d7919eef3fcce2b27340 | kientit1993/cam | /Classes/AppDelegate.cpp | C++ | cpp | 4,282 | no_license | #include "AppDelegate.h"
#include "HelloWorldScene.h"
// #define USE_AUDIO_ENGINE 1
// #define USE_SIMPLE_AUDIO_ENGINE 1
#if USE_AUDIO_ENGINE && USE_SIMPLE_AUDIO_ENGINE
#error "Don't use AudioEngine and SimpleAudioEngine at the same time. Please just select one in your game!"
#endif
#if USE_AUDIO_ENGINE
#include "au... |
6376d7a01da6ab5b62709ce8fa0b8f583b3ab055 | e654ad0a11d61185cd7c3917e6bb7453b0de6a73 | windie/leetcode | /test/word_ladder_ii_test.cc | C++ | cc | 1,293 | no_license | #include "common.h"
#include "word_ladder_ii.h"
#include <gtest/gtest.h>
TEST(WordLoaderII, findLadders) {
Solution s;
unordered_set<string> dict;
dict.insert("a");
dict.insert("b");
dict.insert("c");
vector<vector<string> > res;
vector<string> v;
v.push_back("a");
v.push_back("c");
res.push_back(v);
ASSERT... |
33686c392659fab905cbd0f5b31a2bc1397b2d9c | 49867606eb4612ef5263048256b364ef107d185d | ellenzinc/programming_mianjing | /facebook_jobScheduling.cpp | C++ | cpp | 1,745 | no_license | #include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
using namespace std;
struct LogData {
string name;
int timeStamp;
bool start;
LogData(): start(false){}
LogData(const string &n, int t, bool s): name(n), timeStamp(t), start(s) {}
};
struct Record {
string name;
... |
2cb5f63c41fec0509b0bb6fb86cf0afc778f4657 | 11bf6403658e39702b23c6a450403cf229a45fa5 | onizenso/College | /classes/cs335/labs/primeFactor.cpp | C++ | cpp | 1,102 | no_license | //Need to test for bugs and why nothing is printing to the screen
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <iomanip>
using namespace std;
bool pTest(int);
void primeGen(long int, long int, long int);
void printList(long int*);
long int bfn;
int main(int argc, char* argv[])
{
if(argc<2){... |
bb0a28271c3fa56f032f6365dff14ce4c89ec147 | 3d8c7ee82f4e4a042067c7bd2be72c60ee044a41 | stardog-union/boost | /libs/thread/test/sync/mutual_exclusion/locks/unique_lock/cons/defer_lock_pass.cpp | C++ | cpp | 1,037 | permissive | //===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===---------------------------------... |
1207b473e9f682a32726b14764a93efa59310b22 | 657ef0733ea0ff3d1c180eb3c71952f61bef076a | issaclin32/SWIG-python-example | /fn/find_nearest.cpp | C++ | cpp | 1,587 | permissive | #include <cmath>
#include <vector>
#include "find_nearest.h"
#include "numpy/ndarrayobject.h"
#include <omp.h>
#include <iostream>
using std::sqrt;
// 1: white of eye, 0: skin
std::vector<int> find(std::vector<int> x, std::vector<int> y,
std::vector<int> wx, std::vector<int> wy,
std::vector<int> sx, std::vector... |
159794a69b7282062e9e2aefe2869a853a4c4bc0 | feaa2e8e730dcd13e828d604128902e9851a5f51 | forestfinnigan/gaze_controller | /GazeClassifier.cpp | C++ | cpp | 5,835 | no_license | // Libraries for landmark detection (includes CLNF and CLM modules)
#include "LandmarkCoreIncludes.h"
#include "GazeEstimation.h"
#include "RotationHelpers.h"
#include "GazeCamera.h"
#include <SequenceCapture.h>
#include <Visualizer.h>
#include <VisualizationUtils.h>
#include <math.h>
#include <iostream>
#include <thr... |
1cd5f67d0e101d0f29d4d9e801d32dea8c3fdb76 | 0e502d65225e6900ea64cc68bfb0c0839726fdcc | moonyeol/lecture_paper | /전자프로그래밍언어/ManageMart/Item.cpp | C++ | cpp | 1,969 | no_license | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include "ITEM.h"
using namespace std;
int Item::profit()
{
int result = price * sales_volume;
return result;
}
int Item::net_profit()
{
int result = c_price * sales_volume;
return result;
}
void Item::edit() {
item_setname();
item_setcode();
item_setprice()... |
90b4ac69c40230cfb0e38fde0f655363767bb0c0 | 93014b563826bac6caac245e430d7525736e1aee | rcn-ee/ti-opencl | /examples/vecadd/main.cpp | C++ | cpp | 5,528 | no_license | /******************************************************************************
* Copyright (c) 2013-2014, Texas Instruments Incorporated - http://www.ti.com/
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the followin... |
e4e7dca4dcec850374f34e2c3335196653992613 | ad5467bb38f6389db418d1bb9c049fd02f3a331d | wzyy2/chromium-browser | /content/renderer/input/scoped_web_input_event_with_latency_info.cc | C++ | cc | 1,967 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/renderer/input/scoped_web_input_event_with_latency_info.h"
using blink::WebInputEvent;
namespace content {
ScopedWebInputEventWithLat... |
e9e43084d78b2950557d9718f1a4020d6cda2f0e | 4872f2955b0920e79208ffaaba17934d4617bedf | xuxiaowei007/logger | /include/Throwables.hpp | C++ | hpp | 719 | permissive | #ifndef LOGGER_THROWABLES_HPP
#define LOGGER_THROWABLES_HPP
#include <stdexcept>
#include <string>
namespace logger {
namespace Exception {
class Error : public std::exception {
protected:
const std::string src, msg;
public:
Error(const std::string &s, const std::string &m) : src(s), msg(m) {}
Error(const std... |
250517738302ee7b2d8dd6655981f4d4e28535d4 | 33d242004565aa588a98a88687a9c41f7446701e | tuccio/fuse | /graphics/color.cpp | C++ | cpp | 821 | no_license | #include <fuse/color.hpp>
using namespace fuse;
const color_rgb color_rgb::black(0, 0, 0);
const color_rgb color_rgb::white(1, 1, 1);
const color_rgb color_rgb::red(1, 0, 0);
const color_rgb color_rgb::green(0, 1, 0);
const color_rgb color_rgb::blue(0, 0, 1);
const color_rgb color_rgb::yellow(1, 1, 0);
const color_rg... |
02d5e989a3aa46f9d7ec05aa376ad85e4a82deda | 9a8e0128e32a0985fc52d1a9a71c631d3d80a071 | xgw2012/fight | /zyrh/ipcDeviceServer/ipcDeviceServer/zyrhServer/server/http_server_work.cpp | C++ | cpp | 13,202 | no_license | #include "http_server_work.h"
#include <GlobalParam.h>
#include <GlobalClass.h>
#include <GlobalFun.h>
#include "devsdk/DevManager.h"
#include "devsdk/DevSdk.h"
#include "../Logger.h"
#include <json/json.h>
#include "httpClient/httpClient.h"
http_server_work::http_server_work()
{
m_nBeenSendSize = 0;
m_... |
67b36de8fb4e7e2a90ebe6be2dbf21659502b55c | 8aa613331621bbd5b8ef969681cac6f689411767 | jjzhang166/WinNT5_src_20201004 | /NT/inetsrv/msmq/src/setup/msmqocm/ocmmail.cpp | C++ | cpp | 2,464 | no_license | /*++
Copyright (c) 1997 Microsoft Corporation
Module Name:
ocmmail.cpp
Abstract:
Handles Exchange connector.
Author:
Revision History:
Shai Kariv (ShaiK) 10-Dec-97 Modified for NT 5.0 OCM Setup
--*/
#include "msmqocm.h"
#include "ocmmail.tmh"
using namespace std;
... |
3bd02172cd82d0e8b2c578990e1c9af810ed347c | 87623d3d091bbacb269f426babb8ba6da807dd95 | dong10086/c1 | /c2.cpp | C++ | cpp | 1,618 | no_license | #include<stdio.h>
#include<windows.h> //sleep函数声明在这里
#include "itmojun.h" //包含当前工程目录下的itmojun.h头文件
//引入当前工程目录下的itmojun.lib这个库文件
#pragma comment(lib,"itmojun.lib")
int main()
{
char cmd[301];//存放从微信端接收的消息
AutoRun(); //讲当前程序设置为开机自动运行
while(1){
//GetPCCmd函数的功能：从微信端接收一条消息，如果没有任何消息，它会一直等待
//第一个... |
ea2330914ba876939b15395c01499129caa1baf8 | fe8e5e2e86adb9cc5767d1c18181d2a403699599 | akashsharma99/days-of-code | /day_1/4inversioncount.cpp | C++ | cpp | 1,425 | no_license | /*Given an array of positive integers. The task is to find inversion count of array.
Inversion Count : For an array, inversion count indicates how far (or close) the array is from being sorted. If array is already sorted then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum.... |
eefceac95842bc09d9c230a5f0e549a1e8bb79a4 | 42fb57fb9938479e408e32dec69ea53395746b30 | arkakub/SLAMAD | /Projekt_New/Projekt/main.cpp | C++ | cpp | 10,026 | no_license | #include "systemc.h"
#include "Clock_Module.cpp"
#include "AutomatyczneOswietlenie.cpp"
#include "AutomatyczneOgrzewanieWentylacja.cpp"
#include "OswietlenieChodnika.cpp"
#include "WykrywaczCzaduGazu.cpp"
#include "ModulAlarmowy.cpp"
#include <windows.h>
sc_signal<bool> clock; //rejestr 1 bit (polocznenie... |
3e69a9e885e1ff34b30045055af146e1d65ff084 | e33f221b08b37063ab1a621c3b3d43732ec73ee8 | uwp-at-mrit/BigBang | /graphlet/filesystem/configuration/colorplotlet.hpp | C++ | hpp | 2,390 | no_license | #pragma once
#include "graphlet/filesystem/msappdatalet.hxx"
#include "graphlet/primitive.hpp"
#include "datum/flonum.hpp"
namespace WarGrey::DTPM {
#define ColorPlotSize 20
private ref class ColorPlot sealed {
public:
static WarGrey::DTPM::ColorPlot^ load(Platform::String^ path);
static bool save(WarGrey::DT... |
cf54afc3cf167738831b2231f5f56daf8cbda1a5 | a61fb3c97f097066cb06f14e369883c741b2bb15 | eurogiciel-oss/Tizen_Crosswalk | /src/chrome/browser/extensions/api/serial/serial_apitest.cc | C++ | cc | 5,955 | 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 <deque>
#include <string>
#include <vector>
#include "base/memory/scoped_ptr.h"
#include "chrome/browser/extensions/api/serial/serial_api.h"... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.