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 |
|---|---|---|---|---|---|---|---|---|
da5fb7dda3229c7581fe0eec4c6b578d93fd339a | 7d1b0cafe7854ca08f1bfc458ac3c4f677ebcd62 | hulppo/t3hw | /src/SynchronizedObject.cpp | C++ | cpp | 410 | no_license | #include "SynchronizedObject.h"
SynchronizedObject::SynchronizedObject()
{
mId = 0;
mRefCount = 0;
}
void
SynchronizedObject::setMapId(long id)
{
mId = id;
}
long
SynchronizedObject::getMapId()
{
return mId;
}
void
SynchronizedObject::incReference()
{
++mRefCount;
}
void
SynchronizedObject::decReference(... |
b32893c9c94b9e88c27001bfc02ae85a66bc4d17 | c84272363a9e49e0dad9c8a8c3ecb00642faaac4 | Project-OSRM/osrm-backend | /src/extractor/intersection/coordinate_extractor.cpp | C++ | cpp | 53,393 | permissive | #include "extractor/intersection/coordinate_extractor.hpp"
#include "extractor/intersection/constants.hpp"
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <numeric>
#include <tuple>
#include <utility>
#include "util/bearing.hpp"
#include "util/coordinate_calculation.hpp"
namespace osrm::extractor... |
e840c0169e51dc4c61d6ba5fffbc6e672df5f104 | 160da1d821421218a980296cbd851bc5e4efcd81 | warunanc/loqt | /lqUty/RowColIndicators.cpp | C++ | cpp | 2,205 | no_license | /*
lqUty : loqt utilities
Author : Carlo Capelli
E-mail : cc.carlo.cap@gmail.com
Copyright (C): 2013,2014,2015,2016
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free S... |
f9c1af763a9344f232a9ead795c16eed0a937ed0 | 0cbff30ba6898f48d3ebc1e395b3b6904fc656cc | Wang-Yujie0905/caculator | /calculator.cpp | C++ | cpp | 35,489 | no_license | #include <QtWidgets>
#include <cmath>
#include "button.h"
#include "calculator.h"
//! [0]
Calculator::Calculator(QWidget *parent)
: QWidget(parent)
{
sumInMemory = 0.0;
sumSoFar = 0.0;
factorSoFar = 0.0;
waitingForOperand = true;
flag=1;
flag2=1;
zhuan=1;
zhuan... |
243edcbaf952dfd664e0b11b2da0f516f6f46414 | 69ae4ff5453d6b70d5b258a1cae36f8ecb815860 | YeongjinOh/Algorithm-practice | /LeetCode/Medium/117.Populating_Next_Right_Pointers_in_Each_Node_II/main.cpp | C++ | cpp | 2,203 | no_license | /**
* Definition for binary tree with next pointer.
* struct TreeLinkNode {
* int val;
* TreeLinkNode *left, *right, *next;
* TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
///////////////////////////////////////////
// Solution 1) BFS... |
b3dda53a2c1b2f7fbece20c06a30175310411278 | 040e454a26591043bdf2395e4d89255de300f24e | xxjapp/ANSIColorTest | /ANSIColorTest.cpp | C++ | cpp | 1,557 | no_license | #include <iostream>
#include "ccolor.h"
using namespace std;
int main()
{
cout << zkr::cc::fore::black << "This is black text. " << endl;
cout << zkr::cc::fore::blue << "This is blue text. " << endl;
cout << zkr::cc::fore::red << "This is red text. " ... |
8c6d64c6a5966f0927339c22540af47e76e1bbef | d08afa7dc2bad76d897ae53a9947b0d706c0252a | andy-ywzq/WebKitGL2D | /Source/WebKit2/WebProcess/InjectedBundle/InjectedBundle.cpp | C++ | cpp | 28,657 | no_license | /*
* Copyright (C) 2010, 2013 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of condit... |
20778797df91a38aa0d2b729c2559df4285d300d | 7a265e6f556bce2dfd01c0dd77b4cfd75585127a | matbut/Algorithms-And-Data-Structures | /3-Graphs/3-Eulerian-Cycle/3.3-EulerianCycle(Matrix).cpp | C++ | cpp | 1,889 | no_license | #include <iostream>
#include <cstdlib>
#include <ctime>
#include <windows.h>
#include <conio.h>
#include <queue>
#include <stack>
const int N=6;
const int ACTIVE=14;
const int VISITED=8; //153; //mielizna
const int NORMAL=7;
using namespace std;
void Color(int c);
void PrintColor();
void PrintGraph(int graph[N][N]);... |
8d050981d7e12f89bb74d33fc2ca36e675c7ffef | 8b64ca9dc4ad58f7496431d0eff219147864c84e | Cyberalex13/catboost | /contrib/libs/protobuf/python/google/protobuf/pyext/descriptor_pool.cc | C++ | cc | 24,164 | permissive | // Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// ... |
dc9a7c2ffcacead5804efaedb644aa8b4e95c7f9 | a02b24808f0ebb04718dee09a47bac082dbc35d0 | cKohl10/miniGit | /miniGit.hpp | C++ | hpp | 843 | no_license | #ifndef MINIGIT_H
#define MINIGIT_H
#include <iostream>
#include <filesystem>
#include <fstream>
#include <string>
using namespace std;
namespace fs = filesystem;
struct singlyNode{
string fileName;
string fileVersion; // Name of file in .minigit folder
singlyNode * next;
};
struct doublyNode
{
strin... |
a1f0d10e139310462d9853ba8aeffbf07533f424 | ea63a0e8d6e3f7b5a80b78aff2d7fa6631756c4e | NovaEric/ENova_Cplusplus | /Retirement_A2.cpp | C++ | cpp | 1,500 | no_license | #include<iostream>
#include<iomanip>
using namespace std;
float tax_rate(char county)
{
float rate ;
if (county == 'C')
rate = .10f;
else if (county == 'D')
rate = .09f;
else if (county == 'M')
rate = .08f;
else if (county == 'K')
rate = .07f;
return rate;
}
float... |
88f460356ce807a010918bc910b9c95477de6976 | 9c8a6770854628380e0fc88e2e79d231cde942d1 | atolab/opensplice | /src/api/dcps/c++/common/code/Publisher.cpp | C++ | cpp | 25,943 | permissive | /*
* OpenSplice DDS
*
* This software and documentation are Copyright 2006 to TO_YEAR PrismTech
* Limited, its affiliated companies and licensors. All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in complia... |
d0bf1b4a0b0244e331b635f7f281b845986b2987 | f26ecb487bd548c5e874d62f88b7c2db1446c8b9 | alexanderfs/acm | /uvaoj-11636.cpp | C++ | cpp | 361 | no_license | #include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("test_input.txt");
cin.rdbuf(in.rdbuf());
int num;
int i = 1;
cin >> num;
while(num > 0) {
int count = 0;
int val = 1;
while(val < num) {
val <<= 1;
count++;
}
cout << "Case " << i << ": " << count << end... |
fdb2f8e01a31bd7b4c47074c502a24122f2b2c2e | ad9bc5e593cf71eb2e5d9120e29be676cbd51972 | sfeuerriegel/ResearchGroupTools | /src/cumulative_functions.cpp | C++ | cpp | 2,923 | permissive | #include <Rcpp.h>
using namespace Rcpp;
// This is a simple example of exporting a C++ function to R. You can
// source this function into an R session using the Rcpp::sourceCpp
// function (or via the Source button on the editor toolbar). Learn
// more about Rcpp at:
//
// http://www.rcpp.org/
// http://adv-r.had... |
7daf4cd1d02898cff6578bf1ce308d464dde67d7 | 14287c11a1904e7e34ca0f34abec8a8ed26ad7b3 | nikhil-seth/LeetCode | /347. Top K Frequent Elements.cpp | C++ | cpp | 643 | no_license | // 347. Top K Frequent Elements
class Solution {
public:
vector<int> topKFrequent(vector<int>& nums, int k){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
unordered_map<int,int> m;
vector<int> ans;
vector<vector<int>> bucket(nums.size()+1);
for(auto c:nums)
... |
fc36b3e2a29870769a98eb4ffe4ef942262c08f4 | 3736e612ccacf5136e50cc2f40cb893aa47c1d8e | imistyrain/EasyPR-Swift | /EasyPR-Swift/src/core/plate_recognize.cpp | C++ | cpp | 2,948 | no_license | #include "easypr/core/plate_recognize.h"
#include "easypr/config.h"
#include "thirdparty/textDetect/erfilter.hpp"
namespace easypr {
CPlateRecognize::CPlateRecognize() {
m_showResult = false;
}
// main method, plate recognize, contain two parts
// 1. plate detect
// 2. chars recognize
int CPlateRecognize::plateR... |
6ff1fe6941e7aaa116c6ffa49edd19e35e6d1ac1 | 06fc806f3fc85545dc8ff62c05e79f98d4bdeb8f | Ambyjkl/chromium | /content/browser/web_package/web_bundle_reader.cc | C++ | cc | 11,201 | 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 "content/browser/web_package/web_bundle_reader.h"
#include <limits>
#include "base/logging.h"
#include "base/numerics/safe_math.h"
#include "ba... |
3d322b16846cebe2005b029bb4a9e368f8b1d9f6 | c15f05a054eef18ef3d98ca1ccff722282a7aa47 | tantan5678999/github2 | /baitap/b8/Source.cpp | C++ | cpp | 364 | no_license | #include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(int argc, char* argv[])
{
cout << fixed;
cout << setprecision(10);
int N, i;
float S;
S = 0;
do
{
cout << "nhap so N : ";
cin >> N;
} while (N <= 0);
for (i = 1; i <= N; i++)
{
S = S + 1/(2*(float)i);
}
cout << "S = " ... |
9903aa98034846e85a0d969092ab172fc331e119 | 81dce23a21083662b51d4b10e241ee490aa0cc73 | heqile/QT | /minimal/main.cpp | C++ | cpp | 207 | no_license | #include <QApplication>
#include <QLabel>
int main(int argc, char *argv[])
{
QApplication app(argc,argv);
QLabel *label = new QLabel ("Hello_world");
label->show();
return app.exec();
}
|
005723ae2ca9b5d8043fbbdac3b70a64cfef0a90 | 1c10d6054760e3bdd5d7d339a2da5bb50faabe45 | MichaelG824/mrjk-webserver | /tests/response_test.cc | C++ | cc | 3,039 | no_license | #include "gtest/gtest.h"
#include "header.h"
#include "request.h"
#include "request_parser.h"
#include "request_handler.h"
#include "response.h"
#include "string"
#include "session.h"
class ResponseTest : public ::testing::Test {
protected:
// The response to be sent back to the client.
Response res... |
c755e03a0d45b10a785902fd09cc17641869ea11 | a2abccad0d838b57853adfc4de84daa6926b0266 | ManDeJan/TCTI-V1OOPC-15-BASE | /15-02-private/line.cpp | C++ | cpp | 1,702 | no_license | // example:
// definition of the functions of a line class
// you are not expected to understand how line::print works
#include "line.hpp"
// avoid these because <algorithm> imports iostream stuff
template <class T> void swap( T& a, T& b ){
T c(a); a=b; b=c;
}
void line::draw(){
const int width = 1;
... |
2b0aaf54936e39c80ff6fb5f63e082701d2df49f | 979076bdd3c868cb369606b2538705bf800a9b80 | wangfuli217/ld_note | /cheatsheet/ops_doc-master/Service/misc/demo_pthread_example/pthread_cleanup.cpp | C++ | cpp | 1,797 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <string.h>
void cleanup(void *arg){
printf("cleanup: %s\n",(char *)arg);
}
void *thr_fn1(void *arg) {
printf("thread 1 start\n");
pthread_cleanup_push(cleanup, (void *)"thread 1 first handler");
pthread_cleanup_push(cleanup, (void *... |
11f30ac88f03eb3ae7120e29971546899c77da22 | f82277f5f2343847b09b47f5517f011d20a53e0b | Revan-TheCreater/Darkhan-Ilyas-IT1911 | /IT 1911 Darkhan Ilyas/N65.cpp | C++ | cpp | 323 | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,a1,a2,a3,a4,ar[4];
cin>>a;
a1 = a/1000;
a2=(a%1000)/100;
a3=a%100/10;
a4=a%10;
ar[0]=a1;
ar[1]=a2;
ar[2]=a3;
ar[3]=a4;
for(int i = 0; i<4;i++){
if(ar[i]<5){
cout<<ar[i];
}
}for(int i = 0; i<4;i++){
if(ar[i]>=5){
cout<<ar[i];
}
}
... |
726a0a53f8b0d1fccfa7ebdc729f43a8a5ac5208 | 742d0e9725e1a803f0a747c304612afa99e84267 | anandaditya444/LEETCODE | /LemonadeChange.cpp | C++ | cpp | 805 | no_license | //Q. 860
class Solution {
public:
bool lemonadeChange(vector<int>& bills) {
int five = 0,ten = 0,twenty = 0;
for(int i=0;i<bills.size();i++)
{
if(bills[i] == 5)
five++;
else if(bills[i] == 10)
{
ten++;
... |
0277638fe19d8c257b489187b6f100cbf6cfe3f8 | 4179058350c199458697ec4e217d3df2c20bc083 | niuxu18/logTracker-old | /second/download/httpd/gumtree/httpd_patch_hunk_818.cpp | C++ | cpp | 1,008 | no_license | }
}
return rc;
}
-/* Open the error log for the given server_rec. If IS_MAIN is
- * non-zero, s is the main server. */
-static int open_error_log(server_rec *s, int is_main, apr_pool_t *p)
+static int open_error_log(server_rec *s, apr_pool_t *p)
{
const char *fname;
int rc;
if... |
59e59e2ff074076a8f6a28a29f7d0e401ce24877 | d5ba4b65fee17f108a72d7820e1dbf1ffd2d0643 | apache/openoffice | /main/reportdesign/source/core/sdr/formatnormalizer.hxx | C++ | hxx | 3,543 | permissive | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... |
32101bef8dd87ba8b197687317308142d2800b93 | 7e0fa26379894fd543fa71491c19804b01ba5ccf | ashr/notes | /funcs/inv.cpp | C++ | cpp | 2,341 | permissive | // address: 0x41B814
//
// inv_cleanup releases the resources used by the inventory.
void inv_cleanup();
// address: 0x41B826
//
// inv_load_graphics loads the inventory graphics of the active player class.
void inv_load_graphics();
// address: 0x41B871
//
// TODO: add documentation.
// address: 0x41B8C4
//
// inv_d... |
8ca1933880ea16b1b56ac186caf4a3adb048eede | a0536a7edb0f2952e9baf3e1709ab67b9138ee9e | alexander-smoktal/libpbnjson | /src/pbnjson_cxx/JParser.cpp | C++ | cpp | 8,026 | permissive | /* @@@LICENSE
*
* Copyright (c) 2012-2014 LG Electronics, 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 appli... |
d79a65ee24a5350cb3b4e3e7ed7f519aceff4b83 | 2268b5c1eac81c5f0dccca6ff978d05455634121 | asarra/University-n-school-projects-experiences | /UOS-C++/Boids/src/vectorTools.cpp | C++ | cpp | 951 | no_license | //
// vectorTools.cpp
// boids_v2
//
// Created by Tim-Luca on 02.12.19.
//
#include "vectorTools.hpp"
#include <vector>
#include <math.h>
using namespace std;
// Umsetzung der Vektor-Normalisierung
vector<float> normalize(float a, float b, float maxValue) {
if(a != 0 || b != 0) {
float distance = sq... |
b164678ba8ac3d7e7b5dfbdef8885da08c8f0512 | 69c43561e4ddb467b44cf367bf66bdf40494b2e3 | JayDown/chrono | /src/demos/gpu/demo_GPU_ballcosim.cpp | C++ | cpp | 10,368 | permissive | // =============================================================================
// PROJECT CHRONO - http://projectchrono.org
//
// Copyright (c) 2019 projectchrono.org
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be found
// in the LICENSE file at the top level of t... |
99a25dacabe0ae1123677ab3e695157dfdaf982e | 0c87ce1b0348320d6a1d5cbc59f041e9187679d8 | closekn/procon | /AtCoder/company/AISing/2020/D/D.cpp | C++ | cpp | 1,476 | no_license | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string x;
cin >> n;
cin >> x;
vector<int> dp(200001, 0);
for ( int i = 1; i <= 200000; i++ ) {
dp[i] = dp[i % __builtin_popcount(i)] + 1;
}
int popct = count(x.begin(), x.end(), '1');
// xi=1->0 のときの各桁の10進での大きさ rem mod (popct-1)... |
04e9416759bc853d1f1bfb46f7d037e469dd7330 | 742333cf60fda14258b644dcea5fdd1b31b9a22c | FlipskiZ/TDZSG---Ludum-Dare-31 | /ParticleEntity.cpp | C++ | cpp | 2,676 | no_license | #include "Engine.h"
#include "ParticleEntity.h"
ParticleEntity::ParticleEntity(){
this->duration = 0;
this->drag = 0;
this->movementSpeed = 0;
this->deltaX = 0;
this->deltaY = 0;
this->value1 = 0;
this->random = rand();
this->colX = false;
this->colY = false;
this->creationTime ... |
3350e48c69455b288edc9e1baab7d4314adae9e3 | be3de0fe1ebdb70611360c2094c7401ce29003a7 | stissoni/batalla-elementos | /menu.cpp | C++ | cpp | 7,065 | no_license | #include "menu.h"
Menu::Menu() {
personajes = 0;
esta_activo = false;
}
/*Menu::~Menu() {
while(!personajes->vacio()) {
Personaje* eliminado = personajes->baja();
delete eliminado;
}
delete personajes;
}*/
Menu::~Menu() {}
void Menu::cargar_personajes(string archivo) {
person... |
2fa5e32acca6564c78d0a80aaf298bc9961c3fc6 | 9bbe13cf7b76162faa6f8b1d5920a595fd1ee557 | Lugdunum3D/Lugdunum | /src/lug/Graphics/Vulkan/Requirements/Requirements.hpp | C++ | hpp | 3,012 | permissive | #pragma once
#define LUG_VULKAN_PHYSICAL_DEVICE_FEATURES(macro) \
macro(robustBufferAccess) \
macro(fullDrawIndexUint32) \
macro(imageCubeArray) \
macro(independentBlend) \
macro(geometryShader) ... |
b0c1b115a25084fd580007d4d442403502439b54 | d4bdc9ef6be874db9ab3d23218de223d89247c7d | SELF-C/QtWidgetApplicationExsample | /glwidget/qvector/glwidget_2_0.cpp | C++ | cpp | 3,870 | no_license | #include "glwidget_2_0.h"
GLWidget_2_0::GLWidget_2_0(QWidget *parent) : QGLWidget(QGLFormat(QGL::SampleBuffers), parent)
{
parent->installEventFilter(this);
}
void GLWidget_2_0::initializeGL()
{
initializeOpenGLFunctions();
//shader init
m_shader = ShaderProgram().addShaderFromSourceFile(":/shader/s... |
41898d2b920464ce2a50440df7c39c480f1e38f5 | ef155cbe1ce680971bf20f0903426e8a8f5a8119 | BLGALEX/fog-chess-back-end | /engine/Chessboard.cpp | C++ | cpp | 5,000 | no_license | #include "Chessboard.h"
#include <sstream>
#include <set>
std::set<char> figures = {'p', 'r', 'n', 'b', 'q', 'k', 'P', 'R', 'N', 'B', 'Q', 'K'};
/**
* Парсинг доски из нотации Форсайта - Эдвардса (смотри вики)
* При некорректных данных программа может завершиться аварийно!
*/
Chessboard::Chessboard(const std::st... |
e46f2bdbabaa1d3bf02977487415a55e071b83be | 79886893b628031a4c64e03c955e8f29553676b5 | fiskercui/testcommon | /third/boost/boost/mpl/replace_if.hpp | C++ | hpp | 1,904 | permissive |
#ifndef BOOST_MPL_REPLACE_IF_HPP_INCLUDED
#define BOOST_MPL_REPLACE_IF_HPP_INCLUDED
// Copyright Aleksey Gurtovoy 2000-2004
// Copyright John R. Bandela 2000-2002
// Copyright David Abrahams 2003-2004
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy a... |
7ef15d518a4e2afe8a0064b14f95770da38f6e41 | 64a5853962f3cef1e3d79e793ba383f36266f79d | stevenbell/classwork13_autograder | /cpp_test_wrappers/test_fail_during_append.cpp | C++ | cpp | 1,269 | no_license | // Implement a version of `new` that fails on command
// Based on https://stackoverflow.com/questions/1923664/simulating-low-memory-using-c
#include <cstdlib>
#include <iostream>
#include "array.h"
// Global flag that sets whether or not `new` will fail
bool memoryAllocFail = false; // Succeed by default
// Custom im... |
dab9923aa9015ecb70ce066c457e7834481aa7b5 | 35d413f3dd6bc315f7fe9ea59b5cf72043d2edb0 | wuyuhang422/My-OI-Code | /CF/1342B.cpp | C++ | cpp | 754 | no_license | #include <bits/stdc++.h>
#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;+... |
f79ef67326988033080a3197f68a9f2ea4ba9288 | 465786a0adf3a53a4ab3b0422038530124332124 | 15831944/job_mobile | /lib/lib_XT12/Samples/Controls/BrowseEdit/StdAfx.cpp | C++ | cpp | 923 | no_license | // stdafx.cpp : source file that includes just the standard includes
// BrowseEdit.pch will be the pre-compiled header
// stdafx.obj will contain the pre-compiled type information
//
// This file is a part of the XTREME TOOLKIT PRO MFC class library.
// (c)1998-2008 Codejock Software, All Rights Reserved.
//
// THIS ... |
fcf13559fa93fb368766b8cf4118a4e3d6e64bbd | 532af65fba31307ffcecac6811d6394335eb29b4 | sixie/CITHZGamma | /CommonCode/utils.cc | C++ | cc | 2,331 | no_license |
int scCategoryEight(float sc_eta, float sc_r9){
if( fabs(sc_eta)<1.0){
return sc_r9 >0.94 ? 0 : 1;
}else if( fabs(sc_eta)<1.49){
return sc_r9 >0.94 ? 2: 3;
}else if( fabs(sc_eta)<2.0){
return sc_r9 > 0.94 ? 4:5;
}
else{
return sc_r9 >0.94 ? 6 : 7;
}
}
int scCategoryFour(float s... |
14707a13c0484d2d5f538bb40cefdd4338dea705 | 1e5c632c514416630b35938fca608b7e153af557 | witeyou/easyMule | /src/UILayer/Lists/MuleListCtrl.cpp | C++ | cpp | 43,531 | no_license | /*
* $Id: MuleListCtrl.cpp 7701 2008-10-15 07:34:41Z huby $
*
* this file is part of eMule
* Copyright (C)2002-2006 Merkur ( strEmail.Format("%s@%s", "devteam", "emule-project.net") / http://www.emule-project.net )
*
* This program is free software; you can redistribute it and/or
* modify it under the terms o... |
9e9db702319191cb95e0cbc5f001e919a2dd2a40 | 25168f725a2561eea2fab964d27ab742b0601bba | usdot-fhwa-stol/autoware.ai | /core_perception/points_downsampler/include/points_downsampler.hpp | C++ | hpp | 1,114 | permissive | #ifndef POINTS_DOWNSAMPLER_H
#define POINTS_DOWNSAMPLER_H
static pcl::PointCloud<pcl::PointXYZI> removePointsByRange(pcl::PointCloud<pcl::PointXYZI> scan, double min_range, double max_range)
{
pcl::PointCloud<pcl::PointXYZI> narrowed_scan;
narrowed_scan.header = scan.header;
#if 1 // This error handling shou... |
a1f833a84001c2b0413ab6311846cc9fb824310a | 15a2336658e75ea046b3844661febe4da52d10c8 | benwbooth/duckdb | /src/planner/expression_iterator.cpp | C++ | cpp | 6,975 | permissive | #include "duckdb/planner/expression_iterator.hpp"
#include "duckdb/planner/bound_query_node.hpp"
#include "duckdb/planner/expression/list.hpp"
#include "duckdb/planner/query_node/bound_select_node.hpp"
#include "duckdb/planner/query_node/bound_set_operation_node.hpp"
#include "duckdb/planner/tableref/list.hpp"
namesp... |
953c1dbae7046845924aaa2f3f6aeb4714847796 | 730d0cbc5912cfeb734970a6c607d83261f9566c | spiderbuddy411/spiderbuddy.open | /EloBuddy.Core/EloBuddy.Core/EloBuddy.Core/Detour.hpp | C++ | hpp | 3,077 | no_license | #pragma once
#pragma comment(lib, "detours.lib")
#define WIN32_LEAN_AND_MEAN
#include <Windows.h>
#include <type_traits>
#include "Console.h"
namespace EloBuddy
{
namespace Native
{
enum class convention_type
{
stdcall_t,
cdecl_t,
thiscall_t,
fastcall_t,
winapi_t,
thiscall_r
};
enum cla... |
706b989918b8cf9e8408754034c06a7f1fe9c0d7 | 56b14913a49213e2a3ea742ee70eace99ebafa40 | programminggp/2DLV1 | /ゲームプログラミング実習2021_Example/GameProgramming/CCameraControl.cpp | C++ | cpp | 1,928 | no_license | #include "CCameraControl.h"
#include "CKey.h"
#include "CXPlayer.h"
#define FOWARD 17.0f
#define UP CVector(0.0f, 1.0f, 0.0f)
#define VELOCITY 0.5f
//#define START_POSITION CVector(0.0f, 3.0f, 10.0f)
#define HEAD_ADJUST CVector(0.0f, 3.0f, 0.0f)
CCameraControl::CCameraControl()
: mDistance(0.0f, 0.0f, 1.0f)
{
mPos... |
344091dd605073cff94aa439e2301170aaa38651 | 551bafbcd9433d0f6b58e53e9bf7079c17b66043 | audioplastic/Catch | /include/internal/catch_tostring.hpp | C++ | hpp | 3,366 | permissive | /*
* Created by Phil on 8/5/2012.
* Copyright 2012 Two Blue Cubes Ltd. All rights reserved.
*
* Distributed under the Boost Software License, Version 1.0. (See accompanying
* file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
*/
#ifndef TWOBLUECUBES_CATCH_TOSTRING_HPP_INCLUDED
#define TWOBL... |
6e493b315705f6724421d3af00822948d42523c4 | 286b2dc55d4e60f72a6598022fc468d2e41ec3fa | CastleOfCodes/Cpp | /codeforces/twins.cpp | C++ | cpp | 263 | no_license | #include<iostream>
using namespace std;
int main()
{
int n,sum=0,tot=0;
cin>>n;
int a[n],min;
for (int i = 0; i < n; i++)
{
cin>>a[i];
sum += a[i];
}
sum /= 2;
for (int i = 0; i < n; i++)
{
}
} |
569e3b0ac189f4168b37f1e959c59e6b51690792 | 42e89f669935ef720d3ebdebf092d474416a65ca | RileyMcCarthy/MaD_Firmware | /Librarys/RA8876/DisplayImagesSD.cpp | C++ | cpp | 7,424 | no_license | #include "Ra8876_Lite.h"
#include <stdint.h>
//#include "simpletools.h"
#include "Ra8876_Lite.h"
#include "pattern6.h"
#define GT9271_INT 7
#define CLK 28
#define DATA 29
#define RA8876_XNSCS 10
#define RA8876_XNRESET 9
Ra8876_Lite ra8876lite(RA8876_XNSCS, RA8876_XNRESET, CLK, DATA, GT9271_INT, 8); //int xnscs, int xn... |
da8d18df266c096ce3a40871a76a9372c28a92e5 | a5013fde5ebd9620d17918c3dfc996202dd3c220 | mjssw/async_io | /network/asio/impl/write_at.hpp | C++ | hpp | 27,834 | no_license | //
// impl/write_at.hpp
// ~~~~~~~~~~~~~~~~~
//
// Copyright (c) 2003-2015 Christopher M. Kohlhoff (chris at kohlhoff dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
#ifndef ASIO_IMPL_WRITE_AT_HPP
#d... |
e1ce9dd337c2d8af267f1550ac36a6e1eac3b1af | 629e13fc80e2a1fcad0ce8562aef77526a68a382 | seanwallawalla-forks/oxygen | /kstyle/transitions/oxygentransitions.cpp | C++ | cpp | 3,850 | no_license | // krazy:excludeall=qclasses
//////////////////////////////////////////////////////////////////////////////
// oxygentransitions.cpp
// container for all transition engines
// -------------------
//
// SPDX-FileCopyrightText: 2009 Hugo Pereira Da Costa <hugo.pereira@free.fr>
//
// SPDX-License-Identifier: MIT
////////... |
8fe4eaf9235347dbe71489eaafef10ef05727d1c | 1a087a97e00108881d3959fe7bb7d6f1c52e8e64 | JosiahWI/QuartzEngine | /Quartz/Engine/Include/Quartz/Events/Event.hpp | C++ | hpp | 3,464 | permissive | // Copyright 2019 Genten Studios
//
// 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 conditions and the following disclaimer... |
67b2900589df1011f1ac4d4919df9bbef6276a11 | 1b6ac8955205f9ec05afc73607eef4a354807884 | jminsol/Boggle | /Boggle_Solver.hpp | C++ | hpp | 1,846 | no_license | //
// Boggle Solver.hpp
// Boggle
//
// Created by JeongMinsol on 4/2/20.
// Copyright © 2020 Minsol Jeong. All rights reserved.
//
#ifndef Boggle_Solver_hpp
#define Boggle_Solver_hpp
#include <stdio.h>
#include "Dictionary.h"
//Global constant for board size 4*4
const int COL_SIZE =4;
const int ROW_SIZE =4;
st... |
cb0e7c1d2afe7fb2ef3d036bd282c978caaab411 | 1329c86734b6af9c3db279b77571f6368024433b | sarveshgpt1991/geeksforgeeks | /6. DS - Bianry Tree/11.count-of-leaf-nodes-in-a-binary-tree.cpp | C++ | cpp | 631 | no_license | // http://www.geeksforgeeks.org/write-a-c-program-to-get-count-of-leaf-nodes-in-a-binary-tree
#include <iostream>
#include "bt.h"
int getLeafCount(node *root){
if(root == NULL)
return 0;
if(!root->left && !root->right)
return 1;
return getLeafCount(root->left) + getLeafCount(root->right);
}
int m... |
1850b9578b4bc484d9fda2af1e85b3488f8610b1 | 41858d61b6180306d577ff740096039805aea4bd | hec12/codevs5.0 | /Que_BS_submit.cpp | C++ | cpp | 38,047 | no_license | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
... |
433477ea106a2145bd2fb19e7d7ed42e5574be05 | b3749ff61471122e6c15d0e7f470394ae33fe531 | Deadmanovi4/mmo-resourse | /武侠世界/代码/客户端/Client/WXClient/Network/PacketHandler/CGAskMissionListHandler.cpp | C++ | cpp | 285 | no_license |
#include "StdAfx.h"
#include "CGAskMissionList.h"
using namespace Packets;
uint CGAskMissionListHandler::Execute( CGAskMissionList* pPacket, Player* pPlayer )
{
__ENTER_FUNCTION
return PACKET_EXE_CONTINUE ;
__LEAVE_FUNCTION
return PACKET_EXE_ERROR ;
}
|
fb163c4c2172c22ec9ac86fe50716eb0e8ff48df | 5442db6b635f908a6fe80c9966c717916556784f | CodeOpsTech/DesignPatternsCpp | /cpp/opensourcesrcs/demogl/cpp/DemoGL/dgl_dlllayer.cpp | C++ | cpp | 4,561 | no_license | //////////////////////////////////////////////////////////////////////
// FILE: dgl_dlllayer.cpp
// PURPOSE: in here is the CLayer class implementation
//////////////////////////////////////////////////////////////////////
// Part of DemoGL Demo System sourcecode. See version information
//////////////////////////... |
f14ffb71b8934a4b55e9bfc1f888db94671d8057 | 6de99277ac65be8502fe1380a9bc6b79737eeb08 | novaquark/aws-sdk-cpp | /aws-cpp-sdk-macie2/source/model/UpdateClassificationJobRequest.cpp | C++ | cpp | 1,242 | 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... |
d57e4d0c92fe2adfc86e1cc10df154b79abbb35b | 8643d9422cee2799812a14864abebf6b30374209 | Medbeji/Eventy | /build/iOS/Debug/src/_root.EventApp_access-530e0c98.cpp | C++ | cpp | 5,701 | no_license | // This file was generated based on /Users/medbeji/Documents/event-app/event-app/.uno/ux11/EventApp.unoproj.g.uno.
// WARNING: Changes might be lost if you edit this file directly.
#include <_root.EventApp_access-530e0c98.h>
#include <_root.ExploreItem.h>
#include <Uno.Bool.h>
#include <Uno.Object.h>
#include <Uno.Str... |
e22ce6ea067560634cd4f39259d4aaa84231b4a7 | 100729ba0daff500032d993b7aa1500989144b31 | ptnnx/e-mulator-PSP | /core/nes/mapper/254.cpp | C++ | cpp | 2,935 | no_license | #ifdef _NES_MAPPER_CPP_
STATIC void NES_mapper254_Init();
STATIC void NES_mapper254_Reset();
STATIC void NES_mapper254_MemoryWriteSaveRAM(u32 addr, u8 data);
STATIC void NES_mapper254_MemoryReadSaveRAM(u32 addr);
STATIC void NES_mapper254_MemoryWrite(u32 addr, u8 data);
STATIC void NES_mapper254_HSync(u32 scanline);
... |
bd1324d8c8b23dc9ba8bfe09247067d2881e4590 | 470913c7c8b7ace3e1d83220a14a00cc6a7b8aa2 | Rynnya/bcrypt | /include/bcrypt.hpp | C++ | hpp | 237 | permissive | #pragma once
#include <string>
#include <cstdint>
namespace bcrypt {
std::string hash(const std::string& pass, unsigned long rounds = 12);
bool verify(const std::string& pass, const std::string& hash) noexcept;
} // namespace bcrypt
|
521818a0a0c2d9e33a304f580fe71eded123ceb3 | 6b8a5d30f1a40704274a3e295501588589bca62d | phlight4fork/Vitis_Libraries | /dsp/L1/src/aie/fir_decimate_hb.cpp | C++ | cpp | 110,964 | permissive | /*
* Copyright 2022 Xilinx, 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... |
4af06eeff8431053fa1ed9baf0b35711a16e2e82 | 38ff33b7f9733d344d75bb42b596d85a755f3bcc | duanfa-7/ACM | /回旋星空.cpp | C++ | cpp | 1,882 | no_license | #include <stdio.h>
#include <iostream>
#include <map>
using namespace std;
#include <bits/stdc++.h>
struct node
{
int x;
int y;
}po[10000]; // 2
int fun(int x)// A4 即4！/2！//故用到阶乘函数
{
if(x == 0 || x == 1)
{
return 1;
}
return x * fun(x-1);
}
int main()
{
int T, n ;
int f... |
9f80f93ff30b24741c73a878b194a8816f342d72 | 37e45c5de014a18bf3302ed6c496a1b3cb2646a5 | christopherpoole/PETDose | /g4/src/EventAction.cc | C++ | cc | 1,153 | no_license | //////////////////////////////////////////////////////////////////////////
// License & Copyright
// ===================
//
// Copyright 2012 Christopher M Poole <mail@christopherpoole.net>
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public Licen... |
b8309682fe9acf8878a8c1e4424a2abb72dda72f | 985253abde8caee6086baa93496427f29e274c9e | LevonMuradyan/Battleship | /src/location.cpp | C++ | cpp | 670 | no_license | #include "location.hpp"
#include <cmath>
Location::Location() {
m_x = 0;
m_y = 0;
}
Location::Location(const Location& other) {
m_x = other.m_x;
m_y = other.m_y;
}
Location::~Location() {
// destructor
}
Location::Location(int x, int y) {
m_x = x;
m_y = y;
}
int Location::get_x() const {... |
692c28001f03bbd6cb112ee7f75e722fdeb75c90 | 685fcdb2bfadd6ffa3bdcdf592092de3e4f36228 | 100156994/Http | /test_eventloop_1.cpp | C++ | cpp | 1,178 | no_license | #include <assert.h>
#include <stdio.h>
#include <unistd.h>
#include"EventLoop.h"
#include"Thread.h"
EventLoop* g_loop;
//跨线程调用 和一个线程创建两个loop
void callback()
{
printf("callback(): pid = %d, tid = %d\n", getpid(), CurrentThread::tid());
EventLoop anotherLoop;
}
void callback1()
{
printf("callback1(): pi... |
e552dc66dec1ff7333a003062c7c0b5791279ad2 | 84b03063bf570c03917e6eaf42b2c44aae98b48a | zg2nets/windows-backend | /Dali/dali-core/dali/internal/event/actors/custom-actor-internal.cpp | C++ | cpp | 1,691 | no_license | /*
* Copyright (c) 2014 Samsung Electronics Co., Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by a... |
9a439eaa91cd61b01c05bad768d9884d99503144 | d11bf6ca62076e014c5d3a2f37ad0adf1fe211fd | llamazing/leetCode | /lc_292.cpp | C++ | cpp | 571 | no_license | #include <iostream>
using namespace std;
//4的倍数肯定不成功！！！！
//笨成狗了！！
bool canWinNim1(int n) {
bool *calu = new bool [n+1];
int i = 0;
for(;i < n+1; ++i)
{
calu[i] = 0;
}
calu[1] = 1;
calu[2] = 1;
calu[3] = 1;
if( n <= 0)
{
return false;
}
for( i =4; i <= n; ++i)
{
calu[i] = (!calu[i-1])|| (!calu[i-2]... |
6c00f59febbed8f4858187148bfd6981d9e0b7d4 | 559c75f119f7f8f17dc48cdd35b354faef46da41 | Spartan859/Noip_Code | /kk/450. 股神一.cpp | C++ | cpp | 652 | no_license | #include<bits/stdc++.h>
#define N 200005
#define ll long long
using namespace std;
ll x[N],n,d[N],hd=1,tl=0,ans,s[N],tmp,fhd,ftl,lth;
int main(){
scanf("%lld",&n);
for(ll i=1;i<=n;i++) scanf("%lld",x+i);
for(ll i=1;i<=n;i++) s[i]=s[i-1]+x[i];
while(tl<=n&&hd<=n){
while(x[tl+1]>0){
tl++;
cout<<tl<<endl;
}
... |
8c5c2375e5fb9eb85da441b7cb0c1d563cecbd71 | 649cdb3dc4de99a295ade84ac452797c050f3579 | zacharysy/CSE20311-Labs | /lab2/graph.cpp | C++ | cpp | 1,150 | no_license | // Zachary Sy
// ASCII Art
#include <iostream>
using namespace std;
#include <cmath>
#include <limits>
#include <iomanip>
int main(){
float minX = 0;
float maxX = 20;
float step = 0.1;
// So the ASCII Graph fits the terminal window
float scale = 5;
// X & Y coordinates of the maximum and minimum
float maxY... |
3f59d71f3022e4207bd0b2f56fb8266e25328866 | 78de7796292c844b97a6cbf7df90fe21ed4815cf | NeoniteDev/Osmium | /Osmium/SDK/FN_DailyRewardsItem_parameters.hpp | C++ | hpp | 805 | no_license | #pragma once
// Fortnite (4.5-CL-4159770) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "../SDK.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Parameters
//---------------------------------------------------------------------------
// Function Da... |
6e07bda70bfc4d544fd9c2a74c0a60334df8c4ef | b3dbc3f515e0229832efd5def0be21cdc2f50cc6 | codeheng/freshman_code | /dev-c++写的代码/郝斌老师的代码/将一个数组的元素倒过来.cpp | C++ | cpp | 277 | no_license | // 19.8.10 15µã34·Ö
# include <stdio.h>
int main(void)
{
int a[8] = {1,2,3,4,5,6,7,8};
int i,j;
int t;
i = 0;
j = 7;
while(i<j)
{
t = a[i];
a[i] = a[j];
a[j] = t;
i++;
--j;
}
for(i = 0;i<8;++i)
printf("%d\n",a[i]);
return 0;
}
|
b737fdd4f57cf1ac722a785688f7959185323f47 | 21543946bad22cad786de759967a1548747e18b9 | tommymitch/Aserve | /Aserve/source/OldSource/gui/Scope.cpp | C++ | cpp | 5,015 | no_license | /*
* Scope.cpp
* Aserve
*
* Created by tjmitche on 11/08/2011.
* Copyright 2011 __MyCompanyName__. All rights reserved.
*
*/
#include "Scope.h"
Scope::Scope()
{
bufferPos = 0;
bufferSize = 2048;
circularBuffer = new float[bufferSize];
zeromem (circularBuffer, sizeof (float) * bufferSize);
currentIn... |
e4552a033ae4c7f9d67c83c6d7c094e99553946b | b52fc14d028a764f3c317f9bbc019c27a6dc76c8 | abdulmukit98/code | /lightOJ/lightOJ 1107.cpp | C++ | cpp | 1,006 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
/*** lightOJ 1107
x1 y2 _____________ x2 y2
| |
| |
| |
| |
| |
| |
| ... |
3d8f8ab06867c924a3571fbcf5a7a30f00d12685 | eba4ce4759b196fa1096a84373a896b11e60a6f8 | Silobrlst/qtIrrlicht4 | /GizmoTransformRotate.cpp | C++ | cpp | 14,783 | no_license | ///////////////////////////////////////////////////////////////////////////////////////////////////
// LibGizmo
// File Name :
// Creation : 10/01/2012
// Author : Cedric Guillemet
// Description : LibGizmo
//
///Copyright (C) 2012 Cedric Guillemet
//
// Permission is hereby granted, free of charge, to any person obt... |
0c4bbb1f52b24024ee95cee13f22a6c1e992ba94 | da52525d679e986fa09679926ca556be24d9dad7 | black-shadows/LeetCode-Topicwise-Solutions | /C++/all-paths-from-source-to-target.cpp | C++ | cpp | 845 | no_license | // Time: O(p + r * n), p is the count of all the possible paths in graph,
// r is the count of the result.
// Space: O(n)
class Solution {
public:
vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
vector<vector<int>> result;
vector<int> path{0};
... |
97c909c753c83fac1e349b3d32d47ee6556b41b0 | ff981693ed404cb7004bde25b157efcb058e5e47 | VoHongKhanh/olp_acm_icpc | /kattis/easy/2048/2048.cpp | C++ | cpp | 5,911 | no_license | #include <iostream>
using namespace std;
/*
2048
2048 is a single-player puzzle game created by Gabriele Cirulli. It is played on a 4x4 grid that contains integers >=2
that are powers of 2. The player can use a keyboard arrow key (left/up/right/down) to move all the tiles simultaneously.
Tiles slide as far as possib... |
b8f77566e4f256fe85f286e90c82bdcd8ca21410 | 254f917a5c971df2d82ac4ac6946800469816969 | goldsborough/pytorch | /caffe2/operators/segment_reduction_op.cc | C++ | cc | 20,662 | permissive | #include "caffe2/operators/segment_reduction_op.h"
namespace caffe2 {
OpSchema::Cost CostInferenceForSparseLengths(
const OperatorDef& def,
const vector<TensorShape>& inputs,
bool use_weight) {
int min_num_of_inputs = 3 + use_weight;
CAFFE_ENFORCE_GE(
inputs.size(),
min_num_of_inputs,
... |
ca7e21a05184d60086d473d6dc4651809c4ac0a1 | cb3705bdbf4cf779c3d71c0d9d2143dcff3e4f55 | rputman0/Adventure | /Skills.cpp | C++ | cpp | 1,343 | no_license | //
// Skills.cpp
// adventuree
//
// Created by Preston Meade on 10/27/17.
// Copyright © 2017 com.preston.xc. All rights reserved.
//
#include "Skills.hpp"
Skills::Skills(){
cout << "loading skills " << endl;
load_skills();
}
void Skills::load_skills(){
Skill strength("str");
Skill health("... |
f66a56a2cf7db5dbceb670b3458187e1d60fd536 | fb3f6c57a2a615d13c6ed6f5321fdde7ba9a5207 | malfinnurk/Tugas-Pemrograman-Berorientasi-Obyek | /Excercise Employee.cpp | C++ | cpp | 3,192 | no_license | #include<iostream>
#include <string>
using namespace std;
class Employee
{
public:
Employee( string, string, int );
string getFirstName();
string getLastName();
void setLastName(string);
void setFirstName( string );
void setMonthlySalary(int);
int getMonthlySalary();
private:
string ... |
df2e82be5ebb988846025da68f87af3012f7bb51 | a3cc2586f93dd7b6665b125c66fcad5ba676985e | chinnyannieb/Meus-Projetos | /componentes/TMS Component Pack/DBInspDE.hpp | C++ | hpp | 1,826 | no_license | // CodeGear C++Builder
// Copyright (c) 1995, 2009 by Embarcadero Technologies, Inc.
// All rights reserved
// (DO NOT EDIT: machine generated header) 'Dbinspde.pas' rev: 21.00
#ifndef DbinspdeHPP
#define DbinspdeHPP
#pragma delphiheader begin
#pragma option push
#pragma option -w- // All warnings off
#pragma o... |
7aaa186794dd3a8011ea5bb68fb3bf73f5869a76 | 4bd8d8b0d4f362e7cafed8de930ad55f2ed56c6c | ohhskar-school/game-of-bows | /Maps/MapThree.hpp | C++ | hpp | 14,504 | no_license | #ifndef RC_MAPTHREE
#define RC_MAPTHREE
#include <array>
#include "../ResourceManager.hpp"
std::array<std::array<Textures::WallSpecific, 24>, 18> mapThree = {
{{Textures::WallSpecific::Solid, Textures::WallSpecific::Solid, Textures::WallSpecific::Solid,
Textures::WallSpecific::Solid, Textures::WallSpecific:... |
46aedbcc9f89d8478a2f982264c08fe3d3c386f0 | 792cc24dc33da9e8b0f53541c51938cd99b71224 | Jerma066/Parallel_Programming | /GeneralMechanisms/GeneralMechanisms.cpp | C++ | cpp | 337 | no_license | #include <iostream>
#include <omp.h>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[]){
int i;
long int sum = 0;
int N = atoi(argv[1]);
#pragma omp parallel for if(N>4) private(i) reduction(+:sum) shared(N) schedule(static)
for(i = 0; i < N+1; i++)
sum += i;
cout << sum << endl;
... |
95ac70bda17e1d8b56aa48f699a7526f5cabf17c | 2b186a34dede897c782340592f1c9c0576d2e763 | eiselekd/vhdl2js | /antlr4-runtime-cpp/atn/PredicateEvalInfo.cpp | C++ | cpp | 2,065 | no_license | /*
* [The "BSD license"]
* Copyright (c) 2016 Mike Lischke
* Copyright (c) 2014 Terence Parr
* Copyright (c) 2014 Sam Harwell
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
... |
a89879573fb3a0eac4ca2636cdc7d3aeb290254b | adfdbd043ccdbcee710d4eccfc1cf47e797a7d4d | bliotti/beam | /beam/functionaltests/send_getproofutxo_test.cpp | C++ | cpp | 1,979 | permissive | // Copyright 2018 The Beam Team
//
// 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 agre... |
abc8321c5944a993de9206f24bd3cb5a35a2f83d | 5ca3b70135daa1cf1b97492e7ab15eda8bbf33a7 | mr-phazer/QRMV2Widget | /DirectXTex/DirectXTex/DirectXTexImage.cpp | C++ | cpp | 22,253 | permissive | //-------------------------------------------------------------------------------------
// DirectXTexImage.cpp
//
// DirectX Texture Library - Image container
//
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
//
// http://go.microsoft.com/fwlink/?LinkId=248926
//--------... |
ac88ce5fe2d74aba5165d095490a7195c8a54195 | 5da68c8aca0aa8c9048a78f93ca454e6cb74bd17 | rabauke/trng4 | /trng/lognormal_dist.hpp | C++ | hpp | 8,242 | permissive | // Copyright (c) 2000-2022, Heiko Bauke
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of ... |
f507f26c01e095811b01a32d96c7676c1af340c8 | 3d298fa6f2bbcd1cce95eb7f0d63762ddcd27eec | jwakely/Sprout | /sprout/math/floor.hpp | C++ | hpp | 1,651 | permissive | #ifndef SPROUT_MATH_FLOOR_HPP
#define SPROUT_MATH_FLOOR_HPP
#include <cstdint>
#include <limits>
#include <type_traits>
#include <stdexcept>
#include <sprout/config.hpp>
#include <sprout/math/detail/config.hpp>
#include <sprout/math/isinf.hpp>
#include <sprout/math/equal_to.hpp>
#include <sprout/type_traits... |
d6acd62b87ac6ad0d0404c09c161d97ece70cb9d | 09d17ee7bb5fb4cdc89d93b6afdc86e1641bfa82 | Mrgove10/AppliObjetVS | /AppObjetQT/Administration.cpp | C++ | cpp | 3,344 | no_license |
#include "Administration.h"
Administration::Administration()
{
}
Administration::Administration(string role, string nom, string prenom, string email, int telephone, string dateNaissance, int numeroCompteBancaire, string emailPro, int telephoneFix, int telephoneMobile, float horaires, string contrat, string typeDeP... |
b5cb93256cf0bc35581c194af02287e8a1854277 | 90dce5aea93946e279c2fe0d7196575bb10fbe79 | vxl/vxl | /contrib/brl/bbas/bil/algo/tests/test_image_bounds_from_histogram.cxx | C++ | cxx | 2,052 | no_license | #include <iostream>
#include <cmath>
#include <string>
#include "testlib/testlib_test.h"
#ifdef _MSC_VER
# include "vcl_msvc_warnings.h"
#endif
#include "vnl/vnl_random.h"
#include <bil/algo/bil_image_bounds_from_histogram.h>
#include "vil/vil_image_resource.h"
#include "vil/vil_image_view.h"
#include "vil/vil_new.h"
... |
526b0a268832b6b64dadcd15c2f0f1da4c5dddd5 | de0eefc531c9da5e74549dbe1c15f911f8bec0dc | mozilla/spiderweb-spidernode | /deps/v8/test/unittests/compiler/js-intrinsic-lowering-unittest.cc | C++ | cc | 11,191 | permissive | // Copyright 2015 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/compiler/access-builder.h"
#include "src/compiler/diamond.h"
#include "src/compiler/js-graph.h"
#include "src/compiler/js-intrinsic-loweri... |
9106d61ad691b0070c069dd46b568a8570254a9c | 6b86c6856840c341d14a0f263b1be589e3784bd0 | NVSL/Corundum | /eval/mnemosyne/examples/simplekv/simplekv.cpp | C++ | cpp | 3,149 | permissive | #include <stdexcept>
#include <iostream>
#include "simplekv.hpp"
#include "pvar.hpp"
template <typename Value, std::size_t N>
const Value &simple_kv<Value, N>::get(const std::string &key) {
auto index = std::hash<std::string>{}(key) % N;
for (const auto &e: buckets[index]) {
if (e.first == key) {
... |
35e449f4f1969179b8165c2007d4c42d4dc4d0ff | a4701d6433502a5d5f36f0d68f7268334cd93edd | jeffamstutz/boost.simd | /include/boost/simd/function/gamma.hpp | C++ | hpp | 1,089 | permissive | //==================================================================================================
/*!
@file
@copyright 2016 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*/
//============================... |
b83aae1b6ec0f0dd4756a503d0b965e2fdba913c | 5a9d2a84fb7208751881abfb8686aa44f4b4149c | ciklon-z/v4abs | /src/verilog/vexpr/VExprConstantExpression.cpp | C++ | cpp | 13,334 | no_license | #include "VExprConstantExpression.h"
#include "exception/Exception.h"
#include "utility/log/Log.h"
VExprConstantExpressionHandle vexpr_constant_expression_mk_unsigned_number(unsigned int unsignedNumber) {
return VExprConstantExpressionHandle(VExprConstantExpression(vexpr_constant_primary_mk_unsigned_number(unsigne... |
514e2ecf46fa275f44515ddfce0f770a1fae10e6 | dac5aba699036a8596f87c7f1d57cbc4f90c5111 | joaoregateiro/OpenGLFramework | /Procedural Planets/NodeColour.cpp | C++ | cpp | 335 | no_license | #include "NodeColour.h"
#include "Visitor.h"
NodeColour::NodeColour(const glm::vec3 &colour)
: m_colour(colour)
{
}
NodeColour::~NodeColour()
{
}
void NodeColour::accept(Visitor &v)
{
v.visit(*this);
}
void NodeColour::setColour(float red, float green, float blue)
{
m_colour.x = red;
m_colour.y = green;
m_colo... |
9d7ae2f768761bd87f7a16bf18f05cb5c4af9059 | 29d64fbba21f1de2d1d9485f388e03a438872265 | mpsitech/wdbe-WhizniumDBE | /apiwdbe/PnlWdbeMtpAPar.cpp | C++ | cpp | 16,532 | permissive | /**
* \file PnlWdbeMtpAPar.cpp
* API code for job PnlWdbeMtpAPar (implementation)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Alexander Wirthmueller (auto-generation)
* \date created: 5 Dec 2020
*/
// IP header --- ABOVE
#include "PnlWdbeMtpAPar.h"
using namespace std;
using namespace Sbecore;
u... |
9ae187eb28da1b9f129de8a7391d31f3ba7506e6 | b10b9aff037a5e5915f37cc329d0f7cf3916f544 | sailfish009/binding_affinity_calculator | /lib/rosetta/source/src/protocols/protein_interface_design/filters/DesignableResiduesFilter.hh | C++ | hh | 3,071 | no_license | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
a1ae7c1b834c0c66e039216fad66985d17715812 | edea41230cdae7c1b3cf0279790e50c099daa019 | guoyu07/DesignPattern-23 | /Creational/FactoryMethod/src/factory/chessFactory.cpp | C++ | cpp | 272 | no_license | #include "../../inc/factory/chessFactory.hpp"
#include "../../inc/product/chess.hpp"
using namespace bootcamp;
chessFactory::chessFactory()
{
}
chessFactory::~chessFactory()
{
}
toy* chessFactory::createToy()
{
toy* myToy = new bootcamp::chess();
return myToy;
}
|
d41313eb33952d0cd7eea32923318a91ab7fe328 | fbb4ab1b397b2f1eada02e38965acc24ede796a0 | Eddyme34/proj5 | /src/XMLReader.cpp | C++ | cpp | 2,297 | no_license | #include "XMLReader.h"
CXMLReader::CXMLReader(std::istream &is) : Input(is){
Parser = XML_ParserCreate(NULL);
XML_SetUserData(Parser, this);
XML_SetElementHandler(Parser, CallbackBeg, CallbackEnd);
XML_SetCharacterDataHandler(Parser, CallbackHandler);
}
CXMLReader::~CXMLReader(){
XML_ParserFree(Pa... |
34478fc113fb2c5444b84ed8c88d4c11251df8d2 | a6a7a7e10567180160edb32e894e1bcf52e2c53c | sjh26/IntersonArraySDKCxx | /app/AcquireIntersonArrayBMode.cxx | C++ | cxx | 7,515 | permissive | /*=========================================================================
Library: IntersonArray
Copyright Kitware Inc. 28 Corporate Drive,
Clifton Park, NY, 12065, USA.
All rights reserved.
Licensed under the Apache License, Version 2.0 ( the "License" );
you may not use this file except in compliance with the... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.