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 |
|---|---|---|---|---|---|---|---|---|
164ecd0b620d95d00aaa6776fff9489f1d8c4dfb | 94c0b96b0597702e268dd9e550cda1f62b77c22c | boringuy/fizz | /fizz/crypto/hpke/DHKEM.cpp | C++ | cpp | 2,730 | permissive | /*
* Copyright (c) 2018-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <fizz/crypto/hpke/DHKEM.h>
#include <folly/io/Cursor.h>
namespace fizz {
static uint16_t get... |
7bd9467b2ce37fbb0e23aafffba61c090e9c7339 | 8299e9f4d592616b037a8c7508a66fa671bcffb9 | KanZhang23/Tmass | /src/geners-1.11.1/examples/ExtDerivedBIO.hh | C++ | hh | 1,423 | permissive | #ifndef GSEXAMPLE_EXTDERIVEDBIO_HH_
#define GSEXAMPLE_EXTDERIVEDBIO_HH_
// The header for the class which we need to wrap
#include "ExtDerivedB.hh"
// The header for the I/O factory
#include "ExtBaseIO.hh"
// Read/write wrapper for class ExtDerivedB.
// Note publication of ExtDerivedB as "wrapped_type".
struct ExtDe... |
b55bf0f1d63ea14c3155f840101f14fa21184681 | fd982512f1bc0c27126f6fe7adccf099e400bf20 | google-code/agora-communication-library | /AgoraLib/AgoraClient/AgoraClient/SpeexEncoder.cpp | C++ | cpp | 5,781 | no_license | #include "SpeexEncoder.h"
#include "speex/speex.h"
#include <stdio.h>
// uwb = 32khz 1280
// wb = 16khz 640
// nb = 8khz 320
using namespace AgoraClient;
SpeexEncoder::SpeexEncoder(int quality) :
_quality(quality),
_NBencoderState(0),
_WBencoderState(0),
_UWBencoderState(0),
_NBdecoderState(0),
_... |
3736f36b048ecc227c77c785fc63ceadc05fb1f1 | 40d96ed9373b5de8b2e0795790a69b330a935689 | MikitaS/MyFirstVector | /memory.hpp | C++ | hpp | 462 | permissive | #pragma once
#include <iostream>
template <typename Type>
Type* memcpy(Type *s1, Type const* s2, size_t n)
{
for (size_t i = 0; i < n; i++)
{
s1[i] = s2[i];
}
return s1;
}
template <typename Type>
Type *resize(const Type *str, size_t size, size_t new_size)
{
Type * new_str = new Type[new_... |
79b33d90c733986997ca6c8fb6f1087292c68fb8 | 17fab2a6c7ea68fcd3dec1dd2a729ca7bbc1960b | WeigangZhu/understand_computer | /C++/Factory/source/PepperoniPizza.cpp | C++ | cpp | 319 | no_license | #include "PepperoniPizza.h"
void PepperoniPizza::prepare()
{
std::cout << "Prepare PepperoniPizza\n";
}
void PepperoniPizza::bake()
{
std::cout << "Bake PepperoniPizza\n";
}
void PepperoniPizza::cut()
{
std::cout << "Cut PepperoniPizza\n";
}
void PepperoniPizza::box()
{
std::cout << "Box PepperoniPizza\n";
}
|
cf7f0ca760b5c271a1e41956ed8ce476723dc4f5 | e1225c8d8888c8f40a683619152f9fa70b1fabc5 | joolee0918/clusteridm | /src/RcppExports.cpp | C++ | cpp | 14,312 | no_license | // Generated by using Rcpp::compileAttributes() -> do not edit by hand
// Generator token: 10BE3573-1514-4C36-9D1C-5A225CD40393
#include <RcppArmadillo.h>
#include <Rcpp.h>
using namespace Rcpp;
// hpc
NumericVector hpc(NumericVector x, NumericVector levels, NumericVector cuts, int logf);
RcppExport SEXP _clusteridm... |
fd507a7b49203361abc13910a64f602a890ea569 | d3c0511140d680eefb16e8bd4a78d2209b5346b1 | openvinotoolkit/open_model_zoo | /demos/speech_recognition_deepspeech_demo/python/ctcdecode-numpy/ctcdecode_numpy/ctc_beam_search_decoder.cpp | C++ | cpp | 12,279 | permissive | /*********************************************************************
* Copyright (c) 2020-2023 Intel Corporation
* SPDX-License-Identifier: Apache-2.0
*
* This file is based in part on ctc_beam_search_decoder.cpp from https://github.com/parlance/ctcdecode,
* commit 431408f22d93ef5ebc4422995111bbb081b971a9 on Apr 4, 2... |
66e309ac5c66a0e0743fa45f13c2e451831f4b1d | 9bef43296ca4d07cc6900eeb590a4917f9c841df | shikhak101/leetcode | /FindTheCelebrity(O(N)).cpp | C++ | cpp | 403 | no_license | // Forward declaration of the knows API.
bool knows(int a, int b);
class Solution {
public:
int findCelebrity(int n) {
int res = 0;
for(int i=1; i<n; i++) {
if(knows(res,i)) res = i;
}
for(int i=0; i<n; i++) {
if(i==res) continue;
if(knows(i,res) ... |
061e3c6753a246885c17e74fa0ff6d7818f994ee | 0a987cd6dcb9476b5613afecb3ce24235e4f3a05 | itohdak/Competitive_Programming | /AtCoder/ABC/209/F.cpp | C++ | cpp | 1,449 | no_license | #include <bits/stdc++.h>
#include <print.hpp>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(... |
255149dfc0ad306542f3fe614e367e62efb83c27 | 1866448582d483c9c3556b4c331b815b982d087a | freakyzoidberg/horus-edu | /Client/Plugins/TimeTable/Implementation/EdtWidget.cpp | C++ | cpp | 11,577 | no_license | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Horus is free software: you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation, either version 3 of the License, or ... |
1e31978d42705a9d023a44d2faba348d66bddf3e | 07b97ea3c094272dc3bddbcd9948560843ea602e | makroid/TrainSchedule | /trainSchedule/distance.cpp | C++ | cpp | 3,094 | no_license | #include "distance.h"
#include <QtDebug>
#include <QXmlStreamReader>
#include <QXmlStreamWriter>
#include "helpers.h"
Distance::Distance() : dist(0.0), unit(KM)
{}
Distance::Distance(QXmlStreamReader &xmlReader) {
xmlReader.readNext();
while(!xmlReader.atEnd()) {
if (xmlReader.isEndElement()) {
... |
52f614b607721ac32378520174b8692258eb991f | 52483d7e901dfe2616859e6a7b5ce8e7837cebae | zahidaliayub/BeetleCoin-BEET | /src/qt/sendcoinsdialog.cpp | C++ | cpp | 35,756 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "sendcoinsdialog.h"
#include "ui_sendcoinsdialog.h"
#include "addresst... |
9200ee6f89e43d1507baea9b11d95bf56dd9a06f | 3d158e1b354610c7e71b53ee2db458b672dc4aa1 | RB-96/Operarting-system-related-programs | /Disk_FCFS.cpp | C++ | cpp | 736 | no_license | #include<iostream>
#include<math.h>
using namespace std;
#define SIZE 200
int main()
{
int arr[SIZE], n, r, cn, rn;
cout<<"\nEnter the number of cylinders( < 200): ";
cin >> n;
cout << "\nEnter No. of requests: ";
cin >> rn;
cout << "\nEnter requests: ";
for(int i=0;i<rn;i++)
{
cin >> r;
... |
5151bc7f87985dc96e466c660ab1cf9396ddf708 | 2954b81b7a65ddf07b54175c36f4657a3e461812 | xyiyy/icpc | /src/ACDream/2014.6.14/I.cpp | C++ | cpp | 2,682 | no_license | #include <iostream>
#include <sstream>
#include <ios>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring... |
94ef195545baa27377032e239f12c72343f33323 | 78e86ded5d95af0fafee29c110e53ac7c8c75c8a | MaukWM/roboteam_ai | /roboteam_ai/src/skills/Harass.cpp | C++ | cpp | 1,721 | no_license | //
// Created by baris on 12-12-18.
//
#include "Harass.h"
namespace rtt {
namespace ai {
Harass::Harass(std::string name, bt::Blackboard::Ptr blackboard)
:Skill(name, blackboard) { }
void Harass::onInitialize() {
harassBallOwner = properties->getBool("harassBallOwner");
pickHarassmentTarget();
}
Sk... |
596de43ffd9b503a36acd62f3bb84748501dc7d3 | 67a574d9a5ee83c64f4e66a57b399a0324a87f56 | emli/leetcode | /closest-binary-search-tree-value/closest-binary-search-tree-value.cpp | C++ | cpp | 945 | no_license | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), l... |
d9ab50f57cae6186179649641b04372ab6e294c9 | d2024f2411288820cce5b42bd2801693614be644 | bramoosterhuis/mesa | /src/intel/compiler/test_vec4_copy_propagation.cpp | C++ | cpp | 5,922 | no_license | /*
* Copyright © 2014 Intel Corporation
*
* 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, pub... |
33856fb3bf863aceb59ac392a3f813f077b753e1 | 2df1a2ffada61c229fc0cd7dc9d8d548f7c10724 | joyjiuyi/UCAS-Compiler-LLVM | /PR003/llvm/tools/clang/lib/CodeGen/CGExpr.cpp | C++ | cpp | 136,207 | permissive | //===--- CGExpr.cpp - Emit LLVM Code from Expressions ---------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
d26252afc09c36bb5b322588197f4b5b056acada | c1b48b291a167115186eb082b53af07b9e0975c7 | yushuiqiang/pcl | /apps/src/openni_planar_segmentation.cpp | C++ | cpp | 6,459 | permissive | /*
* Software License Agreement (BSD License)
*
* Copyright (c) 2011, Willow Garage, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code mu... |
2f58d6ea1a197ae1d52e3e0c352f924ba72e3c73 | d32b7e0ba3be757cff64f47c39c45775b3380f2f | qmutz/namecoin-core | /src/qt/guiutil.cpp | C++ | cpp | 30,100 | permissive | // Copyright (c) 2011-2018 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 <qt/guiutil.h>
#include <qt/bitcoinaddressvalidator.h>
#include <qt/bitcoinunits.h>
#include <qt/qvalidatedlineedit... |
ab3464437a4c9c0d3a2d2b9d1c5929eb7fd64116 | 168ba2433bc5cde8880d23d786f31511ec617d5e | YukiOta/algo-and-data | /ch01/ALDS1_2_B.cpp | C++ | cpp | 803 | no_license | // 3.4
// selection sort
#include <iostream>
using namespace std;
int selectionSort(int A[], int N)
{
int minj, count = 0;
bool flag = 0;
for (int i = 0; i < N - 1; i++)
{
minj = i;
flag = 0;
for (int j = i; j < N; j++)
{
if (A[j] < A[minj]) {
... |
2b4de73d7445ded8a2e9cc610d6d844e7f68271d | cd31e67d97b0209a8e5ec5107ba8169fae42fc5c | sb5512/CanonCameraControlMouse | /CameraControl/main.cpp | C++ | cpp | 2,707 | no_license | #include <iostream>
#include <Windows.h>
#include <thread> // std::this_thread::sleep_for
#include <chrono> // std::chrono::seconds
using namespace std;
void changeChannel();
void updateChannel();
int king;
void setK(int k){
king = k;
}
int getK(){
return king;
}
int main()
{
//int hello;
//cin >... |
4fbde8ee5393730568c2256d6e58739f32df6a25 | 91ed07a6cebf7f72070d786791cea8d1ee111b56 | johnbower2012/PHY981_work | /project2/code/testcodes/bitset_test.cpp | C++ | cpp | 776 | no_license | #include<iostream>
#include<bitset>
using namespace std;
int main(int argc, char* argv[]){
int n, m, l, i, j, count;
bitset<16>* stateset;
count = 0;
n = atoi(argv[1]);
m = atoi(argv[2]);
l = atoi(argv[3]);
bitset<16> temp;
cout << temp << endl;
stateset = new bitset<16> [l];
for(j=0;j<m;j++){
temp.set... |
c5fa67a5fd612a88ed6fd0d3824b735ede559df0 | be4bf5d3537e3bd37abeece1532eabe101533dc6 | OceanOfKnowledge/Fancy-Clock | /Fancy_Clock/mainwindow.cpp | C++ | cpp | 4,131 | no_license | #include <QTimer>
#include <QTime>
#include <QMouseEvent>
#include <QMenu>
#include <QAction>
#include <QSettings>
#include "mainwindow.h"
#include "preference.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
//Initialize UI... |
426789fb0f1e967c8239c143183e8671398c161b | 43270e76b8c69878e19f5111883c354840fef68e | albertcastaned/Estructura-de-Datos | /Sorts/main.cpp | C++ | cpp | 2,033 | no_license | /*
* main.cpp
*
* Created on: 05/08/2015
* Author: pperezm
*/
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cstring>
#include "unit.h"
#include "sorts.h"
template <class T>
std::string arrayToString(const std::vector<T> &v)
{
std::stringstream aux;
... |
ca69a654d0127b9f128b402791c006e6aeb06690 | 92b146d1a31026e09459ad7e7df54a6f6dfc61c8 | andrewlybianto/algorithm_archives | /graph_window.cpp | C++ | cpp | 15,351 | no_license | #include "graph_window.h"
// Width of widget
const int WIDTH = 400;
// Height of widget
const int HEIGHT = 400;
// The distance between nodes to avoid collision, including size of nodes
const int NODE_SEPARATION = 50;
// The maximum x coordinate
const int X_COORD = (-1)*WIDTH / 2;
// The maximum y co... |
96516669e9f733c154bc6d94e171767fa435cfc4 | 27a0237cc45501e428043fd94468bc9e0734d7a7 | sz-zdy/LeetCode | /Q122_BestTimetoBuyandSellStockII.cpp | C++ | cpp | 502 | no_license | /*
* @Author: ShenZheng
* @Date: 2019-06-25 17:04:24
* @Last Modified by: ShenZheng
* @Last Modified time: 2019-06-25 17:09:28
*/
#include <iostream>
using namespace std;
class Solution {
public:
int maxProfit(vector<int>& prices) {
int maxProfit = 0;
int diff = 0;
for(int i=1;i<price... |
f77717885e4053833160bd50788b407eaafc16a5 | d23728e142349cb191231531b693d35ca8d47c9f | JonnoRobson/Vulkan-Rendering-Framework | /VulkanApp/visibility_deferred_pipeline.cpp | C++ | cpp | 7,042 | no_license | #include "visibility_deferred_pipeline.h"
#include <array>
void VisibilityDeferredPipeline::RecordCommands(VkCommandBuffer& command_buffer, uint32_t buffer_index)
{
VkRenderPassBeginInfo render_pass_info = {};
render_pass_info.sType = VK_STRUCTURE_TYPE_RENDER_PASS_BEGIN_INFO;
render_pass_info.renderPass = render_pa... |
92544e6ed17a84de08ebadb3714224e3f5c83eef | 37d311353cc04f7fbaef27ef3ae435fcb9ff0d26 | LZYAndy/nus-cs3203 | /Team11/Code11/src/unit_testing/src/TestCallsStarBank.cpp | C++ | cpp | 7,576 | no_license | #include "catch.hpp"
#include "CallsStarBank.h"
TEST_CASE("CallsStarBank::does_calls_star_exist()")
{
CallsStarBank calls_star_bank;
SECTION("empty")
{
calls_star_bank.insert_calls_star("hello", "hello");
REQUIRE_FALSE(calls_star_bank.does_calls_star_exist());
}
SECTION(">1")
... |
cda9c24488358feea59218eb2fc720680b7e6755 | 9f525db80a7ba51fe41b04eccead00565ee0a720 | Lukanite/422-robot-2013 | /Subsystems/ShooterArticulator.cpp | C++ | cpp | 2,401 | no_license | /**
* @file ShooterArticulator.cpp
* @brief Implementation of the Shooter articulator subsystem
* @author Nyle Rodgers
*/
#include "ShooterArticulator.h"
#ifndef USE_PISTON_ARTICULATOR
#include <cmath>
#include "../Commands/OperateShooterArticulator.h"
#include "../RobotMap.h"
const float PI = 3.14159;
// TODO: ... |
dd6031caae047b6448d6086c384293165d19a16f | 65bc484f462ce0939c25a87c90d2e03e96dce4b1 | Jerry-Terrasse/Programming | /比赛/luogu.org/20181118_小L和小K的NOIP考后放松赛/T44990.cpp | C++ | cpp | 1,078 | no_license | #include<cstdio>
#include "memory.h"
#define int long long
#define MAXN 1000010
#define max(x,y) ((x)<(y)?(y):(x))
using namespace std;
int f[MAXN],n=0,q=0,ans=0;
inline void read(int&);
void write(const int&);
inline void init();
inline void work(const int &u,const int &v);
signed main()
{
register int ... |
97e3ee5d34bb541e8c3195f42a2e017f1d3750ce | 350a8a715ffed2965f1dc57e4953e02d7e9e01f3 | Yen/LysOld | /Client/src/graphics/layer/ui/uilayer.hpp | C++ | hpp | 2,233 | no_license | #pragma once
#include <GL\glew.h>
#include <deque>
#include "..\layer.hpp"
#include "uielement.hpp"
#include "..\..\graphicsprofile.hpp"
#include "..\..\shaderprogram.hpp"
namespace lys
{
#define LYS_UILAYER_RATIO_SIZE 64
class VertexData
{
public:
Vector3 position;
Vector2 uv;
float tid;
float tformat... |
2080f2e5e0c5782b0fd8e73f1c1fae7351eba58b | 276f4d2b2b57d936b1bfe437ecb1f7db1f8ce6e2 | TongNHIT/Master-s-code | /refinedslicenormal.cpp | C++ | cpp | 7,918 | no_license | #include "vtkAutoInit.h" //VTK显示法向量报错
#include <iostream>
#include <string>
#include <vector>
#include <pcl/io/pcd_io.h>
#include <pcl/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl/search/kdtree.h>
#include <pcl/features/normal_3d.h>
#include<pcl/visualization/pcl_visualizer.h>
#include<pcl/filters/normal... |
3ab2ff40e0e51333bc0d320e5856dae768b15c1a | fc85c8cf9a5cf8f06c944eb90b7bcf1f96efcec1 | bmjoy/gearoenix | /gearoenix/core/event/cr-ev-button.hpp | C++ | hpp | 2,056 | no_license | #ifndef GEAROENIX_CORE_EVENT_BUTTON_BUTTON_HPP
#define GEAROENIX_CORE_EVENT_BUTTON_BUTTON_HPP
#include "../../math/math-vector-2d.hpp"
#include "../cr-types.hpp"
namespace gearoenix::core::event::button {
enum struct KeyboardKeyId : core::Id {
Left,
Right,
Up,
Down,
Backspace,
Escape,
Ente... |
a2ff2e9d78c9d3a535dcdd26ab927b930bb648db | 58949a9fb4ade483f75f6b81eba9c6f636d9d4fc | btaczala/mlb-server | /src/reflections.hpp | C++ | hpp | 2,908 | no_license | #ifndef REFLECTION_HPP_3N0JQKEA
#define REFLECTION_HPP_3N0JQKEA
#include <Meta.h>
#include "database_types.hpp"
namespace meta {
template <>
inline auto registerMembers<mlb::data::PlayerShortInfo>() {
return members(member("firstname", &mlb::data::PlayerShortInfo::firstname),
member("lastname"... |
9912cc772bf1b9d6c9f80b793bd219d877332332 | a6ad61991016d3127f1caf47754c0e5fb4befc0a | damir-rg/dascoin-blockchain | /tests/das_tests/cycle_tests.cpp | C++ | cpp | 11,309 | permissive | /**
* DASCOIN!
*/
#include <boost/test/unit_test.hpp>
#include <graphene/chain/database.hpp>
#include <graphene/chain/access_layer.hpp>
#include <graphene/chain/exceptions.hpp>
#include "../common/database_fixture.hpp"
using namespace graphene::chain;
using namespace graphene::chain::test;
BOOST_FIXTURE_TEST_SUIT... |
65702fa4c3d79b6279bebd615e5018aaa98ecee8 | 8b8dcd6fbd3b8431c69f73957e26d5face506fa2 | mjy2002/NautilusController | /fw/NautilusController.cpp | C++ | cpp | 6,326 | permissive | #include "STM32F405RTG6Board.h"
#include <SimpleFOC.h>
/// I2C 1
#define SDA PB7
#define SCL PB6
// Temperature Senror
#define ADDR_TEMP_SENSOR 0x48
/// SPI 2 (AS5048A)
#define MOSI_ENC PB15
#define MISO_ENC PB14
#define CLK_ENC PB13
#define CS_ENC PB12
/// SPI 1 (DRV8305)
#define MOSI_DRV PA7
#define MIS... |
1a376cb4b26a1b8991191ca4c51d4804b42aeec9 | 3fb2ed1f6f50eb611900900521fd679cf67893e1 | johndpope/Medusa | /Medusa/Medusa/Application/ApplicationStatics.cpp | C++ | cpp | 11,603 | permissive | // Copyright (c) 2015 fjz13. All rights reserved.
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.
#include "MedusaPreCompiled.h"
#include "Application/ApplicationStatics.h"
#include "Node/Control/Label/ILabel.h"
#include "Node/NodeFactory.h"
#include "Resou... |
0eb185a37c316a2bc1f434524ebffd9b5e4097c9 | 3089d2b5207b02a6abd29652e57f3082cbfa133c | radtek/cmssw | /Validation/Geometry/src/MaterialBudgetHGCalHistos.cc | C++ | cc | 73,538 | permissive | #include "Validation/Geometry/interface/MaterialBudgetHGCalHistos.h"
#include "Validation/Geometry/interface/MaterialBudgetData.h"
template <class T>
const T& max(const T& a, const T& b) {
return (b < a) ? a : b; // or: return comp(b,a)?a:b; for the comp version
}
MaterialBudgetHGCalHistos::MaterialBudgetHGCalHist... |
7cdcf7eefdd985c5e609f8ae04c9474ed2c47484 | 4e8da9321fa2d3a108cd9b7278a80100318277be | kentarobaba/Geant4-DNA | /ChemDNA/src/RunAction.cc | C++ | cc | 1,767 | no_license | #include "RunAction.hh"
#include "PrimaryGeneratorAction.hh"
#include "DetectorConstruction.hh"
#include "Run.hh"
#include "G4Run.hh"
#include "G4RunManager.hh"
#include "G4UnitsTable.hh"
#include "G4SystemOfUnits.hh"
RunAction::RunAction()
: G4UserRunAction()
{
}
RunAction::~RunAction()
{}
G4Run* RunAction::Genera... |
1e59bf525434ce10289cd83cce38da7a611ac48e | 7c04fed84b3cc790814363875e8c93add02ea18d | wzyy2/chromium-browser | /tools/cygprofile/cygprofile.cc | C++ | cc | 12,807 | permissive | // Copyright (c) 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 "tools/cygprofile/cygprofile.h"
#include <fcntl.h>
#include <pthread.h>
#include <stddef.h>
#include <stdint.h>
#include <sys/stat.h>
#inclu... |
94da8fd743c3e3c9211555df16026f3c16fa6681 | 9b7fee9d74125c78b88658b48cf681e38e72a927 | Xilinx/Vitis-AI | /examples/vai_library/samples/movenet/test_performance_movenet.cpp | C++ | cpp | 888 | permissive | /*
* Copyright 2022-2023 Advanced Micro Devices Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applica... |
6f39f39e02696423b0ca9f41a8ccdf183fd393fa | 0e9a9a604425750a3b33c7477e69efe730a23189 | IsraMekki/tiramisu_code_generator | /cmake-build-debug/programs_tiling/function14589/function14589_schedule_6/function14589_schedule_6_wrapper.cpp | C++ | cpp | 934 | no_license | #include "Halide.h"
#include "function14589_schedule_6_wrapper.h"
#include "tiramisu/utils.h"
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <fstream>
#include <chrono>
#define MAX_RAND 200
int main(int, char **){
Halide::Buffer<int32_t> buf00(128, 64, 64, 64);
Halide::Buffer<int32_t> buf0... |
d449f1f8e098372458719161e31bdcf0b8c1c432 | 916135e33cd50544c6e8c162e100ef2cfde66a14 | archercreat/dta-vs-osc | /sc-virt/src/lib/Transforms/IPO/IPConstantPropagation.cpp | C++ | cpp | 9,500 | permissive | //===-- IPConstantPropagation.cpp - Propagate constants through calls -----===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
13438411bbf51a876548dba96746cdb3980e3ad7 | 336f48a2a2f65b1b9bf7fd11854a4f472c86c37e | peichangliang123/UE4 | /Editor/DetailCustomizations/Private/SPerPlatformPropertiesWidget.cpp | C++ | cpp | 2,305 | no_license | // Copyright Epic Games, Inc. All Rights Reserved.
#include "SPerPlatformPropertiesWidget.h"
#include "Layout/Margin.h"
#include "Fonts/SlateFontInfo.h"
#include "Styling/CoreStyle.h"
#include "Framework/MultiBox/MultiBoxBuilder.h"
#include "Widgets/Input/SButton.h"
#include "Widgets/Input/SComboButton.h"
#include "Pl... |
2b06252317360e8b164022821ad372ef9c8e76da | 21201faa87542058b6fc5cc2b4784eb1ed7e02f4 | Kushal148/C-DAC-Feb2020 | /ProjectExample/Layered Example.cpp | C++ | cpp | 4,569 | no_license | /*Single Responsibility Principle: The Layered Application development is what is
called as the implementation of Single Responsibility principle. A Class should
perform only one task or should be a part of an Application. It is more designed like
divide and rule policy.
In an App, U will have Classes that inte... |
9e4b33ded5e6e70290b8bd23a4e706910211a9b1 | 530452d2a89efef05685ffb638ea234f8a077e23 | eijtmzw/sample-code | /3rd/007_container/025_001_set_union.cpp | C++ | cpp | 463 | no_license | // Copyright (c) 2012-2017
// Akira Takahashi, Toshihiko Ando, Kohsuke Yuasa,
// Yusuke Ichinohe, Masaya Kusuda.
// Released under the CC0 1.0 Universal license.
#include <iostream>
#include <iterator>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> v1 = {3, 4, 7, 8};
vector<i... |
4ca1c9adbb0b7a8f5c7ea8b8885cdf25d9585c7d | a0a37a7109c8d1333b15c7d3d8b5bf7a77716aaf | wuge1513/PDF-Writer | /PDFWriter/UsedFontsRepository.cpp | C++ | cpp | 8,002 | permissive | /*
Source File : UsedFontsRepository.cpp
Copyright 2011 Gal Kahana PDFWriter
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
U... |
68fe7523f7faa57e9534bf64e24a7e6bd22b5205 | 55c327bf4fd1633bc2e15b023df130970780c9b1 | timeanddoctor/PorousScaffolds | /PorousScaffolds/qSlicerPorousScaffoldsModuleWidget.cxx | C++ | cxx | 19,447 | no_license | /*==============================================================================
Program: 3D Slicer
Portions (c) Copyright Brigham and Women's Hospital (BWH) All Rights Reserved.
See COPYRIGHT.txt
or http://www.slicer.org/copyright/copyright.txt for details.
Unless required by applicable law or agreed to ... |
f9807cae23c0130bf2aed6f5f1ccbeb35882f2a3 | 1764b873ad91c9dfbde7b6ee5611de8f61f5d707 | stonezk/Thinputer3D_ReadBack | /VirtualBox-5.0.12-Thinputer/src/VBox/VMM/VMMR3/DBGFStack.cpp | C++ | cpp | 22,203 | no_license | /* $Id: DBGFStack.cpp $ */
/** @file
* DBGF - Debugger Facility, Call Stack Analyser.
*/
/*
* Copyright (C) 2006-2015 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modi... |
e01d4a5f37fd60d030a396ddbe84b20d1f6277f6 | b06d1dfacb6013d07a558e41b04e297bf6ad2abb | Incie/Vermillion | /Codename Vermillion/Source/Gloomhaven/uilayer/CardSelection.cpp | C++ | cpp | 4,956 | no_license | #include"pch.h"
#include "CardSelection.h"
#include"../cards/PlayerDeck.h"
#include"GL/glew.h"
#include"../render.h"
#include"../services.h"
#include"../servicelocator.h"
#include<functional>
#include<Windows.h>
#define ButtonIdReady 1
#define ButtonIdShortRest 2
#define ButtonIdLongRest 3
CardSelection::CardSelect... |
d9c69138fd6b4304ca005b5ca73c221b36a1aa42 | 1460fb0f0abb1c935d710547f4f6c76a67ba54ac | jpbonn/llvm36lm32 | /tools/llvm-objdump/llvm-objdump.cpp | C++ | cpp | 44,879 | permissive | //===-- llvm-objdump.cpp - Object file dumping utility for llvm -----------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
ebf53637bdb1c38900ba11ea44e5d0408e13a22e | c656a129ebde4b0b487d9437479c62448dd71e44 | redtree0/CITOS-APP | /fuse-qreader/Example/build/Android/Debug/app/src/main/jni/Fuse.Layouts.g.cpp | C++ | cpp | 138,475 | permissive | // This file was generated based on '(multiple files)'.
// WARNING: Changes might be lost if you edit this file directly.
#include <Fuse.Controls.LayoutControl.h>
#include <Fuse.Diagnostics.h>
#include <Fuse.Elements.Alignment.h>
#include <Fuse.Elements.AlignmentHelpers.h>
#include <Fuse.Elements.Element.h>
#include <... |
6bc800a99a2fac245562d8a873030b400e746b49 | 465fedb29a1cc79b934b2f835de0944a8410687c | ImenAlSamarai/MBR-simulation | /src/Array.cc | C++ | cc | 890 | no_license | #include "Array.h"
ClassImp(Array)
Array::Array() :
fHeight(0),
fPhi(0)
{
}
void Array::Streamer(TBuffer& R__b)
{
if (R__b.IsReading()) {
unsigned int R__s, R__c;
Version_t R__v = R__b.ReadVersion(&R__s, &R__c);
R__b.ReadClassBuffer(Array::Class(), this, R__v, R__s, R__c);
if (R__v < 2) {
... |
116ed1d2a71a6172aa6990124332a5434140a650 | e4e47dba5794d4d815dba885cf60956c1e592b44 | arceciemat/GAMOS | /source/NuclMed/Base/src/DetCAlgoYZPos.cc | C++ | cc | 1,575 | no_license | #include "DetCAlgoYZPos.hh"
#include "DetVerbosity.hh"
#include "GamosCore/GamosBase/Base/include/GmParameterMgr.hh"
#include "GamosCore/GamosBase/Base/include/GmAnalysisMgr.hh"
#include "GamosCore/GamosUtils/include/GmGenUtils.hh"
#include "GamosCore/GamosAnalysis/include/GmTrajStep.hh"
#include "GamosCore/GamosSD/inc... |
cf30b0279a0227a8584d4d7c88b8141ed47fa1ed | 919db5772d103ae486ac704ba84221f845319423 | SamuelBacaner1112/APlate | /Src/APlateDBDraw/ShopSymbol.cpp | C++ | cpp | 36,796 | no_license | // ShopSymbol.cpp: implementation of the CSymbolDom class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "APlateDBDraw.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
//////////////////////////////////////////... |
a58a3969c7fdc4aedbfa520ba16e2ab3f2b84555 | 4de6e6e01ed1301ceb7493bbb7ab7f7db46627b1 | 5fe6eb50c7aa19f9/OJ | /uva/10325.cpp | C++ | cpp | 708 | no_license | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long gcd(long long a,long long b){
if(b==0)return a;
return gcd(b,a%b);
}
long long data[15];
long long n,m,ans;
void brute(long long now,long long combi,long long lcm){
if(now==m||lcm>n){
if(combi&1){
... |
1d59b0987141d88bc98c014c75ce644bc0384f77 | bd5580f118ea12effdf92016a9d6e4bf0327b593 | victor-smirnov/memoria | /containers/include/memoria/containers/set/set_names.hpp | C++ | hpp | 754 | permissive |
// Copyright 2014 Victor Smirnov
//
// 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... |
d320d46307e758f63e536249ccb11c937cef171c | c52be6da985f4b74eee727cac35161c23e8420d4 | hanenjabnoun-Esprit-2019/Smart_Pastry_Shop_2A25 | /gestion_boutique.cpp | C++ | cpp | 13,734 | no_license | #include "gestion_boutique.h"
#include "ui_gestion_boutique.h"
#include"commande.h"
#include<QString>
#include <QMessageBox>
#include <QTextStream>
#include <QSqlQuery>
#include<QtDebug>
#include <QTextDocument>
#include <QPrinter>
#include <QPrintDialog>
#include <QMovie>
#include <QMediaPlayer>
#include<QtMultimedia>... |
ff6016a2e8d00b71c984fe72fa397acd197469be | ca2148dd96d94c0786954d3caf1198f93c32b883 | DamianGuth/DrogonTestProject | /controllers/demo_v1_User.cc | C++ | cc | 1,131 | no_license | #include "demo_v1_User.h"
using namespace demo::v1;
//add definition of your processing function here
void User::login(const HttpRequestPtr &req,
std::function<void (const HttpResponsePtr &)> &&callback,
std::string &&userId,
const std::string &password)
{
LOG_DEBUG<<"User "<<userI... |
bab92c0951770079341b0f4536bca9ae36b01c99 | cdd1c1c9e1a7c7e2e7f93e5af38a6fb19ede9932 | matthb2/ParaView-beforekitwareswtichedtogit | /Servers/Common/vtkPVCompositeDataInformation.cxx | C++ | cxx | 11,547 | permissive | /*=========================================================================
Program: ParaView
Module: $RCSfile$
Copyright (c) Kitware, Inc.
All rights reserved.
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
This software is distributed WITHOUT ANY WARRANTY; without... |
0da786bd6f7ebf1fef388c7cd96d49dcd413ff18 | e9fe506b3e222fbf52a11afd25b6c3a349731963 | yf885188/BigWorld-Engine-1.9.1 | /src/lib/moo/visual.cpp | C++ | cpp | 42,873 | no_license | /******************************************************************************
BigWorld Technology
Copyright BigWorld Pty, Ltd.
All Rights Reserved. Commercial in confidence.
WARNING: This computer program is protected by copyright law and international
treaties. Unauthorized use, reproduction or distribution of this... |
26e5465c00cd9b72ca5804a6cb5b9890fdd83586 | d21d7d5690eb1a39ba86d9a9d41d77c836da4073 | atiluj/University | /SEM5/MIA/sprint01/01.cpp | C++ | cpp | 685 | no_license | #include <iostream>
using namespace std;
int prof(int h, int c, int b, int p, int f){
int sum=0;
while(p>0 && b>1){
sum += h;
p -= 1;
b -= 2;
}
while(f>0 && b>1){
sum += c;
f -= 1;
b -= 2;
}
return sum;
}
int main(){
//b-buns
//p-beef pa... |
8406696fa2b9d994af9272eafa91f93898779113 | 19ea14270c1724533be09f0fcfe7dbc8a30f1081 | rigged-regie/NGU-inputs | /api-injector/injector/main.cpp | C++ | cpp | 2,303 | permissive | #include <iostream>
#include <Windows.h>
#include <tlhelp32.h>
#include <thread>
namespace cfg {
char const* default_dll_name = ".\\api.dll";
char const* default_proc_name = "NGUIdle.exe";
}
template <typename ...Args>
void assert(bool cond, Args &&...args) {
if (cond) return;
std::cout << "asserti... |
0ccf38d54cac2b9d6c2c5caf92882f25f0028f2e | f004bc6d64ed98f3b5702854732fb132f9c5d6ee | scpp/protobuf2csharp | /src/google/protobuf/compiler/csharp/csharp_repeated_message_field.cc | C++ | cc | 6,304 | permissive | // Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// ... |
78c8ab434937852c4259c9a568d028b56331eaaf | aefa1c3b966ea2211dda605f1e9efc73a4a77b23 | RobertDyke/P11_CarND-Path-Planning | /src/main.cpp | C++ | cpp | 18,434 | no_license | #include <fstream>
#include <math.h>
#include <uWS/uWS.h>
#include <chrono>
#include <iostream>
#include <thread>
#include <vector>
#include "Eigen-3.3/Eigen/Core"
#include "Eigen-3.3/Eigen/QR"
#include "json.hpp"
#include "spline.h"
using namespace std;
//this line is for git testing
// for convenience
... |
e0abb580a2cdf1e510e5651212c82a1146f3f115 | d9ca224360206c565af25a1f047df17169548b7d | Niruz/vigilant-happiness | /test/test/Animation.cpp | C++ | cpp | 2,996 | no_license | #include "Animation.h"
Animation::Animation(int numberOfFrames, int startFrame, float spriteX, float spriteY, float sheetX, float sheetY, int yRows, int spritesPerRow)
:myFrameCounter(0), myCurrentIndex(0), myNumberOfFrames(numberOfFrames), myStartFrame(startFrame),
mySpriteXWidth(spriteX), mySpriteYWidth(spriteY), ... |
75083b2e4211756351b2b0330bc75550a1619440 | 7cd32632bc529a22a437cbfd687dfccc2bf9558a | shaiy310/DS_W2 | /main.cpp | C++ | cpp | 1,348 | no_license | #include "allTeams.h"
#include <iostream>
#include "Team.h"
#define N 5
using namespace std;
int main() {
// AVLtree<Student, Student> tree;
// Student s1(1,1);
// Student s2(2,2);
// Student s3(3,3);
// Student s4(4,4);
//
// tree.insert(s2,s2,2);
// tree.insert(s1,s1,1);
// tree.insert(s3,s3,3);
// tree.insert(s... |
234a8d944b5ad9202ca181585a6779980874182c | 77039787c7894d0346181d8fc2d3c24a4dfb09a8 | Kushagra-Kapoor25/DSA | /UnionOfTwoArraysNAIVE.cpp | C++ | cpp | 722 | no_license | #include<bits/stdc++.h>
using namespace std;
int unionOfElements(int c[] , int size)
{
int res = 0;
for (int i = 0; i < size; i++)
{
bool flag = false;
for (int j = 0; j < i ; j++)
if (c[i] == c[j])
{
flag = true;
break;
}
if (flag == false)
res++;
}
return res;
}
int main()
{
#ifndef ONL... |
49d417e78722577a522c3112af62b9fd2beed5b4 | 0866239527f588e05d2d122c9c29bb2fb9aca2de | Bulbash3r/Cpp-3sem-Labs | /Laba 7 Container + Iterator/Laba 4 predprinimatel/main.cpp | C++ | cpp | 1,810 | no_license | #include <iostream>
#include <iomanip>
#include "String.h"
#include "List.h"
using namespace std;
#define SIZE 10
#include "Human.h"
#include "tourist.h"
int main()
{
List<cTourist> t;
setlocale(LC_CTYPE, "Russian");
system("cls");
while (1)
{
system("cls");
cout << "Выберите действие:" << endl;
... |
619abc32b8f41ede17d686c47e017d34c9983b7f | fc942226821b84d62a53ea7cc8eaf15c45106144 | sayitinmyface/cpp | /TemplateWithFunction.cpp | C++ | cpp | 430 | no_license | #include <iostream>
using namespace std;
template <typename T>
const T Max(const T first,const T second)
{
return first<second? second:first;
};
int main(){
int int_first = 29,int_second=1;
cout << Max(int_first,int_second) << endl;
double d_first = 29.234,d_second=1.23423;
string s_first = "A",s_... |
62afe826a35c3314edcbaea9aef2212a225e7d43 | 47c50d7a30b6526fcf14bbb1abb454f0ab790992 | RobotJustina/JUSTINA | /catkin_ws/src/visualization/graphics_viz/src/Texture.cpp | C++ | cpp | 3,625 | no_license | /*
* Texture.cpp
*
* Created on: 10/04/2015
* Author: rey
*/
#include "graphics_viz/Texture.h"
#include <iostream>
Texture::Texture(GLenum TextureTarget, const std::string& FileName) :
m_textureObj(0), type("") {
this->m_textureTarget = TextureTarget;
this->m_fileName = FileName;
}
Texture::~Texture() ... |
af251ce9e989533ed738fad7397143b82029f5c8 | 0db44ab1932a69c2593f1a7b581ed1c02a6c3203 | winlinvip/mediasoup | /worker/src/RTC/RtpStreamRecv.cpp | C++ | cpp | 5,042 | permissive | #define MS_CLASS "RTC::RtpStreamRecv"
// #define MS_LOG_DEV
#include "RTC/RtpStreamRecv.hpp"
#include "DepLibUV.hpp"
#include "Logger.hpp"
#include <bitset> // std::bitset()
namespace RTC
{
/* Instance methods. */
RtpStreamRecv::RtpStreamRecv(Listener* listener, uint32_t ssrc, uint32_t clockRate, bool useNack) :
... |
5b6d040c28ed4afea706991f8c5bd1d5fab286e3 | 4e6966b1739e79e93969318f6cbc43132ffac348 | freiheitsnetz/openwns-library | /src/distribution/tests/VarEstimator.hpp | C++ | hpp | 2,000 | no_license | /*******************************************************************************
* This file is part of openWNS (open Wireless Network Simulator)
* _____________________________________________________________________________
*
* Copyright (C) 2004-2007
* Chair of Communication Networks (ComNets)
* Kopernikusstr.... |
6e19bbb45fdb2e44c1101eb8e22a79d8b41fdc8e | 34343aa10aa661a663b5611650cdcf54754573de | bcace/ochre | /src/ochre/runtime/env.cpp | C++ | cpp | 3,226 | no_license | #include "runtime/env.h"
#include <windows.h>
OcEnv::OcEnv() :
run(false), stop(false), setDone(false),
pls(0), state(envIdle), generateId(0), threadsCount(32) {
pthread_mutex_init(&breakLock, 0);
}
OcEnv::~OcEnv() {
Stop();
ChkDelete(&pls);
env.Clear();
pthread_mutex_destroy(&breakLock);
}
OcSchedule &OcE... |
92c9333673fc7a2a1c17998a82e7b0f09a5a6eff | cae0b80ed769b51b9a53444c87b5bc1f1ea87cd6 | burakbayramli/books | /programming_computer_vision_with_python/cvbook-contrib/ceres/hello_ceres.cc | C++ | cc | 1,342 | permissive | /*
cd build
cmake .. -DCMAKE_INSTALL_PREFIX=${PWD}/../install \
-DEIGEN_INCLUDE=${PWD}/../install/include/eigen3 -G Ninja
ninja
*/
#include "ceres/ceres.h"
#include "glog/logging.h"
using ceres::AutoDiffCostFunction;
using ceres::CostFunction;
using ceres::Problem;
using ceres::Solver;
using ceres::Solve;
s... |
a4b5ee6e406a5e8a4e31b8d7a5309863c9a0642a | 12fb3de78ab08f9a16404d4a9fb2bd4baec2000f | douglascraigschmidt/CPlusPlus | /overview/4-C++-templates/4c/main.cpp | C++ | cpp | 1,696 | no_license | #include <iostream>
#include <algorithm>
#include "stack.h"
#include "throw_exception.h"
using namespace std;
int main() {
try {
// Multiple stacks that are created automatically.
stack<throw_exception> s1(3), s2(10);
cout << "begin copy constructor" << endl;
stack<throw_exce... |
388a01fea2424e1edd28b2a9858a982bcac6192b | 9f790910ca209b0ec9db9eacae2933611f2fc87f | rhinton/tce | /tce/src/applibs/Scheduler/ProgramRepresentations/DDG/LLVMAliasAnalyzer.cc | C++ | cc | 5,100 | permissive | /*
Copyright (c) 2002-2011 Tampere University of Technology.
This file is part of TTA-Based Codesign Environment (TCE).
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... |
28b46a61d08694e8d2d6c040c4ad4b9897eece2c | 391eb0c68feb0246fb54d046b90e5ef26538d48d | immunant/android_bionic | /libc/bionic/bionic_arc4random.cpp | C++ | cpp | 2,517 | permissive | /*
* Copyright (C) 2016 The Android Open Source Project
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* * Redistributions of source code must retain the above copyright
* notice, t... |
57901c7a10647e268f3bbdddfd434101c6744c12 | fc0529f61b409834415e2b13508d2bb4722d463c | pu2oqa/muServerDeps | /_Include/boost/pointer_to_other.hpp | C++ | hpp | 1,444 | no_license | #ifndef BOOST_POINTER_TO_OTHER_HPP_INCLUDED
#define BOOST_POINTER_TO_OTHER_HPP_INCLUDED
//
// pointer_to_other.hpp
//
// (C) Copyright Ion Gaztanaga 2005.
// Copyright (c) 2005 Peter Dimov.
//
// Distributed under the Boost Software License, Version 1.0.
//
// (See accompanying file LICENSE_1_0.txt or ... |
20145d08a5572a0c903aa7f98b18110a236b0449 | 6d435e0a6e29982be0041ac3ec3ea037388310cc | melshazly89/Algo_ToolBox | /week2_algorithmic_warmup/5_fibonacci_number_again/fibonacci_huge.cpp | C++ | cpp | 795 | no_license | #include <iostream>
long long Pisano_Period(long long m);
long long get_fibonacci_huge_fast(long long n, long long m) {
int length=Pisano_Period(m);
long long Fn_mod_m[n%length];
n=n%length;
for(int i=0;i<=n;i++)
{
if(i>1)
{
Fn_mod_m[i]=(Fn_mod_m[i-1]+Fn_mod_m[i-2])%m;
}
else
{
... |
d88df1288969037d670323cd2b2258c8863b1ea8 | 651aa46b6a8b8d7b71d6f8ef90a6a028f44fd7a0 | rauls/newscaster | /include/xercesc2.5/util/RefArrayVectorOf.hpp | C++ | hpp | 4,477 | no_license | /*
* The Apache Software License, Version 1.1
*
* Copyright (c) 1999-2003 The Apache Software Foundation. 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 sou... |
445613ac93a99413914a3bb357109a37ac32e9c9 | 716534fac8b526edb2037a9e65e0613da5934858 | Jacob-Luo/CrossReview | /DesignPattern/C1v1.cpp | C++ | cpp | 1,561 | no_license | /** A simplified replication of the java version,
* one on one relation between 2 classses/objects,
* without setters and getters. */
#include <iostream>
#include <string.h>
using namespace std;
class Cperson; //Declare the classed not yet defined.
class Ccollege{
public:
string name;
Cperson* p_pers... |
d4a58c58855c06bcf45a4185c71ba784d60aa22f | 9134217364a7225bb0e9f9eb829508079dabc928 | blackberry/Boost | /boost/phoenix/object/construct.hpp | C++ | hpp | 2,213 | permissive | /*==============================================================================
Copyright (c) 2001-2010 Joel de Guzman
Copyright (c) 2010 Thomas Heller
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... |
ffc148eb1d062abe5d84acad1aca6f0cfe279136 | fbccadad2715454065273187b02dfb2456768ac1 | crosswalk-project/chromium-crosswalk-efl | /chrome/browser/ui/views/session_crashed_bubble_view.cc | C++ | cc | 15,761 | permissive | // Copyright 2014 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/ui/views/session_crashed_bubble_view.h"
#include <vector>
#include "base/bind.h"
#include "base/bind_helpers.h"
#include "base/... |
d08923e5beeb5e2a21453082b56f28b0b514f415 | ba65d9a10755a6c12a4158f7a409f1a154376946 | violettagoldman/cpp | /CPP_03/ex00/FragTrap.hpp | C++ | hpp | 795 | no_license | #ifndef FRAG_TRAP_HPP
# define FRAG_TRAP_HPP
# include <iostream>
# include <stdlib.h>
class FragTrap
{
public:
FragTrap(void);
FragTrap(FragTrap const &src);
FragTrap(std::string name);
~FragTrap(void);
FragTrap &operator=(FragTrap const &src);
void rangedAttack(std::string const &target);
void ... |
0bb8dfef12c29d2609311bcad6b3cb041a0aa2d8 | 9a13dca9d5fef36dfe9b3f4a9f7b214dbc8070c9 | hunaonao1/leetcode | /统计一行字符有多少个单词.cpp | C++ | cpp | 653 | no_license | #include<iostream>
using namespace std;
#define BUFFERSIZE 1024
void Reverse(char *string,int n)
{
int i = 0, j = n-1;
while (i < j)
{
string[i]= string[i]^string[j];
string[j] = string[i]^string[j];
string[i] = string[i]^string[j];
i++; j--;
}
}
int main()
{
char string[BUFFERSIZE] = ... |
4c448b53f6d10354587caa7c4fa2086e86f04362 | e174ccfd16ab4fa19644e67e0a9d9aed98ee4ff0 | schmidek/catboost | /catboost/libs/fstr/calc_fstr.cpp | C++ | cpp | 30,922 | permissive | #include "calc_fstr.h"
#include "compare_documents.h"
#include "feature_str.h"
#include "shap_values.h"
#include "util.h"
#include <catboost/libs/algo/apply.h>
#include <catboost/libs/algo/plot.h>
#include <catboost/libs/algo/yetirank_helpers.h>
#include <catboost/libs/algo/tree_print.h>
#include <catboost/libs/helpe... |
988e1c748a5636d9a38a5cb68867a2ef4907959e | 55d7f8eca235a474138f01fa76545c14b64688a1 | shantanuekhande/Data-Structures-and-Algorithms | /HackerRank/C++/stream.cpp | C++ | cpp | 536 | no_license | #include<bits/stdc++.h>
using namespace std;
/*
Input Format
The first and only line consists of n integers separated by commas.
Output Format
Print the integers after parsing it.
P.S.: I/O will be automatically handled. You need to complete the function only.
Sample Input
23,4,56
Sample Output
23
4
56
*/
int ... |
286250a221ae011a8bc4cbe80d3b4d8d96c5fd35 | 1588f049f4f398d5f4f0751e3a9b774ee69b63ef | waybarrios/video_nonlocal_net_caffe2 | /third_party/ComputeLibrary/arm_compute/core/NEON/kernels/assembly/kernels/a64_gemm_s8_4x4.hpp | C++ | hpp | 2,031 | permissive | /*
* Copyright (c) 2017 ARM Limited.
*
* SPDX-License-Identifier: MIT
*
* 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 ... |
7b6a864be086908bc5314a9134a2fb15982d2826 | 07415b70c3b0023fc62b9252b4e4c35099a132db | BallMIllsap/frame | /frame/src/mempool/MallocStructFactory.cpp | C++ | cpp | 1,438 | no_license | ///************************************************************
/// @Copyright (C), 2015-2025, bafei Information Technologies Co., Ltd.
/// @URL
/// @file MallocStructFactory.h
/// @brief 内存分配类
/// @attention
/// @Author chenjianjun
/// @Version 0.1
/// @Date 2015年08... |
f2f3fc56f1f8bb1a9168982bf3b99e7ef1c7b6e3 | 2f829d3672b17dff95ca14447c2adcd320bcb756 | RodrigoRossetti/URI-OJ | /Volume 25 (2500 - 2599)/2523/2523.cpp | C++ | cpp | 307 | no_license | #include<bits/stdc++.h>
using namespace std;
int main() {
char alfabeto[26];
int n, i;
while(scanf("%s", alfabeto) != EOF) {
scanf("%d", &n);
while(n--) {
scanf("%d", &i);
printf("%c", alfabeto[i-1]);
}
printf("\n");
}
} |
d451a8866628e68630f142d7bde742050e5671ef | 6d1028dd06656f79c3f06f1fd4cc445ad23aa1fd | Urielzm/ComputacionGraficaAvanzada | /CGALib/src/ThirdPersonCamera.cpp | C++ | cpp | 2,109 | no_license | #include "Headers/ThirdPersonCamera.h"
ThirdPersonCamera::ThirdPersonCamera(){
pitch = glm::radians(20.0f);
yaw = 0.0f;
angleAroundTarget = 0.0f;
angleTarget = 0.0;
distanceFromTarget = 1.0f;
sensitivity = SENSITIVTY;
worldUp = glm::vec3(0.0, 1.0, 0.0);
updateCamera();
}
void ThirdPers... |
8d2eedd27f1ea7b6046b4baaf14266b9b68b6409 | a7c86f92ed5a4b6f40f1ba75ee61747b69e8a8e7 | tracyliu1220/n-body | /engineering-thesis/latex/main6.cpp | C++ | cpp | 586 | no_license | void PrintInfo()
{
printf("Simulation info:\n");
printf("\tTime: %0.2fs\n", glfwGetTime());
printf("\tAverage FPS: %0.2f\n", average_fps_sum/average_fps_count);
printf("\tCamera position: [%.2f, %.2f, %.2f]\n", camera.position.x, camera.position.y, camera.position.z);
printf("\tField of view: %f\n", camera.fov);
... |
efc030f1ad11224c4ac406a9923291c2b35a6e85 | cb067ff22c4f41008ffd764a19b21d828a42e013 | kalyankondapally/chromiumos-platform2 | /cryptohome/cryptohome_metrics.cc | C++ | cc | 19,232 | permissive | // Copyright 2014 The Chromium OS 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 "cryptohome/cryptohome_metrics.h"
#include <string>
#include <base/logging.h>
#include <base/macros.h>
#include <base/stl_util.h>
#include <... |
4e90505dc902b28cd416904fa30b137bfb250cf3 | 547db69e5f3d872abb31ecf1a82ed68f404a8a00 | isliulin/jashliao_VC | /066_滑鼠控制/03_test_Show_Hide_Cursor程式本身隱藏滑鼠/test_Show_Hide_CursorDlg.cpp | C++ | cpp | 4,558 | no_license | // test_Show_Hide_CursorDlg.cpp : implementation file
//
#include "stdafx.h"
#include "test_Show_Hide_Cursor.h"
#include "test_Show_Hide_CursorDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
///////////////////////////////////////////////////////////////////////... |
0f5301ee7559a5d28af94886507af00b84a40ed2 | b12695ccf60e526bcd45710545fd1c157092f568 | DarkErtys/IT-class | /labs/ca/showtext/main.cc | C++ | cc | 7,363 | permissive | #include <conio.h>
#include <dos.h>
#include <string.h>
const int termSizeX = 80;
const int termXCenter = termSizeX/2;
const int termSizeY = 24;
const int termYCenter = termSizeY/2;
const int defaultBg = 0x06;
const int defaultFg = 0x0f;
enum { DEFAULT, UP, DOWN, LEFT, CENTER, RIGHT, PLUS, MINUS, ESC};
const int gr... |
93607eebcaf7089c5db08238107b05c20ad3d0f7 | b4e31ae17f8bc28c7646703ddb309753bde1bb27 | osamahatem/CompetitiveProgramming | /Timus/2001. Mathematicians and Berries.cpp | C++ | cpp | 392 | no_license | /*
* 2001. Mathematicians and Berries.cpp
*
* Created on: Aug 2, 2014
* Author: Osama Hatem
*/
#include <bits/stdtr1c++.h>
#include <ext/numeric>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int a1, a2, a3, b1, b2, b3;
scanf("%d%d%d%d%d%d", &a1, &b1, ... |
c1f774c6d7268d4d6d56c58aa65a899e7a7b5563 | 65ce684ceaa13dc7be0cf3e1f482195ec5fe10ed | tauruspay/taurus | /src/qt/bitcoinunits.cpp | C++ | cpp | 7,711 | permissive | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Taurus Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "bitcoinunits.h"
#include "chainparams.h"
#include "primitives... |
fa7e285cb865234495e30ef9b01fab2f26db8923 | 5c7d8a71ea7759f62d4b3317e43f4ae8a2fbe896 | doraneko94/AtCoder | /ABC/ABC120/c.cpp | C++ | cpp | 289 | no_license | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string S;
int cnt=0;
int len;
int main() {
cin >> S;
len = S.size();
for (int i=0; i<len; ++i) {
if (S[i] == '1') ++cnt;
}
cout << min(cnt, len-cnt) * 2 << endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.