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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
37d527d2103b2b2c295a13704377a58ac2c61244 | dd64a33ddef2f91d4b8f8f5de342388346cf1fe3 | /SmartPult/Common/Libs/Containers/Array.hpp | c81c2387d986780802d965ea4b47f22f37b9eef5 | [] | no_license | YoYoYoCool/SmartPultRepo | 24ba7bb01704e5d8899808d2c95b09b1566b7805 | fee682a6f748914ddc958afd75c9114fb09bef74 | refs/heads/master | 2023-03-22T23:53:41.633200 | 2023-03-10T07:46:22 | 2023-03-10T07:46:22 | 166,993,654 | 1 | 1 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 1,148 | hpp | Array.hpp | /*
* Array.hpp
*
* Created on: 6 ÿíâ. 2019 ã.
* Author: KapustinIV
*/
#ifndef LIBS_CONTAINERS_ARRAY_HPP_
#define LIBS_CONTAINERS_ARRAY_HPP_
#include "stdint.h"
#include "stddef.h"
namespace Containers {
template<typename TData>
class Array {
protected:
TData* data;
size_t size;
public:
inline... |
0746e769922cb8bdfcb0787b5dbec00a8ba16a9e | 73b329e4becd3045989e17fbc0c6aed3d46b5854 | /Likelihood/11231LikelihoodDistance/EvaluateLikelihoodDistance.cpp | 429b38a1e6273781359390d73015bd7f3c5fc02a | [] | no_license | FHead/PhysicsHiggsProperties | 36ee6edd9b4a744c41ae8eda58d3b0979e02868d | 25e2cf36b633403a7661488167279a917b76882c | refs/heads/master | 2023-06-01T12:58:09.411729 | 2020-05-05T20:47:51 | 2020-05-05T20:47:51 | 377,256,404 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,352 | cpp | EvaluateLikelihoodDistance.cpp | //----------------------------------------------------------------------------
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
//----------------------------------------------------------------------------
#include "DrawRandom2.h"
#include "ProgressBar.h"
//--------------------------------... |
fe2a32ed9726f4c05ec7145831b6860d304f52f1 | 876c7dba66959a02d00ba300adcf64285085ae85 | /Info/Make them odd/main.cpp | da55386ee7c6824307a88c1272452bd61cc700a8 | [] | no_license | viftode4/PBINFOOOO | 69b36ce9458e03061fec67981904b3fb2485430b | 8aebb5488f91735218404c36a983e23d833f2d1d | refs/heads/master | 2023-04-23T12:39:14.031554 | 2021-05-18T17:54:51 | 2021-05-18T17:54:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 719 | cpp | main.cpp | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
int t, n;
int a[200005];
int main()
{
cin >> t;
while( t-- )
{
cin >> n;
map<int, int>m;
int sol = 0;
for( int i = 1; i <= n; i++ )
{
cin... |
7a7994e28984e1f863c9666b4e4a0d73a47bdc11 | 135dfa52b096716e3aa7cec643667b5b34f5166c | /toy_tracer/core/rendertext.h | 594b4a682f56b9ba95369a731cf0f86092286405 | [] | no_license | Sefaice/toy-renderer | d944e64b487407b0d5aad9621eb1c3b15e75f27e | 876d15d2b2864ebda0ad66d4aecd6018d092a1f3 | refs/heads/master | 2022-12-04T03:27:34.422136 | 2020-06-24T10:11:45 | 2020-06-24T10:11:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 527 | h | rendertext.h | #pragma once
#include "core/geometry.h"
#include "glad/glad.h"
struct Character {
GLuint TextureID; // ID handle of the glyph texture
Vector2i Size; // Size of glyph
Vector2i Bearing; // Offset from baseline to left/top of glyph
GLuint Advance; // Offset to advance to next g... |
0568baf1fd19b56d1318f220e8bd4a2697dec297 | efe44bbc64cf788768d73e35cfb1baa2098181f6 | /pmlc/dialect/pxa/analysis/uses.cc | da90b8dadf5845cf2175c7823608c8e7612dbda7 | [
"Apache-2.0"
] | permissive | plaidml/plaidml | d2dd18f8228d3959ec875b66aa4ff31f6c29ef00 | 49fbaa5ac387e621f11ba0b81f49461e4b2d02ef | refs/heads/plaidml-v1 | 2023-08-09T18:38:07.681422 | 2023-07-23T20:15:07 | 2023-07-23T20:15:07 | 100,326,126 | 4,779 | 516 | Apache-2.0 | 2023-02-14T21:33:05 | 2017-08-15T01:43:24 | C++ | UTF-8 | C++ | false | false | 5,326 | cc | uses.cc | // Copyright 2020 Intel Corporation
#include "pmlc/dialect/pxa/analysis/uses.h"
#include "llvm/ADT/TypeSwitch.h"
#include "pmlc/dialect/layer/ir/ops.h"
#include "pmlc/dialect/stdx/ir/ops.h"
#include "pmlc/util/logging.h"
using namespace mlir; // NOLINT
namespace pmlc::dialect::pxa {
Value getPrevIndirectDef(OpResu... |
07c99c3c6f51252fd6ca4a5d6bd47d2c70fae33f | bf20c75c2c957429eb592fc81ac4317f1a7d1a22 | /HW3/scene/property_render.cpp | 8c3ce6904b20812573ad5daad6bcd493fcfabd54 | [] | no_license | SonSang/Course-Project_Advanced-Animation | ae43c4dd7e4638d81e2c6bb4f4ad51a20ffb90bb | 9f81d30834c2fffea33cc84f5214d7db78291cc6 | refs/heads/master | 2022-12-08T19:43:34.875697 | 2020-08-30T08:06:27 | 2020-08-30T08:06:27 | 291,422,686 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 484 | cpp | property_render.cpp | #include "property_render.hpp"
property_render::property_render(const std::string &name_) : name(name_)
{
}
const std::string &property_render::get_name() const noexcept
{
return this->name;
}
void property_render::set_name(const std::string &name)
{
this->name = name;
}
bool property_render::is_valid() const ... |
926d22c2e3c7ff3903897e32456f34c3b5114fdc | 54faf1a50bee9ad9f6f17beab4df1ba78cd176aa | /src/GpsMarker/SdkModel/GpsMarkerController.h | 2a49981129c2cf242b479e1785f7c26b2646303b | [
"BSD-2-Clause"
] | permissive | TomHaygarth/eegeo-example-app | b3a4a4f38e41b625acc131234b8a43cd39ebe635 | 74712ff59a20f80682f1d884660151fb21457643 | refs/heads/master | 2021-01-14T08:10:40.177330 | 2017-02-14T13:08:02 | 2017-02-14T13:08:02 | 82,004,395 | 1 | 0 | null | 2017-02-15T00:51:29 | 2017-02-15T00:51:29 | null | UTF-8 | C++ | false | false | 3,909 | h | GpsMarkerController.h | // Copyright eeGeo Ltd (2012-2015), All Rights Reserved
#pragma once
#include "IGpsMarkerController.h"
#include "GpsMarker.h"
#include "BidirectionalBus.h"
#include "ICallback.h"
#include "ModalityChangedMessage.h"
#include "Rendering.h"
#include "IVisualMapService.h"
namespace ExampleApp
{
namespace GpsMarker
... |
60343f18f3821b9efd1371886af58a410e4d35ad | 97eb17ce805e762982c1b09647ea3f251fa0ea0b | /Hoe3D/src/sound.h | 052848672922a414e8d2cd6b4e2d7a616b043d20 | [] | no_license | HeimdallTeam/Hoe3D | 8ca6d434b298773abc3d8c324822df3b97f5d19a | 62c6547ee5751ca6da31fa5379c6a0b78bafe5bd | refs/heads/master | 2021-01-15T14:24:35.777027 | 2014-10-03T23:11:14 | 2014-10-03T23:11:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,984 | h | sound.h |
/**
@file sound.h
@date Sep 2004
@version $Revision: 1.10 $
@brief Hlavni soubor se zvukem.
*/
#ifndef _HOE_SOUND_
#define _HOE_SOUND_
#include "../include/hoeinterfaces.h"
#if defined (_USE_D3D9_) || defined (_USE_D3D8_)
#include "sound_ds.h"
#endif
#ifdef _USE_OPENGL_
#include "sound_al.h"
#... |
4680d869311c0524229205072021c1b2ce92d5b4 | ffb568806e34199501c4ca6b61ac86ee9cc8de2e | /poke_lib/pml/src/personal/pml_GrowTableCache.cpp | 48ae6854ce34f8e3934423e649acd453745e1449 | [] | no_license | Fumikage8/gen7-source | 433fb475695b2d5ffada25a45999f98419b75b6b | f2f572b8355d043beb468004f5e293b490747953 | refs/heads/main | 2023-01-06T00:00:14.171807 | 2020-10-20T18:49:53 | 2020-10-20T18:49:53 | 305,500,113 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,753 | cpp | pml_GrowTableCache.cpp | //=============================================================================
/**
* @brief 成長曲線テーブルのキャッシュ管理
* @file pml_GrowTableCache.cpp
* @author obata_toshihiro
* @date 2011.01.11
*/
//=============================================================================
#include <heap/include/gfl2_Heap... |
383c6ecd1fa29b06174ec466b977739f360babb3 | 17353cfd2c984f2b57ab09dce5b793f34b051f19 | /src/plugProjectMorimuraU/egg.cpp | edcdb566f993a7aa2eefa6c02cc9c773959ec099 | [] | no_license | mxygon/pikmin2 | 573df84b127b27f1c5db6be22680b63fd34565d5 | fa16b706d562d3f276406d8a87e01ad541515737 | refs/heads/main | 2023-09-02T06:56:56.216154 | 2021-11-12T09:34:26 | 2021-11-12T09:34:26 | 427,367,127 | 1 | 0 | null | 2021-11-12T13:19:54 | 2021-11-12T13:19:53 | null | UTF-8 | C++ | false | false | 25,322 | cpp | egg.cpp | #include "types.h"
namespace Game {
/*
* --INFO--
* Address: 8034BB30
* Size: 000020
*/
void Egg::Obj::setParameters(void)
{
/*
.loc_0x0:
stwu r1, -0x10(r1)
mflr r0
stw r0, 0x14(r1)
bl -0x248F64
lwz r0, 0x14(r1)
mtlr r0
addi r1, r1, 0x10
blr
*/
}
... |
a6f4b35bd48d29ed6e06f39ffe8489766f84b50f | 29ec7606e313717eac54023f6646ef84b30259b0 | /ardurover1.2.ino | 699336035455f6bd4ae4a29834e5b685b469e935 | [] | no_license | sTVG/ardurover1.2 | 82ebab2214198766b511a826fd9d2730f3a47ed7 | 844012d1f9c54f084911885c4e5fb4f062fcfb7d | refs/heads/master | 2020-05-18T16:33:21.055068 | 2015-04-29T18:48:59 | 2015-04-29T18:48:59 | 34,814,464 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,714 | ino | ardurover1.2.ino | /* This is my first public code, and draws heavily on code from Iain Portalupi L298N_Dual_H_Bridge
This program controls an ultrasonic sensor rover using L298N H Bridge Chip and SG04 sensor
Made with the help of http://themakerspace.co.za
*THE MOTOR SUBROUTINES WORK AS FOLLOWS*
motorA(mode, speed)
% repl... |
592a9bd80c67daf346641cb916f38089e75eeefe | e0d8f27f590a0b7b2330b5a391319b07ba823635 | /source/Rendering/Renderer.cpp | 1e1437c0af35b94859a3a35cce64cb12520a323c | [] | no_license | FiskNi/Project-Kiddo | 0c2a74b6989ac6236f88d94aa3004d40c5debd50 | 516ef59ea503ccca211d231aa4d2eb14d929e2cc | refs/heads/master | 2021-07-10T02:56:42.479967 | 2020-08-24T13:17:41 | 2020-08-24T13:17:41 | 180,403,595 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,276 | cpp | Renderer.cpp | #include "Renderer.h"
Renderer::Renderer()
{
boneBuffer = 0;
gVertexBuffer = 0;
gVertexAttribute = 0;
gVertexBufferMain = 0;
gVertexAttributeMain = 0;
gVertexBufferPause = 0;
gVertexAttributePause = 0;
gVertexBufferCollectible = 0;
gVertexAttributeCollectible = 0;
initWindow(WIDTH, HEIGHT);
// Creates... |
9b2299c4cec243eec069fdfecde00b9eda3b12d7 | 7ddc1283ec3398ac556b85a2714bdfd4e4252e6b | /ctci/arras_and_strings/test.cpp | 1c95aa8ac07079972841ccca016060401ce8cad1 | [] | no_license | sathishkumark27/LearningNewCPPFeatures | fdbc5e4ec25d04fa49086e03a91d3fbd0b55adc5 | 0240520781b644a31258e7e3e59622d8eec06815 | refs/heads/master | 2021-03-16T21:15:00.798668 | 2020-03-12T23:32:03 | 2020-03-12T23:32:03 | 246,944,017 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | cpp | test.cpp | #include<iostream>
#include<vector>
#include<utility>
#include<unordered_map>
using namespace std;
int main()
{
vector<pair<int, int>> index;
auto idx = make_pair(10, 20.2);
unordered_map<int, int> umap;
for (auto i=0; i<5; i++)
{
//cout<<"at "<< umap.at(1)<<endl; -- throus out of range e... |
76ef3f6b59c1aef8d1a8c0cc1881741cdb024889 | 1a78ff572bdde1537a26d1370f4aa8ff9fbc0cd5 | /bronze/16jan/angry-cows.cpp | 97ef54e67f07c9ead8cbdcac5d12038723e614f9 | [] | no_license | ktxfish/usaco | 97816fccbf677f92659338f4e2cb1ed08950ea24 | 5f21ccd90d7a5a907f09a4c5fe8ce55d1e6bfb50 | refs/heads/master | 2023-02-27T06:05:10.332272 | 2021-01-28T16:06:33 | 2021-01-28T16:06:33 | 325,891,186 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 815 | cpp | angry-cows.cpp | #include <algorithm>
#include <fstream>
#define MAX_N 100
std::ifstream fin("angry.in");
std::ofstream fout("angry.out");
int N;
int loc[MAX_N];
int max_x;
int get_right(int n, int t) {
int i = n + 1;
while (i < N && loc[i] - loc[n] <= t)
++i;
if (i == n + 1)
return n;
return get_rig... |
9dbd7abee5765978c861c39cf66ddaad3a10e968 | 74de01e33ac16a4972a9dffb1829337d1ba14a45 | /src/Interpreter/Interpreter.h | dc2774f9fcbea66988dc7c4da5d8278bd6a368e5 | [] | no_license | pierre-24/nxt-interpreter | bbf3b94cd7783bd39b92680a35acb70334d9545e | f7752c2bfa78664cd5a41e1de02a4beac1539f22 | refs/heads/master | 2021-05-23T08:11:49.767035 | 2020-05-04T19:12:51 | 2020-05-04T19:12:51 | 253,191,704 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,127 | h | Interpreter.h | //
// Created by pierre on 06/04/2020.
//
#include <list>
class RXEFile;
class System;
class VMMemory;
class InterpreterThread;
/*!
* @abstract Interpreter object, implement a basic threading mechanism.
* @discussion Every scheduled clump run on a different virtual thread.
* When `runForTicks()` is called, every ... |
2fa23054acb5cd48b6d33413e26c52c951c41412 | de0524250a32e3734b3d972618b663738dbdaa45 | /Zadania_Programowanie/SPOJ/hangman.cpp | e3ad017e747ba41f61a484727194865ed870e604 | [] | no_license | Kitee666/UMK | 9702b8e83520194aae586aa48e27f5cb8e502d25 | 62ce69ba0e4ac323b6b702e80ef5f6c83f009c74 | refs/heads/main | 2023-05-28T09:40:27.913257 | 2021-06-07T10:32:45 | 2021-06-07T10:32:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,601 | cpp | hangman.cpp | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void wypisz1(int blad)
{
char skos = 92;
string l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11, l12, l13, l14;
// 0 bledow
l1 = "+---------------------+\n";
l2 = "| ____________ |\n";
l3 = "| |/ |\n";
... |
1f5b1b08781ae36b4289cb26cd423ae27074c598 | ff18be417439435d0db3756181a9e98c55cf25e3 | /ACM-ICPC/ACM-ICPC_12/Amritapuri/online contest/ACM-ICPC Amritapuri 2012 Online Competition Accepted Solutions/B/cpp/00004014_B_STICKS_amicpc120090.cpp | 2079ff6add9cafd64aac6d3ab3d7ece8bd6888dc | [] | no_license | rovinbhandari/Programming_Scripting | 3952b45636f10e46c05dede29492eb0828857448 | ee67f9289883d3686ed5cf41dbae13e1313bcfb0 | refs/heads/master | 2023-06-22T13:52:03.559222 | 2023-06-20T13:40:32 | 2023-06-20T13:47:22 | 4,378,004 | 6 | 1 | null | 2019-03-25T14:44:18 | 2012-05-19T12:25:13 | C++ | UTF-8 | C++ | false | false | 1,139 | cpp | 00004014_B_STICKS_amicpc120090.cpp | // LIBRARIES
#include<iostream>
#include<cstdio>
#include<cmath>
#include<sstream>
#include<algorithm>
// DATA STRUCTURES
#include<string>
#include<list>
#include<queue>
#include<stack>
#include<vector>
#include<map>
// OTHERS
#define L(a) list< a >
#define V(a) vector< a >
#define S(a) stack< a >
#define Q(a) queue<... |
6ffcee48515c55365db0f3a4985e8913c25a38fa | a5d35f7adb05489c16579d987c3d8da1fa0e7920 | /HackerEarth/CodeMonk/DynP/hanoi.cpp | 877bfb32aa50a2202a247035a1d8d15e04632681 | [] | no_license | rajdosi/Codes | 56cfcc7d73bce0399e34ef171210a05ae34a2724 | 9cf9bdd58bc6239d5096f18040c7df0b4cbf50ae | refs/heads/master | 2022-01-09T23:35:17.571544 | 2022-01-08T11:58:49 | 2022-01-08T11:58:49 | 70,044,918 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 818 | cpp | hanoi.cpp | # include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while (t--) {
int n;
cin>>n;
vector<pair<long long, long long>> radiusHeightPairs;
for (int i=0;i<n;i++) {
long long rI,hI;
cin>>rI>>hI;
radiusHeightPairs.push_back(make_pair(rI,hI));
}
sort(radiusHeightPairs.begin... |
27bed6ddf7a1626ba72e13b6f78fe3c69014ef56 | cc8c46b5b02e707420b78af16d53100ede933726 | /src/cards_abstraction/bucketing_provider.h | c3dd4bb6c34084d1527c435b7434ffe7a3228e59 | [] | no_license | martun/evn_open_poker | 918aa10c0d257995c836a1e005ec7040d8b66b4a | 2047ff655ed08c6e7df9666e7e41f91135b0ff82 | refs/heads/master | 2021-01-25T14:33:50.665656 | 2018-09-12T08:10:28 | 2018-09-12T08:10:28 | 123,712,244 | 2 | 2 | null | 2018-04-12T18:53:41 | 2018-03-03T16:55:11 | C++ | UTF-8 | C++ | false | false | 1,165 | h | bucketing_provider.h | #pragma once
#include <stdint.h>
#include <vector>
#include "bucket_config.h"
#include "card.h"
#include "Utils.h"
// Abstract class for all bucketing providers.
class BucketingProvider
{
public:
BucketingProvider(const BucketConfig& config);
/** \brief Given public cards already dealt, returns the buc... |
5ea9ca24e693360c8a9014c4712a5bef1df4d3c2 | 12bc46a83e8d1d1295613e26250ed2d13f2fff13 | /Chapter5/Hash Table Separate Chaining/Src/Hash_Tab.cpp | 80443eec9772e126902b5b2109283cda3e4f3319 | [] | no_license | baidengtian/Data-Structures-and-Algorithm-Analysis-in-C- | 99c79c9a519ca06d42f41e671d256d509e97eba7 | da99d42639999adef171eaa54dba30f082745d95 | refs/heads/master | 2022-07-17T19:25:45.971537 | 2020-05-07T08:34:59 | 2020-05-07T08:34:59 | 261,414,809 | 2 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 239 | cpp | Hash_Tab.cpp | /*
* @Author: your name
* @Date: 2020-02-11 16:31:25
* @LastEditTime : 2020-02-13 21:45:34
* @LastEditors : Please set LastEditors
* @Description: SplayTree Àà
* @FilePath: \Splay Tree\Src\SplayTree.cpp
*/
#include "Hash_Tab.h"
|
eebe2d96d99a1b3bb66f177e2987cc29fda8799b | 6c05da7dc517898a0b8662a7348e799213f5cd9d | /DesignPatternCode/DesignPatternCode/factory/ConcreteProduct.h | 18730376d2809315134a8b036acc0bf9c10f07cc | [] | no_license | howard-scu/DesignPatternNotes | fa1ecb50424daee3db6cf7c6997f0cfba040a0af | 060d4bb0ab149ecd479130f3823a4cde7e18135a | refs/heads/master | 2020-07-11T22:31:39.053535 | 2019-09-26T08:24:23 | 2019-09-26T08:24:23 | 204,657,743 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 322 | h | ConcreteProduct.h | #ifndef ConcreteProduct_h
#define ConcreteProduct_h
#include "Product.h"
class ConcreteProduct : public Product
{
public:
ConcreteProduct()
{
cout << "ConcreteProduct::ConcreteProduct()" << endl;
}
~ConcreteProduct()
{
cout << "ConcreteProduct::~ConcreteProduct()" << endl;
}
};
#endif // !ConcreteProduct_... |
87ce6d6d32f365c87359d66b6150666ddd7569ff | 0b15c7a046d703e153b6e6054cb57a0664a2d4df | /RobWork/src/rw/common/PropertyBase.hpp | c6a0e1c477b07518fceb4f96f8c0993049088331 | [
"Apache-2.0"
] | permissive | skyellen/robwork-mirror | bf5d97ce19775c2928432854a93fb87ab2f7cd26 | 5a74a49d9ef98eff7c75f48fe48c2e655480e9b3 | refs/heads/master | 2020-04-16T06:10:11.359979 | 2018-09-06T09:26:01 | 2018-09-06T09:26:01 | 165,335,340 | 4 | 0 | null | 2019-01-12T02:01:40 | 2019-01-12T02:01:40 | null | UTF-8 | C++ | false | false | 3,912 | hpp | PropertyBase.hpp | /********************************************************************************
* Copyright 2009 The Robotics Group, The Maersk Mc-Kinney Moller Institute,
* Faculty of Engineering, University of Southern Denmark
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file e... |
682259a92838c6771e4ae9be228b563b14689d63 | 36c88dd4a7a67fa3b375ee32a033ab1108b0d37d | /oops/ASS3/1.cpp | 7ddd229953fa752c638a4aef053c823374f1c982 | [] | no_license | Shivamsg/CollegeCodes | a4eff73c56606f613357a76742bcff3ab03f2d2b | d62003450eec6367db446c843e66c323c7648b1e | refs/heads/master | 2020-04-19T04:29:23.622860 | 2019-01-28T13:24:50 | 2019-01-28T13:24:50 | 167,963,973 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,377 | cpp | 1.cpp | #include<iostream>
using namespace std;
class complex{
int real,img;
public:
complex()
{
}
complex(int num)
{
real = num;
img = num;
}
complex(int a,int b)
{
real = a;
img = b;
}
friend complex add(complex&,complex&);
friend void... |
748aa8ce3be803c93c64d5be7b1f5e8970242ac7 | 47b285b9eecd4dca6832419bb299ed2e69b9e584 | /include/FreeCV/Stereo/UndistortAndRectify.h | b13e5d6105f29f99ccef186e4b1b02ca86a01457 | [] | no_license | arrfou90/FreeCV | 444f020133b4bf4542f481fe1158a379b10966c1 | 1392d8fcc0cfd14236f77f44b3cc480ec63e0396 | refs/heads/master | 2021-01-22T08:14:15.464860 | 2016-06-17T15:03:40 | 2016-06-17T15:13:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 734 | h | UndistortAndRectify.h | /*
* UndistortAndRectify.h
*
* Created on: 10.11.2015
* Author: andreas
*/
#ifndef FREECV_INCLUDE_FREECV_IMAGE_UNDISTORTANDRECTIFY_H_
#define FREECV_INCLUDE_FREECV_IMAGE_UNDISTORTANDRECTIFY_H_
#include "FreeCV/Image/Image.h"
#include "FreeCV/Core/Matrix.h"
namespace fcv {
class UndistortAndRectify {
publ... |
748e0a1c04ed7daf8dbe2fa96ddfbe7a2af9d7d5 | 88a6dcb6149300c0a3724fe454a882397711d4a3 | /State/src/main.cpp | 6d7014144f1b14a90cf42f289522e5faa5cc9a4c | [
"MIT"
] | permissive | rafaelfigueredog/EmbeddedDesignPatterns | 3fe08278917523fffc4d63826366cde0102c2529 | 298a05c7907f28a9470cee6bb367c2ba34487a9c | refs/heads/main | 2023-03-03T13:29:16.683915 | 2023-02-20T21:01:09 | 2023-02-20T21:01:09 | 317,401,440 | 1 | 0 | null | 2020-12-03T03:45:10 | 2020-12-01T02:23:14 | C++ | UTF-8 | C++ | false | false | 1,460 | cpp | main.cpp | #include <iostream>
#include <typeinfo>
class Context;
class State {
protected:
Context *context;
public:
virtual ~State() {
}
void setContext(Context *context) {
this->context = context;
}
virtual void Handle1() = 0;
virtual void Handle2() = 0;
};
class Context {
private:
State *state;
... |
781f345b7565a871747bd4b3deeac778b110958c | 94def6788b9b77ac8728e18ad2bed5cb116c2345 | /QuienEsQuien_resuelta/src/main.cpp | 56ae3a307481432ec7d73793031e8581e28a4264 | [] | no_license | layoel/QuienEsQuien | 9c22fe66201531ddb7b1905c8324604604249f22 | ed5acf1c7c0d11b1b1ca9f6299ac3954c3922517 | refs/heads/master | 2020-03-08T00:02:56.203345 | 2018-04-02T18:51:07 | 2018-04-02T18:51:07 | 127,796,709 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,399 | cpp | main.cpp | #include <fstream>
#include <iostream>
#include <string>
#include <math.h>
#include "../include/quienesquien.h"
using namespace std;
int main(int argc, char * argv[]){
bool jugar = false;
bool limpiar = false;
QuienEsQuien quienEsQuien;
if(argc == 2){
string parametroAleatorio = "aleatorio";
if(argv[1]== ... |
b6188d7a70e84ab73b49b9dd7f042381791b77a2 | b18ea10bd7dd81a705b0b9a19b15da73393e5ed4 | /DBModuleSolution/DBSchemaMaintainer/DBSchemaTableView.cpp | 8b2e5efa92c2d8ad64d191edf13af349764061c7 | [] | no_license | yedaoq/YedaoqCodeSpace | 90f56c37fbb0ba2e5b1d0854714acc531e3d9f42 | 523eb2eab61c958abba5dd5eeeb5944dee43b9a9 | refs/heads/master | 2021-01-02T09:52:25.642868 | 2018-07-03T12:36:44 | 2018-07-03T12:36:44 | 2,127,456 | 1 | 1 | null | null | null | null | GB18030 | C++ | false | false | 12,558 | cpp | DBSchemaTableView.cpp |
// DBSchemaTableView.cpp : CDBSchemaTableView 类的实现
//
#include "stdafx.h"
#include "DBSchemaMaintainer.h"
#include "DBSchemaMaintainerDoc.h"
#include "DBSchemaTableView.h"
#include "DBSchemaInfoRecord.h"
#include "Helper.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
using namespace NSYedaoqLayout;
// CDBSchemaTabl... |
190fc182b7ad0598ef6af6ba9856871af076e60f | f0610b8452d1addcb026144516550829a558616f | /UVA/10860 - Many a Little makes a Mickle.cpp | 81238e0d50686085a84acf026a5deb399c933102 | [] | no_license | ahmedelsaie/AlgorithmsProblems | dd8578e04590e71c13f7aa0cb02f77bea4599beb | acdfc86ef642c5249a15f59bcea10a31d7c58d0d | refs/heads/master | 2021-09-17T11:23:48.711877 | 2018-06-26T01:07:16 | 2018-06-26T01:07:16 | 115,373,592 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,061 | cpp | 10860 - Many a Little makes a Mickle.cpp | #include <stdio.h>
#include <cstring>
char arr[10005];
struct word
{
char str[105];
int l;
};
word subwords[55];
int dp[10005];
int dp2[10005][55];
int length, num_subwords;
const int inf = 99999999;
int fn(int left);
int fit(int x, int sub);
int min(int x, int y);
void reset();
int main()
{
int cases, p ... |
04fa7a8731340c7dc96d6dba50070b1801eb2734 | f585f8a210ba9020331173d8109bc2a28c9ed4ef | /homeworks/hw08/solutions/task04.cpp | 9bb3f33942ee33bc6f1772a18b4364417a8c9a02 | [] | no_license | geosabev/FMI-DSA-2020-2021 | 76de63f476b0d50c3b0612dfb9e7c854f83ca350 | 97824c6237a68fb8032207cb0568932c0a1ded59 | refs/heads/main | 2023-06-14T02:22:20.451257 | 2021-07-12T09:18:25 | 2021-07-12T09:18:25 | 317,488,917 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,287 | cpp | task04.cpp | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
using namespace std;
long long n, k, q;
vector<vector<long long>> points;
long long distance(const vector<long long>& point1, const vector<long long>& point2)
{
long long result = 0;
for (long lo... |
c500cc9b3d89cd87fd58209a8b5976d47fee14d0 | a2f6660488fed555d720cc0df72ae2cfd526d0ec | /src/mpepc/evaluation/path_summary.cpp | 5d09238836e76f8063322c3f850ad924c5eaf885 | [
"MIT"
] | permissive | h2ssh/Vulcan | 91a517fb89dbed8ec8c126ee8165dc2b2142896f | cc46ec79fea43227d578bee39cb4129ad9bb1603 | refs/heads/master | 2022-05-03T02:31:24.433878 | 2019-05-04T17:12:12 | 2019-05-04T17:12:12 | 184,834,960 | 6 | 11 | NOASSERTION | 2022-04-29T02:03:07 | 2019-05-04T00:21:10 | C++ | UTF-8 | C++ | false | false | 1,952 | cpp | path_summary.cpp | /* Copyright (C) 2010-2019, The Regents of The University of Michigan.
All rights reserved.
This software was developed as part of the The Vulcan project in the Intelligent Robotics Lab
under the direction of Benjamin Kuipers, kuipers@umich.edu. Use of this code is governed by an
MIT-style License that can be foun... |
593e48f3ab3096732e16f59364fbbcf020bde305 | 59d05137eaa1c0db25c6e8aebd3f978b5a8fef56 | /database/clickhouse_redundancy_t.hpp | c479a5aafc873f1029b6d1b1ba3669dec2e1c86b | [
"MIT"
] | permissive | dioptra-io/diamond-miner-cpp | 9e6925a1379e1591210270e0eb1ad6aadddb9a02 | 8f41e3211bdbdc96eecd57f6fb3c459b0350d3e5 | refs/heads/master | 2021-01-08T23:24:56.381179 | 2020-11-19T09:47:44 | 2020-11-19T09:47:44 | 242,174,772 | 0 | 1 | MIT | 2020-07-26T11:20:14 | 2020-02-21T15:48:44 | C++ | UTF-8 | C++ | false | false | 343 | hpp | clickhouse_redundancy_t.hpp | //
// Created by System Administrator on 2019-07-23.
//
#ifndef HEARTBEAT_CLICKHOUSE_REDUNDANCY_T_HPP
#define HEARTBEAT_CLICKHOUSE_REDUNDANCY_T_HPP
#include <clickhouse_t.hpp>
class clickhouse_redundancy_t : public clickhouse_t{
clickhouse_redundancy_t(const std::string& host);
};
#endif //HEARTBEAT_CLICK... |
44639b0c961a467ddb14694b6c2aa6b1d753a8bb | e9cb1818bde5c0c544df0366d51420863b0a5c54 | /day03/ex01/ScavTrap.hpp | 0a23acb5b49b13fe0c7529605254676bc3b7898f | [] | no_license | vdoroshyn/42-cpp-piscine | 2ba1ac72a74a2b8e1980b041d4411bd95139f160 | 3f795bd2bf6666007606aff14a8b5d0925168f11 | refs/heads/master | 2021-05-16T15:58:57.590386 | 2018-01-30T12:58:12 | 2018-01-30T12:58:12 | 119,534,885 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,089 | hpp | ScavTrap.hpp | #ifndef SCAVTRAP_HPP
#define SCAVTRAP_HPP
#include <iostream>
#include <string>
#include <cstdlib>
#include <ctime>
class ScavTrap {
public:
ScavTrap();
ScavTrap(std::string name);
ScavTrap(ScavTrap const& src);
~ScavTrap();
void rangedAttack(std::string const& target);
void meleeAttack(std::string ... |
8179a39570ad3062db2c81fb282236ff369a6439 | 3e1c801efa0ccec9e018e35ed2720d9ff0b4f81f | /src/gameplay/bgeffects/top_cubetunnel.h | bb5b61ab5fdef72d830f2135035b7bbe46a0853b | [
"MIT"
] | permissive | kayateia/feetoffury | 4f3304b8371ab4aefdde28b5a6fb926b1c0342c6 | b3613c11dfdc8b287bd55f3b10dea70306de6261 | refs/heads/master | 2020-03-31T04:26:02.393040 | 2018-10-07T04:07:26 | 2018-10-07T04:07:26 | 151,904,873 | 9 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 524 | h | top_cubetunnel.h | /*
Feet of Fury
gameplay/bgeffects/top_cubetunnel.h
Copyright (C)2002 Cryptic Allusion, LLC
*/
#ifndef __TOP_CUBETUNNEL_H
#define __TOP_CUBETUNNEL_H
#include "cubetunnel.h"
// A bubble field (like char select)
class TopCubeTunnel : public TopDrawable {
public:
TopCubeTunnel(Texture * txr, b... |
a6b4317f51c664723bf4627a50680c860f33e441 | a8fdd77a0b6af032033f1d0466410e9b27612d33 | /vme_drs_v5.1_tdc/daq/src/exec_daq_main.cc | c7a82ce1f68247a1b9b473f0fc546a6811ab5cf5 | [] | no_license | HidemitsuAsano/daqmw_elph201710 | e3093ed1845b4ec6665d97697e7916adac1ee592 | ae3df8d44660ef5f6b1d587e7858cef4c42f0cf3 | refs/heads/master | 2021-08-23T10:17:47.423251 | 2017-11-12T06:07:11 | 2017-11-12T06:07:11 | 108,068,665 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 616 | cc | exec_daq_main.cc | #include"control_funcs.hh"
#include"daq_funcs.hh"
int main(int argc, char* argv[]){
if(1 == argc){
std::cout << "Usage\n";
std::cout << "exec_daq [ip address] [run_no] [event_no]" << std::endl;
return 0;
}
(void) signal(SIGINT, UserStop_FromCtrlC);
// body ---------------------------------------... |
56bb2b00a6054a8136065685a865b253f36f78e9 | 93294d148df93b4378f59ac815476919273d425f | /src/FedSrv/CSteamAchievements.cpp | 7dc4e31910c3ebc8f7f7547fe3cb9f5eb4fc9652 | [
"MIT"
] | permissive | FreeAllegiance/Allegiance | f1addb3b26efb6b8518705a0b0300974820333c3 | 3856ebcd8c35a6d63dbf398a4bc7f0264d6c823c | refs/heads/master | 2023-07-06T17:53:24.363387 | 2023-06-29T00:24:26 | 2023-06-29T00:24:26 | 98,829,929 | 86 | 34 | MIT | 2023-06-28T03:57:34 | 2017-07-30T23:09:14 | C++ | UTF-8 | C++ | false | false | 15,557 | cpp | CSteamAchievements.cpp | #include "pch.h"
#include <inttypes.h> // BT - STEAM
// BT - STEAM
CSteamAchievements::CSteamAchievements(CSteamID &steamID) :
m_steamID(steamID),
m_gotRequestStatsResponse(false),
m_gotSuccessfulRequestStatsResponse(false),
m_gotStatsStoredResponse(false),
m_gotSuccessfulStatsStoredResponse(false),
m_nanAc... |
25a43ee7d94318c67fd8f687c12f000ec0eb7d2d | 4dc83b8492043e29e7d1fac8a79c124aedbb78c4 | /Lecture 7/array_basics.cpp | 1c056f3986878cf515537d61a0d63d25447cbf76 | [] | no_license | khandelwalpranav05/Launchpad-11-August | 887bdf9b131bfbd3caa11de0a93fb028a2740fd0 | fff86c27a16c627f0c863f5be6ea30941f61facc | refs/heads/master | 2021-07-10T07:38:27.508235 | 2020-10-06T03:32:41 | 2020-10-06T03:32:41 | 202,844,125 | 8 | 15 | null | 2020-10-06T03:32:43 | 2019-08-17T06:22:11 | C++ | UTF-8 | C++ | false | false | 458 | cpp | array_basics.cpp | #include <iostream>
using namespace std;
void swap(int arr[],int i,int j){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
int main(){
int arr[] = {1,2,3,4,5,6,7};
for(int i=0;i<7;i++){
cout<<arr[i]<<" ";
}
cout<<endl;
cout<<"*************************"<<endl;
cout<<arr<<endl;
cout<<(arr+1)<<endl;... |
06b55448125aeb5628cf5e9beaa540afd13cec0a | 55e0545f6475f1e9e01f797b1f72cc15fd2d30f9 | /C++/10.装饰器模式/DecoratorPatternDemo.cpp | bb31f374b2982b13a5d433fc1cd9a89b0d3304cf | [] | no_license | hustwbxs/DesignPattern | b1ef9bde5a5ffa9491135020257cd02ba02e00c4 | 1bcba8517850a34e3c4d6fa585db7e81d157706f | refs/heads/master | 2023-04-26T09:33:34.361737 | 2020-11-22T09:10:05 | 2020-11-22T09:10:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 851 | cpp | DecoratorPatternDemo.cpp | /**
* @file DecoratorPatternDemo.cpp
* @author {Layne} ({shu_huanglei@163.com})
* @brief
* @version 0.1
* @date 2019-11-08
*
* @copyright Copyright (c) 2019
*
*/
#include "Circle.h"
#include "Rectangle.h"
#include "RedShapeDecorator.h"
int main(int argc, char const *argv[]) {
std::shared_ptr<Shape> circl... |
922ea910e4d9ca1a7af72e4fbdcbfa4b061c5702 | 7415e2d8c0d15cb6b1abe569ed311196824b7e2c | /compiler/Serialization/VMDeviceTableBuilder.cpp | c2d746c828a0a0d61e3f2333e88c8eb2c903c456 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | monkeyking/iree | 26b729a782282a731f4537e6d415343843044037 | d72d304f0d8bea62566e9c0dbc8767fd54bb5dc6 | refs/heads/master | 2021-06-22T23:08:50.934251 | 2019-09-18T22:46:56 | 2019-09-18T23:05:14 | 209,453,419 | 2 | 0 | Apache-2.0 | 2019-09-19T03:19:58 | 2019-09-19T03:19:58 | null | UTF-8 | C++ | false | false | 1,576 | cpp | VMDeviceTableBuilder.cpp | // Copyright 2019 Google 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
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
e3b3603695196d7c4c55e432ee6ae7f2f1b5e0c3 | 3f9663fc8fbadc73bb073291037a98a0294f895f | /8th/8.11.cpp | 2d663cd1e4b1345827fc4ca504607b32f880aa13 | [] | no_license | Layty/CppPrimer | f2bad75aa0db6725ed9e86bc8d03a5e70e96e252 | bd8bbcd18da1a481dec1442eb3f201bf48204086 | refs/heads/master | 2020-12-05T10:28:24.982799 | 2020-05-03T07:23:24 | 2020-05-03T07:23:24 | 232,079,873 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | 8.11.cpp | /*
8.11 本节的程序在外层while循环中定义了istringstream对象。
如果record对象定义在循环之外，你需要对程序做怎样的修改？
重写程序，将record的定义移到while循环之外，验证你设想的修改方法是否正确。
*/
//使用string的clear |
5eff60625a83eed67cbe733c71eb1b27fd60e9e7 | edc7434dd5738c11d002297a0a1cf01d0aed4aa1 | /include/mesh_conversion.h | 606bfe59981b3109c89885deef808b24637d5009 | [
"BSD-2-Clause"
] | permissive | Carlos2181/poreflow | 1d8db502cfbbd442fcb55753dc701d6bd7f2b49d | 7f54a633bfdb893ad093b8f91e717a401bf45bb8 | refs/heads/master | 2020-06-03T19:18:55.264606 | 2015-03-04T23:28:20 | 2015-03-04T23:28:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,326 | h | mesh_conversion.h | /* Copyright (C) 2010 Imperial College London and others.
*
* Please see the AUTHORS file in the main source directory for a
* full list of copyright holders.
*
* Gerard Gorman
* Applied Modelling and Computation Group
* Department of Earth Science and Engineering
* Imperial College London
*
* g.gorma... |
001c69f6e6cdc1b7de88988ce6d9d2a5a681f6e8 | f4ecb727bf7a9766370d515e138c93e2cbbfc45c | /Sampling.h | bc005ceee744c4e4fad41fb1b8daf81b96f9a108 | [
"MIT"
] | permissive | RexYing/DTW-approx | da06d268e0b8b5c67e50f1b639a2b6e04c94b366 | 9f63d6edf245a22e3164b991e8d9d424dd884042 | refs/heads/master | 2021-01-17T09:26:34.858982 | 2016-06-13T06:15:05 | 2016-06-13T06:15:05 | 35,592,323 | 2 | 1 | null | 2017-02-27T04:29:12 | 2015-05-14T05:19:01 | C++ | UTF-8 | C++ | false | false | 1,507 | h | Sampling.h | #include <unordered_map>
#include "WSPD.h"
using namespace std;
struct pairhash {
public:
template <typename T, typename U>
std::size_t operator()(const std::pair<T, U> &x) const
{
return std::hash<T>()(x.first) ^ std::hash<U>()(x.second);
}
};
typedef vector<Point_2> Curve;
typedef pair<l... |
42a0abd072720065893f90b419670ee0c17d73ee | a909df0ba2abf695df4a7d15350312d4c6463c48 | /TIOJ/1930.cpp | e70d62995180ebb088934d659ca7df5670a3df50 | [] | no_license | SayaUrobuchi/uvachan | 1dadd767a96bb02c7e9449c48e463847480e98ec | c213f5f3dcfc72376913a21f9abe72988a8127a1 | refs/heads/master | 2023-07-23T03:59:50.638063 | 2023-07-16T04:31:23 | 2023-07-16T04:31:23 | 94,064,326 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,141 | cpp | 1930.cpp | #include <iostream>
using namespace std;
const int N = 2000005;
int front[N], back[N];
int ans_list[N];
inline void conn(int a, int b)
{
front[b] = a;
back[a] = b;
}
int main()
{
int count, n, m, i, t, st, a, b, c, cmd, ans;
long long cnt;
scanf("%d", &count);
while (count--)
{
scanf("%d%d%d", &n, &m, &st)... |
a38a8b04e84e57d000782e0ed03d4d382d51f761 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5634697451274240_0/C++/m11121/rev.cpp | c12d4ccebb7bd5fd2ba902a50360fc578e2b8ec9 | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 372 | cpp | rev.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
int t;
cin>>t;
for(int ic=1;ic<=t;++ic)
{
cout<<"Case #"<<ic<<": ";
string s;
cin>>s;
int ans=0,total=0;
for(auto it = s.rbegin();it!=s.rend();++it)
{
if(*it=='-' && total%2==0 ||
*it=='+' && total%2)
{
++total;
... |
c165dfd119fae4362335fbec0aa1ce7ff49db9f1 | 585ff546e639fdebe21a5480acfdf03bf4b0e9ae | /Somnium/src/Graphics/Shaders/Shader.cpp | 63e5411ee576ba69ba2c861146ae8c377610fbfb | [
"MIT"
] | permissive | MrLukeKR/SOMNIUM-Engine | 0636780d34abfb8f497ccf182701b466d64243c5 | 3e8ae8825e3c0b1a853eb86b107aa94ce9445c3e | refs/heads/development | 2022-11-15T11:17:07.435291 | 2020-07-11T10:20:54 | 2020-07-11T10:20:54 | 274,182,254 | 0 | 1 | MIT | 2020-06-26T09:30:55 | 2020-06-22T15:58:31 | C | UTF-8 | C++ | false | false | 3,210 | cpp | Shader.cpp | #include "Shader.h"
#include <string>
#include <vector>
#include <iostream>
#include "../../Utilities/FileUtilities.h"
using namespace std;
using namespace Somnium;
using namespace Utilities;
using namespace Maths;
namespace Somnium
{
namespace Graphics
{
namespace Shaders
{
Shader::Shader(const char* vertex... |
5a5ce0064eab2e5b3cb4c281b1d9aea8c5e16f05 | a3f754560184f0158ddba8c113b674fa6d5df22a | /test/iterator.cpp | 25cf093a41af82e9064627caaeb23dcbf62249cb | [
"Apache-2.0"
] | permissive | asutton/stl2 | be9c843ee2780d89d9e1a8a0cbddd1e91c21371b | 84808fdb535b2496b13e0a2ba78c9efb32c3c68c | refs/heads/master | 2021-01-10T14:02:31.579996 | 2016-03-31T12:43:16 | 2016-03-31T12:43:16 | 53,437,814 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 684 | cpp | iterator.cpp |
#include <std/iterator.hpp>
#include <forward_list>
#include <list>
#include <vector>
using fiter = std::forward_list<int>::iterator;
using biter = std::list<int>::iterator;
using riter = std::vector<int>::iterator;
template<stl::ForwardIterator I>
constexpr bool test_forward_iterator() { return true; }
template<... |
8f99d54203c61649c5de7ece47cb23d5791a58ab | c896ca2e53872690a6cb4a9be4418d802ac3c6ef | /CPP03/ex03/ClapTrap.cpp | 42c75aa8b5bcfa3860810886e60c3cb61a74b6d4 | [] | no_license | paspd/CPP_ALL | a1f66648798765085cfaf2b8558d2a76cfeb20c2 | c4120a7b61b2a7243a3338dee335a151db0b6c52 | refs/heads/master | 2023-09-04T08:21:10.802507 | 2021-11-09T10:02:01 | 2021-11-09T10:02:01 | 405,879,580 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,600 | cpp | ClapTrap.cpp | #include "ClapTrap.hpp"
ClapTrap::ClapTrap(void): _name("default"), _hitPoints(10), _energyPoints(10), _attackDamage(0)
{
std::cout << "ClapTrap default constructor called" << std::endl;
return;
}
ClapTrap::ClapTrap(std::string name): _name(name), _hitPoints(10), _energyPoints(10), _attackDamage(0)
{
std::cout << ... |
f5ec3ecc87a1ec1af69848b1776a83e667d24003 | 184e94519f5b6106f9b79b73129ff53edc7d2337 | /AnimationExample/Player.h | fc5104f1fec88698f04d3ac7070c1264b3ef5ec6 | [] | no_license | chuwilliamson/sfw-AIE-Framework | e6c8aabdcce432fbdfd18585613ca21bfa857af4 | a373a894b7c15dc768007ef985d7089ecb5258ec | refs/heads/master | 2016-08-11T16:37:10.109963 | 2015-12-14T20:56:09 | 2015-12-14T20:56:09 | 48,000,813 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 690 | h | Player.h | #pragma once
#include "GameObject.h"
/*
See GameObject.h for rationale!
Inheriting from gameobject, we can adopt all of the properties it has and
contribute some of our own. A player, for example, may want to update
it's position based on input.
*/
class GameState;
class Player : public GameObject
{
public:
f... |
34a05ef4bc5d643058d57f95fc55d4430f94875b | 93ae19390a0d8b3aab8dc655fc93f607d093672f | /hdoj/1879.cpp | 66fb0e089ce900ba5e91029e2f8c8aee28f0e226 | [] | no_license | scusword/acm | 4f038c83fca9b95b607f7b600c292665fe66437f | 7c9be9c8ef66d08fb5a4b0ace0a9cf8d758aee31 | refs/heads/master | 2020-03-28T19:36:32.955429 | 2018-11-03T06:18:31 | 2018-11-03T06:18:31 | 148,992,050 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,301 | cpp | 1879.cpp | /*
Problem Description
省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道路统计表，表中列出了任意两城镇间修建道路的费用，以及该道路是否已经修通的状态。现请你编写程序，计算出全省畅通需要的最低成本。
Input
测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 1< N < 100 )；随后的 N(N-1)/2 行对应村庄间道路的成本及修建状态，每行给4个正整数，分别是两个村庄的编号（从1编号到N），此两村庄间道路的成本，以及修建状态：1表示已建，0表示未建。
当N为0时输入结束。
Output
... |
7aed8e7316576fedd7a1c7ca98937b3ffa0336e3 | bef312468baf3c199e92d1d465bd938593cd25ad | /src/TestCommon/TestStringConvertor.h | 417dc2fe2984015863667c685f48d90d78e4b3e8 | [] | no_license | yunbj/common | a2f66e756fa95e39f6026284e699934c8b93e5bc | 79cb49cdf9600477066a0c44bdaba029ec938c0b | refs/heads/master | 2020-07-07T04:40:04.193535 | 2019-03-22T02:28:11 | 2019-03-22T02:28:11 | 203,251,773 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 233 | h | TestStringConvertor.h | #ifndef TESTSTRINGCONVERTOR_H
#define TESTSTRINGCONVERTOR_H
class TestStringConvertor
{
public:
TestStringConvertor();
virtual ~TestStringConvertor();
void DoTest();
};
#endif // TESTSTRINGCONVERTOR_H
|
e514c28bed73bb3ccd7675c8f838924cece786bf | c6759b857e55991fea3ef0b465dbcee53fa38714 | /gvsoc/gvsoc/models/cpu/iss/sa/src/loader.cpp | 07eb9f1e3ca61a3e421a1c3986ba5e6651247339 | [
"Apache-2.0"
] | permissive | GreenWaves-Technologies/gap_sdk | 1b343bba97b7a5ce62a24162bd72eef5cc67e269 | 3fea306d52ee33f923f2423c5a75d9eb1c07e904 | refs/heads/master | 2023-09-01T14:38:34.270427 | 2023-08-10T09:04:44 | 2023-08-10T09:04:44 | 133,324,605 | 145 | 96 | Apache-2.0 | 2023-08-27T19:03:52 | 2018-05-14T07:50:29 | C | UTF-8 | C++ | false | false | 10,765 | cpp | loader.cpp | /*
* Copyright (C) 2020 GreenWaves Technologies, SAS, ETH Zurich and
* University of Bologna
*
* 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.apac... |
acc12d028e747b05d8f23e0b5359baf9c89a0752 | ee455bf2e210f94e89035b74de43cb70ced9e8e1 | /MailboxTableDlg.cpp | 3338a54c8d5bec1fe17aed43fcd48756f43ff7f9 | [] | no_license | 15831944/mfcmapi-1 | ee8d020eec0e9ee840c1f05920f127ff993bb37b | 92781f695b6170e7ebfd9dc617f48a240a823171 | refs/heads/master | 2023-03-17T12:44:16.397759 | 2014-08-26T16:14:35 | 2014-08-26T16:14:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,593 | cpp | MailboxTableDlg.cpp | // MailboxTableDlg.cpp : implementation file
//
#include "stdafx.h"
#include "MailboxTableDlg.h"
#include "ContentsTableListCtrl.h"
#include "MapiObjects.h"
#include "MAPIFunctions.h"
#include "MAPIStoreFunctions.h"
#include "SingleMAPIPropListCtrl.h"
#include "ColumnTags.h"
#include "MFCUtilityFunctions.h"... |
ef310cf2588cb11b3de780d3e4f7085267b70209 | c037f3092d3f94a7e6f380184507ab133639cc3d | /src/components/system_media_controls/webos/system_media_controls_webos.cc | 8467b904cd298d440254176489a563697111f403 | [
"BSD-3-Clause"
] | permissive | webosose/chromium79 | bab17fe53458195b41251e4d5adfa29116ae89a9 | 57b21279f43f265bf0476d2ebf8fe11c8dee4bba | refs/heads/master | 2022-11-10T03:27:02.861486 | 2020-10-29T11:30:27 | 2020-11-09T05:19:01 | 247,589,218 | 3 | 6 | null | 2022-10-23T11:12:07 | 2020-03-16T02:06:18 | null | UTF-8 | C++ | false | false | 17,926 | cc | system_media_controls_webos.cc | // Copyright 2020 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/system_media_controls/webos/system_media_controls_webos.h"
#include <memory>
#include <utility>
#include <vector>
#include "base/bi... |
19e73417f1c5c552f500bc681017d5969a171918 | 0454cd70885ae579312f318d6a2239ec5aadcf74 | /rpn-calc/src/test.cpp | d3e777b9da39788e7de5a217fdb7217e84f9066c | [] | no_license | xfbs/rpn | 3bff19183831ec32f2331691edb6dee415c182f6 | 37246ca926b91f92880f58dab8353b99485ff5e1 | refs/heads/master | 2020-07-23T22:22:40.158775 | 2019-09-25T08:16:58 | 2019-09-25T08:16:58 | 207,723,655 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,486 | cpp | test.cpp | #include "calc.h"
#include <cassert>
#include <cmath>
#include <iostream>
void test_parse();
void test_execute();
int main(int argc, char *argv[]) {
std::deque<double> state;
test_parse();
test_execute();
std::cout << "ok" << std::endl;
return EXIT_SUCCESS;
}
template<typename T>
void assert_t... |
c3bb9ebc816cd4ef1461c6acc68365d63df37246 | 9b9d9e1de5d4dc6d0b8420f8113f6ac8077b8193 | /misc/lab4_2.cpp | 5c93ff42552ff5947f8c657e3003a57dcda9de53 | [] | no_license | rohangoel96/data-structures-algorithms | 3e367f38e55f1119d81fd45efed2f390cdccb82a | fb4fc7950c75cb86f5704cc311f87de012380f03 | refs/heads/master | 2020-04-09T10:38:50.084093 | 2016-04-24T04:43:24 | 2016-04-24T04:43:24 | 52,091,893 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,928 | cpp | lab4_2.cpp | #include <iostream>
using namespace std;
long long int findClosestSocket(long long int *working_sockets, long long int n, long long int allotted_index, long long int l){
long long int low = 0;
long long int high = n;
long long int mid = (low+high)/2;
long long int ans_index;
long long int low_to_alloted=0,high... |
0ec3c8a3ae94e4ff75e7b89b1015a01ff4c42c7f | da7cda3b3a6f3265c792b43f09c0596a8b18cd2e | /sample/Windows-QT/src/mainwindow.cpp | 02fa5cdc67a73391224c7941fa1101738ad9dfb8 | [] | no_license | dborota/Onboard-SDK | 0a498591e98e38c3fa1fc9a6a88f574e7852c635 | a2c5ea4b21c37e02bc430df190c87304770df1ef | refs/heads/master | 2021-01-22T01:38:21.481416 | 2015-11-25T04:10:48 | 2015-11-25T04:10:48 | 47,061,782 | 1 | 0 | null | 2015-11-29T11:58:27 | 2015-11-29T11:58:26 | null | UTF-8 | C++ | false | false | 11,856 | cpp | mainwindow.cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <stdint.h>
#include <QSerialPortInfo>
#include <QtSerialPort/QSerialPort>
#include <QDebug>
#include <QMessageBox>
#include <QTimer>
#include "about.h"
#include <QSettings>
#include <QFile>
#include <QFileDialog>
#include <QByteArray>
#include "DJI_Pro_Sample... |
249c17089005a6e1c1ee016eeea299f99c0b4e92 | bb813d550b7dd9a1c0c49ea2908d05ce50ede21a | /localconnectivityservice/obexsendservices/obexservicesendutils/src/BTSBIPController.cpp | ae1e800adf24bc82e573f64a3ee0ae5750a7f52c | [] | no_license | SymbianSource/oss.FCL.sf.mw.shortlinkconn | c0c38a5660b69f5367a2d77b21651782d06a6e1a | 39618d5dc6d43cee9c38a3ee08c9716c21c2a8a8 | refs/heads/master | 2021-01-12T10:45:30.329969 | 2010-05-17T08:02:52 | 2010-05-17T08:02:52 | 72,676,078 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,549 | cpp | BTSBIPController.cpp | /*
* Copyright (c) 2002 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/legal/epl-v10.h... |
b6f440d61cf4edaf1d1ab039856c34e8901b5338 | f2ae4870e0c8e4411927ac6f20939a35bb50d6e2 | /Sensor_color_continuity.ino | 29c073d8422bdd488641302ad7bbb012ce5e085b | [] | no_license | Micros2/Sensor_color | 8cb5148d8a525b93f112e030ee907c90bdc9734d | b74b169180f110f0867eeb026c020ce4e058ac3b | refs/heads/master | 2021-01-23T14:17:11.267425 | 2017-09-14T13:39:09 | 2017-09-14T13:39:09 | 102,681,747 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,191 | ino | Sensor_color_continuity.ino | /*
* Terminal Description
* GND Power supply ground.
* OUT Output Freq.
* S0, S1 Scaling freq selection.
* S2, S3 Photodiode type selection inputs.
* LED Supply voltaje for LED.
* VCC Supply voltage
*
*/
const int s0=1;
const int s1=2;
const int s2=3;
const int s3=4;
c... |
c318da286a9121912b0c634d3c0844423e2ee527 | ccb806d6d79e2d5f18e8a0173ca8d048aef686e5 | /1DAE10_Verberckmoes_Thibau_BindingOfIsaac/Game.cpp | 6606e2ba28db84963a6c28aba4f46f853e290acc | [] | no_license | ThibauVB/Thibau_Verberckmoes_Binding_Of_Isaac_Remake | ea4702f9274edbce2ccac44fce9b2d2e68b0af5b | 50d936ee54ab272a8677ae94ec30b08dd7ddbecd | refs/heads/master | 2022-10-11T05:06:39.077926 | 2020-04-19T23:32:33 | 2020-04-19T23:32:33 | 255,368,524 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,384 | cpp | Game.cpp | #include "pch.h"
#include "Game.h"
Game::Game(const Window& window)
:m_Window{ window },
m_DungeonGenerator(Vector2f{ m_Window.width,m_Window.height }),
m_Isaac(Point2f{ m_Window.width / 2,m_Window.height / 2 }, Point2f{ m_Window.width,m_Window.height }),
m_Camera(m_Window.width, m_Window.height),
m_StartScreen(f... |
c9ba138058ffdc02087dcfbe66aef6c19c365f6b | a7764174fb0351ea666faa9f3b5dfe304390a011 | /src/IGESDraw/IGESDraw.cxx | 53f2bfc7a72ad2a3d7b55c502769a8608aaab87a | [] | 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,076 | cxx | IGESDraw.cxx | #include <IGESDraw.ixx>
#include <IGESDraw_Protocol.hxx>
#include <IGESDraw_GeneralModule.hxx>
#include <IGESDraw_ReadWriteModule.hxx>
#include <IGESDraw_SpecificModule.hxx>
#include <Interface_GeneralLib.hxx>
#include <Interface_ReaderLib.hxx>
#include <IGESData_WriterLib.hxx>
#include <IGESData_SpecificLib.hx... |
2640b73d4f9fcaff707dbc513b754d5459a4a371 | 28179e957db221dba9fb2d1a2061936b5859d30f | /include/utils.h | 6c384444d329636e4b5a7b779ab9f3d17b0ee401 | [] | no_license | kurmis/QuadCopter | 441b839c274ab2c95e341db6bb98b52bb23ad033 | 2880423b34058acb2439283cb4e0f08cf9ff765a | refs/heads/master | 2021-01-20T11:30:37.653880 | 2014-12-05T20:28:30 | 2014-12-05T20:28:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 716 | h | utils.h |
#ifndef __UTILS_H
#define __UTILS_H
#include "stm32f30x.h"
#include "main.h"
void Delay(__IO uint32_t nTime);
uint8_t strlen(char* str);
void add(float* result, float* a, float* b);
void diff(float* result, float* a, float* b);
//multiply a vector by a constant
void mult(float* result, float* a, float b);
//dot pro... |
527e81c4572e015e4b8ac1ec8a14ac8271b8ed0e | 9bd55740fda6050bd695b863b5f5419fbbd3b552 | /CannonView.cpp | 58503b660960c4efe11235ecebf265c5b7ad452e | [
"MIT"
] | permissive | 15831944/DikuEdit | e65dd2bb93148095174bf407b9dfdc5fcc9b78c8 | 135f49bba7ce2faf5faac12a355da9813c28d0fa | refs/heads/master | 2021-06-08T14:51:49.035757 | 2014-11-04T06:26:21 | 2014-11-04T06:27:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,950 | cpp | CannonView.cpp | // CannonView.cpp : implementation file
//
#include "stdafx.h"
#include "WinDE.h"
#include "CannonView.h"
#include "ShipUpgrades.h"
#include "CannonBuilder.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
//////////////////////////////////////////////////////////////... |
3ab226b74a959cb8ef4b9e923e118e4319c59767 | 4d67d7da5d633645c0be6a6fef76a102d8bf4255 | /Операторы цикла/Упражнение_2.cpp | 037b66d97ddaf141d0a8ed67a9c65066fd5b6007 | [] | no_license | Alexander-Saad/Newtech | 59db6695c5e3fb01ea726c58a55ae9bc287e6dc3 | bf1b00b6a3b5713f4d529717284099d7573c42a2 | refs/heads/main | 2023-01-01T11:22:19.532032 | 2020-10-25T08:50:22 | 2020-10-25T08:50:22 | 300,924,229 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 344 | cpp | Упражнение_2.cpp | #include <clocale>
#include <iostream>
#include <Windows.h>
#include <math.h>
using namespace std;
int main()
{
setlocale(LC_ALL, "Russian");
// Вывод нечетных значение от 1 до 20
int a = 1, b = 20;
for (int i = a; i <= b; i+=2)
{
cout << i << " ";
}
system("pause");
return 0;
}
|
8e90690a7d2285a8ad55bcf44f62746f47f5887d | 58f4d56dba6ddfdd7c9851e5e47def69b4338c18 | /cocciobj.h | 87714743acb749a0564144c77e135a88c152105f | [] | no_license | yuetianle/occi | 83efd31a6d802df0f4a1ad264bec526d995ff7d1 | 6cd0fff1ab74c42d9c4c2d004574df34c94565fe | refs/heads/master | 2020-05-07T21:19:46.754303 | 2015-01-22T10:42:13 | 2015-01-22T10:42:13 | 29,644,434 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,072 | h | cocciobj.h | #ifndef COCCIOBJ_H
#define COCCIOBJ_H
#include <memory>
#include <cstring>
#include "crecord.h"
#include "coccicommon.h"
#include "coccipool.h"
/**
* @brief 数据库单个对象.
* 数据库初始化、插入、查询、删除等操作
*/
class COCCIObj
{
public:
COCCIObj(const DB_USER_INFO &db_user_info);
virtual ~COCCIObj();
/**
* @brief 初... |
f0f117096ab0b0868fbaa6e613074525eb65e640 | f7724aebc82a5f1bbc5f5020940f8acd0aaeab21 | /JosephusKill.cpp | 5bfb5949d7c24988c707fe12b3b087b7c4cf46e7 | [] | no_license | pw-ethan/LinkedList | c3468d3e92069579a561374a5d90f13a3a1fc24c | 934e7a3643757ea66e2d39cd097b949848e47ebf | refs/heads/master | 2020-06-01T06:30:41.635914 | 2017-06-15T08:40:58 | 2017-06-15T08:40:58 | 94,065,422 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,066 | cpp | JosephusKill.cpp | #include "JosephusKill.h"
std::shared_ptr<Node> JosephusKill(std::shared_ptr<Node> head, int m) {
if(head == nullptr || head->next == nullptr || m < 1) {
return head;
}
std::shared_ptr<Node> last = head;
while(last->next != head) {
last = last->next;
}
int cnt = 0;
while(hea... |
9eec5e0b0d2e8d11ea3967588cd542066a89e8a7 | f6b472898b10a53b949ab3c08588051550543ebf | /Turtle/Turtle.h | 3e0aa56a3f67c7b92c4ff0ce4b8f95ee161bcd92 | [
"BSD-2-Clause"
] | permissive | mirek-fidler/Turtle | 37fcf1987e96baf7e9d2452b7fe92007c54f7bdd | fd413460c3d92c9a85fc620f6f3db50d96f3be2f | refs/heads/master | 2023-05-14T17:37:33.379280 | 2021-06-10T21:32:42 | 2021-06-10T21:32:42 | 326,928,313 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,900 | h | Turtle.h | #ifndef _VirtualGui_Turtle_h
#define _VirtualGui_Turtle_h
#include <CtrlLib/CtrlLib.h>
namespace Upp {
class TurtleServer : public VirtualGui {
public:
TurtleServer() {}
TurtleServer(const String& host, int port) { Host(host).HtmlPort(port).WsPort(port + 1)... |
9530ca9123279830407f03ea20abf81a5ad20dc7 | 4aec42ce0ae1134e12e6e57b2bee10fb4b759f6c | /hector_serialization_test/src/udp.cpp | e84a92a5408c1f77435adde60b744ad59cec4d64 | [] | no_license | jinjin2018/hector_serialization | bedf5a15686ef7cc607a4731628bf735eab924e3 | 5ea8442032c2f362cd97383acfb315bbf1b9b33b | refs/heads/master | 2021-05-27T00:22:47.543313 | 2013-01-31T15:12:04 | 2013-01-31T15:12:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,220 | cpp | udp.cpp | //=================================================================================================
// Copyright (c) 2012, Johannes Meyer, TU Darmstadt
// All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are... |
878fd00d0141b94d1d0e48248eba8fcc8db4b46d | ec2ca75c541dedc55635cbec240c825d9327502a | /gui/graphform.cpp | 4ebe0a6c369b72618ce9b5bc869202e1b04b97cf | [
"Apache-2.0"
] | permissive | ivandzen/RMCS | 5f921c0da648f3852acb8b2216663e2ba6494a0d | a695725212f1e32845bc04c1d9197535c2aa3732 | refs/heads/master | 2020-03-26T09:52:25.546248 | 2018-08-14T17:20:16 | 2018-08-14T17:20:16 | 144,769,627 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,958 | cpp | graphform.cpp | #include "graphform.h"
#include "ui_graphform.h"
#include <QDebug>
GraphForm::GraphForm(QWidget *parent) :
QWidget(parent),
ui(new Ui::GraphForm)
{
ui->setupUi(this);
startTimer(30);
}
GraphForm::~GraphForm()
{
delete ui;
}
bool GraphForm::addOParam(QOParamController * param)
{
if(_graphs.con... |
654e931c25fc562b203144d3b27b2cafb6cfc6f9 | b2b83f1c59d6bdf0673588a3f1d310e849ab9161 | /Numbers Manipulation/reverse_integer.cpp | 8049d5ae9a2333c77c65ba19a3be3165bbd02d03 | [
"MIT"
] | permissive | dalalsunil1986/Common-coding-puzzles | ac735841697715b406973dcd38d3dc7b280e7713 | c9a73c0ff2abc7e0acdb53e545bb219eeeb23421 | refs/heads/master | 2023-07-03T07:25:55.091004 | 2021-08-15T11:11:16 | 2021-08-15T11:11:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 371 | cpp | reverse_integer.cpp | /*!
* @description Reverse digits of an integer (int32_t)
* @restriction Returns 0 if the reversed integer overflows int32_t
*/
class Solution {
public:
int reverse(long long x) {
int res=0;
while(x){
if(res>INT_MAX/10 || res<INT_MIN/10) return 0;
res=res*10+x%10;
... |
e2f0005e64f2fd809bfc636f8ffd9a03166e6135 | ee893c80d52e222a6e8ce9e15f72cb4031b4f532 | /Command.h | e67470671e5e9a8606e668a3b01e6d9e64bae8d3 | [] | no_license | matthewgraham1/nutshell | 38b3775cab8d05737f61c5f2d2312d91cb5556bb | 58c01fa56849ae66d316140e92022bfafa8da61b | refs/heads/master | 2023-04-03T08:23:21.483884 | 2021-04-16T03:20:03 | 2021-04-16T03:20:03 | 353,462,101 | 0 | 1 | null | 2021-04-15T20:58:19 | 2021-03-31T19:04:40 | C++ | UTF-8 | C++ | false | false | 1,373 | h | Command.h | #pragma once
#include <list>
#include <vector>
#include <string>
#include <functional>
#include <map>
class Command {
public:
inline Command() { expand_PATH(); }
struct Node {
std::string name;
std::vector<std::string> arguments;
struct Output {
std::string from;
... |
129b3f06aaeafc2c3c82fc9a27811726a51cb336 | 2022856b750cf5cfaa0ceb1369844cb1e878b2b1 | /project/project/mainwindow.h | 77d0d1c91f1888cf8ac4bf17e6b1e00872aac7e4 | [] | no_license | devilYD/Analog_Calculator | 6df312adeeebd4cfc80b2db4ae0179867a50c68a | c9335108e89fd40f1c5db87806d63e34074e7233 | refs/heads/main | 2023-06-02T08:35:07.884056 | 2021-06-21T08:46:10 | 2021-06-21T08:46:10 | 374,940,766 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,189 | h | mainwindow.h | #ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include <QMainWindow>
#include<QPushButton>
#include<QLineEdit>
#include <QLabel>
#include<QHBoxLayout>
#include<QVBoxLayout>
#include<QGridLayout>
#include<QString>
#include<QStack>
#include<QTime>
#include<iterator>
QT_BEGIN_NAMESPACE
namespace Ui { class MainWindow; }
QT_... |
b4cf898e9302293b6cd2e8aa6cfa4e48a89b3649 | 980a4702cf5396ab54cb0e9282055e1e2d3edd1d | /libnd4j/tests_cpu/layers_tests/DeclarableOpsTests4.cpp | 56e5e213a0bb4a6712363f6e46838533ac99c08c | [
"MIT",
"BSD-3-Clause",
"Apache-2.0"
] | permissive | pxiuqin/deeplearning4j | 5d7abea2102ad3c8d6455803f7afc5e7641062a1 | e11ddf3c24d355b43d36431687b807c8561aaae4 | refs/heads/master | 2022-12-02T00:09:48.450622 | 2020-08-13T10:32:14 | 2020-08-13T10:32:14 | 277,511,646 | 1 | 0 | Apache-2.0 | 2020-08-13T10:32:16 | 2020-07-06T10:28:22 | null | UTF-8 | C++ | false | false | 101,828 | cpp | DeclarableOpsTests4.cpp | /*******************************************************************************
* Copyright (c) 2015-2018 Skymind, Inc.
*
* This program and the accompanying materials are made available under the
* terms of the Apache License, Version 2.0 which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
*... |
ef9cc6ef39ee6d4c091116d5326f2e25cd31dccb | c60123141640829a7659a6a585fd955d2b7dc860 | /A4/src/DeckOfCardsT.h | 39a5452b3a9dda46b8c18b38c03e5aef540bc51b | [] | no_license | Ghasemih/Architecture-Design-Assignments | 93a1bee8fa493acf70e9ee943a1a5b2f59294165 | 61889f8de155ef7a134a89235254ea7e7b70149e | refs/heads/master | 2021-05-22T23:34:42.255743 | 2020-04-05T01:43:20 | 2020-04-05T01:43:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 584 | h | DeckOfCardsT.h | #ifndef DECKOFCARDST_H
#define DECKOFCARDST_H
#include "CardT.h"
#include <string>
using namespace std;
class DeckOfCardsT {
private:
//variable card with a pointer to deck
CardT deck[Size];
//keep track of what card you are dealing with
int currentCard;
public:
// Default constructor: assigns the 52... |
def2647c154bea87a4bd46b76b1f96c4e104d6c5 | 3baf8b6b4d6295d8e2335f706cf9f5f1041de0cb | /src/search/reverse_pairs/solution.cc | 4d4d867023dcde695b2318ac533ad063f6e14416 | [] | no_license | huntinux/leetcode | 710225b935232b5bed388bb1a5a74d0e7eb8628c | 9c676364a4ba4a56035e0f4bc18fe2e18a8db9a6 | refs/heads/master | 2023-03-05T06:35:34.078539 | 2023-02-28T15:29:56 | 2023-02-28T15:29:56 | 48,361,845 | 0 | 0 | null | 2021-04-23T15:08:04 | 2015-12-21T09:06:31 | C | UTF-8 | C++ | false | false | 1,341 | cc | solution.cc | #include "solution.h"
// 分析
//
// 解法1：
// 暴力解法，两层循环，时间复杂度O(n^2)
//
// 解法2:
// 分治，联想归并排序
// ref: https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/solution/jian-zhi-offer-51-shu-zu-zhong-de-ni-xu-pvn2h/
int Solution::ReversePairs(vector<int>& nums) {
if (nums.size() <= 1) return 0;
ReverseHelper(n... |
fb102129d7d7a6c53854e9ef6e2566d84627869d | aec9472e49d46f0d1cb2a26c330c02c44ca81d6b | /BFS.cpp | 35d7bf87818fe964f7fa2220764980bcfded1b48 | [] | no_license | SanGuillao/SokobanSolver | 36854249295256034d0367914bcc3d26b5648d1e | 0647de30be7d997ffda509c7acf0e409077b3729 | refs/heads/master | 2020-06-08T05:55:33.723089 | 2019-09-23T18:54:53 | 2019-09-23T18:54:53 | 193,171,736 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,429 | cpp | BFS.cpp | #include "Sokoban.h"
bool Sokoban::BFS(Stage& current, list<Stage>& closedList)
{
time(&begin);
std::queue<Stage> queueStages;
int counter = 0;
closedList.push_back(current);
GetRobot(current);
do
{
if (!MoveRight(current).isDead)
{
queueStages.push(MoveRight(current));
}
if (!Mo... |
ae1e0ecdd0178137279ba19716faabf130653ab9 | 2953868456602b71391eeae06d2d1dc0d74cb223 | /src/mods/mod_prelogon.hpp | 4eaf00c95498b686bbf961150fc271a76e10ab31 | [
"Zlib"
] | permissive | M-griffin/Oblivion2-XRM | 653357bc9056c8d2b25fde9eb59d3dfa1c991623 | 7b4147f34fcde18ba75a46fdb5aa5f460bb7a887 | refs/heads/develop | 2023-09-04T06:24:40.364355 | 2023-04-26T07:27:33 | 2023-04-26T07:27:33 | 43,869,148 | 90 | 12 | NOASSERTION | 2022-06-13T07:28:10 | 2015-10-08T07:10:42 | C++ | UTF-8 | C++ | false | false | 7,554 | hpp | mod_prelogon.hpp | #ifndef MOD_PRELOGON_HPP
#define MOD_PRELOGON_HPP
#include "mod_base.hpp"
#include "../model-sys/structures.hpp"
#include "../data-sys/text_prompts_dao.hpp"
#include "../session_data.hpp"
#include "../session_io.hpp"
#include "../deadline_timer.hpp"
#include <memory>
#include <vector>
#include <functional>
class ... |
62557002a59e5aad5a6d47e7695ff0828443c317 | 521175d39fc4adbf833529dd937017f1469b4db2 | /src/sparse.cpp | fa99eaf9de38ed090dbe7754098b938a966b01e7 | [] | no_license | brentonk/polywog | d0bf2e7441a832aed2d0fc4df305be0847d28e64 | 512f73fb6894cafc5f6ee496b5d8b50ab07be97b | refs/heads/master | 2021-01-15T14:32:19.020957 | 2018-04-20T19:30:45 | 2018-04-20T19:30:45 | 16,388,091 | 2 | 3 | null | 2018-08-02T14:26:53 | 2014-01-30T19:23:45 | R | UTF-8 | C++ | false | false | 1,158 | cpp | sparse.cpp | // Utility functions for working with sparse matrices
#include <Rcpp.h>
// Extract a specified column (by zero-based index) from a sparse matrix
Rcpp::NumericVector columnFromSparse(Rcpp::S4 X, int j) {
// Set up the output as an appropriately-sized vector of 0s
Rcpp::IntegerVector dim = X.slot("Dim");
in... |
4642d6e291c77a6aeb32bc1d6e8467c4d85bb7ec | d7abac20980dcdab8e52f644cfbb201eb28ed944 | /11653.cpp | a5467de94727e0699951d7cd152f17dc0fdf44e5 | [] | no_license | HwangYoungHa/BaekJoon | 1976f159a35218a37f25a32592677cd6144bd7a9 | 7a00f62a7ab89494f4a8bbba7ba8c010329a8063 | refs/heads/master | 2023-03-03T22:37:54.097359 | 2021-02-17T00:20:59 | 2021-02-17T00:20:59 | 294,125,886 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 304 | cpp | 11653.cpp | #include <stdio.h>
void factorization(int n){
int i=0;
while(true){
if(n <= 1)
return;
i=2;
while(true){
if(n % i == 0){
printf("%d\n", i);
n = n / i;
break;
}
else{
i++;
}
}
}
return;
}
int main(){
int n;
scanf("%d", &n);
factorization(n);
return 0;
}
|
87b62a4803cd599b95f1bcef47bcb5468a2c9c3e | cc5730e4bc12df0e35e9bcbf208ef27f8b149238 | /programs/inhertiance protected.cpp | dfbad398782afbd87d90316a0e51795e780cf074 | [] | no_license | RAzaALy/Cpp_Programming | 4ff601f018c135b801a30dc5601e3f13ab6924d5 | a55bbb3e8681e57e07a33cf7cf183241b06fae70 | refs/heads/main | 2023-06-14T20:30:30.671126 | 2021-06-23T07:08:35 | 2021-06-23T07:08:35 | 378,995,882 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 512 | cpp | inhertiance protected.cpp | #include <iostream>
#include <conio.h>
using namespace std;
class base
{
private:
int c;
public:
int a;
protected:
int b;
};
//public and protected members of base class are protected of derived class:
class derived:protected base
{
public:
void input()
{
cout<<"ENTER VALUE OF A:";
cin>>a;
... |
ee81c57ca0f8bbb7a3dde3d9c7613504d8b1a7c8 | f2bb41ab831f4a8ac9806b84424009f40b6ca153 | /3Dアクションゲーム/WizardAdventure/WizardAdventure/sphere_particle.cpp | d8f57c5daa81df9ac687d021db899749281b55c2 | [] | no_license | sugawaratukasa/-3DGame | 6f6e6774412dd0e1d4da3941a71e55795ee3885c | c07fe1021d4b4ae973cd1a89292917f67b792c8b | refs/heads/master | 2023-04-13T03:45:02.291401 | 2021-04-26T07:12:11 | 2021-04-26T07:12:11 | 328,649,456 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 4,342 | cpp | sphere_particle.cpp | //******************************************************************************
// 球のパーティクルエミッター [sphere_particle.cpp]
// Author : 管原 司
//******************************************************************************
//******************************************************************************
// インクルードファイル
//*****... |
08c760b0786d26ec268961b634e007e49d78a1b6 | af828ccfbf4a30657d2adcd7e16d973830de1c39 | /Apps/Pong/GameState.h | bda552191d6b8ce6584fc97edf043d6a9547e235 | [] | no_license | thejoggeli/matrix-raspi-3d | 0d682c4ab8bc5e78a5cb59731c526a5477d92959 | 7f62b741ac618bb6d4e08ea0b9bddbaa42532216 | refs/heads/master | 2021-06-26T21:48:06.459979 | 2020-10-26T10:56:26 | 2020-10-26T10:56:26 | 172,988,332 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 844 | h | GameState.h | #pragma once
#include <vector>
#include "Ledlib2d/State.h"
#include "Ledlib/Util/Timer.h"
#include "Ledlib/Util/ColorHsl.h"
#include "Ledlib2d/WeakPointerList.h"
using namespace Ledlib;
namespace Ledlib {
class Client;
class Bitmap;
}
class Ball;
class Paddle;
class GameState : public State {
public:
bool playi... |
ea5da23999c602b824fbd454d321f4d86b79edaa | dcce3076bbe5920c0323c8b4354c534f98f32f99 | /HeapManager/Source/FixedSizeAllocator.h | 1d192219e46eb20937b7c58dc5cf851b9f9c00bc | [] | no_license | ChuanChinLai/HeapManager | d553d2f3bab2c795109ae046970c9869c6f8a385 | ff68a255c7cd4da356db87e18665c49183c5f735 | refs/heads/master | 2021-01-11T20:50:46.550632 | 2017-10-24T07:40:32 | 2017-10-24T07:40:32 | 79,197,337 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 936 | h | FixedSizeAllocator.h | #pragma once
#include <cstdint>
namespace Engine
{
namespace Memory
{
class HeapManager;
class BitArray;
class FSA_INFO
{
public:
FSA_INFO()
{
}
FSA_INFO(size_t i_BlockSize, size_t i_NumBlocks) : BlockSize(i_BlockSize), NumBlocks(i_NumBlocks)
{
}
size_t BlockSize;
size_t NumBlo... |
a31a0ec2e89a3f7a8329e6ccb598a31652084247 | ede79e2e55f6a029d0593ea257ea45896c911ee5 | /src/10929 You can say 11.cpp | 6162c4244f02584e65d7e6145e55fdf28bb47a57 | [] | no_license | LRih/UVa-Problems | 52ab997a964112993c0bc5842a510739b00ca1d3 | d517fe77fb403acad3f8ef663a03a81b30bf36f2 | refs/heads/master | 2016-08-12T18:53:29.271538 | 2015-10-29T02:12:01 | 2015-10-29T02:12:01 | 36,557,277 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 795 | cpp | 10929 You can say 11.cpp | #include <cstdio>
#include <iostream>
using namespace std;
string num;
bool isDiv11()
{
int sum = 0;
for (int i = 0; i < num.length(); i++)
{
if (i % 2 == 0) sum += num[i] - 48;
else sum -= num[i] - 48;
}
return sum % 11 == 0;
}
int main()
{
while (true)
{
getline... |
471027e125e09870ab6aac2b4cbb18700502d0d6 | 34e69cf4ad31174ee1857a07d5ce147a81939f51 | /include/statement.hh | 83d246b42fe68b52e18b34fc17a1950befc86d39 | [] | no_license | mohammadreza33/peylang | 5d61a82940148d9ddf1fc7f04f2b039d15344b57 | a1d267f22a782385ca8d1477c7c7938324423bb3 | refs/heads/master | 2023-01-05T20:21:54.853192 | 2020-10-29T20:52:29 | 2020-10-29T20:52:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,908 | hh | statement.hh | // compiler's internal statements
// TODO: switch to visitor design pattern in future
#ifndef STATEMENT_HH_
#define STATEMENT_HH_
#include <exception.hh>
#include <expression.hh>
#include <list>
#include <symtable.hh>
namespace pey {
class Statement {
public:
virtual int eval(Symtable &smtbl) const = 0;
virtual... |
b54d781df4629e5fa2b16f05cd29cd0261e9c86a | 23b25124dbd1b55dc4af17cc1716422e1b30f5cd | /leetcode-cn/160.cpp | b3485c3c9c62298667f393ccd59394b2b3074661 | [] | no_license | qinzuoyan/exercise | 428d08b8abb02239eea4d4a9cb970f80fbabac87 | 50c15e6722b601bb3c8fbb18676b613f223d9a7b | refs/heads/master | 2022-04-30T12:54:08.239699 | 2022-03-24T13:12:45 | 2022-03-24T13:12:45 | 48,578,652 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 779 | cpp | 160.cpp | #include <stack>
using namespace std;
/**
* Definition for singly-linked list.
*/
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(nullptr) {}
};
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
if (!headA || !headB)
... |
6cab8bf7e6611fcd1d38c896b29355f9d29c4783 | 72414e441408d6d63d24e2154a3694e243a4f2a9 | /Multi-JSON-Interface/include/mjsoni/generic_json_config_reader.hpp | 0df3276345768bd2864c7b2ee4ca5c86dbfdfb8b | [
"Apache-2.0",
"BSD-3-Clause",
"MIT"
] | permissive | IAmTrial/Multi-JSON-Interface | 75f11174ae17b83e90a59ff6d33675af8f3f02c7 | 95f9e6c2d953af9e104a9f43532ef17daaf2f1bb | refs/heads/master | 2021-06-16T16:15:49.814767 | 2021-04-07T03:29:16 | 2021-04-07T03:29:16 | 192,013,888 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,840 | hpp | generic_json_config_reader.hpp | /**
* Multi JSON Interface
* Copyright (C) 2019 Mir Drualga
*
* This file is part of Multi JSON Interface.
*
* 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.ap... |
1fa2454b1c93381860b8b4e666305b0ca9e7d2a3 | ba8ad508ca0bc9196fc3425ba3341565a912c3b8 | /indie-studio/script/source/default/Default.cpp | acd8826a0b2c8579204d1c7c3077624c3c68df20 | [] | no_license | Unreality3D/Unreality3D | 05fa92a0e6913da6e5d85e0747907a68bd8359f1 | 9f08c24c4a72a1b653f492609a277e578aae66e7 | refs/heads/master | 2021-01-19T02:31:42.723787 | 2016-06-09T11:21:42 | 2016-06-09T11:21:42 | 60,762,894 | 3 | 2 | null | 2016-06-09T11:21:42 | 2016-06-09T09:19:54 | C++ | UTF-8 | C++ | false | false | 787 | cpp | Default.cpp | //
// Default.hpp for in /home/gandoulf/epitech/cpp_indie_studio/indie-studio/script/source/default
//
// Made by Gandoulf
// Login <gandoulf@epitech.net>
//
// Started on Tue May 24 17:53:57 2016 Gandoulf
// Last update Mon May 30 14:02:27 2016 Gandoulf
//
#include "default/Default.hpp"
#include "IndieStudio/Game... |
dd42ed929391327cfc324f2339420cb2ad1f3c01 | 43b1903f35fa75bf6490bff605410d2d12f82382 | /Realization/Search/BinSortTree/BinSortTree.h | b8ac21a879ff44c35efbd746bc94a5f144c137d6 | [] | no_license | Trouvaille0198/DataStructure | 1a1ad2f27055338c0edd588a170a9e84c2c3e791 | 6ce4a1c9e76dcbc2fc97568f46c5e4d4a38595b7 | refs/heads/main | 2023-06-01T11:44:04.411907 | 2021-06-17T10:16:43 | 2021-06-17T10:16:43 | 316,417,692 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 4,437 | h | BinSortTree.h | #include "../../Tree/BinaryTree/BinaryTree.h"
#include <bits/stdc++.h>
using namespace std;
template <class T>
class BinSortTree : public BinaryTree<T>
{
// 继承二叉树的根节点数据成员
public:
BinSortTree(T refvalue) : BinaryTree<T>(refvalue){};
BinSortTree(T *a, int n); // 插入数组元素构建二叉排序树, 不用判断
~BinSortTree() {}
... |
7eb78d5c666e28e7525df66121c94484a123de7f | 39eac74fa6a244d15a01873623d05f480f45e079 | /LabCustomFieldListItemEditor.h | ded873b7e4118bfdc28a3d5d07e75a9ef67f199f | [] | no_license | 15831944/Practice | a8ac8416b32df82395bb1a4b000b35a0326c0897 | ae2cde9c8f2fb6ab63bd7d8cd58701bd3513ec94 | refs/heads/master | 2021-06-15T12:10:18.730367 | 2016-11-30T15:13:53 | 2016-11-30T15:13:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,234 | h | LabCustomFieldListItemEditor.h | // (r.gonet 09/21/2011) - PLID 45606 - Added
#pragma once
#include "LabCustomField.h"
#include "AdministratorRc.h"
using namespace NXTIMELib;
using namespace NXDATALIST2Lib;
// CLabCustomFieldListItemEditor dialog
class CLabCustomFieldListItemEditor : public CNxDialog
{
DECLARE_DYNAMIC(CLabCustomFieldListItemEdit... |
0b6d33ec402e7a533e392865f0c4f76a5e2e2569 | eccc7e990f2c3e7a1f6facf96016666ed6910961 | /Heaps/integerSteamMedian.cpp | 0f9e64cc0fe12e8b0a8dcd1e940db5a7962a748c | [] | no_license | diyamahendru/Data-Structures-Challenges | 3617e34306528a0e8993c498958bec38afa1a135 | c0445e9a985f4d7b81216f5717f509001ace8b2f | refs/heads/master | 2023-01-29T19:48:16.469864 | 2020-12-09T10:20:09 | 2020-12-09T10:20:09 | 265,329,457 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,428 | cpp | integerSteamMedian.cpp | #include<iostream>
#include<queue>
using namespace std;
int main(){
int t,n,d;
cin>>t;
while(t--){
priority_queue<int> left; //max heap
priority_queue<int, vector<int>, greater<int>> right; //min heap
cin>>n>>d;
left.push(d);
int median=d;
cout<<median<<... |
8d04cf630efe46bf7b8ba4877ac984ccf2372340 | b09623cfcc9c98686329cafb22bec499f44b4d76 | /online_clustering/hmp/src/omp.cpp | 830e3da4af85a613bf9588d292e66355d0237e1b | [] | no_license | mmmonkeytao/onlineclust | 339ab30b956aa41af31574b7bc2ecf9b3edccfde | 9180587546e83df6a4b2a748afcf318453705698 | refs/heads/master | 2016-09-06T01:21:36.755797 | 2015-01-25T15:25:29 | 2015-01-25T15:25:29 | 24,497,502 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,755 | cpp | omp.cpp | #include "hmp.h"
#include <stdexcept>
#include <cmath>
#include <iostream>
#include <fstream>
void onlineclust::omp::Batch_OMP( Eigen::MatrixXd const& X, Eigen::MatrixXd const& D, uint SPlevel,
Eigen::MatrixXd &Gamma )
{
auto Xrow = X.rows(), Xcol = X.cols(), Drow = D.rows(), Dcol = D.cols();
if( !Xrow... |
c52242387f14fcc59cc24d598d3eccb352d38748 | 5157d68de16510161bd04c43c86d5749f8803d3b | /C++ Projects/EncryptionSystems/EncryptionSystems/main.cpp | 1b87cdf160d2ff3191d570ac0622ffa8cf07d234 | [] | no_license | TaylorZaneKirk/XombyGit | 8d864eba7ff44b1e03f06d98329660005e848c20 | 4d8b5c870fffe7dab535208da311da5debbfadeb | refs/heads/master | 2020-12-24T05:31:08.923719 | 2016-11-26T02:50:59 | 2016-11-26T02:50:59 | 8,965,880 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 931 | cpp | main.cpp | #include <iostream>
#include <queue>
using namespace std;
void main(void){
char String[] = "I CANNOT SOLVE THIS IN LESS THAN A CHILIAD";
queue<int> Modified;
int ModChar;
for each(char i in String){
switch (i){
case 'A':
ModChar = 0;
break;
case 'C':
ModChar = 2;
break;
case 'D':
ModChar = ... |
aa1e5c20b4284d3be88e2b8097dc9f07143561ac | 9aa9abf6e479d9c1ae838aabed1fba9019b4bdd1 | /cg_eig_bad/cg_solver.cpp | bacc2abd0377f5f8c9b2a5f4832c32cbd3369fdb | [] | no_license | rpeng233/TreePCG | 443be0b4d56cbf51ddf2125c17df0ae5a9c6a9bb | a09b06fdf90fc3e6941bf6e237654e612ca4ddd3 | refs/heads/master | 2021-06-20T11:06:38.325504 | 2017-07-10T21:00:08 | 2017-07-10T21:00:08 | 63,903,737 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 988 | cpp | cg_solver.cpp | // Copyright 2016 Haoran Xu
#include "../haoran_code/io.h"
#include "../haoran_code/graph.h"
#include "cg.h"
#include "../haoran_code/jacobiprecon.h"
int main(int argc, char *argv[]) {
string dir = argv[1];
if (dir[dir.length()-1] != '/') dir+="/";
Mat L = IO::readMML(dir+"mat.mtx");
// Mat tree = IO:... |
05c4f156552724986e1b79c3bb7c70d89c667435 | 243eeb70c76c2bdfc29036d5bc9ce3ba144aedbc | /src/000-060/033.search-in-rotated-sorted-array/solution.h | fe16556c664f51cbda1d54246cf37af10f46784e | [] | no_license | 879229629/LeetCode | 45aab925424b701452117fa92ef2718594d01ec8 | 0ba8eced95954ace354d049645bb8ecbf0f8d940 | refs/heads/master | 2020-06-30T20:17:39.881898 | 2017-01-04T15:25:06 | 2017-01-04T15:25:06 | 74,355,045 | 1 | 0 | null | 2016-11-25T09:37:07 | 2016-11-21T11:02:55 | C++ | UTF-8 | C++ | false | false | 204 | h | solution.h | #ifndef LEETCODE_033_SOLUTION_H_
#define LEETCODE_033_SOLUTION_H_
#include <vector>
class solution {
public:
int search(std::vector<int>& nums, int target);
};
#endif // LEETCODE_033_SOLUTION_H_
|
ba0f296e7ccdac52bd0989e8bc5da7af725f6ad9 | 0cb62390faa669d2827914e21c05b959be0f8de4 | /src/server/ez_mysql.cpp | e924a0df1f83fd6598750197af10eecd76d58e16 | [] | no_license | sanderau/myChat | 1314132032963c96b0a317a42fe6546de87f3d35 | a48d0a3dccad51addc6b56899f7e84a183f17949 | refs/heads/master | 2022-07-06T06:15:24.733589 | 2020-05-15T15:14:41 | 2020-05-15T15:14:41 | 264,306,797 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,368 | cpp | ez_mysql.cpp | #include "ez_mysql.hpp"
/* Standard C++ includes */
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <cstdlib>
/*
Include directly the different
headers from cppconn/ and mysql_driver.h + mysql_util.h
(and mysql_connection.h). This will reduce your build time!
*/
/* MySQL Libraries */
#inclu... |
4869ba6144e6ab114fce52727da119f9dc328cab | e0654961ba79338e82a0ba03360e97ead4465285 | /include/argot/concepts/immediate_executor.hpp | 3ebda0c66237daa02d6f3cb7e669e7f6994d949e | [
"BSL-1.0"
] | permissive | blockspacer/argot | 68f0e2a56fb4686989b47d0ad0f6127167ea0a9a | 97349baaf27659c9dc4d67cf8963b2e871eaedae | refs/heads/master | 2022-11-25T02:57:08.808025 | 2020-08-04T21:15:00 | 2020-08-04T21:15:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,543 | hpp | immediate_executor.hpp | /*==============================================================================
Copyright (c) 2017, 2018, 2019 Matt Calabrese
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)
=======================================... |
006c16255efc4d35faf2a0a072096063655c84f7 | ef66e297a49d04098d98a711ca3fda7b8a9a657c | /LeetCodeR3/54-Spiral Matrix/solution.cpp | e469db35f1c3002ef706c9cfc87ebc84b8045508 | [] | no_license | breezy1812/MyCodes | 34940357954dad35ddcf39aa6c9bc9e5cd1748eb | 9e3d117d17025b3b587c5a80638cb8b3de754195 | refs/heads/master | 2020-07-19T13:36:05.270908 | 2018-12-15T08:54:30 | 2018-12-15T08:54:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,135 | cpp | solution.cpp | class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int m = matrix.size();
if (m == 0) {
return {};
}
int n = matrix[0].size();
if (n == 0) {
return {};
}
int l = 0, r = n - 1, t = 0, b = m - 1;
vecto... |
2fa16ce6a9d0b2a9fe75826b6f1e5054987d238b | 2de171611767f496a5a1f8d5ff24831870888c4a | /T06_01_SortAlgorithms/SortAlgorithms.cpp | 541577977b51b81fb9ffb16b7998716aa492deb8 | [
"Apache-2.0"
] | permissive | liubincodelife/DataStructureTasks | 70151a7916e775e495a24d36763e26cd1f62e38b | c2d540e0740877a53e8676a58c9abaa2e315ece5 | refs/heads/master | 2020-05-05T08:23:29.068064 | 2019-05-14T15:40:26 | 2019-05-14T15:40:26 | 179,862,279 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 5,333 | cpp | SortAlgorithms.cpp | #include <iostream>
using namespace std;
//交换函数
void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
//冒泡排序
//时间复杂度：最好：O(n) 最差：O(n^2)
//空间复杂度：O(1)
bool Bubble_Sort(int array[], int length)
{
if (length <= 1)
return false;
for (int i = 0; i < length; i++)
{
bool flag... |
ed21ff9e10478f8a980cf0150d2103fddba528ac | 75106c3a7a7d16f643e6ebe54fcbfe636b2da174 | /BitManipulation/25_checkMultipleBy9.cpp | bded6f9547ba6d029902acd828d5d6acb00c9860 | [] | no_license | i7sharath/geeks4geeks | b7f604189111c6ba45008d6d5ac5491533a7576e | 9c02e45dc2b73a007db2c2bba96a9491538818c7 | refs/heads/master | 2021-05-01T17:00:36.132885 | 2016-09-17T17:44:08 | 2016-09-17T17:44:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 378 | cpp | 25_checkMultipleBy9.cpp | #include <iostream>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
bool checkMultipleOf9(int n)
{
if(n==0 || n==9)
return true;
if(n<9)
return false;
// If n is greater than 9, then recur for [floor(n/9) - n%8]
return checkMultipleOf9((int)(n>>3) - (int)(n&7));
}
int main()
{
int ... |
ac448b7c6c1b1e100a0a0ba3c8a21123cff5ddfa | a6590941fea4880593d5b1cd23eedfe696f4e446 | /Other/mitsuiBank2020/f.cpp | fb57c6524d1b780a35f2bc036f9c9d0a8a25c982 | [] | no_license | cod4i3/MyAtcoder | 9fb92f2dd06c5b6217e925a82d8db4f91355a70f | 53bdac3fa7eb4ac48ca6d5c70461639beb6aa81d | refs/heads/master | 2023-02-17T09:15:16.282873 | 2021-01-15T13:34:03 | 2021-01-15T13:34:03 | 232,006,424 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 798 | cpp | f.cpp | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll T1, T2, A1, A2, B1, B2;
cin >> T1 >> T2 >> A1 >> A2 >> B1 >> B2;
if (T1 * A1 + T2 * A2 == T1 * B1 + T2 * B2) {
cout << "infinity" << endl;
return 0;
}
ll D1 = 0, D2 = 0;
ll ans = 1;
for (ll i = T1; i == 0; i--) {
... |
07d42e070e410f59912f85adc935a3d9a456000e | d053e0e8687f122d120bcd0fa1f9076deb35afa5 | /Olymp/CF/294/D.cpp | ae53b88e9ae7229c9aa2a6ded7608624d21dc9ed | [] | no_license | shaihitdin/CP | e8911bc543932866d6fc83eb1d48d9cf79918c61 | dc90082f3ebedaccbfb0818cc68539c887f86553 | refs/heads/master | 2021-01-11T17:10:20.356635 | 2017-10-05T08:53:56 | 2017-10-05T08:53:56 | 79,729,913 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,490 | cpp | D.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
typedef long long ll;
struct node {
ll x, add;
int cnt;
unsigned short y;
node *l, *r;
node () {
x = y = 0;
add = 0;
l = r = 0;
cnt = 1;
}
node (const ll &element) {
x = element;
y = rand();
l = r = 0;
add = 0;
cnt = 1;
}... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.