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 |
|---|---|---|---|---|---|---|---|---|
90ddd113ca2ddda3b89afafaba505b8c353282ed | bf28495c807c730771cccf20445bb08ff9f72579 | nahratzah/llvm | /lib/Target/X86/X86TargetObjectFile.cpp | C++ | cpp | 3,855 | permissive | //===-- X86TargetObjectFile.cpp - X86 Object Info -------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
28c16a808e6f6b705b092fb6c1f4b19fd6029460 | 4a62d257cef1168e0bfb78e1a70d1882d71f0aa9 | barpje/PO1 | /lab5/main.cpp | C++ | cpp | 3,948 | no_license | // *** Nie wolno modyfikować tego pliku ***
/* ---------------------------------------------------------------------
*** Mały Genetyk ***
Zadanie polega na zaimplementowaniu następujących klas:
1. GeneSeq (gene_sequence.h)
Klasa implementuje dowolną sekwencję nukleotydów.
Nukleotydy są nowym typem enum.
UWAGA: dek... |
7530631bb3b5c95782b0031f5b0b4fcfe6e30707 | 9f1a4aae96198d760dc1d7d7398f86d599e04da6 | ChickL/LibraryManager | /AddBookWidget.cpp | C++ | cpp | 3,152 | no_license | #include "AddBookWidget.h"
AddBookWidget::AddBookWidget(QWidget *parent) :
QWidget(parent)
{
grid = new QGridLayout;
hbox = new QHBoxLayout;
vbox = new QVBoxLayout;
lb1 = new QLabel;
lb2 = new QLabel;
lb3 = new QLabel;
lb4 = new QLabel;
lb5 = new QLabel;
lb6 = new ... |
6d2e7d32258d760b78d174b682347692f40efbed | c1a5db79a2837f38ec21a9113e8484b49b709d54 | nitesh-147/Programming-Problem-Solution | /codeforces/ggg.cpp | C++ | cpp | 683 | no_license | #include <bits/stdc++.h>
using namespace std;
int arr[1009];
int ans[1009];
int main()
{
int a, b, c, n, m, t, cs = 1, i, j;
int num;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
memset(ans, 0, sizeof ans);
for(i = 0; i < n; i++)
scanf("%d", &arr[i]);
... |
07203c8162f5307885b5873067767f4920cb91ba | a3db516320639c14ee9e638e53016863c3af5c4e | Bekon0700/Competitive_Programming | /UVA_1/r_11517 - Exact Change.cpp | C++ | cpp | 852 | no_license | #include<stdio.h>
#include<algorithm>
using namespace std;
int tk[20000],co[100];
bool com(int a,int b){return a>b;}
int main()
{
int m,i,j,tot,ks,f,n;
scanf("%d",&ks);
while(ks--)
{
scanf("%d%d",&f,&n);
tot=0;
for(i=0;i<n;i++) {scanf("%d",&co[i]);tot+=co[i];}
... |
309cf40bd7dc2766de6a8a43c18142dabe62fa23 | 0ae9ca47943915ea2796496ad42eff9180b5dc1f | ornotermes/KiteLib | /src/ISerial.cpp | C++ | cpp | 2,980 | permissive | #include "ISerial.h"
ISerial::ISerial(Module* mod) {
_mod = mod;
}
void ISerial::begin(long speed) {
_mod->ModuleSerial->begin(speed);
}
bool ISerial::listen() {
return(_mod->ModuleSerial->listen());
}
void ISerial::end() {
_mod->ModuleSerial->end();
}
bool ISerial::isListening() {
return(_mod->ModuleSer... |
b4bec541c4e4d48185fad1f79ab9aee2dd748216 | 3147c222b6fea3134e4e4b489191d370f1a761d0 | Charles-KK/AVLTree_ADT | /main.cpp | C++ | cpp | 2,322 | no_license | #include"DSO.h"
int main() {
AVLTree t1;
int temp = 0;
int taller = 1;
InitAVLTree(t1);
int select = 0;
int depth = Depth(t1);
while (1) {
//menue
printf("**************************************************************************\n");
printf("1:创建AVL树 2：显示当前AVL树的结构 3:中序遍历序列 4:查找结点 5：插入结点 6:删除结点 7：销毁AVL树\... |
d929faa2ead9cf3fd9918d48454ad77a190b1ea9 | c38760d4e0fd02d9cfa7711ff9566ac3f4b79267 | 1179432578/gl02 | /gl02/actions/CCActionManager.cpp | C++ | cpp | 2,098 | no_license | //
// CCActionManager.cpp
// gl02
//
// Created by lewis on 16/5/30.
// Copyright © 2016年 鲁飞. All rights reserved.
//
#include "CCActionManager.h"
#include "CCArray.h"
class HashElement : public CCObject
{
public:
CCArray *actions;
CCObject *target;
unsigned int ... |
c3e2cfa86cb17624f5d3cc41aa9e12c4c243d2f7 | 190a0b229e7271e751e60051124175b8373706f4 | Amdrija/OO1 | /LabVezba3/PuteviSrbije/Ruta.cpp | C++ | cpp | 1,132 | no_license | #include "Ruta.h"
Ruta::Ruta(const Lista4<Deonica*>& route_list)
:routes(route_list){}
Lista4<Deonica*>& Ruta::getRoutes()
{
return routes;
}
const Lista4<Deonica*>& Ruta::getRoutes() const
{
return routes;
}
double Ruta::length() const
{
double length = 0;
for (routes.setOnFirst(); !routes.c... |
5b4fac7b31ff4f7fb13ddec44c71c9b58cd46f16 | 6f66762f85eeb5947a7a56396a241dc2642b6218 | rapidsai/cugraph | /cpp/src/c_api/hierarchical_clustering_result.cpp | C++ | cpp | 2,107 | permissive | /*
* Copyright (c) 2022-2023, NVIDIA 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.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable... |
8e023af9589e496cff540ffd3f1afab3796a6f47 | 98466ff4966edc6e719f9fa48bb81d0b645ed46c | azxca1731/nogada-algorithm | /0. 입출력/10992/main.cpp | C++ | cpp | 530 | permissive | #include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
for (int i = 1; i <= N - 1; i++)
{
for (int j = N - i; j > 0; j--)
{
cout << " ";
}
cout << "*";
for (int j = 2 * (i - 1); j > 0; j--)
{
if (j == 1)
... |
b57929af81caba92ab3b64d3f3b6170e9d91acf7 | ff6ec14b755d0577ec2ff778765d1ce18a15d0bf | ripoll97/ProjecteXarxesTCP | /Peer/main.cpp | C++ | cpp | 5,730 | no_license | #include <SFML\Network.hpp>
#include <SFML\Graphics.hpp>
#include <string>
#include <iostream>
#include <vector>
using namespace std;
using namespace sf;
vector<TcpSocket*>aSock;
struct Direction
{
string ip;
unsigned short port;
Direction(string _ip, unsigned short _port) : ip(_ip), port(_port) {}
Direction() {... |
a366760f5dc3d51b39d03560799c8cc57513a9c1 | f9e56615f29bd3e0164f0bf5306e52f6e7334024 | iDLE1992/plus-course-content | /Moving to C++/L3/flags.cpp | C++ | cpp | 1,082 | no_license | #include <iostream>
using namespace std;
// enum designFlags {
// italics = 1, //0000000001
// bold = 2, //0000000010
// underline = 4//0000000100
// };
class Room {
public:
double length;
double breadth;
double height;
Room() {
cout << "Creating a room" << endl;
}
//copy constructor with Room object as ... |
080a65917dfb26c6752ce5b119f413a014cd42f9 | 08dceade42e0f4bdf767844d84fbf84bf252b3c5 | MatteoRiganelli/labial_prediction_2 | /poiDetection.cpp | C++ | cpp | 6,156 | no_license |
#include "poiDetection.hpp"
void findLipMask(IplImage* srcQSI, IplImage* result)
{
/*CvSize s = cvSize(srcQSI->width, srcQSI->height);
int d = srcQSI->depth;
IplImage* Q = cvCreateImage(s, d, 1);
IplImage* S = cvCreateImage(s, d, 1);
IplImage* I = cvCreateImage(s, d, 1);
cvSplit(sr... |
73a72979e72f80ab3e0fa8441573ea5bb84587a1 | b43723a3f6335dbefcf2cf01478f98e9f82f538e | CMPT409/uva_problems | /Margaret/LifeForms.cpp | C++ | cpp | 5,129 | no_license | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
// refer to suffix array ACM template:
// https://github.com/eecrazy/ACM/blob/master/%E6%A8%A1%E6%9D%BF/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/%E5%90%8E%E7%BC%80%E6%95%B0%E7%BB%84%E6%A8%A1%E6%9D%BF.cpp
//
// the length of inpu... |
f63da285b3a47797430e4d1a1f849e385a95edde | 628c5b97ed7b72ccb39e1a3f6c45fe3f9670a587 | yunruowu/LeetCode | /190.颠倒二进制位.cpp | C++ | cpp | 2,120 | no_license | /*
* @Description:
* @Version: 2.0
* @Author: yunruowu
* @Date: 2020-02-06 21:16:12
* @LastEditors : yunruowu
* @LastEditTime : 2020-02-06 21:26:47
*/
/*
* @lc app=leetcode.cn id=190 lang=cpp
*
* [190] 颠倒二进制位
*
* https://leetcode-cn.com/problems/reverse-bits/description/
*
* algorithms
* Easy (54.11%)
... |
c58ebdcb2db1caf7fe3e7c26cee44b5c273d18e8 | 4d51c2116b281891fd42ad79d9fbf966430ebf9b | cadriansalazarg/InterfacesZynq | /Uso_Bus_Paralelo_Simple/hls/customized_IP.hpp | C++ | hpp | 615 | no_license | #include "hls_stream.h"
#ifndef FIR_H_
#define FIR_H_
#define SIZE 512
#define SimSteps 100
typedef int data_t;
void customized_IP_block( hls::stream<data_t>& out_fifo_drvr_0,
hls::stream<data_t>& in_fifo_drvr_0,
hls::stream<data_t>& out_fifo_drvr_1,
h... |
ce5ccf4a67bfa68dde3b48cc8e43c52ec0cfe70d | 95da24df1da0e21f9b3827ce3dba4d87e3ac3002 | wonabru/qcoin | /src/src/qt/optionsmodel.cpp | C++ | cpp | 9,060 | permissive | #include "optionsmodel.h"
#include "qcoinunits.h"
#include "init.h"
#include "walletdb.h"
#include "guiutil.h"
#include <QSettings>
OptionsModel::OptionsModel(QObject *parent) :
QAbstractListModel(parent)
{
Init();
}
bool static ApplyProxySettings()
{
QSettings settings;
CService addrProxy(settings.... |
c186463d6892011fea7046338146621d2282904c | b02ef8ac1d2ab8b14a50046796b33afcf5b01043 | ldehaudt/Retro-Space-Shooter | /Bullet.cpp | C++ | cpp | 594 | no_license | #include "Bullet.hpp"
#include <ncurses.h>
#include "Game.hpp"
Bullet::Bullet(int x, int y, int s, int dirX, int dirY, char c, std::string t) : Unit(x, y, s, c, t), dX(dirX), dY(dirY) {
color = 1;
}
int Bullet::update(int){
mvwaddch(Game::win, getY(), getX(), ' ');
addX(dX * 2);
addY(dY);
if(get... |
c7aa3b5a03b90c897d101f431bac3e6b386f8ed6 | 07927c43212b709e1d9fb7c826dc8f82eebd0a1e | wsili/apollo | /modules/dreamview/backend/hmi/hmi.cc | C++ | cc | 6,502 | permissive | /******************************************************************************
* Copyright 2017 The Apollo Authors. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
... |
3ffcc73110ffa3ab009b586d2be71286bb05d8d7 | 4b9b746f1bf11702e5d547652bbc67a416fe2a5b | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-xray/source/model/GetSamplingStatisticSummariesRequest.cpp | C++ | cpp | 704 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/xray/model/GetSamplingStatisticSummariesRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::XRay::Model;
using namespace Aws::Utils::Json... |
1a0edcc379cba9cc45bfa79e97d59bcd30717d4b | e623fce7ea39678dce0a7ff209a18f04cd9db77b | lehatheslayer/Algorithms | /Algorithms/Lab11/3.cpp | C++ | cpp | 948 | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
freopen("pathbgep.in", "r", stdin);
freopen("pathbgep.out", "w", stdout);
int n, m, a, b, c;
cin >> n >> m;
vector<vector<pair<int, int>>> g(n);
vector<int> d(n, 1000000000);
for (int i = 0; i < m... |
3215b98a48207e58c0e5b1cfbe06d3da854985d0 | ba3d4229f5da98e436317b5f8a4291620e4680ca | rrrr98/uva | /573.cpp | C++ | cpp | 753 | no_license | // Edit : 14 August 2017
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int h, u, d, f;
double speed = 0;
double now = 0;
bool status;
double fatigue;
int ct;
while (scanf("%d %d %d %d", &h, &u, &d, &f) == 4) {
if (h == 0) {
... |
0ecde6016ececb43505517fbc15cf02cdbba086b | 228a9492496b976564093ec85ac129254c86e09f | lightjameslyy/lt-cpp | /network/ipc_system_v/msg_stat.cpp | C++ | cpp | 535 | no_license | #include "lnp_lt.h"
using namespace lt;
int main(int argc, char* argv[]) {
int msqid = msgget(1234, 0666 | IPC_CREAT);
if (msqid == -1)
err::Exit("msgget");
printf("msgget success, msqid=%d\n", msqid);
struct msqid_ds buf;
int ret = msgctl(msqid, IPC_STAT, &buf);
if (ret == -1)
... |
fe247e9e47637a22dc2a21ba762294d59070844e | ffa5b11870fa2b92211a063965d3c50bad91eaf7 | alexandraback/datacollection | /solutions_5631572862566400_0/C++/lexuanan/gcj16_1a_C.cpp | C++ | cpp | 1,509 | no_license | #include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int f[N], deg[N], d[N];
int main() {
freopen("C.in", "r", stdin);
freopen("C.out", "w", stdout);
int ct;
cin >> ct;
for (int nt = 1; nt <= ct; nt++) {
int n;
cin >> n;
for (int i = 1; i <= n... |
50d0022a65cb660b312a7cc444b95483b7daa9c5 | ca0ef70e65857cd1fb8efb6cac099d27c7978d4b | naikkartik/competitive_coding_problem | /graph/max_area.cpp | C++ | cpp | 1,331 | no_license | #include<bits/stdc++.h>
using namespace std;
bool vis[101][101];
int g[101][101];
int n,m;
bool safe(int i,int j)
{
return i>=0 and j>=0 and i<n and j<m and g[i][j]==1 and !vis[i][j];
}
int c=0;
static int x[] = {-1, -1, -1, 0, 0, 1, 1, 1};
static int y[] = {-1, 0, 1, -1, 1, -1, 0, 1};
void f(int i,int j)
{
vis[... |
db2598a241b6bdff52d02db31a80f57d4033193e | 4250d23e3be9af68d22993c221dd8bd00b8d4b9d | tawannacab87/platform_system_core | /fs_mgr/libsnapshot/partition_cow_creator.cpp | C++ | cpp | 8,073 | permissive | // Copyright (C) 2019 The Android Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applic... |
26f1f2795f6e7d9c44e97af4a900d5aa4d69381f | 86bf669f6dbd172bb03c31ed78a82791cf70eece | uel-dataexchange/Opencascade_uel | /src/VrmlData/VrmlData_WorldInfo.cxx | C++ | cxx | 5,886 | no_license | // File: VrmlData_WorldInfo.cxx
// Created: 01.08.07 08:21
// Author: Alexander GRIGORIEV
// Copyright: Open Cascade 2007
#include <VrmlData_WorldInfo.hxx>
#include <VrmlData_Scene.hxx>
#include <VrmlData_InBuffer.hxx>
#ifdef WNT
#define _CRT_SECURE_NO_DEPRECATE
#pragma warning (disable:4996)
... |
34d9afc98421c20ebc15035aa26b4d4570302664 | 694ae302542acc061a1268cdb7f55088bf622b2c | danielmoskal/Grafika2017 | /Grafika2017/Grafika2017/glm.cpp | C++ | cpp | 70,333 | no_license | /*
glm.c
Nate Robins, 1997, 2000
nate@pobox.com, http://www.pobox.com/~nate
Wavefront OBJ model file format reader/writer/manipulator.
Includes routines for generating smooth normals with
preservation of edges, welding redundant vertices & texture
coordinate generation (... |
2c71f574b6b6b3a7ff6b63bc6d00bd295dc6d482 | 243d47a801120285ee30219823df20b9f74c6b8c | merde-libertas/merdecoin | /merdecoin-v0.01/src/test/miner_tests.cpp | C++ | cpp | 24,691 | permissive | // Copyright (c) 2011-2018 The Merdecoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <chainparams.h>
#include <coins.h>
#include <consensus/consensus.h>
#include <consensus/merkle.h>
#include <consen... |
1b9a309bfd1d2811f3365c70d6ed081ef8d4a3d8 | 3d015a854648f6ca20beff6079056ec36d3ee613 | hws522/Basic-Algorithm | /선택정렬(Selection_Sort).cpp | C++ | cpp | 643 | no_license | // 가장 기초적인 정렬. 비효율적. 시간복잡도 O(N^2)
#include<iostream>
using namespace std;
int main()
{
int min, index, temp;
int array[10] = {1, 10, 5, 8, 7, 6, 4, 3, 2, 9};
for(int i = 0; i < 10; i++)
{
min = 99999;
for(int j = i; j < 10; j++)
{
if(min > array[j])
{
... |
29375538e01a0aee0c03677584aac2cce617a080 | 40ccf883e44ba5d5f2dbc1d6c9df7e8108ea2739 | rafaelbravopareja/Kratos | /applications/ShapeOptimizationApplication/custom_python/add_custom_utilities_to_python.cpp | C++ | cpp | 8,976 | permissive | // ==============================================================================
// KratosShapeOptimizationApplication
//
// License: BSD License
// license: ShapeOptimizationApplication/license.txt
//
// Main authors: Baumgaertner Daniel, https://github.com/dbaumgaertner
//
// ========... |
211a7a549713865f5cc049197a11b7c1a8ad6a1f | c74b1adbe92355da62e7c02bec291c4a9cc4dbc1 | novaquark/aws-sdk-cpp | /aws-cpp-sdk-config/source/model/DescribeConfigurationAggregatorsRequest.cpp | C++ | cpp | 2,249 | permissive | /*
* Copyright 2010-2017 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" fil... |
6150ef9f6dbdd1a56bd51282950860b9880c2f8e | 4af2b8b4e49090122cda579d68ea8bcb4e9de689 | bathepawan/chromium | /chrome/browser/ui/ash/launcher_page_switches_interactive_uitest.cc | C++ | cc | 6,950 | permissive | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/public/cpp/app_list/app_list_types.h"
#include "ash/public/cpp/pagination/pagination_model.h"
#include "ash/public/cpp/pagination/pagination... |
208b612021583960590ecf467c7a93a167024cce | 1ac8ed25de85f050b9c5852dca94079e80a3a7da | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_Buff_DinoTekHelmet_Tapejara_functions.cpp | C++ | cpp | 1,609 | permissive | // ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_Buff_DinoTekHelmet_Tapejara_parameters.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Functions
//------------------------------------------------------... |
9aecbdd6ab0d51bcc2b0da8ef8f2cdd683d261ea | 7501252c29e7e18e4789796cd5f0cbb6b2bd8573 | Ameis-god/Soul-knight | /sabre.cpp | C++ | cpp | 1,428 | no_license | #include"sabre.h"
#include"cocos2d.h"
//using namespace cocos2d;
void Sabre::sabreinit(MonsterManager* monsterOne, Knight* knight, mapOperator* mapO) {
bindMonster(monsterOne);
bindHero(knight);
bindMonster(mapO);
}
void Sabre::bindMonster(mapOperator* mapO) {
map = mapO;
}
void Sabre::isLanched(int ... |
d5029fdc2162abaa4bb2f87e6cb841e9ce8f98fd | da4736f3715d88b7b2eec5728a7b847ec9ce8087 | sujayVittal/p4c | /frontends/p4/unusedDeclarations.cpp | C++ | cpp | 3,206 | permissive | /*
Copyright 2013-present Barefoot Networks, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in w... |
9719d98666815e4301fa04a684d6588e12187762 | 4c9bf0d19ab38e6ff90d1bbb4ec8f28ca926fc76 | adijunnarkar/AdiRepo | /lab2/test/lab2_skeleton/DynamicStack.cpp | C++ | cpp | 2,303 | no_license | #include "DynamicStack.hpp"
#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
typedef DynamicStack::StackItem StackItem; // for simplicity
const StackItem DynamicStack::EMPTY_STACK = -999;
DynamicStack::DynamicStack()
{
init_size_ = capacity_ = 16;
size_=0;
items_ = new StackItem[i... |
7a9b5957cca98e4f70ec389c8bbfe0e99dc2a7eb | 7c70247ab3b717155e9df6b1284eb97a16e99f4a | VictorGomes5/tpa | /soma.cpp | C++ | cpp | 480 | no_license | /*
Função: Somar dois números
Autor: Marcos Fajoli de Almeida
Autor: Victor Nathan Alves Gomes
Data de Criação: 25/09/2019
Data de Alteração: 25/09/2019
*/
#include <stdio.h>
#include <windows.h>
#include <locale.h>
int main(){
setlocale(LC_ALL, "");
int n1 = 0, n2 = 0, soma = 0;
printf("Informe um número inteiro:... |
26318a1cea0361ea895155fde63b2efe8a8e33f5 | e0cb6939bea2c42472d8533f0640b715e942013b | jorionwen/threadtest | /mutex/example2.cpp | C++ | cpp | 728 | no_license | // mutex::try_lock example
#include <iostream> // std::cout
#include <thread> // std::thread
#include <mutex> // std::mutex
volatile int counter (0); // non-atomic counter
std::mutex mtx; // locks access to counter
void attempt_10k_increases () {
for (int i=0; i<10000; ++i) {
... |
50a1b1ca7e1ad63ff99a453329fdb93178fbcb44 | 1074990a3d17270b8538bb67f82bc2b3c6ac52d2 | litao1009/SimpleRoom | /externals/OCCTLib/inc/Handle_MeshVS_SensitiveMesh.hxx | C++ | hxx | 822 | no_license | // This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _Handle_MeshVS_SensitiveMesh_HeaderFile
#de... |
6c155972b9eff55be810945249a1d146424ce489 | f15480677fdf76fdaae579fabb9972afe225ce1e | zugelii/QTProject | /helloQT/mainwindow.cpp | C++ | cpp | 514 | no_license | #include "mainwindow.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(this);
this->setMaximumWidth(541);
this->setMaximumHeight(260);
}
MainWindow::~MainWindow()
{
delete ui;
}
void MainWindow::on_pushButton_cl... |
baa514817622beb60d2e26ec711fee375388a5fc | b58d2a982971e0d86060df69a8e49c78ddf62009 | DRG-Modding/Header-Dumps | /Current/ABP_LootbugVictory_A_Skeleton.hpp | C++ | hpp | 486 | no_license | #ifndef UE4SS_SDK_ABP_LootbugVictory_A_Skeleton_HPP
#define UE4SS_SDK_ABP_LootbugVictory_A_Skeleton_HPP
class UABP_LootbugVictory_A_Skeleton_C : public UAnimInstance
{
FPointerToUberGraphFrame UberGraphFrame;
FAnimNode_Root AnimGraphNode_Root;
FAnimNode_Slot AnimGraphNode_Slot;
FAnimNode_SequenceEvalua... |
4878b334b65aaea3097181a77d54a05925d9ebc9 | 50537ad8358b9d2f5e79cff8e4c24e7d8baa9cd9 | adrianolls/ll | /Client/OwnerImeMgr.cpp | C++ | cpp | 8,871 | no_license | #include "stdafx.h"
#include "OwnerImeMgr.h"
#include "OwnerImeEvent.h"
#include "OwnerImeFrame.h"
OwnerImeMgr::OwnerImeMgr( void ):m_Trunk(this)
{
m_lpCandList = NULL;
}
OwnerImeMgr::~OwnerImeMgr( void )
{
}
OwnerImeMgr g_OwnerImeMgr;
OwnerImeMgr* OwnerImeMgr::Inst()
{
return &g_OwnerImeMgr;
}
void OwnerImeMgr:... |
c89a295c82e13cb7ddbc69321bfae29c14c23124 | b85177efec055c2672216571208ac6b719a41815 | DoubleDeez/SFML | /include/SFML/System/FileInputStream.hpp | C++ | hpp | 6,722 | permissive | ////////////////////////////////////////////////////////////
//
// SFML - Simple and Fast Multimedia Library
// Copyright (C) 2007-2023 Laurent Gomila (laurent@sfml-dev.org)
//
// This software is provided 'as-is', without any express or implied warranty.
// In no event will the authors be held liable for any damages a... |
5a64649286395928dda932c4fba35017efc805fc | 785fa807d69fe4ed168e7e26cd1e2c5b473a78ee | asleonova/cpp | /.history/A_20210315141246.hpp | C++ | hpp | 324 | no_license | #ifndef A_HPP
# define A_HPP
# include <iostream>
# include <string>
class A
{
public:
A();
A( A const & src );
~A();
A & operator=( A const & rhs );
private:
};
std::ostream & operator<<( std::ostream & o, A const & i );
#endif /* *************************************************************** A_... |
6f8532b3404b5efbd157dfb194d1395ff9ee9db7 | d0246ac7540fd0724d3de8917f3bbc9ded57ba98 | petru-d/leetcode-solutions-reboot | /tests/p93.cpp | C++ | cpp | 1,206 | no_license | #include "pch.h"
#include "../problems/p93.h"
TEST(p93, t0)
{
p93::Solution s;
auto result = s.restoreIpAddresses("25525511135");
std::vector<std::string> expected = {"255.255.11.135", "255.255.111.35"};
EXPECT_EQ(result, expected);
}
TEST(p93, t1)
{
p93::Solution s;
auto result = s.restore... |
8bed3a2d8876a3ac8bdccb0464cf2e0bee640703 | a81dfd96f267e7d50bc74d1664c414284732a7c8 | trarck/ue4lib | /Source/YHLib/Private/Tests/TestOverrideComponent.cpp | C++ | cpp | 850 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "TestOverrideComponent.h"
DEFINE_LOG_CATEGORY_STATIC(LogTestOverride, Log, All);
// Sets default values for this component's properties
UTestOverrideComponent::UTestOverrideComponent()
{
// Set this component to be initialized ... |
880b9bb875157939922b8ba425d7440c1acf8049 | be1887854eb18d8b3d296d8af1ead73edfabfd72 | alexandraback/datacollection | /solutions_2453486_0/C++/zellux/tic-tac-toe-tomek.cpp | C++ | cpp | 1,679 | no_license | #include <iostream>
bool winning_in_row(char *row, char player)
{
int t = 0;
for (int i = 0; i < 4; i++) {
if (row[i] == 'T')
t++;
else if (row[i] != player)
return false;
}
return t <= 1;
}
bool winning(char board[4][4], char player)
{
char row[4];
for ... |
94dca9df25de02aed642e790b077111824cf94da | 376d1188dd3a754244b7450fc6ad71817a14a5d9 | haekb/nolf2-modernizer | /libs/STLPort-4.0/test/regression/mismtch2.cpp | C++ | cpp | 1,166 | permissive | // STLport regression testsuite component.
// To compile as a separate example, please #define MAIN.
#include <algorithm>
#include <iostream>
#include <cstring>
#ifdef MAIN
#define mismtch2_test main
#endif
bool str_equal(const char* a_, const char* b_)
{
return ::strcmp(a_, b_) == 0 ? 1 : 0;
}
#if !defined (STLP... |
ca15e1a6efa67710d3a51cc7dce1ebbd45157fdc | 38263ac2df35a3b97873cf17479b2abf99c3008c | leikahing/hhvm | /hphp/runtime/base/autoload-handler.cpp | C++ | cpp | 13,263 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-present Facebook, Inc. (http://www.facebook.com) |
+---------... |
67397e00fc761b862748b1823f84e44981c58dbd | 9c3f03a37abcb4a4b9560c93f4bf6b0d08cb93d2 | Peterinor/Coding | /CC++/LowerLayer/IAP_Hex/IAP_Hex_0.3/sources/IAP_Hex_0.3.cpp | C++ | cpp | 900 | permissive | /*
********************************************************************
*Author :ty
*File :HexData.cpp
*Copyight :Copyight Reserved by ty
*Version :0.1
*Date :2011-4-4
*Describ :¶ÔHexÀàµÄ²âÊÔ³ÌÐò
********************************************************************
*/
#include"../includes/HexData.h"
string ... |
856515c5f2fd56a90f8e4a3a0ff3fece0b8ef536 | 4a4b610c7afe68e29a02c7aafb5739d179c4edb1 | seganx/old-engine | /version1.5/sxEngine/sxSystem/sxLog.cpp | C++ | cpp | 5,112 | no_license | #include "sxLog.h"
#include "sxFile.h"
#include <stdio.h>
#include <time.h>
const int LOG_MAX_SIZE = 1024 * 10;
//! class of logger. you can easily create a new one or point to exist one
class LoggerClass
{
public:
LoggerClass(UINT LM_ mode, HWND window, const WCHAR* filename )
{
_filestream = ... |
9b8463de0cc168c6bbfdd988bd6eade2e8ea12f3 | 4f812f682c1ba3a96d837ff4970e4cefd25e1636 | ccdxc/logSurvey | /data/crawl/wget/new_hunk_2055.cpp | C++ | cpp | 7,397 | no_license | "Ja hi ha un enllaç simbòlic correcte %s -> %s\n"
"\n"
#: src/ftp.c:1494
#, c-format
msgid "Creating symlink %s -> %s\n"
msgstr "S'està creant l'enllaç simbòlic %s -> %s\n"
#: src/ftp.c:1504
#, c-format
msgid "Symlinks not supported, skipping symlink `%s'.\n"
msgstr "No es suporten enllaços simbòlics; s'omet l'enllaç... |
1c13ffefd577fd62289940b8d02bdd69323c7cdb | b015ededea4669e66355eacdb4b63c5eea78ba8c | cosmikwolf/ArduinoLibraries | /Zetaohm_DAC8718/Zetaohm_DAC8718.cpp | C++ | cpp | 2,680 | no_license | #include <SPI.h>
#include <Zetaohm_DAC8718.h>
Zetaohm_DAC8718::Zetaohm_DAC8718() {
}
void Zetaohm_DAC8718::begin(uint8_t cs_pin, uint8_t ldac_pin) {
_cs_pin = cs_pin;
_ldac_pin = ldac_pin;
pinMode(_cs_pin, OUTPUT); // cs_pin is also the SYNC pin
pinMode(_ldac_pin, OUTPUT); ... |
985baf7677fbad3f65992419a3495642bae68bfd | 9ac2d4b8169627c4d4b2d9d03f03e81acebc80c5 | singalen/keyla | /win32xx/Dialog.cpp | C++ | cpp | 9,322 | permissive | // Win32++ Version 6.0
// Released: 4th March, 2008 by:
//
// David Nash
// email: dnash@bigpond.net.au
// url: http://users.bigpond.net.au/programming/
//
//
// Copyright (c) 2005-2008 David Nash
//
// Permission is hereby granted, free of charge, to
// any person obtaining a copy of this s... |
2bc301fc3773428137adf57df42583ba17b00686 | 3905fed938fc6f925b5299802d0a77afdc8f70f5 | Maisas/BrickGame | /Plugins/BrickGrid/Source/BrickGrid/Private/BrickRenderComponent.cpp | C++ | cpp | 20,882 | permissive | // Copyright 2014, Andrew Scheidecker. All Rights Reserved.
#include "BrickGridPluginPrivatePCH.h"
#include "BrickRenderComponent.h"
#include "BrickGridComponent.h"
#include "BrickAmbientOcclusion.inl"
// Maps brick corner indices to 3D coordinates.
static FInt3 GetCornerVertexOffset(uint8 BrickVertexIndex)
{
retur... |
9f18d9a9b5b6fc19c673b36e82b7560fb77d7ef6 | e17dca6eb3a4c3180541ae6052a9a5c22e972287 | connectthefuture/psdmrepo | /O2OTranslator/tags/V00-04-00/src/O2OXtcSrc.cpp | C++ | cpp | 2,709 | no_license | //--------------------------------------------------------------------------
// File and Version Information:
// $Id$
//
// Description:
// Class O2OXtcSrc...
//
// Author List:
// Andrei Salnikov
//
//------------------------------------------------------------------------
#include "Lusi/Lusi.h"
//-------------... |
5c8e3bc7f06ec8d13dbcab752c9db5592ca51c97 | ca51f65a8963e40acd601f292852bcaae61fdfbd | jesuscraf/peopletech | /cpp/m4dm/inc/usractaudit.hpp | C++ | hpp | 11,404 | no_license | //==============================================================================
//
// (c) Copyright 1991-2009 Meta Software M.S., S.A
// All rights reserved.
//
// Module: m4dm.dll
// File: usractaudit.hpp
// Project: CVM-DM
// Author: Meta Software M.S. , S.A
// Date: ... |
415d53d6921e4d19bfa36f64c05d8e40c11ca990 | b02a58dbd67a57807d1452922431f6ddc917ad84 | whosxavierwu/LeetCodeSolution | /leetcode_17/leetcode_17.cpp | C++ | cpp | 1,401 | no_license | // leetcode_17.cpp : This file contains the 'main' function. Program execution begins and ends there.
// https://leetcode.com/problems/letter-combinations-of-a-phone-number/
/*
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.
A mapping of dig... |
8c1614abe9c88cf00e45a775ef331cfd4dbcac7e | bcdf26734bf8ea347a3e8000b7a8666b4b01eca2 | russdaygh/SpaceshipsInSpace | /RLAudioManager.cpp | C++ | cpp | 9,465 | no_license | #include "StdAfx.h"
#include "RLAudioManager.h"
namespace RustyLib
{
namespace Audio
{
//Constant definitions
RLAudioManager RLAudioManager::_instance = RLAudioManager();
const std::string RLAudioManager::CONFIG_FILE = "config\\AudioProperties.cfg";
RLAudioManager::RLAudioManager(void):
pCurrentTrack(NU... |
596705c856ed9ea8e765f4eb0387ec9244a4d405 | 6e748dcb7b3d7e360a2d6784790d1db18a55c205 | inho9606/Leetcode | /Number_of_Boomerangs.cpp | C++ | cpp | 930 | no_license | // https://leetcode.com/problems/number-of-boomerangs/submissions/
// using map to store dists between each points. If there exists same distance between two points from the same point, then it means it can be a pair to reverse the order.
// time: O(n^2) space: O(n)
// Runtime: 380 ms, faster than 87.26% of C++ online ... |
2702b2914a66be170ae6969b1b9ec60a11183686 | 43b6b9c4cbbf081575e1da29a9fc5ba085d7a887 | haampie/arbor | /python/identifiers.cpp | C++ | cpp | 2,915 | permissive | #include <ostream>
#include <string>
#include <pybind11/pybind11.h>
#include <arbor/common_types.hpp>
#include "strprintf.hpp"
namespace pyarb {
using util::pprintf;
void register_identifiers(pybind11::module& m) {
using namespace pybind11::literals;
pybind11::class_<arb::cell_member_type> cell_member(m,... |
a0f38593d9e45c841aee273e309a1a577c228dec | 19cf0b1db2a8da33d0ef9b46983367a254d4ff56 | yair-k/Win2000SRC | /private/inet/urlmon/astg/astg.hxx | C++ | hxx | 1,949 | no_license | //+---------------------------------------------------------------------------
//
// Microsoft Windows
// Copyright (C) Microsoft Corporation, 1992 - 1994.
//
// File: astg.hxx
//
// Contents: Common header file for async docfiles
//
// Classes:
//
// Functions:
//
// History: 19-Dec-95 PhilipLa Created
//
//-... |
e9a3b981be69b61cbc938949157b8547a80a90c9 | 9d120c9097edc0ac2778ac0dc53a7a25c8dc86f2 | hhraymond/apple | /algorithm/codes/fig08_09.cpp | C++ | cpp | 218 | no_license | /**
* Perform a find.
* Error checks omitted again for simplicity.
* Return the set containing x.
*/
int DisjSets::find( int x ) const
{
if( s[ x ] < 0 )
return x;
else
return find( s[ x ] );
}
|
f80e78643636e4a80c02665e2e089dcdb2079a19 | 2b27ed281f9725ac50e38a8f278686a2fbab4ab8 | yamazaki-sensei/ari2 | /ari2/ari2/template.cpp | C++ | cpp | 233 | no_license | //
// template.cpp
// ari2
//
// Created by Hiraku Ohno on 2020/05/27.
// Copyright © 2020 hira. All rights reserved.
//
#include <stdio.h>
#include <algorithm>
#define max std::max
#define min std::min
#define sort std::sort
|
bfa28a14a847d8efe3859bd9a3aa7a55ec75820e | 13481d835ea9dea1a9a85195db826ee104746fca | TaIenT/C-_learning | /Chapter 10/stacker/stack.cpp | C++ | cpp | 480 | no_license | //
// Created by 10540 on 2021/4/19.
//
#include "stack.h"
Stack::Stack() {
top = 0;
}
bool Stack::isempty() const {
return top == 0;
}
bool Stack::isfull() const {
return top == MAX;
}
bool Stack::push(const Item &item) {
if (top < MAX){
items[top++] = item;
return true;
} else... |
a0356f413359ad1df8c053f8fb7b399b575ad230 | 0452a3a35f35916e683b978f3dfa98c4b6d90d82 | derekzhang79/2019MayACMCamp | /day4/segment.cpp | C++ | cpp | 858 | permissive | //
// Created by jal on 2019-05-04.
//
#include<bits/stdc++.h>
using namespace std;
const int N = 1000001;
int a[N];
int tree[4*N];
int n, m;
void build(int root, int l, int r){
if(l == r){
tree[root] = a[l];
return;
}
int mid = (l+r)>>1;
build(root<<1, l, mid);
build(root<<1|1, mi... |
409f6f3f578c9c8a3f4f68fa62f232d4b983fda6 | db9b0d03bcccd84c97bbd7c38c97e3bd3413832c | ledatelescope/bifrost | /src/utils.hpp | C++ | hpp | 16,383 | permissive | /*
* Copyright (c) 2016, The Bifrost Authors. All rights reserved.
* Copyright (c) 2016, NVIDIA CORPORATION. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* * Redistributions of source co... |
67645d5113c03d9fc6df768ceb6d8891d454efc5 | a4f0b408ced3e133c6cbcab3ac4460f5959e407b | aimwts/ai-tp | /TP/MIPI_RFFE_demo.cpp | C++ | cpp | 137,533 | no_license | //==============================================================================
// Title: MIPI_RFFE_demo.cpp
//
// Description: This demonstration/starting application utilizes one DPS12 board
// to simulate a 4 site program with a certain percentage of failures
// over 4 test function... |
884a1aaa03c82b447a3b9c3652e1305e972a8f8d | ed210c6dc8cdcd5d51d0112c10c9b3bc91fc3cad | rakhiagr/Leetcode-Questions-in-Cplusplus | /1165.cpp | C++ | cpp | 879 | no_license | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <stack>
#include <string>
#inc... |
a724dfa6bbb32dfb6f5935417c55179db9972c0b | d68af48c787277318a3f53e397e4d33eaa145698 | Yuuoniy/Leetcode | /csp/20141201.cpp | C++ | cpp | 345 | no_license |
/*
* @Author: yuuoniy
* @Date: 2019-05-16 15:37:04
* @Last Modified by: yuuoniy
* @Last Modified time: 2019-05-16 15:42:07
*/
#include <iostream>
#include <map>
using namespace std;
map<int,int> m;
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int t;
cin >> t;
cout << ++m[t] ... |
9dd55e53460836c1f569f70dabcf30023711036b | f56b6cfc0565e0836112e45492d8d8a0c31aa9a4 | pedromela/AVT | /Exercicse1/PerspectiveCamera.cpp | C++ | cpp | 1,770 | no_license | #include "PerspectiveCamera.h"
PerspectiveCamera::PerspectiveCamera(double fovy, double aspect, double zNear, double zFar) : Camera(zNear, zFar) {
_fovy = fovy;
_aspect = aspect;
setPosition(0, 0, 0);
}
PerspectiveCamera::~PerspectiveCamera() {}
void PerspectiveCamera::update(unsigned long delta) {
eye.set(car->g... |
1cde2eaca1532c18e73822c93508bb2be23e94c0 | e373e95c6789ce975e358cf3fcedbefedbf00f15 | z4122/leet | /112. Path Sum.cpp | C++ | cpp | 1,148 | no_license | 112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
Note: A leaf is a node with no children.
Example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ ... |
2ec859803560580c0cf3e77b2cc11d0ad2a0c1e0 | 491f986812d21bcc624ba151dd169dbf037d6692 | zhangguof/mkrkr | /src/plugins/layerExSave/compress.hpp | C++ | hpp | 4,926 | permissive | #ifndef _layerexsave_compress_hpp_
#define _layerexsave_compress_hpp_
#include "utils.hpp"
#include "win_def.h"
// #include "tjs.h"
// typedef TJS::tTJSBinaryStream IStream;
// extern TJS::tTJSBinaryStream * TVPCreateStream(const ttstr & _name, tjs_uint32 flags);
#include <vector>
typedef bool ProgressFun... |
75895df649d8231d76ea2c97faf3a69e74399c06 | 61b72d1bb5392b2fb8f7bb539cf7d454637dc4d2 | dsnlevi/storage-gateway | /src/test/control_client.cpp | C++ | cpp | 3,341 | no_license | #include <set>
#include <string>
#include <iostream>
//#include <boost/test/unit_test.hpp> // boost.test header
#include "../rpc/clients/control_client.hpp"
using namespace std;
//BOOST_AUTO_TEST_SUITE(control_client_test)
// BOOST_AUTO_TEST_CASE(case1){
int main(int argc, char** argv)
{
int ret = 0;
... |
184d8a5d0a70d0e500910ba7d040669107236023 | d4fdb746b09323fd376bca746361d476c58fb1a3 | AlexPham3011/DSA | /CPlusPlus/Permutation.cpp | C++ | cpp | 1,072 | no_license | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
void Permutation(string s, string out,vector<string> &v){
if(s.length() == 0){
// cout << out << "\n" ;
if ( find(v.begin(), v.end(), out) == v.end() ) // Not find out in vector
v.push_back(out);
}
for(int i = 0; i < s.length(); i++... |
8ee18464c16da6f27a2c0a35755038740fa367dc | 9fce71512cafd477a80752998cd05564f336d528 | przemyslawkrajewski/DCL_RubikCube | /src/Components/DualCanny/DualCanny.hpp | C++ | hpp | 1,808 | no_license | /*!
* \file
* \brief
* \author Przemo,,,
*/
#ifndef DUALCANNY_HPP_
#define DUALCANNY_HPP_
#include "Component_Aux.hpp"
#include "Component.hpp"
#include "DataStream.hpp"
#include "Property.hpp"
#include "EventHandler2.hpp"
#include <opencv2/core/core.hpp>
#include <opencv2/imgproc/imgproc.hpp>
namespace Proces... |
b29c5a477ed715c6f065e97b98fc27dc5c7d133d | ab8e576641b22dd92ded3de49ddb595f9efd1b52 | adrianolls/ll | /Client/FairyTrainFrame.cpp | C++ | cpp | 9,396 | no_license | #include "StdAfx.h"
#include "NPC.h"
#include "Role.h"
#include "RoleMgr.h"
#include "ItemMgr.h"
#include "Container.h"
#include "IconStatic.h"
#include "ToolTipFrame.h"
#include "CombatSysUtil.h"
#include "ToolTipCreator.h"
#include "FairyTrainFrame.h"
#include "../WorldDefine/msg_combat.h"
#include "GUIEffectMgr.h"
#... |
260663b929c9a37661c1b84e51385f9bcce54f53 | cf5329ad284ee3c90f9075d30c4a970931e38648 | inglada/OTB | /Testing/Code/SARPolarimetry/otbReciprocalCoherencyToReciprocalMuellerImageFilter.cxx | C++ | cxx | 1,799 | no_license | /*=========================================================================
Program: ORFEO Toolbox
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.
See OTBCopyright.txt for details.
This software is distributed WITHOUT ... |
6d8572f477e9208fe3f1381ca079879668bd45ae | 8b3e4ba25dfa279f73754f1a1620d3e3c9d82b61 | ssh352/MyToolBox | /Pracise/MyToolBoxTestCase/asioTestFile.cpp | C++ | cpp | 5,902 | no_license | #include "stdafx.h"
#include <iostream>
#include <boost\asio.hpp>
#include <boost/date_time/posix_time/posix_time.hpp>
#include <boost/thread.hpp>
#include <boost\bind.hpp>
#include <boost\shared_ptr.hpp>
#include <boost\foreach.hpp>
#include <functional>
class printer
{
public:
printer(boost::asio::io_service& io)... |
fd4dbdaaf3ea4949cecbc0ebd215e30bdb167235 | c3e879d8163631bcf1c73544c14dca8d4340d890 | romz-pl/crupp-btree | /tests/unita/upscaledb.cpp | C++ | cpp | 74,599 | permissive | /*
* Copyright (C) 2005-2017 Christoph Rupp (chris@crupp.de).
*
* 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 ... |
b1cadac74eb66a3707d217a3b9e0e1c82cad1814 | e62764e640916933d8a9f2296a1e693eaa358184 | JACK0YORK/Data-Structures-and-Algorithms | /Lab_7/c/Heap.cpp | C++ | cpp | 5,453 | no_license | #include <cstddef>
#include <iostream>
#include "array_tree_draw.h"
template <typename T>
class MaxHeap {
// Instance Variables
T** heap = nullptr;
size_t length = 0;
int last = -1;
// Private Static Methods
template <typename E>
static size_t root();
template <typename E>
stati... |
8d6eebb9676d2dc942da10f88a19724e7454ce53 | 0b131dca888df07258255e80fb16d7c3f144bfcd | RealityWarper/reflexivelos | /seperate/structure.cpp | C++ | cpp | 2,448 | no_license | #include "maze.h"
int mov[PL][8], rotor[PL][8], pl = 1; // rotor is for cycles which leave you rotated, pl is number of places
bool mirror[PL][8]; // does the connection reverse chirality?
// 0 is down, 1 is down-right, 2 is right, 3 is right-up, etc: rotating is adding and mirroring is subtracting
int trans[9] = {7,... |
be9baa4ead3ac29a768c3d2b28b1fc0b9299b4b3 | a69b2bee5103fd225edc263080b1aeff0a967dd0 | sebuaa2020/Team103 | /code/navigation相关/navigation.cpp | C++ | cpp | 4,703 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fstream>
#include <iostream>
#include<sys/types.h>
#include<signal.h>
#include<cstring>
#include<sstream>
#define map_png "/home/user/catkin_ws/src/wpb_home/wpb_home_tutorials/maps/map.pgm"
#define map_yaml "/home/user/catkin_ws/src/wpb_home/wpb_home_... |
2d8f633047a78a2ccf428b6282c768ce3e8b06cb | dde72ebb1016617689ae2fdeb16ecdffe048a7db | zhaoyw1999/arithmetic-interpreter | /test/ParserTest.cc | C++ | cc | 1,729 | no_license | #include "../src/Parser.h"
#include "../src/Parser.cc"
#include "../src/Exception.h"
#include "../src/Exception.cc"
#include "../src/Tokenizer.h"
#include "../src/Tokenizer.cc"
#include <algorithm>
using std::string;
using std::cout;
using std::cin;
using std::endl;
using std::reverse;
int main() {
string s;
... |
a9378b0efcd07cffc47e34d830ab2bdb061efff4 | f90fcbaa7add457bc6c45b9151eaf7499a6ae859 | cenut/ilcoin-master | /src/compressor.cpp | C++ | cpp | 5,046 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Ilcoin Core developers
// All Rights Reserved. Ilgamos International 2017©
#include "compressor.h"
#include "hash.h"
#include "pubkey.h"
#include "script/standard.h"
bool CScriptCompressor::IsToKeyID(CKeyID &hash) const
{
if (script.size(... |
3311482ba937fe19b6b9e5ae368b890a87cd0915 | f3c12b5d66d73fef73ffcbb10a0296efb1d303ad | NCAR/lrose-solo3 | /editor/se_BB_unfold.hh | C++ | hh | 595 | permissive | /* created using cproto */
/* Fri Jul 15 20:57:39 UTC 2011*/
#ifndef se_BB_unfold_hh
#define se_BB_unfold_hh
#include <vector>
#include <UiCommandToken.hh>
#ifdef USE_RADX
#else
extern int se_BB_setup(const std::vector< UiCommandToken > &cmd_tokens);
extern int se_BB_ac_unfold(const std::vector< UiCommandToken > &c... |
17e3204696fefe24ab7746d125ffac3d564d3033 | 703367aa9012fbd39527b1969be854c27e4e03f9 | ashutosh0gupta/llvm_bmc | /examples/litmus/c/run-scripts/tmp_10/W+RW+RW+RW+poal+dmb.sy+poal+L.c.cbmc_out.cpp | C++ | cpp | 61,184 | no_license | // Global variabls:
// 0:vars:3
// 3:atom_1_X0_2:1
// 4:atom_2_X0_1:1
// 5:atom_3_X0_1:1
// Local global variabls:
// 0:thr0:1
// 1:thr1:1
// 2:thr2:1
// 3:thr3:1
#define ADDRSIZE 6
#define LOCALADDRSIZE 4
#define NTHREAD 5
#define NCONTEXT 10
#define ASSUME(stmt) __CPROVER_assume(stmt)
#define ASSERT(stmt) __CPROVER_... |
e659532499c1a82a64461ab0511a41919f9f59f7 | 99e23eedc67371b16ef7694ffc6e2e002f68dbdc | leandrokanis/ppc | /uri_iniciante/2_fibonacci_rapido.cpp | C++ | cpp | 345 | no_license | // 2_fibonacci_rapido
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
double calculate_fibonacci(int num){
double result=0;
result = ( pow(((1+sqrt(5))/2.), num) - pow(((1-sqrt(5))/2.), num) )/(sqrt(5));
return result;
}
int main() {
int num=0;
cin >> num;
printf("%.1f\n", calculate_fibona... |
0697ec6d1f82f559a5f1aa3a8b1d4e406311e44e | d12edee09d6d07a567fdb7dea1b7a7194362f569 | rikMath/extracao_z | /projeto/src/robotArray.cpp | C++ | cpp | 1,132 | no_license | #include "../include/robotArray.hpp"
#include "../include/robot.hpp"
#include "../include/map.hpp"
RobotArray::RobotArray() {
for (int i=0; i<50; i++) {
robots[i] = new Robot(i);
}
}
RobotArray::~RobotArray() {
for (int i=0; i<50; i++) {
delete robots[i];
}
}
int RobotArray::return_resources_to_bas... |
2eac8a8186e767a8100dbd1616c9469277a304fe | ea3d1067b55571ebc72101a1d3be62cf6bb067fc | Yosuke-Onitsuka/TSL2561-Armadillo-Library | /TSL2561.cpp | C++ | cpp | 7,822 | no_license | /**************************************************************************/
/*!
@file tsl2561.c
@author K. Townsend (microBuilder.eu / adafruit.com)
@section LICENSE
Software License Agreement (BSD License)
Copyright (c) 2010, microBuilder SARL, Adafruit Industries
All rights reserved... |
464a3817dcb32ea7a772b8f4df37fbbd79345cb1 | b54e8ac68cc4d1753f79eda79481ac98598d449d | adityabhopale95/COTSON_Simulator_multinode | /cotson/src/abaeterno/test.unit/test_cache_hierarchy.cpp | C++ | cpp | 15,005 | permissive | // (C Copyright 2006-2009 Hewlett-Packard Development Company, L.P.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR CO... |
2c671a204c2964d621e80f5fbb1616477f0accfc | e769629908991f072118f90750bfe1c628229eea | KyleLotilla/PROSDEV-HANGMAN | /src/Oxygen.cpp | C++ | cpp | 300 | no_license | #include "Oxygen.h"
Oxygen::Oxygen()
{
}
void Oxygen::depleteOxygen()
{
this->curOxygen = this->curOxygen - 1;
}
int Oxygen::getCurrentOxygen()
{
return this->curOxygen;
}
bool Oxygen::hasOxygen()
{
if (this->curOxygen == 0) {
return false;
}
else
return true;
}
Oxygen::~Oxygen()
{
} |
cb494246bf8f5c033408e69da40ddf4252073af4 | dc5df3b072b3e3ac0525d65d037d2a532f01bc10 | ByrMucahit/C | /C/Stack/Films.cpp | C++ | cpp | 4,039 | no_license | #include<stdio.h>
#include<stdlib.h>
typedef struct inputStack{
struct inputStack *next;
int top=-1 ;
char film[100];
float puan;
}input;
input *iter=NULL;
typedef struct tmpStack{
struct tempStack *next;
int top_temp;
int member_temp[100];
}tmp;
void Ekle(float puan , char fi... |
b58a7d29fd3365b9368a1183cc49b063dd34b78e | a6256d52f8b4a41a5b57082e89af3cd7963b09b9 | cegui/cegui | /samples/SampleTemplate.cpp | C++ | cpp | 2,681 | permissive | /***********************************************************************
created: 20/5/2008
author: name <email>
*************************************************************************/
/***************************************************************************
* Copyright (C) 2004 - 2014 Paul D Tu... |
838c12594467b358d0df7cdf3c1cc892e7409036 | c581d77635778d3ec0080564d8c5961cf65224c8 | saif2say/Seneca-CPP | /OOP345/Labs/lab3/Text.cpp | C++ | cpp | 1,858 | no_license | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <string>
#include "Text.h"
using namespace std;
namespace w3 {
Text::~Text() {
if (lineTable) {
delete[] lineTable;
}
}
Text::Text(const char* filename) : lineCount(0), lineTable(nullptr) {
... |
975b1fe11e3b5608988a2812f170a02ac92df83e | 0c630f6ab0e3f91d34cdbb57aff9993a768cc4ef | xph906/TrackingFree | /src/chrome/browser/web_applications/web_app_win.cc | C++ | cc | 21,861 | 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 "chrome/browser/web_applications/web_app_win.h"
#include <shlobj.h>
#include "base/command_line.h"
#include "base/file_util.h"
#include "ba... |
38aca0b5f46b04b05d79b035850155d0cf205890 | 41925e477112a5ce79872b76af1f6cd512fc14ed | leoleoasd/oi | /lg/1101.cpp | C++ | cpp | 1,836 | no_license | #include <iostream>
using namespace std;
#define MAXN 105
int n = 0;
string datas[MAXN];
string target = "yizhong";
int visiable[MAXN][MAXN] = {0};
int directions[8][2] = {
{0,1},
{1,1},
{1,0},
{1,-1},
{0,-1},
{-1,-1},
{-1,0},
{-1,1},
};
void dfs(int i,int j,int pos,int di){
//... |
354fc043d2b072279900f4775ffd94772988f5cf | 7c5820e2812f22933fb63835c96b2bb8ed6f7c17 | liang47009/chromium | /ui/views/mus/desktop_window_tree_host_mus.cc | C++ | cc | 35,666 | 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 "ui/views/mus/desktop_window_tree_host_mus.h"
#include "base/run_loop.h"
#include "base/threading/thread_task_runner_handle.h"
#include "ui/aura... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.