blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fcb6b061a05cd53f464d35983aaf6855ec44881f | b7d4fc29e02e1379b0d44a756b4697dc19f8a792 | /deps/boost/libs/algorithm/test/ordered_test.cpp | f2cbdd785920c918e8d5210bb2333ee1c4713f20 | [
"GPL-1.0-or-later",
"MIT",
"BSL-1.0"
] | permissive | vslavik/poedit | 45140ca86a853db58ddcbe65ab588da3873c4431 | 1b0940b026b429a10f310d98eeeaadfab271d556 | refs/heads/master | 2023-08-29T06:24:16.088676 | 2023-08-14T15:48:18 | 2023-08-14T15:48:18 | 477,156 | 1,424 | 275 | MIT | 2023-09-01T16:57:47 | 2010-01-18T08:23:13 | C++ | UTF-8 | C++ | false | false | 9,835 | cpp | ordered_test.cpp | // Copyright (c) 2010 Nuovation System Designs, LLC
// Grant Erickson <gerickson@nuovations.com>
//
// Reworked by Marshall Clow; August 2010
//
// 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 ... |
212fbc3738a1b467c7fa41cee6bd63a137d57889 | d747f1a0577da9c17512a3ac331c4896e48b4f65 | /h/import/wxf/wxfhelper.h | 802a75bac9b162df8dd152f7466351fb12714990 | [] | no_license | LenyKholodov/wood | 4cc470bdfe0c0fbc1c6383f91011461ae09d5497 | 3dbb8421acb24546859bbb63884e11173becd1af | refs/heads/master | 2020-04-14T02:13:03.280422 | 2018-12-30T10:20:30 | 2018-12-30T10:20:30 | 163,578,511 | 0 | 0 | null | null | null | null | IBM866 | C++ | false | false | 3,053 | h | wxfhelper.h | #ifndef __WXF_IMPORT_HELPERS__
#define __WXF_IMPORT_HELPERS__
#include <import\wxf\wxfbase.h>
class FrameReader;
class WXFNode;
/////////////////////////////////////////////////////////////////////////////////////////////
///Хелпер
///////////////////////////////////////////////////////////////////////////////... |
6f21fc9b2f6fa28684d9ecb7328d0da14ce4fa91 | bcaf817dbcf3510252b634b8c90f123e6b056121 | /renumerar.cpp | 431b55cc5bcbe4b29e92687ca2947e8b168bb34f | [] | no_license | tianyayouge/keme5 | 16ba5dbc8b33f2f8af3002f4760a329954b11fc0 | b0e4d39c359a925328d6da0df1b69fd889ed7d3d | refs/heads/master | 2023-05-07T13:02:59.544384 | 2018-09-16T16:53:11 | 2018-09-16T16:55:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,347 | cpp | renumerar.cpp | /* ----------------------------------------------------------------------------------
KEME-Contabilidad; aplicación para llevar contabilidades
Copyright (C) José Manuel Díez Botella
Este programa es software libre: usted puede redistribuirlo y/o modificarlo
bajo los términos de la Licencia Pública ... |
d3a25fd483ec59fdb73c702b1544ef42d8e603cc | 18af6a7d6561fa226a157078188283c9c65d5a97 | /56.Merge_Intervals.cpp | fdbe8f4e8ed9c139b83bc3b0e99a8a8dda7689c6 | [] | no_license | shobhit-saini/Leet_Code | cc8980c7b1b57087ad6568a1e81bbf291e00afad | 204d48f31aa2a4bd459f97c896c9fe594eb6ca07 | refs/heads/master | 2021-02-05T17:27:09.452448 | 2020-09-22T10:36:29 | 2020-09-22T10:36:29 | 243,809,137 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,176 | cpp | 56.Merge_Intervals.cpp | /*
Given a collection of intervals, merge all overlapping intervals.
Example 1:
Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:
Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are c... |
04d9a06585ed1d04c00966fcabf58446b2c9aef7 | e091e411012a603f14b58c3d05117b50312986c4 | /Ninja Gaiden/Ninja Gaiden/Ryu.h | 56c0fa83c55cd8387ced9b4a2875b9398ea324b2 | [] | no_license | phamphuckhai/GameDirectX | 071e477d4cae8ab60303ec989f7bfa1f20ad6a4b | f34a72b0bee71112f52a1b0aa22a3e8a025a3a9b | refs/heads/master | 2020-06-24T03:56:28.697876 | 2019-07-25T14:01:36 | 2019-07-25T14:01:36 | 198,841,279 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,040 | h | Ryu.h | #pragma once
#include "GameObject.h"
#include "Global.h"
#include"Grid.h"
#include"Brick.h"
#include"SwordMan.h"
#include"Katana.h"
#include"Wall.h"
#include"Bird.h"
#include"Runner.h"
#include"Boss.h"
#include"Banshee.h"
#include"MachineGunGuy.h"
#include"Artillery.h"
class Ryu : public CGameObject
{
private:
int sco... |
b115e1011f7c4235770a81eb66cafb5cec4230ad | 6e9cfe7346b6a459f020675f5c9d998cac91a023 | /Engine/Engine/Defines.hpp | fea7a04d04601cf85d6f1ae6ae3c7af40b89eec5 | [
"MIT"
] | permissive | Zach-Kauffman/Engine | 388776dee6d072912a66c112cd4c1f4d17a8c5d7 | cde95d21f8c41170dae6985743cc9eacae9c33ad | refs/heads/master | 2021-01-21T08:06:05.677073 | 2016-04-21T05:46:43 | 2016-04-21T05:46:43 | 47,636,116 | 0 | 0 | null | 2015-12-08T16:56:52 | 2015-12-08T16:56:51 | null | UTF-8 | C++ | false | false | 196 | hpp | Defines.hpp | //#define RUN_TESTS
//#define TEST_ALL
//#define TEST_UTILITIES
//#define TEST_LOGGING
//#define TEST_RESOURCE_GROUP
//#define TEST_RESOURCE_MANAGER
//#define TEST_INI_PARSER
#define LOG_CONSOLE |
49e57932516eb945da2fdbab74583e9ba1241d9b | 73c8a3179b944b63b2a798542896e4cdf0937b6e | /SPOJ/OSalaoDoClube.cc | d60796ec68fdbe3cf4ae05a1fcf79be3336e8b88 | [
"Apache-2.0"
] | permissive | aajjbb/contest-files | c151f1ab9b562ca91d2f8f4070cb0aac126a188d | 71de602a798b598b0365c570dd5db539fecf5b8c | refs/heads/master | 2023-07-23T19:34:12.565296 | 2023-07-16T00:57:55 | 2023-07-16T00:57:59 | 52,963,297 | 2 | 4 | null | 2017-08-03T20:12:19 | 2016-03-02T13:05:25 | C++ | UTF-8 | C++ | false | false | 2,628 | cc | OSalaoDoClube.cc | #include <bits/stdc++.h>
template<typename T> T gcd(T a, T b) {
if(!b) return a;
return gcd(b, a % b);
}
template<typename T> T lcm(T a, T b) {
return a * b / gcd(a, b);
}
template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
template<typename T> void chmax(T& a, T b) { a = (a < b... |
cb02ade34869bc6db3a4ee32d58b7b75efa5731d | de75ba945d56338bcb13fb0019d34925ad75bb0c | /c++_implementation/server/frameprovider.cpp | a0a7e1c7c969ce58774f6fe9de01de92efeba0bc | [] | no_license | ianzur/mazuMedical | acb1d21c43927cad067364a247d958a597ba1124 | 5968c42eec71c413ce1751cab3b752de10caddcb | refs/heads/master | 2022-01-11T12:52:53.431986 | 2021-12-22T22:31:53 | 2021-12-22T22:31:53 | 131,194,367 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 899 | cpp | frameprovider.cpp | #include "frameprovider.h"
#include <vector>
#include "opencv2/imgcodecs.hpp"
FrameProvider::FrameProvider(QObject *parent)
: Provider(parent)
{
qDebug() << "frameProvider creation";
}
void FrameProvider::frameReady(cv::Mat &img)
{
// qDebug() << "frameReady slot filled";
// qDebug() << img.empty();
... |
e8b7cc4507d6a3913841ab180f9f77e1c6be8d21 | 785a191ab5345e322442a2bc91085dfd7dd02f84 | /src/game/ctt/resources/models/ModelLib.cpp | 793b3612c95c3702601a9ce6bf257d5ced12af18 | [] | no_license | EryksProjectsArchive/CTTGame | 5e37e47a9440d41da37c69cdc4aefc911608ae06 | 125830260de19e42d714810cac11d0681dd9c9af | refs/heads/master | 2021-01-01T20:48:08.945909 | 2015-06-23T20:21:19 | 2015-06-23T20:21:19 | 98,935,549 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,287 | cpp | ModelLib.cpp | //////////////////////////////////////////////
//
// City Transport Tycoon
// Copyright (C) Black Ice Mountains
// All rights reserved
//
// File : resources/models/ModelLib.cpp
// Author : Eryk Dwornicki
//
//////////////////////////////////////////////
#include "ModelLib.h"
#include <graphics/Model.h>
#i... |
426f8553c756b7a82d87f17fc63ff5b339ffd49d | dfee0e625d58428c5224696c961319a2468687a8 | /CSAcademy/Round54/pair-swap.cpp | a516d7721b3f8800afb2e5829c9cfeb1ac66d108 | [] | no_license | ia7ck/competitive-programming | 5f0853811d6892d9d98e9b03287d198d9f61aaa9 | 09be20068c3a6a39d16047c867d405b30514b0e2 | refs/heads/master | 2023-09-04T01:29:17.229669 | 2023-09-02T13:58:13 | 2023-09-02T13:58:13 | 150,092,904 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | cpp | pair-swap.cpp | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int n, k; cin>> n>> k;
vector<int> a(n);
rep(i, n) cin>> a[i];
rep(i, n) a.push_back(1e9);
set<pair<int, int>> s;
rep(i, n*2){
if(i<k){
s.inser... |
4b1954e2c73ea50299a31c63654bf60243aebffe | ae15ca61a82f6d7dc95b4a012400ff713aba003f | /src/immutable/pageId.hpp | 0a7c9494fafd43cce34a768edd2e47a5f1869c9f | [
"MIT"
] | permissive | smichniak/page_rank | 38082b838cd8ebb3bac34b08eb1c3af3745e56f8 | 2f29ee7a24ec85fc23f30d91a4283d8fb78a00ae | refs/heads/main | 2023-03-17T09:22:57.774899 | 2021-03-06T15:05:38 | 2021-03-06T15:05:38 | 339,130,906 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 722 | hpp | pageId.hpp | #ifndef PAGE_ID_HPP_
#define PAGE_ID_HPP_
#include <string>
class PageId {
public:
PageId(std::string const& idArg) : id(idArg) {
}
bool operator==(PageId const& other) const {
return this->id == other.id;
}
private:
std::string id;
friend std::ostream& operator<<(std::ostream& out,... |
860e94d84e297e8c2e3521e8af4667a5bd920688 | 84a4b043bb72cbf3cd5a1adcba922a5960a3d425 | /Src/multMEF.cpp | 87e2e20e606c879dde34be4813b1b676779c27bf | [
"LicenseRef-scancode-unknown-license-reference",
"BSD-2-Clause"
] | permissive | q86091483/PeleAnalysis | 2aef2959b08522738627eca7fbdc3a757e31c50a | 23a6af538122ea8e67c678d0892f54b819b5e035 | refs/heads/master | 2023-08-04T02:04:39.458158 | 2023-07-13T19:41:28 | 2023-07-13T19:41:28 | 156,210,178 | 0 | 0 | NOASSERTION | 2018-11-05T11:53:20 | 2018-11-05T11:53:20 | null | UTF-8 | C++ | false | false | 5,932 | cpp | multMEF.cpp | #include "winstd.H"
#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <map>
#include "ParmParse.H"
#include "MultiFab.H"
#include "VisMF.H"
#include "ParallelDescriptor.H"
#include "DataServices.H"
#include "Geometry.H"
#include "Utility.H"
using std::vector;
using std::map;
using std... |
30f87ba77f90f34fef75fef12def14f295c5ec03 | 4432adbed64c4fc00ffdf3ebd8d2b52842da33d9 | /Client/include/CreateAccountViewModel.h | affa7cdde524686f0fbc803194672f99bb091849 | [] | no_license | Raidero/TIN_project | 3bf639dabeedf66e8efb43b709c3dc8099a683b2 | abe3b62f7ef6e09ab91913de9ac5f2fe424ec256 | refs/heads/master | 2021-08-09T02:08:09.898883 | 2018-05-30T16:07:36 | 2018-05-30T16:07:36 | 126,076,430 | 1 | 1 | null | 2018-05-30T16:07:37 | 2018-03-20T20:12:28 | C++ | UTF-8 | C++ | false | false | 361 | h | CreateAccountViewModel.h | #ifndef CREATEACCOUNTVIEWMODEL_H
#define CREATEACCOUNTVIEWMODEL_H
#include "LoginViewModel.h"
class CreateAccountViewModel: public LoginViewModel
{
public:
CreateAccountViewModel(ViewModel* mvm);
virtual ~CreateAccountViewModel();
void buttonPressed(int i);
void refresh(int message)... |
9e066bf1845e9618fcd60a911ca2700abbb3fc29 | c89e122e553fd5f886febf9233ad920804304154 | /samplecode/var_initialization.cpp | fb8df13335ef955a47f2a482837e8536876277cc | [] | no_license | prabhash1785/Cpp | ef6eaf2b14cdc040940a665b598efba0e0a68310 | 9534df99a53710773a28f601b827734fd4978236 | refs/heads/master | 2021-04-19T00:58:55.876380 | 2021-04-04T00:00:38 | 2021-04-04T00:00:38 | 30,288,796 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 260 | cpp | var_initialization.cpp | #include <iostream>
using namespace std;
int main() {
int a = 3;
int b(5);
//int c{10}; //this type of uniform initialization is failing while compiling with g++
int c(10);
int result = a + b + c;
cout << "result: " << result << '\n';
return 0;
}
|
27f35fb236c674f2887b0555a5f557e6a612c8ba | 670cc962162aad7d92f6d9d0721dc41a65209de1 | /parciales/2017/Personalizable.h | f3080c928a31b41d09b410e98c316598c3c65e89 | [] | no_license | Zarakinoa/Design-Patterns | 1d133764ae9b16fb8fecb1c000be533741dccbac | e141146b15d22f09aa670815b9a2c16dbb0c8257 | refs/heads/master | 2022-02-19T04:02:13.075807 | 2019-09-25T03:42:33 | 2019-09-25T03:42:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 384 | h | Personalizable.h | #include "Producto.h"
#include "Componente.h"
#include <string>
using namespace std;
class Personalizable : public Producto{
private:
float precioItem;
map<string,Componente*> componentes;
public:
void setPrecioItem(float);
void nuevoComp(string);
void elimComp(string);
void nuevaOpComp(string , string ... |
d9d5b8ab339fed3bf7760eee23000ddc1dd7d4d1 | e985851ba6d4e9745fb02dfcc270169fc71c5c75 | /leviathan/src/renderer/context.cpp | ef6e552d50370afbfb11b99e8986a357dac3cbf9 | [
"MIT"
] | permissive | backwardspy/leviathan | 7140ce04ddad3ae901b143eeda5746f8ce1413ae | bfa26f7fabc181fcd945ed6711b596eeae493d3c | refs/heads/master | 2023-03-14T23:18:57.155398 | 2020-11-08T21:33:34 | 2020-11-08T21:33:34 | 307,211,467 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 206 | cpp | context.cpp | #include "leviathan/lvpch.h"
#include "leviathan/renderer/context.h"
namespace lv {
ref<lv::Material> Context::make_material(ref<Shader> shader) {
return make_ref<lv::Material>(shader);
}
} |
58b6787ddc08527979a6ec161aae147252b50889 | 8947812c9c0be1f0bb6c30d1bb225d4d6aafb488 | /02_Library/Include/XMCocos2D-v3/shaders/CCShaderCache.h | 1631df4a14512315e0c67bffd2b4e1a478e1e207 | [
"MIT"
] | permissive | alissastanderwick/OpenKODE-Framework | cbb298974e7464d736a21b760c22721281b9c7ec | d4382d781da7f488a0e7667362a89e8e389468dd | refs/heads/master | 2021-10-25T01:33:37.821493 | 2016-07-12T01:29:35 | 2016-07-12T01:29:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,175 | h | CCShaderCache.h | /* -----------------------------------------------------------------------------------
*
* File CCShaderCache.h
* Ported By Young-Hwan Mun
* Contact xmsoft77@gmail.com
*
* -----------------------------------------------------------------------------------
*
* Co... |
d0e4959d0a8a0772752a723336b179f028b97b14 | eacab7e9daab5f0229199d41530bd64140a49880 | /bcos-executor/src/executive/ExecutiveFactory.h | b49650df33ff6b940aca3228332177f98d4f2826 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | JimmyShi22/FISCO-BCOS | fce2d081cc3c676178a9cdaf9f4253d0b05b56ad | b8b628f36674ad1fdcbda429581b253af664cf75 | refs/heads/feature-3.1.0 | 2023-08-19T08:48:53.172782 | 2022-10-11T03:55:28 | 2022-10-11T03:56:13 | 133,357,877 | 3 | 2 | Apache-2.0 | 2022-10-11T16:58:29 | 2018-05-14T12:33:15 | C++ | UTF-8 | C++ | false | false | 2,568 | h | ExecutiveFactory.h | /*
* Copyright (C) 2022 FISCO BCOS.
* SPDX-License-Identifier: Apache-2.0
* 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
*
* Unl... |
b5a1ede1099aa8205d7f2ccc22c3c43fdde2b8d2 | 4fd1895f96c0051c74a8d729c784337ffb82bdca | /tutorial-fortran/00_hello_world/hello_world.cc | 33220675d06b04350d74b32ec4b875bd4573a6ff | [
"Apache-2.0"
] | permissive | eddy16112/legion | aa31263b5b0f5d6bd03a9e7736e43a11ee9782d9 | 585e16209c54392527069457a3cb50abbb413ba4 | refs/heads/stable | 2021-12-01T15:18:04.751952 | 2017-07-14T22:04:07 | 2017-07-14T22:04:07 | 96,564,980 | 0 | 0 | null | 2017-12-07T17:46:45 | 2017-07-07T18:22:56 | C++ | UTF-8 | C++ | false | false | 3,942 | cc | hello_world.cc | /* Copyright 2017 Stanford University
*
* 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 agree... |
98540cfae7acc0962221291b13b2b5b4344edbcd | a52de2cfe5074fede1a0e74f404629e426b1c7c5 | /Src/Control/request.h | 8a1af2f0eb5554661d0752d87da2882f87c05259 | [] | no_license | bhunt2/QC1.0 | cf953597bc0880914f64244169859c4529d8e328 | 26f7a5fce67cb2b54312f293ef1d2eb2921216a4 | refs/heads/master | 2021-03-19T11:45:14.022905 | 2016-06-08T22:23:11 | 2016-06-08T22:23:20 | 32,777,198 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 807 | h | request.h |
/****************************************************************
Drone Control and Automation Code
--------------------------------------------
Capstone Project: Object Following Drone
Sponsor: Benjamin Huntsman
Advisor: Dr. McNames, James
Written By: Sabin Maharjan
Date: May 2, 2016
Version: 1.0
Github: htt... |
10609447aa97130d7c1cc82d030cf845ede29d41 | 3ab8e0cd65557d274042758f1a3bfca29a1942e4 | /Chapter 1 - Great software begins here/05. Guitar Inventory - Adding number of strings and delegating comaprison/src/guitar.hpp | e2b0fadca3a5af8ca3a7fbd8e59062140f575396 | [] | no_license | DangerDaisy/Headfirst_OOAD_CPP | b22bb2cae078f6346ceb94f9bbf431d1d2f485fa | 7c310af475194cae17e23c59dcd90726f0a94931 | refs/heads/master | 2023-02-15T21:02:02.329289 | 2021-01-10T10:56:46 | 2021-01-10T10:56:46 | 328,359,244 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | hpp | guitar.hpp | #ifndef GUITAR_HPP
#define GUITAR_HPP
#include "guitar_spec.hpp"
//Guitar class
class Guitar
{
public:
Guitar(std::string serial_number, double price, Guitar_spec spec);
std::string get_serial_number();
double get_price();
Guitar_spec get_spec();
void set_price(double new_price);
private:
std::string serial_... |
a3029353fdc35e3897a9d2a221809f37e57a59c9 | 3c3d0515ac7a9a764bd8446d281ee28751c7154a | /RunningAverageEA/RunningAverageEA.h | 3ce3e043994318b13bd95c7e74cc0a5a3b24fdf6 | [] | no_license | CacheFactory/offroading_computer | 8e1857277d87958daf8bb65e324c3804aafac3e4 | 85dd246df3d21e3e07cd278520c33d6937a6f5ac | refs/heads/master | 2021-01-22T05:24:22.562818 | 2016-01-23T04:35:12 | 2016-01-23T04:35:12 | 27,775,498 | 1 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 973 | h | RunningAverageEA.h | #ifndef RunningAverageEA_h
#define RunningAverageEA_h
//
// FILE: RunningAverageEA.h
// AUTHOR: Rob dot Tillaart at gmail dot com
// PURPOSE: RunningAverageEA library for Arduino
// URL: http://arduino.cc/playground/Main/RunningAverageEA
// HISTORY: See RunningAverageEA.cpp
//
// Released to the public domain
/... |
2b44988f7586d81573b4dff0b71e424c54f562a0 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir35435/dir35536/dir35859/dir36113/file36799.cpp | 4a5da4e4299c012e34f6ab25e4cf73912c657bb2 | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | file36799.cpp | #ifndef file36799
#error "macro file36799 must be defined"
#endif
static const char* file36799String = "file36799"; |
7c963a4f43e4a92bdd71564558e9986df43d8eed | 9a4e407c48031a56989667a6afbe7b5e246f862a | /genlisttranslator.h | f9225aac5e77bafedbf530cc79a02b5bb1297320 | [] | no_license | lxman/sflib | 31c18f6dae5bbaec4e25794cbe871c61ebe0d28e | 696b2a95ed71dec58183f5398f38c49a687c8a4c | refs/heads/master | 2021-01-20T18:58:00.033744 | 2016-08-04T23:42:57 | 2016-08-04T23:42:57 | 64,971,077 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 233 | h | genlisttranslator.h | #ifndef GENLISTTRANSLATOR_H
#define GENLISTTRANSLATOR_H
#include <QMap>
class GenListTranslator {
public:
GenListTranslator();
QString translated(int ID);
private:
QMap<int, QString> _gen_list;
};
#endif // GENLISTTRANSLATOR_H
|
695a42c39ba7359c1ae86074d5751f7ec653289a | 73a07dda7afaecabde241e53ab240dc5e901bcf7 | /Commands.cpp | 91676f749ed0e7f072874aa2c33da939c37082eb | [] | no_license | RaidMax/CommanderBot | 01ff8fc0a04bfabbf3b4aaafced157c6f75c41f8 | 417fe52b37b567aca10ba9764826d1554e35203b | refs/heads/master | 2021-01-20T17:20:02.571620 | 2016-07-24T03:51:18 | 2016-07-24T03:51:18 | 64,047,530 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,930 | cpp | Commands.cpp | #include "Commands.h"
#include "Messages.h"
#include "NetRequests.h"
#include "_Main.h"
#include "Poco\URI.h"
string testCommand(commandArgs)
{
return "Test command success!";
}
string pokeCommand(commandArgs)
{
Interface->sendPoke(originID, "Hey, Wakeup!");
return "VOID";
}
string statusCommand(commandArgs)
{
I... |
34aa6fd140e7bcf5dde146288c39a0427c9edf74 | 60abdf933555aff2871d9e41cdda915de0326445 | /lab1_polynomial/lab1_polynomial/lab1_polynomial.cpp | 114216033bdbb6048940baaa8738c30ef036b87c | [] | no_license | HVjay/Polynomials | 52cdb27d1a06f0ca43e4d3dc3a82b29ca82ba143 | 1d584952497e2daba97054e57e87d9b43b09583b | refs/heads/master | 2020-04-22T04:59:10.290969 | 2019-06-23T21:13:55 | 2019-06-23T21:13:55 | 169,837,489 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,207 | cpp | lab1_polynomial.cpp |
#include "lab1_polynomial.h"
class PolynomialTest {
public:
bool test_constructors1() {
bool constructor1 = true;
//test case of positive
int i1[] = { 1, 0, 0, 2 };
Polynomial p1(i1, 4);
constructor1 = constructor1 && p1.data.size() == 4;
constructor1 = constructor1 && p1.data[0] =... |
fa2dfaab88609a6968de5edf671a284b5c51f920 | b6c8ba44f5a1e2055e268203f4bb18b7d83b85c0 | /Conrad/include/text_utilities.hpp | 9858b188f339103507879ffbb7bc02ace777c929 | [] | no_license | ThomRI/ConradGameEngine | b045c7309786b9b24574001f4952ad6bfb717035 | 81aa2b29cd7ebfb39aa3e1a6dea9b1278b668fda | refs/heads/master | 2020-03-23T03:59:13.717229 | 2019-08-05T18:49:27 | 2019-08-05T18:49:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 164 | hpp | text_utilities.hpp | #ifndef TEXT_UTILITIES_HPP_INCLUDED
#define TEXT_UTILITIES_HPP_INCLUDED
#include <SDL2/SDL_ttf.h>
namespace textutils
{
}
#endif // TEXT_UTILITIES_HPP_INCLUDED
|
888625c9eeb894ea7d713124c8224b8274699f45 | 6fe2d3c27c4cb498b7ad6d9411cc8fa69f4a38f8 | /algorithms/algorithms-cplusplus/leetcode/Question_0354_Russian_Doll_Envelopes.cc | 2628d8ace2363a6acf569bb03f0ea51dc4414df1 | [] | no_license | Lanceolata/code | aae54af632a212c878ce45b11dab919bba55bcb3 | f7d5a7de27c3cc8a7a4abf63eab9ff9b21d512fb | refs/heads/master | 2022-09-01T04:26:56.190829 | 2021-07-29T05:14:40 | 2021-07-29T05:14:40 | 87,202,214 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 512 | cc | Question_0354_Russian_Doll_Envelopes.cc | #include <vector>
using namespace std;
class Solution {
public:
int maxEnvelopes(vector<vector<int>>& envelopes) {
int res = 0;
vector<int> dp(envelopes.size(), 1);
sort(envelopes.begin(), envelopes.end());
for (int i = 0; i < envelopes.size(); i++) {
for (int j = 0; j < i; j++) {
if ... |
4d9449cba31f155e2b220e926c69546c530e1eec | 13307a197e203892ab9cda3f97df737c7c76d404 | /Core/src/Module.cpp | 46764ae38a6c2117efc5c3a9b29567c0bab4fce6 | [
"Apache-2.0"
] | permissive | bzcheeseman/Hobbit | 4ec90b431520336bf0bf75d8608b4b4857cf2bc9 | a2427a3db8a9194883aa6e33bde65f6e7966b049 | refs/heads/master | 2021-09-16T23:06:54.940247 | 2018-03-22T00:34:49 | 2018-03-22T00:34:49 | 122,110,145 | 1 | 1 | Apache-2.0 | 2018-05-19T21:46:04 | 2018-02-19T19:28:55 | C++ | UTF-8 | C++ | false | false | 7,656 | cpp | Module.cpp | //
// Created by Aman LaChapelle on 3/17/18.
//
// Hobbit
// Copyright (c) 2018 Aman LaChapelle
// Full license at Hobbit/LICENSE.txt
//
/*
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 a... |
fab1fa93def43801b98a89ff140c0c33f921b93c | 36863c3cc6229ed4e735b3a64395e40632a4a314 | /C++ Primer/ch5/5.14.cpp | 1c5c30a192583e1be885e500c99c21b38ae5e711 | [] | no_license | Kepler11x/Zixue | ebd74c21eddbc5ab87cd578a24f24da346e19207 | 2db17b13f0dcc253fb64f78fe326d2abc6a402db | refs/heads/master | 2022-11-27T03:26:37.463979 | 2020-07-29T14:34:37 | 2020-07-29T14:34:37 | 283,393,083 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 680 | cpp | 5.14.cpp | #include<iostream>
#include<vector>
#include<string>
using namespace std;
using std::vector;
int main()
{
vector<string> strings;
string buf;
string word;
string maxWord;
int maxCount = 1;//记录最大出现次数
int count = 1;
while (cin >> buf) {
if (buf == "quit")
break;//输入quit退出
else
strings.push_back(buf);
}... |
9ffced21fd413bcfb9ed6a35bae6abecef7ccfb9 | a4c163a265ba22d2633212d1106ed5ea42b8b7e8 | /src/ScorePresent.cpp | ba5cdbc03951cbcc2577d63d518434bb858c8d85 | [] | no_license | leeKol/LodeRunner | 94d237c94beac10240ea861541238955b377b0a4 | db98d397a6ad852a6e2e08035bd937e96832affe | refs/heads/master | 2023-07-27T12:06:27.337900 | 2021-09-12T13:46:54 | 2021-09-12T13:46:54 | 405,653,730 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 125 | cpp | ScorePresent.cpp | #include "ScorePresent.h"
void ScorePresent::handleCollision(GameObject& gameObject)
{
gameObject.handleCollision(*this);
} |
532ce418e9004f24cc87a29817b49312d81035f8 | ab97443135b380e0694c2a5fb66ff872c0f1f262 | /src/GL3Engine/Graphics/Material.cpp | 7a2352b041c8ca0e58c77388a8701f2a43bdcd56 | [
"MIT"
] | permissive | Mati365/Potato3D-Engine | 5bcfea6c147afd3bc06936ce1637e51b84834343 | bf683a7213716d17d61d0e53edb32469af5166eb | refs/heads/master | 2016-09-06T16:54:53.907270 | 2015-08-26T10:50:59 | 2015-08-26T10:50:59 | 20,998,655 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 562 | cpp | Material.cpp | #include "Texture.hpp"
namespace GL3Engine {
namespace CoreMaterial {
MaterialBufferData Material::getMaterialBufferData() const {
#define COL_DEFINE(type) \
col[type].r(), col[type].g(), col[type].b(), col[type].a()
return MaterialBufferData {
COL_DEFINE(AMBIENT),
... |
1633f8d8815e8b955b978a95a71846cbb126e194 | 91ddca481281e8b8293d6ad64213c29065237209 | /CS 162 - Intro to Comp Sci II/Lab_9/queueStack.hpp | 24707c9ae1604681ce658f82057c10abff14c3c7 | [] | no_license | FiveFootSeventeen/Class-Projects | c397e3ee31e77cee1eed4a70123d315082bc4a76 | 75669ae2f184e1d4b036c61ae34ca7e108498ddc | refs/heads/master | 2020-04-05T14:41:23.837360 | 2018-11-29T00:14:22 | 2018-11-29T00:14:22 | 156,935,736 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 784 | hpp | queueStack.hpp | /*********************************************************************
** queueStack Functions
** Author: Jacob Leno
** Date: 11/25/17
** Description: Header file for the queueStack functions.
*********************************************************************/
#include "menu.hpp"
#include <queue>
#include <climits... |
70e00fb95a72f1ce874dc9dc5b4d1f0bda33eb65 | c2fa27059e42e5dfc48b10a3908db4eff7cebf9b | /061001/main.cpp | cf7f8eb60f41e57c46b5aff15d9ce0c12ea27ea4 | [] | no_license | baiheng/cpp-study | 21787d473d86c19bd08ebd664f178e5bcd452570 | 539788da41c80191d2b0ef8c765e090156335e1f | refs/heads/master | 2021-01-11T04:53:08.114125 | 2016-10-21T07:57:03 | 2016-10-21T07:57:03 | 71,542,852 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 718 | cpp | main.cpp | /*
* =====================================================================================
*
* Filename: main.cpp
*
* Description:
*
* Version: 1.0
* Created: 10/01/2016 10:57:48 PM
* Revision: none
* Compiler: gcc
*
* Author: YOUR NAME (),
* Compa... |
6ee5aff49dc327a89950b5204da3bddb516e4f23 | ae45359c86a0e91364127824050de9894a614392 | /projects/osgEarthX_COM/COM/Source/TileSource/TileSourceWCS/TileSourceWCS.h | 625dc9ef9358d82247a7f9914d157fd3a52e1073 | [] | no_license | hope815/osgEarthX | 6d6d084f907aaa0e6b832781dfc51a2f0c184eb9 | 7b7c5e98f82c82571cd1d0f306cecf05452315d5 | refs/heads/master | 2023-03-15T21:49:20.588996 | 2018-03-29T10:51:34 | 2018-03-29T10:51:34 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,965 | h | TileSourceWCS.h | // TileSourceWCS.h : CTileSourceWCS 的声明
#pragma once
#include "resource.h" // 主符号
#include "osgEarthX_COM_i.h"
#if defined(_WIN32_WCE) && !defined(_CE_DCOM) && !defined(_CE_ALLOW_SINGLE_THREADED_OBJECTS_IN_MTA)
#error "Windows CE 平台(如不提供完全 DCOM 支持的 Windows Mobile 平台)上无法正确支持单线程 COM 对象。定义 _CE_ALLOW_SINGLE_TH... |
f9c3e257b55a0a78e155f0fbd9924178329bba1f | fb06736d2ab3268e16ebc9083dedc4abb94dab4c | /Common/util/bufferedstream.cpp | a67d95415f1cda5fd3a190cd0b687e2fe28929a2 | [
"LicenseRef-scancode-unknown-license-reference",
"Artistic-2.0"
] | permissive | matteobin/ags | 15c49e662b3f6b52ceb9db3819c9cd569449c3ec | 3ba1b2a91aee2ebf9a5a0cb67d93ab93e8042ee0 | refs/heads/master | 2022-04-24T19:30:36.676673 | 2020-03-22T20:33:43 | 2020-03-22T20:33:43 | 259,399,863 | 1 | 0 | NOASSERTION | 2020-04-27T17:12:57 | 2020-04-27T17:12:56 | null | UTF-8 | C++ | false | false | 3,811 | cpp | bufferedstream.cpp | //=============================================================================
//
// Adventure Game Studio (AGS)
//
// Copyright (C) 1999-2011 Chris Jones and 2011-20xx others
// The full list of copyright holders can be found in the Copyright.txt
// file, which is part of this source code distribution.
//
// The AGS ... |
567d0dea40bcf6cedb6d98ac961bb5f5de997029 | 421f5b6d1a471a554ba99f6052ebc39a67581c96 | /Leetcode/96. Unique Binary Search Trees.cpp | d17446483f48085247d0a057e80f676179b891fa | [] | no_license | avinashw50w/practice_problems | 045a2a60998dcf2920a1443319f958ede4f58385 | 1968132eccddb1edeb68babaa05aaa81a7c8ecf3 | refs/heads/master | 2022-08-31T08:39:19.934398 | 2022-08-10T16:11:35 | 2022-08-10T16:11:35 | 193,635,081 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 992 | cpp | 96. Unique Binary Search Trees.cpp | /*Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?
Example:
Input: 3
Output: 5
Explanation:
Given n = 3, there are a total of 5 unique BST's:
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ ... |
deae16b1f2f060ed86acf0e6b5c186990ffb6312 | a783aeb11e299d9878e715a3c70df0ccd8724549 | /signletion/Singletion.cpp | db7e9884072a8a61ce03c27b68417d1913d56df7 | [] | no_license | bokket/C--2 | 35ff2664ba83ec004303e4f8e0aa5528c3969e66 | afcf1ae5307c726a18469ca03b1ff111243352ef | refs/heads/master | 2023-08-05T11:38:12.938804 | 2021-09-25T14:39:12 | 2021-09-25T14:39:12 | 309,900,787 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 129 | cpp | Singletion.cpp | //
// Created by bokket on 2020/11/24.
//
#include "Singletion.h"
int main()
{
Singletion* s1=Singletion::GetInstance();
}
|
57ad4bb2d29747405c3bbcc0f50ce9896cb5c0b2 | 387549ab27d89668e656771a19c09637612d57ed | /DRGLib UE project/Source/FSD/Private/BarleySpawnItem.cpp | 26493c7758d4df6ab967b92df0ba7bebe3215b7d | [
"MIT"
] | permissive | SamsDRGMods/DRGLib | 3b7285488ef98b7b22ab4e00fec64a4c3fb6a30a | 76f17bc76dd376f0d0aa09400ac8cb4daad34ade | refs/heads/main | 2023-07-03T10:37:47.196444 | 2023-04-07T23:18:54 | 2023-04-07T23:18:54 | 383,509,787 | 16 | 5 | MIT | 2023-04-07T23:18:55 | 2021-07-06T15:08:14 | C++ | UTF-8 | C++ | false | false | 125 | cpp | BarleySpawnItem.cpp | #include "BarleySpawnItem.h"
FBarleySpawnItem::FBarleySpawnItem() {
this->Resource = NULL;
this->Weight = 0.00f;
}
|
266fa6da43b0133427ffd34bbea67fbdb7a5ca1e | c20a1c872ed37b3199252a957edbd4311dc0b4d7 | /Source/JoinSelPtsDlg.cpp | 4762adfc3bee368349e3ddddb8b5f8c025d23898 | [
"MIT"
] | permissive | atanub/SurveyUtilitiesArx | 569ad2a043af93b5c521c0d21917fd96bd02bf81 | 3ce3f502a4f562464c9462bf82a921094cd094b2 | refs/heads/master | 2021-08-05T03:33:01.003854 | 2020-05-10T18:27:38 | 2020-05-10T18:27:38 | 168,826,791 | 4 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 6,766 | cpp | JoinSelPtsDlg.cpp | // JoinSelPtsDlg.cpp : implementation file
//
#include "Stdafx.h"
#include "JoinSelPtsDlg.h"
#include "SurvUtilApp.h"
#include "ResourceHelper.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
extern "C" HWND adsw_acadMainWnd();
//////////////////////////////////////... |
5160ee47338baf8d7ad528d176bbfe53a2d860e8 | 4c452179cf4c22a5e9d8ee4a9d0062ad3d6d0a45 | /client/Source/Engine2/weapon.cpp | fe0dcdacfca8c0fb0e2643fd5535eaacfc1a18e8 | [] | no_license | sdetwiler/pammo | ed749bdbd150a5665bdabc263005249a821cfa2e | aee306611ae8c681a5f8c03b3b0696e2cf771864 | refs/heads/master | 2021-01-13T01:49:15.414767 | 2015-05-18T22:21:24 | 2015-05-18T22:21:24 | 35,837,663 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 219 | cpp | weapon.cpp | #include "weapon.h"
#include "imageEntity.h"
namespace pammo
{
Weapon::Weapon()
: mIcon()
{
}
// Define the pure virtual destructor.
Weapon::~Weapon()
{}
ImageEntity* Weapon::getIcon()
{
return &mIcon;
}
} |
7dabe31e4394a6f34c2271fab0bb33ce998d9178 | bb9b83b2526d3ff8a932a1992885a3fac7ee064d | /src/modules/osgViewer/generated_code/KeystoneHandler.pypp.hpp | f0f1a5cbc9e89adc84b506403ebafcaa728f346a | [] | no_license | JaneliaSciComp/osgpyplusplus | 4ceb65237772fe6686ddc0805b8c77d7b4b61b40 | a5ae3f69c7e9101a32d8cc95fe680dab292f75ac | refs/heads/master | 2021-01-10T19:12:31.756663 | 2015-09-09T19:10:16 | 2015-09-09T19:10:16 | 23,578,052 | 20 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 227 | hpp | KeystoneHandler.pypp.hpp | // This file has been generated by Py++.
#ifndef KeystoneHandler_hpp__pyplusplus_wrapper
#define KeystoneHandler_hpp__pyplusplus_wrapper
void register_KeystoneHandler_class();
#endif//KeystoneHandler_hpp__pyplusplus_wrapper
|
7985ce379e1ce16bce0c13e57ed520cc5f20aa90 | 03b830414faedabf35eac66e0d7baf477133300b | /src/20200601/52paly.cpp | 834fe1016f8c314f1a9d172e4153f3168e616964 | [] | no_license | liupengzhouyi/nowCoder | 12abb70c30b6872a73c993365575d4d888795c7e | 14fa3aa5a54def9f34f4552f01088a6c4dd5f96d | refs/heads/master | 2022-10-04T21:14:02.085585 | 2020-06-05T10:11:43 | 2020-06-05T10:11:43 | 267,886,016 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,274 | cpp | 52paly.cpp | //
// Created by 刘鹏 on 2020/6/1.
//
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void check24(const vector<int> &nums, int index, double result, bool &isSuccess)
{
if (index == 4) //递归结束条件
{
//if (abs(result - 24) < 1e-6)
isSuccess = true;
return;
... |
f85cdfc7badbc0efbcab19b02852759792ca5cf1 | 3c078c619096943a2eff75c88ba84fb556107987 | /examples/Sandbox/Systems/GraphicsSystem.hpp | 6b24cb21496230c218adcaf20da2bf5f11b3c440 | [
"MIT"
] | permissive | JordiSubirana/ATEMA | d6a778c3b3090456052660ea94fad2c9c20c3c1d | c8e4044f60e1afe4e38ddcf80921ee2e644f46ea | refs/heads/master | 2023-08-31T15:32:50.295905 | 2023-08-24T22:58:05 | 2023-08-24T22:58:05 | 56,619,922 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,376 | hpp | GraphicsSystem.hpp | /*
Copyright 2022 Jordi SUBIRANA
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute,... |
f8d7ac4111d61bc55def97e723a21d09c181aea9 | 0c807b167431fa28f9f59877359db0be9e22b905 | /weather_project/wind_sensor/windSensorVer1.0/windSensor.ino | 79012213f4ee796ee3a8caebefcefe7fc4abd54e | [] | no_license | gowthamrajN/Sofwares-Backup | 2b93bc3c2bef0c0b9f6da6936a5de8b8fc096fef | cb35f8735f0893a8b2e5593855ee3888190d4e5c | refs/heads/master | 2021-08-28T11:51:37.718496 | 2017-12-12T04:59:14 | 2017-12-12T04:59:14 | 113,945,782 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,494 | ino | windSensor.ino | # define IR 2 // Receive the data from sensor
# define Led 13 // Light a led
// Constants definitions
const float pi = 3.14159265; // pi number
int period = 10000; // Measurement period (miliseconds)
int delaytime = 10000; // Time between samples (miliseconds)
int radio ... |
b732809923b55bdfb2897fa3a6ceb410735cc762 | 5b2c9cf01b25723384aad9f04ad9f8358a17380f | /src-cpp/ssdjtopng.cpp | a471b7ff4dc50c1dea21f10aabc627550e1d58bd | [] | no_license | bioinfolabmu/jnsviewer | 7bdd129c58a9e4f4e65d0f76203b97720aaa9660 | d4543fd137a0960397c3826737afd4064423a91a | refs/heads/master | 2021-01-22T06:02:03.194082 | 2017-06-05T22:24:38 | 2017-06-05T22:24:38 | 92,515,077 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,935 | cpp | ssdjtopng.cpp | ////////////////////////////////////////////////////////////
// <Decleration> //
// It is a part of RNASViewer project. //
// <Date> //
// 11/22/2013 //
// <Author> ... |
5de55a570da852a972f185ef96c249259c6f4eb6 | 2ea045ba8b4e4248ecd423d4d34d6812fe3d0dc2 | /analyze_block_splitting/save_block_splitting.cc | 440d9a0b87b8e74b4529b05efb401f8fea939911 | [
"Apache-2.0"
] | permissive | seanpm2001/GoogleChromeLabs_Dynamic-Web-Bundle-Serving | d65583184e1c4a38e3bd987f74fb0173ad885a0b | fedcfc4a827f3047362a23d0e745ad273fc0094d | refs/heads/master | 2023-03-17T23:46:55.352207 | 2020-06-22T08:43:10 | 2020-06-22T08:43:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,701 | cc | save_block_splitting.cc | // Copyright 2020 Google Inc. 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
//
// Unless required by applicable... |
40aa0f2c608515024ed87f4ccf9c13043dd4d5b5 | dd91ea0a9b143371cfb186eaa74333da9488510d | /shared/libebm/debug_ebm.cpp | bf27dbdda3deaafc56dd5888c26aa905721bb784 | [
"MIT"
] | permissive | interpretml/interpret | 6c6ef2f2e6a6bb9c43633251089385cc44affe16 | e6f38ea195aecbbd9d28c7183a83c65ada16e1ae | refs/heads/develop | 2023-09-03T17:42:50.611413 | 2023-08-28T18:16:10 | 2023-08-28T18:16:10 | 184,704,903 | 3,731 | 472 | MIT | 2023-08-15T04:31:34 | 2019-05-03T05:47:52 | C++ | UTF-8 | C++ | false | false | 25,756 | cpp | debug_ebm.cpp | // Copyright (c) 2023 The InterpretML Contributors
// Licensed under the MIT license.
// Author: Paul Koch <code@koch.ninja>
// We normally only test the external public interface because unit testing in C++ is a bit more complicated
// and would require us to make unit test specific builds. For our package it seems ... |
c985bd86770342eb59d1619e1aa7e48affdc6242 | 7a4d5d147a8bc95ccc4eec2614906262f5ab93ee | /livewire_features/lwocv.cpp | df2ab1b89070b2c6605c2c55be8070a08f82dbec | [] | no_license | andemerie/livewire | 83cf18b20d16a855979692b3a8414545a3194eb7 | 72168ff0de83d95196567203288db64e47006a57 | refs/heads/master | 2021-03-22T03:35:42.415132 | 2017-08-13T14:10:40 | 2017-08-13T14:10:40 | 83,986,223 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,093 | cpp | lwocv.cpp | #include "lwocv.h"
cv::Mat calcImgGrad(const cv::Mat &img) {
cv::Mat ret;
cv::Mat gx, gy, ga;
cv::Sobel(img, gx, CV_64F, 1,0);
cv::Sobel(img, gy, CV_64F, 0,1);
cv::cartToPolar(gx,gy, ret,ga);
double vMax;
cv::minMaxLoc(ret, NULL, &vMax, NULL,NULL);
ret=1.0-ret/vMax;
return ret;
}
... |
ce1c26b672dbea11d4b4a12075e259ec92ddf553 | 8a94fcd5efd6a6d1f931b723b81ca3fd1cdfae80 | /strings/strings 1st/finding first unique element in string using an array.cpp | 32b830536ddfb87e0fcce5628c000c4ed98fce50 | [] | no_license | saranshrawat/Data-structure-and-algorithms | b00c7313a964603783feb615789e90e9cc0d9db7 | dbb59c971c71ecad3ae7e23a940abe3b897f2e2b | refs/heads/main | 2023-07-26T18:31:06.750360 | 2021-09-07T06:17:27 | 2021-09-07T06:17:27 | 403,859,752 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 594 | cpp | finding first unique element in string using an array.cpp | #include<iostream>
#include<string>
#include<map>
using namespace std;
char unique(string s)
{
int v,ind,store,arr[26];
char uni;
for(int i=0;i<s.length();i++)
{ v=(int)s[i];
ind=v-97;
arr[ind]+=1;
}
for(int i=0;i<s.length();i++)
{ v=(int)s[i];
ind... |
e48a783620dd8d5407cb8568e8f63dcaa28f5b10 | 7246f7795ba754d05b0868b9c887f8d650f37a46 | /ProjetPriseDeNote/video.h | a8c438beaeb2f7ea5b14b15c62667211bce3fe05 | [] | no_license | Simobain/MotDit | 736ebc16262e2ae4184e8029a6bdb3b55b7c05a5 | 4bfa7ac8882b3f61b69e0615cc624fbde8d0a49c | refs/heads/master | 2021-01-19T19:37:49.636026 | 2013-06-16T22:04:03 | 2013-06-16T22:04:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,131 | h | video.h | #ifndef VIDEO_H
#define VIDEO_H
#include "binary.h"
/*!
* \file video.h
* \brief Classe de base permettant de définir des notes de type video.
* \author Pauline Cuche/Simon Robain
*/
/**
*\class Video
* \brief Classe représentant les Video
*/
class Video : public Binary
{
Video(const Video& v);
Video& ... |
1cb14642cf23b1abafac60dfe5b978175b94a483 | ec2f7ef3ba6582c25a525a5e172dc18b28564852 | /GameAIPlugin/Source/BT/Condition/HaveLastKnownPositionCondition.h | cf1c005d67622858baf1f6059a91db05cdbcb615 | [
"MIT"
] | permissive | river34/the-ai-project | 86473a354e6c466a63e40b4749cc20386eedd035 | 9397a603e79be4c67ac8da12df4f2178af74ff2f | refs/heads/master | 2021-04-28T10:45:47.136802 | 2018-02-19T14:33:21 | 2018-02-19T14:33:21 | 122,074,021 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 897 | h | HaveLastKnownPositionCondition.h | #ifndef HaveLastKnownPositionCondition_h
#define HaveLastKnownPositionCondition_h
#include <stdio.h>
#include "GameBTLib.h"
#include "BaseCharacter.h"
#include "GameFrameworkLib.h"
using namespace GameBT;
class HaveLastKnownPositionCondition : public Behavior
{
public:
HaveLastKnownPositionCondition() : Behavior("H... |
e40717df1fa4bed922e558636860544d0d79c233 | 52a7321b96dec025b6dbfcffa4f0f6d408a41160 | /main.cpp | 5ed6b72cdc1071d6f59e38b0bca18e99b28a2d45 | [] | no_license | BalitskyIvan/ft_containers | 1b00822e65e1afb8ee8ebda8ecb281a77759675a | 8bdbe178fedad4b0846ff130ba162e5bf1969662 | refs/heads/master | 2023-07-27T21:51:49.451244 | 2021-08-28T06:43:02 | 2021-08-28T06:43:02 | 334,128,651 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,686 | cpp | main.cpp | #include "vector_test.cpp"
#include "map_test.cpp"
#include "stack_tester.cpp"
#include <deque>
#define MAX_RAM 42940000
#define BUFFER_SIZE 12000
struct Buffer {
int idx;
char buff[BUFFER_SIZE];
};
#define COUNT (MAX_RAM / (int)sizeof(Buffer))
template<typename T>
class MutantStack : public ft::stack<T> ... |
c96dc8e873751a9d57f7956a6624e6730d354ea3 | 08c01a0ebe125f5ee2f1db73a9e942a8e0786d82 | /src/core.cpp | 39588fd721415d0e64335d480fd05c0c6efb82bd | [] | no_license | SealBelek/physicEngine | ac5e68df49e325e52dc16451d2f71dbf16d292d6 | d7ca569ab73c13f156d2aae6d50011506e121d7a | refs/heads/master | 2022-08-02T22:40:17.608962 | 2020-05-26T20:54:32 | 2020-05-26T20:54:32 | 240,591,519 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,624 | cpp | core.cpp | //
// Created by seakbelek on 14.02.2020.
//
#include "../include/core.h"
#include <cmath>
using namespace physicEngine;
Vector3::Vector3(): x(0), y(0), z(0){}
Vector3::Vector3(const real x, const real y, const real z): x(x), y(y), z(z) {}
void Vector3::invert() {
/**
* инвертирует вектор
*/
x = -... |
0650daffe708d8f55af4b09d74ae2f96c7d60daf | 6b873489c50cae426b6f6bbca8fa2bfc23bba5eb | /1154.digital/ADC-lab/ADC_Smoothed_MIDI_cc/ADC_Smoothed_MIDI_cc.ino | 75d3ab12e8c2e4fc81dc8c82647589608d6517d0 | [] | no_license | langsound/Digital-Electronics | a34dc46826759de9664eb01e1a978017ab3b8379 | 13566f9552f0e284cd7b69a311dcc798c9da7d31 | refs/heads/master | 2021-01-19T20:15:33.694418 | 2015-04-15T22:39:36 | 2015-04-15T22:39:36 | 10,916,243 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 812 | ino | ADC_Smoothed_MIDI_cc.ino | /*
analog read to MIDI continuous controller send.
One pot is sent via to different midi CC messages.
the first cc message is just scaled data
the second cc message is scaled and smoothed data
*/
// change pwmSmooth here
float pwmSmooth = 0.5;
float pwmOut;
void setup(){
}//endsetup
void l... |
65c9adfa45badc5e96e8ed3d9439acaf4eaf7ee6 | bd99f1443454c27bd247f0696c1730183c9a4a11 | /main.cpp | a82282b805a1c06ac9fcd0461971d9d5b6f5e907 | [] | no_license | Hostridet/pthread | ddea6e2262aaa61b32659f92b7e99f44cabd2ec2 | 09ddc67efbfc10b8048d359587c8e70ad30aa52a | refs/heads/main | 2023-02-17T23:13:50.950171 | 2021-01-15T21:21:56 | 2021-01-15T21:21:56 | 330,018,606 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 697 | cpp | main.cpp | #include <iostream>
#include <ctime>
#include "thread.h"
using namespace std;
int main() {
clock_t start, end;
start = clock();
cout << "Сумма высчитанная в одном потоке: " << SoloThread() << endl;
end = clock();
cout << "Один поток посчитал сумму чисел во всех файлах за: " << (end - start) / 100... |
8aa6e525cd696551fb19a32127d9af5c884f71bc | 03fc8bbfb2632d98a8c5a6078361e3c377ad84ee | /App/DeepObjectTracker/RecurrentNeuralNetworkCUDA/RecurrentNeuralNetwork.h | 75ade8cbe8923c18f045e321523d637a127dd05d | [] | no_license | andu04/DeepObjectTracker | 157c488672ee78e90dbd5ef6a92a551f687b7738 | 078ad6fda1a837b1a0819cfa965e41bb6065c547 | refs/heads/master | 2021-01-21T17:28:28.823752 | 2017-04-05T20:30:44 | 2017-04-05T20:30:44 | 85,471,456 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 237 | h | RecurrentNeuralNetwork.h | #pragma once
#include "cudnn.h"
class RecurrentNeuralNetwork
{
public:
RecurrentNeuralNetwork();
~RecurrentNeuralNetwork();
bool CheckCUDA();
bool CheckCUDNN();
private:
cudnnHandle_t cudnnHandle;
cudnnStatus_t cudnnStatus;
};
|
c2a1cc9e0d56a2794a3a7a730d5ac5ce4a7c2b1a | 739c019596f3bc2f82940a95e3352bcc27cab630 | /Forces/714B.cpp | 118675061647f70186d3be6fc92bae4bef120942 | [] | no_license | FundamentalEq/CompetitiveProgramming | d379ac2b274b26ceb123e8d7769dcbae6615191a | 10ca735e7ce3cba796ad129df290884cdee1c4af | refs/heads/master | 2020-06-13T06:44:42.822860 | 2017-10-08T14:31:47 | 2017-10-08T14:31:47 | 75,419,874 | 0 | 1 | null | 2017-10-08T14:31:48 | 2016-12-02T18:14:40 | C++ | UTF-8 | C++ | false | false | 833 | cpp | 714B.cpp | #include <bits/stdc++.h>
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i,n) for (int i = 1;i <= (int)(n); ++i)
#define FA(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); i++)
#define pb push_back
#define mp make_pair
#define sz(a) (int)(a).size()
#define f first
#define s second
#def... |
c6eac9d48046651babd08e86790d9b17d08298f9 | d21c3427800f8dd1fcbf34cd2768a65fdcae3a27 | /code/cytosim/src/sim/fiber_binder.cc | 085b767da27e1c0627216b56a19491bd6c9e43af | [] | no_license | manulera/LeraRamirez2019 | b4e5637b76b988e3ae32177e7e894f85f9b6e109 | bc42559d500d6e3270d1e8ab0e033a9e980b5e48 | refs/heads/master | 2023-02-12T22:56:05.410164 | 2021-01-13T10:10:24 | 2021-01-13T10:10:24 | 329,267,089 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,615 | cc | fiber_binder.cc | // Cytosim was created by Francois Nedelec. Copyright 2007-2017 EMBL.
#include "fiber_binder.h"
#include "fiber_locus.h"
#include "iowrapper.h"
#include "simul.h"
#include "sim.h"
FiberBinder::FiberBinder(Fiber* f, real a)
: fbFiber(f), fbAbs(a)
{
assert_true(f);
inter = f->interpolate(a);
}
void FiberBin... |
8455e46ebce7cbb7c4401fe41b3c259b25d89b57 | 53c44e30f22ed8ad33ae9c0bc1e04fb8b268ce7b | /Data Structures/BinarySearchTree.cpp | e80a09b779390b26a92755439b582c49a70e2ab8 | [] | no_license | vinayakkokane/DS-and-Algo-CPP | a6ba07e35ff232a613f887eec1a04586c02b9e89 | 4248ad1ed2cabea09cf9305c0b63ad45f8fb5008 | refs/heads/master | 2023-03-03T09:28:05.951085 | 2021-02-11T14:23:37 | 2021-02-11T14:23:37 | 284,257,983 | 1 | 1 | null | 2020-10-04T10:22:04 | 2020-08-01T12:43:42 | C++ | UTF-8 | C++ | false | false | 5,289 | cpp | BinarySearchTree.cpp | /*Implementation of Binary Search Tree
Name: Vinayak L Kokane*/
#include<bits/stdc++.h>
using namespace std;
struct bstnode
{
int data;
struct bstnode *left, *right;
};
struct bstnode *newNode(int key)
{
struct bstnode *temp = new struct bstnode();
temp->data = key;
temp->left = ... |
f6afc487a54bfe5336913aef0e82556183643cd7 | f72c609ddfd5d8c459461b78fa50196dc90a976e | /PacketSenderPlz/packet.h | 2e14e248db99fd1e30ccfb5c9d59045375695ebc | [
"MIT"
] | permissive | lain3d/PacketSenderPlz | 52a808e38225c717ae080cfe9606382b9a4dc880 | bd581d5e24689c4b88cd3fe0dffa80908786a494 | refs/heads/master | 2020-12-30T01:00:31.144920 | 2017-03-15T11:22:41 | 2017-03-15T11:22:41 | 238,806,020 | 0 | 1 | MIT | 2020-02-06T23:30:13 | 2020-02-06T23:30:12 | null | UTF-8 | C++ | false | false | 618 | h | packet.h | #pragma once
class packet
{
std::string error_;
std::string source_;
std::vector<unsigned char> data_;
bool should_be_parsed_;
static uint32_t main_thread_id_;
template <typename T>
void encode(T data);
public:
packet();
packet(uint16_t header);
bool is_connected();
void encode1(uint8_t data);
void enc... |
de5bea4ca5d3e04212b1651e01df1685aa7d44da | f703bebbc497e6c91b8da9c19d26cbcc98a897fb | /CodeForces.com/regular_rounds/#352/B.cpp | 6ef6d9863b7e6739f2c558927a6182b8248b143f | [
"MIT"
] | permissive | mstrechen/competitive-programming | 1dc48163fc2960c54099077b7bfc0ed84912d2c2 | ffac439840a71f70580a0ef197e47479e167a0eb | refs/heads/master | 2021-09-22T21:09:24.340863 | 2018-09-16T13:48:51 | 2018-09-16T13:48:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 342 | cpp | B.cpp | #include <iostream>
using namespace std;
int a[27];
int main(){
ios::sync_with_stdio(false);
int n,answer = 0;
cin >> n;
char tmp;
for(int i = 0; i<n; i++)
{
cin >> tmp;
answer+=a[tmp-'a']>0;
a[tmp-'a']++;
}
if(n>26) cout << -1;
else cout << an... |
1031d848c67fb15b4e10a05991f3ff8017f4765e | 92a9f837503a591161330d39d061ce290c996f0e | /LIB/SiNDYLib/build/FieldMap.cpp | a6f7806e073c807b68d71e93bc27d88de7f936c2 | [] | no_license | AntLJ/TestUploadFolder | 53a7dae537071d2b1e3bab55e925c8782f3daa0f | 31f9837abbd6968fc3a0be7610560370c4431217 | refs/heads/master | 2020-12-15T21:56:47.756829 | 2020-01-23T07:33:23 | 2020-01-23T07:33:23 | 235,260,509 | 1 | 1 | null | null | null | null | SHIFT_JIS | C++ | false | false | 9,856 | cpp | FieldMap.cpp | /*
* Copyright (C) INCREMENT P CORP. All Rights Reserved.
*
* THIS SOFTWARE IS PROVIDED BY INCREMENT P CORP., WITHOUT WARRANTY OF
* ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
* WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE
* AND NONINFRINGEMENT.
*
* IN NO EVENT SHAL... |
3bc7b5e24c5cd303ca2291a66114b43ec3e4b300 | 892c52c638022758f500282f92de7ef0aa33aef1 | /source/Applications/Uebungen/U_FourPoints.h | aaa4db027033813f93bdd1b143dd585a1d890500 | [] | no_license | zhushaopeng1234/CG_Project | 147f5ef598e3a61cc0c1191c809c6b9f14af31e5 | a09d5fd47bf8992cca858af971371181337057c8 | refs/heads/master | 2023-03-08T16:09:14.877169 | 2021-02-26T16:16:25 | 2021-02-26T16:16:25 | 342,625,574 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 359 | h | U_FourPoints.h | #pragma once
#include "Applications/Application.h"
#include "ShaderPrograms/Program_passThrough.h"
class App_FourPoints :public Application {
int frame_width,frame_height;
float position[4][3]; // x,y,z, x,y,z ,...
float color[4][4]; // r,g,b,a, r,g,b,a, ...
Program_passThrough prog;
public:
App_FourPoints(int... |
3b529b4e0de89ddaa983f521792509aa884c7ebc | 3159d77c2fc0828025bd0fb6f5d95c91fcbf4cd5 | /cpp/shared_ref/shared_ref/main.cpp | bb7124c93dac7a9210e88affe51b6192d5f8fc22 | [] | no_license | jcmana/playground | 50384f4489a23c3a3bb6083bc619e95bd20b17ea | 8cf9b9402d38184f1767c4683c6954ae63d818b8 | refs/heads/master | 2023-09-01T11:26:07.231711 | 2023-08-21T16:30:16 | 2023-08-21T16:30:16 | 152,144,627 | 1 | 0 | null | 2023-08-21T16:21:29 | 2018-10-08T20:47:39 | C++ | UTF-8 | C++ | false | false | 2,884 | cpp | main.cpp | #include <iostream>
#include <vector>
#include <string>
#include "unique_ref.hpp"
#include "shared_ref.hpp"
struct intf
{
virtual void method() = 0;
};
struct impl : intf
{
virtual void method() override
{
std::cout << "impl::method()" << std::endl;
};
};
shared_ref<int> return_shared_ref()
... |
0bb473b8e2d4bf8a8661706461a119e908f5437b | 93f3fd8dce736f3083e9a8ab7a7c9d105ffee371 | /SEGUI/Source/GUI/ButtonRadio.cpp | 2bc17dc560808f3380e6301c6d92a66f95485534 | [] | no_license | rjadroncik/Shadow-Engine | 6562c861d1fef7828fc0b882d2ccf27840a4ebd3 | fb4314116d039e58bf99123dc82def43323988cc | refs/heads/master | 2021-01-17T15:35:37.192851 | 2016-10-28T16:58:02 | 2016-10-28T16:58:02 | 27,828,561 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,836 | cpp | ButtonRadio.cpp | #include "StdAfx.h"
#include "ButtonRadio.h"
#include "Paint.h"
#include "Event.h"
CButtonRadio::CButtonRadio(CWindowAbstract* pParent)
{
this->WindowCreate(Win32ClassCButton, WS_CHILD, WS_EX_TRANSPARENT, pParent);
}
CButtonRadio::~CButtonRadio()
{
}
void CButtonRadio::OnWindowPaint(IN CEventWindow& rEvent)
{
//Pr... |
0abfa281f42fc6507358d18165a35d0c9424684c | 2113ddcca3f023d5dd4c8ce479626a59bf61d9c7 | /chapter1/programing_exercise/1-13/example.cpp | d6cea593ee0a871404e0174d7296345150c0d3e2 | [] | no_license | EricPro-NJU/Fundamental-Programing-2020 | 708b9aab571b2035e4e4e1c317d9277905012f53 | 5e78068b9feb32930aac0f4652a3156f345c6ce9 | refs/heads/master | 2020-12-20T15:43:52.065510 | 2020-01-25T04:49:59 | 2020-01-25T04:49:59 | 236,126,139 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 470 | cpp | example.cpp | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int n;
cin >> n;
double c, s;
double c_all = 0, s_all = 0;
int flag = 1;
for (int i = 1; i <= n; i++) {
cin >> c >> s;
if (s < 60) {
flag = 0;
}
c_all += c;
s_all += c * s;
}
if (flag == 0) {
cout << "Faile... |
e0602d7847df944f2866416f42d6abe721f14eb7 | 88287451518d521c264564f448de973d4ca004a0 | /src/ReaderFiles.cpp | 608e5068029c9991dbf4539ed636896df68ccf0e | [] | no_license | lazarocosta/FEUP-CAL-projeto2 | 8c513e21db97f67ece13ff4d557c37b274d01e4a | 4e2140f3c250d991d4fdc886ecaa5355fa942b6e | refs/heads/master | 2016-09-13T14:42:51.852577 | 2016-05-30T14:02:44 | 2016-05-30T14:02:44 | 59,753,388 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,506 | cpp | ReaderFiles.cpp | #include "ReaderFiles.h"
ReaderFiles::ReaderFiles(){
readFileNameNodes();
readFileNameRoads();
readFileNameRelation();
}
void ReaderFiles::readFileNameNodes(){
ifstream myfile("files1.txt");
if(myfile.is_open())
{
string line;
char trash;
unsigned long nodeID;
double lat_rad,lon_rad,lat_deg,lon_deg;... |
fe0c9ea8cbe32b1e608bd6f614e4a05c0c4b29dc | f8975076e4394c7657fa8c602c2cd938b6191c48 | /Main/mywow/interface/IVideoResource.h | 51aa411485f5554cd07b2346d846a78980c4ab1d | [] | no_license | miztook/wowmodelexplorer | baa87ee965c64ea53272b1cf8bd0c0ca966a76a4 | 78b5ea79668a551dd70cd0699b8393de4472ec5f | refs/heads/master | 2021-07-08T23:10:58.887309 | 2020-07-19T04:27:50 | 2020-07-19T04:27:50 | 145,582,892 | 7 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 584 | h | IVideoResource.h | #pragma once
#include "base.h"
class IVideoResource
{
public:
virtual ~IVideoResource() {}
protected:
virtual bool buildVideoResources() = 0;
virtual void releaseVideoResources() = 0;
virtual bool hasVideoBuilt() const = 0;
public:
static bool buildVideoResources(IVideoResource* t)
{
ASSER... |
1f421b0ffb7eff0b1699d7ec06fae48e1cd20e98 | 40662e477e03bf8757973cec33ada3643a28cb49 | /201804/0425/BZOJ4860/BZOJ4860.cpp | 2785aa9a774df2e78e045675dace3fb93c4bbb57 | [] | no_license | DreamLolita/BZOJ | 389f7ab12c288b9f043818b259bc4bd924dd7f21 | a68e8530603d75f65feed3e621af30cbeccc56fe | refs/heads/master | 2021-09-15T19:21:56.356204 | 2018-06-09T05:54:38 | 2018-06-09T05:54:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,197 | cpp | BZOJ4860.cpp | #include<bits/stdc++.h>
#define mkp(x,y) make_pair(y,x)
using namespace std;
typedef pair<int,int> pii;
const int INF=1e8;
const int N=2e5+10;
int root,n,m,liml,limr,sum,ans;
int siz[N],mx[N],col[N];
bool vis[N];
vector<pii>e[N];
int read()
{
int ret=0,f=1;char c='.';
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
... |
bd7b61901231a095b14fb0859078ee4f37fcf202 | 85b5505456602de80f2306bad8182093ff536493 | /A1107.cpp | 25a10b7fd164db516cd60bf08a3ed74ba05f3712 | [] | no_license | WuJianeng/PAT | 3bfe515f26e9adf4e14966eccbee5301d9d4daeb | d0ecabc0c7cc8ff3306aa5d3d00065e5a26c95bd | refs/heads/master | 2020-04-18T01:33:21.615454 | 2019-11-05T11:43:00 | 2019-11-05T11:43:00 | 167,122,750 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,198 | cpp | A1107.cpp | //2019 2.16 21:07 forked from QingShen Notes
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1010;
int father[maxn], course[maxn] = {0}, isRoot[maxn] = {0};
void init(int n){
for(int i = 1; i <= n; ++i)
father[i] = i;
}
int findFather(int x){
int a = x;
while(x != fath... |
fb3ef364e9afa1ba7f41da1f6e35299a80020b45 | f3f7411692affe7e0539bbdfb0b27156829da128 | /H - Grid 1.cpp | 46af65f8b3c532b6d54818ece690e9c9c5a08111 | [] | no_license | abhishek9125/Educational-DP-Contest | bde79923c88516df5b070d7706f0c8f2606f595d | b4abca93b82af5f1d1b2f11a7ca17beb0a063310 | refs/heads/master | 2022-09-06T04:04:53.422213 | 2020-06-02T16:41:13 | 2020-06-02T16:41:13 | 268,182,497 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,248 | cpp | H - Grid 1.cpp | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
char grid[1002][1002];
int paths(int n,int m){
int dp[1002][1002];
memset(dp,-1,sizeof(dp));
int counter = 1;
for(int i=0;i<m;i++){
if(grid[0][i]=='#'){
dp[0][i] = 0;
counter = 0;
... |
6ede1c949f2c5afbafc4f76186c5c277c51d399f | a7764174fb0351ea666faa9f3b5dfe304390a011 | /drv/IGESSolid/IGESSolid_HArray1OfFace_0.cxx | 3d700db51ed2fb67dccab86a18628023c4ce8baf | [] | no_license | uel-dataexchange/Opencascade_uel | f7123943e9d8124f4fa67579e3cd3f85cfe52d91 | 06ec93d238d3e3ea2881ff44ba8c21cf870435cd | refs/heads/master | 2022-11-16T07:40:30.837854 | 2020-07-08T01:56:37 | 2020-07-08T01:56:37 | 276,290,778 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,717 | cxx | IGESSolid_HArray1OfFace_0.cxx | // This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#include <IGESSolid_HArray1OfFace.hxx>
#ifndef _St... |
e0a526993b0f71fa1e3a2fc2d5c4798463bd0f3c | 0356c30010b224ea3fa9a7036773e83990878da7 | /Headers/AA/FeaturesDistance.hpp | e7b6858868caad9ebb09ad6bdb1344131e6fe6bf | [
"MIT"
] | permissive | DottD/audioRec | 5891e3c8cb00c9edd16d2139be3840767b3ddc33 | 74c316974000fc7c9048f076de01c40ede85836c | refs/heads/master | 2020-12-01T13:41:07.400878 | 2019-12-28T23:06:08 | 2019-12-28T23:06:08 | 230,643,764 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 571 | hpp | FeaturesDistance.hpp | #ifndef FeaturesDistance_hpp
#define FeaturesDistance_hpp
#include <QVariantList>
#include <QAlgorithm.hpp>
#include <armadillo>
namespace AA {
class FeaturesDistance;
}
class AA::FeaturesDistance : public QAlgorithm {
Q_OBJECT
QA_INPUT_LIST(QVector<double>, Features)
QA_OUTPUT(double, Distance)
QA_CTOR_I... |
ff4030f9a7fb46b8aa834ccdd25ccd35d5adac21 | 43a07286cbbdb855a771db0e5a40c8aaf0373c01 | /templates/onion_find_set.cpp | 1d39de85aa218f568812540adc2d37da5a4f5a32 | [] | no_license | oscar172772/codes | 56537593463e4c6c003c3da75e75400065bfef82 | e644c358803ce280284e7360da6302f6b86f1f82 | refs/heads/master | 2021-01-20T06:00:16.814847 | 2017-10-03T14:47:05 | 2017-10-03T14:47:05 | 89,832,062 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 663 | cpp | onion_find_set.cpp | #include<iostream>
#include<cstdio>
using namespace std;
int n,m,pa[4000010];
int find(int x){return pa[x]==x?x:pa[x]=find(pa[x]);}
inline void onion(int x,int y){int px=find(x),py=find(y);if(px!=py)pa[px]=py;}
inline int read()
{
char ch=getchar();
int ret=0;
while(ch>'9'||ch<'0')ch=getchar();
while(ch<... |
8dc338cff4f0e80b689bd7ebfceb28d1a498ff78 | 189bde2f18be6ae87d554026b12220c1d07b9bb2 | /money.cpp | ff6758476b7fb21b7b21014ace78dfa99b08c839 | [] | no_license | kienhoang/MoneyEatV02 | c73dca319ea3b0d15a78a39bd17c05fe6096ce70 | b8cffae79bca61a0fcaa3864c0e413cb2fded73e | refs/heads/master | 2021-01-10T08:23:31.959894 | 2016-02-23T05:55:04 | 2016-02-23T05:55:04 | 52,248,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 376 | cpp | money.cpp | #include "money.h"
#include "ui_money.h"
Money::Money(QWidget *parent) :
QDialog(parent),
ui(new Ui::Money)
{
ui->setupUi(this);
ui->lcdNumber->setDigitCount(10);
this->setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);
}
Money::~Money()
{
delete ui;
}
void Money::setMoney(cons... |
98c92405bf90a2598ef6691e28605a676fc871b9 | e028e65ce1a52180c2eed994b1f321438a23f05a | /trunk/program/src/main.cpp | fc7b233dfaa7143d028be36ca153285bddd7cf9f | [] | no_license | Michacy45/Pobi | 66be59c5c2fe5682c9a21cbb30a285940e0e2e09 | 8bf2c13fa87a8157a7b8894709631c03db89b4cf | refs/heads/master | 2020-04-05T18:54:29.254800 | 2018-12-06T21:23:09 | 2018-12-06T21:23:09 | 157,117,286 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 439 | cpp | main.cpp | #include <iostream>
#include "Client.h"
using namespace std;
int main()
{
/* Client klient1("Michal", "Pesko","123456987");
Client klient2("Adam","Jozwiak","123456789");
//Client *klient3=new Client();
klient1.setAddress("Tranzytowa","5f");
klient1.setRegAddress("Jagienki","9");
klient2.setAddress(... |
1c9184d918833e740698c48f76e3137b1749dde2 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir22441/dir26975/dir27776/file27911.cpp | d0d4ebfece6063a9da86e8728357ae83df04325f | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | file27911.cpp | #ifndef file27911
#error "macro file27911 must be defined"
#endif
static const char* file27911String = "file27911"; |
613c8bc6a7e6d2d987b73b7343eba197ab250e64 | 0efb71923c02367a1194a9b47779e8def49a7b9f | /BFS/BFS/14/phi | 11266aa215accb5d33e5840493caa5bee5dff3dc | [] | no_license | andergsv/blandet | bbff505e8663c7547b5412700f51e3f42f088d78 | f648b164ea066c918e297001a8049dd5e6f786f9 | refs/heads/master | 2021-01-17T13:23:44.372215 | 2016-06-14T21:32:00 | 2016-06-14T21:32:00 | 41,495,450 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 103,036 | phi | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.4.0 |
... | |
4a08cc0ec8d32b0f64dbdcf987399e6c7ea5ce45 | 600df3590cce1fe49b9a96e9ca5b5242884a2a70 | /third_party/skia/src/gpu/vk/GrVkVaryingHandler.cpp | f6fed219557899ae450b8bdeff59c5a5208b6067 | [
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"MIT",
"Apache-2.0",
"BSD-3-Clause"
] | permissive | metux/chromium-suckless | efd087ba4f4070a6caac5bfbfb0f7a4e2f3c438a | 72a05af97787001756bae2511b7985e61498c965 | refs/heads/orig | 2022-12-04T23:53:58.681218 | 2017-04-30T10:59:06 | 2017-04-30T23:35:58 | 89,884,931 | 5 | 3 | BSD-3-Clause | 2022-11-23T20:52:53 | 2017-05-01T00:09:08 | null | UTF-8 | C++ | false | false | 3,058 | cpp | GrVkVaryingHandler.cpp | /*
* Copyright 2016 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "GrVkVaryingHandler.h"
/** Returns the number of locations take up by a given GrSLType. We assume that all
scalar values are 32 bits. */
static inline int grslty... |
ea10ed342bdd1fcac1c3e99dc33b2ab9c136764a | a3010c13c9691c9f9f74187a826779810074b6f8 | /tests/test.cpp | 29ae3a869758775b0476224e78779c77edc0f739 | [] | no_license | zhangjiayin/php-xml2array | 3970766a91dd429b909cd22581101b25124a3d0c | e56a1f9a319991bd650b58119d7729cb106a5e79 | refs/heads/master | 2021-01-10T21:36:37.636438 | 2010-10-14T12:15:45 | 2010-10-14T12:15:45 | 32,119,035 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,025 | cpp | test.cpp | #include <iostream>
#include <libxml/parser.h>
#include <libxml/tree.h>
using namespace std;
int main(int argc,char** argv)
{
xmlDocPtr doc=NULL;
xmlNodePtr cur=NULL;
char* name=NULL;
char* value=NULL;
xmlKeepBlanksDefault (0);
if(argc<2)
{
cout<<"argc must be 2 or above."<<endl;
... |
b8d9588b8e94e448f23f35c94beef8bc2c3ad416 | 5c66adeeeffb82d309368ab106b1b15ad08a6cf9 | /Arrays/find_duplicate.cpp | 883ebdb87343077f3b4add1804a3a900d7214de6 | [] | no_license | akashfit2max/SDE-problems | c0bcf5ebbeb9ffb051e047d748177d841388e2d8 | eb486119157dd078894a83ca5f66aeb09de5df93 | refs/heads/master | 2023-07-15T16:09:36.659020 | 2021-08-14T16:22:05 | 2021-08-14T16:22:05 | 287,676,492 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,764 | cpp | find_duplicate.cpp | /* author : akash kumar */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f first
#define s second
#define ss string
#define mp make_pair
#define map map<int, int>
#define umap unordered_map<int,int>
#define pb push_back
#define p pair<int, int>
#define pp pair<int, p>
#def... |
335d182106972b27e7dfe3bb946388910ee232de | 346cfc9c68d600ce3878b82bf37baf303bba3839 | /ArmorRecognizer0/main.cpp | 8399fb781b5be90066c67b6e072723c6958a4232 | [] | no_license | lf2653/txCV | 54c3528e13f9b77a617032e4859cc5b8d1620429 | ff4c4270966f8a9735f16dfe06059917005b9621 | refs/heads/master | 2021-05-16T05:04:03.033714 | 2017-07-26T01:55:51 | 2017-07-26T01:55:51 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 13,660 | cpp | main.cpp | //#include <pthread.h>
#include <sstream>
#include <stdio.h>
#include <iostream>
#include <opencv2/opencv.hpp>
#include "functions.h"
#include "getConfig.h"
#include "serialsom.h"
//#include "MyQueue.h"
// 宏定义
#define WINNAME "Armor Recognition"
#define WINNAME1 "Binary Image"
#define MaxContourArea 450 // 面积大于该值的轮廓不... |
3eacc7a1d4f067e4b46e7408a632c9713cc79e30 | d089ceceb1fab6c4bb5667c36928be41bf5e4c71 | /robison e nilton - 200616.cpp | 097e8c3e1cbb30197a989f47a44c22cea1d38afc | [
"MIT"
] | permissive | jcvasconcelos/praticando-exercicios-simples-git-c | cffc3bb42a8e7fcc54d0ffa3fc2b7f06433fe5da | 24e7328ff6c6cb452acf2fad1e7a1789e2daaf42 | refs/heads/master | 2022-12-05T08:49:56.614099 | 2020-08-21T01:11:48 | 2020-08-21T01:11:48 | 289,145,538 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 2,773 | cpp | robison e nilton - 200616.cpp | /*
Criar um programa capaz de calcular o tempo entre dois horários quaisquer de um determinado dia.
O programa deve ler dois horários, compostos por três números inteiros, representando horas, minutos e segundos.
O programa deve verificar se o horário é válido(horas entre 0 e 23, minutos entre 0 e 59, e segundos entre... |
762fc0d9fb0abdc19ff4174fde95b58add055eba | 0898b19d8cd27061c04edff03269f4860cc30828 | /Source/combat/ComboSystem.cc | 05ae226af47fa27465824205adf47c04e76efc1e | [] | no_license | aesophor/vigilante | 6194beed07c18f592f926c92d3391e4d84831938 | 44ade83c0c22c785322d30381283ea1ad6cf75f0 | refs/heads/master | 2023-08-08T01:09:00.461867 | 2023-07-30T13:58:29 | 2023-07-30T13:58:29 | 145,686,294 | 75 | 9 | null | null | null | null | UTF-8 | C++ | false | false | 2,134 | cc | ComboSystem.cc | // Copyright (c) 2023 Marco Wang <m.aesophor@gmail.com>. All rights reserved.
#include "ComboSystem.h"
#include <algorithm>
#include "character/Character.h"
#include "input/InputManager.h"
#include "scene/SceneManager.h"
#include "util/Logger.h"
using namespace std;
USING_NS_AX;
namespace vigilante {
namespace {
... |
05713302cd6a53ba08866055190d4fd685f7a31f | 066e9694783d88f78a8ba4d3d15adf541146903b | /Buyukov.Viktor/Laba4/Dinlib/Dinlib.cpp | 100b2d3f3dc9b0981b3c676e5bf49ed58fa8962d | [] | no_license | 953506/css-953506 | e683cc0ed202f4527cdc0fdc18e5d3b30459ee61 | bb6abcf1c3ba31d42fdf65c1f4f690867082d591 | refs/heads/master | 2021-04-13T03:23:08.869753 | 2020-11-29T21:18:08 | 2020-11-29T21:18:08 | 249,132,598 | 6 | 10 | null | 2020-03-22T10:56:03 | 2020-03-22T07:16:39 | C# | UTF-8 | C++ | false | false | 264 | cpp | Dinlib.cpp | #include "pch.h"
#include <math.h>
#include "Dinlib.h"
int __stdcall Sum(int a, int b) {
return a + b;
}
int __stdcall Diff(int a, int b) {
return a - b;
}
int __cdecl stepen(int a, int b) {
int i = 1;
for (int r = 1; r <= b; r++)
i *= a;
return i;
}
|
d2d2484f6794665285634c1836fe991563f4b104 | 486c7e8a16a1d5419bc7a385dd4d043558ee04ef | /VmpcPlugin/Source/ThirdParty/include/ctoot/src/audio/delay/PhaserProcess.hpp | 510c0b915778d4246b29a4020bd21c9f0cb63385 | [] | no_license | izzyreal/vmpc-unreal-plugin | 73751fcd825ffe777fd08c7b651ef374aeb7c2fa | 338ae3373956b88473d804ca75f081a756382f11 | refs/heads/master | 2023-04-11T02:24:46.902201 | 2021-04-28T20:39:10 | 2021-04-28T20:39:10 | 113,060,206 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 744 | hpp | PhaserProcess.hpp | #pragma once
#include <audio/core/SimpleAudioProcess.hpp>
#include <vector>
namespace ctoot {
namespace audio {
namespace delay {
class AllPass;
class PhaserProcessVariables;
class PhaserProcess
: public ctoot::audio::core::SimpleAudioProcess
{
public:
float a1{};
... |
2951b8542bdf37359152d6733a78edcaee72b005 | 2ee2e84625b1705d724177cc8674e29e0fcc0010 | /Shader.h | 4bf4a158b8fdd781b247c1783e80b08eaf7a2d0c | [] | no_license | ThatMathsyBardGuy/CubeMarchTerrain | 70f4091c09d1b00a762858ad063ab2dab38375a0 | 733d60fc090558788cdb4303125033078eb8d5ad | refs/heads/master | 2023-06-04T09:00:19.471171 | 2020-02-11T10:17:12 | 2020-02-11T10:17:12 | 237,242,577 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 728 | h | Shader.h | #pragma once
#include <GL/glew.h>
#include <string>
namespace rendering {
enum ShaderStages {
VERTEX, FRAGMENT, GEOMETRY, MAX_STAGES
};
class Shader {
public:
Shader();
Shader(const char* vertexsource, const char* fragmentsource);
Shader(std::string vertexfile, std::string fragmentfile);
Shader(std::s... |
1c72dcf4ee17419723b5365b15e7290334b2029e | 3e868ee4683bae403cf6d9bfdddce0750a30ebb9 | /main.cpp | 1034997a5fcf103095c5b6ca5c075825c2c75fac | [] | no_license | mustiian/Palindrome | e8cf022386c5304378afd67ee067c58ff5942692 | 729738caae7e39ae9fd4e19d970a10371b49c3a7 | refs/heads/master | 2020-04-10T09:24:22.976993 | 2019-04-24T18:14:58 | 2019-04-24T18:14:58 | 160,935,296 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,879 | cpp | main.cpp | #include <iostream>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_POSITION = 500;
class TTon{
public:
TTon ( int pos ) : m_Position( pos )
{ }
void InsertNeighbour (int neighbour, char ton){
m_Neighbours.insert( {neighbour, ton} );
}
... |
5aa8f229c4e14c3ba64fdf286a793f3faa447030 | 2b39d6f15cb85690c8e6e5c086362916a7df01bd | /src/asp/GUI/GuiBase.h | d1d796bba5f3ca496d9d361d7ee93d449372f070 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | NeoGeographyToolkit/StereoPipeline | 3649ba23fb5a07a8e3f13811a21ba12e0bd6c70a | 80ba3b2a1fc4d5acbd47621ba117852fef6687bf | refs/heads/master | 2023-08-31T02:28:40.247866 | 2023-08-27T03:06:35 | 2023-08-27T03:06:35 | 714,891 | 414 | 124 | Apache-2.0 | 2023-03-09T03:10:29 | 2010-06-11T02:11:55 | C++ | UTF-8 | C++ | false | false | 1,078 | h | GuiBase.h | // __BEGIN_LICENSE__
// Copyright (c) 2006-2013, United States Government as represented by the
// Administrator of the National Aeronautics and Space Administration. All
// rights reserved.
//
// The NGT platform is licensed under the Apache License, Version 2.0 (the
// "License"); you may not use this file excep... |
4ba929d186544ef04fa22045a3fc7fe58bca3f37 | 0ed4839cf0d78545b5693b9df079c3ffb0675059 | /二分专题/LeetCode-275.cpp | b10104f64edd498659a1d10f50fa8859f69bdd7b | [] | no_license | liuhycn/leetcode_exercise | 2fc50d8d2a329e70c8e09d5bb74d70ee11a6a9cf | 6536cc5044d4380e2b427ef75e84572f3a02c8bb | refs/heads/master | 2020-05-01T11:21:14.557593 | 2019-08-04T07:08:34 | 2019-08-04T07:08:34 | 177,440,696 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 615 | cpp | LeetCode-275.cpp | class Solution {
public:
int hIndex(vector<int>& nums) {
if (nums.empty()) return 0;
int l = 0;
int r = nums.size() - 1;
int n = nums.size();
while (l < r)
{
int mid = l + r >> 1;
if (nums[mid] >= n - mid)
r = mid;
e... |
aeeccce940cd82863c9a9725dfa83cebded84176 | 49287a1da270671e99b8db8f7ffac9c4f8e2b118 | /Vicky's/customerchoosestore.cpp | 5695bda8feea350aa0c8d913481b3f4e4c86935a | [] | no_license | kchang8/cpsc462-bobapp-project | 18520b950bfe78896ef833d6657b8f206c63c2b1 | 37d683515ff64205ea193d2192080c10ed8b2747 | refs/heads/master | 2020-08-05T08:10:58.515010 | 2019-12-11T20:32:26 | 2019-12-11T20:32:26 | 212,459,523 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 819 | cpp | customerchoosestore.cpp | #include "customerchoosestore.h"
#include "ui_customerchoosestore.h"
#include <QPixmap>
customerChooseStore::customerChooseStore(QWidget *parent) :
QDialog(parent),
ui(new Ui::customerChooseStore)
{
//Background
ui->setupUi(this);
QPixmap bkgrn("C:/Users/admin/Desktop/bobappBackground.PNG... |
2fa35f7cce1e6aee9305caeb98759a2170be742d | a63d60c270433e84398f6be4642feb7643c0c8b0 | /USACO/USACO 2016-2017/Plat/Dec 2016/triangles.cpp | 2946c682555e0e50aaa9c324a53dad2e6057ff97 | [] | no_license | luciocf/Problems | 70a97784c17a106cb9e0f0ec28ac57cf58fea8c7 | 19f6000e9e6a5fe483ad4bb17e9ba50644ac954a | refs/heads/master | 2023-08-21T10:54:18.574403 | 2021-10-29T03:45:16 | 2021-10-29T03:45:16 | 169,012,579 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,412 | cpp | triangles.cpp | // USACO 2016/2017 - Lots of Triangles
// Lúcio Cardoso
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int, int> pt;
typedef long long ll;
const int maxn = 310;
pt p[maxn];
int ans[maxn][maxn][maxn];
int final[maxn];
pt operator- (const pt &x, const pt &y)
{
return... |
45d68d60f4a67bc4d693e484f70056fb347e9d27 | f6b4b97930c9c85e406d60043b2f7a2620ab081f | /Server.cpp | d43fd6807c7be4d8232b6f5b627e9c077c086d89 | [] | no_license | DaronP/ChatSistos | 387bd0ec893f44c982ef06d7792580c522a1dc7d | 3a2ae2dcc41849fb4be444dac8696df17d70e486 | refs/heads/master | 2022-04-24T10:01:33.669821 | 2020-04-23T08:06:56 | 2020-04-23T08:06:56 | 258,041,718 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,643 | cpp | Server.cpp | #include <iostream>
#include <string>
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <netdb.h>
#include <sys/uio.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <fcntl.h>
#inclu... |
d46147f83475a3ef22f3d126031f20f5bea34540 | 9841347922e22ddd21a20d187c597d3746ff9b4b | /number_theory/furui.cpp | cc8f64ba03f2926678b818bdecbf17f8f36c0a70 | [] | no_license | takumi-fukunaga/Atcoder_log | 99d1c87a5e8bcf093ae6eec59743ef7dab429ac0 | 026995cefe871cbe4f21850911036dc45f896812 | refs/heads/main | 2023-07-24T05:59:32.900465 | 2021-08-27T14:17:08 | 2021-08-27T14:17:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 409 | cpp | furui.cpp | /*
スニペット
エラトステネスの篩
*/
bool prime[1000010];
void furui() {
prime[0]=true;
prime[1]=true;
int i = 2;
while (i <= 1000000) {
int j = 2;
while (j*j <= i && !prime[i]) {
if (i%j == 0) {
prime[i] = true;
break;
}
else j++;
}
int z = 2;
while (!prime[i]) {
if (i*z <= 1000000) {
pr... |
1cf8f6a71b1094bbc4cd51c9fb97004178c44823 | cfc99437b085afa7304ed5a4eab2a90072c7e50e | /pintools/source/tools/Utils/runnable.h | 952727316ed2c41d44ff384ae98e1fabb417eda2 | [
"MIT",
"LicenseRef-scancode-proprietary-license",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | moraispgsi/pin-bootstrap | 95498b63f88c311e4fe446259214266130aece3f | 7315b4e1709f63f018781456f9c745fc6f020f22 | refs/heads/master | 2021-09-07T18:09:11.568374 | 2018-02-27T05:16:32 | 2018-02-27T05:16:32 | 122,972,429 | 0 | 1 | MIT | 2018-02-26T14:31:18 | 2018-02-26T13:17:08 | C++ | UTF-8 | C++ | false | false | 4,579 | h | runnable.h | /*BEGIN_LEGAL
Intel Open Source License
Copyright (c) 2002-2017 Intel Corporation. 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 noti... |
cfcb4a676029f661da42f1515d260da905a7eac3 | 9bfad29a2deedc5850530e129f6abafc98f64961 | /Model_Widget_w_FileReaderClass/filereader.h | 6d1e9d97e98ab984f8e134ed62900a4c20deef3e | [] | no_license | alex-adam/Task | cca3f28d6315f09b50466ccd1a7d76f283748963 | 9603d1d12c318842b237823978bda11edb373af1 | refs/heads/master | 2020-06-05T09:38:18.525867 | 2015-09-16T00:36:46 | 2015-09-16T00:36:46 | 42,554,222 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 240 | h | filereader.h | #ifndef FILEREADER_H
#define FILEREADER_H
#include <QString>
#include <filemodel.h>
class FileReader
{
public:
FileReader();
void fill_model(QString path);
FileModel model_;
signals:
public slots:
};
#endif // FILEREADER_H
|
74946085d287a8bfb1a9fed6d3fab466090fe080 | bddb40149f9028297d9b4f3f6b77514cadac9bca | /Source/FRC_Source/WindRiver/2011/FRC_2011/FRC2011_Robot.h | f1ab7f195439d8f88b4ca863d49353c22d4199e1 | [] | no_license | JamesTerm/GremlinGames | 91d61a50d0926b8e95cad21053ba2cf6c3316003 | fd0366af007bff8cffe4941b4bb5bb16948a8c66 | refs/heads/master | 2021-10-20T21:15:53.121770 | 2019-03-01T15:45:58 | 2019-03-01T15:45:58 | 173,261,435 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,349 | h | FRC2011_Robot.h | #pragma once
class FRC_2011_Control_Interface : public Tank_Drive_Control_Interface,
public Robot_Control_Interface,
public Arm_Control_Interface
{
public:
//This is primarily used for updates to dashboard and driver station during a test build
virtual void Robot_Control_TimeChange(double d... |
7f6a1ed4f1b4fc9bc46111cb2d6af399ec8f79ba | 570150546b2c2ba928074c362cb0211dfe92b215 | /.vs/Love Babbar Sheet/Queue/tut11.cpp | 54de0edad1b8c4b4d6535e0e6e2f84ef54c9c838 | [] | no_license | gutaussehend-Harshal/CPP-and-DSA-practice-questions | 391782ce20a3c1b9ab69d651482518694fabff31 | 0d6c4500ecad6295683c9c2753482e74131b443c | refs/heads/main | 2023-07-18T05:48:24.158391 | 2021-09-05T04:36:43 | 2021-09-05T04:36:43 | 403,214,869 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 560 | cpp | tut11.cpp | #include <bits/stdc++.h>
using namespace std;
// Reverse sentence using stack -->
void reverseSentence(string s)
{
stack<string> st;
for (int i = 0; i < s.length(); i++)
{
string result = "";
while (s[i] != ' ' && i < s.length())
{
result += s[i];
i++;
... |
682a0cd35be4a76d0b7e3bf4258025d77ee9b99e | 86bc88eafbce6f933c42910c1ba43eac926c0534 | /battledialog.h | 40bd7e6071030c34de2167a8fdcc112032e0c303 | [] | no_license | gagrigoryan/qt_practice | fe3709cbc27ca79a420fee82bd4d56d9ae659622 | 850e6f77c42979192d5d2702e365a889fafdafa3 | refs/heads/master | 2022-11-18T09:18:28.392287 | 2020-06-28T17:54:47 | 2020-06-28T17:54:47 | 275,585,814 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 596 | h | battledialog.h | #ifndef BATTLEDIALOG_H
#define BATTLEDIALOG_H
#include <QDialog>
#include <QMessageBox>
#include "battle.h"
namespace Ui {
class BattleDialog;
}
class BattleDialog : public QDialog
{
Q_OBJECT
public:
explicit BattleDialog(Battle *battle, QWidget *parent = nullptr);
~BattleDialog();
public slots:
v... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.