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 |
|---|---|---|---|---|---|---|---|---|
405ad6b1679ca3d3320cca527e59d5b41d15058e | 35c2221fcb075edf8d7ac06f9154db18f04860b4 | Tyrcnex/tai-mod | /export/release/windows/obj/src/lime/math/Rectangle.cpp | C++ | cpp | 34,053 | permissive | #include <hxcpp.h>
#ifndef INCLUDED_lime_math_Rectangle
#include <lime/math/Rectangle.h>
#endif
#ifndef INCLUDED_lime_math_Vector2
#include <lime/math/Vector2.h>
#endif
HX_DEFINE_STACK_FRAME(_hx_pos_1237f756a3e4c0a2_83_new,"lime.math.Rectangle","new",0xb4aa4114,"lime.math.Rectangle.new","lime/math/Rectangle.hx",83,0x... |
135252b5d15b1ac40d7012fbd7fd0a89639b1137 | 2410ed30e85d3c8feee9ac16bac43be8b7f665a3 | chenlei65368/algorithm004-05 | /Week 6/id_400/LeetCode_37_400.cpp | C++ | cpp | 1,420 | permissive | class Solution {
public:
void solveSudoku(vector<vector<char>>& board) {
if (board.size() == 0) {
return ;
}
doSolve(board);
}
bool doSolve(vector<vector<char>>& board)
{
for (int i = 0; i < board.size(); i++){
for (int j = 0; j < board[0].size();... |
4407d294668ce4059bcf5ec000d9756e179da5a6 | 22b19b91148625f3c5f0a1a28eddc01c18d24a26 | TingyiChen/device_xiaomi_vince | /fingerprint/FingerprintWrapper.cpp | C++ | cpp | 7,675 | permissive | /*
* Copyright (C) 2017, The LineageOS Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable l... |
49c2dbe3cb4002115856c389c2cfcf57873ddf2b | 5c88c666f76d7df92acd75fc56f5b37fd3a582d6 | techyvish/Algorithms | /AlgorithmTutorials/TopCoder/SRM 633/Target.cpp | C++ | cpp | 8,584 | no_license | #include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <typeinfo>
#include <fstream>
using namespace std;
class Target {
public:
vector<string> stringList;
vector<string> draw(int n) {
... |
e36ecfdc32dedaf89f696f68a838a8d542ce30d5 | bb06e5745f6e9b268bc2e15bb72bf2ae0f0b02a4 | BNLIF/wire-cell-nav | /src/DetGenerativeFDS.cxx | C++ | cxx | 11,697 | no_license | #include "WCPNav/DetGenerativeFDS.h"
#include "TMath.h"
using namespace WCP;
using namespace std;
namespace {
double integral(double sigma, double z0, double z1, double z2){
double result=0;
result += 0.5 * TMath::Erf((z2-z0)/sqrt(2.)/sigma)
- 0.5 *TMath::Erf((z1-z0)/sqrt(2.)/sigma);
return resul... |
22efcbff72416332522ca19a9b015f666f302a3e | 7e1448afce0284b638deb042dd3196722d48bfe6 | 57cz/catboost | /catboost/cuda/methods/pairwise_oblivious_trees/pairwise_scores_calcer.cpp | C++ | cpp | 5,065 | permissive | #include "pairwise_scores_calcer.h"
#include <util/generic/array_ref.h>
#include <util/generic/ymath.h>
#include <util/stream/labeled.h>
#include <limits>
static void ValidateSplits(
const TConstArrayRef<TBestSplitPropertiesWithIndex> splits,
const TConstArrayRef<NCatboostCuda::EFeaturesGroupingPolicy> polic... |
c887dcbbce11fed0cbc45edc6a570929c2ac5f94 | 49df00e4af6c4e2cee4c5156a90a5e59885541d8 | DenisFLASH/robotsimulator | /Exercice_robot/PlayingArea.cpp | C++ | cpp | 5,779 | no_license | #include "PlayingArea.h"
#include "Parameters.h"
#include "Robot.h"
#include <iostream>
using namespace std;
using namespace Qt;
using namespace Parameters;
PlayingArea::PlayingArea()
{
m_width = Parameters::TABLE_WIDTH;
m_height = Parameters::TABLE_HEIGHT;
createFixedWorld();
cout << "PlayingArea crea... |
131bc79dece95da799aebbf23790a68129da6a30 | 5ec95b04cc2eb7e4852df6554e5ded3e7b32d9a9 | collectForked/e3 | /src/cpp_cgt/main/cfgparser.cpp | C++ | cpp | 5,503 | no_license | #include <iostream>
#include "cfgparser.h"
#include "cgt.h"
#include "os_filesys.h"
#include "cgtutil.h"
using namespace e3::cr;
using std::cout;
string format_file(string f);
ConfigParser::~ConfigParser()
{
while (!sectypes.empty())
{
delete *sectypes.rbegin();
sectypes.p... |
3125ca1c5d3fa2c25ebfeb700d94fa6b968d6bdf | 889b0d6955164a38a29168021e64f6b9e737b10b | sarbi127/inviwo | /src/core/util/settings/settings.cpp | C++ | cpp | 3,176 | permissive | /*********************************************************************************
*
* Inviwo - Interactive Visualization Workshop
*
* Copyright (c) 2013-2015 Inviwo Foundation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided th... |
0a92974b37575a343437c2642427c51762b0bfe6 | 4c7f1596bc4a225d5889eb32246046391357272b | pointbazaar/dracovm-compiler | /src/headers/AssemblyCodeGen.hpp | C++ | hpp | 3,382 | permissive | #ifndef ASSEMBLYCODEGEN_HPP
#define ASSEMBLYCOGENGEN_HPP
class VMInstr;
std::map<std::string,std::vector<std::string>> compile_vmcodes(std::map<std::string,std::vector<std::string>> vm_sources);
std::vector<std::string> compile_vm_instr(VMInstr instr);
//subroutines for translating individual VM Instructions
//c... |
104940578f04085af8605c842d1cf8745b83eb3c | c46a2f7617c101e51aca70e0a434c85cf78a482b | Bhanu468/100daysofcode | /hallowrect.cpp | C++ | cpp | 387 | no_license | #include<iostream>
using namespace std;
int main(){
int rows;
cin>>rows;
int columns;
cin>>columns;
for(int i=1;i<=rows;i++){
for(int j=1;j<=columns;j++){
if(i==1||i==rows||j==1||j==columns){
cout<<"*";
}
else{
cout<<" ";... |
431427b9b48d718c5c170d79578c1c170bff103f | 9471c61e1a70a95928965285fbcc23f7dcaceea9 | ElectroBean/Aie-AI | /AI/math/Vector3.cpp | C++ | cpp | 3,726 | permissive | #include "Vector3.h"
#include <iostream>
Vector3::Vector3()
{
x = 0;
y = 0;
z = 0;
}
Vector3::Vector3(float a_x, float a_y, float a_z)
{
x = a_x;
y = a_y;
z = a_z;
}
const Vector3& Vector3::Translate(const Vector3& a_first, const Vector3& a_second)
{
Vector3* destination = new Vector3();
destination->x = (a_... |
e3f76edef7ba925c21fa844edd10ebaffda3587f | 807e4264f8dcb581eef3d3e35c3c2ec25b0ec600 | marxin/skia | /bench/BlurRectBench.cpp | C++ | cpp | 7,144 | permissive | /*
* Copyright 2013 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "bench/Benchmark.h"
#include "include/core/SkCanvas.h"
#include "include/core/SkPaint.h"
#include "include/core/SkShader.h"
#include "include/core/SkString.h"
#includ... |
f457545471f58aeb2a9bb070b9616d53b8ddbb96 | c3999cad14dba9848579672b3aa1ae12226f7f43 | PiJoules/unnamed-language | /test_lang_files.cpp | C++ | cpp | 933 | no_license | #include <cassert>
#include <string>
#include "compiler.h"
static const std::string lang_files_dir = "example_lang_files/";
void test_hello_world(){
std::string filename = lang_files_dir + "hello_world.lang";
lang::run_lang_file(filename);
}
void test_fib(){
std::string filename = lang_files_dir + "fib.... |
0196362dcc0d888bca5106c7c1400fe0cb8bce61 | 2d2ddabf1653fe774b76db2a8c6801d1f0d50bbd | rsaxvc/rhex | /lib/read_test.cpp | C++ | cpp | 806 | no_license | #include "async_file.h"
#include <iostream>
#include <cmath>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <fcntl.h>
using namespace std;
int main(int numArgs, char * args[] )
{{
async_file f;
if( numArgs < 2 )
{
cout<<"Usage: "<<args[0]<<" <filename> "<<endl;
exit(1);
}
if( !f.do_open( args[... |
52b074029462ae8e2ddca81601eaaa666168189e | 52bd794ce1ef9d1425c640093b4af7c8b8ed75fe | majacQ/orbiter | /Extern/mssdk_dx7/samples/Multimedia/D3DX/src/Tentacle/ctentacle.cpp | C++ | cpp | 12,042 | permissive | //
// CTentacle
// Copyright (c) 1999 Microsoft Corporation. All rights reserved.
//
#include "pch.hpp"
//////////////////////////////////////////////////////////////////////////////
// Types /////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////... |
ea5afb9ef5015267d111a8631168c78fbffa45ed | fe1267f0afb640963d8da9d85abcc08bada08e9f | CraigMChen/TheTankWar | /BombFood.cpp | C++ | cpp | 495 | no_license | #include "pch.h"
#include "BombFood.h"
void BombFood::Display() const
{
COLORREF fill_color_save = getfillcolor();
COLORREF color_save = getcolor();
setcolor(m_Color);
setfillcolor(m_Color);
fillcircle(m_Position.GetX(), m_Position.GetY(), 7);
setcolor(RED);
RECT r = { m_Position.GetX() - 7, m_Position.GetY(... |
20f6db17c000c42ab3469b22056b7ddb921895f0 | 62030dab2ed412ac01994aad539dcb7079e3407d | MichaelJie888/basealgorithm | /图的构造以及BFS.cpp | C++ | cpp | 2,407 | no_license | #include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int maxn=1010;
/*
* 给出n个用户的关注情况，他们各自关注了那些用户，以及一个转发层数上限L
* 给出最初发出消息的用户编号，求在转发层数上限内消息最多会被多少用户转发
* 第一行给两个整数，第一个是用户个数n，第二个是不直接关注层数
* 下边n行跟随，每一行包含用户i的粉丝数，以及粉丝编号
* 最后一个k给出来，给k个用户，问他们发出的信息会被多少人转发
* */
struct Node{
int ... |
44ff94707c1165230e7b315bcdad212d514968b0 | d5c68636e1ffb3294eecc2cf647846f5c7f59ad3 | niuxu18/logTracker-old | /second/download/git/gumtree/git_patch_hunk_716.cpp | C++ | cpp | 352 | no_license | die("internal error: work tree has already been set\n"
"Current worktree: %s\nNew worktree: %s",
work_tree, new_work_tree);
return;
}
git_work_tree_initialized = 1;
- work_tree = xstrdup(real_path(new_work_tree));
+ work_tree = real_pathdup(new_work_tree);
}
const char *get_git_work_tree(... |
3b8b5c7bc1d33010e7484416f1ffd04f3ef9483d | 3e68ad96857b6b02b4179ce46fde68daad9ebd0b | boberfly/bakec | /src/computeshaders.cpp | C++ | cpp | 4,729 | permissive | /*
Copyright 2018 Oscar Sebio Cajaraville
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distrib... |
b5bcb75c09b1efd438aa92a0e280de197999ff18 | c5add9eb4ad029a2ea3cd85736ca572244e6729c | Shantanu-Panwar/Arrays-ClassWork | /keyboard.cpp | C++ | cpp | 796 | no_license | class Solution {
public:
vector<string> findWords(vector<string>& words) {
unordered_map <char , int> rowId;
string temp = "qwertyuiopQWERTYUIOP";
for(char &i : temp)
rowId[i] = 1;
temp = "asdfghjklASDFGHJKL";
for(char &i : temp)
rowId[i] = 2;
temp = "zxc... |
62d3251560385d0bc6a6d813794a71e5030b23f6 | 88c219e4a7ea8dc70bee14755751697fa32769c5 | ktravis/testris | /core/sprites.cpp | C++ | cpp | 2,615 | permissive | #include "core.h"
#include <cstdarg>
SpriteSheet *loadSpriteSheet(const char *fname, int tile_w, int tile_h) {
int tex_w, tex_h;
TextureHandle t;
if (!loadTextureFile(fname, &t, &tex_w, &tex_h)) {
return NULL;
}
if (tex_w % tile_w != 0 || tex_h % tile_h != 0) {
fprintf(stderr, (con... |
c0f7d0d79abab3bb17564b9c1306c00fdb7bcccc | 6d3262d3a301cae1d7ad992de83676286ae9a09d | mlykotom/ims-gas-crisis | /gasCrisis/stateStats.cpp | C++ | cpp | 21,617 | no_license | /**
** IMS - Modelovani a simulace
**
** projekt: Plynova krize v Evrope
** autori: Jakub Tutko, xtutko00@stud.fit.vutbr.cz
** Tomas Mlynaric, xmlyna06@stud.fit.vutbr.cz
** rok: 2014/2015
**/
//----------------------------------------------------------------------------------------
#include "stateStats.h"
//------... |
ff401ea2c6a8ca4f86e107b01ce7f07a4af812c1 | ba6170f50a34044635378aaf5e7a59e1e0363ac4 | Erick194/gzdoom | /src/win32/i_system.cpp | C++ | cpp | 47,859 | no_license | /*
** i_system.cpp
** Timers, pre-console output, IWAD selection, and misc system routines.
**
**---------------------------------------------------------------------------
** Copyright 1998-2009 Randy Heit
** All rights reserved.
**
** Redistribution and use in source and binary forms, with or without
** modification,... |
401db0891da09f71c4ef15b93db6a864a171238e | eaf98a02d8a5d0feb98317bc63c6cdb35cf68889 | shahidul-brur/OnlineJudge-Solution | /Codeforces/984_A - Game.cpp | C++ | cpp | 2,755 | no_license | /*==============================================*\
ID: shahidul_brur
Name: Md. Shahidul Islam
Study: CSE, BRUR
Address: Rangpur, Bangladesh
mail: shahidul.cse.brur@gmail.com
FB : fb.com/shahidul.brur
Blog: shahidul-brur.blogspot.com(in Benga... |
a6e5e2a52e94efb7c5eb7131efe2bf8f8c06f9a8 | 17fa0af9891a837a67cc21081e137728b72c16c4 | devangrajarora/competitive-programming | /AtCoder/Practice/agc005_b (seg trees).cpp | C++ | cpp | 2,875 | no_license | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define fi first
#define se second
#define rep(i,n) for(ll i = 0 ; i < n ; i++)
#define repe(i,n) for(ll i = 0 ; i <= n ; i++)
#define repb(i,a,b) for(ll i = a ; i < b ; i++)
#define repeb(i,a,b) for(ll i = a... |
bcd0ff281fdb7a6d1bd1b578defa2d20ad2077cc | 5f542eb5189d46078f398480d76724ee413af966 | matus-chochlik/oglplus | /example/advanced/spectra/document_canvas.cpp | C++ | cpp | 902 | permissive | /*
* .file advanced/spectra/document_canvas.cpp
* .brief Implements the document GL canvas
*
* @author Matus Chochlik
*
* Copyright 2012-2019 Matus Chochlik. 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.tx... |
8467c165c181f9d80b128542ffdc07893255caa8 | 632e2dfe7b61f1530959907bfa70a58a3155a9e9 | DIODONTIDAE/Projetto-Uno | /Client/main.cpp | C++ | cpp | 2,408 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <QDebug>
#include <arpa/inet.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <openssl/ssl.h>
int main()
{
int count;
int socket_l;
int err;
char* buff;
struct sockaddr_in addr;
socket_l = socket(AF_INET, SOCK_STREAM,... |
b19bcbd63fabf25f668412e2faa57310f0a0c5f8 | 955ebebc9f8df6818ec8f1a3ba668b14ed6fe866 | cedric-gormond/topologyGUI_win | /src/topology.hpp | C++ | hpp | 809 | permissive | //
// topology.hpp
// topology
//
// Created by Cedric Gormond on 25/01/2019.
// Copyright © 2019 Cedric Gormond. All rights reserved.
//
#ifndef topology_hpp
#define topology_hpp
#include <stdio.h>
#include <math.h>
#include "ctr.hpp"
#include "gen_tools.h"
/*
* center_of_bloc :
*/
void dimensions_of_bloc(con... |
8e8a88ff79754657f20993eeb7e297e19d2b88ac | 3d5ef4aa2650430f3ece2a4f9bbf56d8f99ade1b | YonglianQian/Qyn | /EightQueen2/EightQueen2.cpp | C++ | cpp | 2,782 | no_license | #include <iostream>
#include <vector>
class Queen
{
private:
int _x;
int _y;
public:
void setx(int x)
{
_x = x;
}
void sety(int y)
{
_y = y;
}
int getx() const
{
return _x;
}
int gety() const
{
return _y;
}
void print() const
... |
ca5548f253b59751287bb091c6c088b6e27d6a25 | e14311cde07957976e0e88a43b090196b0ed00e0 | diegovalverde/theia_svo_sim | /src/CSimulator.cpp | C++ | cpp | 20,658 | no_license | #include "../include/CSimulator.h"
#include "../include/Common.h"
#include <iostream>
#include <fstream>
#include <bitset>
#include <algorithm>
//--------------------------------------------------------------------------------------------
string CallBack_Exit(vector<string> aArg, CSimulator * aSim )
{
exit(0);
}
... |
a37a37b77d9751759c40447fc2e5815617894a43 | 649aaec62eeb920c74ac1cb62039e8aff870f660 | gsoosk/SpaceTaxi | /Phase 2/Server/Planet.cpp | C++ | cpp | 455 | no_license | #include "SpaceTaxi.h"
using namespace std;
Planet:: Planet(std::string name, std:: vector<std:: string> names)
: Name(name), LinkedPlanetsName(names) {}
std:: string Planet::get_name(){
return Name;
}
bool Planet:: does_it_linked_to(string PlanetName)
{
for(int i=0; i<LinkedPlanetsName.size(); i++)
{
if(Linked... |
40bc2d01ae4b66e02ac6c0c28beade807ca613dc | b703a173b8e02fcfaf8b530ff8857d5b6a30169d | zenoalbisser/chromium | /cc/base/rtree_unittest.cc | C++ | cc | 1,668 | permissive | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "cc/base/rtree.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace cc {
TEST(RTreeTest, NoOverlap) {
std::vector<gfx::RectF> rects;
... |
9cd0812ae5201344672cbd82210d3a47e5fb2b62 | 605a7da3b0b5b26a90dd56e8939706050a859c8e | mingi/kdiver | /instrument/instrument.cc | C++ | cc | 38,316 | no_license | /////////////////////////////////////////////////////////////////////////
// $Id: instrument.cc 12655 2015-02-19 20:23:08Z sshwarts $
/////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2006-2015 Stanislav Shwartsman
// Written by Stanislav Shwartsman [sshwarts at so... |
ece4999b3fd6465113ef3438f755d7c54cb1f757 | 978ccf6509685b505c805f0c23415860daf2cbe6 | georgejsh/vcode | /arc 111/c.cpp | C++ | cpp | 2,296 | no_license | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define llu unsigned long long int
#define sa(a,n,t) for(int ii=0;ii<n;ii++) scanf("%"#t"",&(a)[ii])
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,a,n) for(int i=a;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rreps(i,a,n) for... |
8631570d4142bfae42d74b816a8561e39fc1a9b6 | 0eeb8fee9991279f0f78c3a9c1394467b759c469 | Team302/2021InfiniteRecharge2 | /src/main/cpp/hw/factories/DragonServoFactory.cpp | C++ | cpp | 5,397 | permissive |
/*========================================================================================================
* DragonServoFactory.cpp
*========================================================================================================
*
* File Description: Create DragonServos and allow external clients to... |
d2bcfc6ede9991aae541e3a1ae749c9f38645f7b | a89b3ecd7aa5da93298737da223102e4c6adad37 | meniossin/src | /ui/aura/window_occlusion_tracker_unittest.cc | C++ | cc | 70,551 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/aura/window_occlusion_tracker.h"
#include "base/macros.h"
#include "base/run_loop.h"
#include "testing/gtest/include/gtest/gtest.h"
#include... |
271e64e01601f268c050d04d2f0f50e5c755251a | 240410c5135d3280feef8b8004b0866be53d12f1 | lxdlam/CP-Answers | /Codeforces/Archives/Round478 Div2/C.cpp | C++ | cpp | 3,537 | permissive | #include <bits/stdc++.h>
using namespace std;
#define TemplateVersion "3.2.0"
// Useful Marcos
//====================START=====================
// Compile use C++11 and above
#ifdef LOCAL
#define debug(args...) \
{ \
string _s = #args; ... |
b2a77c2a7b72f2f2801bf577b05e1b3db1b35039 | 3cb11b4e5e050382153be5de0e35a23e50a2dddb | pengchengla/ACM | /hdu/1069/main.cpp | C++ | cpp | 1,688 | no_license | /*===============================================================
* Copyright (C) 2015 All rights reserved.
* 文件名称：main.cpp
* 创 建 者：pengcheng
* 创建日期：2015-07-07
* 描 述：
================================================================*/
#include <iostream>
#include <algorithm>
using namespace std;
struct _no... |
074a8b62050298e70d0df9dd0a572c453a0aa039 | b44e85b09560d5eb49198fbde6055ca568e9b079 | aurantst/windows-XP-SP1 | /XPSP1/NT/admin/services/sched/test/jt/atsign.cxx | C++ | cxx | 13,520 | no_license | //+---------------------------------------------------------------------------
//
// Microsoft Windows
// Copyright (C) Microsoft Corporation, 1994 - 1996.
//
// File: atsign.cxx
//
// Contents: Functions to read commands from a script file.
//
// History: 04-20-95 davidmun Created
//
//-... |
125532331a41dd1055fe19514432be803a75e7a4 | c46ac9043b5c57b80ec65b1838a89d86cf5734d9 | Saurtecx/DSA-Love-Babbar-450-sheet-solution | /stque.cpp | C++ | cpp | 15,312 | no_license |
// STACK AND queue
//1>> IMPLEMENT queue:
struct QueueNode{
int data;
QueueNode *next;
};
class MyQueue {
private:
int arr[100005];
int front;
int rear;
public :
MyQueue(){front=0;rear=0;}
void push(int);
int pop();
};
void MyQueue :: push(int x){
arr[rear++]... |
998a4ca9177642dcf49818be53ab4e63c4ea37a5 | 28dca81e9cdc642ff325d599fb30cd3c6aa3854d | will-crawford/HackerRank | /Algorithms/Implementation/encryption.cxx | C++ | cxx | 716 | permissive | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string message; getline (cin, message);
int length = message.length(), rows = sqrt (length), columns = rows;
if ( rows * columns < length )
++columns;
if ( rows * col... |
0a4928741bc5710df1bd5841971ebc92a43b3125 | 30d5a7611816fdbbc169e15107c16583ba8c0cd7 | seven1m/serenity | /Kernel/Syscalls/times.cpp | C++ | cpp | 1,887 | permissive | /*
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
* 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 noti... |
c18952b648fc2e03e6452bdea8dde48863132d4c | eca0dc1d9305cafe75e65476061b655a5209b1bd | khanmosajjid/TreeDS | /countNode.cpp | C++ | cpp | 846 | no_license | #include <bits/stdc++.h>
using namespace std;
struct node{
int data;
struct node *left;
struct node *right;
};
struct node *root=NULL;
node *buildTree(){
int c;
cin>>c;
if(c==-1)
return NULL;
else{
node *root=new node();
root->data=c;
root->left=buildTree();
root->right=buildTree();
}
}
void print(n... |
a847ef8dbf95858ba77a70ede79f2a04e0cd1efb | 2cf2558ed5f517ba5c86f7aae3670f383fd2c877 | Anubhav2907/DSA | /hashing/frequency.cpp | C++ | cpp | 323 | no_license | #include <bits/stdc++.h>
using namespace std;
void freq(int arr[], int n){
unordered_map<int, int> m1;
for (int i = 0; i<n; ++i) {
m1[arr[i]]++;
}
for(auto it:m1){
cout << it.first << " - " << it.second << endl;
}
}
int main(){
int arr[] = {1,2,3,6,7,1,4,3,6,9};
freq(arr, 10)... |
28760f25a587fb78cecd2cb8019be3f69688a8bb | 24eeb49e4e173e1c2dd6e8aba6b95c9b3a8e7fc4 | inpagstore404/blrdpag | /AplikasiTahunkabisat.cpp | C++ | cpp | 503 | no_license | #include <iostream>
using namespace std;
int main(){
int tahun;
system("cls");
cout << "+++++++++++++++++++++++++++++++++++++++++++++++++++\n";
cout << "\tAplikasi Menentukan Tahun Kabisat\n";
cout << "+++++++++++++++++++++++++++++++++++++++++++++++++++\n";
cout << "Masukkan tahun : ";
cin >> ta... |
a59e4cf216052ffce8c4c7a62ae297a9ccbfaac7 | b883cc1fda0994c956126da265a1edd343226f4a | dingjingmaster/filesystem | /app/controls/tab-statusbar.cpp | C++ | cpp | 6,613 | permissive | #include "tab-statusbar.h"
#include <QSlider>
#include <QToolBar>
#include <QPainter>
#include <QApplication>
#include <file-utils.h>
#include <global-settings.h>
#include <window/main-window.h>
#include <vfs/search-vfs-uri-parser.h>
TabStatusBar::TabStatusBar(TabWidget *tab, QWidget *parent) : QStatusBar(parent)
{
... |
06ad017fff3beab05d3cb0a18a407da3bc63d926 | af6b1b2eaa4fe234be70a8e9c537528a78fd7b55 | j3ll3/OcspNonStandardPort | /src/lib/utils/http_util/http_util.cpp | C++ | cpp | 7,987 | permissive | /*
* Sketchy HTTP client
* (C) 2013,2016 Jack Lloyd
* 2017 René Korthaus, Rohde & Schwarz Cybersecurity
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/http_util.h>
#include <botan/parsing.h>
#include <botan/hex.h>
#include <botan/internal/os_utils.h>
#include <botan/int... |
8be023395b3841151a651a74831215c243166737 | a5764171575355229dc7f6ea51b418da8565ab5d | andrewbolster/cppqubmarch2013 | /CppExamples/ObjectOrientation/TypesOfInheritance/main.cpp | C++ | cpp | 1,909 | no_license | #include<iostream>
using namespace std;
class Base{
private:
int i;
protected:
Base(int x) : i(x){}
public:
Base():i(0){}
int foo() { return i; }
void bar() { cout << "Base::bar() called" <<endl; }
};
//public inheritance from base
class PublicDerived : public Base {
public:
PublicDerived(int... |
ff7138dcf74520c448fd82c95fa3a99bfc619814 | 50a2357882ea3d92321c808f52d700345e37022f | rovan/tester | /library/monitoringwidget.cpp | C++ | cpp | 864 | no_license | #include "monitoringwidget.h"
#include <QItemSelectionModel>
#include "controller.h"
#include "ui_MonitoringWidget.h"
namespace Tester{
namespace Gui{
MonitoringWidget::MonitoringWidget(QWidget *parent)
: QWidget(parent)
, ui(new Ui::MonitoringWidget)
{
ui->setupUi(this);
connect(ui->testView, &QList... |
3c3a51b30f67711a7616b6221db493d564e653b5 | 9ebcda7fa5b9300743f89e3f2e8dd2c948c6f820 | jixhua/QQmlQuickBook | /sstd_utility/windows_boost/boost/compute/algorithm/detail/reduce_by_key_with_scan.hpp | C++ | hpp | 23,738 | no_license | //---------------------------------------------------------------------------//
// Copyright (c) 2015 Jakub Szuppe <j.szuppe@gmail.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
//
// See http://boostorg.g... |
8f1d8a50a546ac32ae16d6cc743bdb2d80421baa | 28183470d65e58d95d392e904642366b66376e49 | Shivamj075/CodeForBetter | /Anagrams.cpp | C++ | cpp | 1,325 | no_license | /*
Anagrams
Given an array of strings, return all groups of strings that are anagrams. Represent a group by a list of integers representing the
index in the original list. Look at the sample case for clarification.
Anagram : a word, phrase, or name formed by rearranging the letters of another, such as 'spar', formed ... |
cfb7ddbdf75cfad514b3e8bd3b3376f67d2b567b | 483c86dd90c022140710a4b62e242a3aa9b7e192 | svarvel/browser-android-tabs | /chrome/browser/extensions/api/declarative_net_request/ruleset_manager_unittest.cc | C++ | cc | 26,238 | permissive | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "extensions/browser/api/declarative_net_request/ruleset_manager.h"
#include "base/files/file_path.h"
#include "base/files/file_util.h"
#include ... |
b966fc7332876b8b5edd03f4563671418cbf07a5 | 9ce624f2957813a2ed26c0fe2ca537d30f8142f9 | dbuskariol-org/chromium | /third_party/blink/renderer/core/layout/svg/layout_svg_container.cc | C++ | cc | 9,055 | permissive | /*
* Copyright (C) 2004, 2005, 2007 Nikolas Zimmermann <zimmermann@kde.org>
* Copyright (C) 2004, 2005, 2007, 2008 Rob Buis <buis@kde.org>
* Copyright (C) 2007 Eric Seidel <eric@webkit.org>
* Copyright (C) 2009 Google, Inc. All rights reserved.
* Copyright (C) 2009 Dirk Schulze <krit@webkit.org>
*
* This librar... |
016d5f7a792642364e68bf446199037bb4f9e165 | da1cfe80c27e67d3a94ac239d631ba0b21ce8618 | MRPT/mrpt | /libs/core/src/aligned_malloc_unittest.cpp | C++ | cpp | 1,651 | permissive | /* +------------------------------------------------------------------------+
| Mobile Robot Programming Toolkit (MRPT) |
| https://www.mrpt.org/ |
| |
| Cop... |
23137b700d6fb567ab230fe2c742e305c26088b1 | 1caa8a029e436ebf544ce27db49d736a94a38108 | duttondj/qttodo | /todo.cpp | C++ | cpp | 4,993 | permissive | // Danny Dutton
// ECE 3574
// 2015-08-27
// Project 0: Todo
// This is a todo utility that can keep track of a todo list.
// The list is stored in a text file named todo.txt but any name can be used.
// Items are displayed using "list". They are numbered. Completed tasks are put at the bottom.
// Items are added using... |
3c7f5fef52409c313268ab522495b860730c73b2 | 7ab0c75afa1bac049d298b093fb662ea680deabb | alintulu/FHead2011PhysicsProject | /LQSearch/VisualizeShapeBand/7744_TTbar_L/FitMRDistribution.cpp | C++ | cpp | 52,372 | no_license | #include <string>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
#include "TF1.h"
#include "TFile.h"
#include "TTree.h"
#include "TROOT.h"
#include "TStyle.h"
#include "TColor.h"
#include "TGraph.h"
#include "TGraphErrors.h"
#include "TGraphAsymmErrors.h"
#include "TLegend.h"
#include "... |
d19d0f772b99ddc935e263b5bf8958c12a621a51 | 3273b30ff93cb0da8ea766b3e32fe607e5151dc7 | BackupTheBerlios/codelite-svn | /trunk/Plugin/clean_request.cpp | C++ | cpp | 967 | no_license | #include "clean_request.h"
#include "buildmanager.h"
#include "wx/process.h"
CleanRequest::CleanRequest(wxEvtHandler *owner, const wxString &projectName)
: CompilerAction(owner)
, m_project(projectName)
{
}
CleanRequest::~CleanRequest()
{
//no need to delete the process, it will be deleted by the wx l... |
ca75de43fa27777fcdb4bc607b7772590bbf84e7 | 85dfbc680bacd3299d55993a9dbdd78babf033e7 | ArtyomAdov/learning_sibsutis | /learning/programming_2/программирование2сем/лаб12/InsertSortFloat.cpp | C++ | cpp | 280 | no_license | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
int InsertSortFloat(float B[], int N){
int i, j, k;
float t;
for(i=1;i<N;i++){
t=B[i];
j=i-1;
while(j>=0 && t<B[j]){
B[j+1]=B[j];
j=j-1;
}
B[j+1]=t;
}
return 0;
} |
15df3b5106467a121e2a1eaa0292adbb88f56fd4 | a54238aa35c0a9d4dcc36ac9aa0024e446626cbb | blockspacer/doremi | /Doremi/Core/Source/Network/NetworkManagerServer.cpp | C++ | cpp | 23,421 | permissive | // Project specific
#include <Doremi/Core/Include/Network/NetworkManagerServer.hpp>
// Modules
#include <DoremiEngine/Network/Include/NetworkModule.hpp>
// Streamer
#include <Doremi/Core/Include/Streamers/NetworkStreamer.hpp>
// Handlers
#include <Doremi/Core/Include/PlayerHandlerServer.hpp>
#include <Doremi/Core/In... |
7bd87ae50a302f39359f22884387ce5b74598d29 | b75a1bb670ee59e68dcb94c4462cb9454ed80fc6 | gusc/CppCrossPlatform | /Source/Android/MyCrossPlatformClass2.cpp | C++ | cpp | 2,029 | no_license | //
// Created by Gusts Kaksis on 3/6/21.
//
#include "MyCrossPlatformClass2.hpp"
#include "Utilities/JniHelpers.hpp"
#include <stdexcept>
#include <iostream>
MyCrossPlatformClass2::MyCrossPlatformClass2(JNIEnv* initJniEnv, jobject initJniObject)
: jniEnv(initJniEnv)
// Immediatelly create a global reference ... |
df3dfe49a71d2b72770bdb594d862ccea8e9fc4c | 8585041af81d1ccc870266e7442b038b9bfaf04d | rajatgirotra/study | /cpp/BOOST/filesystem/5.cpp | C++ | cpp | 1,748 | no_license | /* The same program as 4.cpp but we order the list of files using std::sort algorithm */
#include <iostream>
#include <boost/filesystem.hpp>
#include <algorithm>
#include <iterator>
#include <vector>
#include <string>
using std::cout;
using std::endl;
using std::copy;
using std::sort;
using std::vector;
using std::str... |
f2789572cb64263c1b40671557598c203ecc01dc | 1cea043f761334d9c8205487ea1b7e78676c3196 | dipperin/llvm | /lib/ExecutionEngine/JITLink/JITLink.cpp | C++ | cpp | 8,202 | permissive | //===------------- JITLink.cpp - Core Run-time JIT linker APIs ------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
46f44377a451841cc67bac12fe890bb7a2193439 | 3b3351615329bee289d21bb456c46a5a2fb10a3a | TrinityTeam/Project_Detritus | /src/graphic/node.hpp | C++ | hpp | 853 | no_license | #pragma once
#include <SFML/Graphics/Drawable.hpp>
#include <SFML/Graphics/Transformable.hpp>
#include <SFML/System/Time.hpp>
#include <list>
#include <memory>
using std::unique_ptr;
class Node: public sf::Drawable, public sf::Transformable {
public:
Node() = default;
virtual ~Node() = default;
void att... |
5597f2ae512a2d397b0e8403e301742ec2fc07cc | f819518b9ae5e9557902457f2cdb0857bb325c93 | YCmove/Algorithms_NCTU | /22_AyeCongratulations/22_AyeCongratulations_1.cpp | C++ | cpp | 2,976 | no_license | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
const int MAXN = 500;
// const int MAXN = 2 * 130 + 2;
int n, m, s, t, ans;
struct edge {
int to, cap, rev;
};
vector<edge> G[MAXN];
// cost: prop的cost
int cost[MAXN], level[MAXN], iter[MAXN];
void add_edge(int from, int to, int cap) {
G[... |
bfa7d02d285052abab83a1dc1b83d3ac9b3ab1d9 | d166cc245af6ecfee7825080e90aadb8e4da7d64 | yash-93/DS_DynamicProgramming | /Word Break.cpp | C++ | cpp | 1,740 | no_license | #include <bits/stdc++.h>
using namespace std;
bool wordBreak(string s, vector<string>& wordDict) {
bool res = false;
int n = s.size();
vector<vector<bool> > dp(s.size(), vector<bool> (s.size(),false));
string t = "";
for(int i=0; i<n; i++){
t = s[i];
if(find(wordDict.begin(), wordDi... |
fd17691215b5a0999718bfc2bbba3872f3bc9420 | c250e34189d6b6e43bc6f10c38ede17e19917efc | dddql/cpp | /Data_structure/Stack/P1739.cpp | C++ | cpp | 1,123 | no_license | //*STL栈
/*
#include <cstdio>
#include <stack>
using namespace std;
stack<char> s;
char c='\0';
int main()
{
while(c!='@'){
scanf("%c", &c);
if(c=='(')
s.push(c);
if(c==')'){
if(!s.empty()&&s.top()=='(')
s.pop();
else{
prin... |
5d383bcf0982e38f240e45ef86ce87fffb8ac6e3 | 920ddda53cb74e783a48aad157d17dcc40b5baeb | tectronics/lwpfilter | /source/filter/xfilter/xfcellstyle.cxx | C++ | cxx | 8,089 | no_license | /*************************************************************************
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* ... |
a59da27daf2ab3f855f223546376bdc0c0ede759 | d63fa3cf7fe0c86c71329af5c72d615e1b891cb8 | bptato/RFC-Greek-World | /CvGameCoreDLL/Boost-1.32.0/include/boost/multi_array/storage_order.hpp | C++ | hpp | 3,958 | no_license | // Copyright 2002 The Trustees of Indiana University.
// Use, modification and distribution is subject to 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)
// Boost.MultiArray Library
// Authors: Ronald Garcia
// Jeremy ... |
15967fa4ff2d03abd2e3281be58600b2cde73e1b | 90b004eb34d6838dd4a138442a42208b1e7ad34c | Jonariguez/ACM_Code | /POJ/3648a.cpp | C++ | cpp | 1,101 | no_license | /*
线段树（多数组维护）
*/
#include <stdio.h>
#include <string.h>
#include <math.h>
typedef __int64 ll;
const int maxn=100000+10;
const int maxdata=(1<<18)-1;
int n,q;
int max(int x,int y){
if(x>y) return x;
return y;
}
int min(int x,int y){
if(x<y) return x;
return y;
}
ll data[maxdata],datb[maxdata];
void add(int a,i... |
45cb6cd2ed835c849bbfbe96e4b8060b28f3b170 | 93ffc56ce209646983ad07aa4513c6bcd9da7ce0 | acceptrisk/csapp3e | /RefObject.hh | C++ | hh | 868 | no_license | #pragma once
#include <atomic>
/// @class RefObject - template class to support reference count
template <typename T>
class RefObject : public T
{
public:
RefObject() : refCount_(1)
{}
virtual ~RefObject()
{}
template<typename T1, typename... Tn>
RefObject(T1&& t1, Tn&&... tn) : T(t1, tn...),... |
7ffd041b80629b3a1f7cdaa1cad59633225d9f3d | 9e5e397836b5feb49d2f36aea81fa298e2fce5c1 | zengruizhao/Radiomics | /tool/code/trunk/cxx/DimensionalityReduction/SIM/source/ccipdSIMStudiesAligner.cxx | C++ | cxx | 6,437 | no_license |
//////////////////////////////////////////////////////////////////////////////////////////
// ccipd includes
#include "ccipdSIMStudiesAligner.h"
#include "ccipdStudy.h"
// serialization includes
#include "ccipdDimensionalityReductionOptions.h"
#ifdef Boost_SERIALIZATION_FOUND
#include "ccipdUnorderedMapSerializa... |
6b8ab25d3d735b2869da764680cef4d0de65d678 | 993554a48f91a21e50bf92ee092541151add1fe3 | gibsonasia/Lab-1-Ticket-prices | /main.cpp | C++ | cpp | 1,069 | no_license | //Asia Gibson
#include <iostream>
using namespace std;
double ticketCost(){
double ticketPrice = 10.0;
int numTickets = 2;
double totalValue = ticketPrice * numTickets;
return totalValue;
}
double ticketCost(double ticketPrice){
int numTickets = 2;
double totalValue = ticketPrice * numTickets;
re... |
809dd2f0c69a3821d8a613c137f2e10eb6e481dc | bae9370bdca870e97ec6daccf98d4cf99f9b65e3 | greddy992/Odor-mixtures | /common.hpp | C++ | hpp | 385 | permissive | #ifndef COMMON_HPP
#define COMMON_HPP
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <time.h>
#include <fstream>
#include <cstdio>
#include <gsl/gsl_rng.h>
#include <gsl/gsl_randist.h>
#include <gsl/gsl_cdf.h>
using namespa... |
9cf2460258908056b414bac255410cbde2f6a7cd | 1c1f5dfb1ff8aef986e0f69d80fea7a41e6ce090 | nmhung1210/chromium | /chrome/browser/chromeos/extensions/wallpaper_private_api.cc | C++ | cc | 33,401 | permissive | // Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/chromeos/extensions/wallpaper_private_api.h"
#include <algorithm>
#include <utility>
#include "ash/public/cpp/ash_features.... |
b9923478ef08c728602291317d7a60429cd66886 | 3b532248ba029c5b81f035c8ef2647067641ade2 | TEEJANG/CallSwiftFuncFromC | /pack-of-fost/fost-android-ndk/fost/internet/Cpp/fost-inet/connection.cpp | C++ | cpp | 18,068 | no_license | /**
Copyright 2008-2019, Felspar Co Ltd. <http://support.felspar.com/>
Distributed under the Boost Software License, Version 1.0.
See <http://www.boost.org/LICENSE_1_0.txt>
*/
#include "fost-inet.hpp"
#include <fost/connection.hpp>
#include <fost/insert>
#include <fost/log>
#include <boost/asio/ssl.hpp... |
788b20118a08a852a3ee422407f0894aad94bd2a | f15d32ae7f97c633116814fb3c855f02c49022e7 | SokarCodes/ObserverPattern | /src/participant.cpp | C++ | cpp | 1,508 | no_license | #include "../include/participant.h"
#include "../include/iobserver.h"
Participant::Participant()
{
}
void Participant::attach(IObserver *observer)
{
observers_.insert(observer);
}
void Participant::detach(IObserver *observer)
{
std::set<IObserver*>::iterator it = observers_.find(observer);
if (it != obse... |
208aeb2b2e39e4eb776fbd46602f7bc661107601 | 1d012f5f06a931ce649e7c5f7beb6920d2509922 | nitya2602/competitive-coding | /leetcode/string/lengthOfLastWord.cpp | C++ | cpp | 352 | no_license | class Solution {
public:
int lengthOfLastWord(string s) {
if(s.size()==0)
return 0;
stringstream str(s);
vector<string> words;
string word;
while(str>>word)
words.push_back(word);
if(words.size()==0)
return 0;
return words[w... |
b0e0681bf5675d4350f33fd0a668cc767c9c3885 | 0b49a65856ff541601646843d88cc18838e549b4 | intel/llvm | /sycl/test-e2e/GroupAlgorithm/SYCL2020/inclusive_scan.cpp | C++ | cpp | 6,407 | permissive | // RUN: %{build} -I . -o %t.out
// RUN: %{run} %t.out
#include "support.h"
#include <algorithm>
#include <cassert>
#include <iostream>
#include <limits>
#include <numeric>
#include <sycl/sycl.hpp>
#include <vector>
using namespace sycl;
template <class SpecializationKernelName, int TestNumber>
class inclusive_scan_ke... |
110c3a9342cba1f186825fdfc1fc88eb398c9d2f | 00546ebea1c73189d43357434e4fbab465c920b7 | achopra14/trivechain-core | /src/test/dbwrapper_tests.cpp | C++ | cpp | 10,364 | permissive | // Copyright (c) 2012-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "dbwrapper.h"
#include "uint256.h"
#include "random.h"
#include "test/test_trivechain.h"
#include <boost/assign/std... |
81b9db4451fb3b3d02506ba2295eb71f1f3639fe | 0c1135433830179fce547dbe470685960226e2ef | msuchard/nt2 | /modules/cephes/unit/scalar/fdtri.cpp | C++ | cpp | 2,018 | permissive | //////////////////////////////////////////////////////////////////////////////
/// Copyright 2003 and onward LASMEA UMR 6602 CNRS/U.B.P Clermont-Ferrand
/// Copyright 2009 and onward LRI UMR 8623 CNRS/Univ Paris Sud XI
///
/// Distributed under the Boost Software License, Version 1.0
/// ... |
3fe1f43745a27f8de5983cc838358f1a8d04c176 | 42267c982d5d0866821117f382dfc54f56f99290 | takumorizo/PMSwitch | /src/FixedSizeMultiVector.hpp | C++ | hpp | 19,514 | no_license | #ifndef FixedSizeMultiVector_h
#define FixedSizeMultiVector_h
#include "ExceptionUtil.hpp"
#include "StringUtil.hpp"
#include <vector>
#include <string>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <assert.h>
#include <limits>
namespace pmswitch{
using size_t = long long;
... |
50ed472767e22ce394d006235f9186ef31cd3fda | e2916d53e5281051c591be493a3ce5593ff7149c | ipoopedmypantsuups/ReHitman | /ReHitman/BloodMoney/source/Client.cpp | C++ | cpp | 8,206 | no_license | #include <BloodMoney/Client.h>
#include <G1ConfigurationService.h>
#include <BloodMoney/BMConfigurationService.h>
#include <HF/HackingFramework.hpp>
#include <spdlog/spdlog.h>
/// Delegates
#include <BloodMoney/Delegates/DX9Delegate.h>
#include <BloodMoney/Delegates/ImGuiInputDelegate.h>
/// Patches
#include <Blood... |
05aeabc443c6b1dafbc98813764240ab7f6b3921 | 227b48659d931d9219e0cb719dc361c6edcb049e | SREERAGI18/chromium | /chrome/browser/ash/policy/core/device_policy_decoder_unittest.cc | C++ | cc | 14,374 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ash/policy/core/device_policy_decoder.h"
#include "base/bind.h"
#include "base/strings/utf_string_conversions.h"
#include "compo... |
9e4b920fa67ab7972683a3a92764a70cbb5e60e1 | 297e15bba8e64d540202a1563d8ff71983781d28 | factor/factor | /vm/assert.hpp | C++ | hpp | 547 | permissive | namespace factor { void abort(); }
#ifdef FACTOR_DEBUG
#define FACTOR_ASSERT(condition) \
((condition) \
? (void)0 \
: (::fprintf(s... |
ccdbe09ea56823507a157162ee07583e8915bbe5 | 0af04f41432117b2ef655688b8d367a79f2eae15 | jerry-zww/elle | /src/elle/reactor/http/StatusCode.cc | C++ | cc | 4,819 | permissive | #include <ostream>
#include <elle/reactor/http/StatusCode.hh>
namespace elle
{
namespace reactor
{
namespace http
{
std::ostream&
operator <<(std::ostream& output,
StatusCode status)
{
switch (status)
{
case StatusCode::Continue:
ou... |
7925efc0da40d4afdb769f2f39d81763104d8177 | 6c518677a1da69ba49940ab12120994d929a0fc6 | longcp/CarRentalManagement | /CarRentalManagement/ui/tabwidget/contractwidget.cpp | C++ | cpp | 22,964 | no_license | #include "contractwidget.h"
#include "ui_contractwidget.h"
#include <QToolBar>
#include <tablemodel.h>
#include <contracteditdialog.h>
#include <database/database.h>
#include <QMessageBox>
#include <contract.h>
#include <client.h>
#include <car.h>
#include <QModelIndex>
#include <util.h>
#include <user.h>
#define LOG_... |
ad641bc145a3fc4d61576f385765f10170c729bd | 546d117b7c2a683121e2c4afca68ea5cf9802062 | LiYan1988/ProbabilisticModel | /ext/BlockingRate-Matlab2C/codegen/lib/CRead/fread.cpp | C++ | cpp | 7,320 | no_license | //
// Academic License - for use in teaching, academic research, and meeting
// course requirements at degree granting institutions only. Not for
// government, commercial, or other organizational use.
// File: fread.cpp
//
// MATLAB Coder version : 3.3
// C/C++ source code generated on : 01-Jun-2017 11:56... |
188a4d395548a6b458b5949e7a624d1b64adf7fc | 5d261bf90aeb53d464cffc2eaee8ad6bc3d07cd2 | candycode/loco | /libloco/src/LocoWebKitAttributeMap.cpp | C++ | cpp | 3,437 | no_license | ////////////////////////////////////////////////////////////////////////////////
//Copyright (c) 2012, Ugo Varetto
//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 sourc... |
b06efd96e270b1be4659e1e81f9e42fe98242701 | 4f6aa20bb567d3d2c09cd806fecb4a19887f3aa1 | mutual-ai/CMake | /Source/cmGlobalVisualStudioGenerator.cxx | C++ | cxx | 31,105 | permissive |
/*============================================================================
CMake - Cross Platform Makefile Generator
Copyright 2000-2009 Kitware, Inc., Insight Software Consortium
Distributed under the OSI-approved BSD License (the "License");
see accompanying file Copyright.txt for details.
This softw... |
f2948fa2f738e59850bccd0a181a3ee1f75cc3ef | 3d53b264ecfe631fa114b8008db75ba52f557e44 | PrinceCuet77/Codeforces | /C++/A/584A Olesya and Rodion.cpp | C++ | cpp | 1,589 | no_license | /********************************************************************************
* *
* Author : Rezoan Shakil Prince *
* Batch : 14 ... |
1a69049d75b0fa5833cf24291ce5d2824052154c | 06b0ae047a19e7438d72eaf11984d98155ac41ab | Hamzaelkhatri/cpp_modules | /day02/ex01/Fixed.cpp | C++ | cpp | 1,350 | no_license | #include "Fixed.hpp"
int Fixed::getRawBits(void) const
{
std::cout << "getRawBits member function called" << std::endl;
return (this->point_value);
}
void Fixed::setRawBits(int const raw)
{
std::cout << "setRawBits member function called" << std::endl;
this->point_value = raw;
}
Fixed::Fixed()
{
... |
2bc26e3a562b5428a1c54f664fd7727d2b3e9b81 | c9e93d15147fc37ff04c2227ce8ed93275d570d3 | branan/psychic-dangerzone | /main.cpp | C++ | cpp | 2,901 | permissive | #include <SFML/Graphics.hpp>
#include <SFML/System/Clock.hpp>
#include <iostream>
#include <cmath>
#include <algorithm>
sf::Vector2f clamp(sf::Vector2f min, sf::Vector2f max, float width, float height, sf::Vector2f val) {
float x = std::max(min.x, std::min(max.x - width, val.x));
float y = std::max(min.y, std:... |
7c617a4beb9582565f51dc1e202c44b8b76bafa8 | da8808766af276b6737a05c00c30d18378740513 | JungHeeSeung/NetworkGameServer | /NGS_Client/SimpleGame/ScnMgr.cpp | C++ | cpp | 4,560 | no_license | #include "stdafx.h"
#include "ScnMgr.h"
#include "Dependencies\freeglut.h"
ScnMgr::ScnMgr()
{
sock = new Client_Socket();
// Initialize Renderer
m_Renderer = new Renderer(1000, 1000);
if (!m_Renderer->IsInitialized())
{
std::cout << "Renderer could not be initialized.. \n";
}
// Initialize m_Obj
for (int i... |
4ddf55a8b7722926be76b0c364a555c89fc9caff | dc90b7debbea7bba7e9d072683d12bda80d6b8ad | Kushagra-Kapoor25/Revising-CPP | /Arrays/ArrayDataStructure.cpp | C++ | cpp | 242 | no_license | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n = 5;
// Stack allocated
int arr[5];
int arr1[n];
// -----------------------------------------//
int *arr3 = new int[n]; // Heap allocated
return 0;
} |
1c0364df65097d7cdedf1ca8cb36d101c1100d19 | 2349d6f19c5d046b9a48a98aa29a79dc23d73283 | James534/Tempest | /src/model/interface/SimFPGAInterface.cpp | C++ | cpp | 3,142 | permissive | /*
* FPGAInterface.cpp
*
* Created on: Jan 17, 2015
* Author: ahsueh1996
*/
#include "SimFPGAInterface.h"
#include <string>
/* ==========================================================================
* INTERACTING WITH DATA COMING IN (FROM FPGA)
* ==================================================... |
60a19809edf6418ff2be479fa6ab06d6567a7618 | 1a8ac7e24b4d9d8848b4444f39a5680d23ea48a5 | kodxana/F44RedCoin | /src/bench/rpc_mempool.cpp | C++ | cpp | 1,255 | permissive | // Copyright (c) 2011-2019 The F44RedCoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <bench/bench.h>
#include <rpc/blockchain.h>
#include <txmempool.h>
#include <univalue.h>
static void AddTx(con... |
aaace20c8eb47af0d1aa4ea07fada73f5767a6a9 | 6176f6c18d695aae8c6153eecc366ca36c739145 | c3358/gecko-dev-comments-removed | /gfx/ots/src/gdef.cc | C++ | cc | 12,310 | permissive |
#include "gdef.h"
#include <limits>
#include <vector>
#include "gpos.h"
#include "gsub.h"
#include "layout.h"
#include "maxp.h"
#define TABLE_NAME "GDEF"
namespace {
const uint16_t kMaxClassDefValue = 0xFFFF;
const uint16_t kMaxGlyphClassDefValue = 4;
const uint16_t kMaxCaretValueFormat = 2;
bool Pars... |
ebd720c3b5123e0138f091dd5ec0d91271ea4011 | d6dbae1a8330811260328772c3f22813cc13aa9b | Saikat-S/acm-problems-solutions | /Codeforces/1215/C. Swap Letters.cpp | C++ | cpp | 6,146 | permissive | /***************************************************
* Problem Name : C. Swap Letters.cpp
* Problem Link : https://codeforces.com/contest/1215/problem/C
* OJ : Codeforces
* Verdict : AC
* Date : 2019-09-15
* Problem Type : Div/Edu -
* Author Name : Saikat Sharma
* University : CSE, MBS... |
a028bbf66c210cff6ba9b67a8e67f9d7e9e6e563 | 7e082e515f59fce0445f121c51d59d04b47be4ec | Jostyck9/Bomberman | /src/GameObject/Character/BotIA.cpp | C++ | cpp | 13,330 | no_license | /*
** EPITECH PROJECT, 2019
** bomberman
** File description:
** BotIA.cpp
*/
#include "BotIA.hpp"
#include "Wall.hpp"
BotIA::BotIA(irr::IrrlichtDevice *device, Map &map, ACharacter &character) : _clock(device), _map(map), _character(character)
{
_clock.restartClock();
}
BotIA::~BotIA()
{
}
void BotIA::getActio... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.