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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
972112e115eeb621c02049a1f441539bea1391b4 | 703de2cc53e6a1729bef24803a08f081afe7c0d7 | /leetcode/two_pointers/rotate_list.cpp | 6d0037c184fef5c2ec238dabeab266907ba8db61 | [
"MIT"
] | permissive | codingpotato/algorithm-cpp | 7cea8c7b1aa06eec757368c921631a14cb1a3a93 | 793dc9e141000f48ea19c77ef0047923a7667358 | refs/heads/master | 2022-12-08T19:38:18.106049 | 2020-09-10T14:10:41 | 2020-09-10T14:10:41 | 274,135,515 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,040 | cpp | rotate_list.cpp | #include <doctest/doctest.h>
#include <iostream>
#include <vector>
#include "list.h"
#include "verify.h"
// 61. Rotate List
class Solution {
public:
ListNode* rotateRight(ListNode* head, int k) {
if (!head) return nullptr;
ListNode dummy{0, head};
auto fast = &dummy;
auto n = 0;
while (k > 0)... |
32cdbb655a241582d4f49c904274a6bf036ca795 | 9f9940d58e099318c77faf56816fcd251fdad39d | /src/http_server.hh | 3bea81085d0b6d0ef86d8a538391f34d397f727b | [] | no_license | tadasv/httplog | f6509dcfb47a0ae91947252f3b0c0f35c59e830e | 52860e7b720272536877df9e50016ce4461dbc8b | refs/heads/master | 2021-01-21T18:00:28.233474 | 2014-04-08T21:16:45 | 2014-04-08T21:16:45 | 18,564,566 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 486 | hh | http_server.hh | #ifndef INCLUDE_GUARD_AA330A97_4F27_4542_A6EC_B8E67B66D18F
#define INCLUDE_GUARD_AA330A97_4F27_4542_A6EC_B8E67B66D18F
class HttpServer {
public:
HttpServer();
~HttpServer();
void Init(struct event_base *loop, int port, int backlog);
void Start();
void Stop();
protected:... |
badbb756ab3df1dabe084e7f82ea0c7727eb9d1c | 3c09686d2196ec9957051e9f05bb03cb2be5d63c | /GreedTree.cpp | 87a2f23078008c63d8541622a57b3e3a66421e33 | [] | no_license | Timsie/Greed-Solver | 3e128be1a06cae615ec2f731f04bc94b2624bde7 | 1984f7096e0975c362c1ca6a42393b9b0f619b11 | refs/heads/master | 2021-01-10T19:32:08.865584 | 2011-09-11T02:47:30 | 2011-09-11T02:47:30 | 2,269,164 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 772 | cpp | GreedTree.cpp | #include "GreedTree.h"
GreedTree::GreedTree(int x, int y, greedMatrix brd)
{
startX = x;
startY = y;
board = brd;
}
GreedTree::~GreedTree()
{
}
void GreedTree::buildTree()
{
int initial = 500;
int matrixSize = initial;
int lastIdx = 1;
GreedNode** tree = (GreedNode**)malloc(initial * sizeof(GreedNode*));
... |
c81e5f64b619e7a95b3942c0f9c64993a9ee6157 | cea74570a5a2511e68e4ba968220cd4bbb13c516 | /OpenSauce/shared/Include/GWEN/Controls/Pointer.h | 596278ffba5f5b014b3e8c12141a91608d11658f | [] | no_license | Dwood15/OpenSauce_Upgrade | 80bbc88fbf34340323d28ccd03623a103a27e714 | d48cf4819ed371beb4f6e9426f8ab8bcd67fe2b3 | refs/heads/master | 2021-05-04T18:35:39.132266 | 2018-02-18T01:26:48 | 2018-02-18T01:26:48 | 120,191,658 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 477 | h | Pointer.h | /*
GWEN
Copyright (c) 2010 Facepunch Studios
See license in Gwen.h
*/
#pragma once
#if !PLATFORM_IS_DEDI
#ifndef GWEN_CONTROLS_POINTER_H
#define GWEN_CONTROLS_POINTER_H
#include "Gwen/Controls/Base.h"
#include "Gwen/Gwen.h"
#include "Gwen/Skin.h"
namespace Gwen
{
namespace Controls
{
class GWEN_EXPORT Point... |
cdcd465706be9c77d8b08eae64e4cadb427f3bd3 | 04854e7dc859870baa887c2a20f6bc90d741774a | /StructuredScript/StructuredScript/scanner/ScannerTest.cpp | b0607fe4148f28e742edc1712c46c2182c253632 | [] | no_license | benbraide/StructuredScript | 6d0445876d7b76ee8fbad4b332488de7369ec11e | fdc12fd2a9e40c3dbdca0f9024ac79b7695dbe46 | refs/heads/master | 2016-09-14T10:16:58.379091 | 2016-05-27T16:18:47 | 2016-05-27T16:18:47 | 57,159,990 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,264 | cpp | ScannerTest.cpp | #include "../CppUnitLite/TestHarness.h"
#include "Scanner.h"
#include "Plugins/Number/SignedNumber.h"
#include "Wells/StringCharacterWell.h"
namespace StructuredScript{
TEST(Scanner, Test){
Scanner::Scanner scanner;
Scanner::StringCharacterWell well("var value = -45 / -45 + 0x72ffb ** 036 ? 0b1001 : 4r320, \"he... |
865022d8a828853279947790a30d14d5b6b9995b | de7e771699065ec21a340ada1060a3cf0bec3091 | /core/src/java/org/apache/lucene/codecs/LegacyDocValuesIterables.cpp | 58c36368a74e36eedb4535134eca8240d3800aac | [] | no_license | sraihan73/Lucene- | 0d7290bacba05c33b8d5762e0a2a30c1ec8cf110 | 1fe2b48428dcbd1feb3e10202ec991a5ca0d54f3 | refs/heads/master | 2020-03-31T07:23:46.505891 | 2018-12-08T14:57:54 | 2018-12-08T14:57:54 | 152,020,180 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,611 | cpp | LegacyDocValuesIterables.cpp | using namespace std;
#include "LegacyDocValuesIterables.h"
#include "../index/BinaryDocValues.h"
#include "../index/FieldInfo.h"
#include "../index/NumericDocValues.h"
#include "../index/SortedDocValues.h"
#include "../index/SortedNumericDocValues.h"
#include "../index/SortedSetDocValues.h"
#include "../util/BytesRef.... |
2b95dc2d17135315991af18751fd59ce39e61195 | c45a2cfb6864bfaf017b54ee23e3f5b9b5ab5e62 | /app/src/main/cpp/SortHelper.h | dcb8dfe6920b8f92ac512c5b6144f82104fdf264 | [] | no_license | arpsyalin/algorithm | 131e5ee58735eb6dfbf16fb8d2e69f41368b37df | a802c20727ba85fb429e6356d40f916a70485618 | refs/heads/master | 2022-12-31T16:27:38.038691 | 2020-10-22T09:14:38 | 2020-10-22T09:14:38 | 306,046,481 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 386 | h | SortHelper.h | #ifndef ALGORITHM_SORTHELPER_H
#define ALGORITHM_SORTHELPER_H
namespace SortHelper {
//生成随机数组num为数量，start-end的范围
int *generateRandomArray(int num, int start, int end);
void swap(int *arr, int i, int j);
//选择排序算法
int *selectionSort(int *arr, int len);
int *fillArr(int *arr, int size);
}
#end... |
33adc384003e165935a1b993cc85633488f23abe | 21c9a61c287a8a63525ec473d56d43d30cce872e | /Core/src/UserInterface/LabelsList.cpp | 4a58a98ace0ea307ddbd9f8fee1da09f8a6d0bab | [] | no_license | lazarev-pv/robot-game | 444242166766bc4753e170177522f6286ae46df5 | f4f22f2f2f7da51c07eb3b148d844fbd187fe867 | refs/heads/master | 2021-01-10T09:17:15.792534 | 2015-10-01T16:57:54 | 2015-10-01T16:57:54 | 43,508,571 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,351 | cpp | LabelsList.cpp | #include <ChibiEngine/XMLParser/UserInterfaceParser.h>
#include <ChibiEngine/Render/Sprites/NineSliceSprite.h>
#include <ChibiEngine/Render/Primitives/PrimitiveDrawer.h>
#include <ChibiEngine/Render/Primitives/SpriteText.h>
#include <ChibiEngine/Render/ScreenSystem.h>
#include <ChibiEngine/UserInterface/LabelsList.h>
#... |
d08fee66b77fff85c074b3aa23e28ad218546229 | 520365eb45cc298d0a20b44749482c3fe553d034 | /src/utils/breadth.cpp | d512fd20b7b732d7fc292a354835fb58899f258f | [
"Artistic-2.0"
] | permissive | marbl/MetaCompass | 91e8a7f8028b1a719abf595c4389473a6bd0f5d8 | 2cdeb979ccb5264f0dbac868b4c884687424e3f5 | refs/heads/master | 2021-07-25T23:45:16.293277 | 2021-01-31T23:58:48 | 2021-01-31T23:58:48 | 31,922,199 | 35 | 10 | null | null | null | null | UTF-8 | C++ | false | false | 29,815 | cpp | breadth.cpp | #include <iostream>
#include "stdc++.h"
using namespace std;
using std::endl;
using std::cout;
using std::cerr;
using std::ios;
using std::ifstream;
using std::ofstream;
using std::istringstream;
#include <fstream>
#include <sstream>
#include <array>
#include <ctime>
#include <climits>
#include <cstdlib>
#include <alg... |
f99aaacd932b1ccc64d39285ed75f31e95352e55 | 555bd46b095e55a204feca15e390a06695fd2117 | /include/lut_cover.h | ff26a5f11f86f33973ffa6bf5615aa064ed1f33d | [] | no_license | lukasc-ch-archive/libmajesty | af354f1ea4646aedfea4f1f92ca02982baf5b4ff | 4ab8290273e139be20b06c13113a8bad30df4c80 | refs/heads/master | 2023-01-03T02:22:44.389197 | 2020-10-31T11:30:10 | 2020-10-31T11:30:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,638 | h | lut_cover.h | #ifndef LUT_COVER_H
#define LUT_COVER_H
#include <logic_network.h>
#include <cut.h>
#include <map>
#include <unordered_map>
#include <vector>
namespace majesty {
using bestmap = std::vector<cut*>;
using nintmap = std::vector<unsigned int>;
using cover = std::vector<unsigned int>;
class xmg;
cover build_cover(c... |
c1a3fe1fffe2c80255eb25a98485749518d68a0c | 75ab5af1b289544d8801ca800d5b0920839b6636 | /include/mapper/prm.h | 9a3822e4650efd2427a53a7dd0696f4ebe0a3376 | [] | no_license | marcelinomalmeidan/mapper | 57520a99eb5ef077d7dd35b608840d767bd39220 | b3cd84254eda82a1053df77795d92f217e99771b | refs/heads/master | 2020-03-21T18:24:40.023504 | 2019-11-09T00:21:23 | 2019-11-09T00:21:23 | 138,889,904 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,682 | h | prm.h | /* Copyright (c) 2017, United States Government, as represented by the
* Administrator of the National Aeronautics and Space Administration.
*
* All rights reserved.
*
* The Astrobee platform is licensed under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with... |
bc422fdc28d1ec8b6eb43828622d803236fe773c | b71a60805fa056e50555a1306ee0b98dafbe82cc | /src/pelican-mdsm/pipelines/SigprocMdsmPipeline.h | 556f1ec3cc0374c8985c27eea810fc1b25d0b07d | [] | no_license | lessju/MDSM | c1cbc32f1c829aedd01a48aa53e10b4204f7c24c | 222f2fb5abde95c7f28a40683ff02b43d3dd90f9 | refs/heads/master | 2021-01-17T11:15:45.028474 | 2016-03-11T13:31:19 | 2016-03-11T13:31:19 | 687,644 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 853 | h | SigprocMdsmPipeline.h | #ifndef SigprocMdsmPipeline_H
#define SigprocMdsmPipeline_H
#include "pelican/core/AbstractPipeline.h"
#include "pelican/data/DataBlob.h"
#include "SpectrumDataSet.h"
#include "DedispersedTimeSeries.h"
#include "DedispersedDataWriter.h"
#include "MdsmModule.h"
using namespace pelican;
using namespace pelican::lofar;
... |
3568e00081ba5dd5833b6127aa5c2a6562e83724 | a68195278267b091957927393435145f1bf8ed97 | /Funciones forma 1.cpp | 2a802c1aec9c4454e548378875024796ad54b50d | [] | no_license | David-sqrtpi/Cpp | 29548528c88dcd4139e40a87a976081383275676 | 750b3ee6988f006a01d4b1abb73dab74e9a1597f | refs/heads/master | 2020-08-07T14:44:12.440238 | 2020-08-02T04:10:38 | 2020-08-02T04:10:38 | 213,493,005 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 461 | cpp | Funciones forma 1.cpp | //Lee un número y halla su raiz cuadrada usando funciones.
#include <iostream>
#include <math.h>
using namespace std;
float raiz(float);
float a;
int main(){
cout<<"Digite un dato\n";
cin>>a;
if (a>=0.0)
{
cout<<"La raiz cuadrada de "<<a<<" es "<<raiz(a)<<endl;
}
else
{
cout<<... |
44a6c03e82e941e49ef9f96dc1b6b423210ab2a0 | 10571cc8e30797b2bdad94817580e420b4a89742 | /fon9/fmkt/SymbFuoClosing.hpp | 236c9e4d7bcd60eafba60556a5f54a7cea430550 | [
"Apache-2.0"
] | permissive | fonwin/libfon9 | 3651cab44470ca353dd779280f0a1e550001af9b | ff682e272798a9a65d4b18852eb6522a715f48f2 | refs/heads/master | 2023-08-28T06:54:05.250118 | 2023-07-25T02:36:46 | 2023-07-25T02:36:46 | 115,598,127 | 30 | 12 | Apache-2.0 | 2023-02-24T07:08:05 | 2017-12-28T07:36:02 | C++ | UTF-8 | C++ | false | false | 961 | hpp | SymbFuoClosing.hpp | // \file fon9/fmkt/SymbFuoClosing.hpp
//
// 期權商品收盤後相關資訊, 例如: 結算價;
//
// \author fonwinz@gmail.com
#ifndef __fon9_fmkt_SymbFuoClosing_hpp__
#define __fon9_fmkt_SymbFuoClosing_hpp__
#include "fon9/fmkt/Symb.hpp"
#include "fon9/fmkt/FmktTypes.hpp"
namespace fon9 { namespace fmkt {
struct SymbFuoClosing_Data {
/// 結算... |
609b160ef48f29905edbf9ba3cebd1a92142ce39 | b7f3edb5b7c62174bed808079c3b21fb9ea51d52 | /chrome/browser/chromeos/crosapi/lacros_loader.cc | 653681de04840f3aaa98417084a92a188cbf357a | [
"BSD-3-Clause"
] | permissive | otcshare/chromium-src | 26a7372773b53b236784c51677c566dc0ad839e4 | 64bee65c921db7e78e25d08f1e98da2668b57be5 | refs/heads/webml | 2023-03-21T03:20:15.377034 | 2020-11-16T01:40:14 | 2020-11-16T01:40:14 | 209,262,645 | 18 | 21 | BSD-3-Clause | 2023-03-23T06:20:07 | 2019-09-18T08:52:07 | null | UTF-8 | C++ | false | false | 3,739 | cc | lacros_loader.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 "chrome/browser/chromeos/crosapi/lacros_loader.h"
#include <utility>
#include "base/bind.h"
#include "base/command_line.h"
#include "base/files... |
84cde0634e25913eb188ad8677babff48736d7a9 | 506a359c19f18616d5002361f9c470ff58afdb44 | /high-level/scoutos/scout/libscout/src/test_behaviors/Scheduler.h | 5e2bf283a654660b5fc66907c08cc7a0d136622e | [
"MIT",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | CMU-Robotics-Club/Colony | d4df76363597075fdaef26d4c43b078fb8d0c8af | ccc8747ac670171930896201c5284ecd23514df2 | refs/heads/master | 2020-03-26T17:47:40.332115 | 2015-04-09T22:03:58 | 2015-04-09T22:03:58 | 24,465,817 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 853 | h | Scheduler.h | #ifndef _SCHEDULER_
#define _SCHEDULER_
#include "../helper_classes/PQWrapper.h"
#include "../helper_classes/Order.h"
#include "../Behavior.h"
#define NUM_TASKS 5
#define WAITING_ROBOT 1
#define NEW_ROBOT 2
#define ORDERED_ROBOT 3
typedef struct{
std::string name;
ros::Publisher topic;
int sched_status;
} Robo... |
d1222cec1f56f5cfa6abedac4c42eb065c3010ee | 0d1b5db4da112ca12f236b6ca33a30b50fd7c839 | /OpenGLStudy/Engine/Graphics/Light/SpotLight/SpotLight.cpp | d7b843f64bf123a791058b74c9ead519a51d81de | [] | no_license | BosonHBC/GraphicsEngine_OpenGL | fd8f86f764a17a74432f6b1f2823e5dd01d34067 | a59c8564a3e9b17d986374b769f8bc50251d9353 | refs/heads/master | 2020-11-24T09:49:02.829849 | 2020-10-04T23:13:56 | 2020-10-04T23:13:56 | 228,088,171 | 6 | 1 | null | 2020-10-04T23:13:57 | 2019-12-14T20:59:47 | C++ | UTF-8 | C++ | false | false | 2,463 | cpp | SpotLight.cpp | #include "Graphics/Light/SpotLight/SpotLight.h"
#include <stdio.h>
#include "Graphics/Graphics.h"
#include "Graphics/UniformBuffer/UniformBufferFormats.h"
namespace Graphics {
cSpotLight::cSpotLight(Color i_color, const glm::vec3& i_position, const glm::vec3& i_direction, GLfloat i_edge, GLfloat i_radius):
cPointL... |
36db518230eb318a0c0a6596fc1c6983ddbac906 | db3033246bb9edc514d19e0c604e5cc7c41ff6e3 | /week3/卞秋阳/week3/二分查找.cpp | ebeedfec54dc0e92a07a3a87248f904e747a8614 | [] | no_license | 1525125249/NEUQ-ACM-Solution | 2945a96659ccc5b5294a358564291c758feffce9 | f651574880b6974b12e5dbc28f78d9bf4c1694b3 | refs/heads/main | 2023-08-27T17:56:56.052183 | 2021-11-07T05:14:30 | 2021-11-07T05:14:30 | 425,413,832 | 0 | 0 | null | 2021-11-07T04:40:57 | 2021-11-07T04:40:57 | null | UTF-8 | C++ | false | false | 314 | cpp | 二分查找.cpp | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int main(){long long int a[maxn];
long long int n;cin>>n;
int m;cin>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int flag=0;
for(int i=1;i<=n;i++){
if(a[i]>=m){
flag=1;
cout<<i;break;
}
}
if(flag==0) cout<<n+1;
}
|
d9da76dfdf626efa17cc35703021cdbf77f56ae8 | 7d47d7aec2a7af8823972a559c12dcd81eacfbe5 | /client/SampleClient.cpp | d27341a73272b5a4da58f3e21318ee567c0b4d49 | [] | no_license | luochen01/mapkeeper | 6b46446bf62913865f1a6b5d9e1b6bbcbf841e19 | 5c0b246f4e3abc2efcd2edd5fb3efe79d9a795a2 | refs/heads/master | 2020-04-17T10:19:31.631475 | 2019-01-20T23:39:24 | 2019-01-20T23:39:24 | 166,497,005 | 0 | 0 | null | 2019-01-19T02:20:39 | 2019-01-19T02:20:39 | null | UTF-8 | C++ | false | false | 6,914 | cpp | SampleClient.cpp | /**
* A sample client.
*/
#include <boost/lexical_cast.hpp>
#include <cassert>
#include "MapKeeper.h"
#include <protocol/TBinaryProtocol.h>
#include <transport/TServerSocket.h>
#include <transport/TSocket.h>
#include <transport/TBufferTransports.h>
using namespace ::apache::thrift;
using namespace ::apache::thrift::... |
6c57ab84818f4c070c2fdf775350f36b762ad430 | b5dbb842d058efd6bb493ea723193aa8da060b0f | /gate/AG/Src/UI/UIListener.cpp | 0349a8c3a380352bf9f4be0defb82934371112c6 | [] | no_license | zngj/OpenTheDoor | 7d737a36011aa812bd9e7a66cf58a304fa8077f7 | ae911f9f6a55e558c18ce0cc388e127413f52028 | refs/heads/master | 2021-01-01T20:14:14.684936 | 2017-09-15T03:54:32 | 2017-09-15T03:54:32 | 98,795,015 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,716 | cpp | UIListener.cpp | #include "UIListener.h"
#include <QApplication>
#include <QEvent>
#include <qevent.h>
std::mutex UIListener::mtx;
UIListener * UIListener::listner=nullptr;
UIListener::UIListener()
{
}
UIListener *UIListener::getInstance()
{
std::unique_lock<std::mutex> lock(mtx);
if(listner==nullptr)
{
listne... |
832a13c3870c844b84d9edb29a84db55ec373259 | 0ca6eaa807aaa1c64a308ffac90b6e689933e0d3 | /src/bm-int-tostring.cpp | 9e66b2f23a5e0eb4a18bae5aadbd2a2718da4457 | [] | no_license | bibmaster/bitops-benchmark | 141c060fdf90e0c8cb461d54e6b39b5974421fd8 | 09808c7e616d595982ea7b64a8f833d6d2c3833d | refs/heads/master | 2020-07-16T06:43:49.123171 | 2019-09-01T22:54:09 | 2019-09-04T10:26:41 | 205,740,760 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,578 | cpp | bm-int-tostring.cpp | #include <benchmark/benchmark.h>
#include <algorithm>
#include <array>
#include <iostream>
#include <random>
#include <string>
template<typename T>
constexpr unsigned to_chars_len(T x) noexcept {
unsigned n = 1;
for(;;) {
if(x < 10)
return n;
if(x < 100)
return n + 1;
... |
a44b72a131875052293576eda74f2e0122ae8a7e | 6f0ceee714bccf2a89c34a06aabd3bcb781a2fa4 | /src/nnvm/node_op_util.h | cba6fb8286af6f257d787566f4f8aee05749cccb | [
"Apache-2.0",
"MIT",
"Unlicense",
"BSL-1.0",
"NCSA",
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla",
"BSD-2-Clause",
"OFL-1.0",
"BSD-2-Clause-Views",
"Zlib"
] | permissive | yajiedesign/mxnet | 5a495fd06dd1730c17d2d27d7e46c8a770847f17 | 8e5a16cf673db5aceb48d2cf7a0fc1abd0ee5e51 | refs/heads/master | 2021-03-30T22:37:18.603396 | 2020-10-23T06:40:17 | 2020-10-23T06:40:17 | 43,763,550 | 214 | 59 | Apache-2.0 | 2020-06-01T23:31:15 | 2015-10-06T16:36:40 | C++ | UTF-8 | C++ | false | false | 3,877 | h | node_op_util.h | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... |
26940c85596715e6de7b8beb6f77f71c9be10409 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /contest/1542574252.cpp | 11a9f60f49a5942b54d3c488d60f980e6c245b7e | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,669 | cpp | 1542574252.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
#include <chrono>
using namespace std;
bool solve() {
int problemCount, teamCount;
cin >> problemCount >> teamCount;
vector<tuple<int, int>> problems;
problems.reserve(problemCount);
for(int i = 0 ; i < p... |
92aaf304988b67af899cc4563501a4cdb6716ff1 | 7a4f3fa9b6ca70ee461b30fa30b908316f41dd8b | /ioi_past_papers/2015/boxes_with_souvenirs.cpp | 8ef5bb0053496071f4212efdf87aa7a3b405d603 | [] | no_license | rahularya50/ioi_prep | e622880dd3aa18a56d3f086fce56897cbdf695ef | a0ddf5ed2570a2fff6f2ffc03efe6105ad28ff52 | refs/heads/master | 2021-06-07T21:53:30.984562 | 2019-10-29T01:30:49 | 2019-10-29T01:30:49 | 135,590,243 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,321 | cpp | boxes_with_souvenirs.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long N, K, L;
cin >> N >> K >> L;
vector<long long> pos(N);
for (auto& x : pos) {
cin >> x;
}
// cout << "dps built\n";
vector<long long> l_dp(N);
for (long long i =... |
b3cf370404efebe707cc32c2cf07575d4c107f82 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/base/fs/rdr2/rdpdr/sys/drive.h | 813992c817a662b3e7fdf0c854245160fe80ce3b | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 3,415 | h | drive.h | /*++
Copyright (c) 1999-2000 Microsoft Corporation
Module Name :
drive.h
Author :
JoyC 11/1/1999
Abstract:
Drive Device object handles one redirected drive
Revision History:
--*/
#pragma once
class DrDrive : public DrDevice
{
private:
protected:
virtual BOOL IsDevi... |
fe95cf1ba9d2da7404d3897b8c86d04e4b34929e | ae8a712c2450c589a66247f543e44925e7aefaec | /tests/files.cpp | 200dbc9af021820ea91b559fbf59e680be20a3e5 | [
"MIT"
] | permissive | omsgunjal2003/bash2cpp | bef837eef70d8657b68a50615618b79391d38c1b | c5c5c2dc4a07a524c9ba8292e30915805f6371f7 | refs/heads/main | 2023-08-28T01:25:41.077058 | 2021-07-16T20:34:38 | 2021-07-16T20:35:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 774 | cpp | files.cpp | #include <string>
#include <iostream>
#include <filesystem>
#include <glob.h>
#include <vector>
#include <string>
std::vector<std::string> globVector(const std::string& pattern){
glob_t glob_result;
glob(pattern.c_str(),GLOB_TILDE,NULL,&glob_result);
std::vector<std::string> files;
for(unsigned int i=0... |
cb54ccccbd129ecdc85bca4c7f90fff969a0d783 | 8c094d141dc5d62db2872bd6453597362a25ce83 | /src/PID.cpp | 2dbe4bf4c67840f5b294a34e528777a94cc45ca8 | [] | no_license | kunwarmahen/CarND-PID-Control-Project | 3ff94bcf264438fc8761f2375807f627998d0c02 | f939bbaae8c280674832794520dd40e3eac43aed | refs/heads/master | 2020-08-31T08:34:40.024857 | 2017-06-15T03:23:01 | 2017-06-15T03:23:01 | 94,394,947 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,573 | cpp | PID.cpp | #include "PID.h"
#include <iostream>
using namespace std;
/*
* TODO: Complete the PID class.
*/
PID::PID() {}
PID::~PID() {}
void PID::Init(double Kp, double Ki, double Kd) {
this->Kp = Kp;
this->Ki = Ki;
this->Kd = Kd;
this->p_error = 0;
this->d_error = 0;
this->i_error = 0;
//this->Ks[0] = Kp;
//this->... |
6cfb044fe7c8836b3bba8677a5d83e069aa0f7ac | 05b72d3eb9bc9b836aea86045cef02f17b3de3ea | /src/graf/grafDrawer.cpp | 5d5c334c47097be35346e0bd0b4017af88542360 | [] | no_license | jjzhang166/GA_Interactive | 9b234c3611c041b9cc5e09a8e931678068af6b7a | c0fbb5f61d62727e56c70d0869c8af7bc9e9b010 | refs/heads/master | 2021-12-02T04:53:53.309527 | 2010-06-29T22:05:57 | 2010-06-29T22:05:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,478 | cpp | grafDrawer.cpp | #include "grafDrawer.h"
grafDrawer::grafDrawer()
{
alpha = 1.f;
minLen = .005;
lineWidth = 2.0;
lineAlpha = .92;
lineScale = .05;
bSetupDrawer = false;
pctTransLine = .001;
flatTime = 0;
}
grafDrawer::~grafDrawer()
{
for( int i = 0; i < lines.size(); i++)
delete lines[i];
}
void grafDrawer::setup(grafTag... |
d6e63791dffb0df9e4a52177cc141cc8a08afc93 | 916e96efbb613b9d57e585d33f5a1e368f3de58a | /main.cpp | 6d78bef87792bd291215902dbf03e04c519a5d4c | [
"BSD-3-Clause"
] | permissive | Press-Play-On-Tape/PiCross_Pokitto | d5ea5b6c5588779055a392123f977b9f8c38dbba | 8a08ac65d232c8457b2ee323be58c52f09757ced | refs/heads/master | 2020-09-21T23:47:46.121615 | 2020-08-02T06:46:01 | 2020-08-02T06:46:01 | 224,976,000 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 714 | cpp | main.cpp | #include "Pokitto.h"
#include "PokittoCookie.h"
#include "src/Game.h"
#include "src/entities/Puzzle.h"
#include "src/utils/GameCookie.h"
using PC = Pokitto::Core;
using PD = Pokitto::Display;
Game game;
GameCookie cookie;
int main() {
// Initialise pokitto ..
cookie.begin("PICROSS", sizeof(cookie), (cha... |
3ea7a96534a90d5e0469f1bdad39706ad401f6b3 | 945e7bf2e9aef413082e32616b0db1d77f5e4c7e | /renderer/src/renderer/camera.cpp | 87a9ba1bd35401c0f7fbdfed42b8b2fe936efb8d | [] | no_license | basarugur/bu-medialab | 90495e391eda11cdaddfedac241c76f4c8ff243d | 45eb9aebb375427f8e247878bc602eaa5aab8e87 | refs/heads/master | 2020-04-18T21:01:41.722022 | 2015-03-15T16:49:29 | 2015-03-15T16:49:29 | 32,266,742 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,485 | cpp | camera.cpp | #include "camera.h"
namespace scene
{
//p eye point, d is up vector, t is target point
Camera::Camera(const space::Point3& p,const space::Vector3& d,const space::Point3& t) : m_position(p),m_dir(d),m_target(t)
{
space::Vector3 v(t.x()-p.x(),t.y()-p.y(),t.z()-p.z());
space::Vector3 u = d ^ v;
space::V... |
47227f6787a5aa451ac55a9eef8ca7ef85fd3bcf | 39edb814c3464ace226d26ef6ccb8dcc3d6bb788 | /Player.hpp | 101a892fb4771f59212b4070f7fc24bc6a63257c | [] | no_license | Serdior/Minecraft_Jumper | 508b4a839750748e6a4ed8d01aa534c8ac2d606f | 26630bcac9c905ea9bfd4e386310de6276e84191 | refs/heads/master | 2023-02-04T01:20:27.647587 | 2020-12-26T19:06:58 | 2020-12-26T19:06:58 | 296,396,462 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | hpp | Player.hpp | #ifndef PLAYER_H
#define PLAYER_H
#include<iostream>
#include<SFML/Graphics.hpp>
#include<SFML/Window.hpp>
#include<SFML/Audio.hpp>
#include<cmath>
class Player
{
private:
bool canJump = true;
sf::Texture tex;
void updateMove();
void jump();
public:
Player();
virtual ~Player();
fl... |
d123dd2678f7e5767cb0325e862c909c423fe417 | d61ff33e0291cf0edc44b3660db45adf0f06fbeb | /Game/Source/Game/PlayerChara.cpp | 9837399bd4622dd2cb47c68f74188f4df04073fd | [] | no_license | 19cu0235-maliphonkenichi/19CUHukuokaGameA | 814d4787472e70353bb4003aa02b9c852e0a0aea | 44a9ae40596e86cb81a73f94fa658a9e14533f39 | refs/heads/master | 2023-01-04T02:03:09.454843 | 2020-10-23T02:57:45 | 2020-10-23T02:57:45 | null | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 15,205 | cpp | PlayerChara.cpp | // インクルード
#include "PlayerChara.h"
#include "Engine.h"
#include "GameFramework/SpringArmComponent.h"
#include "Camera/CameraComponent.h"
#include "GameFramework/CharacterMovementComponent.h"
#include "Components/SkeletalMeshComponent.h"
#include "..\..\UE4Duino\Source\UE4Duino\Public\Serial.h"
#include <time.h>
// def... |
b3815c1ad81b1301ef2a562e01f9625f5c565a8f | 1885ce333f6980ab6aad764b3f8caf42094d9f7d | /test/e2e/test_master/ObjectArxHeaders/dbloftedsurf.h | 8df6a76cecf4e3106b069a1b2e39e71fec360ec4 | [
"MIT"
] | permissive | satya-das/cppparser | 1dbccdeed4287c36c61edc30190c82de447e415b | f9a4cfac1a3af7286332056d7c661d86b6c35eb3 | refs/heads/master | 2023-07-06T00:55:23.382303 | 2022-10-03T19:40:05 | 2022-10-03T19:40:05 | 16,642,636 | 194 | 26 | MIT | 2023-06-26T13:44:32 | 2014-02-08T12:20:01 | C++ | UTF-8 | C++ | false | false | 13,447 | h | dbloftedsurf.h | //////////////////////////////////////////////////////////////////////////////
//
// Copyright 2018 Autodesk, Inc. All rights reserved.
//
// Use of this software is subject to the terms of the Autodesk license
// agreement provided at the time of installation or download, or which
// otherwise accompanies this ... |
66de46fb91bb5307c08fe6a2d5a352246c3bd78c | 06fee45a8cd9f5391bb89e0dcbd81a374ea3593b | /Libraries/NtlLib/Shared/PathEngine-5.07/code/libs/TestBed_Application/interface/iControlInterface.h | cba861d04a034c59e674044625ea3ccba3dba2ac | [] | no_license | ivanlamega/dragon-ball-online-tw-server | 3afde0aae0c8a15370559670e58ec509fa680147 | 31e432f208d725cb4c71d91d0292b4056819d075 | refs/heads/master | 2022-03-03T14:57:27.590250 | 2022-02-16T17:49:51 | 2022-02-16T17:49:51 | 208,133,340 | 33 | 37 | null | 2019-10-15T10:33:29 | 2019-09-12T19:44:55 | Perl 6 | UTF-8 | C++ | false | false | 1,738 | h | iControlInterface.h | //**********************************************************************
//
// Copyright (c) 2002
// PathEngine
// Lyon, France
//
// All Rights Reserved
//
//**********************************************************************
class controlinterface
{
public:
virtual long __stdcall getversion(long min, long max) =... |
2519432375f77576e8721f7a64ea3e26835280c9 | 5368f9bbc1376095643d775db1474b965ec71e3d | /windows/misc/6_Lambda-Expressions/610_higher_order_functions_0/src/610_higher_order_functions_0.h | aec966c4d5f37a4a61a4e92aed35a81599757aaa | [] | no_license | JoshuaHolloway/modern_Cpp | aba46e162b12c5c4b2b2f148409449512d780001 | a2d3b38021d0310e4357f54346f00eb0e5588c2e | refs/heads/master | 2021-10-28T04:43:33.879538 | 2019-04-22T05:47:39 | 2019-04-22T05:47:39 | 168,855,909 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 519 | h | 610_higher_order_functions_0.h | #pragma once
#include <cmath>
//---------------------------------------------------------
double fin_diff(double f(double), double x, double h)
{
return (f(x + h) - f(x)) / h;
}
//---------------------------------------------------------
double sin_plus_cos(double x)
{
return sin(x) + cos(x);
}
//--------------------... |
ee916e9601aed244269efce1f52936504a581b1b | d47e7d52d97c40049cb7775664c278006b1446ed | /mystring.h | 89b221bf519671407a76f0ee0f0fa0c2493b56bb | [] | no_license | syedfaisalkarim/C---library-for-standard-algorithms | 7a989b30c219bf663c852a695e6b9c229029a859 | fe91757ffa8a2ddaa6375512a5d0a73a5c57ae1b | refs/heads/master | 2021-01-20T09:41:45.026106 | 2012-07-18T12:07:58 | 2012-07-18T12:07:58 | 3,290,492 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,060 | h | mystring.h | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<map>
#include "numberthoery.h"
using namespace std;
/*string matching algo - O(n*m)
* converts strings into numerical representation
* since it can be very big numbers are stored mod of some prime chosen
* if the main string and substr... |
d1518fbe01d7312c169037a58aa6d7e792104e6c | 217dc5e7628ffa689134c9001085d272aca5d22d | /Labs/Lab_05/Answers/prob04/main.cpp | 570ffae4791f6bfe625ad561f4bd02f50eb0a6df | [
"MIT"
] | permissive | markjcasas/CPSC121 | 167c59cbc654f622eace478d362a555a2a1a0121 | 5fa87edbc7d9a8d278aea182c34342402454a444 | refs/heads/master | 2021-06-14T01:12:31.011610 | 2019-12-22T04:30:18 | 2019-12-22T04:30:18 | 254,465,752 | 0 | 0 | null | 2020-04-09T19:55:42 | 2020-04-09T19:55:41 | null | UTF-8 | C++ | false | false | 760 | cpp | main.cpp | #include <fstream>
#include <iomanip>
#include <iostream>
#include <string>
int main() {
std::string file;
std::cout << "Please provide the file name for your donation file: ";
std::cin >> file;
std::ifstream infile;
infile.open(file);
if (infile.is_open()) {
int number;
infile >> number;
infile... |
5afeb577b798c145a6d7d2ce6f776b053dde1c02 | 8f01996e67341cc88afe7e946e930407c795450e | /PTA/团体程序设计天梯赛-练习集/L1-054 福到了 (15分).cpp | 5eec0ddb7b43aea8283ca0033e64dceb90cb2a93 | [] | no_license | LonglongSang/Life_of_XDU | 1e37aba8062d6d481ac77423a6ce14c45e661ef8 | 3714136eb78c226a79762b479f5215f6a4d7fcd7 | refs/heads/master | 2023-05-15T10:29:22.856539 | 2021-06-15T12:55:01 | 2021-06-15T12:55:01 | 297,281,419 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 803 | cpp | L1-054 福到了 (15分).cpp | #include <stdio.h>
#include <iostream>
#include <stdlib.h>
using namespace std;
int n;
#define N 1000
char g[N][N],v;
/*
$ 9
@ @@@@@
@@@ @@@
@ @ @
@@@ @@@
@@@ @@@@@
@@@ @ @ @
@@@ @@@@@
@ @ @ @
@ @@@@@
*/
int main(){
scanf("%c %d",&v,&n);
getchar();
for(int i=0;i<n;i++){
scanf("%... |
e9b8d8d832bbe84fcef042392d81b28f9a20365d | 2bdad1e49e7f301a4f10d19f7ed29c1b4169fb8d | /baekjoon/baekjoon/파티.cpp | b863ef43fd0bf1e2b41df82e549eab61e13265e0 | [] | no_license | leleluv1122/Algorithm | 6589c640233b759176dec212a7ed7fbb52b283dd | 39327686e568c5d0369dfde61ec90f51b6241638 | refs/heads/master | 2023-03-13T23:25:11.643458 | 2021-03-08T13:13:17 | 2021-03-08T13:13:17 | 238,405,577 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 831 | cpp | 파티.cpp | //#include <iostream>
//#include <algorithm>
//using namespace std;
//const int MAX = 1000 + 1;
//int road[MAX][MAX];
//int N, M, X;
//
//void floyd() {
// for (int i = 1; i <= N; i++) {
// for (int j = 1; j <= N; j++) {
// if (road[j][i] == 0)
// continue;
// for (int k = 1; k <= N; k++) {
// if (road[i][k]... |
5bf49310d129985042b1870358a7703ac1b6fa63 | a0520d6a3da7e4b51f7422908c60f6c99efcad08 | /Exercicios Slide/ArvoreBinaria/FilaEncad.h | d067f73d551da7e0c4196d7f68bca7be003be706 | [] | no_license | thiago9864/estrutura_de_dados1 | daf4da84b03bf46fcad684b0d33713d10c395a07 | 2ecf781c6ccde57f9d8106720c1ffc9c06ad24d5 | refs/heads/master | 2020-03-29T14:51:29.515037 | 2018-09-23T23:53:45 | 2018-09-23T23:53:45 | 150,035,307 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 548 | h | FilaEncad.h | #ifndef FILAENCAD_H_INCLUDED
#define FILAENCAD_H_INCLUDED
#include "NoFila.h"
#include "No.h"
using namespace std;
class FilaEncad
{
private:
NoFila *ini;
NoFila *fim; /// ponteiros para os No's extremos
public:
FilaEncad();
~FilaEncad();
No* getInicio(); /// retorna va... |
bf6f5b4be7b3ea4f7acc9c06cba305cb01b3fc97 | e8dfe25712c8d50dd7c6bb7f583a6dcc3cc3851a | /ftpform.h | 8f499f6bdfce01be62c36bcc159dc80fcd56d03d | [] | no_license | Nan0527/SharedFileTerminal | fb3d0ae4512f9d19ff7335eb4c1818a66cf5db93 | b12d5978de4c4bfc413662a8a3cbce6ff35876a2 | refs/heads/master | 2020-03-18T14:03:22.578588 | 2018-05-25T08:53:09 | 2018-05-25T08:53:09 | 134,821,970 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 659 | h | ftpform.h | #ifndef FTPFORM_H
#define FTPFORM_H
#include <QWidget>
#include "ftpmanager.h"
namespace Ui {
class ftpForm;
}
class ftpForm : public QWidget
{
Q_OBJECT
public:
explicit ftpForm(QWidget *parent = 0);
~ftpForm();
private:
Ui::ftpForm *ui;
private slots:
void S_updateProgess(int);
void S_upd... |
027696c6309e8efbba09bb0ec66954651686d8db | b37c75b4e587211cd463176ee46e5b4268e96683 | /FindPeakElement.cpp | 86f5dd642a0722799b16ffe2103eb7d98d99de69 | [] | no_license | tangziyi001/LeetCode | 0171044b472658f1bb4ff36cf939522d43ae24ae | a51640a282f60696d2627283684b563af6d584bc | refs/heads/master | 2021-06-12T19:53:18.100244 | 2017-04-05T00:09:42 | 2017-04-05T00:09:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 655 | cpp | FindPeakElement.cpp | // Divide and Conquer (Binary Search)
class Solution {
public:
int sz;
vector<int> all;
int peak(int l, int r){
cout << l << " " << r << endl;
if(l == sz-1 || (all[l] >= all[r] && l + 1 >= r))
return l;
else if(all[l] < all[r] && l+1>=r)
return r;
i... |
091da89e60b026ca29450b9b09433f3771a1ba90 | 03dfd5703a3f41674387fa74cb41c1dfbcac7dc4 | /src/csapex/src/msg/output.cpp | 5945c6d774009dbd8b9d87495f54876509966a9b | [] | no_license | deliangye/csapex | e89b8c1709c203aa8c45cd3ffa039f02b79694a3 | 0a0f1cac1627468c961faa10a66a84511369fb1a | refs/heads/master | 2021-06-26T20:42:51.094638 | 2017-08-14T05:06:01 | 2017-08-14T05:06:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,387 | cpp | output.cpp | /// HEADER
#include <csapex/msg/output.h>
/// COMPONENT
#include <csapex/msg/input.h>
#include <csapex/model/connection.h>
#include <csapex/profiling/timer.h>
#include <csapex/utility/assert.h>
#include <csapex/msg/token_traits.h>
#include <csapex/utility/debug.h>
/// SYSTEM
#include <iostream>
using namespace csape... |
4ff1ee8117635b741ec8fc7e86d290b93e92219d | fd320551dc41cde5d5a361141876d7f003f97faf | /normal-core/include/normal/core/type/Integer32Type.h | 57bdefda79887629c38591e4e3f26dd1435a0f56 | [] | no_license | ergouy/FlexPushdownDB | e157daa8788f73d66cb6f3f8cc4b825b8e455fad | 218705d5195db39bf3eb9457d69fa7759824dec7 | refs/heads/master | 2023-08-11T12:38:01.227056 | 2021-07-20T17:23:58 | 2021-07-20T17:23:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 639 | h | Integer32Type.h | //
// Created by matt on 15/4/20.
//
#ifndef NORMAL_NORMAL_CORE_INCLUDE_NORMAL_CORE_TYPE_INTEGER32TYPE_H
#define NORMAL_NORMAL_CORE_INCLUDE_NORMAL_CORE_TYPE_INTEGER32TYPE_H
#include <arrow/api.h>
#include <normal/core/type/Type.h>
namespace normal::core::type {
class Integer32Type: public Type {
private:
public:
... |
5bb537446e886dff40201fcdf8aca8fa90c915fe | 18e19e272b767b78a1ab973013ef72a34036c7ce | /examples/fftSimple/src/ofApp.cpp | d4ac3a29745f3f4f33fb40c779f9e0e064a2c8df | [] | no_license | wolfm2/openframeworks | 857f80dc9434cad97c6799d7069afa4e27459660 | dcf6a630847079061ae6d47b7b363a2c85d35d14 | refs/heads/master | 2020-04-14T13:52:55.073511 | 2020-03-11T21:43:24 | 2020-03-11T21:43:24 | 163,881,220 | 5 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,108 | cpp | ofApp.cpp | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup(){
song.load("song.mp3");
while (! song.isLoaded()); // spin wheels till loaded
song.play();
nBandsToGet = 360; // up to 512
}
float *val;
//--------------------------------------------------------------
voi... |
713236a8035604911a27c0ab7cdb92bd4cb36add | bb78da367a92893a5f74fb0a629c089fb28b8474 | /includes/.svn/text-base/HealthBar.h.svn-base | db7a6db3d599922d9f439ffc490a471f2284ad6e | [] | no_license | pixelgriffin/DroneCraft | 208958289c5daf46fdb987b60201887b60711591 | 4a2ffc0d0054348a8013ffa92ed73d1e65a7ec3a | refs/heads/master | 2021-01-21T13:33:48.918353 | 2016-05-10T19:08:38 | 2016-05-10T19:08:38 | 49,755,016 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,188 | HealthBar.h.svn-base | /*
* File: HealthBar.h
* Author: chris
*
* Created on April 29, 2013, 10:34 AM
*/
#ifndef HEALTHBAR_H
#define HEALTHBAR_H
#include "Rect.h"
/*! Health bar displays a bar above selected entities, showing how much damage the
* entity has taken. The health bar is composed of two rectangle, a green rectangle for... | |
663f9890951b4f41771c22bcf15976738f8da238 | eec861c6aa3daaba960e78f4b88bca7ab7c6b9eb | /Cards/Cards.h | 271bcd80f6906b78e789e46fe484f3ac31f2736b | [] | no_license | GenevievePlanteBrisebois/comp-345-project | c644e550b8a4e6f7c6cfef4b5f5f6cccca65fe05 | d0136918122589eaf7ae0d3f7fa826b6f4e8c599 | refs/heads/master | 2020-04-14T22:21:03.712640 | 2018-11-28T20:15:35 | 2018-11-28T20:15:35 | 164,158,845 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 716 | h | Cards.h | //Written by Genevieve Plante-Brisebois 40003112 for COMP 345 fall 2018
#pragma once
#include <iostream>
using namespace std;
class Cards
{
public:
Cards();
//if the status is false the card is not being used by a player if the status is true the card is being used by a player
Cards(string name, int cost, string ... |
90788deae4022fbfe745b3696c79fb8501f694c9 | 123243c4f40580fcf318adbce633032a5c11c8c5 | /Source/Bomberman/Public/System/BombManager.h | f61e488971e3c1dc4a017b7720a60800699ee86c | [] | no_license | TeeNik/Bomberman | c9abd1ade551bac9f32cbf368eb184a870f91d39 | f4deaea52dafede42e5287ccceeebb7596dd0d82 | refs/heads/master | 2020-06-08T23:27:12.740335 | 2019-06-30T21:03:29 | 2019-06-30T21:03:29 | 193,326,071 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 577 | h | BombManager.h | #pragma once
#include "CoreMinimal.h"
#include "Components/SceneComponent.h"
#include "BombManager.generated.h"
class AFloor;
//BombManager spawns and explodes bombs
UCLASS( ClassGroup=(Custom), meta=(BlueprintSpawnableComponent) )
class BOMBERMAN_API UBombManager : public USceneComponent
{
GENERATED_BODY()
publi... |
b0043ac090b84e2c9889d9138467a264e6e6861a | 23378c451e396684f712fc9f9e2a65a53a61a8a8 | /Others/2359.Find-Closest-Node-to-Given-Two-Nodes/2359.Find-Closest-Node-to-Given-Two-Nodes.cpp | 7acab1c41a63d7d4b962df6224bc8aa56b65ba08 | [] | no_license | wisdompeak/LeetCode | 25676a8bf606c0511dd9844d4e61388235de82f4 | f3d38bbe9e40ceb0ab9780a4cb0dec938eae578e | refs/heads/master | 2023-09-01T18:45:36.056015 | 2023-08-28T08:01:22 | 2023-08-28T08:01:22 | 83,542,585 | 5,153 | 1,209 | null | 2023-07-22T18:15:25 | 2017-03-01T10:30:52 | C++ | UTF-8 | C++ | false | false | 1,156 | cpp | 2359.Find-Closest-Node-to-Given-Two-Nodes.cpp | class Solution {
public:
vector<int>getDist(vector<int>& edges, int node)
{
int n = edges.size();
vector<int>dist(n, -1);
int i = node;
dist[i] = 0;
while (edges[i]!=-1 && dist[edges[i]]==-1)
{
int j = edges[i];
dist[j] = dist[i] + 1;
... |
19afdb073b96ea2102608e3566a0fc8010b89e00 | 39a22a7789232d28cfb622a079102df0c7127477 | /CatProjCpp02/src/include/alg/1.1/ring/ring_ring_base_impl.hpp | 43268d35fbc729b5fbde7912bf4b4b560f393b23 | [] | no_license | gmuel/basic_algebra | b0c80f9a860b15f326c164c4b8e3309b6688479b | 6ee96891c6a432cc79a37e714e7cd2f7683241ff | refs/heads/master | 2023-03-11T05:18:31.941945 | 2021-06-28T04:59:21 | 2021-06-28T04:59:21 | 117,348,728 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,390 | hpp | ring_ring_base_impl.hpp | /*
* ring_ring_base_impl.hpp
*
* Created on: 01.12.2019
* Author: lmmac
*/
#ifndef INCLUDE_ALG_1_1_RING_RING_RING_BASE_IMPL_HPP_
#define INCLUDE_ALG_1_1_RING_RING_RING_BASE_IMPL_HPP_
#include "ring_ring_base.hpp"
#include "../group/group_group_base_impl.hpp"
namespace alg {
template<unsigned int N >
... |
b26d925f36cf66872c1f73522e1252a5444fbca9 | b74dea911cf644ab1b6a6c8c448708ee09e6581f | /SDK/platform/stm32f4/interface/i2c.cpp | bb047290ffa5147fa84e0cbc799874e156449d60 | [
"Unlicense"
] | permissive | ghsecuritylab/CppSDK | bbde19f9d85975dd12c366bba4874e96cd614202 | 50da768a887241d4e670b3ef73c041b21645620e | refs/heads/master | 2021-02-28T14:02:58.205901 | 2018-08-23T15:08:15 | 2018-08-23T15:08:15 | 245,703,236 | 0 | 0 | NOASSERTION | 2020-03-07T20:47:45 | 2020-03-07T20:47:44 | null | UTF-8 | C++ | false | false | 17,055 | cpp | i2c.cpp | /*
* twi_interface.c
*
* Created: 2/8/2013 5:00:27 PM
* Iulian Gheorghiu <morgoth.creator@gmail.com>
*/
/*#####################################################*/
#include "include/stm32f4xx.h"
#include "driver/stm32f4xx_hal.h"
#include "driver/stm32f4xx_hal_i2c.h"
#include "driver/stm32f4xx_hal_i2c_ex.h"
#include... |
71820a97ea447402e0f457a575f941fdb4fae27b | 8427ad30d55d0d0a21621da3772781613d5758af | /coding_interviews/problem8.cpp | f0ee70a9018665f91d1d7d98a334730475aa09e3 | [] | no_license | wuwentao1998/Data-Structures-and-Algorithms | 75811e781f40616241568445cfc9f71aa86d8e51 | 8f175e17c075fc661e2db3981b4dafe1ad055489 | refs/heads/master | 2020-04-14T15:36:13.891897 | 2019-04-06T04:13:18 | 2019-04-06T04:13:18 | 163,931,940 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 751 | cpp | problem8.cpp | // 二叉树的后继节点
struct Node
{
int val;
Node* left;
Node* right;
Node* parent;
};
Node* leftNode(Node* root)
{
while (root->left != nullptr)
root = root->left;
return root;
}
Node* nextNode(Node* curNode)
{
if (curNode == nullptr)
return nullptr;
if (curNode->right != nul... |
88d45dec6a09850d439fd54440849af0beb00577 | e06f54e0ff0ceafc74e987deee3665e4abf61372 | /mf.cpp | c0352276e2aea7f0d7a0d91db431330185042f9f | [] | no_license | ronmackley/DynProc | c843fce15dedb8641529dbd1c4ca89816ae138cd | f2c7f9b7f1f345c1eca8054a772683ef84ece3b3 | refs/heads/main | 2023-02-06T13:45:10.291663 | 2020-12-26T16:48:03 | 2020-12-26T16:48:03 | 324,507,972 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 109 | cpp | mf.cpp | #include <iostream>
extern "C"
{
void myFunc() { std::cout << "Hello, world!" << std::endl; return; }
}
|
d44fb117090ddf164b626fdd84c330098b1c6141 | 5633a274b08b22b934cc060ad1c7435c6cd30533 | /Project/SlimeCore/Object2DManager.cpp | 48c886b763c97ce8acece72341a696e1a5179069 | [] | no_license | AlexMollard/SlimeCore | dbed59bf4daf50e975e2c3590dd38d6224aae0dd | 08a871794222c08ab060774c92fcf84d0fad73dd | refs/heads/master | 2022-11-10T19:07:17.921987 | 2020-06-16T04:19:44 | 2020-06-16T04:19:44 | 237,891,813 | 0 | 0 | null | 2020-03-12T11:52:25 | 2020-02-03T05:28:20 | C++ | UTF-8 | C++ | false | false | 6,586 | cpp | Object2DManager.cpp | #include "Object2DManager.h"
Object2DManager::Object2DManager(TextureManager* textureManager)
{
texManager = textureManager;
TwoDShader = new Shader("TwoDShader", "..\\Shaders\\2DVertex.shader", "..\\Shaders\\2DFragment.shader");
defaultWhite = texManager->Get(0, TEXTURETYPE::Albedo);
defaultCircleTexture =... |
5800d33a0b50b6548888beaa96db92d04013cabf | 385cfbb27ee3bcc219ec2ac60fa22c2aa92ed8a0 | /Tools/WindowViewPort/CreateFunction.cpp | 2dbf511240c2d7dd17a97c41d89a90eb7919acf2 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | palestar/medusa | edbddf368979be774e99f74124b9c3bc7bebb2a8 | 7f8dc717425b5cac2315e304982993354f7cb27e | refs/heads/develop | 2023-05-09T19:12:42.957288 | 2023-05-05T12:43:35 | 2023-05-05T12:43:35 | 59,434,337 | 35 | 18 | MIT | 2018-01-21T01:34:01 | 2016-05-22T21:05:17 | C++ | UTF-8 | C++ | false | false | 1,472 | cpp | CreateFunction.cpp | // CreateFunction.cpp : implementation file
//
#include "stdafx.h"
#include "stdafx.h"
#include "CreateFunction.h"
/////////////////////////////////////////////////////////////////////////////
// CCreateFunction dialog
CCreateFunction::CCreateFunction(CWnd* pParent /*=NULL*/)
: CDialog(CCreateFunction::IDD, pParen... |
e8754d3ccf5c03343c4bdd440aaa57c3319abcfa | 3449f43166b86b2c7500f19a94903590ae7c57ac | /WinStrings.h | b70e946e5481af688e692d70920dc37aa70eafe0 | [] | no_license | jambolo/WinStrings | 4c3eb20d6fb78ed357e9ff759c65589ac155c0f9 | 0a56a6eca517a4c9e79dd55b0c6f0db5e31a457d | refs/heads/master | 2021-01-13T03:11:51.254988 | 2019-07-05T20:10:34 | 2019-07-05T20:10:34 | 77,413,628 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,594 | h | WinStrings.h | #if !defined( WINSTRINGS_H_INCLUDED )
#define WINSTRINGS_H_INCLUDED
#pragma once
/****************************************************************************
WinStrings.h
Copyright 2000, John J. Bolton
----------------------------------------------------------------------
... |
ca46bd1f638a0406580f8e8cfe6adf19f1169cd9 | e48c7e938aea5c012122db3baf0d83365f0facd6 | /1718/Feburary/newbarn.cpp | 38e7f19bacb5abc2f25c269cbfa6b346626e8fef | [] | no_license | neeyanthkvk/USACO | b5912f46c251f3763fcbcb33c43bac5e5674e7b1 | 82a152661bc602eee22ab8f2a9cb2a72156e1893 | refs/heads/master | 2020-04-16T11:06:43.225088 | 2019-01-13T15:55:22 | 2019-01-13T15:55:22 | 115,893,423 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,559 | cpp | newbarn.cpp | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statist... |
63b8a70c913867806f9657f59f439af2c41d61fa | 85b690ce5b5952b6d886946e0bae43b975004a11 | /Application/Input/openfoam-org/processor3/0.45/phi | 8c21fff01cc51836f3907676cb33bf8b71686a13 | [] | no_license | pace-gt/PACE-ProvBench | c89820cf160c0577e05447d553a70b0e90d54d45 | 4c55dda0e9edb4a381712a50656855732af3e51a | refs/heads/master | 2023-03-12T06:56:30.228126 | 2021-02-25T22:49:07 | 2021-02-25T22:49:07 | 257,307,245 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 50,143 | phi | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 5.0 |
... | |
b82e73cbedb5ab552023a638e48e204bec3988ba | 46a270c50ca6d41d92c085aad2d8f8dfa3dc55df | /client/Classes/Scene/FmMainScene.h | a424dd715e484057d08cbd0bb963c76405b0a4fa | [] | no_license | PenpenLi/YXLDGameServer | 74e4eb05215373121029beefb9712f94b0488aea | 6f6e709271a0f47aa8d55226fed436308aae2365 | refs/heads/master | 2022-10-20T15:49:13.793932 | 2020-07-15T07:50:00 | 2020-07-15T07:50:00 | 279,802,517 | 0 | 0 | null | 2020-07-15T07:49:15 | 2020-07-15T07:49:14 | null | GB18030 | C++ | false | false | 1,416 | h | FmMainScene.h | /********************************************************************
created: 2012-12-05
author: pelog
summary: 主场景:GameCanvas
层次:
1.地图层
2.UI层
*********************************************************************/
#pragma once
#include "FmConfig.h"
#include "cocos2d.h"
#include "cocos-ext.h"
#include "Enum/F... |
2a159c82d5c3532cf660f7dbb2d9b23b841e6a37 | 8d9a20f513a99119f50a4b69618d72fb141d55ad | /Lab6/quicksort.cpp | 7518d068f3bc509851029de5e87edc692f049f07 | [] | no_license | Angelussz/Analisis-y-diseno-de-Algoritmos | 5bc1417997a3b9318316df6375043f9c9d5337ae | d8cc246aed635621ab0c0110e7bed14efa5d0560 | refs/heads/master | 2022-11-18T07:24:57.572512 | 2020-07-20T05:18:17 | 2020-07-20T05:18:17 | 260,252,479 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,857 | cpp | quicksort.cpp | //ANGELO ALDO PEREZ RODRIGUEZ
//Referencia : https://www.geeksforgeeks.org/quick-sort/
#include <iostream>
#include<stdlib.h>
#include <fstream>
using namespace std;
//int contador=0;
void Aleatorio(unsigned long& n,unsigned long* arreglo){
for (int i =0;i<n;i++){
int num = 1+(rand()%n);
arreglo[i] ... |
626877fccf2937da29e9422e60f35ac820bcd249 | cb142e98b043e7088f0fe009f5159928877acf1b | /EEPROM/eeprom_get/eeprom_get.ino | 00002fe85b2428b48202881ecc85db0c197c188a | [] | no_license | wetnt/Arduino_public | ef30502b4a30e099a09e2617fd58fd3a9801cf13 | 4cc331e2f43dda0df8f78d9cfe924da130ca5df3 | refs/heads/master | 2021-01-23T09:38:43.302783 | 2019-09-12T00:29:43 | 2019-09-12T00:29:43 | 33,909,041 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 856 | ino | eeprom_get.ino | #include <EEPROM.h>
int address = 0;
void setup() {
Serial.begin( 115200 );
while (!Serial) {
;
}
test_save();
test_read();
}
struct MyObject {
float field1;
byte field2;
char name[10];
};
void test_save() {
int ad;
MyObject c1 = {3.14f, 100, "Work_a!"};
MyObject c2 = {3.15f, 200, "Work_b!"... |
0af44342f6ef63d22d8839c331d613805aa877c3 | 177a619d09dc04cfa1ad11700fe5c10683555702 | /17-4count.cpp | 0efef6383f25cab24726ab2dd7bf3a60ad1a3a9d | [] | no_license | Hanaydn/LearningCpp | 4b1ddaea300c169c1c00eaca397d0c58d3bb382a | 62f852c2d68fb195708f2bb0d0f1e948aadfde11 | refs/heads/master | 2020-03-22T05:02:05.307573 | 2018-07-27T03:59:17 | 2018-07-27T03:59:17 | 139,537,481 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 661 | cpp | 17-4count.cpp | #include<iostream>
#include<fstream>
#include<cstdlib>
using namespace std;
int main(int argc_, char* argv_[]){
if(argc_ == 1){
cerr << "Usage: " << argv_[0] << " filename[s]\n";
exit(EXIT_FAILURE);
}
ifstream fin;
long count;
long total = 0;
char ch;
for(int file = 1; file < argc_; file++){
fin.open(argv_... |
9cecacc2c68756f05dde0de6b3736c8b9cc7b42e | 7c034629bcf6fb5d41ae6b1f73bd39490f7e9bce | /iterate/test/iterate_test.cc | badc1b00bc02f29098658a98743f0537cb807f2c | [] | no_license | mattlangford/iterate | fb5381fed20c9c7f4af3e0df1520c584e66aeb43 | e031b17666465d7af4ef083c24d120908013ab48 | refs/heads/master | 2023-03-09T03:51:01.788609 | 2021-02-21T21:59:19 | 2021-02-21T21:59:19 | 333,234,270 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,643 | cc | iterate_test.cc | #include "iterate.hh"
#include <gtest/gtest.h>
#include <vector>
namespace {
struct TestType {
size_t i;
~TestType() { i = -1; } // reset if this gets deconstructed
};
struct TestType2 {
size_t j;
~TestType2() { j = -1; } // reset if this gets deconstructed
};
struct CopyMoveCounter {
std::sha... |
328f31fa7c2afa7b6153dd17ced7e6209dd714fa | c8976d2fce071ae62ed24d7ebfd034a41869774d | /11450.cpp | b606a5c65d13af046be05027b23da69ad5e1b281 | [] | no_license | juanpa097/UVa | 26f0d128ecf80283666b22373c5f941d66b62c59 | 4d3b096a5f8c31d768c9dbd0e725b6c93e280c23 | refs/heads/master | 2020-05-22T04:12:05.988913 | 2017-04-06T00:18:40 | 2017-04-06T00:18:40 | 65,876,758 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 828 | cpp | 11450.cpp | #include "bits/stdc++.h"
using namespace std;
int TC,M,C;
int price[25][25];
int memo[210][25];
int score (int money, int g) {
if (money < 0) return (1 << 31);
if (g == C) return M - money;
int ans = -1;
if (memo[money][g] != -1) return memo[money][g];
for (int model = 1; model <= price[g][0]; ++model) {
... |
29dcd67e52fd2a4dfe4d5cde195ae9bce8171593 | 9dece1b5100b23eb159a34a0031a4ec5c24038f3 | /src/popup-01/widget.h | 04b60e63ccab73a85c52b98f56cff25e7db819c3 | [] | no_license | zogvm/qt5-widgets-examples | f84b39568fc4c158152004124aa61a9eddc786b8 | 83379e4547ead261bfc270d13e69b63aa3f10d5e | refs/heads/master | 2023-03-16T17:11:48.819608 | 2018-10-08T08:32:54 | 2018-10-08T08:32:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 464 | h | widget.h | #ifndef WIDGET_H
#define WIDGET_H
#include <QWidget>
#include <QVector>
#include <QIcon>
class QToolButton;
class QTimer;
class Widget : public QWidget
{
Q_OBJECT
public:
Widget(QWidget *parent = 0);
~Widget();
private:
QToolButton* createSidebarButton(const QString& iconPath, const QString& title);... |
ad657aa9affdbea762b6a6c22d625f1c64fc90e7 | 81f04b08896556f13284c003b2f921c008c111f6 | /SRC/controller/create_cmd_factory.cpp | 58288571f2fa779fbbc6a6677a6170d279ea9b2a | [] | no_license | hochlerer/dna-analyzer-design | 890c8f1602a92264cc1205b553dbf9e47a66d462 | 0e3358519ca92bd8a584837ea3200ca643d21ece | refs/heads/master | 2023-01-01T15:41:13.337796 | 2020-09-24T20:25:07 | 2020-09-24T20:25:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,998 | cpp | create_cmd_factory.cpp | //
// Created by y on 7/5/20.
//
#include <stdexcept>
#include "create_cmd_factory.h"
#include "creation_command.h"
#include "parser.h"
#include "enter_cmd.h"
#include "new_cmd.h"
#include "load_cmd.h"
#include "dup_cmd.h"
#include "save_cmd.h"
#include "len_cmd.h"
#include "del_cmd.h"
#include "rename_cmd.h"
#inclu... |
7e2fc59646db996886c2560cb71c230b15f0d24a | e68b1ba7dfe83e077d52cca8cedc86f10e97b5c2 | /css3/lab4/main.cpp | 8e520cc0a61881f7350532fd04cee3aed9020581 | [] | no_license | Giocerna5/Files | 5e3cc70efa610ea1c9f577ce976419f3004d775e | ad3f7078aa4bb48ed8bce1b2396f3f7b8a36cc7d | refs/heads/master | 2020-03-27T13:54:18.388486 | 2018-09-06T22:26:29 | 2018-09-06T22:26:29 | 146,633,725 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,075 | cpp | main.cpp | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string bin(int num);
string exponent(string x);
int main()
{
string b, exp, sig;
int sign, num;
cout << "Enter an integer value: ";
cin >> num;
if(num <= -256 || num >= 256)
cout << "Sorry, " << num << " is too large to be... |
15c7b420a37066b761ec98b56739f180cc62bf3f | 28b7895e9f9c38ac8c5d77d2a5a2b044a3249e52 | /firmware/ESP8266/BasicIODevice/HomeLine.h | 33505c9791f28390f135ecdf2367081aa916f5d9 | [] | no_license | schlenkibus/AW101_WtFoo | 0558620f2e82d0398579085d867a7861987d6d56 | 3dd5599c6796d45d516e1fded925e16d8e329f96 | refs/heads/master | 2020-07-13T06:40:39.139263 | 2019-12-22T14:42:43 | 2019-12-22T14:42:43 | 205,020,200 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,418 | h | HomeLine.h | #pragma once
#include <ESP8266WiFi.h>
#include <WebSocketsClient.h>
#include <ESP8266WiFiMulti.h>
class HomeLine
{
private:
String m_hello;
bool m_connected = false;
public:
template <typename tHelloCB>
HomeLine(const tHelloCB& cb)
: m_hello {}
{
webSocketClient.begin("101.101.101.101", 18700, "... |
dcc2d56fe857522d4c99c0bab65ce8b1c4a6ffde | 2f5b170243b84977f8316f1627842133f6d72c33 | /src/store/thread5_1.cpp | 94b41f79d748e2e4983dbf245a8c9128b3067a9c | [] | no_license | RamazanDemirci/cppConcurrency | e3f1cd1a8f78ee7e040abb923b8afb67062c6c2d | 622abc164a8c049f1cad8c9ed6b1d62bbbcb3e2e | refs/heads/master | 2023-03-01T13:40:43.046021 | 2021-02-02T16:50:24 | 2021-02-02T16:50:24 | 312,345,299 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,480 | cpp | thread5_1.cpp | #include <iostream>
#include <thread>
#include <string>
#include <mutex>
#include <fstream>
using namespace std;
//#1 : Lazy Initialization(Initialization Upon First Use Idiom)
/*#2 : Why use another unique lock?
- file open only once. but print process many times.
and we dont wanna use the same loc... |
c09d76a1aa5008b7c5b6a6a5aa2366b5c6252a61 | 7add91d858beb3c515948b8d48fd5283e6ffc49e | /Parte 1 - Fundamentos de Programación/9. Punteros (apuntadores)/Seccion 9.11.1.cpp | 2dd95311a5a051d6c296d0856e9308b8cb4ffc42 | [] | no_license | kardantel/Ejemplos-Programacion-en-Cpp-Algoritmos-estructuras-de-datos-y-objetos-2-Edicion-LJA | 68bb16569d6a91688628b1a0cb1861c1ae7ddddb | b8f429eb8361b775a89e08b6a951079d7ad3f310 | refs/heads/master | 2022-07-05T10:31:27.923143 | 2020-05-11T18:38:08 | 2020-05-11T18:38:08 | 263,113,527 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,473 | cpp | Seccion 9.11.1.cpp | //
// main.cpp
// Sección 9.11.1 // Página 359 - Libro digital
//
// Programa que tiene una función 'funcsuma' que tiene dos argumentos: n, el número de términos de la suma, y f, la función utilizada. Así pues, la función 'funcsuma' se va a llamar dos veces, y va a calcular la suma de:
// inversos(k) = 1.0 / k (k ... |
4103ebb8577160d6d45d8c08dcfb7549e88217a5 | 0696a91b447ada7f384356acc1895283941f1ab7 | /hdu代码/hdu3743 归并排序.cpp | b21a8aea020e20f1b3e982dffbd9dd19fdd6f099 | [] | no_license | sunhaotian0122/ACM | 2b28226c3b4648be71386910ceeb130af97161eb | f24e9db6c1dffe1fe459f04ec6e03a4bb66424a1 | refs/heads/master | 2021-01-19T23:24:28.785529 | 2017-11-12T11:02:35 | 2017-11-12T11:02:35 | 88,972,559 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,211 | cpp | hdu3743 归并排序.cpp | #include <cstdio>
#include <cmath>
#include <ctype.h>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <typeinfo>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
long long ans,sz[1000005],tmp[1000005];
voi... |
7c545907e21c620f5c549bd4b8a9c5fd87ce6e40 | ae40906e19a9f09ff3f78cbc82e1e874c17aee09 | /Test/GacUISrc/TestCppCodegen/Source/Demo.cpp | 9dfe5f12a77b7ce71a46ec61e24d65d0f908b91f | [] | no_license | zjhken/GacUI | 8ea45ed0a9dd66e4badaf5d1249bf0ab7cd1b257 | 51b01d8382e0912dc7f442b27492d1d9bf95504e | refs/heads/master | 2021-01-19T13:36:09.779179 | 2017-08-19T22:25:22 | 2017-08-19T22:25:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,675,726 | cpp | Demo.cpp | /***********************************************************************
!!!!!! DO NOT MODIFY !!!!!!
Source: Host.sln
This file is generated by Workflow compiler
https://github.com/vczh-libraries
***********************************************************************/
#include "DemoIncludes.h"
#if defined( _MSC_VE... |
353dda82ae2c040d1086da083788187f899438b3 | eb238bda644eba7c8895c9bf2ae94703c02ca0d3 | /hama/pipes/MatrixMultiplication/cpu-MatrixMultiplication/DenseDoubleVector.cc | 731b2d4518182a3921155e7a2499c184b9d94257 | [
"Apache-2.0"
] | permissive | millecker/applications | 6fff7cc0e6a90873e856da36c6299d79497aaa59 | 118843d4e94773c1b39f1e919cbc2092f59216ff | refs/heads/master | 2021-01-17T03:03:48.138641 | 2014-10-21T08:05:48 | 2014-10-21T08:05:48 | 10,477,645 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,450 | cc | DenseDoubleVector.cc | /**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you... |
86fd444728c6efcd148a5fea5a20371e11f276b1 | 28eb1465e79e64a15cc33a95b1c2b04be2bd5397 | /lw1_8/lw1_8/lw1_8.cpp | 9e573971a920a826b30991656ccdc2b164719ff7 | [] | no_license | AkshachRd/comb-math | 2131161627b3c7f1cda3f35019a1cea310f8833a | a5022be766e416a8bcb25c473fb66a8d1b39c533 | refs/heads/master | 2023-03-07T15:02:57.754545 | 2021-02-27T09:27:04 | 2021-02-27T09:27:04 | 330,078,365 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,550 | cpp | lw1_8.cpp | #include <iostream>
#include <optional>
#include <algorithm>
#include <vector>
struct Backpack
{
int n;
int t;
int s;
std::vector<int> w;
std::vector<int> c;
};
Backpack ReadInput()
{
Backpack b;
std::cin >> b.n >> b.t >> b.s;
b.w.resize(b.n);
b.c.resize(b.n);
for (int i = 0; ... |
e3b3ea924ea8d0b323d020c4653b8bfb3e5b34aa | 68160bdfb8f5759b0f89b7a41af720d85fa8ee1b | /Mario Fernandes DX11/geometry.h | 2f68b1b5abf237c81c3365e000689bbfded47656 | [] | no_license | rafaeu9/Mario_Fernandes_DX11 | 77d0dd09c9c3795ce7654f02e7ec6bf29803a1d5 | 35f6e990caf6cf58594da5908cfd7f2e4f872ef6 | refs/heads/main | 2023-02-12T20:28:02.318340 | 2021-01-08T15:55:15 | 2021-01-08T15:55:15 | 304,364,691 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,280 | h | geometry.h | #pragma once
#include<d3d11.h>
#include "text2D.h"
class geometry
{
public:
geometry(ID3D11Device* D3DDevice, ID3D11DeviceContext* ImmediateContext);
~geometry();
HRESULT AddTexture(char* filename);
void Draw(XMMATRIX* view, XMMATRIX* projection);
void SetXPos(float num) { m_x = num; };
void SetYPos(float nu... |
ccf2e3d0dc65d51f56c8fc206755f219a4a37313 | 9a178749f94cf69fe78e673a81cf8eb7db6fcb0e | /Src/Singleton.h | 6c10a74dd8239f6b4dc30b6d946fa38ea32f2e44 | [
"MIT"
] | permissive | jdaudel/singleton | 0f2c6af39491e13eab2369d01c1e4c781f83080e | d4eea6dc34ebd8bff2a63f93b20dc0e655620226 | refs/heads/master | 2020-04-18T10:47:14.232472 | 2019-01-25T03:33:35 | 2019-01-25T03:33:35 | 167,478,471 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,248 | h | Singleton.h |
#ifndef _SINGLETON_H_
#define _SINGLETON_H_
#include <assert.h>
#include <cstdlib>
#define ASSERT_MSG( expr, msg )\
if (expr == false) ERROR_MSG( msg );
#define ASSERT( expr ) \
if (expr == false ) ERROR_MSG( "Error" );
#define ERROR_MSG( msg )\
assert( false );
#define API_SINGLETON(T)\
class SingletonTraits {\... |
87e8d4f485eb3330badb533148a783ffbd4e0826 | 7f322d3a2257c902a6f85b11937f1afaf3817391 | /counting_bits.cpp | 657fb9b4bb411358bb537d721572f396346dd756 | [] | no_license | iit2018062/top_liked_42_questions_in_DS | e3a434f6691b1e4ca842c028dea72c0fbd242229 | 2501f022f171135d0727d2ccb37205cb1960e472 | refs/heads/main | 2022-12-30T17:12:47.784024 | 2020-10-13T07:05:19 | 2020-10-13T07:05:19 | 303,616,457 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 359 | cpp | counting_bits.cpp | class Solution {
public:
int helper(int n)
{
int c=0;
while(n)
{
n&=(n-1);
c++;
}
return c;
}
vector<int> countBits(int num) {
vector<int>tmp;
for(int i=0;i<=num;i++)
{
tmp.push_back(helper(i));
}
... |
487fbbf7809acc3f4f86487b7957814e5d1c07c2 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/squid/gumtree/squid_repos_function_2090_squid-3.4.14.cpp | 57307b0de00f870a30944675b6af9937c427b98b | [] | 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 | 94 | cpp | squid_repos_function_2090_squid-3.4.14.cpp | bool
HttpStateData::doneWithServer() const
{
return !Comm::IsConnOpen(serverConnection);
} |
18bc30b992f057a7faa7bada6fe7365f61776d11 | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_5640146288377856_1/C++/Aj5774/BattleField.cpp | e20983e90c49f9b8088b10cd10327d4c4e260008 | [] | 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 | 1,243 | cpp | BattleField.cpp | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stdlib.h>
#include <string.h>
#include <bits/stdc++.h> //include every c++ library
//fgets(array_name,array_size,stdin);
//FLT_MAX FLT_MIN INT_... |
6c7b6a867f0dbb2821e7c458b1433831b5c9c03b | 11de74dbf0af2121e0b2219a5e52a8af306a8a09 | /usr_operators/Correlator/correlator.h | 6212a01e8f68ef0d2d7b0184983ff5be44fcb032 | [
"BSD-3-Clause"
] | permissive | sandsmark/replicode | d01d46761f082b3e7b55a3b314e77e2b5d7bb20e | da7146d78b0a8d0472f6e9ade8384e73882b04b1 | refs/heads/master | 2021-10-11T18:14:06.089559 | 2021-10-10T12:41:09 | 2021-10-10T12:41:09 | 12,087,734 | 29 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 6,717 | h | correlator.h | #ifndef correlator_h
#define correlator_h
#include "../types.h"
#include "r_exec/overlay.h"
// switch to use WinEpi instead of LSTM for finding correlations
#define USE_WINEPI
extern "C" {
r_exec::Controller REPLICODE_EXPORT *correlator(r_code::View *view);
}
///////////////////////////////////////////////////... |
8d2b7b65030df803cdae319e19266ea4bbe2ffca | e359db0e752a11c5d677e3a82574065831bab447 | /app/example/scrollable_container_example/generated/fonts/src/Font_RobotoCondensed_Regular_20_4bpp.cpp | b48ed6cbfd2c52e37f36bdd05af05b14cc88f55b | [] | no_license | chichtlm/TouchGFX | 694936495ba49b4baba4fb56fd1165f424518c94 | 09cfdf466ae98fa61f54d55548248134a007871f | refs/heads/master | 2020-05-10T00:07:11.813953 | 2016-12-14T06:55:22 | 2016-12-14T06:55:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,340 | cpp | Font_RobotoCondensed_Regular_20_4bpp.cpp | #include <touchgfx/hal/Types.hpp>
FONT_LOCATION_FLASH_PRAGMA
KEEP extern const uint8_t unicodes_RobotoCondensed_Regular_20_4bpp[] FONT_LOCATION_FLASH_ATTRIBUTE = {
// Unicode: [0x0020, space]
// (Has no glyph data)
// Unicode: [0x002C, comma]
0xC0,0x0C,0xFE,0xF0,0x3B,0x5F,0xE6,0x00,
// Unicode: [0x002E, period]
0x00,0... |
4eec3c7f60c3f8cef1a938db258730184d30200e | bf13447efc118007939c6a90f347c75d4d099560 | /src/test/kill_test/kill_testor.h | 31946ecec63d4f3a224588b1e72971a6128b0465 | [
"Apache-2.0"
] | permissive | Carmot/pegasus | f48aac7a934d0fe5c3284a254507e1633ea3f037 | ada3d787c3be551eef7ad9380aaa972e6d74c155 | refs/heads/master | 2021-05-07T19:21:25.872047 | 2017-10-30T14:53:56 | 2017-10-30T14:53:56 | 108,864,567 | 0 | 0 | null | 2017-10-30T14:46:01 | 2017-10-30T14:46:00 | null | UTF-8 | C++ | false | false | 2,078 | h | kill_testor.h | // Copyright (c) 2017, Xiaomi, Inc. All rights reserved.
// This source code is licensed under the Apache License Version 2.0, which
// can be found in the LICENSE file in the root directory of this source tree.
#pragma once
#include "job.h"
#include "killer_handler.h"
#include "killer_handler_shell.h"
#include <fst... |
8f9ba6f906867df52fb311513ae52c67d15c9b9c | cc0356eafe9106aafa9fc366754be69955002eeb | /Source/Chess/Core/Utils.cpp | e263f91960b7624398291e951f2271c7f59bc485 | [] | no_license | Yann4/Chess | caf348fc0dffc8d2990651ea3cb6b23cd2c8fed3 | 5fc0ea570619f3ed1487b5bf087bb5d3adbcd68f | refs/heads/master | 2023-03-15T11:07:37.290139 | 2021-03-08T17:04:12 | 2021-03-08T17:04:12 | 342,361,391 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,090 | cpp | Utils.cpp | #include "Utils.h"
namespace Chess
{
using namespace Constants;
std::string Utils::PieceName(int8 piece)
{
std::string pieceName = IsColour(piece, Piece::Black) ? "Black " : "White ";
if (IsType(piece, Piece::Pawn))
{
pieceName += "Pawn";
}
else if (IsType(piece, Piece::Rook))
{
pieceName += "Roo... |
0682ed094ca6b4c2c3391a951377d5810fb64797 | ec1d7371d30427dda4ae30481defed147a7ba1ec | /KC_Dev/00b6.cpp | d44fd5348478536bd43b53e70398a3ba7811ec4e | [] | no_license | whdgmawkd/algorithm_training | 9aab4a02a75e3cae03b8b9cc3cf6ea0426871ec5 | 81320b32c7fe74adb5316eb66bb409eac830d7c7 | refs/heads/master | 2022-08-06T12:04:07.197419 | 2020-05-31T14:23:48 | 2020-05-31T14:23:48 | 110,798,425 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | 00b6.cpp | #include <stdio.h>
#define __ULL unsigned long long
__ULL rst=1;
__ULL solve(__ULL n) {
if (n == 0)
return 1;
__ULL total=0;
for (__ULL i = 0;i < n;i++) {
total += solve(i)*solve(n - 1 - i);
}
return total;
}
int main(void) {
__ULL n;
scanf_s("%lld", &n);
printf("%lld\n", solve(n));
} |
4e98f421163ce69fe4722b442e4faa68993a126c | bbf7afd56bef961ae7187bb79381059a903f405e | /easy-total-master/gateway/LogGate/TimeTick.cpp | c403c8426c19144cb3dafcbf5eb20d83d5c359d2 | [
"Apache-2.0"
] | permissive | huyufan/work-docment | a23f560550cedeb02dfec1240532f0d76dd0e259 | b94095c57ee702671009f16a2ed70792086b65f2 | refs/heads/master | 2021-01-24T14:47:06.204432 | 2017-05-26T03:57:50 | 2017-05-26T03:57:50 | 68,578,548 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 635 | cpp | TimeTick.cpp | #include <list>
#include "LogGate.h"
#include "NetProcessor.h"
//主线程
void LogGate::v_timetick(QWORD usec)
{
DWORD cur = usec/1000/1000;
_close_iter tmp_close;
NetProcessor *clo = 0;
{
ScopeWriteLock swl(_close_critical);
for (_close_iter it = _close_list.begin(); it != _close_list.end(); )
{
... |
948c65c78de8bb4582637a8fe7f6a620d4f9dec5 | b75842b25932071ab1a098913bb2b09b0f9c7231 | /C++/Array/Find two repeating elements in array/WithoutPreservingPosition.cpp | d76b4d8c783e6370cb11fcc4d0b7577ab2460ad4 | [] | no_license | Ketan-Suthar/DataStructure | 489c9a9cccb93dcce30a795bcdfeb4b8c7eed604 | 278ad5b70feefde5d5eb8cba7b82ed2c333f575a | refs/heads/master | 2022-11-04T20:16:47.164023 | 2022-10-17T06:52:44 | 2022-10-17T06:52:44 | 199,179,496 | 8 | 8 | null | 2022-10-17T06:52:45 | 2019-07-27T15:05:34 | C++ | UTF-8 | C++ | false | false | 792 | cpp | WithoutPreservingPosition.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int arr[n];
int i=0;
for(i=0;i<n+2;i++) cin>>arr[i];
int xy=0;
for(i=0;i<n+2;i++)
xy ^= arr[i];
for(i=1;i<=n;i++)
... |
d74ff14ca1da1a13a0aa3f8c497eca1220ac010a | 26f9fdff3c246e3a68ff9b0bb4f8f0a9a67bce1c | /dynamic_OWSC (copy)/2.2/nut | 7891c5778afae44fb0f84d726698d42dba8e5fa6 | [] | no_license | JBrakefield/My_olaFlow | 6c0aaa0dda8d8e69c127281fc9484f3cded258ea | a812362928f2466f4e2632d2636dce97a0a3b9f6 | refs/heads/master | 2020-04-08T14:00:49.750205 | 2019-01-10T19:48:55 | 2019-01-10T19:48:55 | 159,418,163 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 171,765 | nut | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 5.x |
... | |
bbab21067f748d358d592b9aa6055ed016c39b21 | 485539af8461d2ce2119bafca181b002703b6653 | /ThiagoOBI/2008/lanche.cpp | 6579fc8570b7fb9bb0afc9c730f5da48525782f0 | [] | no_license | joaogui1/Competitive-Programming | f6cea58c7460011b366b04497e69cef97f86cdd1 | 8e7a0eb0f4a48ec3fd5b01b0510bc1ec7a4c46bf | refs/heads/master | 2021-06-16T21:43:57.442360 | 2021-02-06T11:26:01 | 2021-02-06T11:26:01 | 137,510,703 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 723 | cpp | lanche.cpp | #include <bits/stdc++.h>
using namespace std;
int g[256][256];
void fw(int n){
int test, best = (1 << 28);
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
for(int i = 1; i <= n; ++i){
test = -1;
for(int j =... |
b62d3be462dc0250fc2ea7a6fa2b5c9c5f4bfdcb | 279ed0a9ae40fbcee08e076896554d6853326c2d | /第十次作业（结构&位操作&预定义）/作业16.17第二题.cpp | ccaf0ccf033ee6fa6147906087dbcf6847dc87fd | [] | no_license | sry2012/PersonalCppHomeWorks | 53b04657bcfd649d33d9ebbfbb4fe1e16439eaee | f1129c31c5a2039143cb9841c38ad3a2a12c659f | refs/heads/master | 2021-01-01T18:08:02.242804 | 2013-07-19T14:30:17 | 2013-07-19T14:30:17 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 430 | cpp | 作业16.17第二题.cpp | #include <stdio.h>
#define HMEAN(X,Y) (2.0 * (X) *(Y) / ((X) + (Y)))
int main(void)
{
double x, y, ans;
printf ("请输入两个实数：");
while (scanf("%lf %lf", &x, &y) == 2)
{
ans = HMEAN(x,y);
printf("%g = harmonic mean of %g %g.\n", ans, x, y);
ans = HMEAN(x - y, x +y);
printf("%g... |
3b009d64c621ab9dc300d657efe46bd474bedbcf | d9ba9d41a1225797872d596558bdffda25944f7f | /semaforo/semaforo.ino | 8dfcaddeeb5bb1d61bcca5e47a7bdd09f89c4a1e | [] | no_license | VictorMartinDzib/Arduino-Examples | 6dab0cb7a6e85fb9c5f35e8a9e9342aed6783d4d | 2e257336924ab46ae5fdbbaf337e5f1081f52a99 | refs/heads/master | 2020-12-27T06:31:57.353734 | 2020-04-06T18:42:44 | 2020-04-06T18:42:44 | 237,796,007 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 920 | ino | semaforo.ino |
int ledverde = 13;
int ledamarillo = 12;
int ledrojo = 11;
int delayVal = 0;
int array[] = {13, 12, 11};
void setup()
{
pinMode(ledverde, OUTPUT);
pinMode(ledamarillo, OUTPUT);
pinMode(ledrojo, OUTPUT);
}
void loop()
{
digitalWrite(ledverde, HIGH);
delay(2000);// Wait for 1000 millisecond(s)
digit... |
b698cdce1f16cb0a2d41dbe598970a9d940200a3 | 78fb0f50a8aff82c5a3e4d2475baf9723923a2e1 | /problem-00022/solution.cpp | c56ffa96866d05803c0ddaf570cb4ca8f3befd3b | [] | no_license | RathiRohit/daily-coding-problem | 300619b472fd3ee5e019f1b626861a1cbaf1a9ad | 06b43fce175eaa5cc50d93b1f47d70a11844eecf | refs/heads/master | 2021-08-10T18:14:15.043597 | 2021-07-21T14:23:03 | 2021-07-21T14:23:03 | 244,369,454 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 800 | cpp | solution.cpp | #include <iostream>
#include<map>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int n;
cout<<"Enter number of integers in array:"<<endl;
cin>>n;
map<int, pair<int, int> > numMap;
int result = 0;
for(int n_i=0; n_i<n; n_i++) {
int tmp;
cin>>tmp;
if(numMap.count(tm... |
83c42f873b6d3f2b5d2387b5ca699c4839aeda36 | 4dec9c5e4e1c7a04cdd49aac1e5ab18b71f4ad6d | /4_1 Two dimentional arrays_main.cpp | d05f4cf7ed07eef11761c734c3bbc5842ed59925 | [] | no_license | hajkahajka/Lessons | 9bbeeac88336b84e1ebed805a7030b10da033c4a | a80e0e53dc13453fd1dd918c7ea272eb3158c14e | refs/heads/master | 2021-07-25T07:46:41.956571 | 2017-11-05T13:55:47 | 2017-11-05T13:55:47 | 103,494,578 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,288 | cpp | 4_1 Two dimentional arrays_main.cpp | #include <iostream>
int main() {
/**
* Two dimensional array is the array of pointers.
* And each pointer in the array is the another array
* so with this you have matrix this looks like this
* * * * * * -- 5 pointers
*
* * * * * *
* * * * * *
* * * * * *
* * * * ... |
77fdb0e494f54be529b87cbfb90ea6528f399715 | 44bf02f4d2e32b24977e530f384d73576fe6c808 | /Class_Matrix/Source.cpp | 03004f85bc4ae4f028912ba2aec584c6256c424f | [] | no_license | nasemenoff/part4 | fbf2acc0b9a7b45bcf396396afc54ebbfebddb03 | e34020d2c5cb28489d683b289946df26b2e9e611 | refs/heads/master | 2021-01-09T06:36:27.536694 | 2017-02-14T12:28:24 | 2017-02-14T12:28:24 | 81,022,364 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 854 | cpp | Source.cpp | #include <iostream>
#include "Matrix.h"
using namespace std;
int main() {
setlocale(LC_ALL, "russian");
Matrix matrix(3, 3);
cout << "Матрица 1\n" << matrix;
Matrix matrixCopy(matrix);
cout << "\nКопия матрицы\n" << matrixCopy;
Matrix matrix2(5, 4);
cout << "\nМатрица 2\n" << matrix2;
cout << "\nСумма матриц\... |
b384d8d05664561eec0e716a2722e9c4c88e3138 | bf346dbc137069e28e9d39d0a12877606e5c4ec2 | /实验三/Class3_3.cpp | 4adb8a38d2e021aec8a60796fdd3c5705e8cc840 | [] | no_license | MNNing/data_structureTest | 49511fc479071437fdb7dbaae35eb7b958c4104b | 05e798ee601ace1d052f4df56f083dd27b79f6ff | refs/heads/master | 2022-11-27T13:24:30.820032 | 2020-07-24T13:14:31 | 2020-07-24T13:14:31 | 282,221,811 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,918 | cpp | Class3_3.cpp | //哈夫曼编码
#include<iostream>
#include<string.h>
using namespace std;
typedef char **HuffmanCode; //动态分配数组存储哈夫曼编码表
//哈夫曼树结点结构体
typedef struct
{ int weight; //结点的权值
char data;
bool Input;
int parent,lchild,rchild; //结点的双亲、左孩子、右孩子的下标
}HTNode,*HuffmTree; //动态分配数组存储哈夫曼树
//哈夫曼树类声明
clas... |
c261e416d49c8158f43c5f72979d79860faf2ec1 | 6f2b6e9d77fc4dd5e1dae8ba6e5a66eb7c7ae849 | /sstd_boost/sstd/boost/hof/detail/using.hpp | ad01383708e639cb82c7af4c8293f11c19bb54a5 | [
"BSL-1.0"
] | permissive | KqSMea8/sstd_library | 9e4e622e1b01bed5de7322c2682539400d13dd58 | 0fcb815f50d538517e70a788914da7fbbe786ce1 | refs/heads/master | 2020-05-03T21:07:01.650034 | 2019-04-01T00:10:47 | 2019-04-01T00:10:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 836 | hpp | using.hpp | /*=============================================================================
Copyright (c) 2016 Paul Fultz II
using.hpp
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)
=================================... |
316f5508b59060915cc1094cdb399589b62b68d6 | 688e1615b6ea772f47d0222c7c16634b3eaabc89 | /Models_INIT.cpp | 2c904123f9c0baf9889fd395de50104496f9ad31 | [] | no_license | marcclintdion/o1 | 42738ae92a23db4ec5f00bf620d1564ae74528fa | 14020c976dc0d25e04ea37de72e492ed1f2e3862 | refs/heads/master | 2020-04-06T07:08:30.152652 | 2016-08-04T02:18:46 | 2016-08-04T02:18:46 | 63,638,352 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 56 | cpp | Models_INIT.cpp |
#include "_MODEL_FOLDERS_/o1/o1_INIT.cpp"
|
5eb602582e4f2bb3efa73d0a3af4f0d2c299a894 | d0d92552bb9471262cb53eaea4891230a2961f6b | /ATX/module_scenario_main.h | 34daa12f037517f5a51d9693f72fe2133d8d55de | [
"MIT"
] | permissive | mxsshao/nsb-sdd-atx | 26cb63d7577906a87d7dd3453cd3bf1d913d80d6 | de167ca37df2271cf2a76f1a1e111ab8fb98b374 | refs/heads/master | 2020-04-14T07:12:56.751081 | 2019-01-08T09:13:46 | 2019-01-08T09:13:46 | 163,706,794 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,161 | h | module_scenario_main.h | #pragma once
#include "global.h"
#include "manager.h"
namespace Module
{
namespace Scenario
{
class Main : public Module::Base
{
private:
Gwen::Controls::Base* gParent;
Gwen::Controls::Base* gPadding;
Gwen::Controls::ScrollControl* scrHorizontal;
void ScrHorizontalMove();
Gwen::Controls::WindowControl* ... |
9c0875a3d7e75503f55d7955adf14440ae73574f | ceb18dbff900d48d7df6b744d1cd167c7c9eb5c5 | /mine/cplusplusCS/2014/BMDemo/BM/MtNoteEdit.cpp | 24d804ca2bbd42381ee3e753b06be11652828ead | [] | no_license | 15831944/sourcecode | 6bb5f74aac5cf1f496eced1b31a0fd4cf3271740 | 412f0ba73dd7fb179a92d2d0635ddbf025bfe6d4 | refs/heads/master | 2021-12-27T20:07:32.598613 | 2018-01-15T14:38:35 | 2018-01-15T14:38:35 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,620 | cpp | MtNoteEdit.cpp | // MtNoteEdit.cpp : 实现文件
//
#include "stdafx.h"
#include "BM.h"
#include "MtNoteEdit.h"
#include "afxdialogex.h"
// CMtNoteEdit 对话框
IMPLEMENT_DYNAMIC(CMtNoteEdit, CDialogEx)
CMtNoteEdit::CMtNoteEdit(CWnd* pParent /*=NULL*/)
: CDialogEx(CMtNoteEdit::IDD, pParent)
, m_nodeOrgName(_T(""))
, m_nodeN... |
20c49cae81c4910550164db23e0e594675f96c8b | 559673ceafd5d629f1478859df1c373980ee2a8d | /libpm/VmInfoIpAddress.h | 72058023d934103f10798f808aaffc63a4d888ef | [] | no_license | Ricky1995/src | 97ef265649f5ca523c037b88177a949b8f3fffd0 | 758e11c13b0a03a0ee0ce4a73d2209bf3e3db943 | refs/heads/develop | 2021-01-02T22:35:41.577483 | 2018-09-21T11:34:16 | 2018-09-21T11:34:16 | 99,349,732 | 0 | 0 | null | 2017-08-04T14:15:37 | 2017-08-04T14:15:37 | null | UTF-8 | C++ | false | false | 4,018 | h | VmInfoIpAddress.h | /*==============================================================================
Copyright (c) 2013-2017 by the Developers of PrivacyMachine.eu
contact@privacymachine.eu
OpenPGP-Fingerprint: 0C93 F15A 0ECA D404 413B 5B34 C6DE E513 0119 B175
Licensed under the... |
efc25cb862403b1333b1562b4deef8aefaa396a3 | 04b1803adb6653ecb7cb827c4f4aa616afacf629 | /components/data_reduction_proxy/content/renderer/content_previews_render_frame_observer.h | 43e781b6d6cd7b3778876966d64d403dad3ee4f2 | [
"BSD-3-Clause"
] | permissive | Samsung/Castanets | 240d9338e097b75b3f669604315b06f7cf129d64 | 4896f732fc747dfdcfcbac3d442f2d2d42df264a | refs/heads/castanets_76_dev | 2023-08-31T09:01:04.744346 | 2021-07-30T04:56:25 | 2021-08-11T05:45:21 | 125,484,161 | 58 | 49 | BSD-3-Clause | 2022-10-16T19:31:26 | 2018-03-16T08:07:37 | null | UTF-8 | C++ | false | false | 1,758 | h | content_previews_render_frame_observer.h | // Copyright 2017 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.
#ifndef COMPONENTS_DATA_REDUCTION_PROXY_CONTENT_RENDERER_CONTENT_PREVIEWS_RENDER_FRAME_OBSERVER_H_
#define COMPONENTS_DATA_REDUCTION_PROXY_CONTENT_RENDERE... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.