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 |
|---|---|---|---|---|---|---|---|---|
3c4743e9b8650ca8ae7ca1761305f7f2d6a83a15 | 423a9824ca2f7bb7d746515312e0d8676970c078 | bsella/Darwinia-and-Multiwinia-Source-Code | /multiwinia/contrib/systemiv/lib/eclipse/eclwindow.cpp | C++ | cpp | 4,149 | no_license | #include "lib/universal_include.h"
#include <stdio.h>
#include <string.h>
#include "lib/debug_utils.h"
#include "eclipse.h"
#include "eclwindow.h"
#pragma warning( disable : 4996 )
EclWindow::EclWindow( const char *_name, const char *_title, bool _titleIsLanguagePhrase )
: m_x(0),
m_y(0),
... |
a20e39cb800168d467508a697ccd12b7a2fd68ad | 9cc611743a9d1c476ff99b2289445919fb9aa234 | sethhochberg/AwesomeJUCE | /JuceLibraryCode/modules/juce_audio_utils/players/juce_AudioProcessorPlayer.cpp | C++ | cpp | 6,124 | no_license | /*
==============================================================================
This file is part of the JUCE library.
Copyright (c) 2013 - Raw Material Software Ltd.
Permission is granted to use this software under the terms of either:
a) the GPL v2 (or any later version)
b) the Affero GPL v3
... |
19dc3d2afcedda9d6e967faf8dc0df31da2b019e | 626fe9f5a53127bdc474bb34f3c4c6e43e735367 | hust-IR2/eyetracker | /src/lightsensor_dataprocessor.cpp | C++ | cpp | 561 | no_license | #include "lightsensor_dataprocessor.h"
LightSensorDataProcessor::LightSensorDataProcessor(std::shared_ptr<LightSensorDataControler> lsdc) :
data_controler_(lsdc) {
}
void LightSensorDataProcessor::LoopProcess() {
shallStop = false;
while(true) {
if (shallStop) break;
if (data_controler_->GetLightSensorDa... |
1a3e176b589f57f4b6ff76201ae415d9647c3094 | 19d074dcc3ac2df747f430dc5abcdd5ded25945d | redisread/UE-Runtime | /Engine/Private/Rendering/SkeletalMeshLODImporterData.cpp | C++ | cpp | 36,002 | no_license | // Copyright Epic Games, Inc. All Rights Reserved.
#if WITH_EDITOR
#include "Rendering/SkeletalMeshLODImporterData.h"
#include "Logging/LogVerbosity.h"
#include "Logging/LogMacros.h"
#include "Serialization/BulkDataWriter.h"
#include "Serialization/BulkDataReader.h"
#include "Rendering/SkeletalMeshModel.h"
#include "... |
7e568825128db968fa847e6c81b4301c57adadbe | ea6b1a9c98c2940dafb7b4ab6adb2a0bafa461c5 | TmsKtel/aws-sdk-cpp | /aws-cpp-sdk-codebuild/source/model/Project.cpp | C++ | cpp | 6,259 | permissive | /*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" fil... |
466d562a7fb74eddce7c63eba26cebf0865142ad | a27dbcc0fbf2e902f96e49a6f4e8fb2285419fdd | yongwhan/codeforces | /797A.cpp | C++ | cpp | 771 | no_license | #include<cstdio>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<sstream>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<string>
#include<iostream>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int... |
1fb88ba700d5a659f39b616e20d778a3c1da2c2d | 850235c65d4a7f4ead41762d5fca6baf56b1ba2f | resultant-gamedev/OpenApoc | /framework/sound/sdlraw_backend.cpp | C++ | cpp | 12,845 | permissive | #include "framework/framework.h"
#include "framework/logger.h"
#include "framework/sound_interface.h"
#include "framework/trace.h"
#include "library/sp.h"
#include "library/vec.h"
#include <SDL.h>
#include <SDL_audio.h>
#include <algorithm>
#include <functional>
#include <list>
#include <mutex>
#include <queue>
#includ... |
81f24a7fbf2ad56bbba916bd5a1278c5756e665f | 329699603b49f3a9300f390854e81a254bc38a19 | roygaogit/Bigit_Genie | /GenieWindow/plugins/GeniePlugin_MapV2/powerline/src/PowerlineDevicerList.cpp | C++ | cpp | 1,919 | no_license | #include "PowerlineDevicerList.h"
#include "ui_PowerlineDevicerList.h"
PowerlineDevicerList::PowerlineDevicerList(QWidget *parent) :
QDialog(parent),
ui(new Ui::PowerlineDevicerList)
{
ui->setupUi(this);
setHeaderStyle();
slotConnect();
}
PowerlineDevicerList::~PowerlineDevicerList()
{
delete ui;
}... |
7909342fd737fdbd4b6c65c619c1aab5793ea678 | 774088062bf3a86a04d767af07f23948c366e14e | lanl/SICM | /examples/SNAP-greedy/ports/legion/Sweep.cc | C++ | cc | 20,377 | permissive | /*
* Sweep.cc
*
* Created on: Jun 16, 2015
* Author: payne
*/
#include "Sweep.h"
#include <utilities.h>
SweepBase::SweepBase(Context ctx, HighLevelRuntime* runtime,
SlappyParams _params,
LegionMatrix<LRWrapper> lr_scalFlux,
L... |
84496c964023edf398b28a072df15375fa810fe4 | 1e1f29c229799c35cc66ee4f5382f92a3f3aa773 | sbaa2014/MFCApplication1 | /ext/TslGame_MULTI_HACK-master/PUBG 2.2.33/SDK/PUBG_Dacia_WheelPuncture_F_classes.hpp | C++ | hpp | 700 | no_license | #pragma once
// PLAYERUNKNOWN'S BATTLEGROUNDS (EARLY ACCESS v2.2.33) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace Classes
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// Bluepr... |
2e048b1a3560ae09d3ad87eb8d51ede49293b1fe | 708806ea84a815f983f20747a1561fb81e5aba12 | pan2za/ctrl | /tools/sandesh/library/cpp/test/sandesh_http_test.cc | C++ | cc | 12,971 | permissive | /*
* Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
*/
//
// sandesh_http_test.cc
//
// Unit Tests for HTTP Introspect
//
#if 0
request sandesh SandeshHttpTestRequest {
1: testId;
2: magic;
}
#endif
#include "testing/gunit.h"
#include <boost/bind.hpp>
#include <string>
#in... |
a951c59ae08c4724973f6d912161b13133efd6e8 | cb26715d49f0d99893cb4937922895d0e1458b67 | J0bU/IntroPP2163024 | /OpenMP Introduction/Intermediate OpenMP/omp_worksshare2_sections.cpp | C++ | cpp | 2,051 | no_license | /******************************************************************************
* FILE: omp_workshare2.c
* DESCRIPTION:
* OpenMP Example - Sections Work-sharing - C Version
* In this example, the OpenMP SECTION directive is used to assign
* different array operations to each thread that executes a SECTION.
* AUT... |
943608c16d431e8485d6f48bf5a2db763995a77c | ac76b40efa827fead7d7b0d3f859743bdbd26dde | IvanNotOnlyFAt/StudyNoteBook | /c++/StuMS/studentms.cpp | C++ | cpp | 6,166 | no_license | #include "studentms.h"
#include <string.h>
#include <fstream>
#include <string.h>
#include <conio.h>//用getch();
#include <cstdlib>
#include <algorithm>
#include <iomanip>
StudentMS::StudentMS()
{
m_index = 0;
m_isQuit = false;
openFile();
}
StudentMS::~StudentMS()
{
saveFile();
}
void StudentMS::ope... |
f57f4f08d6ac31a05608da130eb6ae8bd5ba47b2 | 850e634a7c9a2feb902e96140a5bce961fdbc3b9 | KelvinNi/duckdb | /src/include/duckdb/execution/adaptive_filter.hpp | C++ | hpp | 893 | permissive | //===----------------------------------------------------------------------===//
// DuckDB
//
// duckdb/execution/adaptive_filter.hpp
//
//
//===----------------------------------------------------------------------===//
#pragma once
#include "duckdb/planner/expression/list.hpp"
#include <ran... |
2442e18c462aa752753d814109c4349cb0022147 | 78978e4a951816eff34aad6688a3bcc55133acd1 | lemire/SIMDCompressionAndIntersection | /advancedbenchmarking/src/ramtocache.cpp | C++ | cpp | 14,651 | permissive | /*
* The idea here is to successively grab arrays from a data file.
* The arrays are compressed (optionally using blocks of various size)
* to RAM and the repeatedly uncompressed.
*/
#include <unistd.h>
#include "common.h"
#include "util.h"
#include "timer.h"
#include "maropuparser.h"
#include "codecfactory.h"
/... |
3a8f9b1746a7f31c301a6d7e48e6a2077986186e | 23e68422348b79da693dd2811692ba11eeb0eec2 | IsaacShelton/24h | /source/main.cpp | C++ | cpp | 11,883 | permissive |
/*
The 24 Hour Programming Language Interpreter - Interprets .24h Files
By Isaac Shelton 5.3.2016
Instruction List:
'`' Allocate Allocates number of cells `(value).
'~' Deallocate Deallocates number of cells ~(value).
'^' ... |
e62ca270a379e8fcb8825c43868d3034f3552976 | 0ec9d66b3cd83e81c6d2c9aabf87abcd75ed681c | DanilaPetelin/C-lab-3 | /src/main2.cpp | C++ | cpp | 871 | no_license | #pragma warning(disable:4996)
#include <stdio.h>
#define sLMax 201 // max length of string
int WordPrintAndCount(char * line)
{
int countWords = 0;
int wordBegin = 0;
short flag = 0;
int i = -1;
do
{
i++;
if (line[i] != ' ' && line[i] != '\0')
{
if (flag == 0)
{
wordBegin = i;
flag = 1;
... |
a09ec8481cd56d54a08c885f061935e27a603b93 | c5bfc59cd56183c39d7b04bb95a648b0c9408851 | bumbacoin/ozziecoinTEST | /src/qt/aboutdialog.cpp | C++ | cpp | 1,034 | permissive | #include "aboutdialog.h"
#include "ui_aboutdialog.h"
#include "clientmodel.h"
#include "clientversion.h"
// Copyright year (2009-this)
// Todo: update this when changing our copyright comments in the source
const int ABOUTDIALOG_COPYRIGHT_YEAR = 2014;
AboutDialog::AboutDialog(QWidget *parent) :
QDialog(parent),
... |
b7d2201d3893bea5392bbc56c9cf5b96dec8ec37 | 4faa350950829f98cd14e174e77fb7e845763a40 | EvenCode/thittam | /src/wbs-controller_impl.cxx | C++ | cxx | 3,912 | no_license | /* Copyright (C) 2008-2018 HiPro IT Solutions Private Limited,
* Chennai. All rights reserved.
*
* This program and the accompanying materials are made available
* under the terms described in the LICENSE file which accompanies
* this distribution. If the LICENSE file was not attached to this
* distribution or fo... |
10f0aaabcb683dedeec0d3e7083fb05385e03af7 | 734b87bead5d17f62e3d6758568c44f2c317697d | stardog-union/boost | /libs/test/tools/console_test_runner/src/console_test_runner.cpp | C++ | cpp | 4,968 | permissive | // (C) Copyright Gennadiy Rozental 2005-2014.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
// See http://www.boost.org/libs/test for the library home page.
// Boost.Test
#ifndef BOOST_TEST_DYN_... |
15d3807b8ad495e21cb4a849d81cebbc86910688 | 94b8f5ab12f9b359c3d6b9d810eb5665210bb147 | 5l1v3r1/coilgun | /coilgun/caller.cpp | C++ | cpp | 499 | no_license | #include "stdafx.h"
#include "caller.h"
extern "C" {
uintptr_t asmCall(void * addr, void * args, int argc);
uintptr_t callShellcode(void *shellCodeAddr);
}
caller::caller()
{
}
caller::~caller()
{
}
uintptr_t caller::shellcodeCall(void * addr) {
return callShellcode(addr);
}
uintptr_t caller::preparedC... |
4715bb5783556050e09a0c8eef7515f0b74078c9 | ac5e81869eee4322a61da14d71f596491b02faba | dev-xy/swift | /include/ClusterPosition.cpp | C++ | cpp | 1,007 | no_license | /*
Swift (c) 2008 Genome Research Ltd.
Authors: Nava Whiteford and Tom Skelly (new@sgenomics.org ts6@sanger.ac.uk)
This file is part of Swift (http://swiftng.sourceforge.net).
Swift is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License ... |
82eb8bc39832a4e8aed0a1550393e5cd83b07761 | f48ebcac55099b8a8b8d65e25f411daefe68aed2 | krishna-mathuria/competitive | /dsasheet66.cpp | C++ | cpp | 944 | no_license | // C++ implementation to convert a
// sentence into its equivalent
// mobile numeric keypad sequence
#include <bits/stdc++.h>
using namespace std;
// Function which computes the sequence
string printSequence(string arr[],
string input)
{
string output = "";
// length of input string
int n = input.length();
f... |
8dfd0189e6770f56852635c0166428a89dab5901 | 4678452210c65b0aeec9f13af1c0e1a9a553af6f | ChristopheEhret/OnlineGame | /Source/JeuMultijoueur/MultiPlayerController.cpp | C++ | cpp | 455 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "JeuMultijoueur.h"
#include "MultiPlayerController.h"
void AMultiPlayerController::BeginPlay()
{
Super::BeginPlay();
}
void AMultiPlayerController::GetLifetimeReplicatedProps(TArray< class FLifetimeProperty > & OutLi... |
3766609b34a7cca84e8546744f23daea4d242d7e | 759bd1ea381472d0d905e059bd33c54eb2b60d8c | roliesha/TrackML_CombinatorialTracker | /TrackletConstructorPrim.cxx | C++ | cxx | 5,499 | permissive |
#include "TrackletConstructor.h"
#include "Tracker.h"
#include "util.h"
#include "TString.h"
#include "TFile.h"
#include "TH1.h"
#include "TNtuple.h"
#include <iostream>
#include "TrackModelPhysical.h"
#include "FitLayer.h"
#include "TStopwatch.h"
using namespace std;
void TrackletConstructor::ReconstructPrim( cons... |
90951815d26bd0fed839a05b30ef66d0e7ca5f29 | 3704b3dd1d4bda6b7563ebda9310fb52355f1956 | tekky02/oslab | /lab4/main.cc | C++ | cc | 319 | permissive | /*
* @Author: tekky
* @Date: 2020-11-11 13:15:45
* @Last Modified by: tekky
* @Last Modified time: 2020-11-11 15:38:03
*/
#include "fileprinter.hh"
int main(int argc, char const *argv[]) {
std::string path = ".";
if (argc == 2) {
path = argv[1];
}
FilePrinter demo(path);
demo.run();
return 0;
}
|
fc53072474bbcecf00234d798b874dc3aeb5a2cc | 1e2c3478fb77bc10030228e3d131ac94af1e0ac2 | Uzemiu/data-structure | /TicTacToev2/Board.cpp | C++ | cpp | 1,310 | no_license | #include "Board.h"
Board::Board() {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
squares[i][j] = 0;
}
}
moves_done = 0;
}
bool Board::done() const {
return moves_done == 9 || the_winner() > 0;
}
void Board::print() const {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++)
cou... |
4fe1fb9862f61e03bb6dbd300d351408d4aed46f | e343864e84507445a9ba015cc1994dc155e872aa | Datta2901/CCC | /.history/Day 1/Test/Answers/ResidueArthematic_20210304210814.cpp | C++ | cpp | 837 | no_license | // We are given two primes
// we are given there residues for three numbers
// we have to find that number and then find 2 * b + b - a value
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int p1,p2, a1,a2,a=0;
cin>>p1>>p2 >> a1>... |
a3a4fd16422f77fd8304cbe624c6f30af1db622d | 3a550556002ccd96a62257a2d929e65b033f7d9e | mukoedo1993/cpp_primer_solutions | /C++_chap14/exercise14_45AND46/exercise14_45.cpp | C++ | cpp | 357 | no_license | #include"Sales_data1.h"
#include <iostream>
#include <string>
#include<utility>
using std::string;
using std::istream;
using std::ostream;
int main()
{
Sales_data item1("str",13);
std::cout<<item1<<std::endl;
auto item2=static_cast<double>(item1);
auto item3=static_cast<std::string>(item1);
std::cout<<item2<<std::e... |
95fe8e81b5f2cdcd6aa7c0e3e4217e5b4482ea83 | c6ca1b74a5a9993e8caffa80cebaa6ed7bf5f0a7 | shikharmehrotra/hacktoberfest_2020 | /C++/66.cpp | C++ | cpp | 289 | no_license | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(auto &x:a)
cin>>x;
unsigned seed = chrono::system_clock::now().time_since_epoch().count();
shuffle(a,a+n,mt19937(seed));
//Based on mersenne twister 19937 engine
for(auto &x:a)
cout<<x<<" ";
}
|
2236b4e8da72d73ef74ecdbc2a7f19d43e0629df | 798b549e192412d463f1b4deeeecd681db2ccda7 | piotrrak/call_that | /include/call_that/config.hh | C++ | hh | 243 | permissive | #ifndef CALL_THAT_CONFIG_HH_included
#define CALL_THAT_CONFIG_HH_included 1
#if !defined(CT_HANA_NAMESPACE)
# define CT_HANA_NAMESPACE boost::hana
#endif
#if !defined(CT_HANA_EMBEDDED)
# error "TODO: Fix hana include paths"
#endif
#endif
|
4945d17f2c08cf40cb2674bea1b3621a4bd0152e | a40c446308a61a0af12928d3823efac0f38f055d | aissty/msszcoin | /src/init.cpp | C++ | cpp | 45,508 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "txdb.h"
#include "walletdb.h"
#include "bitcoinrpc.h"
#include "net.h"
#... |
ed8a66ed5fd08cca5cab57388fc96363c8e529c8 | 2f3b28d0cf8a204336b4cc5badf140d9f52b1a9c | SnideCoin/snidecoin | /src/qt/optionsdialog.cpp | C++ | cpp | 8,234 | permissive | #include "optionsdialog.h"
#include "ui_optionsdialog.h"
#include "bitcoinunits.h"
#include "monitoreddatamapper.h"
#include "netbase.h"
#include "optionsmodel.h"
#include <QDir>
#include <QIntValidator>
#include <QLocale>
#include <QMessageBox>
#include <QRegExp>
#include <QRegExpValidator>
OptionsDialog::OptionsDi... |
6b21fa1733237de5a77e04a97b185b2a17328b69 | 642ea362f3a58626dcda5449fdca98dea30c12e9 | AMechler/AliPhysics | /PWGHF/vertexingHF/AliNormalizationCounter.cxx | C++ | cxx | 23,425 | permissive | /**************************************************************************
* Copyright(c) 1998-2008, ALICE Experiment at CERN, All rights reserved. *
* *
* Author: The ALICE Off-line Project. *
* Contributors ... |
2cef6f007dd4c863fbe11e83f58bdcc766b1cb8f | 06c982225613eeb229ff81ad2b8e5a3de75b17ca | NicholasFan235/Codewars | /SimplePigLatin.cpp | C++ | cpp | 342 | no_license | #include <bits/stdc++.h>
std::string pig_it(std::string str)
{
std::istringstream iss(str);
std::string s;
std::ostringstream oss;
while (iss){
if (iss){
iss >> s;
oss << s.substr(1) << s[0] << "ay ";
}
}
std::string ans = oss.str();
return ans.substr... |
aecc231354e7800c51a686721da3232f6d8bc5fa | 0b6e2463f326683e022a5baae91fe8547b2fa887 | BaiLibl/my-leetcode | /Bit-manipulation/136.cpp | C++ | cpp | 449 | no_license | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int singleNumber(vector<int>& nums) {
if(nums.size()==0)return -1;
sort(nums.begin(),nums.end());
int i=0;
while(i<nums.size()){
if(i+1>=nums.size()||nums[i]!=nums[i+1])return nums[i];
i+=2;
}
return -1;
}
/*
int sum = 0;
... |
582c5c5f98405d07bd41f5d096b84916de663536 | f734b9df479d35d27dde4ecc2d0f05c9f842d211 | mananshr/KeccakTools | /Sources/Keccak-fPropagation.cpp | C++ | cpp | 30,413 | no_license | /*
KeccakTools
The Keccak sponge function, designed by Guido Bertoni, Joan Daemen,
Michaël Peeters and Gilles Van Assche. For more information, feedback or
questions, please refer to our website: http://keccak.noekeon.org/
Implementation by the designers,
hereby denoted as "the implementer".
To the extent possible u... |
72d93036a0f36f38f33dc881ee2ac34234039662 | 6fa46a06eb5ff200a3d129649b6cf670fc6e9a0a | Hiskyliu/Interview-Algorithms | /src/word_puzzle.cpp | C++ | cpp | 5,254 | no_license | #include <iostream>
#include <string>
/*
Word Puzzle
Given a word dictionary, a method to do lookup in dictionary and a M x N board where every cell has one character.
Find all possible words that can be formed by a sequence of adjacent characters. Note that we can move to any of 8
adjacent characters, but a word sh... |
4cc5f15545a42131cdc4a4dd691a31f572857c23 | 3bf2e6d06c71c5e04bded589e2db974e4143081a | jnbrunet/febio2 | /NumCore/BIPNSolver.cpp | C++ | cpp | 16,884 | permissive | /*This file is part of the FEBio source code and is licensed under the MIT license
listed below.
See Copyright-FEBio.txt for details.
Copyright (c) 2019 University of Utah, The Trustees of Columbia University in
the City of New York, and others.
Permission is hereby granted, free of charge, to any person obtaining ... |
44566f19d4d7b4f76e61fe7d6b88dc18c6d81ced | a6c9bb625cba580ab0f22ef6934d964abe34c853 | aviallon/waifu2x-converter-cpp | /src/modelHandler.hpp | C++ | hpp | 3,395 | permissive | /*
* modelHandler.hpp
* (ここにファイルの簡易説明を記入)
*
* Created on: 2015/05/24
* Author: wlamigo
*
* (ここにファイルの説明を記入)
*/
#ifndef MODEL_HANDLER_HPP_
#define MODEL_HANDLER_HPP_
#include <iostream>
#include <memory>
#include <cstdint>
#include <cstdlib>
#include "picojson.h"
#include "Buffer.hpp"
#include "filte... |
cab1170344596bb00af0c4811f3f7c83e8fefac4 | 7aacff257e4f521866397f3e256987d12ce2fd70 | petiaccja/Mathter | /benchmark/Utility.hpp | C++ | hpp | 3,350 | permissive | #pragma once
#include <Mathter/Matrix.hpp>
#include <Mathter/Vector.hpp>
#include <array>
using namespace mathter;
using Vec2f = Vector<float, 2, false>;
using Vec3f = Vector<float, 3, false>;
using Vec4f = Vector<float, 4, false>;
using Vec2fp = Vector<float, 2, true>;
using Vec3fp = Vector<float, 3, true>;
us... |
09e56c27d39efc1b954f3404ff312404a023e21f | 2c5a34d84d8e505ca0bf478920a1ce2a5f1e4fea | luogangyi/Dislab | /IAAS/CLC/AutoScaling/main.cpp | C++ | cpp | 2,520 | no_license | #include <iostream>
#include <fcntl.h>
#include <unistd.h>
#include <stdio.h>
#include <errno.h>
#include <signal.h>
#include "../../common/Config.h"
#include <stdlib.h>
#include "../../common/CppMysql.h"
#include "../../common/Log.h"
#include "AutoScaling.h"
using namespace std;
Log log;
String dbSe... |
61bf11a07927010863ee328c16256aac89b5500d | 2597a5a056922db9bb9cec3f651401a03e810512 | Collegeville/Lindquist-Neil-Work | /hpcg/src/SparseMatrix.hpp | C++ | hpp | 6,494 | permissive |
//@HEADER
// ***************************************************
//
// HPCG: High Performance Conjugate Gradient Benchmark
//
// Contact:
// Michael A. Heroux ( maherou@sandia.gov)
// Jack Dongarra (dongarra@eecs.utk.edu)
// Piotr Luszczek (luszczek@eecs.utk.edu)
//
// ******************************************... |
a684604c722cff18799a8a71f457cdcc92f9b3ab | 6f1b5ccc770e4a1e734f964b495877334c1e47e4 | probonopd/executor | /src/vdriver/dirtyrect.cpp | C++ | cpp | 9,017 | permissive | /* Copyright 1995 - 1997 by Abacus Research and
* Development, Inc. All rights reserved.
*/
#include <base/common.h>
#include <vdriver/vdriver.h>
#include <vdriver/dirtyrect.h>
#include <quickdraw/quick.h>
#include <quickdraw/cquick.h>
#include <prefs/prefs.h>
#include <commandline/flags.h>
#include <vdriver/autore... |
3dbd54a5a44ed5d56b47a86794e60fcc7b2fe83b | 1e5f652b58d3f7ec2ce4fb649d8539800359fb3b | Mr-Poseidon/CFile | /C网/1019自由下落的距离计算.cpp | C++ | cpp | 302 | no_license | #include<iostream>
#include<cstdio>
using namespace std;
double m,n;
double fun(double m,int n,int k)
{
if(k==n)
{
printf("%.2lf ",m/2);
return m;//第n次只计算反弹高度，不反弹
}
return m+m/2+fun(m/2,n,k+1);
}
int main()
{
cin>>m>>n;
printf("%.2lf",fun(m,n,1));
return 0;
}
|
6e6b942fe85caf79c557aadfc98de833a42fe77d | 5bfa3fd321dce6e7b96fa168a0309ea2ad80495b | ziyouhaofan/PUBG-SDK | /SDK/PUBG_BP_MapMarkerWidget_classes.hpp | C++ | hpp | 2,045 | no_license | #pragma once
// PlayerUnknown's Battlegrounds SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace Classes {
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// WidgetBlueprintGeneratedCl... |
e815a21335c56a6e24d1a9b95bb57891b20c1012 | 49408b57efe2d4d87951dd73ed16ba7e35e63999 | AOE-khkhan/MeshFEM | /src/lib/MeshFEM/SymmetricMatrix.hh | C++ | hh | 23,005 | no_license | ////////////////////////////////////////////////////////////////////////////////
// SymmetricMatrix.hh
////////////////////////////////////////////////////////////////////////////////
/*! @file
// Classes to wrap a flattened symmetric rank 2 tensor (a 6-vector in 3D),
// allowing it to be treated as a plain symmetric... |
3d6682c47b506a43d5f7f79a2d070b349b185f1f | 20ccfe39069057c40480e4edea39f34a9c744efb | V-Sekai/godot | /modules/openxr/extensions/openxr_opengl_extension.cpp | C++ | cpp | 18,246 | permissive | /**************************************************************************/
/* openxr_opengl_extension.cpp */
/**************************************************************************/
/* This file is part of: */
/* ... |
fc48ceff86cf92e04d3490e41defd502f9687271 | 74cf1d0cb28402e93c658bbc95b007a00ff52e29 | blitz-research/blitz3d_msvc2017 | /freeimage/FreeImage/WuQuantizer.cpp | C++ | cpp | 13,919 | permissive | ///////////////////////////////////////////////////////////////////////
// C Implementation of Wu's Color Quantizer (v. 2)
// (see Graphics Gems vol. II, pp. 126-133)
//
// Author: Xiaolin Wu
// Dept. of Computer Science
// Univ. of Western Ontario
// London, Ontario N6A 5B7
// wu@csd.uwo.ca
//
// Algorithm: G... |
7d1b5464c3ebb52c949e8c4fe8762240e03b7312 | 3bbdd1bb8956883cc413a3c3ecf6cde4605db3a2 | chrisdembia/openmm | /platforms/opencl/src/OpenCLNonbondedUtilities.cpp | C++ | cpp | 31,767 | no_license | /* -------------------------------------------------------------------------- *
* OpenMM *
* -------------------------------------------------------------------------- *
* This is part of the OpenMM molecular simulation toolkit originating from *
... |
d7cded0011b0db85edc5a779bbe723bb12adb29a | b9d660c9e337dff853b805f936fab7df0c0aa196 | todesmarz/InspectUsefulTools | /InspectUsefulTools/MemLeakUserObjDlg.cpp | C++ | cpp | 1,983 | no_license | /*! @file MemLeakUserObjDlg.cpp
@brief メモリーリーク(User オブジェクト)画面クラス
*/
#include "StdAfx.h"
#include "MemLeakUserObjDlg.h"
#include <math.h>
/*!
@brief コンストラクタ
@param [in] pParent 親ウィンドウインスタンス
*/
CMemLeakUserObjDlg::CMemLeakUserObjDlg(CWnd* pParent /*=NULL*/)
: CIUCommonMemoryLeakDlg(pParen... |
4470598cbe3b308557c4eb4aca35a1372eaed6f1 | dcc20acb6f71f2d55e45d200befe8d2193ff1fde | Fukji/Team-Notebook | /Geometry/04_Smallest Enclosing Circle.cpp | C++ | cpp | 1,620 | no_license | // welzl's algo to find the 2d minimum enclosing circle of a set of points
// expected O(N)
// directions: remove duplicates and shuffle points, then call welzl(points)
struct Point {
double x;
double y;
};
struct Circle {
double x, y, r;
Circle() {}
Circle(double _x, double _y, double _r): x(_x), y(_y), r(... |
d1e54e6d9f0a01cca77b4ef4ba9c3b58af8c7c8a | 9c8bc7cdec650522c505dd526f117ad793fd1aae | zepaz/perspective | /cpp/perspective/src/cpp/pyutils.cpp | C++ | cpp | 1,170 | permissive | /******************************************************************************
*
* Copyright (c) 2017, the Perspective Authors.
*
* This file is part of the Perspective library, distributed under the terms of
* the Apache License 2.0. The full license can be found in the LICENSE file.
*
*/
#include <perspecti... |
81ba7b88f381f3f69f91e63c3b993876ce6be0a8 | 89d0b52396d373c2ab995a9e586335fdaa6168e4 | Bluemi/shepherd | /src/common/world/world_block.cpp | C++ | cpp | 855 | no_license | #include "world_block.hpp"
#include <iostream>
#include "../physics/util.hpp"
world_block::world_block(const glm::ivec3& position)
: _position(position), _block_type(block_type::NORMAL)
{}
world_block::world_block(const glm::ivec3& position, const block_type block_type)
: _position(position), _block_type(block_ty... |
1bc921a39bedafe491961cea62fc2d2547370480 | 53b6e17cba947bc6f70c0935dfd1743ca13d9391 | hyunsang-shim/study | /study/study/Member.cpp | C++ | cpp | 717 | no_license | #include <iostream>
#include <cstring>
#include "Member.h"
using namespace std;
int MemberNoCmp(const Member * x, const Member * y)
{
return x->no < y->no ? -1 : x->no > y->no ? 1 : 0;
}
int MemberNameCmp(const Member * x, const Member * y)
{
return strcmp(x->name, y->name);
}
void PrintMember(const Member * x)
{... |
4bfb73ff0d4f89accd3306783312fff928e5b2a8 | 6351a46cd437acec05d7c308f14f3c042e935cd9 | ca2/app-simple | /_aaa/app/application.cpp | C++ | cpp | 2,024 | no_license | #include "framework.h"
#include "aura/application.h"
//#include "aura/update.h"
namespace simple_app
{
application::application()
{
m_strAppId = "app-simple/app";
m_strAppName = "Simple Application!!";
m_strBaseSupportId = "app_simple_app";
m_bLicense = false;
}
applicat... |
8921ad0921f37569addf390db03d89d6e8c2801e | 81b87f076ed2b2febc9f996edfacdba12daf473a | mutour/mozc | /src/unix/ibus/main.cc | C++ | cc | 5,125 | permissive | // Copyright 2010-2015, Google 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 must retain the above copyright
// notice, this list of condit... |
2c858d6b79b4e30bd68c80e362205b9787ac71b2 | 1facdf60c81739e0986d3fdc08eaad5689f63580 | superjump22/Papaya | /Sources/BezierCurve.hpp | C++ | hpp | 1,326 | no_license | //
// BezierCurve.hpp
// Papaya
//
// Created by Guo Chen on 6/21/17.
// Copyright © 2017 Guo Chen. All rights reserved.
//
#ifndef BezierCurve_hpp
#define BezierCurve_hpp
#include <vector>
#include "Utility.hpp"
using std::vector;
class BezierCurve {
public:
int degree;
vector<Vec3D> control_points;
BezierC... |
ee98900a3c4a833c23595913f7943c25f415827e | 87b34db78b27df940dd8e5eb45a1c0e274f04b15 | Ketan-Suthar/Algorithms | /Dynamic Programming/Intermidate/EditDistance/Method1.cpp | C++ | cpp | 712 | no_license | class Solution {
public:
int minDistance(string word1, string word2)
{
int n = word1.size(), m = word2.size();
int edit[n+1][m+1];
edit[0][0]=0;
for(int i=1; i<=n; i++)
edit[i][0] = edit[i-1][0]+1;
for(int i=1; i<=m; i++)
edit[0][i] = edit[0][i-1]+... |
934cb374d8dcd51eaa1c2fa918dd6ce7678b8609 | 12712c117e9e35ddeb64c394b7cc44746fc78c2b | KnowingNothing/iree | /iree/samples/emitc_modules/add_module_test.cc | C++ | cc | 4,737 | permissive | // Copyright 2020 The IREE Authors
//
// Licensed under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
#include "iree/samples/emitc_modules/add_module.h"
#include "iree/base/status_cc.h"
#include "ir... |
b4883dc941929b0b981e99d13ff8a9cf19e96b16 | cba6ecff8527d5569a2db149577e5b22b51dd721 | yumetodo/iutest | /test/record_property_tests.cpp | C++ | cpp | 5,553 | permissive | //======================================================================
//-----------------------------------------------------------------------
/**
* @file record_property_tests.cpp
* @brief iutest RecordProperty 対応テスト
*
* @author t.shirayanagi
* @par copyright
* Copyright (C) 2013-2... |
91170ad4a77270dae3ad5858fcc8d50809405017 | 981e5628bc7fdb3d2ea147ab81d75f1a71021221 | packbacker-s/CCode | /Homework/大一/第六章/数组的倒输入.cpp | C++ | cpp | 242 | no_license | #include<stdio.h>
#include<string.h>
int main(int argc, char const *argv[]) {
char a[80],c;
int i,b;
gets(a);
b=strlen(a);
for(i=0;i<=b/2;i++)
{
c=a[i];
a[i]=a[b-1-i];
a[b-1-i]=c;
}
printf("%s\n",a);
return 0;
}
|
6c839bf518630991b1015d15ea9d9816f58656d9 | 585c3ac9e0d8208e10052b5fbf2b1a33276ffeff | Richard-coder-Nai/OJ | /practice/0003.cpp | C++ | cpp | 409 | permissive | #include<iostream>
using namespace std;
int N, V;
int c[1005]; // cost
int w[1005]; // worth
int f[1005][1005];
int main(void) {
cin>>N>>V;
for(int i=1; i<=N; i++) cin>>c[i]>>w[i];
for(int i=1; i<=N; i++){ // i idx
for(int v=0; v<=V; v++){ // v volume
f[i][v] = f[i-1][v];
for(int k=1; k*c[i]<=v; k++){
... |
0361df69fa22922c2ee61f056012b60c839ec1f2 | 8916794c46edf389799c2c29db2c517a8de9ee80 | IMbackK/iio-uinput | /uinputdev.cpp | C++ | cpp | 2,443 | no_license | #include <fcntl.h>
#include <errno.h>
#include <sys/time.h>
#include <unistd.h>
#include <cstring>
#include <linux/uinput.h>
#include <linux/input.h>
#include "uinputdev.h"
UinputDevice::UinputDevice()
{
}
bool UinputDevice::openDev(const std::string& uinputPath, const std::string& name, uint16_t vendor, uint16_t pr... |
648216140829ac9e1a615086ca3e2164e81f3327 | 962bc478ad273c325d79b59983e0e3b176daa897 | Jeroen-Janssens1/Engine---Prog-4-Assignment | /Minigin/Minigin.cpp | C++ | cpp | 3,465 | no_license | #include "MiniginPCH.h"
#include "Minigin.h"
#include <chrono>
#include <thread>
#include "InputManager.h"
#include "SceneManager.h"
#include "SoundManager.h"
#include "Renderer.h"
#include "ResourceManager.h"
#include <SDL.h>
#include "GameObject.h"
#include "Scene.h"
#include "RenderComponent.h"
#include "TextRenderC... |
6faedad9f6e2896468d9e5cc8bc2c9657db0461e | 4d612100974639bc27313d6acee5824bc0b37675 | study-cote/Baekjoon | /수학/2839_설탕 배달/2839_성재.cpp | C++ | cpp | 843 | no_license | #include <iostream>
using std::cin;
using std::cout;
class sugar {
int n, count;
public:
sugar(int data) : n(data) {} // 생성자
void printAnswer(); // 결과값 계산 및 출력
};
void sugar::printAnswer() {
switch (n % 3) { // 15a + 3b형태로 변환하기 위해 +@ 값 따로 저장
case 1: // 15a + 10 + 3b
n -= 10;
count... |
1b02cda300768080c2152d1ad81d5f40f79c1339 | 5f91d85946ec747319d1a0ebc41fb71bc8f1688b | lukis101/ArcanistsScribblings | /sources/main2.cpp | C++ | cpp | 28,799 | permissive | #include "SDL/SDL.h"
#include "SDL/SDL_image.h"
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <iostream>
#undef main
// 1280 1024 800 600 640 480
const int SCREEN_WIDTH = 800;
const int SCREEN_HEIGHT = 480;
const int SCREEN_BPP = 32;
const Uint32 SCREEN_FLAGS = SDL_S... |
66cbb093d55fdff8558cbdf0384cc8f134cf9678 | 45eb1e187c3863cf141916de7c41bce0a28642e4 | mjs513/libuavcan-Teensy-3.x | /libuavcan_teensy/src/uavcan/dsdlc/equipment/air_data/Sideslip.hpp | C++ | hpp | 7,397 | no_license | /*
* UAVCAN data structure definition for libuavcan.
*
* Autogenerated, do not edit.
*
* Source file: C:\Users\CyberPalin\Desktop\uavcan\equipment\air_data\1026.Sideslip.uavcan
*/
#ifndef UAVCAN_EQUIPMENT_AIR_DATA_SIDESLIP_HPP_INCLUDED
#define UAVCAN_EQUIPMENT_AIR_DATA_SIDESLIP_HPP_INCLUDED
#include <uavcan/bui... |
7cefc67fdf78e0c42f20c08a472a6ea1c5225261 | 6abed8d10584af0ca33291090e0ae3cd0ceb1227 | niuxu18/logTracker-old | /second/download/curl/gumtree/curl_old_hunk_1151.cpp | C++ | cpp | 653 | no_license | default:
warnf(operation->global, "%s:%d: warning: '%s' uses unquoted "
"white space in the line that may cause side-effects!\n",
filename, lineno, option);
}
}
}
if(!*param) {
/* do this so getparameter can check for requi... |
7c304f1115c360e1b56662bc8fc6c6c7575e33dc | 2c2b7ac80ad12c8c3d3290f7aa0f8c5aa67b5fb5 | S-S-Sroy/CC_Coding | /ZPractice/Recursion/quick_sort.cpp | C++ | cpp | 660 | no_license | #include<bits/stdc++.h>
using namespace std;
int partition(int a[],int si,int ei){
int i=si-1;
int pivot = a[ei];
for(int j=si;j<ei;j++){
if(a[j]<=pivot){
i++;
swap(a[i],a[j]);
}
}
swap(a[i+1],a[ei]);
return i+1;
}
void qs(int a[],int si,int ei){
if... |
a6ae8d8a78292b995eed1199e244e63fc439dc53 | 291119c88722863cf3f6d8f33ed3a835b29cb3a4 | yida/bus | /matlab/ReceiveImu/kBotPacket2MexAPI.cc | C++ | cc | 2,275 | no_license | #include "kBotPacket2.h"
#include <mex.h>
#include <map>
#include <string.h>
#include <stdint.h>
#include <iostream>
using namespace std;
#define PACKET_TYPE kBotPacket2
#define PACKET_INIT kBotPacket2Init
#define PACKET_GET_ID kBotPacket2GetId
#define PACKET_GET_TYPE kBotPacket2GetType
#define PACKET_GET_DATA kBotPa... |
41431c7950ad9eb95d0887b632ff4b9bdf22c2db | 40a6e3bfb54ca370f830228102a97398960b9f0a | GoldenThumbs/Urho3D | /Source/Urho3D/Graphics/Drawable.cpp | C++ | cpp | 22,897 | permissive | //
// Copyright (c) 2008-2021 the Urho3D project.
//
// 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, m... |
89ba4711b2db36cde261ee55b081e7a0f72ff85c | db1ae9c957e339a12a03dce5d6a5b7061ab1aa5b | lethanhtam1604/SNY | /Algorithm & Data Structure/Algorithm/Prims.cpp | C++ | cpp | 1,532 | no_license | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <string.h>
using namespace std;
#define MAX 1010
const int INF=1e9;
vector<pair<int, int> > graph[MAX];
vector<int> dist(MAX, INF);
bool visited[MAX];
int N;
int showResult() ... |
e437c3c0632b581f56713a7f5b0ac73b6dc9c067 | dc846f762bb3e2eceb88c441b0a9ba05646c826e | drorgl/node-alvision | /src/opencv/TrackedElement.cc | C++ | cc | 332 | permissive | #include "TrackedElement.h"
namespace trackedelement_general_callback {
std::shared_ptr<overload_resolution> overload;
NAN_METHOD(tracked_ptr_callback) {
if (overload == nullptr) {
throw std::runtime_error("trackedelement_general_callback is empty");
}
return overload->execute("tracked_element", inf... |
c8a136750d4430ff940f7359ba5385b5bb1602ee | ae3b073ffa07a461ae96b75725b777f4184f99ff | sharkgrin1/RPM | /lab15/server2/mainwindow.cpp | C++ | cpp | 4,230 | no_license | #include "mainwindow.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
{
ui->setupUi(this);
ui->lineEdit_2->setValidator(new QIntValidator(1024,65535,this));
trey();
bdFromQrc();
this->setWindowIcon(QIcon(":/image... |
03f3d9779f9c60b6a1a237e974ca6f9bf802776c | 002c9e8c4bcf016d1a4a2089b629be48eeb02837 | theprototype/brkga_combinatorial_auctions | /src/include/chromosome_generator.hpp | C++ | hpp | 3,987 | permissive | /******************************************************************************
* chromosome_generator.hpp: Interface for chromosome generator based on
* LP relaxations of ILOG Cplex.
*
* Author: Carlos Eduardo de Andrade <ce.andrade@gmail.com>
*
* (c) Copyright 2011-2018, Carlos Eduardo de Andrade. All Rights Re... |
20336a335ae0738c43d5892ae5acc054bb9b9405 | 6d505aa0f1bfd9e9515f24b578751529dce330ee | RickyJun/live_plugin | /back/RtmpLivePushSDK/boost/boost/spirit/home/classic/tree/parse_tree_utils.hpp | C++ | hpp | 2,537 | permissive | /*=============================================================================
Copyright (c) 2001-2003 Daniel Nuffer
Copyright (c) 2001-2007 Hartmut Kaiser
http://spirit.sourceforge.net/
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http:/... |
8cac2394ea0d7470f35a7ef0f11950dd67e8746f | b14daf4a0df8a98efc09b2ce3d96a2cfb5b511f9 | MigCarloF/CMSC_178 | /Lab1/main.cpp | C++ | cpp | 2,433 | no_license | #include <iostream>
#include "PureTone.h"
#include "JustIntonation.h"
#include "TTET.h"
#include <string>
#include <sstream>
using namespace std;
AudioFile<double> generatePureTone(double, string, int);
int main() {
/**
* input and display message
*/
cout << "1. Generate a Pure Tone" << endl;
... |
894b6f7cbae8ee00ade9ab207152f66eed40b323 | 99881327cb581b62c625ba310e42faeeb8e0cd4b | ohperhaps/C_learning | /chapter01/1-13(1-11).cpp | C++ | cpp | 339 | no_license | #include <iostream>
int main() {
int num1 = 0, num2 = 0;
std::cout << "Enter two number" << std::endl;
std::cin >> num1 >> num2;
if (num1 >= num2) {
num1 += num2;
num2 = num1 - num2;
num1 -= num2;
}
for (int i = num1+1; i < num2; ++i)
std::cout << i << std::endl;... |
6b2f0e8dd6818137a5c1d50fcc0e6832b8ec22f1 | b5097192ef546af1c6e5225b569151bc2e36184c | Radhesh-Sarma/Competitive-Coding | /atcoder/tenka1-2019-beginner/B.cpp | C++ | cpp | 1,358 | no_license | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) ... |
d5818ebf398075b21d60c6124d865d5eed01b8c4 | 40de9e076104c47042ab09432fe70eb517fa5cfb | google/visqol | /src/speech_similarity_to_quality_mapper.cc | C++ | cc | 2,276 | permissive | // Copyright 2019 Google LLC, Andrew Hines
//
// 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... |
feae5f3146597293b89de1b705b15ca92571177f | 0c99a8dbbca5a570b4f957e08698f5cefd998f59 | yas/vktiny | /src/math.cpp | C++ | cpp | 292 | permissive | #pragma once
#include "vktiny/Math.hpp"
namespace vkt
{
glm::mat4 flipY(const glm::mat4& transformMatrix)
{
glm::mat4 flipped = transformMatrix;
flipped[1][1] *= -1.0; // flip y scale
flipped[3][1] *= -1.0; // flip y translate
return flipped;
}
}
|
bbfac3844134db2d16d2d24cf2163ed34739bbed | 0c6c6619819f78f8d9f41e4f70faa2a89e556a70 | cli851/noi | /oj28(2).cpp | C++ | cpp | 471 | no_license | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
if(n==1){
cout<<2;
return 0;
}
if(n==2){
cout<<3.5;
return 0;
}
int a[n];
int b[n];
a[0]=2,a[1]=3,b[0]=1,b[1]=2;
for(int i=2;i<n;i++){
a[i]=a[i-1]+a[i-2];
b[i]=b[i-1]+b[i-2];
}
float c[n];
f... |
ac2e1c092c87285d4ce5160edc3afa4db83eddcb | 2c77b3e79a240aa3de002ebcc567799931d78206 | fduignan/ra2a1 | /blinky/init.cpp | C++ | cpp | 3,534 | permissive | #include <stdint.h>
void init(void);
void Default_Handler(void);
int main(void);
// The following are 'declared' in the linker script
extern unsigned char INIT_DATA_VALUES;
extern unsigned char INIT_DATA_START;
extern unsigned char INIT_DATA_END;
extern unsigned char BSS_START;
extern unsigned char BSS_END;
e... |
273cf646d4948b08f03d8173c74100d32824dc4b | f0abba09d646958fbd1854492139272ba84eb2cc | cqann/PRGM | /C++/CodeChef/January_2020/Doraemon/doraemon.cpp | C++ | cpp | 1,976 | no_license |
#include <iostream>
#include <cmath>
#include <math.h>
#include <time.h>
#include <string>
#include <unordered_map>
#include <deque>
#include <vector>
#include <algorithm>
using namespace std;
bool isPalindrome(deque <int> x){
for (int i = 0; i < ceil(x.size()/2.0);i++){
if (x[i] != x[x.size()-i-1]){
... |
5acb7d854b5c9f3d17c5031370970dd230d150f9 | d6b13960bff7168aaa00a28471bd770d6de83d89 | shrekshrek/gamebox-haxe | /bin/android/obj/src/zpp_nape/dynamics/ZPP_Contact.cpp | C++ | cpp | 47,728 | no_license | #include <hxcpp.h>
#ifndef INCLUDED_nape_dynamics_Contact
#include <nape/dynamics/Contact.h>
#endif
#ifndef INCLUDED_nape_geom_Vec2
#include <nape/geom/Vec2.h>
#endif
#ifndef INCLUDED_zpp_nape_dynamics_ZPP_Arbiter
#include <zpp_nape/dynamics/ZPP_Arbiter.h>
#endif
#ifndef INCLUDED_zpp_nape_dynamics_ZPP_Contact
#include... |
5d40ba28d3497ad95af7a21fbc2871100c97f0c6 | 13db8e7c6bc15df67e59db348ba2def09f546f65 | Souravs437/codeforces | /codeforces/243/A.cpp | C++ | cpp | 1,321 | no_license | //SkGeN
#include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstring>
#include<climits>
#include<deque>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pa... |
23c07d557132fbcb761eedf4165f614ce4868550 | 456d6aacbda7cbd5cb0cb26288cec5cac3c07f3a | 1059444127/blobfs | /test-sys/ResultImpl.cc | C++ | cc | 1,365 | no_license | #include "ResultImpl.hh"
#include <algorithm>
#include <boost/lexical_cast.hpp>
#include <boost/shared_ptr.hpp>
#include <sstream>
Failure::Failure(std::string file, int line, std::string msg)
throw()
: file(file), line(line), msg(msg) { }
std::string Failure::toString() const
throw()
{
return file +... |
ea851d59bbd0c246b5b0760a8c05ba3d4965875a | fc34cb99af12ff42dd1050783f4b8bbbb2fa5dd6 | Samsung/Castanets | /components/security_interstitials/content/urls.cc | C++ | cc | 435 | permissive | // Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/security_interstitials/content/urls.h"
namespace security_interstitials {
const char kChromeUIConnectionHelpHost[] = "connection-he... |
daf9436a1382161a1b1138ee5d0ca1808f970a10 | 5b7b845751c742fa827c282b9c6b39814e5a3919 | niuxu18/logTracker-old | /second/download/collectd/gumtree/collectd_repos_function_1738_last_repos.cpp | C++ | cpp | 1,705 | no_license | static int ovs_db_json_data_process(ovs_db_t *pdb, const char *data,
size_t len) {
const char *method = NULL;
char yajl_errbuf[OVS_YAJL_ERROR_BUFFER_SIZE];
const char *method_path[] = {"method", NULL};
const char *result_path[] = {"result", NULL};
char *sjson = NULL;
yajl... |
d000cc5b91aae900a271113112d9ad2998f31884 | b0f32f1872f1ebb333cb74d77f12c347e6c9f60e | szu-lab/CoreMop | /src/server/game/Globals/ObjectAccessor.cpp | C++ | cpp | 7,826 | no_license | /*
* Copyright (C) 2008-2012 TrinityCore <http://www.trinitycore.org/>
* Copyright (C) 2005-2009 MaNGOS <http://getmangos.com/>
*
* This program 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 ver... |
54397daa2e139efc4b4eeebace3e767ddae9cc12 | d74610ca70cc9703bcb0c0cee5a408682966a636 | aurantst/windows-XP-SP1 | /XPSP1/NT/inetsrv/iis/svcs/w3/filters/pa/raidmap.cxx | C++ | cxx | 13,673 | no_license | /*++
Copyright (c) 1998 Microsoft Corporation
Module Name:
raidmap.cxx
Abstract:
This module map file requests for RAID UNC shares and generates appropriate MIME
content-type header
Author:
Philippe Choquier ( phillich ) 27-mar-1998
--*/
extern "C" {
#include <nt.h>
#in... |
c5eac80766e9529409bd4c0e48f4bcba4b8458eb | d169ca767169cb0f5095da3526cecf4f4da89c71 | randyli/google-input-tools | /client/ipc/settings_client_test.cc | C++ | cc | 26,031 | permissive | /*
Copyright 2014 Google Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing,... |
c4028f9e28543fa8f3dfdfb46b6e8aebae9e5b4c | a0c0031dabd3359f4172bf907d4ad18aa939a644 | PhilipNelson5/class-projects | /CS6030_HighPerformanceComputing/Exercises/albert_root_finding_method/aberth-exe/main.cpp | C++ | cpp | 586 | no_license | #include "aberth/aberth.hpp"
#include "function/function.hpp"
#include <iostream>
int main()
{
Function::Function f({{0, 5.0}, {1, -3.0}, {2, -2.0}, {3, 1.0}});
std::cout << "f(3) = " << Function::image(f, 3) << std::endl;
std::cout << "f(4) = " << Function::image(f, 4) << std::endl;
std::cout << "f`(-... |
4b2501d069cb52d15bec2794cba54ccedceef4d4 | d32b254752dbc7330f021b3609aff8cbf5fd9a87 | liangjisheng/C-Cpp | /STL/algorithm/func_object.cpp | C++ | cpp | 1,184 | permissive | // 函数指针无法记住它上一次调用是的状态，使得它无法应用在那些需要
// 对每次调用状态进行维护的场景，例如，无法应用单独的一个函数来计算
// 容器中的所有数据的和，因为它无法得知上一次累加的结果是多少，
// 这是就用到了函数对象。就是定义了函数调用操作法(function-call operator)
// 即operator()的普通类的对象，重载operator()实现函数的所有功能，
// 类具有属性可以将状态数据保存到它的属性中，应用在更广泛的范围
#include"iostream"
#include"tchar.h"
using namespace std;
// 定义模板函数对象
template<typen... |
3ed32036c0a5da274e3e4da7b0dcb39da729852e | 96f6965206e0176cdc175482a5a95aab78ef6298 | ajaysharma388/Compititive_Programming_CB | /Graph/Lec10_Check_whether_graph_isBipartite.cc | C++ | cc | 1,659 | no_license | /*==========================
Author : Ajay Sharma
date : 04.05.2020
============================*/
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
void fastio(bool read = false)
... |
997a2a271970e571294854ab2a53eacd470bda0f | 0824c4fe6bd9978eb200f60418ffb4cf0cda0fc1 | phmsmech/Firmware | /src/modules/control_allocator/ActuatorEffectiveness/ActuatorEffectivenessRotors.hpp | C++ | hpp | 4,661 | permissive | /****************************************************************************
*
* Copyright (c) 2020 PX4 Development Team. 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. Redistri... |
28c815611c14f441ef202cdae2f9386c4bbfa196 | 97a9ff0e47eff97c9c2f29d719abcebcd732c975 | RomanSaveljev/KeypadBuddy | /src/ui/KeypadBuddyAppView.cpp | C++ | cpp | 6,891 | no_license | /*
============================================================================
Name : KeypadBuddyAppView.cpp
Author :
Copyright : Your copyright notice
Description : Application view implementation
============================================================================
*/
// INCLUDE FILES
#include <c... |
39d8d5551d6809774019efce974ff5ecdeb4198f | 6899ed698693b3f4f55c44db6bca0844243e3ec6 | tylerchen0619/mlir | /examples/Linalg/Linalg1/lib/RangeOp.cpp | C++ | cpp | 2,842 | permissive | //===- RangeOp.cpp - Implementation of the linalg RangeOp operation -------===//
//
// Copyright 2019 The MLIR Authors.
//
// 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.... |
1414c8a7ca00e18e30b0581edf00a0d6e348cd65 | 7b6e121affdb86b74032f5def5db6b6e04c5288f | Zh-cy/webserver | /sql/sql.cpp | C++ | cpp | 2,278 | no_license | #include "sql.h"
using namespace std;
sql_pool::sql_pool()
{
cout << "MYSQL constructor" << endl;
this->m_FreeConn = 0;
this->m_CurConn = 0;
}
sql_pool *sql_pool::GetInstance()
{
static sql_pool conn_pool;
return &conn_pool;
}
void sql_pool::init(string url, string user, string password, string... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.