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 |
|---|---|---|---|---|---|---|---|---|
f9bfef3762f342dbfd7e1e77f8ff34f1879af93c | 4a96feb4a7446a0345fc7a251b1837c937be9080 | knied/LD27 | /LD27/Mainwindow.cpp | C++ | cpp | 1,184 | no_license | //
// MainWindow.cpp
// LD27
//
// Created by Kristof Niederholtmeyer on 17.08.13.
// Copyright (c) 2013 Kristof Niederholtmeyer. All rights reserved.
//
////////////////////////////////////////////////////////////////////////////////
#include "Mainwindow.h"
#include <iostream>
///////////////////////////////////... |
9bc7ad0519fb62fe1ce86e6d14fdb14bf0bf60e0 | ac9ce1fb1f754f621ca557f7106a9ebddce5273e | UCR-UAS/BISON-View | /client/telemetry.cpp | C++ | cpp | 208 | permissive | #include "telemetry.h"
#include "ui_telemetry.h"
telemetry::telemetry(QWidget *parent) :
QWidget(parent),
ui(new Ui::telemetry)
{
ui->setupUi(this);
}
telemetry::~telemetry()
{
delete ui;
}
|
2e71443f3469033b22902bd4ca055ebebc6a1ce4 | 5fd77611b4d20c8f763f496484088204408739af | Galibier/AlgoPractise | /LeetCode/weekly/weekly-contest-186/1422.maximum-score-after-splitting-a-string.cpp | C++ | cpp | 738 | no_license | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution {
public:
int maxScore(string s) {
int ans = 0;
vector<int> dp(s.length() - 1, 0);
if (s[0] == '0')
dp[0] = 1;
else
dp[0] = 0;
for (int i = 1; i < s.length(); i++)
if (s[i] == '1') dp[0]... |
a1a3a3a86ce7125199e3fd31f771ddd71026c649 | 45f4dce1a75bc3b1140776c521a188dde5bbe416 | giraphics/VulkanByExamples | /source/Chapter4/Ch5_MultiWindow/source/SimpleMesh.cpp | C++ | cpp | 25,136 | no_license | #include "SimpleMesh.h"
#include "../../../common/VulkanHelper.h"
#include <QMainWindow>
#include <QHBoxLayout>
#include <QApplication>
using namespace std;
static int rot = 0;
SimpleMesh::SimpleMesh(VulkanApp* p_VulkanApp)
{
m_hPipelineLayout = VK_NULL_HANDLE;
m_hGraphicsPipeline = VK_NULL_HANDLE;
memset(&Un... |
a6ed84709fc5fb41738ce8bfda7053c1ada0cfbe | f87755485085a84ff08d41a69bed95ca4dafec10 | michaelhood/chromium | /chrome/common/extensions/api/extension_action/browser_action_handler.cc | C++ | cc | 2,063 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/common/extensions/api/extension_action/browser_action_handler.h"
#include "base/memory/scoped_ptr.h"
#include "base/strings/utf_stri... |
8b68bad0949d0cee9f50f58bd8e5bfe55404decd | 7e4e4df0509f430af4ac522f0edddb4ead2e4c08 | KonstantinVoip/1901VC1T_Inteltech | /3rdPartyLIB/dsp_core/C6000/drv_amoeba/rik/tms_c64xx/drv_rik.cpp | C++ | cpp | 53,502 | no_license | //**************************************************************************************************
// Copyright (C) 2009 RCZI
//--------------------------------------------------------------------------------------------------
// FILENAME....... drv_rnd.cpp
// DATE CREATED... 05/10/2009
// LAS... |
5c41752b01f85c6b7d104798aa85912673f06173 | 2779459c3c6933e16bbd5cadeb488c1ff34122f2 | CCSI-Toolset/boiler_model | /BoilerModel/IdealGasMixture.cpp | C++ | cpp | 23,281 | permissive | //IdealGasMixture.cpp: implementation of the CIdealGasMixture class.
//
///////////////////////////////////////////////////
//my incude
#include <cmath>
#include "Constants.h"
#include "IdealGasMixture.h"
#include "UtilityFunctions.h"
///////////////////////////////////////////////////////
//Constuctor and Destructor... |
587724425ae3f802eeaee7c3d6c935f5a071c020 | d64a565e4b45ff5235a83602806a11ccc324998b | arthurdamm/algorithms-practice | /leet/0062_unique_paths/0062_unique_paths.cpp | C++ | cpp | 795 | no_license | // LeetCode 62. Unique Paths
// https://leetcode.com/problems/unique-paths/
// O(m*n) time, O(m*n) space
#include <string.h>
#include <iostream>
using namespace std;
class Solution {
public:
unsigned long uniquePaths(int m, int n) {
unsigned long dp[m][n];
memset(dp, 0, m*n*8);
dp[0][0] = 1... |
05a85f182ac9dbd5d1b07907f5855c68b9425c0b | 4817680b847a34668e6edca197926385c43cf3c7 | hinnie123/RogueCompany_SDK | /SDK/RC_AppleVision_functions.cpp | C++ | cpp | 1,430 | no_license | // RogueCompany (Dumped by Hinnie) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "../SDK.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Functions
//---------------------------------------------------------------------------
// Functi... |
6daeafd237327a891b56481fa84e41145607e03e | e30d1ed5429a46726d9020e5d4c1770f8102e039 | jojo-/virtualbelgium | /include/Household.hpp | C++ | hpp | 7,878 | no_license | /****************************************************************
* HOUSEHOLD.HPP
*
* This file contains all the households related class and methods.
* The households are as agents containing individual agents and
* localised in a municipality.
*
* Authors: J. Barthelemy and L. Hollaert
* Date : 17 july 20... |
2aa345b03e05a9721c9d8200d280e33a744a3816 | fdb919095e882653e1231ee3f73ce962b2ab1d1a | titango/pp3 | /src_108/ReturnFloat.cpp | C++ | cpp | 503 | no_license | /*
* Definition
* Class: ReturnFloat
* Date created: 2007-09-12
* Written by: Pasquale Barile
*
* See header file for details
*/
#include "ReturnFloat.h"
const int ReturnFloat::TYPENUM = 2;
ReturnFloat::ReturnFloat() : ReturnData(), data(0.0)
{
initTypeNum();
}
ReturnFloat::~ReturnFloat()
{
}
vo... |
8600945ff4848b9189bc22a92687aba375a56cbe | bec8717a6a98bb19d540538edfc1bfc87da0eae0 | tomicooler/cppmicrooptexamples | /false_sharing.cpp | C++ | cpp | 1,902 | permissive | #include <atomic>
#include <benchmark/benchmark.h>
#include <iostream>
#include <new>
#include <thread>
// https://www.youtube.com/watch?v=c-hZpChQKe0&t=1763s
// https://en.cppreference.com/w/cpp/thread/hardware_destructive_interference_size
#ifdef __cpp_lib_hardware_interference_size
using std::hardware_constructive... |
4209bc965893e5da06966e876e86fb8507ecfbac | 588bcd529dfc2637e55239c26d0df3ddcc2221cf | nboy56/extension-rive | /defold-rive/src/rive-cpp/bones/skin.cpp | C++ | cpp | 1,835 | permissive | #include "bones/skin.hpp"
#include "bones/bone.hpp"
#include "bones/skinnable.hpp"
#include "bones/tendon.hpp"
#include "shapes/path_vertex.hpp"
using namespace rive;
Skin::~Skin() { delete[] m_BoneTransforms; }
StatusCode Skin::onAddedClean(CoreContext* context)
{
m_WorldTransform[0] = xx();
m_WorldTransform[1] =... |
f03f46604e63eb709b6bfb72c09e6d87734061bd | beb17e0b76a6fc012c7813b7072b6158f130f912 | sifaserdarozen/CodeTrain | /codility/TreeHeight/src/code.cpp | C++ | cpp | 980 | no_license | // you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
#include <algorithm>
#include <iostream>
/** @brief Binary tree with value, and pointers to left and right branches
*/
struct tree {
int x;
tree... |
304b18571466f7ed35f2619d33e9d5bc5c333012 | b88ecc037d5188add36621f797a4ba088e84e4ab | shabalind/llvm-project | /libcxx/test/std/utilities/variant/variant.visit/visit.pass.cpp | C++ | cpp | 12,913 | permissive | // -*- C++ -*-
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, 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
//
//===------------... |
2f750514b2f89a30a4ea83559e4dde14ed2cf4aa | 30e5341866d612e669f3f7bb0b13b1ea5eeeda04 | timblechmann/nt2 | /modules/extern/gsl_specfun/cover/scalar/gsl_sf_laguerre_2.cpp | C++ | cpp | 2,812 | permissive | //==============================================================================
// Copyright 2003 - 2012 LASMEA UMR 6602 CNRS/Univ. Clermont II
// Copyright 2009 - 2012 LRI UMR 8623 CNRS/Univ Paris Sud XI
//
// Distributed under the Boost Software License, Version 1.0.
// ... |
1fa3131d91c2a8a38edb3c52ffe7683a8d6bf554 | b6bf839f00361db6b16135350cb7437e42aba1ba | zflamig/gdal | /gdal/ogr/ogrsf_frmts/nas/nasreader.cpp | C++ | cpp | 37,061 | permissive | /******************************************************************************
*
* Project: NAS Reader
* Purpose: Implementation of NASReader class.
* Author: Frank Warmerdam, warmerdam@pobox.com
*
******************************************************************************
* Copyright (c) 2002, Frank War... |
219c694a25ce9576760b4955c1ae1b2579f63692 | f612c265f81567e1e7b5cb6ff72ea84f190b4af7 | elmmm33/Impressionist | /LineBrush.cpp | C++ | cpp | 3,481 | no_license | //
// LineBrush.cpp
//
// The implementation of Line Brush. It is a kind of ImpBrush. All your brush implementations
// will look like the file with the different GL primitive calls.
//
#include "impressionistDoc.h"
#include "impressionistUI.h"
#include "linebrush.h"
extern float frand();
LineBrush::LineBrush(Impres... |
49057e30563f6dd245af4a92327e05ce30cda3db | 056ac2772bdf8058c9a63762f2b215567f9a4f0f | rosoareslv/SED99 | /c++/godot/2018/4/primitive_meshes.cpp | C++ | cpp | 41,725 | permissive | /*************************************************************************/
/* primitive_meshes.cpp */
/*************************************************************************/
/* This file is part of: */
/* ... |
0d2769cc27f7603e8064f5b5a6a21acb6792b3fd | 538c953804d6a57fb8617316d8a1161f8dc0ead5 | Corsol/ScriptDev3 | /scripts/eastern_kingdoms/blackrock_mountain/blackwing_lair/boss_chromaggus.cpp | C++ | cpp | 11,572 | no_license | /**
* ScriptDev3 is an extension for mangos providing enhanced features for
* area triggers, creatures, game objects, instances, items, and spells beyond
* the default database scripting in mangos.
*
* Copyright (C) 2006-2013 ScriptDev2 <http://www.scriptdev2.com/>
* Copyright (C) 2014-2015 MaNGOS <https://get... |
940c3b67b605ab70ec4fd0179e4cec0a2b23ab2c | 72836f5fdbd5515e5338f2e81d3d4c8254d6e0ef | perfect-porfect/Qt-TcpServer | /main.cpp | C++ | cpp | 1,148 | permissive | #include <QCoreApplication>
#include <thread>
#include <iostream>
#include "tcp_server.h"
#define SERVER_PORT (8585)
void data_received(QByteArray& data)
{
std::cout << "receive " << data.size() << " bytes" << std::endl;
}
void disconnect()
{
std::cout << "disconnect" << std::endl;
}
void... |
f00a4307e7ce75e4f97c3d54c8b7a26e85a13eb7 | 2610471808f11ad5e2c39cf2cbef58f4851c1bbd | rahulgoyal911/UCA2017 | /numReverse.cpp | C++ | cpp | 453 | no_license | //reverse number using recursion
//two ways
#include<iostream>
using namespace std;
/*
int reverse(int n,int rev)
{
if(n<1)
{
rev=rev+n;
return rev;
}
else
{
rev=rev*10+n%10;
rev=reverse(n/10,rev);
}
return rev;
}
*/
int reverse(int n,int rev)
{
static int d=1;
if(n>10)
{
int k=n%10;
rev=reverse(... |
f17d76f6e88b5ac8be5bcf8e7fd5f480976f96c8 | 37efce7c15b1e6f75e28138f224243e01d865c45 | davinash/arangodb | /arangod/Agency/FailedServer.cpp | C++ | cpp | 10,769 | permissive | ////////////////////////////////////////////////////////////////////////////////
/// DISCLAIMER
///
/// Copyright 2014-2018 ArangoDB GmbH, Cologne, Germany
/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany
///
/// Licensed under the Apache License, Version 2.0 (the "License");
/// you may not use this file except... |
6ae07eeaeab31c9004121d73d20f2f785582a245 | 3fecd8ce50a6d2339d9d1251b9fb31323b560a0b | MichaelYutaoWang/gmpackage | /gmpackagemanager.cpp | C++ | cpp | 31,153 | no_license | #include "gmpackagemanager.h"
#include "gmpackagebuilder.h"
#include <QDir>
QDataStream::ByteOrder GmPackageManager::LoPackageByteOrder = QDataStream::LittleEndian;
QDataStream & operator>>(QDataStream &in, GmPackageFileInfoItem &item)
{
// set byte order to LoPackage default byte order
in.setByteOrder(GmPac... |
f9931aa063d9178a5f69931ac8fc2d446fd9ce74 | aaeb36ec5e9fffbcfdfef89b1bbb241ec9fa3430 | ssh352/cppcode | /cmake-3.2.2/Source/cmGeneratorExpressionEvaluationFile.cxx | C++ | cxx | 5,588 | permissive | /*============================================================================
CMake - Cross Platform Makefile Generator
Copyright 2013 Stephen Kelly <steveire@gmail.com>
Distributed under the OSI-approved BSD License (the "License");
see accompanying file Copyright.txt for details.
This software is ... |
1e348c5842f4e7a62dc7456e0bf78eefd7330034 | 11c3a7a04c8e25a387ff7c820ed81b2fafe4b29c | Dr-01/cort_proto | /unit_test/cort_proto_test.cpp | C++ | cpp | 3,844 | permissive | #ifdef CORT_PROTO_TEST
//Suppose we rent the cpu time in a strange old super computer and costing no more than 256 "clock" each time.
//So computing is enabled only after allowed and we need to divide our computing task into several one.
//This is an example to simulate the IO operation that only enabled after select ... |
c3038f9edb5accab80e06683edcc0e670922ba8e | a8649b8df74618c252e354781f8741624fe26da0 | Arezou-gh/Stokes_hp | /Stokes.cc | C++ | cc | 4,274 | no_license | #include "StokesProblem.hh"
#include "Parameters.hh"
#include <fstream>
#include <vector>
using namespace dealii;
void output_convergence(EXAMPLE example, REFINEMENT refinement, double theta,
std::vector<unsigned int> const &n_dofs_per_cycle,
std::vector<do... |
75a861a7c7320d6de687472174010dc61bf06d98 | ec960d97033bed73aa7ada656fac3a3180155fe2 | rana11shubham/CPP | /Generate Parentheses - GFG/generate-parentheses.cpp | C++ | cpp | 1,020 | no_license | // { Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
vector<string> AllParenthesis(int n) ;
// } Driver Code Ends
//User function Template for C++
// N is the number of pairs of parentheses
// Return list of all combinations of balanced parantheses
class Solution
{
... |
59605478ccbc87ab927d9b0f004b057b3f7e7363 | c6f93b0658df7741eb8f99b0b738fb704aa692bf | arthurhoch/homeworks | /CPP/Dado/Dado.cpp | C++ | cpp | 1,751 | no_license | //+_+_+_+_+_+_+__+__+__+__+__+_+_
//_+__+_By: "Sir" Arthur_+__+__+_
//+_+_+_+_+_+_+__+__+__+__+__+_+_
//***********************************************************************************
// Programa que gerá o total de vezes em que ocorreu cada uma das faces de um dado,**
//atirado o dado 100 vezes ao acaso.*********... |
baa5a94e2ea6bc38720af4d28cde8d43a42c488c | 1e100c4dd246193b5aa08d1eebc9ad98732ca70d | meniossin/src | /third_party/perfetto/src/traced/probes/probes_producer.cc | C++ | cc | 13,706 | permissive | /*
* Copyright (C) 2018 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by app... |
5a3ae126bc0bc3a9748b78f39c3f0ba64974ef67 | 1741a45a969230423f1778869d749918616fb12a | hoangtuanhedspi/hermes | /unittests/API/SynthTraceTest.cpp | C++ | cpp | 30,302 | permissive | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the LICENSE
* file in the root directory of this source tree.
*/
// This test only makes sense if the tracing mode is turned on.
#ifdef HERMESVM_API_TRACE
#include <hermes/SynthTrace.h>
#include <... |
264ca056705c85299549fbd54a5d183e5c737a3d | ac5b53d753b99347ee859444298c996ac61a4dd6 | ay2306/Competitive-Programming | /codeforces/edRound58/b.cpp | C++ | cpp | 2,376 | no_license | /*
____________________________________________________________
| |
| Author: ay2306 |
|____________________________________________________________|
*/
#include <bits/stdc++.h>
#define MOD 1000000007
#define test i... |
d71d6b668a21fd56f551989d947e0756e745ab28 | 0da0d3a692775406004d16806d8992d5ff94c53f | kobortor/Competitive-Programming | /cf/1358/B.cpp | C++ | cpp | 623 | no_license | #include<bits/stdc++.h>
// Created by kobortor On 15:28:14 on 27-05-2020
using namespace std;
#define allof(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
... |
5f387fadb7e44b23bcf2d73db4edfb3d67878051 | 7503f9ec49a9e4478482e283b036548f447d8ea1 | barsnadcat/steelandconcrete | /src/MaterialEditor/src/CallTipManager.cpp | C++ | cpp | 3,710 | no_license | /*
-------------------------------------------------------------------------
This source file is a part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2006 Torus Knot Software Ltd
Also see acknowledgements in Readme.html
This library is free sof... |
eb9b4d5b11616663f39eea7db646e89a8d442e53 | 2d0516e06de08b0bb3199ab43105d75299118fd8 | dkutre/MoonGlobe | /libs/corrade/src/Corrade/TestSuite/Compare/Test/StringToFileTest.cpp | C++ | cpp | 4,408 | permissive | /*
This file is part of Corrade.
Copyright © 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016,
2017 Vladimír Vondruš <mosra@centrum.cz>
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Softw... |
11796742853307aa641ca1c8f39a086f7e116442 | 3f6d08645ba7b06ea60fd1cf54ce7aaec64afd3e | jjzhang166/WinNT5_src_20201004 | /NT/com/netfx/src/clr/utilcode/sxshelpers.cpp | C++ | cpp | 39,210 | no_license | // ==++==
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// ==--==
//*****************************************************************************
//
// sxshelpers.cpp
//
// Some helping classes and methods for SxS in mscoree and mscorwks/mscorsvr
//**********************************... |
502b7b5fa12e004f1ac0ea1a73403f035eeb5e1b | a49d9090665c4bf7144ca361fcefa416355f3941 | imulan/procon | /aoj/vol16/1611.cpp | C++ | cpp | 1,265 | no_license | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... |
de36a6875efe492b44f892f3819091d4bddb7b2f | 876bb2c1feb407e48a731ef6e090b29fb11117df | lucifer1004/codeforces | /1278/b/b.cc | C++ | cc | 523 | permissive | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
class Solution {
public:
void solve() {
int a, b;
cin >> a >> b;
int sum = a + b;
int target = max(a, b);
while (true) {
int rest = target * 2 - sum;
int n = sqrt(rest * 2);
if (n * (n + 1) / 2 ==... |
fbeea83e9bb11ba97a67acbfacd7bc328c78f2c9 | 06606b552a66119b65c0d7d30db5c15a9ad02929 | dimon-280894/simple-coin-test | /src/primitives/block.cpp | C++ | cpp | 1,028 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "primitives/block.h"
#include "hash.h"
#include "tinyformat.h"
#include... |
bb3f3f9be36a0f6f917d37c8981c1bf218530fd6 | 6546906717590d90a03c506c14f40f437133e736 | mtdedmon/RiftSkeleton | /src/Scene/Scene.cpp | C++ | cpp | 7,543 | permissive | // Scene.cpp
#include "Scene.h"
#ifdef __APPLE__
#include "opengl/gl.h"
#endif
#ifdef _WIN32
# define WINDOWS_LEAN_AND_MEAN
# define NOMINMAX
# include <windows.h>
#endif
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <glm/glm.hpp>
#include <glm/gtc/type_ptr.hpp>
#... |
b5e48f2725904ebfab66b363dce1e80e8ce1696b | 0d69f3874f6c1e4941ae37d6f63cf5b7009b702e | lucasxia01/Competitive-Programming-Problems | /ICPC/CodeSprint LA 2019/HumanPyramid1/HumanPyramid1/HumanPyramid1.cpp | C++ | cpp | 636 | no_license | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long T, n, ans = 0;
cin >> T;
for (int i = 0; i < T; i++) {
cin >> n;
long long a[510000];
ans = 0;
for (int j = 0; j < n * (n + 1)/2; j++) {
cin >> a[j];
}
sort(a, a ... |
97dc58d0ec4479d9aa094f5a034fa266b3c7400c | 1d20c59d5abfe8e7bcb6bee254bf12605e17a978 | salvAuri/optimisationRefactoring | /refactoringOptimisation/differentiatedCAD/occt-min-topo-src/src/IntPatch/IntPatch_ALineToWLine.cxx | C++ | cxx | 34,213 | no_license | // Created on: 1993-11-26
// Created by: Modelistation
// Copyright (c) 1993-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU ... |
7983938d7cd9251e8dd14b598a775c4654cd9572 | d4e087856b736990e20dded4a0d82ba0b0adc0fa | yuri410/rpg | /external/DirectXShaderCompiler/tools/clang/lib/CodeGen/CGExprScalar.cpp | C++ | cpp | 158,776 | permissive | //===--- CGExprScalar.cpp - Emit LLVM Code for Scalar Exprs ---------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===------------------------------------------------... |
35efaab22f041bad28b51ba0f5448965c7189f3b | 91c7f36e8cd2a714477116b735a9c4f1718ebf7d | fargol/CodeRevolution | /Nearestmultipleof10.cpp | C++ | cpp | 688 | no_license | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define M 1000000007
#define ll long long
int main(){
ios::sync_with_stdio(true);
int T;
string N;
cin>>T;
while(T--){
cin>>N;
if(N[N.length()-1]-'0'<=5){
N=N.substr(0,N.length()-1);
N+='0';
}
else{
stack<char> st;
st.push('0');
... |
f3b64bb028aa320ac07384688872b63a4b64cce5 | 15334aa76c36b643b30f921ee898128a757b5696 | 15831944/JCDT | /CodeAssist/CodeAssistLib/complete/Proposal/BreakCompletionProposal.cpp | C++ | cpp | 988 | permissive | #include "BreakCompletionProposal.h"
namespace Jikes { // Open namespace Jikes block
namespace CodeAssist {
BreakCompletionProposal::BreakCompletionProposal(int access, double _relevance, JavaModel::ISourceRange* completion_rang): JavaCompletionProposal(KeywordProposal, access, _relevance, completion_rang)
{
... |
0f87e32839b667258600df64d98ee41624658978 | 97de69ea8cdbbbac73f8721c6630ab5db388b7c9 | conradhappeliv/joysynth | /main.cpp | C++ | cpp | 6,886 | no_license | #define TIMEPLOT 0
#define FREQPLOT 0
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <functional>
#include <boost/filesystem.hpp>
#include "RTArray.h"
#include "Controller.h"
#include "Audio.h"
#include "Plotter.h"
#include "Sine.h"
#include "Square.h"
#include "Sawtooth.h"
#includ... |
08fb7fbbbb42712594f949640fbbc6446888cbb6 | cfb3ba96def97518cc1aba4f8da8cb5080420eb2 | aiyi/kaa | /client/client-multi/client-cpp/kaa/configuration/delta/DefaultDeltaType.hpp | C++ | hpp | 1,351 | permissive | /*
* Copyright 2014 CyberVision, 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 agr... |
e5492a6774d1ad8587c76df2e28c154a1ed63e55 | c580a63a8a38501238551e22c6754154e73df3f9 | serge-sans-paille/pythran | /pythran/pythonic/builtins/str/strip.hpp | C++ | hpp | 700 | permissive | #ifndef PYTHONIC_BUILTIN_STR_STRIP_HPP
#define PYTHONIC_BUILTIN_STR_STRIP_HPP
#include "pythonic/include/builtins/str/strip.hpp"
#include "pythonic/types/str.hpp"
#include "pythonic/utils/functor.hpp"
PYTHONIC_NS_BEGIN
namespace builtins
{
namespace str
{
types::str strip(types::str const &self, types::str... |
c3a56ab047bbe6ae86d4ae4bd06db631ec29ab9c | 90faa0d3126508f77dd0ccaa26b9a6b286d2d02e | RyuuYou0529/DrawLanguage | /parser/parser.hpp | C++ | hpp | 1,161 | no_license | //
// Created by RyuuYou on 2020/12/3.
//
#ifndef GRAPH_PARSER_HPP
#define GRAPH_PARSER_HPP
#include "../lexer/scanner.hpp"
#include "../tree/TreeNode.hpp"
#include "../error/exception.hpp"
typedef double (*FuncPtr)(double);
class Parser {
public:
Lexer *theLexer{};
ProgramNode *Root{};
double Origin_X ... |
7f177e69ba01e41453a1b14aa0a4eb29210813b3 | f0d9f7638423f760ceeacb143a3db29769eaf2f1 | silva95gustavo/CAL-Planeamento-de-itinerarios-multimodais | /Planeamento de itinerarios multimodais/source/transport/MetroRoute.cpp | C++ | cpp | 371 | no_license | /*
* MetroRoute.cpp
*
* Created on: 05/04/2015
* Author: Gustavo
*/
#include "MetroRoute.h"
#include "TransportSpeeds.h"
MetroRoute::MetroRoute(const std::string code, bool direction):
TransportRoute(code, direction)
{
}
double MetroRoute::getSpeed() const
{
return TransportSpeeds::getM... |
7a6a71345eef9bc0153b153a7404b473a65d9a4d | ae71d416aec0a03b4fcbdab07ded4cbf8653fbad | niuxu18/logTracker-old | /second/download/squid/gumtree/squid_old_hunk_707.cpp | C++ | cpp | 616 | no_license | HttpRequest *r = virgin.cause ?
virgin.cause : dynamic_cast<HttpRequest*>(virgin.header);
Must(r);
HttpReply *reply = dynamic_cast<HttpReply*>(virgin.header);
if (const char *value = (*i)->match(r, reply)) {
buf.Printf("%s: %s\r\n", (*i)->key.termed... |
0f383ca42a331939716b862dfc87321c4db74747 | 24d66c901abcd7745a62ae71a471761abba7df9e | jojolee123/screen-crack-detection | /Morphology.cpp | C++ | cpp | 2,989 | no_license | #include "canny.h"
/*
* Comments : 腐蚀
* Param Src : 原图像
* Param Tam : 结构元素
* Param Dst : 结果图
*/
void Erode(Mat& Src, Mat& Dst, Mat& Tem)
{
int m = (Tem.rows - 1) / 2;
int n = (Tem.cols - 1) / 2;
for (int i = m; i < Src.rows - m; i++)//i、j的范围保证结构元始终在扩展后的图像内部
{
for (int j = n; j < Src.cols - n; j++)
... |
0316c7f91018fbc6740957e3b10cbb5c57a32b55 | 45980c68a8142d575d7f71b3f287c1206be1d4fb | ldfaiztt/algorithm-3 | /ural/1586.cpp | C++ | cpp | 1,980 | no_license | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <string.h>
using namespace std;
#define DEBUG
#define REP(i,a) for(i=0;i<a;i++)
#define FOR(i,a,b) for(i=a;i<b;i++)
#define VE vector<int>
#define SZ si... |
2706de6f38f067c41ddd1211d998ad6c1b307382 | 8b23acda8683331d96074c63f53189f54a87f028 | Darkwizxboy/DnDD | /DnD/src/classMob.cpp | C++ | cpp | 1,405 | no_license | #include <string>
#include "classMob.h"
classMob::classMob(std::string name,int lvl,std::string area,int difficulty)
{
setName(name);
setLevel(lvl);
setArea(area);
setDifficulty(difficulty);
setDamage();
setMaxHealth();
setHealth(mobMaxHealth);
setEXP();
}
void classMob::s... |
5af564f8f70da42ef336df12104b296e490ad772 | c1654adde09169685c07d2c70e47afbc0581d0b0 | CU-Production/VulkanRenderer | /source/graphics/spirv_parser.cpp | C++ | cpp | 23,025 | permissive | #include "graphics/spirv_parser.hpp"
#include "foundation/numerics.hpp"
#include "foundation/string.hpp"
#include <cstdlib>
#include <string.h>
#include <vulkan/vulkan.h>
namespace raptor {
namespace spirv {
static const u32 k_bindless_set_index = 0;
static const u32 k_bindless_texture_binding ... |
3472e0ba70e67f85479fca37897066d3b884dacd | 331ea07f816c202baa9d35735b84bff53e2b91db | yonngwoo/hhvm | /hphp/runtime/vm/jit/cg-meta.cpp | C++ | cpp | 3,115 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2016 Facebook, Inc. (http://www.facebook.com) |
+---------... |
98aa7a633f30737821b004b689f5885245ae7e30 | f20e043d2bd48dc4a6309eab004ac01fa0ff42ed | mrg123/hhvm | /hphp/hhbbc/dce.cpp | C++ | cpp | 111,010 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-present Facebook, Inc. (http://www.facebook.com) |
+---------... |
9bdbfd661ed34db423dbd23ce0d6769a2415df14 | fcf98f97bc01b1d73c4e53ce6bbb7f206e501e67 | rdorst/FCCSW | /Sim/SimG4Components/src/GeantFastSimAlg.cpp | C++ | cpp | 3,044 | no_license | #include "GeantFastSimAlg.h"
// FCCSW
#include "SimG4Common/ParticleInformation.h"
#include "SimG4Common/Units.h"
#include "SimG4Interface/IGeantSvc.h"
// albers
#include "datamodel/MCParticleCollection.h"
#include "datamodel/ParticleCollection.h"
#include "datamodel/ParticleMCAssociationCollection.h"
// Geant
#incl... |
1ede7d1b04f0eb398b5a1e76c6b8eea0015517b7 | 9ae69a8e69ceb42f438883d3df67a5a17c04caed | david-wiles/FinMan | /src/db/AbstractQueryBuilder.cpp | C++ | cpp | 1,655 | no_license | #include "db/AbstractQueryBuilder.h" //{username, principal, interest, start_date, maturity_date, type, from_acct}
AbstractQueryBuilder* AbstractQueryBuilder::select(std::vector<std::string> cols)
{
_type = QueryType::SELECT;
_cols = std::move(cols);
return this;
}
AbstractQueryBuilder* AbstractQuery... |
8bceec4660e383b10b785dba35f6d1aef90f1647 | 11d0d92ddbabf614cfe81b0f812ad453bad6bc23 | iCodeIN/leetcode-4 | /Bipartite.cpp | C++ | cpp | 1,920 | no_license | class Solution {
public:
bool dfs(vector<vector<int>>& graph,unordered_map<int,int>& color,int ind,int col)
{
color[ind]=col;
int i,sz=graph[ind].size(),neigh;
for(i=0;i<sz;i++)
{
neigh = graph[ind][i];
if(color.find(neigh)!=color.end())
{
... |
9c26fd6ddfc56d68d49fbe077767a214ac431418 | 18164aed606e731e08540caf33654ca73761bbaa | 42somoim/42somoim1 | /ulee/04_2run_Zrun/19_접미사.cpp | C++ | cpp | 301 | no_license | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main()
{
string s;
vector<string> v;
cin >> s;
for (int i = 0; i < s.length(); ++i) v.push_back(s.substr(i));
sort(v.begin(), v.end());
for (auto j : v) cout << j << "\n";
} |
323ee194fbc24281dbf95ddd3c275d0b42ef2922 | 4d104256cbdfd995223b96a69873f74e9f0a834a | socratesone/vespa | /searchcore/src/vespa/searchcore/proton/server/tlssyncer.cpp | C++ | cpp | 969 | permissive | // Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "tlssyncer.h"
#include "igetserialnum.h"
#include <vespa/vespalib/util/threadexecutor.h>
#include <vespa/vespalib/util/lambdatask.h>
#include <vespa/searchlib/transactionlog/syncproxy.h>
#inc... |
9ec7157523f0730f984c98e5b9d508b61101976d | 1ca25616b17945e9a9398be8097ecd128726e3ab | poiuytr92/uiframework | /dependency/third_party/skia/src/core/SkBBoxRecord.cpp | C++ | cpp | 10,421 | permissive |
/*
* Copyright 2012 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkBBoxRecord.h"
void SkBBoxRecord::drawOval(const SkRect& rect, const SkPaint& paint) {
if (this->transformBounds(rect, &paint)) {
INHERITED::drawOval(... |
116c6902cc1f6c2d151ffff10e41acf1cefa29e4 | cd6f319871bc3515be0ed69f5e0b06d08d3f09a5 | mikhail-vl-ryazanov/BattleCity | /src/main.cpp | C++ | cpp | 3,603 | no_license | #include <glad/glad.h>
#include <GLFW/glfw3.h>
#include <iostream>
#include "Renderer/ShaderProgram.h"
#include "Resources/ResourceManager.h"
GLfloat point[] = {
0.0f, 0.5f, 0.0f,
0.5f, -0.5f, 0.0f,
-0.5f, -0.5f, 0.0f
};
GLfloat colors[] = {
1.0f, 0.0f, 0.0f,
0.0f, 1.0f, 0.0f,
0.0f, 0.0... |
99bce640b44217a5e9ea156bfa0f050ddac93bb6 | 9713cfd4bdf9d161412f32e554c4394b68e33c4e | webbjiang/skia | /bench/subset/SubsetSingleBench.cpp | C++ | cpp | 3,530 | permissive | /*
* Copyright 2015 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SubsetSingleBench.h"
#include "SubsetBenchPriv.h"
#include "SkData.h"
#include "SkCodec.h"
#include "SkImageDecoder.h"
#include "SkOSFile.h"
#include "SkScanlineDeco... |
f85a244eddedb9cc530c9281c757d3b0bcea29ba | ac5938e4b271890efd6c13b0611e53e79adefa53 | wthnonck/tdtw | /src/game/client/components/menus.cpp | C++ | cpp | 33,700 | permissive | // copyright (c) 2007 magnus auvinen, see licence.txt for more info
#include <math.h>
#include <base/system.h>
#include <base/math.h>
#include <base/vmath.h>
#include "menus.h"
#include "skins.h"
#include <engine/graphics.h>
#include <engine/textrender.h>
#include <engine/serverbrowser.h>
#include <engine/keys.h>
#i... |
9c7cc383c4bff207862db07c84af319339cb6580 | 319b4185c3240f9b72c7773f1845cdd024457f64 | TencentCloud/tencentcloud-sdk-cpp | /tsf/src/v20180326/model/DescribeTaskRecordsResponse.cpp | C++ | cpp | 4,106 | permissive | /*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
... |
7d38886bc7f743b9ffd162967acca6e43109f683 | 1f35c6332799314a89a9d9da4f22971c206693b6 | dzenanz/ITKMontage | /test/itkMontagePCMTestFiles.cxx | C++ | cxx | 7,080 | permissive | /*=========================================================================
*
* Copyright NumFOCUS
*
* 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
*
* https://www.apache.o... |
59bfded97a351e9d1d0894fbbec56cbd00f7f13c | 598cc1cb3a8fae6f61f694513c7deac44b1c95f5 | dkuspawono/sdk | /runtime/vm/compiler/backend/flow_graph_compiler_arm.cc | C++ | cc | 64,231 | permissive | // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
#include "vm/globals.h" // Needed here to get TARGET_ARCH_ARM.
#if defined(TARGET_ARCH_ARM) && !define... |
0e54cc716c904aebd38703d05f01b0e9dde2ba12 | 72c9cda27ce79e661e2cccdac527369d0e0c413b | keryell/llvm-project | /clang/lib/StaticAnalyzer/Checkers/IteratorChecker.cpp | C++ | cpp | 91,891 | permissive | //===-- IteratorChecker.cpp ---------------------------------------*- C++ -*--//
//
// Part of the LLVM Project, 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
//
//===---------------------------... |
1001eba47b36a631a20eccdcc4d38bc7bd1831c4 | 05030daa437bf6649afaab9453acb8c03e9cb9f0 | Ketan-Suthar/DAIICT_LAB | /SEM-I/CPP/Assignment_4/A4_5.cpp | C++ | cpp | 747 | no_license | // Example program
#include <iostream>
#include <string>
#define MAX 100 //maximam size of array
using namespace std;
int main()
{
int arr[MAX],n,*p,*q;//declare variables
cout<<"enter size of array: "; //take size of array from user
cin>>n;
cout<<"\nenter "<<n<<" values separated by space or newline: ";
... |
f09b37b7371dacb27c47c0c7b79698cb70d13528 | e299941f5e33b6eebbf827b97c6882ed66e96f1f | animesh-garg/raven_2 | /raven_2_control/src/raven/overdrive_detect.cpp | C++ | cpp | 2,096 | no_license | /*
* overdrive_detect.c - Functions related to checking for motor over heating
*
* Kenneth Fodero
* Biorobotics Lab
* 2005
*
* 5/06 Modified by Hawkeye King
*/
#include "overdrive_detect.h"
#include "defines.h"
extern struct DOF_type DOF_types[];
extern int NUM_MECH;
extern int soft_estopped;
extern unsigned ... |
cedd81f21ab81b0999e56ec41692181e3a8478bf | eac7e55d46b2911f14b50cd1aaba3f90315ef973 | hliuliu/USACO | /beads/beads.cpp | C++ | cpp | 298 | no_license |
/*
ID: heng_li1
TASK: beads
LANG: C++11
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main() {
ofstream fout ("beads.out");
ifstream fin ("beads.in");
return 0;
}
|
a7ed37242644cb6d55de83f43a75bfc3399b4df8 | 4262062678d31124367074ccff330a3fad5c6bb0 | javyxu/pytorch | /aten/src/ATen/native/vulkan/api/Pipeline.cpp | C++ | cpp | 8,415 | permissive | #include <ATen/native/vulkan/api/Pipeline.h>
namespace at {
namespace native {
namespace vulkan {
namespace api {
//
// Utility Functions
//
VkAccessFlags vk_access(
const PipelineStageFlags stage,
const MemoryAccessFlags access) {
VkAccessFlags vk_access = 0u;
if (access & MemoryAccessType::READ) {
... |
5d921feb9c843013ba0e947859425e021bde0e2d | 94f398ade7a3fcff78c5b4aa7449fd133189dc9a | pdhahn/occa | /src/lang/modes/cuda.cpp | C++ | cpp | 6,799 | permissive | /* The MIT License (MIT)
*
* Copyright (c) 2014-2018 David Medina and Tim Warburton
*
* 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 t... |
a358216b7c73b8a65322ff2b97d564f3856b4145 | c3e98121178464dc43c5631c4a37b02bafb4ead5 | bennyk/IsoTilemap | /Classes/HelloWorldScene.cpp | C++ | cpp | 8,046 | permissive | #include "HelloWorldScene.h"
USING_NS_CC;
Scene* HelloWorld::createScene()
{
// 'scene' is an autorelease object
auto scene = Scene::create();
// 'layer' is an autorelease object
auto layer = HelloWorld::create();
// add layer as a child to scene
scene->addChild(layer);
// return th... |
1f1cf95908daa92bc4101477964d13a61901cad8 | 18a1580453befc2e257532d1e8e963db94df2be0 | ZzzandyzzZ/Problemas-UVA | /11849 - CD.cpp | C++ | cpp | 538 | no_license | //11849 - CD
#include <iostream>
#include <map>
using namespace std;
int main(){
int N,M,aux,con=0;
map<long,long> m;
map<long,long> ::iterator it;
while(cin>>N>>M,M!=0,N!=0){
con=0;
for(int i=0;i<N+M;i++){
cin>>aux;
it=m.find(aux);
if(i... |
5ef8f838b02ad55486e808f8adeedd1a54a7d630 | 7caf6149d271d5172355257f9c5463c9b0d80be8 | WhiZTiM/coliru | /Archive2/4b/14bb80fa354194/main.cpp | C++ | cpp | 1,041 | no_license | #include <iostream>
#define CREATE_WITH_GETTER_AND_SETTER(memberType, memberName) \
memberType _##memberName; \
CREATE_SETTER(_##memberName) \
CREATE_GETTER(_##memberName)
#define CREATE_SETTER(memberName) \
template<typename T> \
... |
47b52e2a9099f842f31666aba1fc88e2d2517f8e | 346aa5ebd1e2a5fbf5307759041700c9ea4a97fe | jianxingdong/libpointmatcher | /pointmatcher/ErrorMinimizersImpl.cpp | C++ | cpp | 28,993 | permissive | // kate: replace-tabs off; indent-width 4; indent-mode normal
// vim: ts=4:sw=4:noexpandtab
/*
Copyright (c) 2010--2012,
François Pomerleau and Stephane Magnenat, ASL, ETHZ, Switzerland
You can contact the authors at <f dot pomerleau at gmail dot com> and
<stephane at magnenat dot net>
All rights reserved.
Redistrib... |
94ffd3dfe4ae1fed1d648cdc1ce21e9348c4c4f8 | fc10191e722fc266f75f16c08dcceffc54975612 | lele121314/my_purplebook | /上机练习/清华机试/thupub2017-master-cdaa6f3786b2d5da2c4e3e1b6680ec9a0ff1ddaf/day1/interview/data/interview.cpp | C++ | cpp | 986 | no_license | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,k;
int x[100000+5]={0};
bool C(int d){
if(d<m)return false;
int xx[100000+5]={0};
int mx=x[1],mi=x[1];
for(int i=1;i<=d;i++){
xx[x[i]]++;
mx=max(mx,x[i]);
mi=min(mi,x[i]);
}
for(int i=mi;i... |
0b4c0c1764b6f43cd2e6b1ceb540361d06058134 | 2f784e625be0886bfca92d865bddc820931423fd | socratesone/vespa | /fnet/src/tests/locking/castspeed.cpp | C++ | cpp | 5,538 | permissive | // Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include <chrono>
class B;
static int taken = 0;
extern void takeB(B* foo) __attribute__((noinline));
class A
{
public:
virtual B* asB() { return 0; ... |
eab5621dcdfe64ee8d43a74efb4d85dbcdc71a47 | 660f3675ffdc929a96e2e2984ab92ca308a883c1 | cms-lpc-llp/llp_analyzer | /src/MergeNtuples.cc | C++ | cc | 11,762 | no_license | #include <fstream>
#include <sstream>
#include <iterator>
#include "TFile.h"
#include "TTree.h"
#include "TH1F.h"
#include "TKey.h"
#include <assert.h>
#include <TRandom3.h>
#include "TTreeFormula.h"
#include <iostream>
using namespace std;
std::string ParseCommandLine( int argc, char* argv[], std::string opt )
{
f... |
2ac0e6d6095eb1fb36ef6cb3e612d14373541e9d | 574d4ff839bd9409ee259147cba2b9cb39b949a4 | jiawangyu/Elastos5 | /Sources/Elastos/Frameworks/Droid/Base/Core/src/elastos/droid/utility/NtpTrustedTime.cpp | C++ | cpp | 5,865 | permissive |
#include "Elastos.Droid.Accounts.h"
#include "Elastos.Droid.App.h"
#include "Elastos.Droid.Content.h"
#include "Elastos.Droid.Provider.h"
#include "Elastos.Droid.Location.h"
#include "Elastos.Droid.Os.h"
#include "Elastos.Droid.View.h"
#include "Elastos.Droid.Widget.h"
#include "elastos/droid/text/TextUtils.h"
#includ... |
6ea9cb514e84ea39a6d9de4251a3624910d43e0a | ab7933a4040811a8e685883ed28b3e311c3eaa01 | stefanroata/problems-and-algorithms-cpp | /25.04.2016/speciale.cpp | C++ | cpp | 3,017 | no_license | #include <fstream>
#include <algorithm>
using namespace std;
ifstream f("speciale.in");
ofstream g("speciale.out");
long long v1[]={0,1,12,123,1234,12345,123456,1234567,12345678,123456789},v2[]={0,9,98,987,9876,98765,987654,9876543,98765432,987654321};
int v[20],w[20];
int main()
{
long long k,n,a,... |
ffe9677cba639bbe644446a9dfff57af6ee0c5a7 | b7cd7b7c994ed07cb73308c127d27b254225fa47 | donmccaughey/fiends_and_fortune | /src/fiends/treasure_types_table/treasure_types_table_window.hpp | C++ | hpp | 398 | permissive | #ifndef FIENDS_TREASURE_TYPES_TABLE_TREASURE_TYPES_TABLE_WINDOW_HPP_INCLUDED
#define FIENDS_TREASURE_TYPES_TABLE_TREASURE_TYPES_TABLE_WINDOW_HPP_INCLUDED
#include "fiends/fiends.hpp"
class TextRect;
class TreasureTypesTableWindow : public TWindow {
public:
explicit TreasureTypesTableWindow(TRect const &bounds... |
c3b00e593649378896603ce9665507ddee9e2421 | bc4ae292ba91724c0bb8a3e2d3cb2907a7225e91 | kidsnow/WaveSimulator | /src/Grid.cpp | C++ | cpp | 2,331 | no_license | #include "grid.h"
GridBuffer::GridBuffer(int gridSize, float gridLength)
{
/*
* gridSize * gridSize 크기로 보여지는 grid를 생성할텐데
* wave가 새어나가지 않게 하기 위해서 한쪽 끝은 고정해야 해서
* 양쪽 끝에 한 줄씩 grid를 추가로 생성해주어야 한다.
* 양쪽 끝의 grid는 계산에만 참여하고 rendering되지는 않는다.
*
* xy평면을 기준으로 z값만 시뮬레이션에 참여한다.
* 시뮬레이션 계산 시에는 y값만 유의미함.
* x, y값은... |
991f2631e8dc292be6a2dde42947fc336641b0ef | 6a5c41bb23a74a7cbacd5bacbc0321889ec3ab92 | npezolano/Elemental | /include/elemental/blas-like/level3/Hemm/LU.hpp | C++ | hpp | 12,530 | no_license | /*
Copyright (c) 2009-2013, Jack Poulson
All rights reserved.
This file is part of Elemental and is under the BSD 2-Clause License,
which can be found in the LICENSE file in the root directory, or at
http://opensource.org/licenses/BSD-2-Clause
*/
namespace elem {
namespace internal {
template<typena... |
3783d51b28142245bcb413c5b093dad856ca6112 | e9ffa8b4e9466927ddcb04f559d7540054b35c87 | chrispcx/es-hhvm | /hhvm/hhvm-3.17/hphp/hhbbc/main.cpp | C++ | cpp | 10,555 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2016 Facebook, Inc. (http://www.facebook.com) |
+---------... |
708cee100287d17ffdccdd760bdcd9fc5b8370a4 | 56ff1de4da951cd96e8b3308d9433ea0b5fb6465 | altsybee/MISE | /analysis/dihadron/AnalysisNuclStructureDataToDihadronCorrs.cxx | C++ | cxx | 7,046 | no_license | #include "/Users/macbook/alice/simpleAnalysis/simpleEventAnalyzer/AnalysisSelector.h"
#include "/Users/macbook/alice/simpleAnalysis/analysers/AnalyserBase.h"
#include "/Users/macbook/alice/simpleAnalysis/analysers/diHadronMethod/DiHadronAnalyser.cxx"
#include "/Users/macbook/alice/simpleAnalysis/commonTools/Tools.cxx"
... |
1e4979c78a785aa87604071bc6b3efa8e6229683 | 614a33d42d8e1c094ad54d220cdf58d9790239e4 | jstavr/Architecture-Relation-Evaluator | /Replication/DataFileSystem/PRODUCT_SOURCE_CODE/itk/Modules/Filtering/Convolution/test/itkFFTConvolutionImageFilterDeltaFunctionTest.cxx | C++ | cxx | 2,847 | no_license | /*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* ... |
3a4a51a34d73cd49153c79d14b67c6e91f3d1940 | 9bf7b2408c4b3da9f52ccb3c72a996a18c33d145 | HexColors60/shadow-of-the-wyrm | /engine/calculators/source/SpellbookCalculator.cpp | C++ | cpp | 4,783 | permissive | #include "RNG.hpp"
#include "SpellbookCalculator.hpp"
#include "SpellConstants.hpp"
using namespace std;
SpellbookCalculator::SpellbookCalculator()
{
initialize_status_failure_levels();
initialize_status_casting_multipliers();
}
void SpellbookCalculator::initialize_status_failure_levels()
{
status_failure_leve... |
b839e2de3940cf9056c6b61cf4d66d9d0bea6dbf | 89853d7b192dcb4a4df4a00c4bed515fb77096a5 | adityagupta1089/ComputeLibrary | /src/core/CL/kernels/CLDilateKernel.cpp | C++ | cpp | 2,763 | permissive | /*
* Copyright (c) 2016-2018 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
* ri... |
af4e686f1dfbf5a352809ac775cf90a66b577792 | 5d5baddd3a9f0b2ea39f6c74a6fb80b5bdf79e94 | VictorShakhov/Yellow | /final_project/database.cpp | C++ | cpp | 2,108 | no_license | #include <sstream>
#include <iostream>
#include <string>
#include <iterator>
#include <exception>
#include <algorithm>
#include "date.h"
#include "database.h"
using namespace std;
ostream& operator<<(ostream& os, const pair<Date, string>& p) {
os << p.first << " " << p.second;
return os;
}
void Database::Ad... |
3c03ab131e1579ab1ff6029d5f952d9d620a2d77 | b910d6b5cc1aff55e3551b8524fcfc22cba1202e | Zerixx/Ronin | /src/ronin-world/Chat/Commands/GMTicketCommands.cpp | C++ | cpp | 16,498 | no_license | /*
* Sandshroud Project Ronin
* Copyright (C) 2005-2008 Ascent Team <http://www.ascentemu.com/>
* Copyright (C) 2008-2009 AspireDev <http://www.aspiredev.org/>
* Copyright (C) 2009-2017 Sandshroud <https://github.com/Sandshroud>
*
* This program is free software: you can redistribute it and/or modify
* it under ... |
f051fe0c847c34b8b8b1107862e12f65633d55e7 | fe203b2ec57a7677b765af1d46706d322e8609b5 | lavandalia/work | /Fii Competition/2013/Round 1/2 - templu/brut.cpp | C++ | cpp | 531 | no_license | #include <iostream>
#include <vector>
#include <fstream>
using namespace std;
const int kModulo = 666013;
int main() {
ifstream cin("templu.in");
ofstream cout("templu.out");
int N, M; cin >> N >> M;
vector< vector<int> > V(N + 1, vector<int>(N + 1));
V[1][1] = 1;
for (int i = 2; i <= N; ++... |
feead0b1832cd5d2b50ba7c9cae31420f2521274 | 289095707aa55885a18ef72f81e6b0a9e947162b | az86/test | /LibDevelop/FileSaver/FileSaver/IOCPFileSaver.cpp | C++ | cpp | 2,408 | no_license | #include "IOCPFileSaver.h"
#include <process.h>
#include <algorithm>
#include <iostream>
CIOCPFileSaver::CIOCPFileSaver()
{
m_hIocp = CreateIoCompletionPort(INVALID_HANDLE_VALUE, NULL, 0, 0);
_beginthread(SaveWork, 0, this);
hEvent = CreateEvent(NULL, FALSE, FALSE, L"");
}
CIOCPFileSaver::~CIOCPFileSaver()
{
Pos... |
bca262cf1842457938876a64abfee2fea3212651 | 440f652a259c20d0f7200b68f58d2dd081fdc082 | massnetwork/mass-browser | /chrome/browser/ui/ash/chrome_launcher_prefs.cc | C++ | cc | 28,462 | permissive | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/ash/chrome_launcher_prefs.h"
#include <stddef.h>
#include <set>
#include "base/macros.h"
#include "base/memory/ptr_util... |
5e7cca91a6d5bf61c72e1784410d0a5b07fd50f1 | a4beb5139f85e45341ade5717ad906064115be49 | KqSMea8/sstd_library | /sstd_boost/sstd/libs/serialization/test/test_z.cpp | C++ | cpp | 44,908 | permissive | #if 0
#include <stdexcept>
#include <iostream>
#include <sstream>
#include <sstd/boost/optional.hpp>
#include <sstd/boost/archive/text_oarchive.hpp>
#include <sstd/boost/archive/text_iarchive.hpp>
#include <sstd/boost/serialization/optional.hpp>
struct Foo
{
Foo(int aBar) :
mBar(aBar)
{
if (m... |
da7b4314566c98f617dba274b30a5dd8a7aadc09 | 950c3a20d8477f13cfd167954d8a6d0d7f3b4796 | Ershov-Artem/Homework | /Homework_greedy_algorithm_2/main.cpp | C++ | cpp | 1,009 | no_license | #include <iostream>
#include <vector>
using namespace std;
int main()
{
long long n;
cin >> n;
vector<vector<long long>> timeTable(n, vector<long long>(2));
long long max = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 2; j++)
{
cin >> timeTable[i][j];
... |
b8f856ef31c3a61932924ead0b823ef5cdc3e480 | 14e5f2147db4d305fff00fe5484000a1668d03d4 | surajpatel11/arangodb | /3rdParty/rocksdb/v5.16.X/utilities/write_batch_with_index/write_batch_with_index_internal.cc | C++ | cc | 8,806 | permissive | // Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
// This source code is licensed under both the GPLv2 (found in the
// COPYING file in the root directory) and Apache 2.0 License
// (found in the LICENSE.Apache file in the root directory).
#ifndef ROCKSDB_LITE
#include "utilities/write_batch_wit... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.