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 |
|---|---|---|---|---|---|---|---|---|
6bbeb6d816dfaaa4190217d2e7067a14d0e86d46 | 0a6155db3ddefd52dd37e7b4aea72f978c20aac4 | Gaxvin/FFF_Protocol_Core | /src/v8_win/v8ubjsonf.cpp | C++ | cpp | 29,949 | permissive | // Copyright (c) 2014-2019 Coin Sciences Ltd
// FFF_Core code distributed under the GPLv3 license, see COPYING file.
#include "v8_win/v8ubjson.h"
#include "v8_win/v8blob.h"
#include "v8_win/v8utils.h"
#include <cstring>
const int MAX_FORMATTED_DATA_DEPTH = 100;
namespace mc_v8
{
#define UBJ_UNDEFINED 0
#define UBJ_N... |
b9c0dd33cf8a007a113308c8be9b0910725c33ce | 9097ed540261b46f9db1ea2008aa21e12e7927ee | joe881118/basic-homework2 | /3a713236.cpp | C++ | cpp | 362 | no_license | #include <stdio.h>
#include <stdlib.h>
int main()
{
int y,m,d;
printf("請輸入你的出生西元年：");
scanf("%d",&y);
printf("請輸入你的出生月份：");
scanf("%d",&m);
printf("請輸入你的出生日期：");
scanf("%d",&d);
printf("你的出生年月日為：%d年%d月%d日\n",y,m,d);
system("pause");
return 0;
}
|
0abc5daa58a200ebc5eb7b50ba4412fc4e3081ac | eb09d3097d26292aeed2b9daca734d35f0c9217f | pleasemarkdarkly/iomega_hipzip | /pogo/player/util/metakit/current/src/tstore4.cpp | C++ | cpp | 8,914 | no_license | // Copyright (C) 1996-2001 Jean-Claude Wippler <jcw@equi4.com>
//
// Regression test program, storage tests, part 3
#include <util/metakit/regress.h>
/////////////////////////////////////////////////////////////////////////////
void TestStores4()
{
B(s30, Memo storage, 0) W(s30a);
{
c4_Bytes hi ("h... |
64534bd2722daae393b577ca97618145982f6287 | 0c41c67e700c71e3792fb62e46622c7977c7b9e8 | asanka424/Rest-Client-Server | /Zone_Client/mainwindow.cpp | C++ | cpp | 6,894 | no_license | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QModelIndex>
#include <QFile>
#include <QTextStream>
#include <QMessageBox>
#include <QCloseEvent>
#include <QDebug>
#include <QLabel>
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(this);
... |
1aa99a190473b42191c3654373db410eef00877d | b51afe6600d4e62bbb5a24874cb875602a5ec08e | hata6502/synth | /component/sine.cpp | C++ | cpp | 23,694 | permissive | // Copyright 2019 BlueHood
#include <math.h>
#include <deque>
#include <string>
#include <vector>
#include "sine.hpp"
using std::vector, std::string, std::deque;
#define IN_FREQ 0
vector<string> Sine::getIn() { return vector<string>{"freq"}; }
#define OUT_SINE 0
vector<string> Sine::getOut() { return vector<strin... |
ec81b0b73f8f4eecee4b037c8756c6ca01eadb26 | 055803461d3cc40bd63cc3d1f30116af9f01d38a | 2bite/ARK-SDK | /SDK/ARKSurvivalEvolved_CupidArrowImpactEmitter_parameters.hpp | C++ | hpp | 895 | permissive | #pragma once
// ARKSurvivalEvolved (332.8) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_CupidArrowImpactEmitter_classes.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Parameters
//----------------------------------------------... |
78ce267ee02fb47c55e52b9b00488adf3c9c747c | 656be8e37085805c440c1ef58e276f874fcda1b0 | marcinh1399/Asteroids | /Box2D + SFML/CreationManager.cpp | C++ | cpp | 454 | no_license | #include "stdafx.h"
#include "CreationManager.h"
bool CreationManager::createObject(const float & delta)
{
timer += delta;
if (current_quantity >= max_quantity)
return false;
bool create = false;
if (timer.use() || current_quantity < min_quantity)
create = (rand() % range_of_rand) >= min_value_of_rand;
... |
a4ef80c13399b4cfca94f78d2e9cdd8d05f0b22d | bb45aaacb4db9f3fe4a4615f2fcd13114d712d63 | lethanhtung1997/Exercises-C- | /tinh giai thua cua 1 so nguyen duong dung for.cpp | C++ | cpp | 364 | no_license |
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
// Khai bao bien
int x, n, fact = 1;
// Nhap gia tri dau vao
cout<<"Nhap mot so :";
cin>>n;
//Vong lap for
for (int x = 1; x <= n; x++)
{
fact = fact * x;
}
cout<<n<<" Gia tri cua gia... |
d76a81e0aebe3f4606c9bdcf70703c40597c2208 | 7fad42d3b7ad9d926adf9f0e1b6d81c2f40e96f8 | Krazune/LeetCode | /solutions/722/c++/solution.cpp | C++ | cpp | 1,862 | no_license | // 722. Remove Comments
#include <vector>
#include <string>
using namespace std;
class Solution
{
enum State
{
CODE_CHARACTER,
SLASH,
LINE_COMMENT,
BLOCK_COMMENT,
BLOCK_COMMENT_ASTERISK
};
public:
vector<string> removeComments(vector<string>& source)
{
vector<string> lines;
int lineCount = source... |
1eb173b15f0ea76fe6301c15d9c726dab2c5404c | 811b800d33919a6277a85e219e46fbb6ebd1c00d | chi-tech/chi-tech | /modules/LinearBoltzmannSolvers/B_DiffusionDFEMSolver/lbsMIP_solver.cc | C++ | cc | 5,928 | permissive | #include "lbsMIP_solver.h"
#include "ChiObjectFactory.h"
#include "A_LBSSolver/SourceFunctions/source_function.h"
#include "A_LBSSolver/Acceleration/diffusion_mip.h"
#include "A_LBSSolver/IterativeMethods/wgs_linear_solver.h"
#include "IterativeMethods/mip_wgs_context2.h"
namespace lbs
{
RegisterChiObject(lbs, Diff... |
a7b4d56062445b7f2e729c95eec80694c0db0ab9 | 3ad9b6ed0aab62be6e8f41758b8298af74c01e84 | Vecnik88/easyCpp | /ProgrammrCode/Task55max/main.cpp | C++ | cpp | 736 | no_license | /* ### Task 55 ### Created by Vecnik88
Write a program that reads from user a sequence of N integers and return min and max values.
Input :
3
1
2
3
Output :
min :1
max :3
Input :
4
0
2
9
-1
Output :
min :-1
max :9
*/
#include <iostream>
using namespace std;
int main()
{
int N;
int minvalue, maxvalue;
cout << "En... |
5ba9242af2ae3fdde21ef2aac36742ebdcf680c1 | 6e30b0698494ded5f50ab064459ae34f3f05a5db | asc1535/Implementation-of-fast-median-filter | /filters.cpp | C++ | cpp | 5,973 | permissive | #include "filters.h"
#include<memory.h>
#include <algorithm>
#include<vector>
using namespace std;
void Image::addGaussianNoise()
{
int dc = (rand() % 7) - 3;
int i = rand() % height;
int j = rand() % width;
int org = bitmap[i][j];
bitmap[i][j] = min(255,max(0, org + dc));
}
void Image::addSaltAndPepperNoise() ... |
5fadc06848286b797f26690b8a64f9d4f6dc27dc | 063d9a0eb799914b8be8beda19c4c393f5e96784 | Saprsuu6/MyLikeWorks | /Wather/TcpSockets/TcpServer.cpp | C++ | cpp | 4,158 | no_license | #define TSP_SOKETS_DLL
#include "Header.h"
TcpServer::TcpServer()
{
//2. создание серверного сокета
_listenSocket = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
if (_listenSocket == INVALID_SOCKET) {
throw SocketException("socket failed with error: ");
}
}
TcpServer::~TcpServer()
{
... |
0d15859f61392924962975a0a0fb19dbb005c62e | f49bd8a3bfd32e116b8f5c08a4e37b31390c1453 | bright-starry-sky/nebula-graph | /src/executor/query/AggregateExecutor.cpp | C++ | cpp | 3,338 | permissive | /* Copyright (c) 2020 vesoft inc. All rights reserved.
*
* This source code is licensed under Apache 2.0 License,
* attached with Common Clause Condition 1.0, found in the LICENSES directory.
*/
#include "executor/query/AggregateExecutor.h"
#include "common/datatypes/List.h"
#include "common/expression/AggregateE... |
57f5ca383912cf1cfad190696a37705c81ef67c5 | a97f6ff4cab4acb183c692cc496b6ad7d054e159 | kyduke/Coding | /ProjectEuler/072_ReducedProperFraction.cpp | C++ | cpp | 685 | no_license | // https://projecteuler.net/problem=72
// http://www.mathblog.dk/project-euler-72-reduced-proper-fractions/
#include <iostream>
#include <string.h>
using namespace std;
long long countReducedProperFraction(int n) {
int* nums;
int i, j;
long long c;
nums = new int[n + 1];
for (i = 0; i <= n; i++) {
nums[i] =... |
efae2be4490e58c17cb6d1cebcf34e5d6485842f | b5276a849ae2c7577978ccc5d994801f0fb90622 | bdapi/bdapi | /audio/echo_core.cpp | C++ | cpp | 444 | permissive |
/* bdapi - brain damage api version 0.6.0 */
#ifndef BDAPI_AUDIO_ECHO_CORE_CPP
#define BDAPI_AUDIO_ECHO_CORE_CPP
#include "audio/echo.hpp"
/* includes */
// stk
#include "Echo.h"
// namespaces
namespace bdapi {
namespace audio {
/* audio echo class core function implementations */
// iterate
f32 echo::iterate( f3... |
09a69b08cb8124305fd5c9de1949913e7e9b9ad6 | f71cbcf7ace537211badd0910092cd8ac039ec0e | Sakenkz118/Cplusplus | /Ch2.Pr.Ex.6.cpp | C++ | cpp | 380 | no_license | #include <iostream>
using namespace std;
main ()
{
double number2convert;
int roundedNumber;
cout << "Please enter decimal number that you want to convert to the nearest integer:";
cin >> number2convert;
cout << endl;
roundedNumber = static_cast<int>(number2convert);
cout... |
40aa5eef6885b52b19214263e5266cca7c203819 | 08d8fb9f6215ab100bebc4b6c0f4e6ef6deb5a6f | MuhanjalaRE/Midair-1.0.4.9504-SDK | /SDK/UE4_WSkin_Mortar_Tiger_parameters.hpp | C++ | hpp | 369 | no_license | #pragma once
// Unreal Engine 4 (4) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "UE4_WSkin_Mortar_Tiger_classes.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Parameters
//-------------------------------------------------------------------------... |
4c06d50d7327072ee3ebf145c05460d0bff29b09 | 6df55be5e56831df8d105be1a95fbd0c0b5bedd2 | flyfish30/LogDevice | /logdevice/common/test/WeightedCopySetSelectorTest.cpp | C++ | cpp | 34,053 | permissive | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <logdevice/common/WeightedCopySetSelector.h>
#include <gtest/gtest.h>
#includ... |
2706c6973baf58e28d08cf54dbfdd00710cf7893 | 20c7adb1908e5186101a3cfba0555f43dd8bc2ef | em0t/ClickHouse | /src/Storages/System/StorageSystemContributors.generated.cpp | C++ | cpp | 14,443 | permissive | // autogenerated by ./StorageSystemContributors.sh
const char * auto_contributors[] {
"0xflotus",
"243f6a8885a308d313198a2e037",
"821008736@qq.com",
"Akazz",
"Albert Kidrachev",
"Alberto",
"Aleksandra (Ася)",
"Aleksei Levushkin",
"Aleksey",
"Aleksey Akulovich",
"Alex Bocharov... |
84c6fbe0092dc19efc88af2f8b1670f9853e3a71 | 2688f5c5b69c1c582bdeb3eb52de48f3fe3b98b0 | Freeze-d/TankFire | /Plugins/EZOnline/Source/EZOnline/Private/EZServerGameMode.cpp | C++ | cpp | 6,942 | permissive | // Fill out your copyright notice in the Description page of Project Settings.
#include "EZServerGameMode.h"
#include "EZOnlineFunctionLibrary.h"
#include "Kismet/KismetGuidLibrary.h"
#include "EZOnline.h"
AEZServerGameMode::AEZServerGameMode()
{
mFetchTokenInterval = 2.0f;
mFetchTokenCountDown = 0.0f;
}
void AEZS... |
85437d1742a4d480a4d19d6e79287d2a184b5b9e | 60b31201b11cdbbd255c9c20ee776cfa5052dcb4 | schlizbaeda/audacious-raspiblaster | /audacious-3.9/src/libaudqt/playlist-management.cc | C++ | cc | 3,946 | permissive | /*
* playlist-management.cc
* Copyright 2014 William Pitcock
*
* 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... |
5fbe28ab6263a775a691f6072272bdf8d04d2139 | 0567d440736922e912614b5b11a284103f114b53 | DaiHanan/handwriting | /Path.cpp | C++ | cpp | 5,167 | no_license | //
// Created by lenovo on 2019/11/8.
//
#include "Path.h"
#include "Log.h"
#include <algorithm>
Path::Path(const Point& from) {
this->initFromPoint(from);
this->initToPoint();
this->radius = vector<float>(1);
}
Path::Path(const Point& from, const vector<int>& move) {
this->initFromPoint(from);
t... |
62dbb87454f4a021fa2b85fce4bfcd29f721be64 | a3f5024f8e352d6e9ea9c99f2f89a1729b4b31ea | ZanneZankyo/Zankyo-Games | /Engine/Code/Engine/Math/Vector4.cpp | C++ | cpp | 7,812 | no_license | #include "Engine/Math/Vector4.hpp"
#include "Engine/Math/MathUtils.hpp"
#include <complex>
#include <iostream>
#include "Vector3.hpp"
Vector4::Vector4():x(0.f),y(0.f),z(0.f),w(1.f){}
Vector4::Vector4(const Vector4 & copy):x(copy.x),y(copy.y),z(copy.z),w(copy.w){}
Vector4::Vector4(float initialX, float initialY, floa... |
13339c4db23ae49873ae46f78e536001d6f56ff5 | b41164f25a34232d1557bb5ca3764d4a636972a1 | zz4fap/bsscpp | /bsscpp/BSS/Kernel/NaturalGradient/NaturalGradientv2/BlockNaturalGradientWithSCUnitTest.cc | C++ | cc | 7,475 | no_license | #include <string.h>
#include <iostream>
#include <string>
#include <fstream>
#include <stdlib.h>
#include <vector>
#include <math.h>
#include "Matrix.hh"
#include "BlockNaturalGradientWithSC.hh"
using namespace std;
typedef std::vector< Matrix<float> > VectorMatrix;
#define ROW 0
#define COLUMN 1
void allocate(floa... |
7143189bbb21370b0ba48fbaf451a052b9c12614 | e5b16a79f014cf2349fa3913917a911988345d40 | Dante12129/DinoTracks | /src/logic/MovementSystem.cpp | C++ | cpp | 12,860 | no_license | //
// Created by ywzKe on 2019/10/21.
//
#include "MovementSystem.hpp"
#include <iostream>
#include <SFML/System/Vector2.hpp>
#include <Thor/Graphics/ToString.hpp>
#include <Application.hpp>
#include "components/Component.hpp"
#include "Entity.hpp"
#include "Tags.hpp"
namespace dt
{
MovementSystem::MovementSyst... |
9a6adacdfe737fccb447f2d376476d353f79d98f | 95028c0e65672a18365423325a734036d19fe2e7 | aduh95/node | /deps/v8/src/deoptimizer/s390/deoptimizer-s390.cc | C++ | cc | 1,466 | permissive | // Copyright 2014 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/deoptimizer/deoptimizer.h"
#include "src/execution/isolate-data.h"
namespace v8 {
namespace internal {
// The deopt exit sizes below dep... |
4d2cbd421acae7bbdb7b8d723d314c47dfe76223 | 5daf024c2035bf445cffa0ffe9a62ac598acad3c | Sixzeroo/CodingInterviews | /C++/056.cpp | C++ | cpp | 641 | no_license | /*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
// 采用断开节点的方法
ListNode* EntryNodeOfLoop(ListNode* pHead)
{
if (!pHead->next)
return NULL;
ListNode* previous = pHead;
ListNo... |
44c39682c94de02be3c6e0b2a92e9ab1069c09ba | b7986a9b11a94658f6906e3579c19860b122fbf5 | btceasypay/bitcoinpay-miner | /lib/cuda/cuckaroom/mean.hpp | C++ | hpp | 40,674 | permissive | // Cuckaroom Cycle, a memory-hard proof-of-work
// Copyright (c) 2013-2020 John Tromp
// The edge-trimming memory optimization is due to Dave Andersen
// http://da-data.blogspot.com/2014/03/a-public-review-of-cuckoo-cycle.html
// xenoncat demonstrated at https://github.com/xenoncat/cuckoo_pow
// how bucket sorting... |
993600bdfeb25a85533b8852585b80d79dfe7004 | 4531c69535e0dd484f96e1dd95a96449f11c77be | suruz/DirectXTex | /DirectXTex/DirectXTexD3D12.cpp | C++ | cpp | 27,897 | permissive | //-------------------------------------------------------------------------------------
// DirectXTexD3D12.cpp
//
// DirectX Texture Library - Direct3D 12 helpers
//
// Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
//
// http://go.microsoft.com/fwlink/?LinkId=248926
//-------------------------... |
2662ac9a7429f566404109a2728072f8397b3f4d | ad62154668098c6db941a67b02c79a85d5e32aec | FSMM-0-0/SuperSudoku | /UnitTest/unittest1.cpp | C++ | cpp | 6,560 | no_license | #include "stdafx.h"
#include "CppUnitTest.h"
#include "../SuperSudoku/generator.h"
#include "../SuperSudoku/solution.h"
#include "../SuperSudoku/work.h"
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
namespace UnitTest1
{
TEST_CLASS(UnitTest1)
{
public:
//构造函数，生成测试数独
UnitTest1()
{
FILE *t... |
d5b59227509b09ea2cddffa80b239275634cb3ee | 7fd197fb24d736f25c056201c6c03b268aa550ad | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-cleanrooms/source/model/AnalysisRulePolicyV1.cpp | C++ | cpp | 1,617 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/cleanrooms/model/AnalysisRulePolicyV1.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
namespace Aws... |
ceaeadf48865220835c7d2dde639f19eb2dd171d | 69c5820b9ecd587678e5fe4b0b46bda540d69132 | blue42u/hpctoolkit-prof2 | /src/tool/hpcprof2-mpi/sparse.cpp | C++ | cpp | 91,502 | no_license | // -*-Mode: C++;-*-
// * BeginRiceCopyright *****************************************************
//
// $HeadURL$
// $Id$
//
// --------------------------------------------------------------------------
// Part of HPCToolkit (hpctoolkit.org)
//
// Information about sources of support for research and development of
//... |
34b01d3fada38e25f89720236d0b928bd5db3b1d | f78cbf7238b8b05884e2c601fc180752bac74b17 | chromium/chromium | /ppapi/tests/test_websocket.cc | C++ | cc | 59,293 | permissive | // Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ppapi/tests/test_websocket.h"
#include <stddef.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <memory>
#include <string>
#include <vector>
... |
7a220b421e8c7f86e4a838d6495ae0b420c9c764 | 767a8f2daa5e72a6253a408e634196d664bae497 | hanwjdgh/DataStructure | /02. DataStructure/03. Queue/Concept/Deque/LinkedListBased/Using header/LinkedListDQ.cpp | C++ | cpp | 2,444 | no_license | #include <iostream>
#include <cstdlib>
#include "LinkedListDQ.h"
using namespace std;
// Dequeue initialization
void init(DQueue *pqueue) {
// Define dequeue's head and rear is NULL
pqueue->head = pqueue->tail = NULL;
}
// Return true if the dequeue is empty or false otherwise
bool isEmpty(DQueue *pqueue) {
// If... |
8074bb6d86d810c56ac7bee217ed8ff970c6a767 | ea12ee9363e6e2b8c978bfdc52333e3f2cc775c2 | NewViol/FirstRep | /ConsoleApplication44/ConsoleApplication44/ConsoleApplication44.cpp | C++ | cpp | 316 | permissive | #include <iostream>
#include "base.h"
int main()
{
base<int, int> dop;
dop.SetValue1(1);
dop.SetValue2(2);
dop.Print();
child<int, int, int, int> dop1{ 10,31,13,10 };
dop1.Print();
child2<int, int, int, int, int, int> dop2{ 16,10,17,10,15,14 };
dop2.SetValue1(11);
dop2.SetValue2(20);
dop2.Print();
} |
fbe426b97bbeb8a29ac67a6a56337754fb7988f5 | a6dd526e00353a98702d18de33d0ba938ddd3bc3 | brbrown25/aaf-1 | /ref-impl/src/com-api/CAAFModule.cpp | C++ | cpp | 46,095 | no_license |
//=---------------------------------------------------------------------=
//
// This file was GENERATED for the AAF SDK
//
// $Id: CAAFModule.cpp,v 1.21 2009/06/01 11:47:02 stuart_hc Exp $ $Name: $
//
// The contents of this file are subject to the AAF SDK Public Source
// License Agreement Version 2.0 (the "License... |
3ff01604667b1478081f2fc4f3812b7aa459586f | 84bc68aab8c1ab95fdd3fb96f3b9c33e827c5099 | thatoddmailbox/tigame | /src/game.hpp | C++ | hpp | 944 | permissive | #ifndef TIGAME_GAME_HPP
#define TIGAME_GAME_HPP
#include <iostream>
#include <SDL.h>
#include <SDL2_framerate.h>
#include <glad/glad.h>
#include <imgui.h>
#include <imgui_impl_opengl3.h>
#include <imgui_impl_sdl.h>
#include <physfs.h>
#include "component.hpp"
#include "input_manager.hpp"
#include "scene.hpp"
nam... |
f34f1dff37918f565f6657391fd02e7e417f998b | a50336abb8251f8092dba3ea0ea23b28a45512e5 | juno870502/VRProjectPrototype | /Source/TeamProject/TeamProjectCharacter.cpp | C++ | cpp | 11,038 | no_license | // Copyright 1998-2019 Epic Games, Inc. All Rights Reserved.
#include "TeamProjectCharacter.h"
#include "TeamProjectProjectile.h"
#include "Animation/AnimInstance.h"
#include "Camera/CameraComponent.h"
#include "Components/CapsuleComponent.h"
#include "Components/InputComponent.h"
#include "GameFramework/InputSettings... |
6df2c170d9a21475aa20b2758ce2dd4765442e40 | 8c89a1cbdfd91d7bf09b6d8e77d6dbfa51991f53 | Vector35/shuriken16 | /editorcore/mapfieldtype.cpp | C++ | cpp | 2,251 | permissive | #include <QVBoxLayout>
#include "mapfieldtype.h"
#include "theme.h"
#include "project.h"
using namespace std;
MapFieldEditorWidget::MapFieldEditorWidget(const shared_ptr<Project>& project,
const shared_ptr<ActorFieldValue>& value): m_value(value)
{
QVBoxLayout* layout = new QVBoxLayout();
layout->setContentsMargi... |
1c80ea87ae2b2008e5783d6f0bc4312b05fa0dda | e4765edfa95134d9a11a1bccda33d20f3d42940b | lihaisa/kabanero | /include/app/Config.hpp | C++ | hpp | 1,273 | no_license | #pragma once
#include <iostream>
#include <fstream>
/**
* Methods for loading config files
*/
namespace cfg {
auto _loadFile(std::string path) -> std::vector<std::string> {
std::vector<std::string> lines;
std::ifstream file(path);
std::string line;
while ( std::getline(file, line) ) {
if... |
342f04cd4ef9b9577cbd04d6d94950a58fcc9067 | e73e1e5ee1103cbf56672cb8d5c04a6a0fa99e1e | white92d15b7/NLX | /src/obfuscation.cpp | C++ | cpp | 83,904 | permissive | // Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2015-2019 The NulleX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "obfuscation.h"
#includ... |
bc6d4a5fc0143ace74180c6db738e9814a3d70da | 9a82c36b70465483222b9504d91156fe98523067 | timi-liuliang/echo | /thirdparty/mlpack/core/util/cli_impl.hpp | C++ | hpp | 4,913 | permissive | /**
* @file cli_impl.hpp
* @author Matthew Amidon
*
* Implementation of templated functions of the CLI class.
*
* mlpack is free software; you may redistribute it and/or modify it under the
* terms of the 3-clause BSD license. You should have received a copy of the
* 3-clause BSD license along with mlpack. If... |
a427f10fb356d948b5d04d310fe4959b3c80eea3 | 3de5e86f9a7fead7b77710a9ba266b7a3aa1d630 | osrf/opensplice | /src/api/dcps/isocpp2/code/dds/topic/discovery.cpp | C++ | cpp | 1,041 | permissive | /*
* Vortex OpenSplice
*
* This software and documentation are Copyright 2006 to TO_YEAR ADLINK
* Technology 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 exc... |
7652bb9c294007ae641750d21c18f08483100c70 | 5f792a98c07929ed0bd04e8ba4d090c1c24128c0 | NiuTrans/NiuTensor | /source/train/XLeaderAllReduce.cpp | C++ | cpp | 12,484 | permissive | /*
* NiuTrans.Tensor - an open-source tensor library
* Copyright (C) 2016-2021
* Natural Language Processing Lab, Northeastern University
* and
* NiuTrans Research
* 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... |
1e0c7d1ba708c3d533adb3b6169c4ce804eb46e6 | ec42e2cbe51969436e40b05ede73d03a53ec85cf | proaholic/Win2K3 | /NT/inetsrv/iis/inc/string.hxx | C++ | hxx | 10,439 | no_license | /**********************************************************************/
/** Microsoft Windows NT **/
/** Copyright(c) Microsoft Corp., 1994 **/
/**********************************************************************/
/*
string.hxx
This... |
0be4ffcafa092093c7c9d8ff5d1c2313a06ae6d4 | caea119ff1f3997b031e35c86b34c1c890a487f1 | vislab-tecnico-lisboa/foveated_stereo_ros | /src/bayesian_filtering/customparticlefilter.cpp | C++ | cpp | 460 | no_license | #include "bayesian_filtering/customparticlefilter.h"
using namespace MatrixWrapper;
using namespace BFL;
CustomParticleFilter::CustomParticleFilter(MCPdf<ColumnVector> *prior, int resampleperiod, double resamplethreshold, int resamplescheme):
BootstrapFilter<ColumnVector,ColumnVector>(prior, resampleperiod, resam... |
34a7254735d7f6f25ce6242867a1424b6f5603e1 | fa6b79633e7d29dd1797564b917ad0512f380ecd | maddotexe/Competitive-contest-programs | /course code/5th sem/CG/hai/CG/lab2/random.cpp | C++ | cpp | 937 | no_license | #include <iostream>
#include "GL/freeglut.h"
#include "GL/gl.h"
using namespace std;
void renderFunction()
{
glClearColor(0.0, 0.0, 0.0, 0.0);
glClear(GL_COLOR_BUFFER_BIT);
glColor3f(1.0, 1.0, 1.0);
glOrtho(-1.0, 1.0, -1, 1.0, -1.0, 1.0);
glBegin(GL_POINTS);
// using glvertex to draw a point
for (int i =... |
7c3f7b08c000b642a5a9ac4635c86a67b9ab4793 | af998678f6f79a27d0a30271d3ac2d6ebe85852c | KiernenIrons/4-Phil-Lab4 | /SDL_Tutorial/SDL_tutorial/src/Player.cpp | C++ | cpp | 1,125 | no_license | #include <stdio.h>
#include "Player.h"
#include "Events.h"
#include "IdlePlayerState.h"
Player::Player(const AnimatedSprite& sprite) : m_animated_sprite(sprite)
{
// Set the Player to Default to IdlePlayer State
// and Enter that State
m_state = new IdlePlayerState();
m_state->enter(*this);
}
void Player::handl... |
c9cf7e1491db65ce10be4e33e6866791e5a8e55f | 7e8b4da2bfc1407ef021557e92fb6bcce29ca59d | yangjiandan/impala | /be/src/util/hash-util-ir.cc | C++ | cc | 670 | permissive | // Copyright (c) 2012 Cloudera, Inc. All rights reserved.
#include "util/hash-util.h"
// Define the hashing functions for llvm. They are not used by anything that is
// cross compiled and without this, would get stripped by the clang optimizer.
#ifdef IR_COMPILE
extern "C"
uint32_t IrFvnHash(const void* data, int32_... |
0fdda922daa334cbc0da55f468dde71283c8af27 | 0bbaa3c54bb7d7126d92e5996b0c771e9c9512a9 | alxkohh/cplusplus-code-snippets | /is_kth_bit_set.cpp | C++ | cpp | 586 | permissive | /*
A function to determine if the k-th bit of a bit string is set.
A bit is "set" means it is turned on / digit 1.
0th bit is the right most bit. Officially called the LSB, least significant bit.
*/
#include <bits/stdc++.h>
using namespace std;
bool isKthBitSet(int bitString, int k) {
int mask = 1;
int sh... |
875d81e77ae838e6c92c97f922190934f14959fa | 84a6c6ae4022340bd9686f9eef7a02b345910e8d | fathah/zakath | /GoldZakath.cpp | C++ | cpp | 1,186 | no_license | #include <iostream>
using namespace std;
class zakath{
float userGram; //user entry in grams
float misqal; // it is a single unit
float percent; // percent to give
float todaysGold; // todays gold in your area
public:
void sum(){
percent = 2.5/100;
todaysGold = 3220;... |
0c9b0a149e3f51ce898609ca1908f66a4e82d424 | bb4ba3fb8951356226c1e42e1d6a8daff4c10648 | lsmmay322/BaekJoon | /11651.cpp | C++ | cpp | 514 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool ft_compare(pair<int, int> a, pair<int, int> b) {
if (a.second == b.second)
return (a.first < b.first);
return (a.second < b.second);
}
int main()
{
int n, x, y;
vector<pair<int, int>> v;
scanf("%d", &n);
for (int i = 0; i < n... |
66902893c92ff3c327ace3c111603597faa870e8 | 2a657f1e309a8256191a48bd36df954bfe595ae4 | eminasal/Rent-a-car- | /main.cpp | C++ | cpp | 654 | no_license | #include <iostream>
#include <cstdlib>
#include "Datum.h"
#include "Korisnik.h"
#include "Automobil.h"
#include "Transakcija.h"
#include <string>
using namespace std;
int main()
{
try{
Transakcija prvi(1);
cout<<"Printanje racuna "<<endl;
cout<<"Da li zelite detaljan nalog transakcije?"<<endl;
... |
10185664248daf755d17c7419d6a6519ceb25cd8 | 4e1462c5bc728e00be86ce4b915bbd2e6c92ea8d | alluvishnu/vishnuallu | /oops lab.cpp | C++ | cpp | 434 | no_license |
#include<iostream>
using namespace std;
int factorial (int n);
int main ()
{
int n;
cout<<" Have a Successful end in this Project\n\n";
cout<<"Enter a Positive Integer to find the Factorial: ";
cin>>n;
cout<<" Factorial of " << n <<" = " << factorial(n);
return 0;
... |
16b80aa2d6cc5c8783420e5cb359cab79da0d6d3 | 3ea37e72c9974e67fc55b72f173a099c91abe512 | sourceops/deepwater | /backends/mxnet/numeric_train.cxx | C++ | cxx | 9,392 | no_license | /*!
* Copyright (c) 2016 by Contributors
*/
#include <vector>
#include <string>
#include <cassert>
#include <map>
#include "include/symbol.h"
#include "include/optimizer.h"
#include "include/initializer.h"
#include "numeric_train.hpp"
using namespace mxnet::cpp;
#undef MYDEBUG
#ifdef MYDEBUG
static int count = 0;... |
ef82b2260d957f3380911427c79f5f0eeb84d2fb | 54d032e79151c18a527160171720c358b836a9ca | radtek/POSDeviceManager | /Source/TurnStile/TsBiolinkScanner/TsBiolinkScanner.cpp | C++ | cpp | 6,194 | no_license | // This is the main DLL file.
#include "stdafx.h"
#include "TsBiolinkScanner.h"
#define MAX_QUALITY_THREASHOLD 60
#define MIN_QUALITY_THREASHOLD 30
#define SCAN_TIMEOUT 10000
INetPass *pINetPass = NULL;
INetPassScanner *pIScannerDevice = NULL;
INetPassAccess *pIAccessDevice = NULL;
TsBiolinkScanner::TsBiolinkScanner... |
647f17252fd1164e3de5d0edc06f800eacef882f | 7d9e94343384549b6b3ce9548339f12bc25e2ac0 | fitriariskaa19/Tugas-4 | /1. Bilangan Polinom.cpp | C++ | cpp | 4,233 | no_license | /* BILANGAN POLINOM MENGGUNAKAN LINKED LIST */
/* FITRI ARISKA */
/* 20051397082 */
/* MI2020B */
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
using namespace std;
void awal()
{
cout << ("======================================\n");
cout <<("PROGRAM POLINOMIAL\n");
cout <<("=... |
b0d45adab51536b237d3748b397593a60befe08c | a74cd43d531e0af2a510bcd0bf212a60ac5baacb | aurko96/Competitive-Programming | /Codeforces/160A.cpp | C++ | cpp | 354 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a[200],i,n,x=0,y,z=0,p;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
z=z+a[i];
}
p=z/2;
sort(a,a+n);
reverse(a,a+n);
for(i=0;i<n;i++)
{
x=x+a[i];
if(x>p)
{
cout<<i+1;
... |
77266b1f290e4a70aafa7b5143ea03dcb9083722 | cd79d046123b6adab567bb3da1755a9e2f66915c | huanmei9/armnn | /src/backends/cl/workloads/ClMeanWorkload.cpp | C++ | cpp | 2,520 | permissive | //
// Copyright © 2017 Arm Ltd. All rights reserved.
// SPDX-License-Identifier: MIT
//
#include "ClMeanWorkload.hpp"
#include <cl/ClTensorHandle.hpp>
#include <aclCommon/ArmComputeTensorUtils.hpp>
#include "ClWorkloadUtils.hpp"
namespace armnn
{
using namespace armcomputetensorutils;
arm_compute::Status ClMeanVal... |
31d8c41fdb666e0c2c2666431a3cdfc34b15e57a | f1b898d0f2ddbf347a7fee8fc6d33830464b428f | ludandandan/Programmer-interview-guide | /Chapter01_AdvancedVideo/TreeMap.cpp | C++ | cpp | 3,898 | no_license | #include <unordered_map>
#include <map>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
//定义一个节点，表示位置，高度，是上还是下
class Node {
public:
int pos;
int h;
bool isUp;
Node(int x, int y, bool z):pos(x),h(y),isUp(z){}
};
//定义Node的比较策略，按照位置排序，从小到大，若位置相同，那么把先上的放在前面
bool compara... |
e0bf0c2b829a8bf89a5086a95d348f7ece3773fd | 65a9a1c03438053bbed7b28939b0eb0f586b9345 | benelot/minemonics | /Minemonics/src/configuration/CEGUIConfiguration.cpp | C++ | cpp | 1,206 | no_license | //# corresponding headers
#include <configuration/CEGUIConfiguration.hpp>
//# forward declarations
//# system headers
//## controller headers
//## model headers
//## view headers
//# custom headers
//## base headers
//## configuration headers
//## controller headers
//## model headers
//## view headers
//## utils head... |
388fc90ffdd2616df6177c265c829f3d38c9710d | 28299019b3cd055f6fcd04610e2af30a74f53a8b | JustBeYou/C-Cpp-learning | /backtracking/pb3.cpp | C++ | cpp | 475 | no_license | #include <iostream>
#include <fstream>
// de facut
using namespace std;
int st[5];
void afisare() {
for(int i = 0; i < 4; ++i)
cout << st[i];
cout << '\n';
}
int verif(int k, int val)
{
if(k == 0 && ("aeiou", val) == 0)
return 0;
return 1;
}
void back(int k)
{
if (k == 4) {
afisare();
return... |
47baa987aec6c3b14cdc433b7603a4a9f136fbe2 | 5dcca48901c416f1caa6384b4c963940c38bbb14 | chubbymaggie/LIEF | /include/LIEF/DEX/Parser.hpp | C++ | hpp | 2,949 | permissive | /* Copyright 2017 R. Thomas
* Copyright 2017 Quarkslab
*
* 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... |
1a4e7f2a9e89088001d6ac1dbb369fb2cac320d8 | bcc7cefd1d325e0dc7bccf597477a2a3912a06f8 | gaozhuang63/hackitem | /loading.cpp | C++ | cpp | 715 | no_license | #include "loading.h"
#include "ui_loading.h"
#include <QMovie>
#include <QDesktopWidget>
loading::loading(QWidget *parent) :
QWidget(parent),
ui(new Ui::loading)
{
ui->setupUi(this);
setWindowFlags(Qt::FramelessWindowHint | Qt::Tool | Qt::WindowStaysOnTopHint);// 去掉标题栏,去掉任务栏显示，窗口置顶
setAttribute(Q... |
147087e351b31d4f5819972ea685b9c5f7682c7e | 0b8c7f15adaa69d91067e50316fdf5f1fbafb8da | sgtest/p4test | /2018-1/support/options.cc | C++ | cc | 41,038 | permissive | /*
* Copyright 1995, 1996 Perforce Software. All rights reserved.
*
* This file is part of Perforce - the FAST SCM System.
*/
# include <stdhdrs.h>
# include <error.h>
# include <errornum.h>
# include <msgsupp.h>
# include <strbuf.h>
# include "options.h"
/*
* option.cc - command line option processing
*
* ... |
49099686fbf6af29dcff83b17eb80091e3cc9e18 | 8c13e9ab98a1f9078b68c7b143499426c4789887 | lingfeilol/linux--study | /posix_sem/sem.cpp | C++ | cpp | 2,308 | no_license |
#include<unistd.h>
#include<pthread.h>
#include <semaphore.h>
#include<stdio.h>
#include<vector>
#include<iostream>
#define SIZE 10 //宏定义队列容量大小
#define THREADCOUNT 2 //线程个数
class RingQueue
{
public:
RingQueue()
:arr_(SIZE)
{
CapaCity_=SIZE;
PosRead_=0;
PosWrite_=0;
//生产者信号量初始化
sem... |
90bd7693101362d04ecfc755a6e06536c143f419 | ceb64785d370fd135d1f923a668a26eb5d28f466 | TSOO-haha/PRO | /Roadblock.cpp | C++ | cpp | 1,575 | no_license | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define MAX_N 1000
#define INF 1000000
int N, R;
typedef pair<int,int> P;//first是最短距离，second是顶点编号
//图的邻接表表示
/*
3 3 (顶点数 边数）
0 1 （从0到1）
0 2 （从0到2）
1 2 （从1到2）
*/
struct edge {
int to;
int cost;
};
vector<edge> G[MAX_N];
int dis... |
5c57f4fc2e6306640eeb901e0ef20bbac018e6e7 | 5f8f9e0666a8f9ae016112981abd3b0291dcb085 | njacazio/AliPhysics | /PWGCF/EBYE/NetLambda/AliAnalysisTaskNetLambdaMCTrad.cxx | C++ | cxx | 32,761 | no_license | // For: Net Lambda fluctuation analysis via traditional method
// By: Ejiro Naomi Umaka Apr 2018
// email: ejiro.naomi.umaka@cern.ch
// Updated Mar 12, collect rec
#include "AliAnalysisManager.h"
#include "AliInputEventHandler.h"
#include "AliESDEvent.h"
#include "AliAODEvent.h"
#include "AliMCEvent.h"
#include "AliA... |
e3b6a6ad3ae4be5355281de75e624137375b30a1 | 9acb13068437edaa04e4bb4d48008cf7b7bc8764 | mhackampari/OpenCL | /Project_1.1/C++/FiltersC++.cpp | C++ | cpp | 7,068 | no_license | #include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include "image_processing.hpp"
#include <ctime>
#include <fstream>
#include <iomanip>
#define ITERATIONS 25
using namespace std;
double factor = 2;
class Image{
private:
string cat[5];
string mot... |
66d49a0e29a72b18c4166795a06b984abd2f3e69 | 9925e424e3a5f05afcabd70a5f19ddc4314b1a5b | tbago/LeetCode | /binary-tree-level-order-traversal/binary-tree-level-order-traversal/main.cpp | C++ | cpp | 1,359 | no_license | //
// main.cpp
// binary-tree-level-order-traversal
//
// Created by tbago on 2018/8/14.
// Copyright © 2018年 tbago. All rights reserved.
//
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : va... |
b1648c5f4920b1c30291331d84abf995cb511fbf | 63ef1ec26befa37668d01bb2bfbf7a39eeec9675 | sl1296/acm-code | /hdu-5894-8 Accepted.cpp | C++ | cpp | 734 | no_license |
#include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll quickpow(ll m,ll n){
ll b=1;
while(n){
if(n&1)b=(b*m)%mod;
n>>=1;
m=(m*m)%mod;
}
return b;
}
ll inv(ll a,ll n){
return quickpow(a,n-2);
}
ll c(ll n,ll k){
... |
d19b53edd669b57b616ca2727fad6d9ae652b4e3 | 20550bfc7437df839181217361bf9f49850c8817 | venkatarajasekhar/SnakeGame | /DlManager/DlLoader.cpp | C++ | cpp | 492 | no_license |
#include <dlfcn.h>
#include <iostream>
#include <string>
#include "Excp.hh"
#include "DlLoader.hpp"
Dynamic::DlLoader::DlLoader(std::string const& filename, int flag) throw (std::exception&) : _filename(filename)
{
this->_handle = dlopen(this->_filename.c_str(), flag);
if (!this->_handle)
{
std::cout <... |
9615d6383c60405212b86d96e977d3ac73b968d9 | cb391009e08ac430b33078ebb5a66030db63d62b | piyush-jaiswal/College-Work | /C++/lab experiment 2/LAB_Experiment 2 3).cpp | C++ | cpp | 379 | no_license | #include<iostream>
#include<conio.h>
#include<stdlib.h>
#include<ctime>
using namespace std;
int randint(int n)
{
time_t t;
srand((unsigned) time(&t));
return (rand()%n);
}
int main()
{
int maxint;
cout<<"Enter the maximum limit"<<endl;
cin>>maxint;
cout<<"Random no. = ... |
01336ebf6e488ecc152a4277277503be36f0c50d | 80806e848be1e6d47c7e05a2df1677ba6ad011c8 | kuafuwang/LspCpp | /src/jsonrpc/WebSocketServer.cpp | C++ | cpp | 10,632 | permissive | #include "LibLsp/JsonRpc/MessageIssue.h"
#include "LibLsp/JsonRpc/WebSocketServer.h"
#include <iostream>
#include <signal.h>
#include <utility>
#include "LibLsp/JsonRpc/stream.h"
#include <boost/beast/core.hpp>
#include <boost/beast/websocket.hpp>
#include <boost/asio/dispatch.hpp>
namespace beast = boost::beast; ... |
4c008063bf9b6cf91be0731e192d3705b3bcd7a6 | e8b529de85b4687d5bcf78180c0e8940383c3210 | ktomkow/BruteForce | /cpp/Hasher.hh | C++ | hh | 263 | no_license | #ifndef HASHER_HH
#define HASHER_HH
#include <iostream>
#include <cryptopp/sha.h>
#include <cryptopp/cryptlib.h>
#include <cryptopp/hex.h>
#include <cryptopp/files.h>
class Hasher
{
public:
Hasher();
std::string Hash(std::string);
};
#endif |
a78dc3b1749cdea0e555db7de050e44a9046dcf2 | 1e46edc6cb4754840dd1f552619cca0d29fac28f | Jarlene/bookspider-1 | /dxt/source/dom.cpp | C++ | cpp | 6,122 | no_license | #include <string>
#include "dom.h"
#include <assert.h>
#include <stdlib.h>
#include "domutil.h"
#include "cppstringext.h"
dom::dom(void* doc)
{
m_doc = (domdoc_t*)doc;
}
dom::~dom()
{
}
// div => (div, 1)
// div[3] => (div, 3)
// div[class="style",id="xid"] => (div, 3, ("class", "style"), ("id", "xid"))
typedef s... |
01d970369cf78d9d38da53814c3f9c020175bc50 | eccf6f8767920935ffdbc70cd6456869f2ca77cf | jsj2008/leetcode | /locked/422. Valid Word Square.cpp | C++ | cpp | 1,681 | no_license | /*
Given a sequence of words, check whether it forms a valid word square.
A sequence of words forms a valid word square if the kth row and column read the exact same string, where 0 ≤ k < max(numRows, numColumns).
Note:
The number of words given is at least 1 and does not exceed 500.
Word length will be at least 1 an... |
9731990dfb11afdcbafcfcc27bdf2313ade355ee | 44f489529fad817d858b57c2316ebaec2dd8376b | susantigojali/TrafficLightSimulation | /tbo/AssemblyInfo.cpp | C++ | cpp | 1,312 | no_license | #include "stdafx.h"
using namespace System;
using namespace System::Reflection;
using namespace System::Runtime::CompilerServices;
using namespace System::Runtime::InteropServices;
using namespace System::Security::Permissions;
//
// General Information about an assembly is controlled through the following
// set of ... |
c152bdeffe7609e8d2568031a5a6078c99be5eb6 | e201b5e2f3b42c949355eff821aa4fcaab689685 | theicfire/fecpp | /fecpp_ssse3.cpp | C++ | cpp | 50,648 | permissive | /*
* (C) 2011 Billy Brumley (billy.brumley@aalto.fi)
*
* Distributed under the terms given in license.txt (Simplified BSD)
*/
#include "fecpp.h"
#include <tmmintrin.h>
namespace fecpp {
namespace {
/*
* these tables are for the linear map bx^4 + a -> y(bx^4 + a)
* implemented as two maps:
* a -> y(a)
* b ->... |
7f51e69737e8cb46f65e44fc09e9b5d65f3af0f8 | 095eeb3300e7bf4c918a7143bea942e033d92f87 | Andrcraft9/IntegralObserveProblem | /solver.cpp | C++ | cpp | 4,146 | no_license | #include "solver.hpp"
int SolverFDM::setInitialGuess(std::vector<double>& u_c, double coeff1, double coeff2) const
{
assert(u_c.size() == TN+1);
std::uniform_real_distribution<double> unif(-coeff2, coeff2);
std::default_random_engine re;
unif(re);
for(int j = 0; j <= TN; ++j)
u_c[j] = coef... |
e7ab38307940420b0f70af7af10ca0fee58c6aab | 4ac4ac211bbb14ad1d1eb419868b6ba9062dbc33 | 0xkalvin/college | /programming/c++/dataStructure1/004inheritance/main.cpp | C++ | cpp | 1,078 | no_license | #include <stdlib.h>
#include <iostream>
#include "rational.h"
using namespace std;
int main(){
Complex c1(1,-3);
Complex c2(0,0);
Complex sum = c1 + c2;
Complex sub = c1 - c2;
Complex mul = c1 * c2;
Complex div = c1 / c2;
cout << "COMPLEX NUMBERS"<<endl<<endl;
cout << "C1 " ... |
2c4d652daf6533e0ad4cc2734a620cd208ad5669 | ed272e425aa8a315d9c8d7c22c5455001e1c0e4e | thisdave/ShoeShopAdmintest | /newcontactwindow.cpp | C++ | cpp | 3,295 | no_license | #include "newcontactwindow.h"
NewContactWindow::NewContactWindow (QWidget *parent) :
QDialog(parent)
{
this->setWindowTitle("Kontakt hozzaadasa");
group = new QGroupBox();
labelVasAdatok = new QLabel("Adatok:");
labelVasI... |
194229b6f724788bdb8018f7ec0e9976e6ffd485 | 5151178bbd632384e056eb8a5dcbf400f3596833 | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-connectcampaigns/source/model/FailedCampaignStateResponse.cpp | C++ | cpp | 1,741 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/connectcampaigns/model/FailedCampaignStateResponse.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Utils::Json;
using namespace Aws::Utils;
... |
69e2bc377cc86368a100abc70bc8d2f0cd7ef6c6 | a10186fb5cd3d9d4271c063f02d1669118bd7b67 | porames25/SPIRV-Tools | /source/val/validation_state.cpp | C++ | cpp | 30,223 | permissive | // Copyright (c) 2015-2016 The Khronos Group 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 ... |
397686b1a84b963a0e694c9d28c5d8c63101047d | c0799860e1b097669557235ad035fa0439ec6134 | ensi1A/Final_Version-G9 | /Grille.cpp | C++ | cpp | 8,825 | no_license | #include "Grille.hpp"
#include <vector>
#include <time.h>
#include<windows.h>
class Game;
Grille::Grille(int nbl,int nbc)
{
nb_ligne=nbl;nb_colonne=nbc;
grid=new vector<vector<char>>;
grid->resize(nb_ligne);
for (int i = 0; i < nb_ligne; ++i)
(*grid)[i].resiz... |
d7cf0a61b7d2bfc68e34563af267d59d62704ba6 | bea9db826a240ed6bfd81aa5b3af9b862bee2074 | pierg/chase | /src/chase/include/Architecture/NetworkConnection.hh | C++ | hh | 1,905 | permissive | /**
* @author <a href="mailto:michele.lora@univr.it">Michele Lora</a>
* @date 2015-2016
* @copyright Copyright (c) 2015-2017 by University of California, Berkeley.\n
* Copyright (c) 2015-2017 by University of Verona.\n
* Copyright (c) 2015-2017 by International Business Mach... |
ca74b2c884350dbdba93ba06df454a606afe7ef4 | 876d106650f00ebc82f82378a24d7b0ce918f533 | 6paklata/bitcoin-abc | /src/test/avalanche_tests.cpp | C++ | cpp | 26,250 | permissive | // Copyright (c) 2010 The Bitcoin developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "avalanche.h"
#include "config.h"
#include "net_processing.h" // For PeerLogicValidation
#include "test/test_bitcoin.h"
#inc... |
ae5a349c48ce71e3002907e3edd804ad6ed899fc | fd20caa5bb0d0b256c184c75a02319bf9d090233 | ThinhinaneIhadadene/tiramisu | /benchmarks/DNN/blocks/Conv-ReLU-MaxPool/cpu/sparse/conv_relu_maxpool_generator_mkldnn.cpp | C++ | cpp | 7,520 | permissive | #include <iostream>
#include "mkldnn.hpp"
#include "configure.h"
using namespace mkldnn;
using namespace std;
// Original version by: Kyle Spafford Adapted for COO Format
int initRandomSparseMatrix(float* matrix, float density, const int KK, const int fin_size, const int fout_size)
{
const int n = KK * KK * fin_si... |
f0eee954d96ead4c5bdfec8e1cd6cc99f7ba7cfe | d5e61ad4af2836ed23ed5cca530cb8ce17313335 | sxs-collaboration/spectre | /src/IO/Observer/ObservationId.cpp | C++ | cpp | 1,723 | permissive | // Distributed under the MIT License.
// See LICENSE.txt for details.
#include "IO/Observer/ObservationId.hpp"
#include <boost/functional/hash.hpp>
#include <cstddef>
#include <ostream>
#include <pup.h>
#include <pup_stl.h>
#include <string>
#include <utility>
namespace observers {
ObservationKey::ObservationKey(std... |
b5b4cea2e25512f488c67c55f34c95fd8cce1f6b | 985e5f2b2add85293c9b698e95bab17dd7ba689a | jaydeepkumara/yugabyte-db | /src/yb/integration-tests/load_balancer_mini_cluster-test.cc | C++ | cc | 11,692 | permissive | // Copyright (c) YugaByte, 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 writ... |
106f1c3b88d0709d1a31a26777f2cb8344beb6fb | 142fb5d988e8f23844566562513585332fa17f9b | yue-sheng/- | /test3/test3/test3.cpp | C++ | cpp | 4,418 | no_license |
// test3.cpp : 定义应用程序的类行为。
//
#include "stdafx.h"
#include "afxwinappex.h"
#include "afxdialogex.h"
#include "test3.h"
#include "MainFrm.h"
#include "test3Doc.h"
#include "test3View.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
// Ctest3App
BEGIN_MESSAGE_MAP(Ctest3App, CWinApp)
ON_COMMAND(ID_APP_ABOUT, &Ctest3A... |
1fa8da4ae8eb4978a48a5122f7758b8f5870d3bd | 4909690b79ae439f367393d0adbb924de11bfd70 | Dyna-CoRE/dart | /dart/gui/osg/render/PlaneShapeNode.cpp | C++ | cpp | 6,516 | permissive | /*
* Copyright (c) 2011-2017, The DART development contributors
* All rights reserved.
*
* The list of contributors can be found at:
* https://github.com/dartsim/dart/blob/master/LICENSE
*
* This file is provided under the following "BSD-style" License:
* Redistribution and use in source and binary forms, w... |
1e46bece786d1e528f3be78f9900b3d2fab48473 | 8fa5a48206211dbede74554d5803c6421376d011 | eyakubovich/blog-code | /iterfile/main.cpp | C++ | cpp | 578 | permissive | #include <iostream>
#include <boost/range/algorithm/for_each.hpp>
#include "lines.h"
int main()
{
std::ifstream file("somefile.txt");
for( auto& line: lines(file) )
std::cout << line << std::endl;
for( auto& line: lines(std::ifstream("somefile.txt")) )
std::cout << line << std::endl;
std::ifstream file2("s... |
6df08786980b41e52273b06f934ca9fda3181f31 | 5f6d0030f204289a0a1ee1676c8d6f3c58053776 | emredog/vmt | /KinectCapture_libfreenect/main.cpp | C++ | cpp | 7,465 | no_license | #include <libfreenect/libfreenect.hpp>
#include <iostream>
#include <vector>
#include <cmath>
#include <pthread.h>
#include <opencv/cv.h>
#include <opencv/cxcore.h>
#include <opencv/highgui.h>
#include <QString>
#include <QTime>
#include <QDir>
#include <QProcess>
#define OUTPUT_ROOT "/home/emredog/gsu-data"
using... |
bfac7dcc13a2bb38f2b6654c5fe9e5d56021dfaa | 0fb61fd7fd53114c914a5fada9a30fbf846a1fa3 | rkumar0322/KVStore | /main.cpp | C++ | cpp | 4,222 | no_license | //
// Created by Rahul Kumar on 4/6/20.
//
//
// Created by Rahul Kumar on 4/6/20.
//
#include "helpers/serial.h"
#include "helpers/helper.h"
#include "helpers/object.h"
#include "helpers/string.h"
#include "KDStore/keyvalue.h"
#include "network/thread.h"
#include "helpers/array.h"
#include "KDStore/map.h"
#include "K... |
2ff36a21940f416cce7e97d6306dae63b301a477 | 230d1a06379d9524e56193969be143333b131965 | carterwelke/CPlusPlusDataStructuresAssignments | /wk3Sequence/wk3Sequence/sequence_test.cxx | C++ | cxx | 4,328 | no_license | // FILE: sequence_test.cxx
// An interactive test program for the new sequence class
#include <cctype> // Provides toupper
#include <iostream> // Provides cout and cin
#include <cstdlib> // Provides EXIT_SUCCESS
#include "sequence1.h" // With value_type defined as double
using namespace std;
usin... |
ecbcfbf2386a31e4a1182c9ecce97e73a18247bf | 523bb9527a1b219284f56e6fdca52eae24019242 | NeverdieNSK/PizzaS | /main.cpp | C++ | cpp | 517 | no_license | #include <QCoreApplication>
#include "pizza.h"
#include "pizzastore.h"
#include "cheesepizza.h"
#include "carbonara.h"
#include "simplepizzafactory.h"
#include "pizzastore.h"
#include "cheeseburger.h"
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
PizzaStore *pStore = new SimplePizzaFact... |
db90c1b7dedd8dea5ad06be81eba7001e978a27b | 616aa7b20a28cde222c152023332fd505cd7ef25 | b8goal/Boj | /BFS/Boj 2667.cpp | C++ | cpp | 1,103 | no_license | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <queue>
#include <cstdio>
#include <algorithm>
using namespace std;
bool check[26][26];
int Map[1001][1001], R, C, time;
int dx[4] = { 0, 0, 1, -1 }, dy[4] = { 1, -1, 0, 0 };
vector<int> vt;
queue<pair<int, int> > q;
void bfs(void)
{
int cnt = 0;
while (!... |
6fdf8f6613f4bb2c9b2c722e8bf979e0ee803341 | e21f78407c4b9cf81a0d080a88e16b046f66d5c0 | cancandan/FinalProject | /Task.cpp | C++ | cpp | 2,209 | no_license | /*
* Task.cpp
*
* Created on: Jun 2, 2017
* Author: Can Candan
*/
#include "Task.h"
Task::Task() {
// TODO Auto-generated constructor stub
}
Task::Task(double arrivalTime, double cpuWork, double outputWork) : arrivalTime(arrivalTime), cpuWork(cpuWork), outputWork(outputWork) {
remainingOutWork=outpu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.