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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
57bfa6c6ec329c3cd3c8e26cf8b2fae788518c3f | b62dbabb72f3e6a8ad5d7831f7a8e836962c820d | /HelicityLikelihoodDiscriminant/HelicityLikelihoodDiscriminant.cc | 33fa63f35735b44616e5b1c15c6ee411ebf26d0f | [] | no_license | amarini/pandolf | 53465357b74a300f66a8dd0107e399c53ac06e22 | d0820d62c922e00a8e02ea46da3765180b2682c9 | refs/heads/master | 2016-09-10T09:05:53.910922 | 2013-07-05T15:29:01 | 2013-07-05T15:29:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,940 | cc | HelicityLikelihoodDiscriminant.cc | #include "HelicityLikelihoodDiscriminant.h"
//using namespace RooFit;
HelicityLikelihoodDiscriminant::HelicityLikelihoodDiscriminant():
mzz(0.0),
costheta1( 0.0 ),
costheta2( 0.0 ),
costhetastar(0.0 ),
phi( 0.0 ),
phistar1( 0.0 )
{
parfilename_="./ParametersPDF.txt";
//
NVARS=6;
initBkgdPDFs();
... |
4f34af6b991df50430e791925acf15a39a36555f | d0c97d1c64bbdf6b9a231ad5b0bdb87d34182815 | /include/data/net/session.hpp | 8293f4b14c934a0de6c97a3ee87e3ef3ca3f46c6 | [] | no_license | DanielKrawisz/data | 2c7130d25fbb2b56ee249c8ca3205bae349f305a | 718d38bb17695547420f922471b8f1459ae4bcd7 | refs/heads/production | 2023-08-09T15:25:25.913713 | 2023-07-28T23:41:49 | 2023-07-29T00:29:14 | 164,427,457 | 10 | 9 | null | 2023-07-29T00:29:15 | 2019-01-07T12:10:39 | C++ | UTF-8 | C++ | false | false | 1,029 | hpp | session.hpp | // Copyright (c) 2021 Daniel Krawisz
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef DATA_NET_SESSION
#define DATA_NET_SESSION
#include <data/types.hpp>
namespace data::net {
// A basic session type. Not every ses... |
6af045eb36b28e41ee91f41d4dddf1880bf9deba | 445b355e3d407564073a4c335ca0e5f864ef0c2b | /AOList.h | 44c1f75dd97509d877a40cd0e9cdbe1add74138c | [] | no_license | RomanHale/cs260-wk4 | 3730a5e2c11b9efa2d24fed2293c0fe538fa0a2e | ccd9c36f03409229c350e08a2379bb48b19fa2a3 | refs/heads/main | 2023-02-23T18:41:30.496997 | 2021-02-01T19:09:45 | 2021-02-01T19:09:45 | 335,054,964 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 193 | h | AOList.h | #include "AOList_node.h"
class AOList {
private:
node *top;
public:
AOList();
void add(int new_value, int position);
int remove(int position);
int peek(int position);
}; |
caa52e09bf788dd6e79000a7df821ed7047c7ff2 | 2e5c33f159adf150b67ef1b19f14607d2d11f1fe | /include/aeongames/Texture.h | edace0573df779895d0b5dbb2073b5050ac50d05 | [
"Apache-2.0"
] | permissive | AeonGames/AeonEngine | 29fedf6dcba2548e594ec067f99c834d8f975f27 | 2cdbf540227c1c4bbf4d893145627564dbb2a8a3 | refs/heads/master | 2023-07-22T01:35:42.972067 | 2023-07-19T01:47:20 | 2023-07-19T01:47:20 | 54,066,866 | 17 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,791 | h | Texture.h | /*
Copyright (C) 2016-2021 Rodrigo Jose Hernandez Cordoba
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to ... |
c9bafe6482007b0085c65816621171c613ab60f2 | 34698d07825471010a55b71059287ca428880d6d | /OSHW/OSHW/소스.cpp | de557346a06bdfb29412195c68cb6eda2bd1bf9c | [] | no_license | jychoi130/Problem_Solve_project | 890429fabb5ccfd9704b5718df4dddb5924e7eb0 | ed6ebf26926eaeb2e9f32de0db284ce1ea25ff96 | refs/heads/main | 2023-03-24T22:11:05.189795 | 2021-03-24T04:28:55 | 2021-03-24T04:28:55 | 350,942,574 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 306 | cpp | 소스.cpp | #include<iostream>
using namespace std;
int main()
{
int prime,check=1;
cin >> prime;
cout << "prime: 2";
for (int i = 3; i < prime; i++)
{
for (int j = 2; j <i; j++)
{
check = 1;
if (i%j == 0)
{
check = 0;
break;
}
}
if (check = 1)
cout << " " << i;
}
cout << endl;
} |
acf9289da249229f9c73d89c41750e84653f95cc | 2b9a69bb87049f15460547c9a140d532a00747ad | /user/sniff_thread.h | 4228116d193a9fded71e78dee4eb813410d11fca | [] | no_license | zhang35/VMM-Monitor | ed052c7befe2c9bf734781cbe34a14d3a841df4a | 6f6024b8af0394410f170f078566bf37e2a9ad5b | refs/heads/master | 2020-04-10T00:04:55.907708 | 2018-12-06T13:03:11 | 2018-12-06T13:03:11 | 160,675,155 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 338 | h | sniff_thread.h | #ifndef SNIFF_THREAD_H
#define SNIFF_THREAD_H
#include <QThread>
#include "my_packet.h"
class sniff_thread : public QThread
{
Q_OBJECT
public:
explicit sniff_thread(QObject *parent = 0);
void run();
void stop();
volatile bool stoprun;
signals:
public slots:
};
#endif /... |
e1e0b32b72de08a2d7133f7492778d20ea167790 | 9e409a0a4333c376059ef795a336ef580c1ded20 | /codeforces/contest/1159/a/54093567.cpp | dad5ba551cd20d2645ca935c85febdd0852069b5 | [] | no_license | hobby10/problems-solution | 569d4f52f7fe5d437c91041f5f6b9247c70915b1 | f35fb13a34f32b789e707b854eb0778c2c3c8484 | refs/heads/master | 2023-06-14T13:21:38.941953 | 2021-07-07T13:42:04 | 2021-07-07T13:42:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 712 | cpp | 54093567.cpp | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e2 + 9;
void debug() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
#endif
}
char arr[N];
int main... |
7ad7355bf5698f6e01ed327029144abdb52e8ff9 | 2dde1215b3c5b13d2c1e4bca05920cfe9d1d2060 | /15/ex5.cpp | b5e06c6b85205e7ab10b917762dfff6966e039ee | [] | no_license | rengdjim/Programming-Principles-and-Practice-Using-C- | a9938a84197d0d54fc0e2072e52791f7b9513f52 | d60c494318306aa56e6560125d4ab69f96a27f4f | refs/heads/master | 2023-03-16T05:48:35.347966 | 2019-01-14T02:15:47 | 2019-01-14T02:15:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,194 | cpp | ex5.cpp | /* Chapter 15 Exercise 5
“Animate” (as in §15.5) the series 1–1/3+1/5–1/7+1/9–1/11+ . . . . It is known as Leibniz’s series and converges to pi/4.
*/
#include "../14/14.h"
#include "15.h"
using namespace Graph_lib;
constexpr int x_size = 800;
constexpr int y_size = 600;
constexpr double r1 = 0;
constexpr double r2 =... |
15263c0090f3ca66c2dd5efd544dffbfa91eaf44 | 2b80dd12a0a49cb1647d9cbe79f20e659504e5ed | /FluidSimulation/SphContainer.cpp | 207c0fe8e8a8bc25961e8340b1ed61a7c8146159 | [] | no_license | Banteu/FluidSimulation | 6951c891e6c35283f6795cf6465c7e268185cb07 | 17e997dc5ab86d6425044afa53329f810891b696 | refs/heads/master | 2021-01-10T19:14:07.284984 | 2015-04-15T15:33:54 | 2015-04-15T15:33:54 | 32,821,993 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,158 | cpp | SphContainer.cpp | #include "SphContainer.h"
#include <time.h>
float MPI = acos(-1.0);
SphContainer::SphContainer(float x, float y, float z, float w, float l, float h)
{
containerDrawVertex = new vec3[24];
containerDrawIndex = new uint[24];
float dx = x + w / 2;
float dxm = x - w / 2;
float dy = y + l / 2;
... |
77f2d16820a9a43e293263f5ebccd05474c76245 | 0b69a011c9ffee099841c140be95ed93c704fb07 | /problemsets/SPOJ/SPOJ/GNY07A.cpp | bbbae9f67e3106f06eff860c03d32bb03269dd00 | [
"Apache-2.0"
] | permissive | juarezpaulino/coderemite | 4bd03f4f2780eb6013f07c396ba16aa7dbbceea8 | a4649d3f3a89d234457032d14a6646b3af339ac1 | refs/heads/main | 2023-01-31T11:35:19.779668 | 2020-12-18T01:33:46 | 2020-12-18T01:33:46 | 320,931,351 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 397 | cpp | GNY07A.cpp | /**
*
* Author: Juarez Paulino(coderemite)
* Email: juarez.paulino@gmail.com
*
*/
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
string S;
int M;
cin >> M >> S;
S.erase(S.begin... |
a7c7dd6bf86a7fcf84f8bd84385e2e73bde97b7d | 2b076d99088d1aae905a1cc8597586deb168881a | /compare triplet/comparetriplet.cpp | e823cf53e8642d6cae09c6a5ad3a55acc97e359a | [] | no_license | harryp0/programming | d75876eeceb47c167b52af783c52d425e151a2e3 | 07ad40712545b4a6d0acad8bf284ae261b1b1155 | refs/heads/master | 2020-07-21T17:37:29.648921 | 2019-09-02T16:14:20 | 2019-09-02T16:14:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 441 | cpp | comparetriplet.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int i,alice=0,bob=0,num;
int a[3],b[3];
for(i=0;i<3;i++)
cin>>a[i];
for(i=0;i<3;i++)
cin>>b[i];
for(i=0;i<3;i++)
{
if(a[i]>b[i])
alice=alice+1;
else if(a[i]<b[i])
bob=bob+1;
else
... |
e5bfb0d0fdac25c5e3f57e2ef59ee317ab9064f7 | a8e5517df264ca12e84c377270574a3cc378f0c1 | /BOJ/10305/solution.cpp | 539f7751bd13a0e692e52ea45c0601e015fab357 | [] | no_license | wowoto9772/Hungry-Algorithm | cb94edc0d8a4a3518dd1996feafada9774767ff0 | 4be3d0e2f07d01e55653c277870d93b73ec917de | refs/heads/master | 2021-05-04T23:28:12.443915 | 2019-08-11T08:11:39 | 2019-08-11T08:11:39 | 64,544,872 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 815 | cpp | solution.cpp | #include <cstdio>
using namespace std;
int main(){
int t;
scanf("%d", &t);
while(t--){
int ans = -1, cmp = 0;
int l = 1, r = 1;
int x, y;
int n;
scanf("%d", &n);
for(int i=1; i<n; i++){
int e;
scanf("%d", &e);
... |
4d24658967d88eb066547324f94e1cd4e0603586 | de80b91a12b10bd962b59a89b2badbb83a0193da | /ClientProject/Mof/RatchetNClankCopy/RatchetApplication/Component/Player/PlayerIdleComponent.h | daf08dabedb7699712d97f828bd0ee9c0e070de6 | [
"MIT"
] | permissive | OIC-Shinchaemin/RatchetNclank-PrivateCopy | 8845eea799b3346646c8c93435c0149e842dede8 | e2e646e89ef3c29d474a503f5ca80405c4c676c9 | refs/heads/main | 2023-08-15T06:36:05.244293 | 2021-10-08T00:34:48 | 2021-10-08T00:34:48 | 350,923,064 | 0 | 0 | MIT | 2021-10-06T11:05:03 | 2021-03-24T02:35:36 | C++ | SHIFT_JIS | C++ | false | false | 2,297 | h | PlayerIdleComponent.h | #ifndef RATCHET_COMPONENT_PLAYER_ACTION_PLAYER_IDLE_COMPONENT_H
#define RATCHET_COMPONENT_PLAYER_ACTION_PLAYER_IDLE_COMPONENT_H
#include "PlayerActionComponent.h"
namespace ratchet::component::player { class PlayerComponent; }
namespace ratchet::component::player::action {
class PlayerIdleComponent :
public ::... |
cfb131919fe184e43bbd914df27bacea54c33e89 | 969a3f74a957b7fa3685ac5ae5f94ac225af9522 | /Common/DataModel/Testing/Cxx/TestInformationDataObjectKey.cxx | 712bceaf93016caceac2c259ef1e97edc3f7aeb5 | [
"BSD-3-Clause"
] | permissive | gview/VTK | 61adbce5b78e0fdf8069e2384c0fc1899a723df5 | 17c664f1c3bdb84997aa2c9bfdf51ba77171672e | refs/heads/master | 2023-06-01T11:56:23.857210 | 2023-05-30T04:01:23 | 2023-05-30T04:01:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,510 | cxx | TestInformationDataObjectKey.cxx | /*=========================================================================
Program: Visualization Toolkit
Module: TestInformationDataObjectKey.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
T... |
5262cada5369ddffb1a9562ed9fcd76d79ae7ea1 | 1a8ea057ae862c3dfd525abda7ef5285ed1b0c0e | /ShortestPath.cpp | 8e205dbfd7365d9e6b18ab4c13ccd137eb710878 | [] | no_license | pareshbhambhani/Graph-Shortest-Path | b6ece93ae94f13b46aa9728f301905f93db3992c | cf7ade333c4c5b717844a94f44f3bf0fe0fafcc1 | refs/heads/master | 2021-01-21T21:14:24.087920 | 2017-05-25T18:42:34 | 2017-05-25T18:42:34 | 92,319,118 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,652 | cpp | ShortestPath.cpp | // -----------------------------------------------------------------------
/**
File: ShortestPath.cpp
Author: Paresh B.
Web: pareshbhambhani.github.io
Description: Implementation file for ShortestPath Header file
**/
#include "ShortestPath.hpp"
ShortestPath::ShortestPath(UndirectedGraph &graph, int... |
07bcffa7937e47d2a78999649ef413f0467ca306 | c655e509c3840af49fae65214e3cb00a06b028ba | /detectors/CascadeClassifierDetector.hpp | 49e0114b3c2d55477f36430788e9cdf44c5399f6 | [] | no_license | pdiasalmeida/objectDetector | 043326ae9979d27e2ff087464de246bd723db222 | a1b29c07c9e25fb441963274a752193039959de7 | refs/heads/master | 2021-01-23T20:21:59.630642 | 2015-03-11T13:14:57 | 2015-03-11T13:14:57 | 24,840,853 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 990 | hpp | CascadeClassifierDetector.hpp | #ifndef CASCADECLASSIFIERDETECTOR_HPP_
#define CASCADECLASSIFIERDETECTOR_HPP_
#include "Detector.hpp"
#include "../libs/rapidxml/rapidxml.hpp"
#include <opencv2/core/core.hpp>
#include <opencv2/objdetect/objdetect.hpp>
class CascadeClassifierDetector : Detector
{
public:
CascadeClassifierDetector( std::string name,... |
42c75e25d2d7786272497b82403762d7652a37a6 | 04101fb4c49840c54d314b44ecdfbacaea99d9ec | /test_222/test_222/main.cpp | 8a08c05dc73a6e762a36f02a2f66b5ddff155c28 | [] | no_license | lantian-fz/test_cpp | b3e14da51e84876a20244f3693364e66e47b904d | 8b0a776be3b00591f08deca9b208130ccdbedb8c | refs/heads/master | 2021-07-16T00:25:39.257501 | 2020-10-17T08:07:14 | 2020-10-17T08:07:14 | 216,210,039 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,381 | cpp | main.cpp | #define _CRT_SECURE_NO_WARNINGS 1
//力扣-反转字符串中的单词 III
//给定一个字符串，你需要反转字符串中每个单词的字符顺序，同时仍保留空格和单词的初始顺序。
//
//输入 : "Let's take LeetCode contest"
//输出 : "s'teL ekat edoCteeL tsetnoc"
//注意：在字符串中，每个单词由单个空格分隔，并且字符串中不会有任何额外的空格。
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string reverseWords(s... |
bb44c5750608ad56b33b87c4848fa0316a3ad2d5 | 8649eeec7e766f693e8a1926d3c6ab48bf94218b | /Calculator.ino | 71ecc765039758f2ae8b5b862b48b2d7da09c8c7 | [] | no_license | daniel-tsonkov/ArduinoGSM | 21f778109e3c690dcf9b383aa072840ca409d683 | dd5279313f563d37f9859af4a26115f9f58c558b | refs/heads/master | 2021-01-10T12:47:46.928206 | 2015-11-21T18:16:38 | 2015-11-21T18:16:38 | 46,623,540 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,107 | ino | Calculator.ino | void cal(){
calculatorFirstNumber = 0;
calculatorSecondNumber = 0;
calculatorResult = 0;
calculatorOperation = 0;
calculatorDigits = 0;
myGLCD.clrScr();
menuClock();
colorTextWhite();
myGLCD.drawRect(1, 24, 478, 105);
myGLCD.setFont(SevenSegNumFont);
colorTextBackBlack();
colorTextWhite... |
b1fb6ebe332f1d51a984f0ce82689773e05116b1 | 32ffee400604bf821858eaf9cd8cfc65926e2bc1 | /libmamba/src/core/repo.cpp | 78e8a32bf6a931fe07abf9a34772cff71837b78a | [
"BSD-3-Clause"
] | permissive | mamba-org/mamba | ebabfe45c866f7d812a8dddbcc6814e40c96b9b2 | 319f0553f5036cc74cb7919f6ecadc784cb6c187 | refs/heads/main | 2023-08-31T05:00:08.103215 | 2023-08-29T14:35:10 | 2023-08-29T14:35:10 | 173,947,939 | 4,478 | 292 | BSD-3-Clause | 2023-09-14T10:14:10 | 2019-03-05T13:05:10 | C++ | UTF-8 | C++ | false | false | 11,758 | cpp | repo.cpp | // Copyright (c) 2019, QuantStack and Mamba Contributors
//
// Distributed under the terms of the BSD 3-Clause License.
//
// The full license is in the file LICENSE, distributed with this software.
#include <algorithm>
#include <array>
#include <tuple>
#include <nlohmann/json.hpp>
#include <solv/repo.h>
#include <so... |
f0765dac0b7ce485f465c695c73b066af14e3d5e | ab12dfc50ccf3476c594955ff431ea54be3e6950 | /include/ctag/filtration_factory.h | c675145b3192794080491992b18e60acb0f8d182 | [] | no_license | compTAG/reconstruction | dc18763bf70a2bb1b87513dee3d65c6934d3fd31 | d9fd6109cc048f0fdb96f157866475e26e00a28e | refs/heads/master | 2020-03-25T06:00:05.412755 | 2019-10-04T19:17:57 | 2019-10-04T19:17:57 | 143,478,070 | 1 | 0 | null | 2019-10-04T19:17:58 | 2018-08-03T22:20:52 | C++ | UTF-8 | C++ | false | false | 1,219 | h | filtration_factory.h | #ifndef _FILTRATION_FACTORY_H_
#define _FILTRATION_FACTORY_H_
namespace ctag {
template<typename FilterFunction_, typename Filtration_>
class FiltrationFactory {
public:
typedef FilterFunction_ FilterFunction;
typedef typename FilterFunction::Simplex Simplex;
typedef Filtration_ Filtration;
private:
... |
64a24ae205dd6553159e48181ee192e86dd4ce83 | c485fdae8bb027549c648e49c55926f32c7b9b3f | /core/apps/experience_builder.cpp | 6fe91c0fd6b5b2e061988c31971881b3bfea5306 | [] | no_license | jbasu2013/L3 | 74468d450ee55e39f72413cfee9b3990cfec682e | 9edd3414019300043db05d88fb53be3b9358ea44 | refs/heads/master | 2022-06-30T02:39:35.672928 | 2020-05-14T22:46:02 | 2020-05-14T23:01:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 879 | cpp | experience_builder.cpp | #include <sstream>
#include "L3.h"
int main( int argc, char** argv )
{
if ( argc < 4 )
{
std::cerr << "Usage: " << argv[0] << " <char::dataset> <float::start_time> <float::end_time>" << std::endl;
exit( EXIT_FAILURE );
}
char* dataset_directory = argv[1];
/*
* L3
*/
L3::Dataset dataset( d... |
724967db30f99741887cb9f877883897f9b9c84d | e8ba1d3ee4b0307b446432b25141b0cd13a85b39 | /dfs_short.cpp | d2e77a49521502d98396cca147584223d72a257c | [] | no_license | ThongVoHien/algorithm | 1642088da700ac7a61e76aa94f58b7cac6914862 | 6a790a5ad00a36882ec96e9c8116ab0a70004a23 | refs/heads/master | 2021-06-03T07:22:33.078396 | 2021-04-22T20:10:22 | 2021-04-22T20:10:22 | 150,565,738 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,347 | cpp | dfs_short.cpp | #include <cstdio>
#include <cstring>
#include <cctype>
#include <cmath>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <utility>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
#inclu... |
97db4259f40bf6b88e01b4e8c20c0ce13798caeb | 45874c847c5a2fc4e89e05a7fc8ad9b63d8c4860 | /sycl/source/detail/global_handler.cpp | a03d6a03b54e956c406f7f43b85d730f0453fd20 | [
"LicenseRef-scancode-unknown-license-reference",
"NCSA",
"LLVM-exception",
"Apache-2.0"
] | permissive | intel/llvm | 2f023cefec793a248d8a237267410f5e288116c5 | a3d10cf63ddbdcc23712c45afd1b6b0a2ff5b190 | refs/heads/sycl | 2023-08-24T18:53:49.800759 | 2023-08-24T17:38:35 | 2023-08-24T17:38:35 | 166,008,577 | 1,050 | 735 | NOASSERTION | 2023-09-14T20:35:07 | 2019-01-16T09:05:33 | null | UTF-8 | C++ | false | false | 12,826 | cpp | global_handler.cpp | //==--------- global_handler.cpp --- Global objects handler ----------------==//
//
// 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
//
//===---------------------------... |
d89be6df46338ae1a2cce4d344d989a679cd5f12 | 5a8fafefd7712b3730b27c5907ca8f54b567e328 | /neb/inc/com/centreon/engine/nebstructs.hh | 6aa60e5b95bab530a87adc80d2c5710e5b93c928 | [
"Apache-2.0"
] | permissive | joe4568/centreon-broker | 672d831389c17f92f09948704437c4bc9026998d | daf454371520989573c810be1f6dfca40979a75d | refs/heads/master | 2020-04-13T05:11:03.126655 | 2018-12-24T14:53:34 | 2018-12-24T14:53:34 | 162,984,149 | 0 | 0 | Apache-2.0 | 2018-12-24T11:33:05 | 2018-12-24T11:33:04 | null | UTF-8 | C++ | false | false | 16,540 | hh | nebstructs.hh | /*
** Copyright 2003-2007 Ethan Galstad
** Copyright 2011-2013 Merethis
**
** This file is part of Centreon Engine.
**
** Centreon Engine is free software: you can redistribute it and/or
** modify it under the terms of the GNU General Public License version 2
** as published by the Free Software Foundation.
**
** Centr... |
acfa2de63581701ee45fa3bf96f5c48bac3dcb41 | 0e40a0486826825c2c8adba9a538e16ad3efafaf | /S3DAPI/HookDirect3D9.h | 62c9f36c72860c4685c7437adb2a3cec3ac3fae6 | [
"MIT"
] | permissive | iraqigeek/iZ3D | 4c45e69a6e476ad434d5477f21f5b5eb48336727 | ced8b3a4b0a152d0177f2e94008918efc76935d5 | refs/heads/master | 2023-05-25T19:04:06.082744 | 2020-12-28T03:27:55 | 2020-12-28T03:27:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,306 | h | HookDirect3D9.h | #pragma once
#include <d3d9.h>
template<typename Signature, Signature>
struct function_offset;
#ifndef REGISTER_FUNCTION_OFFSET
#define REGISTER_FUNCTION_OFFSET(Func, Offset) template<> struct function_offset<decltype(Func), Func> { static const int value = Offset; };
#endif
REGISTER_FUNCTION_OFFSET(&IDirect3D9::Que... |
70dac4a7a90be0a76b2e488a0585986a367fd77f | 43f6f1bea42500a3f451c7067d757719366766e4 | /Cart/Arduino/Driver/Driver.ino | 0928d06d61564dc1d1251fbcacec8b454c0efa7f | [] | no_license | nonguyen1/HHack | fa81b4d0b27329b7b037667e0569f4e1022ab4eb | 53b70ceabe633e0d2756a09eb933fda42fc8d7cf | refs/heads/master | 2020-04-17T13:30:19.796170 | 2019-01-20T20:23:14 | 2019-01-20T20:23:14 | 166,618,610 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,304 | ino | Driver.ino | #define MOTOR_A_CONTROL_1 5
#define MOTOR_A_CONTROL_2 6
#define MOTOR_B_CONTROL_1 7
#define MOTOR_B_CONTROL_2 8
#define MOTOR_A_PWM 10
#define MOTOR_B_PWM 9
// TODO: change it
#define MOTOR_SPEED_FAST 255
#define MOTOR_SPEED_MEDIUM 150
#define MOTOR_SPEED_SLOW 50
#define ENCODER_A 2
#define ENCODER_B 3
volatile int... |
dc77546cd6e304489f888865ab26e8ba0e99c159 | 6f714dbab92f0507f13aa582fa992277e42c1777 | /Plugin/ping/PingMgr.cpp | 36bb4e1153cf812e6da405cb4829d0fcd0dc9300 | [] | no_license | sinzuo/bluedon-soc | 90d72b966ace8d49b470dab791bd65f0d56d520e | 809b59888de2f94b345b36ae33afacdbe103a1dd | refs/heads/master | 2020-09-20T17:54:20.882559 | 2019-11-28T02:27:16 | 2019-11-28T02:27:16 | 224,552,658 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 12,518 | cpp | PingMgr.cpp |
#include "PingMgr.h"
#include "utils/bdstring.h"
#include "icmp/bd_ping.h"
#include <iostream>
#include <cstdio>
using namespace Poco;
using namespace std;
CPingMgr::CPingMgr(const string &strConfigName)
{
m_strConfigName = strConfigName;
memset(&m_pingConfig,0,sizeof(m_pingConfig));
m_pFuncReportData = ... |
efef644b2573c303758e3c468fd724f04164e337 | 3854a0635e6a7784ddd91a092ca2d7dd83550bbe | /Class/NOIP/StackOverflow.cpp | cb78fdf6c255798f23e3fe1a8171dc55a62d24b1 | [] | no_license | CYACN/NOIP | f92c4e16dadf74e0b4bd4863e6331e01b080cf34 | b546cc5ac4b56c0c170e3496f55c7ccc47265510 | refs/heads/master | 2020-03-23T03:02:10.162788 | 2018-08-08T07:58:51 | 2018-08-08T07:58:51 | 141,005,746 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 271 | cpp | StackOverflow.cpp | #include <queue>
#include <iostream>
using namespace std;
queue<int> hi;
int main(int argc, char const *argv[])
{
hi.push(7);
hi.push(5);
hi.push(3);
//int x = hi.front;
while(hi.empty!=1)
{
hi.pop;
}
return 0;
} |
f3e21b287a336ae8fd5fe2c32825e68a6bb1e30b | ea8aa77c861afdbf2c9b3268ba1ae3f9bfd152fe | /zoj3953_copy.cpp | 2f3a53ec470efdc5d1a71823988a2896ba679a37 | [] | no_license | lonelam/SolveSet | 987a01e72d92f975703f715e6a7588d097f7f2e5 | 66a9a984d7270ff03b9c2dfa229d99b922907d57 | refs/heads/master | 2021-04-03T02:02:03.108669 | 2018-07-21T14:25:53 | 2018-07-21T14:25:53 | 62,948,874 | 9 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,756 | cpp | zoj3953_copy.cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int dd[100005],num[100005],cnt;
struct node{
int x,y,lab;
bool operator <(const node& a)const{
return y<a.y;
}
}e[50005];
vector<int>ans;
priority_queue<node,vector<node>,l... |
df859b3e3804e4ffcc3b985ec6518251a1b03a63 | a5ccbbfff9cc6a477bfea9853cf3b9e8a6e1ff57 | /Source/murphys/Minigames/Starfighter/StarfighterPlayerController.h | cf87ce47b86b38c9cebef1d9df18348fd6d10504 | [] | no_license | Quarantine-Zone/murphys | 373909375993efd61c8a121973528375881196dc | 82c9682c060d5d3a2265eff37ec835d2307e6165 | refs/heads/master | 2022-08-01T21:11:40.980543 | 2020-06-01T22:16:29 | 2020-06-01T22:16:29 | 261,191,987 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 599 | h | StarfighterPlayerController.h |
#pragma once
#include "CoreMinimal.h"
#include "GameFramework/PlayerController.h"
#include "StarfighterPlayerController.generated.h"
/**
*
*/
enum TeamEnum;
UCLASS()
class MURPHYS_API AStarfighterPlayerController : public APlayerController
{
GENERATED_BODY()
private:
UPROPERTY(EditAnywhere)
float Crossha... |
ec85c45f7c571b40ab6d9f049590a502e5385f09 | 95c4a9c4129d131206f057beeaa3a1872bead809 | /Longest Palindromic Substring.cc | 52b65b478c972576aee2beda95d695eb19cec1dc | [] | no_license | Dionysus1227/edocteel | 85c6daeff6a6b895b829fcace118e16bfeff1e86 | 3c8fa5ae88538037916adc40e8588b8a9407d67f | refs/heads/master | 2016-09-06T04:16:42.171813 | 2013-10-06T09:37:59 | 2013-10-06T09:37:59 | 12,487,458 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 918 | cc | Longest Palindromic Substring.cc | class Solution {
public:
string longestPalindrome(string s) {
if (s.empty()) return "";
vector<int> expand;
for (int i = 0; i < s.size(); i++) {
expand.push_back(-1);
expand.push_back(s[i]);
}
expand.push_back(-1);
vector<int> best(expand.size(... |
cc7200af8938f0fa1d76964e68e6e2c298f604fa | c068fd732028306b2265a31bae92b59f62410a2b | /src/autocorrectcomplete.cpp | b7527ebd7a04e73e7b1fde1699f2b769d33b9631 | [] | no_license | EricLiCA/autocorrect | a3351b56efc5709c18222607b47a5f8f7893345b | 5bd839cc88024323c3ab0c77d75123d1d1b107d6 | refs/heads/master | 2022-03-09T05:36:29.503909 | 2017-10-08T21:10:48 | 2017-10-08T21:10:48 | 106,209,790 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,223 | cpp | autocorrectcomplete.cpp | #include "autocorrectcomplete.h"
#include "ui_autocorrectcomplete.h"
AutoCorrectComplete::AutoCorrectComplete(QWidget *parent) :
QWidget(parent),
ui(new Ui::AutoCorrectComplete)
{
ui->setupUi(this);
connect(ui->pushButton, SIGNAL(click()), this, SLOT(back()));
tree_ = nullptr;
}
AutoCo... |
b924d75950763fab072c08c941a128a43190cc98 | 035962062f7aff530fac5bf7e01f4dfc4def33db | /kded/kwin_bridge/dummydecoratedclient.cpp | 83bfc9eae9c831500d174343d0baaeedef80c3af | [] | no_license | KDE/kde-gtk-config | 572b8c78ec2c02bada067ac9708c509ce1977952 | 889eddb89c1827c83968e8d81170261751bac2e6 | refs/heads/master | 2023-08-08T11:39:12.920981 | 2023-08-06T11:26:44 | 2023-08-06T11:29:33 | 42,731,610 | 33 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 3,383 | cpp | dummydecoratedclient.cpp | /*
* SPDX-FileCopyrightText: 2020 Mikhail Zolotukhin <zomial@protonmail.com>
*
* SPDX-License-Identifier: GPL-2.0-only OR GPL-3.0-only OR LicenseRef-KDE-Accepted-GPL
*/
#include "dummydecoratedclient.h"
namespace KDecoration2
{
DummyDecoratedClient::DummyDecoratedClient(DecoratedClient *client, Decoration *decora... |
d9bfb460c7ce76cdb2eb5e594824fdea794290ae | 1c17e303249b5036c46d95e5e0075ac932aeeb7f | /cppBaseGrammar/drink.h | 392c79dd76133096a34073c7a8af7fd3f381e8d4 | [] | no_license | ilib0x00000000/code-x | 6275a5526b1a68d1c837f4ed906b7f746bff1230 | dc2d47fa94cf3b4707afe6ab314d73d409e44409 | refs/heads/master | 2020-05-21T16:48:55.423772 | 2017-09-02T14:32:47 | 2017-09-02T14:32:47 | 84,635,302 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 84 | h | drink.h | namespace kedaierboluo
{
struct User{
char *name;
char sex;
int age;
};
} |
22b14982bd6fe35c8bcb277d0082661c5c32ec38 | 5b9619fa90d6617a6264e64b3fa6129dfa517f1a | /Qt - Station de Montagne/mainview.h | 059ecbbd56ba83c279e3c6792735a964606c3407 | [] | no_license | pvnkrockjesvs/StationMontagne | bee31185cc8d1ec38bcf0a4c680c9b9409112bdf | f5b0bd5d4e29f247b4d27ac509bd633b9284d696 | refs/heads/master | 2020-11-30T20:42:45.006713 | 2019-12-29T16:01:56 | 2019-12-29T16:01:56 | 230,474,865 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,553 | h | mainview.h | #include <QMainWindow>
namespace Ui {
class MainView;
}
class MainView : public QMainWindow
{
Q_OBJECT
public:
explicit MainView(QWidget *parent = nullptr);
~MainView();
bool etatPiste1;
bool etatPiste2;
bool etatPiste3;
bool etatPiste4;
bool etatPiste5;
bool etatPiste6;
QStr... |
346258e4fb2c1659e01e458b4a59d46b0229c71e | 7992642cb94d5d5b6113b3efd423f6966639f637 | /main.cpp | c464aaeba3dd7f7486d4959bf87ebeabcfa21fa0 | [] | no_license | nicotho/circuit_simulator_MNA | 4db306ba92775a90fdf5ff3bc532e6d6abcd7b00 | dc68a1a0189804b4a95913d6ad806ffafe278215 | refs/heads/master | 2020-12-24T13:44:50.174187 | 2014-09-29T15:48:38 | 2014-09-29T15:48:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 697 | cpp | main.cpp | #include"globals.hpp"
/*
* TODO : Learn harwell-boeing format for dense matrix
* TODO : Try if MNA matrix can be filled while reading circuit
* TODO : See if MNA matrix can be filled in parallel
*/
int main(int argc, char* argv[])
{
if(argc != 2)
{
cout<<"Error: Input circuit not found"<<endl;
exit(1)... |
983f1ee87e045591bd27fa3d0bb0222182f03c45 | 54b9ee00bcd582d56853ddb90be5cfeb0c29ba29 | /src/utils/quake3_math_vector.cc | a6af2bc07f46a6cfea832b8a3d74eda1887283e1 | [
"BSD-3-Clause"
] | permissive | pengdu/bubblefs | 8f4deb8668831496bb0cd8b7d9895900b1442ff1 | 9b27e191a287b3a1d012adfd3bab6a30629a5f33 | refs/heads/master | 2020-04-04T19:32:11.311925 | 2018-05-02T11:20:18 | 2018-05-02T11:20:18 | 156,210,664 | 2 | 0 | null | 2018-11-05T11:57:22 | 2018-11-05T11:57:21 | null | UTF-8 | C++ | false | false | 4,047 | cc | quake3_math_vector.cc | /*
===========================================================================
Copyright (C) 1999-2005 Id Software, Inc.
This file is part of Quake III Arena source code.
Quake III Arena source code is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License as
published... |
369e8d7d01596f9111ab95d52a44cecfff06f3c2 | 9e48aee08decf2bac02150454bfff2fc7d5af161 | /PS/2167 2차원 배열의 합.cc | 9ea3dabffcae8cf0c1c2a0584fb79ed8fb363a45 | [] | no_license | sooooojinlee/TIL | f29649174506cfdf92ffeaaeaaedf343c232df0b | bd3755731a9cddc22117a5f57ccbdaa9c02d0fc4 | refs/heads/master | 2022-05-07T07:37:59.105932 | 2022-03-15T13:36:26 | 2022-03-15T13:36:26 | 202,124,182 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 488 | cc | 2167 2차원 배열의 합.cc | #include <iostream>
using namespace std;
int s[301][301];
int a[301][301];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
s[i][j] = s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1] + a[i][j];
}
}
int t;
cin >> t;
while... |
283a05c865669972bb42c1537e7e3cb0e306c95c | 13b504a6635a312466175d45ae42e45467dbf188 | /shifts/main.cpp | 55fa24393e6f25e7044e1f1c573a86a9eeaf48f0 | [] | no_license | Captain-Vorobey/labs | db24eaa2b90af188ab25e443a63dc856f749ada9 | 652168cfe2d6bf2d2fb3bd81f7c9541aa8e7a594 | refs/heads/master | 2020-03-29T23:55:21.225337 | 2019-03-12T12:00:40 | 2019-03-12T12:00:40 | 150,496,307 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,255 | cpp | main.cpp | #include <iostream>
#include <list>
#include "print_line.h"
struct Value
{
int byte[8];
int cf = 0;
Value(std::initializer_list<int> list)
{
int j = 0;
for(auto i = list.begin(); i != list.end(); ++i)
{
byte[j++] = *i;
}
}
void print()
{
... |
806d18a9fd02269374fd762b67eb90c29652aef2 | 52e96fdaa9cd48fd6cad61d3cba8ecdc15f88c3a | /include/time_record.h | 60e0bfee734b5fa071143b08dc8a4a95b9d731dd | [] | no_license | RTLAB-UESTC/SET-MRTS-public | 7918aa76495383cd433c652cf297384c091437f2 | 59b9308271c353a254507d066048b763082a7c19 | refs/heads/master | 2021-06-23T23:10:53.299733 | 2020-11-02T19:15:22 | 2020-11-02T19:15:22 | 136,583,138 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 650 | h | time_record.h | // Copyright [2018] <Zewei Chen>
// ------By Zewei Chen------
// Email:czwking1991@gmail.com
#ifndef INCLUDE_TIME_RECORD_H_
#define INCLUDE_TIME_RECORD_H_
#include <types.h>
#include <ctime>
using std::cout;
using std::endl;
using std::vector;
class Time_Record {
private:
time_t time_start, time_end;
cloc... |
56144a38610fb89da86d6ea63a95ef94b4401e2e | cabf3a3aa51c98c774f3efaea2f9e43dae2cdebb | /DecompressionLZW.h | 46d37664488dc76b3d7afc352520cdaf183406d2 | [] | no_license | 26zet/LZW | 43b348d26593e8708a6c6f8621e635cd72676dc7 | b3c43f759a6feff39877d377a5dc34361043902f | refs/heads/master | 2021-01-17T08:26:13.572339 | 2017-03-04T18:10:21 | 2017-03-04T18:10:21 | 83,914,037 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 958 | h | DecompressionLZW.h | #ifndef dlzw
#define dlzw
#include <string>
#include "LZWStorage.h"
#include "InOut.h"
class DLZW{
public:
InOut *IO;
LZWStorage *Storage;
void MainLoop(){
unsigned short t1,t2;
IO->read(&t1);
IO->Write(Storage->dict[t1],Storage->Length[t1]);
Storage->LengthOfDict++;
while(IO->read(&t2)){... |
f56804d678b7d23845ecf13788887b8083632471 | 69c340aed4412535dd6e185ade0d3e2b6147418e | /Greedy/maximize_array_sum_in_K_negations.cpp | 4b5a8c5078a9fd14e8fafd14561c2755282cae0a | [] | no_license | Meaha7/DSA-Marathon | 656f1c1505adf24d2a3501a1f216e2fcb9aa3e32 | 9fb5c4d16a0192cb35f3da5c0a09b67ea2906dbd | refs/heads/main | 2023-07-11T07:14:01.912316 | 2021-08-21T21:25:05 | 2021-08-21T21:25:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 646 | cpp | maximize_array_sum_in_K_negations.cpp | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <stack>
using namespace std;
long long int maximizeSum(long long int a[], int n, int k)
{
// Your code goes here
priority_queue<long long, vector<long long>, greater<long long>> pq;
for (int i = 0; i < n; i++)
... |
7eeb76bcdb9626a65f38c7f453386ce19666ebcc | 8e068eede9730e6ce3773f1e7232c34dd03ef29d | /Engine/Modules/Crypto/ProtectedKey/NotSecureKey.cpp | e9c631aaf0a7e88fd5b1916af4ff0dab6d1e60e8 | [
"MIT"
] | permissive | leec0m3t/Leggiero | 2e228fa23f723132883577c8018e7f6a47879f61 | 8fe13d86454a08ba8a3a8cebe1ce92343090c1be | refs/heads/main | 2023-04-09T19:17:06.555139 | 2021-04-19T06:54:00 | 2021-04-19T06:54:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,396 | cpp | NotSecureKey.cpp | ////////////////////////////////////////////////////////////////////////////////
// ProtectedKey/NotSecureKey.cpp (Leggiero/Modules - Crypto)
//
// Not secure key implementation
////////////////////////////////////////////////////////////////////////////////
// My Header
#include "NotSecureKey.h"
// Standard Library... |
985658a777db0f67977e0d5694e00a6d85926da1 | 9b1639af63f7fc82f0e488b452dee0cb7ae22a3b | /SolarisNAVScanner/navex15/wdsigutl.cpp | 2d7f40a32d7986396c661efe4ba8376c9fc7cc34 | [] | no_license | ExpLife/Norton_AntiVirus_SourceCode | af7cd446efb2f3a10bba04db8e7438092c7299c0 | b90225233fa7930d2ef7922080ed975b7abfae8c | refs/heads/master | 2017-12-19T09:15:25.150463 | 2016-10-03T02:33:34 | 2016-10-03T02:33:34 | 76,859,815 | 2 | 4 | null | 2016-12-19T12:21:02 | 2016-12-19T12:21:01 | null | UTF-8 | C++ | false | false | 6,522 | cpp | wdsigutl.cpp | //************************************************************************
//
// $Header: S:/NAVEX/VCS/WDSIGUTL.CPv 1.0 17 Jan 1997 11:24:00 DCHI $
//
// Description:
// Utility functions for getting values from signature streams.
//
//*******************************************************************... |
9be5ae2a66a725acb076068164bcf31f95130f67 | 8a87f2400813fd33a4761437383f66d22fa57bb6 | /Client/Gendo/HttpDownloadMng.cpp | c97c749ef5e3746b07e287e8435d570a79eaa595 | [] | no_license | aboutboy/Gendo | f75270bd27b75170ad8a0bb65daeadc7b2707f36 | 9df3e28643790c7cde3f7af400dfcbe1b93ac001 | refs/heads/master | 2021-06-14T14:04:10.570221 | 2016-12-30T11:02:34 | 2016-12-30T11:02:34 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 18,655 | cpp | HttpDownloadMng.cpp |
#include "StdAfx.h"
#include "HttpDownloadMng.h"
#include "GendoWnd.h"
#include "RopUtil.h"
BOOL DownloadDuiControlMng::add_ListItem(char *strUrl, char *strFilePath, BOOL bOpenMode, _Nv_Download_Ex *pdlg)
{
//获取list指针
CListUI *cList_Item = static_cast<CListUI*>(((CGendoWnd*)m_pDsgWnd)->GetDownloa... |
a8b2140844c56439812e80befa168cd0f27a599f | ca249ca9733de013d6c5e317551897fa56479d15 | /1508.cpp | 6f82e27b03b87054d7a590e3534a30be46babfc9 | [] | no_license | fjl1005/BSOJ-answers | 6d2055a6e3229e06bf81be45996d20a0b587e349 | 7773b1c588d3f17eef470dfba2daa59be3fce7fa | refs/heads/master | 2020-06-28T22:55:52.475735 | 2019-08-03T11:42:37 | 2019-08-03T11:42:37 | 200,363,773 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 435 | cpp | 1508.cpp | #include<cstdio>
int u[105],w[105];
int f[105][30005];
int max(int a,int b) {
return a>b?a:b;
}
int main() {
int n,m;
scanf("%d%d",&n,&m);
int i;
for(i=1; i<=m; i++) {
scanf("%d%d",&u[i],&w[i]);
w[i]=w[i]*u[i];
}
int j;
for(i=1; i<=m; i++) {
for(j=1; j<=n; j++) {
f[i][j]=f[i-1][j];
... |
b5e7f90d6897072c3c0993b8a5f98cf08a887216 | 5795af16335f6c04b07500343703cd75eba7edfa | /Utils/haddPlus.cc | f7851dc09891b8b56097bb6b8ca1b4676556d74a | [] | no_license | duartej/AnalysisVH | f5bf152b717c3abd6ae949cea065177359fbb3f1 | 5f05b75448df06f05fd6143a020b9cd884aa8c5b | refs/heads/master | 2020-04-05T23:40:38.654548 | 2013-11-07T18:27:00 | 2013-11-07T18:27:00 | 4,871,087 | 0 | 0 | null | 2013-01-15T10:30:16 | 2012-07-03T10:43:32 | C++ | UTF-8 | C++ | false | false | 7,776 | cc | haddPlus.cc | /*
This program will add histograms (see note) and Trees from a list of root files and write them
to a target root file. The target file is newly created and must not be
identical to one of the source files.
Syntax:
hadd targetfile source1 source2 ...
or
hadd -f targetfile source1 source2 .... |
30e60d8efbc83ee31ac0f9404a16d424be2a09b2 | fb689146cc19e1113e095e6dfd12f8b73177b22f | /source/lac/petsc_precondition.cc | 90f6e70e7d73fc0d5e99388b43894e0cb6d54537 | [] | no_license | qsnake/deal.II | 0418a4c9371e2630a0fce65b8de3529fa168d675 | 79c0458c8cc3fa03e5d89357a53a4f9397ead5c3 | refs/heads/master | 2021-01-01T15:55:27.801304 | 2012-07-27T13:31:57 | 2012-07-27T14:16:10 | 5,205,180 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 14,918 | cc | petsc_precondition.cc | //---------------------------------------------------------------------------
// $Id: petsc_precondition.cc 24320 2011-09-13 09:41:50Z young $
// Version: $Name$
//
// Copyright (C) 2004, 2006, 2008, 2009, 2010 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// withou... |
4314dd0a33fbad6c74cc683bb24963f9e036b873 | 1695d3005542eeaf519de6d7624ccbde2357688f | /sysmodule/source/main.cpp | fd20496c91616a48522c930d51ba8aacdd0ce301 | [] | no_license | WerWolv/Sysmodule_Access | a424ee6359edefa92ae877bffcfcd5147928c381 | b2e7db884b22e35f5bf6b66f0348778cfcdd3f13 | refs/heads/master | 2020-03-29T07:22:04.528597 | 2018-11-01T06:09:55 | 2018-11-01T06:09:55 | 149,662,284 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,061 | cpp | main.cpp | /*
* Copyright (c) 2018 Atmosphère-NX
*
* This program is free software; you can redistribute it and/or modify it
* under the terms and conditions of the GNU General Public License,
* version 2, as published by the Free Software Foundation.
*
* This program is distributed in the hope it will be useful, but WITHO... |
ffaf6681c38de19a6856870c77f8d77cb3c0a1a6 | 085b0b660560d64465b0f25cc9678aed1d5799f9 | /src/opengl.cpp | 482394d5e4ace9e98751d350e15509ad6082068b | [
"MIT"
] | permissive | ddevault/wayfire | 3eafa63d6955cbe31123eb99c9cba02fa45ae88c | 007452f6ccc07ceca51879187bba142431832382 | refs/heads/master | 2020-03-15T13:55:01.974924 | 2018-03-27T06:07:37 | 2018-03-27T19:11:18 | 132,178,245 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,154 | cpp | opengl.cpp | #include "opengl.hpp"
#include <compositor.h>
#include "debug.hpp"
#include "output.hpp"
#include "render-manager.hpp"
#include <gl-renderer-api.h>
namespace {
OpenGL::context_t *bound;
}
const char* gl_error_string(const GLenum err) {
switch (err) {
case GL_INVALID_ENUM:
return "GL_INVALI... |
f75f669887e45d2fcd42a3cc5861bb3734c3e871 | 9fedb3257c0b03fce152628c68b1b218ffba82d0 | /17计科3班 170201103795 李柏岐.cpp | bdb60a92a9e518873b6d0b29f4cb0bb2cf91e944 | [] | no_license | libaiqi-gt/algorithm_code | 211dbbc551dc85666e2684d6bfb580ab14537e13 | d2b1b96b9e6690713ebe7e1763cf3cf48ac2abab | refs/heads/master | 2020-09-21T17:00:48.184590 | 2019-12-30T06:16:32 | 2019-12-30T06:16:32 | 224,858,474 | 0 | 0 | null | 2019-11-29T13:21:21 | 2019-11-29T13:21:21 | null | UTF-8 | C++ | false | false | 371 | cpp | 17计科3班 170201103795 李柏岐.cpp | #include<stdio.h>
int BinarySearch(int a[], const int& x,int n){
int left=0,right=n-1;
while(left<=right)
{
int middle=(left+right)/2;
if(x==a[middle])
{
return middle;
}
if(x>a[middle])
{
left=middle+1;
}
else
{
right=middle-1;
}
}
return -1;
}
int main()
{
int a[]={1,3,5,7,11,14};
... |
b966fe9e5d40a1ea18e93c0125d56961ff26e1f3 | 5d83739af703fb400857cecc69aadaf02e07f8d1 | /Archive2/fc/68b2b14287ecd3/main.cpp | a81b549ee22066730abe147ca612e38e99146f44 | [] | no_license | WhiZTiM/coliru | 3a6c4c0bdac566d1aa1c21818118ba70479b0f40 | 2c72c048846c082f943e6c7f9fa8d94aee76979f | refs/heads/master | 2021-01-01T05:10:33.812560 | 2015-08-24T19:09:22 | 2015-08-24T19:09:22 | 56,789,706 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,002 | cpp | main.cpp | #include "boost/variant.hpp"
#include <iostream>
#include <complex>
struct structy {
int a;
};
std::ostream &operator<<(std::ostream &out, structy) {
return out;
}
void times_two(
boost::variant<int, std::string, std::complex<double>, structy> & v) {
if (int* pi = boost::get<int>(&v... |
43d64bd21377e306a7bdc0c90ac7f58f46f29373 | ea91bffc446ca53e5942a571c2f7090310376c9d | /src/syntax/CommonSyntaxNodes.cpp | 947c8df4ab37db69cacaf49e89ee7e79bf7b75c2 | [] | no_license | macro-l/polarphp | f7b1dc4b609f1aae23b4618fc1176b8c26531722 | f6608c4dc26add94e61684ed0edd3d5c7e86e768 | refs/heads/master | 2022-07-21T23:37:02.237733 | 2019-08-15T10:32:06 | 2019-08-15T10:32:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,858 | cpp | CommonSyntaxNodes.cpp | // This source file is part of the polarphp.org open source project
//
// Copyright (c) 2017 - 2019 polarphp software foundation
// Copyright (c) 2017 - 2019 zzu_softboy <zzu_softboy@163.com>
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://polarphp.org/LICENSE.txt for license info... |
29917b2407f95e1c77ea12f1569ebaf1d6aa6ee8 | 454c655e68a61f9927fb2609296a8c404126d342 | /Frontline/ShaderClass.h | cb7e005d681f45b958e349af6fc3700a8b540561 | [] | no_license | DavidQChuang/OldGameEngine | 340fda1af202b1310af7ffbcc19853f1bf086540 | 885480b204d699d7c57b5881e0690a8ca551d858 | refs/heads/master | 2021-01-14T00:57:54.683765 | 2020-02-24T15:18:30 | 2020-02-24T15:18:30 | 242,543,935 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 888 | h | ShaderClass.h | #ifndef _SHADERCLASS_H_
#define _SHADERCLASS_H_
#include "D3DClass.h"
#include "colorshader.h"
#include "LightShaderClass.h"
#include "RefractionShaderClass.h"
#include "TextureShaderClass.h"
#include "ColorTextureShader.h"
#include "TransparencyShaderClass.h"
#include "WaterShaderClass.h"
#include "LightClass.h"
cla... |
964458414780fec80a42ccf12244423c01f5083a | 86a085fbf5abde1d7d37450b1f4c828260b19234 | /ch08/u8_1_13.cpp | 3c9bda51e9bf2eed984da65da2035a565e9255f8 | [] | no_license | crespo2014/cpp-exam | 5eaa0f87e5839988974774a3766940bd3adfbf6f | 8794f2945494873c610b6938571b13463c74e22a | refs/heads/master | 2021-01-20T02:49:31.281036 | 2015-03-10T20:59:32 | 2015-03-10T20:59:32 | 26,771,078 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 519 | cpp | u8_1_13.cpp | /*
* u8_1_13.cpp
*
* Created on: 25 Jan 2015
* Author: lester
*/
#include <iostream>
using namespace std;
int main() {
int v = 100;
bool b = true;
double d = 100;
cout<<"Without flags:\n";
cout<<v<<endl<<b<<endl<<d<<endl<<endl;
cout<<"Flags set:\n";
cout.setf(ios::showpos);
... |
de9894db959293415581ede8a658ff5f85de66bb | 8352ca72d4f1e8e8ebbbb7d6b07a4e0963be7f41 | /DataServer/Yahoo_TIP/TA_BASE/transactive/app/YahooFinanceStock/YahooFinanceStockClient/src/StockTcpClientActor.cpp | 7fecbaa82547db03478e269b919a3b92b66231cc | [] | no_license | radtek/slin_code | 114f61695fc1a23a018da727452c3c42f64ebe39 | a0073e52d600839f7836c2b7673b45b4266259e2 | refs/heads/master | 2020-06-04T15:03:56.618177 | 2015-04-27T10:27:47 | 2015-04-27T10:27:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,005 | cpp | StockTcpClientActor.cpp | #include "StockTcpClientActor.h"
#include <QtCore/QtCore>
#include <QtNetwork/QtNetwork>
#include "ClientComWorker.h"
#include "BaseException.h"
#include "TcpSocketHelper.h"
#include "MessageManager.h"
#include "SocketInfo.h"
#include "Log4cppLogger.h"
CDistributeTaskWorker::CDistributeTaskWorker( co... |
2494bc0ccc61b498e42975699fc89997049bad1b | 9ca9d49c79edd03785ecf6a16c26ed2a887583f9 | /master/alleyhoop_ros_master/include/alleyhoop_ros_core/alleyhoop_ros_controller.h | 6cc078e25f92519e4750244f476a9beeb761d9d6 | [] | no_license | AlleyHoop/alleyhoop_ros | 872e3e9a89702e301a48103119485140a3edb47c | 33ee6a315b867d6ff36e2cd51ddba8aef7a0db1d | refs/heads/master | 2020-09-19T10:48:12.843466 | 2020-01-31T16:22:43 | 2020-01-31T16:22:43 | 224,226,376 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,166 | h | alleyhoop_ros_controller.h | #ifndef ALLEYHOOPROSCONTROLLER_H_
#define ALLEYHOOPROSCONTROLLER_H_
//required includes
#include <ros/ros.h>
#include "alleyhoop_mvc/controller.h"
//sensor headers
#include "alleyhoop_ros_sensors/alleyhoop_ros_ultrasonic_sensor.h"
#include "alleyhoop_ros_sensors/alleyhoop_ros_mono_camera.h"
#include "alleyhoop_ros... |
5a37c3b3cfdeaa7bce0f8e8ec63225282bb715dc | a31e7362f9f0205dd9a37ca4a491c5275aaca03a | /axengine/include/axlogic/game/gamenode.h | 365c85e72a775cda671c8f25feaff75f933ccd52 | [
"LicenseRef-scancode-warranty-disclaimer",
"FTL",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | teardemon/axonengine | 56368abcffc7f2a0661523da5c4241176e74f08f | 4e7539825d71c11fa4ef48973f6711439f55c267 | refs/heads/master | 2021-01-15T10:34:21.413244 | 2009-08-23T15:53:54 | 2009-08-23T15:53:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,264 | h | gamenode.h | /*
Copyright (c) 2009 AxonEngine Team
This file is part of the AxonEngine project, and may only be used, modified,
and distributed under the terms of the AxonEngine project license, license.txt.
By continuing to use, modify, or distribute this file you indicate that you have
read the license and understand and acce... |
18d29156f1b43a79318f90698b426881bab41a85 | 57338e7af891aaee72cab07b4329d80a3bc358f5 | /sonic-swss/orchagent/pfcwdorch.cpp | 2a94f9ec26ca616e167465d27a78c8d2200e005f | [
"Apache-2.0"
] | permissive | tiglabs/sonic | 18ecb2364be2bf70d239dc30a9d006911391d4b0 | e10c5b82c4b1cdb439f7212579aca880aa9d7cd3 | refs/heads/master | 2021-07-10T18:38:28.814144 | 2017-10-12T03:36:51 | 2017-10-12T03:36:51 | 106,631,679 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 15,693 | cpp | pfcwdorch.cpp | #include "pfcwdorch.h"
#include "saiserialize.h"
#include "portsorch.h"
#include "converter.h"
#include "redisapi.h"
#include "select.h"
#define PFC_WD_ACTION "action"
#define PFC_WD_DETECTION_TIME "detection_time"
#define PFC_WD_RESTORATION_TIME "restoration_time"
#define PFC_WD_D... |
c35280ab1a4769b17b03fdfe80d950076e4041bd | 7ac55f7ae68e1818b210f9c4971d05fb20c84eb4 | /BuilderPattern/BuilderPattern/BuilderPattern.cpp | a30b77004a63a83a6336662076b8fed110ebeb62 | [] | no_license | yiminyangguang520/DesignPattern | e45495b0399e8304db6841e13be3d49fb7de1359 | 2628d6e3bf4964c96844964916c713d06c913ac6 | refs/heads/master | 2020-12-14T10:34:28.872735 | 2017-09-22T05:35:00 | 2017-09-22T05:35:14 | 46,867,893 | 4 | 4 | null | null | null | null | GB18030 | C++ | false | false | 276 | cpp | BuilderPattern.cpp | // BuilderPattern.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include "builder.h"
#include "director.h"
int main()
{
Director* pBuilder = new Director(new ConcreteBuilder());
pBuilder->construct();
system("pause");
return 0;
}
|
ed8468b5db51cc94931221a082ffaddf5f130170 | 022cb1c48475cf0ff8c62f458e9b8372ca6ef5e3 | /linux/src/movie.cpp | 97d47d3e91c93021ef9ba6ca359af6dec6c3afd5 | [] | no_license | gitScald/C-Recommender | f22772bbf761dc30e6e07e0113ab9cbd95014542 | 21ed951e42db3254e1a012cec46a02b71e0fadee | refs/heads/master | 2021-05-09T13:59:09.724223 | 2017-11-22T01:53:56 | 2017-11-22T01:53:56 | 119,052,414 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 633 | cpp | movie.cpp | #include "movie.h"
#include "word_tokenizer.h"
#include <sstream>
/*!
\param os is a Output Stream Object
\param m is a Movie Object
\return Output Stream Object os containing in its buffer the name, id, release date and summary of Movie Object m
*/
std::ostream& operator<<(std::ostream& os, const Movie& m) {
// pr... |
87823fdd7e61f8155a8080a0f978bed6796856bd | fb1c4f630a2d4db6a9211a1ca3362f461f6916fb | /Src/Hardware/MCU/Virtual/Src/Adc_Virtual.cpp | 4dbaa0033fdf48fce81e7dce5879ab7e73b50e6a | [
"MIT"
] | permissive | ThBreuer/EmbSysLib | a7e445f86564a68387e47e10b4b652535236de1b | 1372c29aa1b9a6400b7ac2aeeb23aa1ed09c37a4 | refs/heads/main | 2023-04-07T02:54:17.452717 | 2023-04-06T10:16:37 | 2023-04-06T10:16:37 | 53,247,108 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,256 | cpp | Adc_Virtual.cpp | //*******************************************************************
/*!
\file Adc_Virtual.cpp
\author Thomas Breuer (Bonn-Rhein-Sieg University of Applied Sciences)
\date 15.10.2013
License: See file "LICENSE"
*/
//*******************************************************************
#include "Adc_Virtual.h"
#inc... |
03d7409434985c237fd4f8334a4cf56ad999104f | 28a2707c03a69c3e8e131e644bb365f684812a84 | /tp2_1_1.cpp | c2cdc41f43140ffa309fc51bc5a5c5a667841733 | [] | no_license | TallerDeLenguajes1/tpn2-alamodeg | a963f36c7e034d17a37cc6997d4eb3388fdc0f44 | ec02e4fd85cdfdeb4a48da87c34b0fe107bd8555 | refs/heads/master | 2021-05-24T16:48:19.542315 | 2020-04-23T05:30:20 | 2020-04-23T05:30:20 | 253,662,426 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 307 | cpp | tp2_1_1.cpp | #include <stdio.h>
#define FILA 4
#define COLUMNA 5
int main(){
int f,c;
double Matriz[FILA][COLUMNA];
for(f = 0;f<FILA; f++)
{
for(c = 0;c<COLUMNA; c++)
{
printf("%lf ", Matriz[f][c]);
}
printf("\n");
}
getchar();
return 0;
}
|
77076ad44b4ee44d229fde1964becb4ce71ed0fe | 66deb611781cae17567efc4fd3717426d7df5e85 | /pcmanager/src/publish/softmgr/IDTManager.h | aec3af7e74b258311f21877c68c8cdc7d718fa27 | [
"Apache-2.0"
] | permissive | heguoxing98/knoss-pcmanager | 4671548e14b8b080f2d3a9f678327b06bf9660c9 | 283ca2e3b671caa85590b0f80da2440a3fab7205 | refs/heads/master | 2023-03-19T02:11:01.833194 | 2020-01-03T01:45:24 | 2020-01-03T01:45:24 | 504,422,245 | 1 | 0 | null | 2022-06-17T06:40:03 | 2022-06-17T06:40:02 | null | GB18030 | C++ | false | false | 2,070 | h | IDTManager.h | /**
* @file IDtManager.h
* @brief 下载管理
* @author liveck
* @date 2010/04/09 20:11
*/
#pragma once
enum DTManager_Stat{TASK_DONE=0,TASK_DOWNING,TASK_PAUSED,TASK_CONECTING,TASK_ERROR,TASK_ERROR_MD5};
typedef void (*GetTaskCallback)(void* tk,void* para);
static void GetTaskCallbackByArr(void* tk,v... |
86256cab1847ba506928aa2ad100ed92459a3461 | e50c0284b5f7643bc16cf8143eb5a5f225c3fb06 | /source/App/agent_broker.h | 95cc80094c3034775cae00ead647efb751199e0d | [] | no_license | shinkw83/ThermogramCamera | b98daf64bebcbc0179f5fbf4a55b6798ee78f381 | 5c62e730bd05cd28919625fd943101aea53efc57 | refs/heads/main | 2023-03-04T18:49:35.871254 | 2021-01-15T02:25:39 | 2021-01-15T02:25:39 | 305,238,752 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 414 | h | agent_broker.h | #pragma once
#include "global.hpp"
#include <raspicam/raspicam_cv.h>
class agent_broker {
public:
agent_broker();
~agent_broker();
void set_picam(std::weak_ptr<raspicam::RaspiCam_Cv> picam);
std::weak_ptr<raspicam::RaspiCam_Cv> picam();
void update_thermogram_index();
uint32_t thermogram_index();
private:
p... |
7de4f5bf2d497613d4758a8e3aa002d59870f466 | bcdacb31ebb2da2e9da0efe9190a00ff0407edf5 | /蓝桥杯 programming /5-17 汉诺塔的非递归实现/5-17 汉诺塔的非递归实现/main.cpp | f7c676ff64ff1d41133801b1fb2c8b430db3882a | [] | no_license | guohaoyu110/Self-Learning-DataStructure | 08fe60fccb4b48e8503dd95f469ed82f7f109059 | 0d1533f70cf46aa28be5a5be84b9ce6cd4cc5dda | refs/heads/master | 2022-02-22T07:23:21.956554 | 2019-10-12T22:52:02 | 2019-10-12T22:52:02 | 109,500,323 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 802 | cpp | main.cpp | //
// main.cpp
// 5-17 汉诺塔的非递归实现
//
// Created by Haoyu Guo on 17/01/2017.
// Copyright © 2017 Haoyu Guo. All rights reserved.
//
/*
借助堆栈以非递归（循环）方式求解汉诺塔的问题（n, a, b, c），即将N个盘子从起始柱（标记为“a”）通过借助柱（标记为“b”）移动到目标柱（标记为“c”），并保证每个移动符合汉诺塔问题的要求。
输入格式:
输入为一个正整数N，即起始柱上的盘数。
输出格式:
每个操作（移动）占一行，按柱1 -> 柱2的格式输出。
输入样例:
... |
cf6ac4e8507a9bad9eae88d6d5642a9251a7776c | fb6c14ed4e67707173d9457879a0ba0954222fff | /catkin_ws_ladybug/build/localization_beacons_stack/localization_ekf_beacons/include/localization_ekf_beacons/moc_localization_ekf_beacons_interface.cxx | 96c9c784d8a254b52676cf0b96b59b06f4fb441f | [] | no_license | up201305747/tese_ladybug | adb7774a7e794d42bf4cbc26e1c6f92a5f8ef7da | c519813de241a618b6cb2b1fb1c5aa1256c2fc67 | refs/heads/master | 2020-03-18T12:11:10.770529 | 2018-05-24T12:40:33 | 2018-05-24T12:40:33 | 134,713,515 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,576 | cxx | moc_localization_ekf_beacons_interface.cxx | /****************************************************************************
** Meta object code from reading C++ file 'localization_ekf_beacons_interface.h'
**
** Created by: The Qt Meta Object Compiler version 63 (Qt 4.8.7)
**
** WARNING! All changes made in this file will be lost!
**********************************... |
6a17163754f156517b44704ebe57d663c6244bed | 684c9beb8bd972daeabe5278583195b9e652c0c5 | /src/cobalt/loader/resource_cache.h | 617143943332461fbba6f83f99db3e14db9535db | [
"Apache-2.0",
"BSD-3-Clause"
] | permissive | elgamar/cobalt-clone | a7d4e62630218f0d593fa74208456dd376059304 | 8a7c8792318a721e24f358c0403229570da8402b | refs/heads/master | 2022-11-27T11:30:31.314891 | 2018-10-26T15:54:41 | 2018-10-26T15:55:22 | 159,339,577 | 2 | 4 | null | 2022-11-17T01:03:37 | 2018-11-27T13:27:44 | C++ | UTF-8 | C++ | false | false | 38,034 | h | resource_cache.h | // Copyright 2015 The Cobalt Authors. 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 ap... |
8ede94f21f073e5bcd87dc9998bccd2e504306ab | 198d4618cd8ccf9ca75f60d167f26c7eec2a0ec0 | /chp-2/merge_sort.cpp | 1f5114aad4cef13a63e0abecedb8cf5902048e59 | [] | no_license | ajinkyashukla/programs-cormen | c87884e44e45fd6962ac4b0ad196d78f965f1691 | e7f215fe66cbc5f1eb0217cc3fbbe471f254da77 | refs/heads/master | 2021-01-21T12:02:57.625485 | 2014-02-15T18:33:36 | 2014-02-15T18:33:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,006 | cpp | merge_sort.cpp | /**
* Simple Merge sort program
* @version 1.0
* @author ajinkya shukla <ajinkyashukla02@gmail.com>
*/
#include<iostream>
using namespace std;
void split(int*,int*,int,int);
void merge(int*,int*,int,int,int);
int main() {
int n;
cout << "Enter the number of integers to be sorted: ";
cin >> ... |
cdd1485856b745af3bc4ad14586a346a76113064 | 8549362e40f65ce6f5f4e1b5c946cd9e61fa20b0 | /Gierek/Market.h | 2dcb60b7ae710b44cfe790fe005d0475980fd799 | [] | no_license | zasoniak/Gierek_XAML | a80209ced98569d96c330d278304777ca01f51c7 | 2fa5926c73e03deda030e8b5d82e5f69e624417f | refs/heads/master | 2020-12-24T16:42:31.322894 | 2014-05-07T15:50:18 | 2014-05-07T15:50:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 217 | h | Market.h | #pragma once
#include "Order.h"
class Market
{
public:
std::vector<Order> orderList;
std::vector<Order> offerList;
public:
Market();
void AddOrder(Order *newOrder);
Order AccomplishTransaction(Order *offer);
};
|
d64704bd5a3b3c4299bdbafa1fdb86f370d3da89 | 382155912f0501a163fd6b65e9dc3e4c6aeb3a19 | /Homework/Homework1/starter_file/hashtable.h | d6e3ee32ffd6fbcbf5eab2a49ab01b5bc3a916db | [] | no_license | Roihn/VE281 | 86757f2d50948cdecca1e3c78318d80f47447c1f | 2bd108de91d5a1a6c1bce1a04862d31ee7204b5a | refs/heads/master | 2023-07-12T22:14:17.515408 | 2021-08-16T08:37:14 | 2021-08-16T08:37:14 | 364,315,773 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,316 | h | hashtable.h | #ifndef HASHTABLE_H
#define HASHTABLE_H
// INSTRUCTIONS:
// fill out the methods in the class below.
// You may assume that the key and value types can be copied and have default
// constructors.
// You can also assume that the key type has (==) and (!=) methods.
// You may assume that Hasher is a functor type wit... |
daa6c7e62149f5a44102f83b59c64633744d075e | a3ecac890fc4734b00f00a7c6a432e894f61d750 | /Coursework/src/Enemy.h | b9c5da14afad815c0231a66a5e60dd6dba5b8c50 | [] | no_license | Cladorhiza/2021GraphicsCoursework | 98d8b9a9a8b2a25dd3bc17ac604f972ce880b90b | 0d832304ac84779a0a593411a6c0b2dd7d8314ac | refs/heads/main | 2023-04-14T18:29:47.593419 | 2021-05-04T11:52:26 | 2021-05-04T11:52:26 | 347,311,128 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 304 | h | Enemy.h | #pragma once
#include "Moveable.h"
#include "Character.h"
class Enemy :
public Moveable
{
protected:
float speed;
bool alive;
public:
Enemy(float width, float height, float positionX, float positionY, float positionZ, float size, float speed);
~Enemy();
inline bool IsAlive() { return alive; }
};
|
66af3a2933674761dac6366b602579fb875b8fde | b00c54389a95d81a22e361fa9f8bdf5a2edc93e3 | /art/compiler/elf_writer_quick.cc | 5151aaebc81aa9fe0bf01eb2e2074f89319a0d1e | [
"NCSA",
"Apache-2.0"
] | permissive | mirek190/x86-android-5.0 | 9d1756fa7ff2f423887aa22694bd737eb634ef23 | eb1029956682072bb7404192a80214189f0dc73b | refs/heads/master | 2020-05-27T01:09:51.830208 | 2015-10-07T22:47:36 | 2015-10-07T22:47:36 | 41,942,802 | 15 | 20 | null | 2020-03-09T00:21:03 | 2015-09-05T00:11:19 | null | UTF-8 | C++ | false | false | 57,202 | cc | elf_writer_quick.cc | /*
* Copyright (C) 2012 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... |
778c04bc7fd8d8b523bbf5a1f507c7fa3527d40c | 15e818aada2b18047fa895690bc1c2afda6d7273 | /lib/json_load/json_load_or_die.h | 20eb95524bc7a0edd372c68a5d2f99a6d37e83cb | [
"Apache-2.0"
] | permissive | ghomsy/makani | 4ee34c4248fb0ac355f65aaed35718b1f5eabecf | 818ae8b7119b200a28af6b3669a3045f30e0dc64 | refs/heads/master | 2023-01-11T18:46:21.939471 | 2020-11-10T00:23:31 | 2020-11-10T00:23:31 | 301,863,147 | 0 | 0 | Apache-2.0 | 2020-11-10T00:23:32 | 2020-10-06T21:51:21 | null | UTF-8 | C++ | false | false | 1,421 | h | json_load_or_die.h | /*
* Copyright 2020 Makani Technologies LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law ... |
f46127789a504f898146ac5445c6b4827af16fbb | a26be2a476c6ef9570fc7525524804e83d779d29 | /Labs/Lab4.2/HuffmanEncoding.cpp | 6f93ce8d05c6d22932f886450a909bbf80c55e9e | [] | no_license | AaronCGoidel/DSA | 8389eca153af02239474bc8d7e9c7a1bfcfd01b3 | 440332905b979be4f09a988d0049b4e36dba9511 | refs/heads/master | 2020-03-26T20:45:10.024361 | 2019-04-09T15:32:07 | 2019-04-09T15:32:07 | 138,738,343 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,536 | cpp | HuffmanEncoding.cpp | /* Huffman Encoding
* 2019
* Starter Code
*/
#include "HuffNode.h"
#include "HuffHeap.h"
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
map<char, uint32_t> counts;
HuffHeap* makeHeap(string fileName){
//takes in a file name, counts the characters and creates the heap
//consider ... |
149b2ead2eaac03c8105d48daa6b36a406b35841 | b953a775acdae5c0e8c8d30d9f491b7394da2c26 | /rma.h | 4f9a826aae84b66c11ec1f8a7ddd73c55dcdc354 | [] | no_license | shweaye810/discrepancy | 7ea0175fb690b7dd5a3a9147b48db93704d40517 | 8441d95a6b09075a9b35c0c571611470ea417bb1 | refs/heads/master | 2020-12-25T15:17:34.913391 | 2016-08-23T16:50:48 | 2016-08-23T16:50:48 | 62,466,028 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 495 | h | rma.h | #include <map>
#include "info.h"
#include "tokenizer.h"
#ifndef RMA_H
#define RMA_H
/*
* @m_info: string -> RMA
*/
class RMA{
public:
RMA();
void add();
void print(std::ostream &, const std::string &s) const;
void substitute_PN();
void calc_qty();
private:
std::map<s... |
022b13c1c9d6c0c1dc296498466174ca2da8b353 | b504c574da6f77ca14d19284e7e24cfc12c06a21 | /day03/ex01/main.cpp | 64ff62a435dc2719d72f5ee89d833b2cb88aa7c5 | [] | no_license | benlyazid/piscine-CPP | 93c2dfd5aa1e7e835d521518b94b1b20a0bc3826 | c7eb0b6cff163591e174b7b93f978de42966f575 | refs/heads/master | 2023-08-01T05:43:49.119629 | 2021-09-24T16:59:47 | 2021-09-24T16:59:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,043 | cpp | main.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* main.cpp :+: :+: :+: ... |
c488df37acb894fa4573135ae201309f2b71a438 | 9f075f47ecb22f95985add4224ae84357ce8e03c | /lib_compiler/src/compilers/unit.cpp | f6225d65541db6a64cc9a279bf29cdfd8980ce6f | [
"Zlib"
] | permissive | ApiO/pgtech | 5b2a2688a43f3fe839cf5ce732766a51108b9563 | e7c03ea1a269a96fca27b60a417cf4a5759d40ba | refs/heads/master | 2020-05-24T18:21:53.067826 | 2019-05-18T22:37:25 | 2019-05-18T22:37:25 | 187,404,856 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,095 | cpp | unit.cpp | #include <runtime/types.h>
#include <runtime/temp_allocator.h>
#include <runtime/trace.h>
#include <data/unit.h>
#include <data/mover.h>
#include "compiler_types.h"
#include "compiler.h"
namespace
{
using namespace pge;
struct NodeKey
{
u64 node;
u32 name;
u32 parent_name;
i... |
0fac9365b3a095e760242abe70f050f57b50b42a | 10960f5be99deb61080b8a7ea800e00b17c17cca | /sparse_hough2d.cpp | 32b1a3d943c477b8a256f7822e3315c3f236e848 | [
"MIT"
] | permissive | Steve132/sphough | 6e1f3991512e0c2d7df26659931cc2a382919664 | e65d4fb2d0d674fb904af61c95204ab1876c2000 | refs/heads/master | 2023-01-01T13:06:39.795556 | 2020-10-14T18:48:24 | 2020-10-14T18:48:24 | 258,442,292 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,514 | cpp | sparse_hough2d.cpp | #include "sparse_hough2d.hpp"
#include<vector>
#include<iostream>
#include<cmath>
typedef std::array<size_t,2> p2i_t;
static
std::vector<p2i_t> find_all_window_points(const std::vector<bool>& f,
const std::array<size_t,2>& fshape,
const std::array<size_t,2>& shape,
const std::array... |
76510048f215e48d5140fd9b4ee1535324ce1dd9 | 7f25ac596812ed201f289248de52d8d616d81b93 | /QAsQ/CF/724A - Checking the Calendar.cpp | da9b13c3fecedb21bbd03166c647c946ba151a29 | [] | no_license | AplusB/ACEveryDay | dc6ff890f9926d328b95ff536abf6510cef57eb7 | e958245213dcdba8c7134259a831bde8b3d511bb | refs/heads/master | 2021-01-23T22:15:34.946922 | 2018-04-07T01:45:20 | 2018-04-07T01:45:20 | 58,846,919 | 25 | 49 | null | 2016-07-14T10:38:25 | 2016-05-15T06:08:55 | C++ | UTF-8 | C++ | false | false | 591 | cpp | 724A - Checking the Calendar.cpp | #include<bits/stdc++.h>
using namespace std;
const int mon[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string wek[7] = {"monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday"};
int gid(string v){
for(int i=0;i<7;i++){
if(wek[i] == v) return i;
}
return -1;
}
bool... |
48197458be50a05d6e4dbf8cef970c5dff437388 | 12f8c029739c95c27435d44cd449d4feaf450f14 | /Dungeon/Dungeon/GameOverKeyEvent.cpp | 5cfe6f802db6cca5068471dc416d108baf49eaa0 | [] | no_license | kagakububutyou/Siv3D | 9851bded0aaba059d8293c184a8e26840efa9dfa | 65a9dc76288237782de0fceccebc92afd5dd1ef6 | refs/heads/master | 2021-01-21T02:28:06.055792 | 2015-02-02T10:04:01 | 2015-02-02T10:04:01 | 21,087,796 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 353 | cpp | GameOverKeyEvent.cpp | #include "GameOverKeyEvent.h"
#include "Scene.h"
#include "CharacterController.h"
CGameOverKeyEvent::CGameOverKeyEvent()
{
}
void CGameOverKeyEvent::ChangSceneMenu(std::shared_ptr<CSceneManager> scene)
{
//if (CharacterController::ChangeSceneKey())
if (Input::KeyC.clicked)
{
scene->ChangeScene(CSc... |
d4a5b1a5c887fdeb1e992ca9f77008be332d6086 | f183719315d32b82b3658851d215b3d9d3f3c909 | /046_Permutation_II.cpp | 0edc1dfcff3e9342cce71de44be10226a8123202 | [] | no_license | ashishskore/Leetcode | 520bb19efa8cb86ece231aec9b7ca51c3a4d0f9e | 18e81d1e7100d632c477b47549a64bab3f41e513 | refs/heads/master | 2023-05-07T04:58:28.389484 | 2021-05-28T11:10:14 | 2021-05-28T11:10:14 | 278,268,390 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 612 | cpp | 046_Permutation_II.cpp | /*
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Example 1:
Input: nums = [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Example 2:
Input: nums = [0,1]
Output: [[0,1],[1,0]]
Example 3:
Input: nums = [1]
Output: [[1]]
*/
cla... |
d8be75b4159897f9152ac71d12c391818d221536 | f5553b723ea9ef30d9f403d4939145e7b598c9dc | /src/memory/registers/nr52.hh | 88723b10a8e24e40e4276878647687dc361eda10 | [] | no_license | fmichea/nebula | 494681679cb27334647a9eb784c2a5d81313dced | 2a20880511abec1f7cf3f5c7ddee0a304e7798a6 | refs/heads/master | 2021-01-25T12:19:44.481334 | 2016-10-23T13:42:06 | 2016-10-23T13:42:06 | 23,530,762 | 0 | 1 | null | 2015-03-31T01:54:01 | 2014-09-01T04:38:48 | C++ | UTF-8 | C++ | false | false | 629 | hh | nr52.hh | #ifndef NEBULA_MEMORY_REGISTERS_NR52_HH_
# define NEBULA_MEMORY_REGISTERS_NR52_HH_
# include "bitproxy.hh"
# include "register.hh"
# include "../../sound/constants.hh"
class NR52Proxy : public RegisterProxy {
public:
NR52Proxy() : RegisterProxy() {}
NR52Proxy(uint8_t* reg, uint16_t addr)
: RegisterP... |
797dd5ab12cbead8c4a9797c36fc5d64f58a891c | 3e95c68b54231bb1482c4593dba87399d032db09 | /src/selection.cxx | 24602d59e33197f97379cdbb34e86a78c7cfb367 | [] | no_license | mstoev/BaconJets | 64a4159ab57a66c6136dbe34da1fdacc8fe0fef2 | d66e5fadaf8248a734ffb8ab996e5e6a40e7efd7 | refs/heads/master | 2020-12-25T11:15:38.066429 | 2015-05-13T07:48:21 | 2015-05-13T07:48:21 | 32,583,517 | 0 | 0 | null | 2015-03-20T12:53:18 | 2015-03-20T12:53:18 | null | UTF-8 | C++ | false | false | 5,309 | cxx | selection.cxx | #include "UHH2/BaconJets/include/selection.h"
#include "UHH2/bacondataformats/interface/TJet.hh"
#include "UHH2/bacondataformats/interface/TVertex.hh"
namespace uhh2bacon {
Selection::Selection(uhh2::Context & ctx) :
context(ctx),
event(0)
{
h_jets = context.declare_event_input<TClonesArray>("Jet05");
h_e... |
88d207fc97431bfbf8e81a23742ff7ddf0250d96 | 1ef14a2a52d6844bd931f80a556629f5f9c11349 | /goopdate/config_manager_unittest.cc | 0f9684c4690f3b4ebe813f03e4ce9b0cb3326fb8 | [
"Apache-2.0"
] | permissive | pauldotknopf/omaha | c61a58dee395a70e658f53a7b33cefab9fed5eb6 | 7f70869253aeebadb4f52db5306bde5571d71524 | refs/heads/master | 2020-04-11T12:21:03.800672 | 2011-08-17T01:07:48 | 2011-08-17T01:07:48 | 32,242,630 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 73,461 | cc | config_manager_unittest.cc | // Copyright 2007-2010 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed ... |
a00056506df2b8be83108118370455f3387bf2ee | c8b39acfd4a857dc15ed3375e0d93e75fa3f1f64 | /Engine/Source/ThirdParty/WebRTC/rev.9862/lib/Win64/VS2013/include/webrtc/video_frame.h | d70a746daeb49334193c99d522cefd275615981c | [
"MIT",
"LicenseRef-scancode-proprietary-license"
] | permissive | windystrife/UnrealEngine_NVIDIAGameWorks | c3c7863083653caf1bc67d3ef104fb4b9f302e2a | b50e6338a7c5b26374d66306ebc7807541ff815e | refs/heads/4.18-GameWorks | 2023-03-11T02:50:08.471040 | 2022-01-13T20:50:29 | 2022-01-13T20:50:29 | 124,100,479 | 262 | 179 | MIT | 2022-12-16T05:36:38 | 2018-03-06T15:44:09 | C++ | UTF-8 | C++ | false | false | 6,776 | h | video_frame.h | /*
* Copyright (c) 2014 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contribut... |
d539229f84b690074c371c9a0c80255fc62b2651 | 1a1d7a5b9801257e24173860f82b71140ffff0c4 | /work2/sudoku/sudoku/generator.h | e724508b3f61825db48eb4da48d1f06ea78a1d37 | [] | no_license | Ananileaf/rgsj | ed6656e975318cf5c509f78c6bf723fc3d16e981 | e0c497f74364fcec0d195a86f7ed47fc50acf363 | refs/heads/master | 2021-01-23T15:16:55.035723 | 2017-09-10T13:07:43 | 2017-09-10T13:07:43 | 102,704,473 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 823 | h | generator.h | #pragma once
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define mem(x, y) memset(x, y, sizeof(x));
#define mem0(x) mem(x,0)
#define rep(i,a,b) for(int i=a;i<(b);++i)
class generator
{
public:
int n; //输入
int ans; //搜索到的方案数
int belong[10][10]; //每一个格子属于哪一个九宫格
char ways[10][1... |
d12030668da960b1ffc21b0ac35e96db91113e35 | 6630e282d188fc42339d46dd5989e86ce79c7832 | /sokoban_c++/main.cpp | 0943130b72dfdd7dd3bb47e740e7e0a0da261b03 | [] | no_license | izemaghilas/sokoban | e5e6e68be7583dd5328b40ee0cc686638d46d072 | f7a363879c46ab5e11b083a1c1c687e3735fbfb6 | refs/heads/master | 2022-12-30T03:51:44.432629 | 2020-10-19T21:14:03 | 2020-10-19T21:14:03 | 298,287,297 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 977 | cpp | main.cpp | /**
* point d'enter de programme sokoban
*/
#include <iostream>
#include <SDL.h>
#include <SDL_image.h>
#include "initializer.h"
#include "screenhandler.h"
#include "eventhandler.h"
using namespace std;
const int WIDTH = 480;
const int HEIGHT = 480;
//window
SDL_Window *sokoban_window = NULL;
//main renderer
SDL_... |
65085bafef06c24383315e04d81df384fdab7b80 | b7e38c7d1598dd459c33fb6522b0009acce7a30d | /11. 그래프 기본 탐색/BOJ_8111/BOJ_8111.cpp | 267ea3306bc818b6d1a64fcb27a9346550bf9750 | [] | no_license | reach0908/BOJ | a31def6073f7c2c427815db3a847370d5b27da0b | 582af2e9a16df384828277b507f0b86f21093e4d | refs/heads/master | 2023-04-06T08:23:09.026918 | 2021-04-18T14:37:07 | 2021-04-18T14:37:07 | 289,498,306 | 1 | 0 | null | 2021-04-18T14:37:08 | 2020-08-22T14:00:33 | C++ | UTF-8 | C++ | false | false | 1,174 | cpp | BOJ_8111.cpp | #include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int MAX = 20000+1;
int t,n;
bool visited[MAX];
pair<int,char> arr[MAX];
void BFS(){
queue<int> q;
q.push(1);
visited[1]=true;
arr[1].first=-1;
arr[1].second='1';
while (!q.empty())
{
int temp = q.fron... |
fad266f6734a67075b6c489833c2c4fa172d8967 | 4ac75107a576670f0843c87437b565b38358be5f | /src/model/jamp/jamp_pack_level.cpp | 264c7e750992f9378c04e147749e80ed970de80b | [
"MIT"
] | permissive | fjorge/pg-sdk-marmalade | d82c5ef60b7b175554d6a6fb7f587e01f8c74747 | 258407779baa6af44335fa543e1be4575845a162 | refs/heads/master | 2021-01-17T06:32:14.982634 | 2015-12-03T13:42:37 | 2015-12-03T13:42:37 | 36,661,743 | 0 | 0 | null | 2015-06-01T13:15:32 | 2015-06-01T13:15:32 | null | UTF-8 | C++ | false | false | 1,217 | cpp | jamp_pack_level.cpp | #include "jamp_pack_level.h"
int32 JampPackLevel::Deserialize(std::string jsonSrc)
{
if (jsonSrc.length() == 0)
return 0;
Reader reader;
Value value;
reader.parse(jsonSrc, value, false);
return DeserializeFromValue(value);
}
int32 JampPackLevel::DeserializeFromValue(Value src){
if (!src["levelId"].empty()... |
3786961d1bc3c71266fb84c112c80098bea95d22 | 78506f31e499339cca8e0cef00a80e5444bc1e72 | /utils/mnist_file_utils.h | 68f473a5bfdc0fb619201836f1936a541e5085be | [] | no_license | smelvinsky/mnist-clink-clustering | e07a16e9746d0ecd15572da81aa3ef445be6d6bc | e574f4b2580fb655ca51a8cded7f6e84b2d9d3ab | refs/heads/master | 2021-09-10T11:33:28.796354 | 2018-03-25T18:37:40 | 2018-03-25T18:37:40 | 113,115,599 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,674 | h | mnist_file_utils.h | /**
* Created by smelvinsky on 04.12.17.
*/
#ifndef MNIST_UTILS_H
#define MNIST_UTILS_H
/* image width in pixels */
#define MNIST_IMG_WIDTH 28
/* image height in pixels */
#define MNIST_IMG_HEIGHT 28
#include <cstdint>
#include <cstdio>
namespace MNIST_Utils
{
typedef struct MNIST_Image MNIST_Image;
typed... |
231db0ec52f2ce3541c050e700a9f94576a73952 | 964e032ab1c0d3c79f8040c5ecc5c86307325cdf | /BACKJOON/step1-9/step9/1002.cpp | a841d91b9c19357d479cadbc6283ade8788e9f89 | [] | no_license | kebi3477/Algorithm | cde2ddbcd5b5377a145d58de7f7cb02c322c5c7c | 77d9c4c6da712badeaadea795629f599ff2936eb | refs/heads/master | 2023-01-04T00:03:32.884934 | 2020-10-30T07:48:36 | 2020-10-30T07:48:36 | 285,833,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 531 | cpp | 1002.cpp | #include <stdio.h>
using namespace std;
int main(void) {
int t;
scanf("%d", &t);
for(int i = 0; i < t; i++) {
int x1, x2, y1, y2, r1, r2;
scanf("%d %d %d %d %d %d", &x1, &y1, &r1, &x2, &y2, &r2);
int d = (x2-x1) * (x2-x1) + (y2-y1) * (y2-y1);
int sum = (r1 + r2) * (r1 + r2);
int dif = (r1 - r2) * (r1 - r2... |
865a97b6f543f404832290c2d32e1a7ed63adefe | 38a724327679ba89a9a5383b79523476264c69b2 | /1 term/Ded-C/Substring/Substring_functions.cpp | d5adb6cbd0e15354954f750a3383ea64a2f192aa | [] | no_license | alexeyqu/mipt-alexeyqu | 3f0af5534a142082d8f9b10b36bbc9ae82daf6fe | 1059b0e9a95855a95d0bc6c7da564799dfc7c449 | refs/heads/master | 2021-01-21T04:39:39.719665 | 2017-10-11T16:28:20 | 2017-10-11T16:28:20 | 51,085,003 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,957 | cpp | Substring_functions.cpp | #include "Substring.h"
int get_str (char* str, int MaxLen)
{
ASSERT (str);
DBG printf ("Enter string: ");
int len = 0;
char c;
while ((c = getchar()) != EOF)
{
if (c == '\n')
{
break;
}
if (len >= MaxLen - 1)
{
printf ("You've ... |
d5a30d9351df099ad42d7ecb5c5ccef40d0e8099 | 66949a25a8764ff303887253f5dc3725b026336e | /HelloWorld/residueanalysis.cpp | 70f4e1967b31f584744e0599f7ac9960a0780de1 | [] | no_license | juniorprincewang/MRL | 7526ef76a1c564b7e8b4314e55e46e68faa944bb | b76fa14749e6241ea493d49dbd7b462dbdb5c66e | refs/heads/master | 2021-01-18T22:29:30.866122 | 2017-05-16T01:02:10 | 2017-05-16T01:02:10 | 72,534,367 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,606 | cpp | residueanalysis.cpp | #include "residueanalysis.h"
ResidueAnalysis::ResidueAnalysis(QWidget *parent)
:DataAnalysis(parent)
{
// 分布，残留计算方法，推荐残留值
QGridLayout *residuesLayout= new QGridLayout();
QLabel *distribution= new QLabel(QString("分布"), this);
distributionText = new QLineEdit(this);
QLabel *calcMethod= new QLabe... |
6a070e77e517e95a3d1567e4e52c4a91a88cf263 | b3fd6c4697a7990ca7ba387adfb9b43842ffc589 | /cf195D.cpp | 06abfacb77f80b2296ae9d1e6392b8dff90b0d84 | [] | no_license | jainrishabh98/CP | 48ab325fbfced6174778ec74e286b0874df9d82b | 3d244de1096c484bb663ac328655a879d1f28b54 | refs/heads/master | 2021-06-07T09:10:42.900663 | 2020-02-05T08:58:39 | 2020-02-05T08:58:39 | 150,934,959 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 935 | cpp | cf195D.cpp | #include <bits/stdc++.h>
using namespace std;
long long int a[100005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
long double k[n], b[n];
set<long double> s;
for (int i = 0; i < n; i++)
{
cin >> k[i] >> b[i];
if (k[i] != 0)
s.i... |
77b36aaf544c1bf0e1ad76d52a0f9aa8faed1d45 | 58e37a43d291d1884234f86b855b5f7da55725ef | /string/Day18/Q3.cpp | 2ea445ee50db2a1144dd2db970c38f24b8bbc142 | [] | no_license | shashank9aug/DSA_CB | 74337f8fb5dde5b94b380512dcec39a13e643690 | 1301329e4f9fd5105b4cb3c9d0f5c5772ed890ce | refs/heads/master | 2023-08-18T05:35:42.946559 | 2021-10-15T10:04:52 | 2021-10-15T10:04:52 | 370,120,570 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,428 | cpp | Q3.cpp | //check if two given strings are isomorphic to each other
/*
isomorphic : Two strings str1 and str2 are called isomorphic
if there is a one to one mapping possible for every character of
str1 to every character of str2 while preserving the order.
*/
// C++ program to check if two... |
4c78da5ea406ac32a5480f28fbf94a8d8458ce2b | c6039302b95d66b7c270cc4431ea96485b040fb7 | /include/SVF-FE/SymbolTableInfo.h | 2e0e43f48ee6da32bfe90f0ed383b15feb94c7c5 | [] | no_license | JasonZhongZexin/SVF-npm | 81d0ffc5586f239ff56ec4ff6963f71d7a66cfac | e38a1ea6cc409e28f91a4ef8d47a0fc09f53b65f | refs/heads/master | 2023-03-05T06:18:14.054656 | 2020-06-27T12:09:14 | 2020-06-27T12:09:14 | 275,357,174 | 0 | 0 | null | 2021-02-14T08:51:18 | 2020-06-27T11:22:57 | C++ | UTF-8 | C++ | false | false | 13,428 | h | SymbolTableInfo.h | //===- SymbolTableInfo.h -- Symbol information from IR------------------------//
//
// SVF: Static Value-Flow Analysis
//
// Copyright (C) <2013-> <Yulei Sui>
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as publi... |
bc8961b78db9bdcd67b798caae15e426e2e57054 | b600c25c4e6108831e4e29a7f9c363681d69fa79 | /include/cantera/thermo/Nasa9Poly1.h | 85ee184c1b04ed6b8859589c76454defb0db1b6d | [] | no_license | MrKingKong/cantera | d19f87cd59e1005a2e185a91a506297dfbf64fbd | 994c9d1afbe7089d7bfea78739ec4f5e7a907eb0 | refs/heads/master | 2021-01-20T17:07:07.407745 | 2016-04-17T03:55:51 | 2016-04-17T03:55:51 | 56,511,537 | 0 | 1 | null | 2016-04-18T13:49:13 | 2016-04-18T13:49:13 | null | UTF-8 | C++ | false | false | 4,978 | h | Nasa9Poly1.h | /**
* @file Nasa9Poly1.h Header for a single-species standard state object derived
* from \link Cantera::SpeciesThermoInterpType
* SpeciesThermoInterpType\endlink based on the NASA 9 coefficient
* temperature polynomial form applied to one temperature region (see \ref
* spthermo and class \link Can... |
2fd55515552a328cb5378e852df47971527b76a6 | dc521971da2b2984a276e3c6f946409c4b02ad1b | /four 4's/la5.h | cadf33c3e376538c5e56a00f67982d80f283cc91 | [] | no_license | sjakson/Cplusplus | 9146e362d06904564be61b3a3e8bc9749f171359 | 435a010e91907c269a7c8895ee133c5bc9490688 | refs/heads/master | 2021-06-15T02:00:26.361242 | 2021-02-19T08:32:09 | 2021-02-19T08:32:09 | 141,215,983 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,437 | h | la5.h | //Jackson, Scott 003092073
/*This is the header file that stores the expression tree node struct and the
expression tree struct*/
#ifndef EXPRNODE_H
#define EXPREODE_H
const int NUMBER = 0, // Values representing two kinds of nodes.
OPERATOR = 1;
#include<string>
#include<cmath>
#include<sstream>
#i... |
16811e93d715275a425ae6908e72cbcf16bd9efb | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/squid/gumtree/squid_repos_function_3462_squid-3.3.14.cpp | c79ed0ee28e1599208da2249351f098514e8dca2 | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 283 | cpp | squid_repos_function_3462_squid-3.3.14.cpp | void *
ClientSocketContext::operator new (size_t byteCount)
{
/* derived classes with different sizes must implement their own new */
assert (byteCount == sizeof (ClientSocketContext));
CBDATA_INIT_TYPE(ClientSocketContext);
return cbdataAlloc(ClientSocketContext);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.