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 |
|---|---|---|---|---|---|---|---|---|
db6a93e85c296ed76bd61fb9c3b7e40f95125c0b | aedde49142c093df0d44056710c5b116ab7d6b76 | rogday/cadex_test | /libcurve/include/Ellipse.hpp | C++ | hpp | 653 | no_license | #pragma once
#include <Curve.hpp>
namespace curves {
class Ellipse : public Curve {
private:
const double m_radius_x;
const double m_radius_y;
public:
Ellipse(const double, const double);
Ellipse(const Ellipse &) = delete;
Ellipse(Ellipse &&) = delete;
Ellipse &operator=(const Ellipse &) = delete;
E... |
a4af94f1700f5c161f45ebe842a7fa9567b9bb82 | 628446a469dc489e3e4e1492c5a45996626faf29 | kratosaba/BattleTank | /BattleTank/Source/BattleTank/Tank.cpp | C++ | cpp | 1,233 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "Tank.h"
#include "TankAimingComponent.h"
// Sets default values
ATank::ATank()
{
// Set this pawn to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCanEverTick ... |
a457d659499d6dee1db29377c188a691dec73a1d | 09462b35eb8371a5f57e4ecfa54258688e2b948b | Hxxla-21/simpleProgramsC- | /Lab2.cpp | C++ | cpp | 2,131 | no_license | /******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, PHP, Ruby,
C#, VB, Perl, Swift, Prolog, Javascript, Pascal, HTML, CSS, JS
Code, Compile, Run and Debug online from anywhere in world.
*********... |
7d0b0b7553d34a954adbf97e6647cb82e8448df2 | 15791f2e5ebfa5d252c0c25aa7611a9b060d5dad | AlexHuck/TribesRebirth | /darkstar/Sim/code/netCSDelegate.cpp | C++ | cpp | 28,610 | no_license | #include "netCSDelegate.h"
#include "netPacketStream.h"
#include "netGhostManager.h"
#include "netEventManager.h"
#include "console.h"
#include "link.h"
DeclareLink(netCSDelegate)
#define Heartbeat_Frequency (120) // how often to send heartbeat, in seconds
IMPLEMENT_PERSISTENT(Net::CSDelegate);
namespace Net
{
s... |
60aceabf8bde0066dbf196a33aa4d85fde129b2b | e15a6a00d19e9f6cb33c566e0e32589e566f54ad | adMenon/Competetive-programing-codes | /SPOJ/ICANDIES.cpp | C++ | cpp | 414 | no_license | /* Author - Aditya Haridas Menon
Spoj id - ad2411
*/
#include <iostream>
using namespace std;
int main() {
// your code goes here
int t,x=1;
cin>>t;
while(t--)
{
int n,i=1,flag=1;
cin>>n;
while(flag&&(n-5*i)>0)
{
if(((n-5*i)%3)==0)
{
flag=0;
cout<<"Case "<<x++<<": "<<n-5*i<<endl;
... |
01487851b0e3b73de85d78213f1a69f2f5d51bc6 | 180385e8c28447231e758e80a019a92d00452ff2 | heon24500/PS | /Programmers/Practice Coding Test/43105.cpp | C++ | cpp | 628 | no_license | #include <string>
#include <vector>
using namespace std;
const int N = 500;
int dp[N][N];
int solution(vector<vector<int>> triangle) {
int answer = 0;
int len = triangle.size();
dp[0][0] = triangle[0][0];
for (int i = 1; i < len; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0) ... |
0f5d3784ac73db7fb586d01c7af9742063978d5f | e3e5d57f1bc0b39c42beec14c6a5c6a3836bccb6 | maayanlavi/SuperHeros | /Avengers.cpp | C++ | cpp | 3,215 | no_license | #include "Avengers.h"
Avengers::Avengers()
{
_superHeros = NULL;
_numSuperHeros = 0;
}
Avengers::~Avengers()
{
delete[] _superHeros;
}
void Avengers::saveType(ofstream& out, const SuperHero* hero) const
{
char type[2];
if (typeid(*hero) == typeid(SuperHero))
{
type[0] = 'S';
type[1] = ... |
fe481a0cf354158230eb8da497a2f54d74a0df1c | 7bb7d362fd30cfb4df1af5b44754b3ff442dd8d2 | tinkerfuroc/k2_client | /src/startIR.cpp | C++ | cpp | 3,250 | permissive | /*************************************************************************************
Copyright (c) 2013, Carnegie Mellon University
All rights reserved.
Authors: Anurag Jakhotia<ajakhoti@andrew.cmu.edu>, Prasanna Velagapudi<pkv@cs.cmu.edu>
Redistribution and use in source and binary forms, with or without modificati... |
e0dd074ad624c2d426d3c6d223bd80f34f9e6904 | 40fb6b6a5184d5346ba6c6e776cea43a15e222e5 | arasHi87/OnlineJudgeExercise | /poj3279.cpp | C++ | cpp | 282 | no_license | #include <cstdio>
#include <queue>
#include <algorithm>
#define mp make_pair
#define ft first
#define sd second
using namespace std;
const int maxN=20;
// typedef pair<string, int> pii;
int mp[maxN][maxN];
int d[4][2]={{1, 0}, {0, 1}, {0, -1}, {-1, 0}};
void bfs() {
} |
e3c8cbae04d0b6ede3e1d88c6813c85d2d60c891 | 948412e323060bae2deebf483b629db91dec8afa | wovo/godafoss-c- | /library/protocols/gf-i2c-profile.hpp | C++ | hpp | 3,091 | no_license | // =============================================================================
//
// gf-i2c-profile.hpp
//
// =============================================================================
//
// This file is part of godafoss (https://github.com/wovo/godafoss),
// a C++ library for close-to-the-hardware programming.
//... |
6fabd6b7252e48f3bdffb7243054bba60aaa442f | 400d5e5eb782b886a7a4a61594f0fad40db1a4dd | syberos-team/syberh | /packages/syberos/pluginmanager/src/utils/mimetypes/mimemagicrule.cpp | C++ | cpp | 14,495 | no_license | /****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtCore module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commerc... |
03d01796e8aaca712d1de8425fee9f4d357b3196 | 88decdaa945333ce612400041d6782403c5f5cdb | shoupon/lock-protocol | /fair-strategy.cpp | C++ | cpp | 2,241 | no_license | //
// fair-strategy.cpp
// lock-protocol
//
// Created by Shou-pon Lin on 7/28/15.
// Copyright (c) 2015 Shou-pon Lin. All rights reserved.
//
#include <sstream>
using namespace std;
#include "fair-strategy.h"
map<int, IdStatePairs> FairStrategy::tracked_;
string FairStrategyState::toString() {
stringstream s... |
75ed947b0c8c36a4f68878b9b9598c138cb4a9e7 | 2feddeb875babe60ff9b69507557d6656b7e2832 | mbortnichuk/42_Piscine_CPP | /d03/ex03/NinjaTrap.hpp | C++ | hpp | 1,297 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* NinjaTrap.hpp :+: :+: :+: ... |
9b269c0c709f64ae9589cf7fa22340aebe5d6699 | 106bf28f1a8dab6efb0b89f8c19997b83683f401 | bobshih/competitive_coding | /this summer/contest/NCTU_day8/error corrupt.cpp | C++ | cpp | 1,071 | no_license | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int m;
int matrix[105][105];
int row[105];
int column[105];
while(scanf("%d",&m) != EOF){
if(m == 0)break;
memset(row,0,sizeof(row));
memset(column,0,sizeof(column));
for(in... |
78a91bef486550ff6c00b4753c827ff4a9874dbc | b882a8723307c46281fc96cee972f58c0435fe47 | bhoeferlin/or-tools | /ortools/linear_solver/samples/linear_programming_example.cc | C++ | cc | 2,796 | permissive | // Copyright 2010-2021 Google LLC
// 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... |
85da36e263e2ba9719acd6afef827aa63c42a323 | 26650a4bf2cb434e5831ebdc24e1bfd381308c58 | Nukem9/DynScript | /dynscript/Engine/Dbg.cpp | C++ | cpp | 9,223 | no_license | #include "../stdafx.h"
namespace Script
{
namespace Dbg
{
void Init(asIScriptEngine *Engine)
{
//
// ENUMERATIONS/STRUCTURES
//
Engine->SetDefaultNamespace("");
RegisterDefaultEnums(Engine);
RegisterWindowsStructs(Engine);
RegisterDefaultStructs(Engine);
// Register all debugger variables and funct... |
7de62501cd4ab93163d944c4c2ca57e34100ea6a | 31f4b1f24597982d7726b4d1b7cf5e7bfac1d7b7 | google-code/2013-igraphic | /Practicas/Practica6/freeglut project 3D/freeglut project 3D/Elementos/Pata.cpp | C++ | cpp | 1,270 | no_license | //Carlos Giraldo
//Raquel Peces
#include "Pata.h"
Pata::Pata(void){
Cilindro *a=new Cilindro(12.5,10.0,10.0,15,10);
a->setColor(0.55,0.42,0.14);
addComponente(a);
Disco *i=new Disco(8.0,10.0,15,2);
i->obTraslate(0.0,0.0,10.0);
i->setColor(0.55,0.42,0.14);
addComponente(i);
Cilindro *b=new C... |
959c654ca961b0d35f02321929c8dc650f1c2b0b | 43d07ac204baead195bd068b3de433779d74ebca | smoteval/Contest-Problems-USACO- | /Chapter 1 (Beginner)/pprime.cc | C++ | cc | 2,872 | no_license | /*
ID: smoteva1
LANG: C++
TASK: pprime
*/
#include <iostream>
#include <map>
#include <fstream>
#include <algorithm>
#include <math.h>
using namespace std;
bool isPrime (int num)
{
if (num <=1)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return fa... |
f40d6fc1a072f61a9d5556b9da042697848dc2e5 | aa1f8a6109ad0588c7bc8c5f0d5e374eddb726a5 | ryanyhuang/trpclib | /gen/ServerBase.hpp | C++ | hpp | 682 | no_license | #include <string>
#include "rpc/server.h"
class ServerBase {
public:
ServerBase(int port) {
srv = rpc::server(port);
}
virtual int add(int a, int b);
virtual int mult(int a, int b);
void launch() {
srv.bind("add", [](int a, int b) {
try {
return add(a, b);
... |
e158a1df8e683f94a4265871b3dc2137458d2a62 | fd1b5a5397bb848d57eae6d0c1fe2d4b24763207 | wfwongac/mylibgit2 | /C++_Projects/Transports_System/PA33/FlatFare.cpp | C++ | cpp | 3,404 | no_license | /* FlatFare.cpp
* - the source file for the implementation of the methods of FlatFare class
*/
#include "FlatFare.h"
// Add the implementation of the methods here
// the default constructor to initialize
//the name and id to empty string and 0.
FlatFare::FlatFare()
:Transport("", 0){ }
//the constructo... |
6e5e73d4134d384a8b541b62d05aab434148e3ee | f3dd593bd3d37b229c6bd3d2193b46cfbea2008d | cjacker/windows.xp.whistler | /source/RPC/LOCATOR/SERVER/BINDING.CXX | C++ | cxx | 17,850 | no_license | /*++
Copyright (c) 2000 Microsoft Corporation
Module Name:
binding.cxx
Abstract:
This file contains the code to implement the remoted API functions.
This implements the NSI binding object APIs.
Author:
Steven Zeck (stevez) 04/01/92
--*/
#include "core.hxx"
extern NSI_INTERFACE_ID_T NilNsiIfIdOn... |
4c9721e54858de978611e599ede1de2e1de3c587 | 0b5d15b42eb6d3e334f020c94b4997c394d6ff2f | raghavanv97/chromium | /chrome/browser/ui/views/overlay/overlay_window_views_unittest.cc | C++ | cc | 10,647 | permissive | // Copyright 2020 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 <memory>
#include <utility>
#include "chrome/browser/ui/views/overlay/overlay_window_views.h"
#include "chrome/test/base/testing_profile.h"
#inc... |
5bb746aa5500f888aa90d5b8dd79c1d88a138418 | 66ab0c1bd122eb215732bb327a4fd81a9ce83b95 | caiquecastro/code-challenges | /max-divisors/main.cpp | C++ | cpp | 389 | no_license | #include <iostream>
using namespace std;
int main(int argc, char** argv) {
int number, remaining, divisor = 2, count = 0;
if (argc < 2) {
cout << "Invalid input" << endl;
return 1;
}
number = remaining = atoi(argv[1]);
while (remaining > 1) {
while (remaining % divisor == 0) {
remaining /= divisor;
... |
a0d0608b9e97580d9411e9b2fdac3c66a3870032 | 10588cd278ce80e78aaa8d082f88b460bf5f2ae3 | asgeir/old-school-projects | /computer_graphics/junkyard/assignments/1.1/ass11.cpp | C++ | cpp | 6,957 | no_license | #include "gl_core_3_2.h"
#include "SDL.h"
#include "SDL_opengl.h"
#include <Eigen/Dense>
#include <Eigen/Geometry>
#include "loadshaders_3_2.h"
#include <cmath>
#include <iostream>
#include <stdint.h>
namespace {
constexpr GLubyte *bufferOffset(size_t bytes)
{
return static_cast<GLubyte *>(0) + bytes;
}
const ... |
703e6ca5349cba3d7fc3b5113cf5f78374c59613 | f53f704bf7391f00ca6db97ccb8ec39bcdcde28d | bstatcomp/math | /lib/boost_1.72.0/boost/mpi/collectives/scatterv.hpp | C++ | hpp | 5,627 | permissive | // Copyright (C) 2011 Júlio Hoffimann.
// 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)
// Message Passing Interface 1.1 -- Section 4.6. Scatterv
#ifndef BOOST_MPI_SCATTERV_HPP
#de... |
728500dc20d6db5b6d7e80d743b78998016dcd4d | 09720f2d61f59bf22e59f936daed9c1f49841b5b | evugar/Mcucpp | /tests/UnitTests/7Segments.cpp | C++ | cpp | 2,488 | permissive | #include <drivers/7segments.h>
#include <iopins.h>
#include <pinlist.h>
#include <gtest/gtest.h>
#include <iostream>
#include <template_utils.h>
using namespace Mcucpp;
using namespace IO;
using namespace IO::Test;
typedef PinList<Pa0, Pa1, Pa2, Pa3, Pa4, Pa5, Pa6, Pa7> Segments;
typedef PinList<Pb0, Pb1,... |
29b6785b7cd09494365a020debab0084e57a612c | b55e1a2cf52255040b3250da0a363e68f0ee7e90 | vitae-labs/Vitae | /src/qt/editaddressdialog.cpp | C++ | cpp | 4,747 | permissive | // Copyright (c) 2011-2018 The Bitcoin Core developers
// Copyright (c) 2020-2021 The Vitae Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <qt/editaddressdialog.h>
#include <qt/forms/ui_editaddressdialo... |
f26a012de29eb37467bf58d7e0f03c56f60a1aba | 424209bcab13f317090a3928a55e1f408fe2aba2 | mrtos/ambarella | /playback/amf/src/engines/active_ve_engine.cpp | C++ | cpp | 51,857 | no_license |
/**
* active_veengine.cpp
*
* History:
* 2011/08/15- [GangLiu] created file
*
* Copyright (C) 2011, Ambarella, Inc.
*
* All rights reserved. No Part of this file may be reproduced, stored
* in a retrieval system, or transmitted, in any form, or by any means,
* electronic, mechanical, photocopying, record... |
354c6bd84cf682489a9cf266cfa10815b32cc6a4 | 66c30eb1006782ab15440dfa7e1366a7950a2c1c | DharshanV/Ray-Tracing | /src/Cubemap/Cubemap.cpp | C++ | cpp | 2,978 | no_license | #include "Cubemap.h"
#define STB_IMAGE_IMPLEMENTATION
#include "stb_image.h"
Cubemap::Cubemap() {}
Cubemap::Cubemap(const std::vector<const char*>& faces) {
if (faces.size() != 6) return;
int width, height, nChannels;
for (const char* pathi : faces) {
u_char* data = stbi_load(pathi, &width, &heig... |
36982836b37450c025241b256e4328c6d04f7783 | 8bae41b5e8d00c0e897a01f88adcac464b00a219 | yuasatakayuki/SpaceWireRMAPLibrary | /includes/Boards/SpaceFibreADCBoardModules/SemaphoreRegister.hh | C++ | hh | 3,333 | no_license | /*
* SemaphoreRegister.hh
*
* Created on: Dec 14, 2013
* Author: yuasa
*/
#ifndef SEMAPHOREREGISTER_HH_
#define SEMAPHOREREGISTER_HH_
#include "SpaceWireRMAPLibrary/Boards/SpaceFibreADCBoardModules/Types.hh"
#include "SpaceWireRMAPLibrary/Boards/SpaceFibreADCBoardModules/RMAPHandler.hh"
/** An internal cl... |
46f88fc035e37653b9abaab7caaa4596c3919166 | 64c6c18f1e70f8634c7b184fe66c78d1644d5af8 | dandavid3000/Code | /C/Projects/Algorithms/Village_Euler/0941037/Source/0941037/0941037/Graph.cpp | C++ | cpp | 8,186 | no_license | #include "StdAfx.h"
#include "Graph.h"
CGraph::CGraph(void)
{
}
CGraph::~CGraph(void)
{
}
//=============================== GET - SET ======================================
void CGraph::GanDoCaoNgapNuoc(int n)
{
_doCaoNgapNuoc = n;
}
void CGraph::GanDoDaiNangCap(int n)
{
_doDaiNangCap = n;
}... |
91b3c9bebe6ee49272aa60546c8993fbf56604e0 | d3875f837d0cc2edc4507b3b8ad7e7b0edbc6c91 | ROCO504/2018-Group8 | /Code/Twisting_Jig_OS/STEPPER_MOTOR.cpp | C++ | cpp | 6,974 | no_license | #include "mbed.h" //Include the mbed libraries
#include "STEPPER_MOTOR.hpp" //Include the header file, this acts like a series of forward declarations
//Constructor
STEPPER_MOTOR::STEPPER_MOTOR(PinName N1, PinName N2, PinName N3, PinName N4) : pin1(N1),pin2(N2),pin3(N3),pin4(N4)
{
_dir = ... |
b9a2c0a0a73abdc2ac465079d9b778c6d343f6de | bb382ebdb2e1c1c0774476424d7703c34edfbc45 | dtbinh/qdirweigraph | /main.cpp | C++ | cpp | 289 | no_license |
#include <QApplication>
#include "mainwindow.h"
#include <QDebug>
#include <stdlib.h>
//TODO
//modes
//display title
// curve
int main(int argc, char *argv[])
{
QApplication app(argc, argv);
MainWindow window;
window.show();
return app.exec();
}
|
588ccbe27a6a9dacd1d20465524fe03914728cfb | 0bf15fe8df86a77b3e07d7a300f1752d7443c448 | niuxu18/logTracker-old | /second/download/curl/gumtree/curl_old_log_2515.cpp | C++ | cpp | 519 | no_license | fputs(
" ple, for host names starting with \"ftp.\" curl will assume you want to\n"
" speak FTP.\n"
"\n"
" Curl will attempt to re-use connections for multiple file transfers, so\n"
" that getting many files from the same server will not do multiple con-\n"
" nects / handshakes. This im... |
f339a67c9a917dd174d72d3c0f82c9186a9680ea | 6092db7e74b0ab950018275018a92f50a21d51dd | jixhua/QQmlQuickBook | /sstd_utility/windows_boost/boost/property_tree/detail/ptree_implementation.hpp | C++ | hpp | 30,528 | no_license | // ----------------------------------------------------------------------------
// Copyright (C) 2002-2006 Marcin Kalicinski
// Copyright (C) 2009 Sebastian Redl
//
// 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... |
f4e4c62e7d7705049de2d988b70e72f24be6c16c | 912fa1c22e8d0cd3881b92e738b271dd3e757451 | PatrickDarcy/Animated-Sprites-FSM | /AnimationFSM/Idle.cpp | C++ | cpp | 558 | no_license | #include <Idle.h>
#include <Jumping.h>
#include <Climbing.h>
#include <string>
void Idle::handleInput() {}
void Idle::update() {}
void Idle::jumping(Animation* a)
{
std::cout << "Idle -> Jumping" << std::endl;
a->setCurrent(new Jumping());
delete this;
}
void Idle::climbing(Animation* a)
{
std::cout << "Idle -> ... |
ac38bc01a907943a68be0191b7249cce2fcb05aa | 553569b2ded74b5efba7282fece4443d0fbf2fc8 | geoffpaulsen/utilities | /include/utility/detail/memory_view/as_base.hpp | C++ | hpp | 551 | no_license | #ifndef UTILITY_DETAIL_MEMORY_VIEW_AS_BASE_HPP
#define UTILITY_DETAIL_MEMORY_VIEW_AS_BASE_HPP
#include "memory_view_class.hpp"
#include "representation.hpp"
namespace utility::detail::memory_view {
template <Representation base, typename Value_t>
auto as_base(const Value_t& value, bool separators) -> std::string
{
... |
1defd9c5c0f7d89c80afb66b9e0bd8b0d2b92636 | 527f1d747b36507ef731aa155e67947f2815e1a9 | tanlabcode/FCOP | /FCOP.cpp | C++ | cpp | 21,380 | no_license | ///////////////////////////////////////////////////////////////////////////////
// Written by : Li Teng, The University of Iowa, li-teng@uiowa.edu
// Date : Aug. 2013
///////////////////////////////////////////////////////////////////////////////
#include <time.h>
#include <stdio.h>
#include <unistd.h>
#include... |
22c5dd93f437f63b08643f75272422a33cdcaa11 | a8152ee7be65f4edd39f68f03f9cf149dfe24388 | cnsuhao/kiui | /src/Ui/Frame/mkInk.cpp | C++ | cpp | 1,664 | permissive | // Copyright (c) 2015 Hugo Amiard hugo.amiard@laposte.net
// This software is provided 'as-is' under the zlib License, see the LICENSE.txt file.
// This notice and the license may not be removed or altered from any source distribution.
#include <Ui/mkUiConfig.h>
#include <Ui/Frame/mkInk.h>
#include <Ui/Widget/mkWi... |
4975bf7137797af4e94a3336b27584fb2406186d | 28c74f39dada5ea49f513bb36dad1039225cae9c | 2LeoCode/CPP_Module_03 | /ex02/ScavTrap.hpp | C++ | hpp | 3,407 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ScavTrap.hpp :+: :+: :+: ... |
20530e23195c2b986c3cb0a94bebe228fec2ad84 | 689281f701564f34f1e312cc1d2e5ce32953102b | TruongThiAnHai/Programming-C- | /lab2.cpp | C++ | cpp | 8,551 | no_license | #include<iostream>
#include<string.h>
#include<conio.h>
#include<math.h>
#include<stdio.h>
#include<malloc.h>
using namespace std;
class student
{
public:
char *name;
int age;
int number;
int score;
};
class teacher
{
public:
char *name;
int n... |
320fc2fea72fad2c7c598bc7d2403fc8b647eede | 0b58fc8ddf5f04960f1a22999f6e3f2e0f8e5975 | Thomas-p2-Elliott/ZombZ-Overpoch-Cherno-Code | /Resources/gorsyshiz/Webtools/ammo/hpp/NeutralSubmachineGunAmmo.hpp | C++ | hpp | 1,923 | no_license | class Category_648 {
class vil_32Rnd_UZI_SD {
type = "trade_items";
buy[] ={8};
sell[]={4};
};
class vil_32Rnd_uzi {
type = "trade_items";
buy[] ={8};
sell[]={4};
};
class 30Rnd_9x19_MP5 {
... |
c9e305c9050b704eb403d3fc85c05077b2ad81cb | 21dc226e9ff32af8a85e0feff36d4eb888a918e5 | Samsung/Castanets | /ui/events/base_event_utils.cc | C++ | cc | 2,096 | 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 "ui/events/base_event_utils.h"
#include "base/atomic_sequence_num.h"
#include "base/command_line.h"
#include "base/lazy_instance.h"
#include "ba... |
d4d1a69359bd987977975f356bc4760a69ee256e | 375a84ab839723ae053dc48d8b3794de957a9c00 | ExpLife/Norton_AntiVirus_SourceCode | /AVCore/AVCoreOR_NAV_r8.04/Source/navapi/SRC/NAVCB.CPP | C++ | cpp | 83,572 | no_license | // Copyright 1996 Symantec, Peter Norton Product Group
//************************************************************************
//
// $Header: S:/NAVAPI/VCS/navcb.cpv 1.15 02 Sep 1998 13:00:20 dhertel $
//
// Description:
// NAV callback implementation for AVAPI 1.0.
//
// Contains:
// gstNAVFileC... |
c5a446b9d903cf0be78a38be8a21966c77de1c50 | 7d707bf5a755f1b10d337875210b472612e1255b | imharrywu/Anakin-1 | /framework/operators/aligned_mat_mul.cpp | C++ | cpp | 4,007 | permissive | #include "framework/operators/aligned_mat_mul.h"
namespace anakin {
namespace ops {
#define INSTANCE_ALIGNED_MAT_MUL(Ttype, Ptype) \
template<> \
void AlignedMatMul<Ttype, Ptype>::operator()(OpContext<Ttype>& ctx, \
const std::vector<Tensor4dPtr<Ttype> >& ins, \
std::vector<Tensor4dPtr<Ttype> >& outs) { \
... |
e2f638d030da154b95e5b26e610513f4abc1c7a0 | cc95f3cd34c8141783af48a475046072a51481c5 | JanJyuHo/voipCall | /debug/moc_voipaccount.cpp | C++ | cpp | 4,353 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'voipaccount.h'
**
** Created by: The Qt Meta Object Compiler version 67 (Qt 5.11.2)
**
** WARNING! All changes made in this file will be lost!
********************************************************... |
ce0730d7ebab9cfe5ba3731e0e1097ac0535bb0d | dc491add1c92fed249cadfa49cf687bc10eae1c1 | shamozhishu/VayoEngine | /main/3d/src/Vayo3dTessGridHandler.cpp | C++ | cpp | 29,308 | no_license | #include "Vayo3dTessGridHandler.h"
#include "Vayo3dTessGridBuilder.h"
#include "Vayo3dTessGridParser.h"
#include "VayoConfigManager.h"
#include "Vayo3dRenderSystem.h"
#include "Vayo3dSceneManager.h"
#include "VayoLine2d.h"
#include "Vayo3dRoot.h"
#include "VayoUtils.h"
#include "VayoLog.h"
NS_VAYO3D_BEGIN
void TessGr... |
7866d969b12d267101a834c1fc9dd7b002e013b9 | e1a813059c24ba13a88f4678f3ca834e946efb13 | inbei/shs | /src/core/shs_sys.cc | C++ | cc | 1,313 | no_license | #include "shs_sys.h"
int sys_get_info(sys_info_t *sys_info)
{
// get cpu info and set cacheline size
uint64_t pages = 0;
// pag esize
#if defined(_SC_PAGESIZE)
sys_info->pagesize = sysconf(_SC_PAGESIZE);
#elif defined(_SC_PAGE_SIZE)
sys_info->pagesize = sysconf(_SC_PAGE_SIZE);
#else
sy... |
48ec6d5a54acbfd24f773ede8403e5c479d4e60f | 0d7520aaa0e6e073089b9be25fccfe644bfaa37e | takadev/learning-cpp | /tutorial/const_func.cpp | C++ | cpp | 353 | no_license | #include<string>
#include<iostream>
using namespace std;
class hoge {
public:
string str;
mutable string m_str;
void print() const {
//str = "fuga";
m_str = "fuga";
cout << str << endl;
cout << m_str << endl;
}
hoge(string str) {
this->str = str;
this->m_str = str;
}
};
int main() {
hoge obj("hoge ... |
b9d19f91d7f9598258d10a6edf70321fd88937b9 | 5b0a3907ea0c9dea8c03ccf5f8e16b3a40ec659f | takke/sakura | /sakura_core/charset/CCodeMediator.cpp | C++ | cpp | 2,756 | permissive | /*! @file */
/*
Copyright (C) 2018-2021, Sakura Editor Organization
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,... |
bf56842ae6d176dbaada581764b65d33dd0d018e | 64db8a560632ec9652b22d7adeb92773aa29f913 | matteobarbieri/titan | /src/libtcod/zip.hpp | C++ | hpp | 12,288 | permissive | /* BSD 3-Clause License
*
* Copyright © 2008-2019, Jice and the libtcod contributors.
* 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 ... |
098b559e38858484868a8c83bccd0b064f87fd4d | ec28a7d11e25404629f07c9cac641a7ed6d4c59d | leo-cazenille/CATS2 | /source/hub/QueueHub.cpp | C++ | cpp | 1,610 | no_license | #include "QueueHub.hpp"
#include"Multiplicator.hpp"
#include <TimestampedFrame.hpp>
#include <QtCore/QThread>
/*!
* Constructor.
*/
QueueHub::QueueHub(TimestampedFrameQueuePtr inputQueue)
{
// launch the incoming frames conversion in separated thread
QThread* thread = new QThread;
m_multiplicator = QS... |
2e9609ec16deee32ee3bf3dd7cb39057e620d39c | 2dc041d8b4bbbd0d2f1ec5855fad2cbfe66bdbde | sumedhak27/TrashCoding | /producer_consumer.cpp | C++ | cpp | 2,262 | no_license | #include <iostream>
#include <pthread.h>
#include <semaphore.h>
#include <unistd.h>
using namespace std;
const int BUFFERSIZE = 10;
int buffer[BUFFERSIZE]{-1}, index = 0, nop = 0;
pthread_mutex_t mutex;
sem_t full_slots, empty_slots;
void* produce(void*) {
sleep(1);
sem_wait(&empty_slots);
pt... |
8007bf26f5d600230bfd4bcc7688aa3117d8338c | dc367fa170d483b62ba1a3b70ce56e7c498ec596 | markstev/tensixty | /tests/commlink_pair_test.cc | C++ | cc | 4,537 | permissive | #include <gtest/gtest.h>
#include "cc/commlink.h"
#include "arduino_simulator.h"
#include "cc/serial_interface.h"
namespace tensixty {
namespace {
TEST(PairTest, SendBothWays) {
FakeArduino s0, s1;
ASSERT_TRUE(s0.UseFiles("/tmp/send_bidir_a", "/tmp/send_bidir_b"));
ASSERT_TRUE(s1.UseFiles("/tmp/send_bidir_b", "... |
8ec0ba2c98819f6d79b3c2c8b6e9f9bbab0bdf11 | 804deb8de9e9248e79b883de9ac2bdcc79d3a9f6 | arpnetwork/arpcap | /jni/libarpcap/dummy/ScreenCapture.cpp | C++ | cpp | 1,016 | permissive | /*
* Copyright 2018 ARP Network
*
* 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... |
1fb2225a1992d4cef599dc0b7876f7cdc159f9ec | 9153968d7ffe6a34ef47e8b2efd3a6ba3eac1e20 | rishavjnv12/Code-backup | /prime/sieveofera.cpp | C++ | cpp | 417 | no_license | #include <bits/stdc++.h>
#define MAX 100000001
using namespace std;
bool prime[MAX];
void seive(){
memset(prime,true,sizeof(prime));
for(int i=2;i*i<=MAX;i++){
if(prime[i]){
for(int j=i*i;j<=MAX;j+=i){
prime[j]=false;
}
}
}
}
int main(){
seive();
... |
2f251f9ce3a260ca1ac9c14ad44135535a471858 | ce901378dfbc9ab55af244c5c8bb0091f6c53583 | Rainboylvx/pcs | /loj/_10133/3.cpp | C++ | cpp | 2,842 | no_license | #include<cstdio>
#include<algorithm>
#include<iostream>
#define ll long long
using namespace std;
inline int read()
{
int ret=0;
char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9')
ret=(ret<<1)+(ret<<3)+ch-'0',
ch=getchar();
return ret;
}
int n,m,cnt,num,t1,t2,ans;
ll s;
const int ... |
c7e9d305a83426938ed14dd17a90b94cc3ef30f1 | 72f14fec8c1627bdf909315f682062f44c3420a5 | vaibhavxlr/CPP-Standard-Codes | /Binary Trees + BST + Heaps/Kth largest in a unsorted array.cpp | C++ | cpp | 324 | no_license | class Solution {
priority_queue<int, vector<int>, greater<int> > minHeap;
public:
int findKthLargest(vector<int>& nums, int k) {
for(int i : nums) {
minHeap.push(i);
if(minHeap.size() > k) {
minHeap.pop();
}
}
return minHeap.top();
... |
ea6e59704ebd9e3aa75da8be8d7dac7ba42a29bb | 151f18578d81ec6259ffa8468c1a6b78e55e8893 | pawanw17/dsr-graph | /graph-related-classes/graphviewer.cpp | C++ | cpp | 11,051 | no_license | /*
* Copyright 2018 <copyright holder> <email>
*
* 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 la... |
89043da876d6241607cfdb5f4cf9565b01087329 | 642690791d0b8a156c9fef47bcfad7589296eb26 | brentp/GLnexus | /test/cli.cc | C++ | cc | 4,693 | permissive | #include <iostream>
#include <fstream>
#include <map>
#include "spdlog/spdlog.h"
#include "BCFKeyValueData.h"
#include "BCFSerialize.h"
#include "cli_utils.h"
#include "catch.hpp"
#include "spdlog/sinks/null_sink.h"
using namespace std;
using namespace GLnexus;
static auto console = spdlog::create<spdlog::sinks::null... |
809af02efe553449e33b793b49d68b7cfd712203 | e401e6b191991d0a75b397f4cfd61cd5d4a9634e | HarounGY/HiveWE | /HiveWE/GroundTexture.cpp | C++ | cpp | 1,456 | permissive | #include "stdafx.h"
GroundTexture::GroundTexture(const fs::path& path) {
if (path.extension() == ".blp" || path.extension() == ".BLP") {
BinaryReader reader = hierarchy.open_file(path);
auto [width, height, data] = blp::BLP(reader).mipmaps.front();
tile_size = height * 0.25;
extended = (width == height * 2);... |
f051a90a73ef0037417d57092e2af4d19781764a | 9f30c179ad1fcc5a62752b03cd75f17e2563f500 | ShahPranav1094-Courses/Algorithms-DataStructures | /Recursion/IndirectRecursion.cpp | C++ | cpp | 320 | no_license | #include <iostream>
using namespace std;
void funB(int n);
void funA(int n)
{
if (n > 0)
{
cout << " " <<n;
funB(n - 1);
}
}
void funB(int n)
{
if (n > 1)
{
cout << " " << n;
funA(n / 2);
}
}
int main()
{
funA(20);
system("pause");
return 0;
} |
af44094e830705629278372fef5bf89979de6f57 | d135be1d93646c0624621d8a0bd2dd192785024c | Ghabriel/FormalLanguageUtils | /include/IndexList.hpp | C++ | hpp | 1,429 | no_license | #ifndef INDEXLIST_HPP
#define INDEXLIST_HPP
#include <cmath>
#include <functional>
#include <ostream>
#include <vector>
#include "utils.hpp"
/*
* A data structure focused on storing sequential values in the range [0, size)
* in which insertion, search and removal are all O(1) operations. Utilizes
* ceil(size / 64)... |
ab1a5743b5ba09778d57e6a6f7bc60ae78a8a09e | 9b948548d1dfc130a5fefb8277832bbcbaa5f61f | talalbutt/ns3.9-vanet-highway | /Controller.cc | C++ | cc | 31,183 | no_license | /* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2005-2009 Old Dominion University [ARBABI]
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation... |
0eaab4ff06c47d9416baf238e9a492bacd07a4ed | 3fd3e5e256aeb9d901a175213ef75b1dc23823ae | icoty/xml_parser | /Xml_Nthread.cpp | C++ | cpp | 17,813 | no_license | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <unistd.h>
#include <memory>
#include <unistd.h>
#include <pthread.h>
#include <string>
#include <time.h>
#include <functional>
#include <pthread.h>
#include <iostream>
#include <deque>
#include <map>
#include <stack>
#include <... |
319a00ab04dff2888f3f05d441f727d741013014 | d4a0fd6b3d477bd64630c61fd620b4fb92ce1b4f | Kabouik/nmail | /src/imap.cpp | C++ | cpp | 29,107 | permissive | // imap.cpp
//
// Copyright (c) 2019-2021 Kristofer Berggren
// All rights reserved.
//
// nmail is distributed under the MIT license, see LICENSE for details.
#include "imap.h"
#include <libetpan/imapdriver_tools.h>
#include <libetpan/libetpan.h>
#include "auth.h"
#include "crypto.h"
#include "flag.h"
#include "ima... |
92b67c2ba5a2185d13ae61bfe4e09941216e5ef6 | e095819004c8dd9b5f8310bbc489b029213c3d18 | huhuhu1092/test-server | /seengine_c++/main.cpp | C++ | cpp | 579 | no_license | #include "SE_Vector.h"
#include "SE_Matrix.h"
#include "SE_SimObject.h"
#include "SE_Time.h"
#include <map>
#include <string>
int main(int argc, char** argv)
{
SE_SimObject* p = (SE_SimObject*)SE_Object::create("SE_SimObject");
printf("##%p##\n", p);
std::map<std::string, int> tMap;
tMap["teeqerqdcgert"... |
b8407e96adc517a256346553aa2e65bacc4a357d | 512d6bb59021a6aea374a85cfd071e7151f08cd0 | Milchshakee/SGpp | /datadriven/src/sgpp/datadriven/activeSubspaces/MSplineNakBsplineScalarProducts.cpp | C++ | cpp | 4,893 | permissive | // Copyright (C) 2008-today The SG++ project
// This file is part of the SG++ project. For conditions of distribution and
// use, please see the copyright notice provided with SG++ or at
// sgpp.sparsegrids.org
// #ifdef USE_EIGEN
#include <sgpp/datadriven/activeSubspaces/MSplineNakBsplineScalarProducts.hpp>
namespa... |
d561c4d44e18c41731eebe93166d62c10969ef46 | f0711df4953e4b070b216252e1781590e9dbaa03 | lauer3912/chromium.src | /cc/resources/content_layer_updater.cc | C++ | cc | 3,227 | permissive | // Copyright 2011 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/resources/content_layer_updater.h"
#include "base/debug/trace_event.h"
#include "base/time/time.h"
#include "cc/debug/rendering_stats_instru... |
82e2f59a6fd2ffe9ebc4f0be213adddd90d7b873 | f117442c43af4ff290bb68cee26ca8b3daa782d4 | jamesy36/Project-1B | /code/threads/threadtest.cc | C++ | cc | 18,604 | permissive | // threadtest-submit.cc
// Set of test cases for Project 1B
//
// NOTES:
// - uses testnum (parsed in main.cc as -q flag) to determine which test(s) to run
// - -1 means run all tests
// - 1-n are the individual tests (where there are n tests defined, see TestNumber below)
//
// Copyright (c) 1992-... |
faeea34e72e15f8ee5b44adbdb32da87c707a6bf | 854e557b116b051725fb123b5e96a55f94f1649d | kakoeimon/04_BatleTanks | /BattleTank/Source/BattleTank/Private/TankAimingComponent.cpp | C++ | cpp | 2,797 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "BattleTank.h"
#include "TankBarrel.h"
#include "TankTurret.h"
#include "Projectile.h"
#include "TankAimingComponent.h"
// Sets default values for this component's properties
UTankAimingComponent::UTankAimingComponent()
{
// Set... |
f2e606d9bdbe86fee95a42ac76146d1e3980b7db | 14953fb5f6bb7e271ee81937c1123cbd82cd0477 | fhiroki/atcoder | /ARC/arc044/a/main.cpp | C++ | cpp | 816 | no_license | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
bool isPrime(int n) {
if (n == 1)
return false;
else if (n == 2)
return true;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}... |
eb4a04482981c79d7b2ed30b77b2f854b8928d00 | 96fa529548843972178b9bb7e47849e7fc04e9fd | wzyy2/chromium-browser | /chrome/browser/crash_recovery_browsertest.cc | C++ | cc | 8,253 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <utility>
#include "base/base_switches.h"
#include "base/command_line.h"
#include "base/files/file_path.h"
#include "base/macros.h"
#include... |
5127c55c5199e0cb15eaa122c3da30a03bf70c78 | f496e12718b27b778ed3f27123c4522df4a6e0d2 | tsuro624/2013teresAI | /2013teresAI/2013teresAI/update_stage.cpp | C++ | cpp | 460 | no_license | #include "Data.h"
void update_stage(int Stage[WIDTH][HEIGHT],AI_T ai[],Tagger tagger,Takara takara){
for(int i=0;i<WIDTH;i++){
for(int j=0;j<HEIGHT;j++){
if(i==0 || j==0 || i==WIDTH-1 || j==HEIGHT-1){
Stage[i][j]=1;
}
if(Stage[i][j]!=1)Stage[i][j]=0;
}
}
for(int i=0;i<AI_NUM;i++){
if(ai[i].entry=... |
e878f07ba0ea816ed7d41a5fa94c79b669538003 | 8ac30b9603bc8b13ac8b249f19ed6a7ae8e84bb7 | fatrar/yiqiulib | /tvt/src/DebugUtil/DebugUtil/Trace.cpp | C++ | cpp | 1,562 | no_license | /**CPP*************************************************************************
File : Trace.cpp
Subsystem :
Function Name(s): CTrace
Author : YiQiu
Date : 2010-3-22
Time : 13:48
Description :
Revision :
History
-------
Copyri... |
2d1ea13041d6340dff559e6810df6869b46f5186 | d7f67fb3833033f14e7ec4fb14c93823ec35a2cd | edmundnoble/bigolchungus | /app_worker.cpp | C++ | cpp | 2,359 | no_license | #include <cstdio>
#include <cstring>
#include <cassert>
#include <cstdint>
#include <inttypes.h>
#include "blake2s_ref.h"
#include "common.h"
#include "opencl_backend.hpp"
int app_worker(int argc, const char * const * argv) {
// minerboi worker <fifo_in> <fifo_out>
// Takes 2 FIFO ports and the target hash a... |
8f89e345450840cc775e66b7fb7b7d3689bc1aea | cff0c8ccf963ba3fb4c00ee466b327ceae5bdce2 | Mohib04/Competitive-Programming | /LightOJ/1091 - The Fastest Sorting Ever!.cpp | C++ | cpp | 2,062 | no_license | ///else if cannot be printed this way. correct way : else\nif
#include<bits/stdc++.h>
#define ll long long int
#define vii vector<int>
#define vll vector<ll>
#define pb(x) push_back(x)
#define pp() pop_back()
#define LIM 10000000
#define MOD 1000000007
#define MAX 10000000
#define pi acos(-1)
#define segVar int lft = ... |
0828a004a91fe92d752656e30f5f49710ada8c42 | efca4bca39ee08b035c1009519af83f87f927832 | meniossin/src | /ash/shell/window_watcher_shelf_item_delegate.cc | C++ | cc | 1,617 | permissive | // Copyright 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 "ash/shell/window_watcher_shelf_item_delegate.h"
#include <utility>
#include "ash/shell/window_watcher.h"
#include "ash/wm/window_util.h"
#incl... |
613a42d1f79aff3e681f39d4451937ded63cef4d | 3a0bee208c59fd7d6237c552816c1ab588922e75 | roussukke/Yorozuya | /library/ATF/tagREGISTERWORDA.hpp | C++ | hpp | 278 | permissive | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
START_ATF_NAMESPACE
struct tagREGISTERWORDA
{
char *lpReading;
char *lpWord;
};
END_ATF_NAMESPACE
|
d59a92e01b33287e9312489ad09396485c26195d | b51d0e91d42a9991a86c8501bd958908258d76b3 | jochenschneider/RaftLib | /portexception.cpp | C++ | cpp | 1,483 | permissive | /**
* portexception.cpp -
* @author: Jonathan Beard
* @version: Wed Sep 3 14:52:27 2014
*
* Copyright 2014 Jonathan Beard
*
* 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:
*
* ... |
de2e40a0d757e291f75a760ad5079d75f38151ec | 4375f97fa77c7c1c68034895a46b8494dadbfd24 | lyxm/blaze | /blazetest/src/mathtest/smatdmatmult/MCbHDa.cpp | C++ | cpp | 4,540 | permissive | //=================================================================================================
/*!
// \file src/mathtest/smatdmatmult/MCbHDa.cpp
// \brief Source file for the MCbHDa sparse matrix/dense matrix multiplication math test
//
// Copyright (C) 2013 Klaus Iglberger - All Rights Reserved
//
// This fil... |
36caddc7ac5ce58fa73dbd627fc6aa2ab0d7e4e6 | 70f5438a65a006d939c37504c31001e2cee9ec3f | jcd1994/MatlabTools | /Compiled/blaze-3.2/blazetest/src/mathtest/smatdmatsub/MCaM6x6b.cpp | C++ | cpp | 3,795 | permissive | //=================================================================================================
/*!
// \file src/mathtest/smatdmatsub/MCaM6x6b.cpp
// \brief Source file for the MCaM6x6b sparse matrix/dense matrix subtraction math test
//
// Copyright (C) 2012-2017 Klaus Iglberger - All Rights Reserved
//
// Thi... |
52ae7e1d211e24eca639917dd661207264646dbe | ffc057a5f66b33d0c15999b3e9a865d78430ed92 | veikin/pdfium | /fxbarcode/pdf417/BC_PDF417HighLevelEncoder.cpp | C++ | cpp | 12,503 | permissive | // Copyright 2014 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
// Original code is licensed as follows:
/*
* Copyright 2006 Jeremias Maerki i... |
c8d5538663fa1dd8a2cbc4968028796f856fc29a | c7fc02b4cadcc267697c10ff91cd2daf7a523123 | nadah09/6.837_ComputerGraphics | /assignment1/gloo/InputManager.cpp | C++ | cpp | 1,575 | no_license | #include "InputManager.hpp"
#include <stdexcept>
#include <cassert>
#include "GLFW/glfw3.h"
namespace GLOO {
void InputManager::SetWindow(GLFWwindow* window) {
assert(window_ == nullptr);
window_ = window;
glfwSetScrollCallback(window,
[](GLFWwindow* window, double xoffset, double yoffse... |
f224ee2234ef56b680a679e1c6dd4506e441b67c | 90311d0546a92e0062d67d17c6143c69ba90c06b | andyyang200/CP | /Competitive Programming/Contests/USACO/Contests/2016 - 2017/US Open/Platinum/COWBASIC 2/cowbasic.cpp | C++ | cpp | 5,500 | no_license | //Andrew Yang
#include <cctype>
#include <iostream>
#include <stdio.h>
#include <sstream>
#include <fstream>
#include <string>
#include <string.h>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include... |
65d28558dabe08bc77613fa503d19f686f00e8b9 | 0df92966d5f414eac6b24dc2fd20382aea53b250 | victorygogogo/LearnAndTry | /leetcode/数组-最长连续序列.cpp | C++ | cpp | 1,902 | no_license | // 128. 最长连续序列
// 给定一个未排序的整数数组 nums ，找出数字连续的最长序列（不要求序列元素在原数组中连续）的长度。
// 进阶：你可以设计并实现时间复杂度为 O(n) 的解决方案吗？
// 示例 1：
// 输入：nums = [100,4,200,1,3,2]
// 输出：4
// 解释：最长数字连续序列是 [1, 2, 3, 4]。它的长度为 4。
// 示例 2：
// 输入：nums = [0,3,7,2,5,8,4,6,0,1]
// 输出：9
// -------------------第二次刷-----------------------
// 2021年6月18日11:12:32
// 准... |
f0b867097dd65c33b20c91d51f3d98fbfc3ba83e | a45077ea330ce6e3147aec98dbf984f5fe10757f | 4096Buffer/skeet.pw | /cheats/misc/misc.cpp | C++ | cpp | 24,469 | permissive | // This is an independent project of an individual developer. Dear PVS-Studio, please check it.
// PVS-Studio Static Code Analyzer for C, C++, C#, and Java: http://www.viva64.com
#include "misc.h"
#include "fakelag.h"
#include "..\ragebot\aim.h"
#include "..\visuals\world_esp.h"
#include "prediction_system.h"
#include... |
d2a8e397cf2615cf544a3897ca4423cf2c682a1a | 6639a6dbc0c1c25fc060ba0aabd30de2e233a1c5 | ikhaled28/lamure | /quality_measurement/src/color_converter.cpp | C++ | cpp | 1,567 | permissive | // Copyright (c) 2014 Bauhaus-Universitaet Weimar
// This Software is distributed under the Modified BSD License, see license.txt.
//
// Virtual Reality and Visualization Research Group
// Faculty of Media, Bauhaus-Universitaet Weimar
// http://www.uni-weimar.de/medien/vr
#include <lamure/qm/color_converter.h>
names... |
e1f0286e5ec08a48cae6ab3915a8d9b826f39c69 | 51fa7fc74d1afcb34a698dea1c614cf390a09209 | bhill-slac/TRCore | /TRCoreApp/src/TRConfigParam.cpp | C++ | cpp | 4,304 | permissive | /* This file is part of the Transient Recorder Framework.
* It is subject to the license terms in the LICENSE.txt file found in the
* top-level directory of this distribution and at
* https://confluence.slac.stanford.edu/display/ppareg/LICENSE.html. No part
* of the Transient Recorder Framework, including this file... |
9263e3a7ffa8ec652a5ce97d147614eeac153bad | 372bbb276e243a03d80f4b9f7545080ca14f3d1d | SKulikovUA/skEngine | /src/Model.cpp | C++ | cpp | 8,391 | no_license | #include "Model.h"
#include <assimp/Importer.hpp>
#include <assimp/postprocess.h>
#include <iostream>
VertexAttributeFormat::VertexAttributeFormat(TVertexComponentList vertexAttr)
{
mVertexAttributes = std::move(vertexAttr);
std::sort(mVertexAttributes.begin(), mVertexAttributes.end());
}
const TVertexComponen... |
c6adac1009a65f0e51d0f0ab5e1b292ba8a60301 | fca42b82f70a27c764708a521484ebbd51ae4617 | Ru311/100-days-of-code | /Array3.cpp | C++ | cpp | 364 | permissive | // Find the minimum and maximum element in an array.
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int n, max=0, min=0;
cin>>n;
int arr[n];
cin>>arr[0];
min=arr[0];
for(int i=1; i<n; i++)
{
cin>>arr[i];
if(arr[i]>=max)
max=arr[i];
if(arr[i]<=min)
m... |
e9b683aeca7cc7ac7b745206133651febe5059ef | 16a50c03b2f898edaa423b91996901119da5f90d | hiproz/Xapiand | /oldtests/set_fieldparser_test.cc | C++ | cc | 1,483 | permissive | /*
* Copyright (C) 2015-2018 Dubalu LLC. All rights reserved.
*
* 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, co... |
90a3744a293baa7d9613992453a8251a6c28ddba | 7466088560014e0a4c9d8f063b430aaf3e0ad0a6 | cliveverghese/tictak | /board.cpp | C++ | cpp | 1,067 | no_license | #include "board.h"
#include <cstdio>
board::board(){
for(int i = 0; i < 3; i++){
for(int j = 0; j < 3; j++){
bd[i][j] = ' ';
}
}
#ifdef DEBUG
printf("Initilized board with values\n");
#endif
}
int board::check_status(char player){
int empty = false;
for(int i = 0; i < 3; i++){
int flag_h = tr... |
93485979e811b163635d136f047efd28122970a5 | f6970c200c2a5efecc1417c85c2f2c397b18ab15 | imaginary-person/flashlight | /flashlight/fl/common/CudaUtils.cpp | C++ | cpp | 1,109 | permissive | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "flashlight/fl/common/CudaUtils.h"
#include <sstream>
#include <stdexcept>
#include <af/device.h>
namespace fl {
... |
205c4cf5446de5dfaf2e44c706548d4daf31c1d7 | 426c0811856d51fe51a23f78ab979470ad800084 | jrbitt/quimera | /Quimera/AgenteMovel.cpp | C++ | cpp | 2,563 | no_license | #include "AgenteMovel.h"
#include "Matriz3x3.h"
AgenteMovel::AgenteMovel(Vetor2D posicao,
double raio,
Vetor2D velocidade,
double velMaxima,
Vetor2D direcao,
double massa,
Vetor2D escala,
double rotacao,
double forcaMaxima): Agente(0)
{
this->direcao = direcao;
this->velocidade = velocidade;
... |
75142ead82af98848673e6ee47c447ba96c0110e | 1f6e69d4aa3312d0dea5aa1f0cc2f52e7b6f54de | jkmoran213/CSE-431-Homework-4 | /q3.cpp | C++ | cpp | 1,156 | no_license | #include <stdio.h>
#include <iostream>
#include <map>
#include <unordered_map>
#include <chrono>
using namespace std;
using namespace chrono;
void ordered_test(multimap<int, int> o_map, int n)
{
auto start = high_resolution_clock::now();
for(int i = 0; i < n; i++)
{
o_map.insert(pair<int,int>(i, i... |
d8af8f07c7b62d36262fbf2cc40e5d4147ade3c0 | 32bf6053a8949345835b9165c252adb80c89c693 | brucetsao/RasberryPiBacnetController | /Source/gedit1.cpp | C++ | cpp | 35,435 | no_license | #ifdef BAS_TEMP
#include <graphics.h>
#include <process.h>
#include <windows.h>
#include "t3000def.h"
#include "aio.h"
#include "mtkernel.h"
#include "parser.h"
#include "_msdos.h"
#include "gedit.h"
#include "rs485.h"
#define Srt '\`'
#define TAB 2
#define TABEDI 3
#define TABMES 4
#define ESC 27
extern int fond_col... |
87ab334c83c8d0fd8f9e96db6cb83faaf826e142 | 8c1b21e7805a2c1e6a75815ffd44537e008a9464 | alexandraback/datacollection | /solutions_2751486_0/C++/DiegoCR/A.cpp | C++ | cpp | 1,065 | no_license | #include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
int arr[1000005];
bool isV(char c)
{
if ( c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' )
return true;
return false;
}
int main()
{
freopen ( "a.in", "r", stdin );
... |
e4cd1aa6d33b9938c6d9d687f3c6fe5696c0910c | e024a98b3851d8a7740fc5aa8cafbd214ea29026 | vel0h/Fission | /src/Core/ResourceManager.cpp | C++ | cpp | 1,526 | no_license | #include "Core/ResourceManager.h"
ResourceManager::ResourceManager(Game *game) : Manager(game)
{
}
ResourceManager::~ResourceManager()
{
//dtor
}
sf::Texture *ResourceManager::getTexture(std::string name)
{
sf::Texture *texture = NULL;
Resource *resource = findResource(name);
if (resource) //resourc... |
a188f89c8c6d05d12e81f578e2e9c29dc1539a49 | 52dceffb13ccc20da8ed67276805bd191eeb21ce | iridium-browser/iridium-browser | /chrome/browser/safe_browsing/download_protection/file_analyzer.cc | C++ | cc | 16,158 | permissive | // Copyright 2018 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/safe_browsing/download_protection/file_analyzer.h"
#include "base/feature_list.h"
#include "base/functional/bind.h"
#include "base/metrics/histogram_f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.