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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
37ba1318a5ba85abe7dea99b241a46626ff58b6c | b59f0e50a7295abd6343555533e20d68ef456af9 | /konstrat ayarı kendi fonksiyonum.cpp | cb2057878c6a8513e4fbae65fb30cea2eb14a405 | [] | no_license | ismailozdere/OpenCV-goruntu-isleme-C-- | c22e4cf3a4a38e0e605f635389f8589152b2b808 | 6163214ac580ec0e1be8d616a91d74694eed199f | refs/heads/main | 2023-04-20T04:36:00.431186 | 2021-04-26T09:04:02 | 2021-04-26T09:04:02 | 361,681,673 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,014 | cpp | konstrat ayarı kendi fonksiyonum.cpp | //#include <opencv2/core/core.hpp>
//#include <opencv2/highgui/highgui.hpp>
//#include "opencv2/imgproc/imgproc.hpp"
//#include <iostream>
//
//using namespace std;
//using namespace cv;
//
////int blue, green, red;
////int y = 100;
////int x = 120;
////double constVal = 0.3;
////int derinlik = 1;
////
//... |
2e49c3a7040f986a7f5b50870f7d88ae2b49e881 | 3f924c3ff73819e506bef8720ba638f5cd6aba6e | /en_bandit.cpp | 817f10aa3831b2bc76fb7e8f54c5f4c35b4e59c1 | [] | no_license | clockword/OpenglFramework | 94885b2bbd667652d20baee3729ff6bc0c85e42d | 2b618ac55faca40fb8a33d0c6b95c7188d14efb1 | refs/heads/main | 2023-02-01T01:09:35.045608 | 2020-12-17T10:39:43 | 2020-12-17T10:39:43 | 316,512,402 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,002 | cpp | en_bandit.cpp | #include "en_bandit.h"
EnBandit::EnBandit() : Enemy()
{
}
EnBandit::EnBandit(glm::vec2 pos, glm::vec2 size, glm::vec3 color, glm::vec2 velocity) :
Enemy(pos, size, color, velocity)
{
}
void EnBandit::Update(SpriteRenderer& renderer, float deltatime)
{
if (!Active || IsDestroyed)
return;
if (currentHp <= 0.0f) ... |
b14529d0093cc55b2daea2b4d854b91bb9145de3 | 8e3bed8a6cdd5f979840b205f9cedbe297769f13 | /Source/GameServer/include/KanturuEntranceNPC.h | 95808292849e8eb6f017730a802e6fd5a042c81e | [
"MIT"
] | permissive | vuonglequoc/ServerSimulator | 93cd48edf1cd5bec77e9c823b930bf35f26c7111 | 12bd6f24fcf957c657864a81da3dfb0467b48c2b | refs/heads/master | 2023-02-03T05:55:40.232793 | 2020-12-19T22:27:34 | 2020-12-19T22:27:34 | 35,360,781 | 2 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 789 | h | KanturuEntranceNPC.h | //**********************************************************************//
// Project: HaRiBO MU GameServer - Season 4 //
// Company: RealCoderZ MU Development © 2010 //
// Description: MU Kanturu Enterance NPC Structure & Functions //
// Decompilation By: Deathway //
// Coded & Modified By: Wo... |
0dbd9436aeaa2cf73ba02522b170478912bc94de | f17392de7d4dbf0dba252bf3b0336619dcc02019 | /src/ObjectMap.cpp | 9ff63052a8c119eb30d05d8efb6093c7da7755c1 | [] | no_license | m2omou/bomberman | 3d1f269968a31ed6f941e90826007f6baf438be5 | f183453764891e81b2ee2f5b0d5cf9d80aab0912 | refs/heads/master | 2020-05-16T23:49:17.564197 | 2014-07-21T07:01:29 | 2014-07-21T07:01:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,519 | cpp | ObjectMap.cpp | #include "ObjectMap.hpp"
#include "AObject.hpp"
#include <typeinfo>
#include "SerializableFactory.hpp"
ObjectMap::ObjectMap(int width, int height)
: Map(width, height)
{
}
void ObjectMap::initialize(void)
{
ObjectMap::iterator it;
for (it = this->begin(); it != this->end(); ++it)
{
if ((*it).content... |
9c9bfbe70d0f53c80e385a0f220b83b528e45369 | 070740e4005b1d04ecc399e2c598bd943bf5922a | /DesignPatterns/ChainOfRespon/Application.h | d3c22eb4b01181f5d96606ce75a5ee562227f261 | [] | no_license | yylwuwei/HelloWorld | df30718be3bdd1f40237a3aaad368dcc15895bdc | dc4fc5884b6f6b9de23dc719334b0e96fad5e5e5 | refs/heads/master | 2021-01-17T14:31:24.105647 | 2015-06-13T14:14:22 | 2015-06-13T14:14:22 | 7,886,919 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 224 | h | Application.h | #pragma once
#include "helphandler.h"
class Application : public HelpHandler
{
public:
//the last object to deal with help request
Application(Topic topic):HelpHandler(NULL, topic)
{
}
virtual void HandleHelp();
};
|
0f20cdfadd35d5f09e2c0af7a56079b65921e9ca | ba44ca818aca6cbe5b024d7cd2b3bb23a55d9744 | /cpp_solutions/chapter_10_sorting_and_searching/problem_10_02_anagramSort.h | cbab0188c9926e581db49234a5d0f168463d0c37 | [
"BSD-3-Clause"
] | permissive | isayapin/cracking-the-coding-interview | 609ed07b6986f6637dea63f5895620353feec4fa | dce288e3aa4107ff84b95ae0f8bf1b4a92422587 | refs/heads/master | 2023-01-08T10:23:16.918337 | 2020-11-08T15:33:14 | 2020-11-08T15:33:14 | 259,108,359 | 0 | 0 | NOASSERTION | 2020-11-08T15:33:15 | 2020-04-26T18:50:59 | null | UTF-8 | C++ | false | false | 1,675 | h | problem_10_02_anagramSort.h | /*
* PROBLEM:
* Given an array of strings, sort the array such that all anagrams are next to each other.
* Anagrams are strings that contain the same characters e.g. "abc" and "bca".
*
* TEST CASE:
* Input: {ddd, abc, ccc, bac, aaa, cab, bbb, acb}
* Output: {aaa, abc, acb, bac, cab, bbb, ccc, ddd}
* Note that t... |
3298c513fbc9ddc096c8f1f2af0fe9d33b95a596 | 58ef4939342d5253f6fcb372c56513055d589eb8 | /ScheduleMessage/Client/source/MsgEditor/inc/MsgExpandableControl.h | 84571e91faacb8768c2edce2c304c6295dc046f3 | [] | no_license | flaithbheartaigh/lemonplayer | 2d77869e4cf787acb0aef51341dc784b3cf626ba | ea22bc8679d4431460f714cd3476a32927c7080e | refs/heads/master | 2021-01-10T11:29:49.953139 | 2011-04-25T03:15:18 | 2011-04-25T03:15:18 | 50,263,327 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,383 | h | MsgExpandableControl.h | /*
* Copyright (c) 2002-2006 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-... |
a1bf27bdb57ffb04799503bb20fdaef4d35158da | cc03da06df7a960f8736b03e5a946c29daf002ca | /qDataGeneratorTracking.cpp | 4b263f1d4469a53c66a732437fbdb23b122324df | [] | no_license | HLMizuno/OpenIGTLinkSimulator | 37bc2c81bde1731bc0085b4ff1c87c7a8d0fa328 | 6ba9d6c82844ba53c3c5fc65841b34e18a3b7531 | refs/heads/master | 2021-01-17T17:13:27.024349 | 2014-09-05T20:10:43 | 2014-09-05T20:10:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,408 | cpp | qDataGeneratorTracking.cpp | /*=========================================================================
Program: Data Generator Tracking Class for OpenIGTLink Simulator
Language: C++
Copyright (c) Brigham and Women's Hospital. All rights reserved.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied wa... |
5ba116d3366c80164c85387eb5b158868b0d02d3 | 0356ed0691256155cc710de0b6ef4997ab1408e0 | /source/yats/include/yats/slot.h | c60295058c2a47e22ede75e04304eadf8ee2188e | [
"MIT"
] | permissive | hpicgs/yats | 205746ae53fbbd643ff5d15a7889450afd712833 | 60b024613b94ab53b7623d6cd670bca377a46be5 | refs/heads/master | 2021-05-07T02:12:40.820032 | 2018-04-06T17:25:12 | 2018-04-06T17:25:12 | 110,519,860 | 4 | 1 | MIT | 2018-04-06T17:25:13 | 2017-11-13T08:19:53 | C++ | UTF-8 | C++ | false | false | 2,036 | h | slot.h | #pragma once
#include <cstdint>
#include <tuple>
#include <type_traits>
#include <utility>
namespace yats
{
template <typename... Args>
class output_bundle
{
public:
template <typename... Params>
output_bundle(Params&&... params)
: m_return_values(std::forward<Params>(params)...)
{
}
std... |
39af92514494d538aea02f1fe64cb72f0b95631c | 32dd914187a35418f883db741520a305a8b90226 | /Ellipses.cpp | 26836c5c5d753ac8fab3137c1147ff6f5a582a57 | [] | no_license | Frostjaw/sp_lab4 | b28c913e39cad206a7513cc3efb527f1d9053602 | 4a575d1003b02835c48301c065a98d8ac0e9e830 | refs/heads/main | 2022-12-24T15:41:36.499133 | 2020-10-10T05:56:17 | 2020-10-10T05:56:17 | 302,826,285 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 581 | cpp | Ellipses.cpp | #include <windows.h>
#include "resource.h"
#include "MainWindow.h"
int WINAPI wWinMain(HINSTANCE hInstance, HINSTANCE, PWSTR, int nCmdShow)
{
MainWindow win;
HACCEL hAccel = LoadAccelerators(hInstance, MAKEINTRESOURCE(IDR_ACCEL1));
win.Register();
if (!win.Create(L"Ellipses", WS_OVERLAPPEDWINDOW))
{
return 0... |
405fe2847fcb56c3eefef242dadaecb775c0c6b0 | a14ac66b8ad248a284a63b8e28c49e8540f950c6 | /src/texture.cpp | 9933af946132e12f96fd8e5977d790aaaed998e7 | [] | no_license | Mazrog/endora | 6a0aaecc9ee0b3f7014c353c49efdf8c31a07c27 | a8b81dcf798fb198bfbd9c62f26289b75ccafc0b | refs/heads/master | 2021-04-15T18:04:59.083431 | 2019-10-26T16:16:44 | 2019-10-26T16:16:44 | 126,400,117 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,793 | cpp | texture.cpp | //
// Created by mazrog on 17/04/18.
//
#include <endora/texture.hpp>
#include <endora/utils.hpp>
Texture::Texture(GLenum type) : _type(type) {}
Texture::~Texture() {
for(auto const& id : _ids) {
if (id) {
glDeleteTextures(1, &id);
endora_error("Texture deletion");
}
}... |
c6aaf9c882b4a088f3c732b723f0971658e5677f | 7346a08f114af67997d7e162845cad6a6fbf5da1 | /Data Structure(C++)/Vector&Pointer/main.cpp | 06e3584d35dbd192ce0c3052eb8eed0741266d7e | [] | no_license | ruiwenhe-10/Data-structure-Implementation-and-Practice-CPP | 9fa62e5b63b4968f719382ba8ecc0be0a6f6103c | 8797cf4146046c11b36e4d6b37d376f66b277dfd | refs/heads/master | 2022-12-26T14:34:20.584111 | 2020-09-21T05:06:42 | 2020-09-21T05:06:42 | 296,963,845 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 492 | cpp | main.cpp | #include <iostream>
using namespace std;
#include "IntVector.h"
int main() {
IntVector a(0);
cout << a.size() << endl;
cout << a.capacity() << endl;
if (a.empty()) {
cout << "true" << endl;
}
else {
cout << "false" << endl;
}
a.insert(0, 1);
for (unsign... |
1d5b1ebc7168e113cfc9f4bafbd984592c238e2c | 28872b04166f1e2b2021889b8ad9c6a877b128f5 | /hollywood name list.cpp | 011caf0c0b4337476dca610aee3a1292f081f915 | [] | no_license | Arpan-shrma/Game-of-Hangman | c88fb23e402507727e7eb2d7811a382540847fee | 879691e2c0aa37d0697aa716de959b3191e74b49 | refs/heads/master | 2022-04-11T09:05:01.914329 | 2020-04-10T10:38:14 | 2020-04-10T10:38:14 | 254,608,583 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 287 | cpp | hollywood name list.cpp | #include<iostream>
#include<conio.h>
#include<fstream>
#include<string.h>
using namespace std;
int main()
{char name[100];
ofstream file("ollywood.txt");
if(file.fail())
{cout<<"error";
}cout<<"enter movie list name";
cin>>name;
for(int i=0;i<1;i++)
{
cout<<name;
}
}
|
28ba154f5a726dd099c5ba37484bde949f10a1ff | 20bc832fd0d882923d0a00f6c82c21ff54060cb5 | /avios.cpp | 09b7c933a623926471eefbda63e00cd2e8f6eb9a | [] | no_license | madhuavinash11/OS-PROJECT | a38882f9cf1df26b5d3c01a5f2f5bccbf787dc4c | 2abc87efaac524b93bf220b04f9bc7fdf6aebf56 | refs/heads/master | 2020-03-10T14:29:05.032913 | 2018-04-13T16:25:26 | 2018-04-13T16:25:26 | 129,424,118 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,403 | cpp | avios.cpp | #include<iostream>
#include<conio.h>
using namespace std;
main()
{
int id[3]={2132,2102,2453},time=0;
int p[3]={2,4,8},pa=0;
cout<<"\n student s1 id is:"<<id[0]<<" process time is :"<<p[0]<<"\n";
cout<<"\n student s2 id is:"<<id[1]<<" process time is :"<<p[1]<<"\n";
cout<<"\n student s3 id is:"<<id[2]<<" proces... |
77ec617ba3db335c789a367a1037d8a06907ff80 | 19a5be6bd612e59e75d835a809cb5e55ab5d9066 | /Practica2parte2.cpp | 96a7fe85ab869f4b971a63f6ed1a3a34be4cc491 | [] | no_license | SaulRamirezz/Practica2parte2 | 74f3d265367dff68d45aa59385f9433793728561 | 6ce4d84bd1b68e1f3b74db44fb82ebdfccd34f78 | refs/heads/master | 2022-10-13T10:21:59.239646 | 2020-06-01T00:41:27 | 2020-06-01T00:41:27 | 268,390,397 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | cpp | Practica2parte2.cpp | #include <iostream>
using namespace std;
//Voy a mejorar este programa pero mientras subo este :v
int main()
{
int servicios, otra = 0, saldo = 200, InOut = 0;
cout << "Hola, bienvenido a la termial TeleNook." << endl;
cout << "1.- Consultar saldo 2.- Retirar creditos 3.- Ingresar creditos" << endl;
cout << "Cua... |
c59d67ab1b524d49d705afce6f181037d70bee3b | a5f3b0001cdb692aeffc444a16f79a0c4422b9d0 | /main/autodoc/inc/autodoc/x_parsing.hxx | 8aa9940fe71b9adfed9e40f1e2d3a000fa5e4127 | [
"Apache-2.0",
"CPL-1.0",
"bzip2-1.0.6",
"LicenseRef-scancode-other-permissive",
"Zlib",
"LZMA-exception",
"LGPL-2.0-or-later",
"LicenseRef-scancode-free-unknown",
"LicenseRef-scancode-philippe-de-muyter",
"OFL-1.1",
"LGPL-2.1-only",
"MPL-1.1",
"X11",
"LGPL-2.1-or-later",
"GPL-2.0-only",
... | permissive | apache/openoffice | b9518e36d784898c6c2ea3ebd44458a5e47825bb | 681286523c50f34f13f05f7b87ce0c70e28295de | refs/heads/trunk | 2023-08-30T15:25:48.357535 | 2023-08-28T19:50:26 | 2023-08-28T19:50:26 | 14,357,669 | 907 | 379 | Apache-2.0 | 2023-08-16T20:49:37 | 2013-11-13T08:00:13 | C++ | UTF-8 | C++ | false | false | 1,681 | hxx | x_parsing.hxx | /**************************************************************
*
* 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 y... |
94b875e966a345444aefb0be0dbe11f1a6ec5393 | 08bfc8a1f8e44adc624d1f1c6250a3d9635f99de | /SDKs/ilmbase/ImathTest/testInvert.cpp | 4a6a756fac965fcecb039ec3d558f73f82e7b8c1 | [] | no_license | Personwithhat/CE_SDKs | cd998a2181fcbc9e3de8c58c7cc7b2156ca21d02 | 7afbd2f7767c9c5e95912a1af42b37c24d57f0d4 | refs/heads/master | 2020-04-09T22:14:56.917176 | 2019-07-04T00:19:11 | 2019-07-04T00:19:11 | 160,623,495 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 129 | cpp | testInvert.cpp | version https://git-lfs.github.com/spec/v1
oid sha256:f01cfb59bf9653f873d897fa437e2efea1e4809a957a3bfa84e3d2e5537147d3
size 4548
|
5708dd76c93a871af896a7ce7686500c56706c22 | 6e6ebd0a854d9094d15dcc90e2d6d07eec05355d | /DuiLib/Control/UIWebBrowserCEF.cpp | a8929325adf024c7cbf0902f06c4d7d6b0f87196 | [
"BSD-2-Clause",
"MIT"
] | permissive | wxxweb/duilib-old | d65eda04b2f34122acaea881edf4e2944ef54f19 | 7f19dac5a04bb176146c9fa95d6b92c0a36e6b61 | refs/heads/master | 2021-05-04T02:27:22.054211 | 2016-11-30T03:26:38 | 2016-11-30T03:26:38 | 21,518,517 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 8,841 | cpp | UIWebBrowserCEF.cpp | #include "StdAfx.h"
#ifdef UILIB_WEBBROSER_CEF
#include "UIWebBrowserCEF.h"
#include "../Utils/cef_web_browser.h"
#include "../Utils/cef_web_browser_event_handler_i.h"
#include <Shlwapi.h>
#include <set>
#pragma comment(lib, "w2x_cef.lib")
namespace DuiLib
{
class CInternEventHandler: public ICefWeb... |
e97a5d2408acccdc6f6530b66f610749d2e8c2e3 | 8f8899e5dfdb5a54bcb4c538949b4d58dbed4d12 | /Codechef/CPP/Div2_September_2020/VBR_September.cpp | 087f365587a4c8dd52975377e7f021cb60fe5bea | [
"MIT"
] | permissive | kirito-udit/codeWith-hacktoberfest | 0fb7780299ea099563cbac2aabfeb33bd9135349 | 175ed242e38ca25887350052335f13b0b0c0e303 | refs/heads/main | 2022-12-27T10:28:49.304226 | 2020-10-09T05:35:22 | 2020-10-09T05:35:22 | 302,606,983 | 1 | 0 | MIT | 2020-10-09T10:22:01 | 2020-10-09T10:22:00 | null | UTF-8 | C++ | false | false | 2,809 | cpp | VBR_September.cpp | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007LL
#define For(i,n) for(int i=0;i<n;i++)
#define ff first
#define ss second
#define mem(a,b) memset(a,b,sizeof(a))
#define int long long
#define ld long double
#define endl "\n"
int power_mod(int num,int g)
{
... |
73a5905a08942ec2213c40e5d7dc53a4b9abe3e0 | 27bf674fc2272994d941ecbe4b175d2b788d1896 | /cbzcomic.cpp | 735e7aed351a9ad64339fc67af68b08618a37760 | [] | no_license | IgnacioMV/CBR | fed91c43434d2ed0407b8fd9cf693887098e96ad | a79ccda6e49c20b86f709c14f36df76dbb366ea5 | refs/heads/master | 2021-04-30T10:56:57.365204 | 2018-03-24T21:12:26 | 2018-03-24T21:12:26 | 121,343,308 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,337 | cpp | cbzcomic.cpp | #include "cbzcomic.h"
#include "comic.h"
#include "image.h"
#include "bmp.h"
#include "jpeg.h"
#include "png.h"
#include "cbzextractworker.h"
#include <QMainWindow>
#include <QDebug>
#include <QThread>
int CBZComic::extract(const QMainWindow *mainWindow)
{
qInfo() << "thumbnailThread->isRunning()";
QThread* th... |
bbf21e70cadb4d18ec739004ff14f99964a28be6 | d1283e273682c0565dfa6d9a2de759f78adf818d | /KMC/Thallium/Parameters.h | 6fae95ccf4e75dbf635fcadc8be05bd81d9c1103 | [] | no_license | adamsikora/School | eb5cb8cf7466dd865c5de79bc1a20bc6c3cb4b27 | e80ed577f66fc809062e2384664b71d16a84f9bc | refs/heads/master | 2016-09-10T01:21:20.963395 | 2015-10-08T10:23:44 | 2015-10-08T10:23:44 | 25,681,539 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,063 | h | Parameters.h | #pragma once
#include "StlBase.h"
class ParametersInternal // class for storing simulation parameters
{
public:
ParametersInternal() :
nu(0), T(0), E_M_M(0.0), E_M_Si(0.0), E_M_Tl(0.0), E_bM(0.0), E_b100(0.0), E_b111(0.0),
layersPerSec(0), targetCoverage(0.0), seed(0) {}
ParametersInternal
(
double nu, ... |
cf95bd4efe72d9740ef5fd1020e024fbd671321f | eea7c201962b016c9e17078dd531d682d491bff2 | /Nana.Cpp11/source/gui/element.cpp | 433913f59ed39012f7aff8c49bfaecd25072321f | [
"BSL-1.0"
] | permissive | gfannes/nana | be828b370e2924a18ed16cd1e454a91c45547f99 | 3b8d33f9a98579684ea0440b6952deabe61bd978 | refs/heads/master | 2018-12-28T10:30:58.166529 | 2013-12-09T23:50:40 | 2013-12-09T23:50:40 | 15,054,894 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,514 | cpp | element.cpp | #include <nana/gui/element.hpp>
#include <nana/gui/detail/bedrock.hpp>
#include <map>
#include <string>
#if defined(STD_THREAD_NOT_SUPPORTED)
#include <nana/std_mutex.hpp>
#else
#include <mutex>
#endif
namespace nana{ namespace gui
{
//Element definitions
namespace element
{
class crook
: public crook_inter... |
29b81f1403527e7b90834f14ae56ff905bebbd6b | 5a0b853d1d80d426d4edb3572b7f2c38c70ce377 | /examples/inject/main.cpp | c8b0e77111bc1dfbbcbd1d8b7e88ac6782605212 | [
"MIT"
] | permissive | lvous/hadesmem | 1537af2779f8f12e7367dab159548572af78ef83 | 3aa789a42799dfae03e2be0c86f1fbc0f5b82ddd | refs/heads/master | 2020-05-17T07:56:17.251294 | 2015-01-07T15:48:36 | 2015-01-07T15:48:36 | 40,565,165 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 8,652 | cpp | main.cpp | // Copyright (C) 2010-2014 Joshua Boyce.
// See the file COPYING for copying permission.
#include <algorithm>
#include <iostream>
#include <iterator>
#include <memory>
#include <sstream>
#include <string>
#include <vector>
#include <windows.h>
#include <hadesmem/detail/warning_disable_prefix.hpp>
#incl... |
b70ad9f9ac5776ab5d4db9cdb23314015bc29d07 | 73fce4451541ccde7dafe3bebdac9cf721c852c2 | /Source/Core/Public/Platforms/RadonPlatform.h | 9c4ae9283f0ec7d0a43ab9b2a0aa46cd7c0f0c2a | [] | no_license | jwoo1601/RadonGameEngine | 1615c722ec4d4c92d06826d1c25317bced537bb9 | 53aa44bbbee4c25d07da46c3149172631688f138 | refs/heads/master | 2020-04-26T09:00:00.305181 | 2019-10-23T04:30:18 | 2019-10-23T04:30:18 | 173,441,077 | 0 | 0 | null | 2019-10-23T04:30:19 | 2019-03-02T11:44:03 | C++ | UTF-8 | C++ | false | false | 2,118 | h | RadonPlatform.h | // Copyright 2019 Simon Kim All Rights Reserved.
#ifndef RADON_PLATFORM_H
#define RADON_PLATFORM_H
#include "PlatformMinimal.h"
#if RADON_COMPILER_SUPPORTS_PRAGMA_ONCE
#pragma once
#endif
#ifdef RADON_PLATFORM_WINDOWS
#include "WindowsString.h"
#include "WindowsMemory.h"
#include "WindowsThreads.h"
#include "W... |
cfca2e81e7e90ab190e697a173e0ef9476cc9219 | 47d7c25fa563a6b8f615b9718a8d2154235b8119 | /CSIS 252/Brekke's Files/func3/main.cpp | bc1f25ee580d2aac19c61c8155d2e80edabdf42a | [] | no_license | meyerpa/CPlusPlus | aefcbd20671da909b04e68aabc5f70911590903d | 46f7b8465a6fa1929be5c88985ed38ea9ac335ce | refs/heads/master | 2021-06-04T10:25:11.551812 | 2018-02-23T21:50:01 | 2018-02-23T21:50:01 | 57,323,448 | 0 | 0 | null | 2016-04-28T18:23:24 | 2016-04-28T18:05:37 | C++ | UTF-8 | C++ | false | false | 887 | cpp | main.cpp | #include <iostream>
using namespace std;
const int arraysize=5;
const int sentinel=-999;
// function prototypes
// comment: in prototypes, parameter names are not needed
int biggest(const int numbers[],int count);
void output(const int numbers[],int count);
int search(const int numbers[],int count, int searchValue);
v... |
8d5ca97bd183a81810d3a1e6df8c3defabfb8c21 | 51d2ce6f94232af413b2d8d03bcd24de1b2dd35e | /dllsample/dummy.cpp | 0690b24e1082c2c5420069fd54e0ca843f2fbf15 | [
"MIT"
] | permissive | 0xeb/detours-cmake | 820ca77e5c3a5e8091b86bcfbb0ed19340073129 | da22e0643ec3b59141a6ebba58dfac754d955222 | refs/heads/master | 2023-05-12T15:53:33.672282 | 2023-05-02T01:16:53 | 2023-05-02T01:16:53 | 188,133,900 | 13 | 8 | null | null | null | null | UTF-8 | C++ | false | false | 269 | cpp | dummy.cpp | #include <stdio.h>
#include <Windows.h>
//-------------------------------------------------------------------------
int main()
{
::Sleep(500);
printf("Dummy program started...\n");
::Beep(200, 1000);
printf("Dummy program ended...\n");
return 0;
} |
db5d5025940db7c2cb68e10a903b3618b9e95ea2 | edf9243dad9915eba12e4f1ae2db00653b8fd409 | /src/cpp/oop/oop.cpp | 6be923530d7d17d654f896f8f7ef3c4c1906d25c | [] | no_license | dmitryvim/mipt-cpp | ce59d2c1d81d52146cee28a1a4e654d49ac155d3 | 01310b3dd33639f83a990b9ea51cd0dee265c346 | refs/heads/master | 2021-01-13T12:56:16.675274 | 2017-03-21T13:52:32 | 2017-03-21T13:52:32 | 72,815,205 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 260 | cpp | oop.cpp | //
// Created by dmitry on 2/7/17.
//
#include "Time.h"
#include <iostream>
using namespace std;
int main() {
Time a(12, 35), b(10, 33, 45);
a.plus(b).print();
a.minus(b).print();
b.plus(a).print();
b.minus(a).print();
return 0;
}
|
42f6af0c82a9d7e64c78b2641c5eb2039ff6e2aa | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /contest/1542584575.cpp | d8c346dde21be77f5d2eb3ea872f0870cc1193f4 | [] | 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,499 | cpp | 1542584575.cpp | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
using D = double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
... |
28981c6fdb38e62f06246f5b20c1ce2150a14250 | 63cf126d0fb1c9d68887b85155c9022b53cd113d | /PersonalGame/Source/PersonalGame/OnRailPawn.cpp | dbb05b26c2df91cf7394f984954525ad85a24986 | [
"MIT"
] | permissive | thomaskAHLE/FinalProjectUe4 | 76622e1db5567775d226b1db2872768413be8d2c | 6f9b6d9ca60ebe69cd52552bbd0392bd17bb14e4 | refs/heads/master | 2023-06-21T14:19:59.311356 | 2019-12-12T23:08:43 | 2019-12-12T23:08:43 | 391,435,136 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,510 | cpp | OnRailPawn.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "OnRailPawn.h"
#include "OnRailSplineActor.h"
// Sets default values
AOnRailPawn::AOnRailPawn()
{
// Set this pawn to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTic... |
9262480f7e01d150f978f0bc9e53ed8dab2d2f9f | ce28066d5525cb7cbb3b37212bb5573ae040182b | /jni/Allocator.h | 8bc84ab4527b8ddb4fd417c6f872fc3c0ea212de | [] | no_license | nebogeo/earlobes | 60f4b948c3529440d4be4d2f90227ddf49807fc9 | 48f61c524af8b116cb520619c8218307b6c4f792 | refs/heads/master | 2016-09-07T18:59:17.281528 | 2012-09-29T12:18:10 | 2012-09-29T12:18:10 | 6,008,826 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,604 | h | Allocator.h | // Copyright (C) 2004 David Griffiths <dave@pawfal.org>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Thi... |
ed018c3b5f13739ed611d983f218f177f1d496b5 | 0c6342255d4f6b8cafb3237af0766bdffdb5eaf1 | /ArraysAndStrings/Arrays3D.cpp | b611939e1ac71f1cc47c63c8d35ae39640fc549f | [] | no_license | mohammed-mohiuddin/BasicsOfCPlusPlus | 960576e966a906089d63f45c31658f622502976d | 43148bbad100995053bbc4a5d103a24c4264139a | refs/heads/master | 2020-05-24T22:23:31.146746 | 2017-03-26T14:50:05 | 2017-03-26T14:50:05 | 84,886,919 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 977 | cpp | Arrays3D.cpp | //Program to illustrate the conspet of 3D arrays.
#include <iostream>
using namespace std;
int main(){
int numbers[2][2][2] ;
cout << "Enter 8 values: " << endl ;
//Enter 8 values.
for(int i = 0; i < 2; i++){
for(int j = 0; j < 2; j++){
for(int k = 0; k < 2; k++){
cin >> numbers[i][j][k] ;
}
}
... |
e0bd522ac10872418a641b5abd324cffb0dd33e6 | a6dc92771a884c61b9c026a3197b6027e24391b1 | /cpp/src/arrow/compute/kernels/scalar_string.cc | d5ecc754c11fa4b477683be47f984f1682660059 | [
"Apache-2.0",
"MIT",
"BSD-3-Clause",
"BSD-2-Clause",
"CC-BY-4.0",
"Zlib",
"NTP",
"LicenseRef-scancode-protobuf",
"CC-BY-3.0",
"LicenseRef-scancode-unknown-license-reference",
"OpenSSL",
"LLVM-exception",
"JSON",
"ZPL-2.1",
"BSL-1.0",
"LicenseRef-scancode-public-domain",
"CC0-1.0"
] | permissive | zeroviral/arrow | 83e929e70396513b3802ce6b3352b123ea536828 | 83fac7aaf1cc2cd5b4e7c6229bb5b0aff6653086 | refs/heads/master | 2022-11-12T19:06:54.444437 | 2020-06-26T03:06:30 | 2020-06-26T03:06:30 | 275,087,911 | 1 | 0 | Apache-2.0 | 2020-06-26T06:21:52 | 2020-06-26T06:21:51 | null | UTF-8 | C++ | false | false | 8,473 | cc | scalar_string.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 may... |
8b7c7f24ebf63b9ae071910e10fe0b3503d840c4 | dc4a282b7e604cb288375e7e2876ef36b6721aa8 | /boj/10819/10819.cpp | ce9da79f2fb91016ae0b740a989ef555b4486926 | [] | no_license | yjbong/problem-solving | 89be67ba24ad7495d82dcb0788dd7db1b849996a | c775271098daa05fcac269fd15de502e60592d49 | refs/heads/master | 2023-04-02T18:47:22.920512 | 2023-03-21T17:28:02 | 2023-03-21T17:28:02 | 70,111,700 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 439 | cpp | 10819.cpp | #include <cstdio>
#include <cstdlib>
#include <algorithm>
int N; // 배열 크기
int A[8]; // 배열
int order[8];
int main(void){
scanf("%d",&N);
for(int i=0; i<N; i++) scanf("%d",&A[i]);
for(int i=0; i<N; i++) order[i]=i;
int ans=0;
do{
int curAns=0;
for(int i=0; i<N-1; i++) curAns+=abs(A[order[i]]-A[order[i+1]]);
i... |
d25c53275020bd029880a79f6e7457006175c78b | c34c35fbaa9fc5ece4c9d9cf2c9e415cd582b7f7 | /GSS3-Spoj.cpp | 98cc48080e0f9dc976039acb15bb8ba2b724f83f | [] | no_license | rodrigofariasm/AlgoritmosAvancados-UVA-CF-Spoj | e920e0b1b02e29d8580c1ae1ab63cecc1f031b69 | b8c757df1b43e989d7cd7a0760c4c716b9f264d5 | refs/heads/master | 2020-12-23T02:37:34.296470 | 2016-08-04T20:35:22 | 2016-08-04T20:35:22 | 14,282,723 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,461 | cpp | GSS3-Spoj.cpp | #include <vector>
#include <string>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cctype>
#include <utility>
#include <algorithm>
#include <math.h>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#... |
39959f84b44db0deb68d90ffe18756b85bc8116c | 5d940315b7c2175e95da5a1c2ae2178f4cb53b9e | /scriptedit.cpp | ef041bec1c1f8e9f2276de8ab67e0dfce68ea3aa | [] | no_license | oldjudge/wxamcl | 8b33bdc648bc06fcda48e30180f70e284434db34 | 301c2478d0b037dbfec0564b24500e921303802f | refs/heads/master | 2022-10-18T07:35:05.158229 | 2022-10-02T08:45:48 | 2022-10-02T08:45:48 | 33,471,214 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,893 | cpp | scriptedit.cpp | #include "main.h"
BEGIN_EVENT_TABLE (amcScriptEdit, wxStyledTextCtrl)
EVT_STC_MARGINCLICK (wxID_ANY, amcScriptEdit::OnMarginClick)
END_EVENT_TABLE()
amcScriptEdit::amcScriptEdit(wxWindow *parent, wxWindowID id,
const wxPoint &pos, const wxSize &size, long style)
: wxStyledTextCtrl (parent, id,... |
69018cc2ed89c76b33c615884d4f3063b40a1ee2 | ad35f05af746f617828bad9299260b5b368ea850 | /exercise12-jrsavage29/traffic_light.h | d1ab590634a9e2f2a4c50d05675b024278c7db40 | [] | no_license | jrsavage29/Software-Design | 22c3abf86b2784f160441e4fac0ad7331a8a3de8 | a2660ce12ee993ca1592d5b981fd1d7ab10fb020 | refs/heads/main | 2023-03-27T22:55:34.450209 | 2021-03-22T02:13:28 | 2021-03-22T02:13:28 | 350,170,272 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 399 | h | traffic_light.h | // traffic_light.h
#ifndef TRAFFIC_LIGHT_H
#define TRAFFIC_LIGHT_H
#include <QWidget>
class QRadioButton;
class TrafficLight: public QWidget{
Q_OBJECT
public:
TrafficLight(QWidget * parent = nullptr);
public slots:
void toggle();
private:
QRadioButton * redlight;
QRadioButton ... |
2c26232fe38a760e9da4d73577e9e022196f7b43 | ffe41324b5ab98c46c52ffbaf896d668658641c5 | /GuitArduino/Potentiometer.cpp | 106613b4b732e4cd0f5609a04d1bd1b90657846c | [] | no_license | TCRichards/Arduino-MIDI-Guitar | ec08fb9144a77cc75bf6cd67c01fabf47af2e044 | dcc6fe254c06ce6be2b8f5ea47c9cf0f06678595 | refs/heads/master | 2021-07-09T04:59:13.067127 | 2020-07-05T19:30:10 | 2020-07-05T19:30:10 | 146,234,915 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 423 | cpp | Potentiometer.cpp | #include "Potentiometer.h"
Potentiometer::Potentiometer(int pin) {
_pin = pin;
pinMode(pin, INPUT);
_min = 20; // Default minimum value (should be changed by each unique piece)
}
int Potentiometer::getValue() {
return analogRead(_pin);
}
void Potentiometer::setMin(int minimum) {
_min = minimum;
}
int Pote... |
9f9f9b05d808b96d939fee5c0ec938c652e14e0a | 39d1f586447ed9c48c805350e3b0abcaeb52dc07 | /CODING BLOCKS/Algo++ Classes/Class-2_12_Jun/check_sorted_rec.cpp | f4a3a4d76ecc214922116e4b319e65ad5238b672 | [] | no_license | vaarigupta/OOPS_DS_ALGO | 80e3123f59b09c10e0b2750130b5554d9a7690a0 | 921756a9ef5a4b99c610bb9803776940d072438f | refs/heads/master | 2022-06-15T04:35:21.238885 | 2022-06-10T20:00:00 | 2022-06-10T20:00:00 | 132,237,189 | 1 | 1 | null | 2019-12-06T19:35:57 | 2018-05-05T10:20:30 | C++ | UTF-8 | C++ | false | false | 478 | cpp | check_sorted_rec.cpp | #include<iostream>
using namespace std;
bool check_sorted(int *arr, int n)
{
if(n==1)
{
return true;
}
if(arr[0]<arr[1] && check_sorted(arr+1,n-1))
{
return true;
}
return false;
}
int main()
{
int arr[] = {1,2,3,4,5,6};
int n = sizeof(arr)/size... |
845867950457b03810676ecba9371de5ca6168a2 | bf32bb6630167ba66981b3126280dbebe0b30ce9 | /main.cpp | e728a79a01c8130c96215f576ab2538454e246f6 | [] | no_license | astro813/810PROJECT | d7a4b9bd29e96fa3cc49784b37cea7df478d4df8 | c68e3ee6c20f9fd07d556692bcf530f381693d49 | refs/heads/master | 2021-01-10T13:57:11.734168 | 2016-05-10T15:01:43 | 2016-05-10T15:01:43 | 55,813,925 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,738 | cpp | main.cpp | //***********************************************************************************
//Discription:Main function of robotsimulator
//written by Jun Chen
//***********************************************************************************
#include "robotgui.h"
#include <QApplication>
vector<Robot*> robotList;
int R... |
6ea404f5adc009fbe317d88627f7579308df0f5b | 993dc3ab9132772a40b50eec1cd1fa09b5487e1b | /imageeditorengine/filters/FilterIclSource/Src/CFilterIclSource.cpp | 9ec0a66f8735e0849e39fbdd37576a80d0415836 | [] | no_license | SymbianSource/oss.FCL.sf.app.imgeditor | c421f8e73b20bdafcead4996aa1b5876f3e081b8 | 77320f0d084576e49b70e92c70921959e1809d35 | refs/heads/master | 2021-01-16T23:03:41.398394 | 2010-11-15T12:21:35 | 2010-11-15T12:21:35 | 68,768,705 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,617 | cpp | CFilterIclSource.cpp | /*
* Copyright (c) 2010 Ixonos Plc.
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of the "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
*
* Initial Contributors:... |
0c60da871e70688ce9e89e0110b7d48f11695618 | ee5d47e1b6d68ad1a0bb1b9d4d643ae8d576c668 | /kernel/src/net/dhcp_layer.cpp | 6287069988ced4e44be7fc5caa63638a72d52b96 | [
"MIT"
] | permissive | wichtounet/thor-os | c7008b69cbec11dac2daac60e588bf588cc65836 | 4fae8bb77cf4b3b34241c7004a32e8bca22a51e9 | refs/heads/develop | 2023-05-30T15:19:47.312478 | 2021-05-24T09:15:10 | 2021-05-24T09:15:10 | 13,440,471 | 1,743 | 217 | MIT | 2021-05-24T09:15:10 | 2013-10-09T11:28:24 | C++ | UTF-8 | C++ | false | false | 12,420 | cpp | dhcp_layer.cpp | //=======================================================================
// Copyright Baptiste Wicht 2013-2018.
// Distributed under the terms of the MIT License.
// (See accompanying file LICENSE or copy at
// http://www.opensource.org/licenses/MIT)
//=================================================================... |
757aae8b85056df9c86c800206035512e9a5dfe1 | 014510302f610c73f259094a4eebd481c359da46 | /tensorflow/core/kernels/dml_tensor_array.cc | f91ca14afb349c0b6f7660ce9f5a08201e7553ea | [
"Apache-2.0"
] | permissive | renovate-testing/test-8830-tensorflow-directml | 760b52fc10467b0f472b7e88ba86c95e90a3fe38 | 6657ce56d018e76e89fd143ebc8af7a3d2c946e5 | refs/heads/directml | 2023-03-19T05:37:31.395166 | 2021-03-10T14:50:09 | 2021-03-10T14:50:09 | 346,389,339 | 0 | 0 | Apache-2.0 | 2021-03-10T15:00:01 | 2021-03-10T14:48:49 | C++ | UTF-8 | C++ | false | false | 5,295 | cc | dml_tensor_array.cc | /* Copyright 2020 The TensorFlow Authors. All Rights Reserved.
Portions Copyright (c) Microsoft Corporation.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICEN... |
886b9c84cd0ace30237947d53cbceeb69b4af50b | 0ce5a9be7357cd649cbfc2814ea3f558f227e064 | /client/GroupGame/GroupGame/Classes/scene/SceneManager.cpp | 299ebf7061ca4bc072c728994fe4ee11cce7050c | [] | no_license | mjssw/myproj | 1beb06c2b8e490a11decfa5213e122b54d09beec | 4051ae1ed6062caa8acb24959416a5c4cfb4dea0 | refs/heads/master | 2021-01-17T06:23:53.492422 | 2014-10-27T09:19:03 | 2014-10-27T09:19:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 205 | cpp | SceneManager.cpp | #include "SceneManager.h"
SIGNLETON_CLASS_INIT(CSceneManager);
void CSceneManager::SetCurView(CViewBase *curView)
{
m_curView = curView;
}
CViewBase* CSceneManager::GetCurView()
{
return m_curView;
}
|
737f8d42d312ac750ec006166cb6bcdef34085ec | f8d76935f342abceff51a90a2844110ac57a4d2e | /solution/srm163_calendarrecycle.cpp | 3c0bbb221b04db82d119d71e3287d3f3d7ca8e9c | [] | no_license | rick-qiu/topcoder | b36cc5bc571f1cbc7be18fdc863a1800deeb5de1 | 04adddbdc49e35e10090d33618be90fc8d3b8e7d | refs/heads/master | 2021-01-01T05:59:41.264459 | 2014-05-22T06:14:43 | 2014-05-22T06:14:43 | 11,315,215 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 66,965 | cpp | srm163_calendarrecycle.cpp | /*******************************************************************************
* Automatically generated code for TopCode SRM Problem
* Problem URL: http://community.topcoder.com/stat?c=problem_statement&pm=1847
*******************************************************************************/
#include <vector>
#... |
a2ed1d1503b991689b857e9c7cbb1233f1cfc522 | 893106348b8f342b0102ac7feee028cd62c9c1f3 | /lab_2/ZipCode.h | ed01a61f173922889301b9c5d49e5520b8307320 | [] | no_license | isaychris/CSCI222 | f17ee1b241607f8763c445ef3bf5cab5115e1954 | 4fb1a1790437a1cdcea13823c63bf4ea3833c572 | refs/heads/master | 2021-09-03T15:57:54.971274 | 2018-01-10T08:17:26 | 2018-01-10T08:17:26 | 65,824,124 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 805 | h | ZipCode.h | #ifndef _ZIPCODE_H
#define _ZIPCODE_H
using namespace std;
class ZipCode {
private:
string zipcode; //internally stored zipcode as string barcode.
int getzip; //return variable for zipcode number
string getbar; //return variable for barcode
string stringzip; //conversion variable
//helper functions
string co... |
fb89cdf38aba63d8cfa879fde81cd7e68d578ade | acee626dd6dd9c11e3a08daef876c0a74815318b | /src/RandomGenerator.cpp | 5a2b36b1a7a4c5ef33937ee289f04e23652ffcb7 | [
"Apache-2.0"
] | permissive | bmstu-gaming/SquaresAndPairs | 23946f244e9161bcd5af1a8763f1c6e12d35cbc3 | 9f52b0e509c5f46971264ce8f23acf700f184dce | refs/heads/master | 2021-07-12T14:46:04.337774 | 2020-07-12T07:48:07 | 2020-07-12T07:48:07 | 179,822,187 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 513 | cpp | RandomGenerator.cpp | #include "RandomGenerator.hpp"
namespace snp {
RandomGenerator::RandomGenerator() {
std::random_device rd;
generator = std::mt19937(rd());
}
RandomGenerator::~RandomGenerator() {
}
RandomGenerator::RandomGenerator(unsigned int seed) {
generator = std::mt19937(seed);
}
void RandomGenerator::setInterval... |
aaa3f62730029b2f4265e8916c34790cf949a0ce | b1a14e08044ae882e5dd9231811cad9af43c9b28 | /tests/test_log.cpp | 1f4731303640d2ba6489f336e263bfc325d38efc | [] | no_license | sadwd12312/sylar-from-scratch | a59f459113a85d59f52c72283a8e2e48d86ad49c | 5dbc892e5c3a1f23d1bf06d2c79c5c1a8398918e | refs/heads/main | 2023-08-07T13:15:28.352730 | 2021-09-28T03:18:45 | 2021-09-28T03:18:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,310 | cpp | test_log.cpp | /**
* @file test_log.cpp
* @brief 日志类测试
* @version 0.1
* @date 2021-06-10
*/
#include "sylar/sylar.h"
#include <unistd.h>
sylar::Logger::ptr g_logger = SYLAR_LOG_ROOT(); // 默认INFO级别
int main(int argc, char *argv[]) {
sylar::EnvMgr::GetInstance()->init(argc, argv);
sylar::Config::LoadFrom... |
4f9d06b77fcd89a4f016cca088c0ee69a99ac557 | 047e3752ac1ccd6690ec60e14ae9bb81e655701d | /src/game/item.cc | 3f0a0c54c8522c589510e832ee757761fa045ffd | [] | no_license | tpleino1/tv | 8324af81309338fb4e13ff5ce2dfb4b8c96cb079 | 6ace3bbc92b1f3cbe769aefb606f1d7fd798e390 | refs/heads/master | 2021-01-19T02:20:39.098099 | 2016-07-04T21:25:44 | 2016-07-04T21:25:44 | 16,185,703 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 176 | cc | item.cc | #include "item.hh"
// Returns items cost
size_t Item::getCost() const
{
return this->cost;
}
// Returns items id
Item::ItemID Item::getID() const
{
return this->ID;
}
|
58e1efde653cc46151106fb31b5efb6c8c81f533 | dbe8bdc2b3d9d4c13d7fc9c13895f7bcd226db05 | /LeetCode/LeetCodeCpp/242.cpp | 173ef4ab98e3c28c68a9e9999523bc47d3f1498f | [
"MIT"
] | permissive | zl6977/BasicKnowledge | 8740515e786826984c2c7e05e5cdb1d75717637e | 60d361c83243c24407be844dd9201adf83c6a0e5 | refs/heads/master | 2020-05-27T06:38:18.670076 | 2019-01-28T17:13:25 | 2019-01-28T17:13:25 | 188,524,708 | 1 | 0 | null | 2019-05-25T05:29:01 | 2019-05-25T05:29:01 | null | GB18030 | C++ | false | false | 990 | cpp | 242.cpp | #include "stdafx.h"
/*
给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。
示例 1:
输入: s = "anagram", t = "nagaram"
输出: true
示例 2:
输入: s = "rat", t = "car"
输出: false
说明:
你可以假设字符串只包含小写字母。
进阶:
如果输入字符串包含 unicode 字符怎么办？你能否调整你的解法来应对这种情况？
*/
class Solution {
public:
/*排序后相等，o(nlogn)*/
bool method_1(string s, string t)
{
sort(... |
32cc45f77d596bedd5a615100459d334d5f929c1 | ee6fbe1b44f7b0b422d3f18a2ff30443e46360ca | /parser.cpp | 359811003fea6e598d5bd717d0a728673b4fc6b0 | [] | no_license | lotaa/university | 029ff2b3da025677165952b31eced1101eea697c | 816397bf09ca028d109ae63a06c89b5ae0bba586 | refs/heads/master | 2021-05-17T05:06:54.480885 | 2020-03-27T20:35:32 | 2020-03-27T20:35:32 | 250,639,915 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,837 | cpp | parser.cpp | #include<fstream>
#include<iostream>
#include<string>
#include<string.h>
#include<ctype.h>
#include<stack>
#include<unordered_set>
#include<vector>
using namespace std;
enum states { q0, q1, q2, q3, q4, q5, q6, q7, q8 };
enum Token
{
PROGRAM_SY, BEGIN_SY, END_SY, PROC_SY, ID_SY, EQUAL_SY, ASSIGNMENT_SY, SIMI_COLON... |
e8a286d155a7c2d6623b28dc731667f862cb6ad2 | 1ba4a56c6fdf189b05edb9853ab0ce39f3bf2c5f | /LeetCode/partion list.cpp | ca0dd10ab804613f0bb086e7a37433858c3aadd5 | [] | no_license | FireFoxPlus/LeetCode | 12429bcaa9bb005be4a5c9ac53515206fe42ab18 | 1ff1eddb75368b40cfc2e7f8892b59a2c0000d52 | refs/heads/master | 2021-01-01T15:55:48.958668 | 2015-07-28T06:48:53 | 2015-07-28T06:48:53 | 39,804,549 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,683 | cpp | partion list.cpp |
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
#include <iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Soluti... |
2d2f4ddd21b228cce7ae7469a6887a3e6f5c6db4 | da215a09477415e8970573476be649054d2bd582 | /C++/inheitance/MultipleInheritence/multipleInhetiance.cpp | 9561737f163e0cba19dfccc795d357c88d33a1ac | [] | no_license | imyogeshgaur/important_concepts | 822bb554a579e756d4727b57aa3c889923d3158b | 5d34232ad5cf1e3d078f6026b61ce41698e38755 | refs/heads/master | 2023-02-07T06:25:01.424360 | 2020-12-27T10:45:49 | 2020-12-27T10:45:49 | 299,019,489 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 919 | cpp | multipleInhetiance.cpp | #include <iostream>
using namespace std;
class Base1{
protected:
int base1int;
public:
void set_base1int(int a)
{
base1int = a;
}
};
class Base2{
protected:
int base2int;
public:
void set_base2int(int a)
{
base2int = a;
}
};
class Base3{
protected:
int base3int;
... |
4c6b7e119470d0ceac2e85149cf6cb8503a0cb1d | 124398c433f5e42134bf59cd081807286e14822b | /src/AStarPathFinder.cpp | 3b16d69a21a42a2c1f70f2202f55774ca45b924b | [] | no_license | TekatoD/MyStrategyRAIC2016 | b1c4367fbb51b83288a5c177e29a56efecf878a8 | 1ec0995adbfa5f212d86ccb35c8369d418baeaa5 | refs/heads/master | 2020-05-25T20:08:57.417078 | 2017-03-15T11:45:56 | 2017-03-15T11:45:56 | 84,962,989 | 0 | 0 | null | 2017-03-14T15:08:09 | 2017-03-14T15:08:09 | null | UTF-8 | C++ | false | false | 3,217 | cpp | AStarPathFinder.cpp | /**
* @autor arssivka
* @date 11/30/16
*/
#include "AStarPathFinder.h"
#include "Log.h"
#include <list>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
const size_t AStarPathFinder::DEFAULT_QUEUE_SIZE = 32;
AStarPathFinder::AStarPathFinder(Ptr<Graph> g... |
cd4fd96bff7e824ac3dd4529c6c5f56c70e0c67b | eab47b71185ac405380441e251ddcc75da575052 | /camera/test/clouduploader/cloud_libs/include/common_base.h | c2f8d16bb90b3e98f0fcd32a9a8fe3bb386e806a | [] | no_license | mrtos/ambarella | 6b2bfc6adc3d314ef85cdc63bcded02b85cd3383 | 2eaae76ec56e052479ca6405a82c8fec0bc7a794 | refs/heads/master | 2016-12-13T05:10:17.576686 | 2016-01-21T09:47:01 | 2016-01-21T09:47:01 | 27,258,572 | 3 | 12 | null | null | null | null | UTF-8 | C++ | false | false | 25,500 | h | common_base.h | /**
* common_base.h
*
* History:
* 2012/12/07 - [Zhi He] create file
*
* Copyright (C) 2012, the ambarella Inc.
*
* All rights reserved. No Part of this file may be reproduced, stored
* in a retrieval system, or transmitted, in any form, or by any means,
* electronic, mechanical, photocopying, recording, or o... |
d162a4edc793ab1233dff967a3a01c3946a4863a | fbb9aaf25c1e25e87483f47ea619e0d48d74107e | /2_source_code/cruise_control/configuration/test/cruise_configuration_test.cpp | 4701707a04a3e21e2b4a5c48505ee38b67d63fb5 | [] | no_license | naveen-kummar/cruise_control_system | e9413a75ae706042ee6f8a13a76a12ae2ee1f1e1 | 668ad3b1c31ffecdb1b2ea1dad2f31ea1af05211 | refs/heads/master | 2022-11-23T12:43:51.544460 | 2020-07-27T13:51:33 | 2020-07-27T13:51:33 | 282,911,491 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,629 | cpp | cruise_configuration_test.cpp | /*
* @file cruise_configuration_test.cpp
* @brief Defines test functions to validate configuration manager
*/
#include <gtest/gtest.h>
#include <memory>
#include <string>
#include "pthread.h"
#include "cruise_configuration.h"
using namespace cruise_control;
constexpr int32_t kNullValue{0};
class CruiseConfigurati... |
6029316b5bdbe8a8b8e995789ea16a9f9398c11f | ff3c9c264eed5ea19da08825a4531d9ae975c09c | /tutorial/cpp/exemplos/sobrecarga-vetor2d.cpp | 82804c5fbc942cd4af766d9887300da8676ab52b | [
"MIT"
] | permissive | agostinhobritojr/agostinhobritojr.github.io | a9ca0562aa83679ac94a4232924fdcc5afe24c11 | 2778002c29f1f376adb12ed5f37e18990478a363 | refs/heads/master | 2023-05-26T15:32:39.258165 | 2023-05-22T18:17:35 | 2023-05-22T18:17:35 | 145,466,097 | 3 | 6 | NOASSERTION | 2023-02-01T22:32:39 | 2018-08-20T20:16:50 | HTML | UTF-8 | C++ | false | false | 739 | cpp | sobrecarga-vetor2d.cpp | #include <iostream>
using namespace std;
class Vetor2d{
private:
float x, y;
public:
Vetor2d(float x_=0, float y_=0);
Vetor2d operator+(Vetor2d v);
Vetor2d operator-(Vetor2d v);
Vetor2d operator*(float a);
float operator*(Vetor2d v);
};
Vetor2d::Vetor2d(float x_, float y_){
x=x_; y=y_;
}
Vetor2d Vet... |
4508eb22b31b7b957c7f4bdc944127bf79dd5107 | 7a7f9ce4bbe1d3e30455afa0b99f237d3d6eebc6 | /P3/uncompress.cpp | f40b0c599fd62a5a99a519774a0cb9c7119a9923 | [
"MIT"
] | permissive | ailyanlu1/c100 | 2c6d345e3261efae87fd2a030d7e8ac29796c88f | e81e5182b452a2bf698d37315791cd2e45f73a6e | refs/heads/master | 2020-03-24T19:51:47.950010 | 2013-10-23T04:27:28 | 2013-10-23T04:27:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,237 | cpp | uncompress.cpp | /*
* P3
* uncompress.cpp
* Main driver for decopmression process
*
* Author: Jay Dey cs100vaj
* Author: Joshua Yuen cs100vbc
*/
#include <fstream>
#include <iostream>
#include "HCTree.hpp"
using namespace std;
int main( int argc, char* argv[] )
{
if( argc != 3 )
{
cerr << "Incorrect arguments." << end... |
13b137446aa3e33e56f5921d394a80ad29d759d4 | 927918bb14da09c62ba72e05331b2d620c592bc2 | /src/matrices/CSCMatrix.h | 802e8e93d1f3120b0dcb8c7e8647d527af8bb956 | [] | no_license | Alberto42/HPC-Distributed-matrix-multiplication | 15046e25ad5ca33d3c7fda1def60d8d515e9eeeb | e8d2bc3e7000da1ff211d070f6b40d2d3f51fc5b | refs/heads/master | 2020-05-24T08:03:35.533560 | 2019-10-08T08:36:05 | 2019-10-08T08:36:05 | 187,176,015 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 889 | h | CSCMatrix.h | //
// Created by albert on 17.05.19.
//
#ifndef AC370756_CSCMATRIX_H
#define AC370756_CSCMATRIX_H
#include <vector>
#include <fstream>
#include <assert.h>
#include <mpi.h>
using namespace std;
class CSCMatrix {
public:
vector<CSCMatrix> split(int peacesCount);
friend ostream &operator<<(ostream &os, const... |
b3af7a534f3f856e4c0e57f98d6626adbf223dcb | 2e5534832fa885f7f09003ada2d7bf3f236e9f7f | /problem-solver/cxx/modules/soatoClassificationModule/agent/SoatoClassifier.cpp | 5aac9e0d65d528c2bb6137cff9da072f7dce1283 | [
"MIT"
] | permissive | ostis-apps/ostis-geography | 11ff259e2031f70281699cc9549298da1af82f2e | 14fc0930ed6bba3dd0ecf4aca771643ff620e203 | refs/heads/main | 2023-04-07T15:54:48.218802 | 2023-03-16T13:08:48 | 2023-03-16T13:08:48 | 209,274,423 | 2 | 112 | MIT | 2023-09-09T16:20:51 | 2019-09-18T09:51:03 | C++ | UTF-8 | C++ | false | false | 4,350 | cpp | SoatoClassifier.cpp | #include "SoatoClassifier.hpp"
#include <iostream>
#include <vector>
namespace soatoClassificationModule
{
const std::map<int, std::string> SoatoClassifier::firstDigitMap = {
{1, "Брестская область"},
{2, "Витебская область"},
{3, "Гомельская область"},
{4, "Гродненская область"},
{5, "г. Минск"}... |
5372f7feb3c6bd1d5d45d9d7ba61816cda4c4e61 | 33392bbfbc4abd42b0c67843c7c6ba9e0692f845 | /sparse/L2/include/sw/fp32/L2_definitions.hpp | 5e522eb24c835c13c05edd9ae33561601559f6cd | [
"OFL-1.1",
"BSD-3-Clause",
"Apache-2.0",
"BSD-2-Clause",
"MIT"
] | permissive | Xilinx/Vitis_Libraries | bad9474bf099ed288418430f695572418c87bc29 | 2e6c66f83ee6ad21a7c4f20d6456754c8e522995 | refs/heads/main | 2023-07-20T09:01:16.129113 | 2023-06-08T08:18:19 | 2023-06-08T08:18:19 | 210,433,135 | 785 | 371 | Apache-2.0 | 2023-07-06T21:35:46 | 2019-09-23T19:13:46 | C++ | UTF-8 | C++ | false | false | 2,753 | hpp | L2_definitions.hpp | /*
* Copyright 2019 Xilinx, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to... |
1744a00d30ea57c432787eb529092187391d5724 | b7e44e71d7b2e5dd977e364c1c4f4a027c34fc41 | /src/libs/prediction.hpp | 2aa0fcb1b601ea1731d0fce78a8f068cfa6ef5be | [
"MIT"
] | permissive | ronaldpereira/content-based-movie-recommendation | 9e3c2a387a5a32e801f43b968b385d3dee33aca5 | 4113e262ea85be0210373000ec7d2692d92f834b | refs/heads/master | 2020-05-20T17:58:21.615077 | 2019-06-05T17:12:52 | 2019-06-05T17:12:52 | 185,698,310 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 379 | hpp | prediction.hpp | #ifndef PREDICTION
#define PREDICTION
#include <cmath>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <cstring>
#include "useritem.hpp"
#include "content.hpp"
#include "rocchio.hpp"
class Prediction
{
private:
double makePrediction(int, int, UserItem *, Content *, Rocchio *);
public:
void... |
e0dc8df62d69954410bb3595adbb080ee85a3168 | bf58e480ac00742e3da9538f9e8044fb97243738 | /BrainSTL/UserMemFunRef.cpp | 72a4f51259e7da30b0c2100a622d4f18de47dbbe | [] | no_license | mesikkera/DailyCoding | ba319560ef08cbbda4139f60a07ba6ba07914b08 | 2663068a85aa205d80512f94d2badee88a4f9210 | refs/heads/master | 2023-03-10T10:12:47.725338 | 2022-06-13T08:52:06 | 2022-06-13T08:52:06 | 43,902,184 | 2 | 0 | null | 2023-03-01T13:19:29 | 2015-10-08T16:27:07 | C++ | UTF-8 | C++ | false | false | 566 | cpp | UserMemFunRef.cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<typename RType, typename CType>
class Mem_fun_ref_class: public unary_function<CType, RType>
{
RType (CType::*pf)() const;
public:
Mem_fun_ref_class(RType (CType::*_pf)() const):pf(_pf) {}
RType operator()(const CType... |
50fda9a358395cf55dc58bb2825386c192b2e94f | e701f27376df41fab37bbdc6d1cf00d62c262952 | /MP - Práctica 1/src/Empresa.cpp | 4eac876c0ccbe71262541afa4fe55c84423d7a58 | [] | no_license | manoplin18/Segundo | 199f942d69c9a96690b73cb007a855aee4808409 | 3b518f2c3d3696f4c77fd7577d93f8f78fee35ef | refs/heads/main | 2023-02-01T08:28:43.067760 | 2020-12-20T19:51:50 | 2020-12-20T19:51:50 | 322,630,645 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,655 | cpp | Empresa.cpp | #include "Empresa.h"
Empresa::Empresa():nmaxcli(100), nmaxcon(100){
this->ncli = 0;
this->ncon = 0;
this->nmaxcon = 10;
this->contratos = new Contrato *[nmaxcon]; //Capacidad para 10 contratos
}
Empresa::~Empresa(){
for(int i = 0; i < this->ncon; i++)
delete this->contratos[i]... |
d992cf47badbb2cb0ed490815249fa230ff6dd0f | f491daea3ff53f7d7c9941cfbf45e7b2c231b4f6 | /isomorphic.cpp | 4011af4727e7870568501faba3351fecab724db5 | [] | no_license | outman119/leetcode | 295015ae25d19af02a1b0305e7fe9597dae54686 | 9b6544143552c00f8b676515079ce62486537f5c | refs/heads/master | 2020-04-29T23:27:50.132403 | 2015-07-06T06:15:25 | 2015-07-06T06:15:25 | 28,943,999 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 713 | cpp | isomorphic.cpp | class Solution {
public:
bool isIsomorphic(string s, string t) {
int len1 = s.length();
int len2 = t.length();
if (len1 != len2)
{
return false;
}
map<char, char>mm;
map<char, char>mn;
for (int i = 0; i < len1; i++)
{
... |
d87c9b4a2b46c5cfcad844ec86d14fa662de3b66 | 61b379202c3804706b93dc0968317dca411fed6f | /TAP/tap2013/sol/h_leo.cpp | 7cea981cc184ee404fa6bcb2d638dce1c703d51f | [] | no_license | johny65/acm | ef311e7ad215cea324d57e507fe5c7cde4804071 | 3f1424ac02473a25345b26d01200f07341845f53 | refs/heads/master | 2020-08-03T00:44:42.129764 | 2019-09-28T22:28:01 | 2019-09-28T22:28:01 | 211,568,939 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,097 | cpp | h_leo.cpp | #include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<string>
#include<vector>
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define dforn(i,n) for(int i=(int)n-1;i>=0;i--)
#define all(v) v.begin(),v.... |
450ea04566e08a0c45bfa1f1caa1297f0b929597 | 995c731cfbc26aaa733835eebaa6fcb0787f0081 | /gazebo-5.3.0/gazebo/gui/RenderWidget.cc | 6d34a948b64ae66e90542c5f46daa8195ca1b314 | [
"Apache-2.0"
] | permissive | JdeRobot/ThirdParty | 62dd941a5164c28645973ef5db7322be72e7689e | e4172b83bd56e498c5013c304e06194226f21c63 | refs/heads/master | 2022-04-26T18:26:51.263442 | 2022-03-19T09:22:14 | 2022-03-19T09:22:14 | 33,551,987 | 7 | 9 | null | 2022-03-19T09:22:14 | 2015-04-07T15:36:00 | C++ | UTF-8 | C++ | false | false | 11,645 | cc | RenderWidget.cc | /*
* Copyright (C) 2012-2015 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by... |
7224abfff1e85e76b7583e7bbef0570afc623ff6 | 0cef5168801e49b6b1fad3b77eaa3b69de1ab06a | /src/material/diffuselight.h | ab72626f1ac56ce1ac05f8d0d25336f40b37b84a | [
"MIT"
] | permissive | cualquiercosa327/sim-rt | 825046458989c1e56d2d790b3654d19d72bdfaaf | 7d41156c2ccace775ff6a2f48d7b5f49a6453f04 | refs/heads/master | 2021-01-26T16:04:08.238381 | 2019-09-26T07:17:45 | 2019-09-26T07:17:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 938 | h | diffuselight.h | #ifndef DIFFUSE_LIGHT_H
#define DIFFUSE_LIGHT_H
#include "imaterial.h"
#include "texture/itexture.h"
namespace rt {
/**
* a diffuse light emits light but doesn't scatter light
*/
class DiffuseLight : public IMaterial {
public:
DiffuseLight(std::shared_ptr<ITexture> texture) : m_emit(texture) {}
/**
* d... |
17a82c646d8ad593e8444152c2fce152414dcc23 | 4f431921bbb0247f848ec3ddf612a217e622c888 | /Project1/src/Sphere.h | fa224e5891de8b4001ab0318893d583a23b5a243 | [] | no_license | Wlodder/PartcleSystem | 22611dc6a26bb042f2dec62511a27425dc2289ff | e4725c42440c993506ba23f0e05f4231cd0ff02b | refs/heads/master | 2023-03-13T07:32:32.267695 | 2021-03-06T21:42:41 | 2021-03-06T21:42:41 | 345,195,124 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,679 | h | Sphere.h | #include <glm/glm.hpp>
#include <glm/gtc/quaternion.hpp>
#include <glm/gtc/constants.hpp>
#include <glm/gtx/norm.hpp>
#include <cfloat>
#include <cmath>
#include <iostream>
#include "Particle.hpp"
#include "ParticleEmitter.hpp"
class Sphere
{
// (x - x1)^2 + (y - y1)^2 + (z - z1)^2 = r^2
glm::vec3 pos;
float radius... |
8975d2dbf585bee30659d8827283e2a1e10b0f15 | ac256d7a38b80de3688a97afe63ad128bffb6e89 | /src/effects/noise/OceanNoiseEffect.h | d67afb46a3aefd943ff1b99ee2d47f7af0ce9be8 | [] | no_license | exirous/GyverLampCpp | a57b45db555401143a45637de7a99e0f5f81cc02 | cfcd38e500b635c90510bd5be219e90b7cc3a2e0 | refs/heads/master | 2020-12-29T16:24:31.413741 | 2020-02-28T19:48:36 | 2020-02-28T19:48:36 | 238,669,017 | 0 | 0 | null | 2020-02-06T11:04:32 | 2020-02-06T11:04:31 | null | UTF-8 | C++ | false | false | 201 | h | OceanNoiseEffect.h | #pragma once
#include "effects/noise/NoiseEffect.h"
class OceanNoiseEffect : public NoiseEffect
{
public:
OceanNoiseEffect();
Effect* clone() const { return new OceanNoiseEffect(*this); }
};
|
549d848835c78d658627e11d4dcec7e49056f0e6 | 76535dcf8d5633f0d58d11eb1b01de64d4b2e792 | /test/uri_parse_test.cc | 6027b016abdab3e8bdb701cbb26c1ef91b39b60e | [
"MIT"
] | permissive | hfuj13/lwsock | f0703851ffe1574c8da944b8d472acf1e3b7e478 | 2157a0f1c34ca86cefe3129a23802023af1cdd02 | refs/heads/main | 2022-11-05T09:36:14.941602 | 2022-07-23T11:39:52 | 2022-07-23T11:39:52 | 78,430,799 | 17 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 7,948 | cc | uri_parse_test.cc | #include "gtest/gtest.h"
#include "lwsock.hpp"
using namespace std;
using namespace lwsock;
TEST(URI_PARSE, split_hostport_pathquery)
{
{ string uri("ws://[1234:abcd:1234:1234:1234:1234:1234:1234]:100/path?xx=zz");
auto actual = split_hostport_pathquery(uri);
ASSERT_EQ("[1234:abcd:1234:1234:1234:1234:1234:... |
ee39843038fb78e003cb2966c49821a1bd096b56 | 362e321d0c4f054a3877fc0a36b168531f0746b5 | /LC474_Ones and Zeroes_DP.cpp | 63b3da834b89e3cdc487f6fb89103b258fb7ca4a | [] | no_license | logic-life/LeetCode | 4935b5d57c7d1b673d392e50ad5cfa50d873fb58 | 3a6e825e114fee2568ec6866833d85a4b4557f02 | refs/heads/main | 2023-04-08T19:03:24.791258 | 2021-04-13T05:36:13 | 2021-04-13T05:36:13 | 357,615,164 | 1 | 0 | null | 2021-04-13T16:12:07 | 2021-04-13T16:12:06 | null | UTF-8 | C++ | false | false | 1,056 | cpp | LC474_Ones and Zeroes_DP.cpp | class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) { // 本题比较特殊，是二维的0-1背包问题
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0)); // 本行和下面一行等价
// int dp[101][101] = {0}; // 像这种数组直接 = {0}的，就是把所有初值全部赋为0
for (string str : strs) {
int oneNum = 0; // 统计0... |
d00e4edb18234cc32846bd64399d81a393558249 | 5b5217cbe6f275fcc6fa4bc5699dd7dee5aba1c4 | /Hashing/Rhyming with Hashing/HashInfo.h | 7a687c0e77ad21b4bc1309b4e6bbbb6105f44ea3 | [] | no_license | stuhops/cs2420 | 5e5c70145c9fef210dbc7cab053e0436c57f3c1a | 972a49c7b4f6b4af04e012bbd2f3221d1ff46c35 | refs/heads/master | 2020-09-12T17:46:47.237437 | 2019-11-18T16:51:43 | 2019-11-18T16:51:43 | 222,498,604 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 743 | h | HashInfo.h | /* Defines a class made to store a word and what words
* follow after that word and the normality of that occurance.
*
* Author: Stuart Hopkins
* Last Updated: 03/14/18
*/
#ifndef HASHINFO
#define HASHINFO
#include <iostream>
#include <vector>
class HashInfo {
private:
std::string word;
int ct;
std::vector<std::... |
5899a2889ffc00a0864f6604671879d892d08ef5 | fdcc03ee374171db86fb1aa14a2d2da487b29c50 | /mycpp/cipher/polybius0.cpp | b23ec79bdabb4b7ff0e86dd6272af98188c19e97 | [] | no_license | octopusengine/linux | bdc29f2ff6e75f81a47db3968197ef8516c98946 | 3aba705662742ff72a38f813aceb39f1c196b8d3 | refs/heads/master | 2023-08-03T08:15:46.579783 | 2023-07-30T06:06:48 | 2023-07-30T06:06:48 | 102,712,007 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 730 | cpp | polybius0.cpp | #include <cmath>
#include <iostream>
using namespace std;
void LetterToNumber(string str) {
int R, C;
for (int i = 0; str[i]; i++) {
R = ceil((str[i] - 'a') / 5) + 1;
C = ((str[i] - 'a') % 5) + 1;
if (str[i] == 'k') {
R = R - 1;
C = 5 - C + 1;
}
else... |
4583bf2cbbcb8fc277c4be06bd5bff6d754d709d | 5ffe04a977c11f315c26b85e953e6dc3439386f7 | /tcp/tcp_client.hpp | f81b72d81834113be3d80f9bd77e25e37903a993 | [] | no_license | kelvin7feng/1st_framework | 9f4bec63d76909b8c9d0bbfe6a492fd9e737f67d | 333be912c0111263cb446db87be84284b641ec46 | refs/heads/master | 2021-05-02T01:00:33.529574 | 2017-04-15T09:43:02 | 2017-04-15T09:43:02 | 78,534,574 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,547 | hpp | tcp_client.hpp | //
// tcp_client.hpp
// client
//
// Created by 冯文斌 on 16/9/5.
// Copyright © 2016年 kelvin. All rights reserved.
//
#ifndef tcp_client_hpp
#define tcp_client_hpp
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <uv.h>
#include <unistd.h>
#include <iostream>
#include "knetpacket.h"
using names... |
ca96f044bc2205dbcb3856c611e58d7fdd7b1754 | ebdc4ebba054c7fb5be991b0c31804a27c628b0f | /main2.cpp | 5ef8584a09df0e85bb74aa107796a89f91452f1d | [] | no_license | raganaxi/nn | f31c861593f90b40e1687d27b4cbb5db8c37dfd9 | ad7e788f6e06b9837460ff4170b9337e7320654c | refs/heads/master | 2021-01-13T03:50:49.064501 | 2014-01-04T22:15:13 | 2014-01-04T22:15:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 641 | cpp | main2.cpp | #include <set>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
/*
set <string> lista;
lista.insert("booz");
lista.insert("jael");
lista.insert("grillo");
lista.insert("booz");
for(int i=0;i<lista.size();i++){
cout << "el miembro "<< i+1 <<" es : "<<lista.at
(i)<<endl;
}*/
set... |
7fa7d84aa2439a18f326cc6991b132d997a11f92 | 9102bc7799aaa75574f311ca94e24866a29aad7b | /SDK/DiTracer/camera.cpp | 2244ee1cd5d0cfd947e921639bbb556e5c3ea356 | [] | no_license | DiMasta/OptiXSamplesSDK | d34c5ffd438d74ed26894add06b3e2cc9330f52b | e1fd8af9ee3c964b15bf0d971f54677f89cd9348 | refs/heads/master | 2021-07-06T14:04:33.735993 | 2017-10-03T07:10:39 | 2017-10-03T07:10:39 | 103,932,516 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,418 | cpp | camera.cpp | #include "camera.h"
using namespace optix;
Camera::Camera() :
SceneElement()
{
}
//**************************************************************************************************************************
//***********************************************************************************************************... |
5a02e5df28843fb74cd037fc89278ab0cabd82b7 | f476449e49c407255bbdce9059915714a775ed19 | /BlockNDNRPi/Configure.h | b752610d6bcc85986482aac79bcd6510f00138ca | [] | no_license | hafsteinn/BlockNDN | 578887855d1b98ab5e1c3c8057aa74f0c471090d | c5e1655dc8acc2657c497c99da37c5f7c62b5d0b | refs/heads/main | 2023-01-20T10:35:03.563395 | 2020-11-30T14:47:56 | 2020-11-30T14:47:56 | 303,652,413 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 10,116 | h | Configure.h | #pragma once
#include <string>
using namespace std;
namespace BlockNDN {
class Configure
{
protected:
string blockNDNGetBlockPrefix = "/ndn/blockndn/getblocks";
int INITBLOCKSIZE = 52;
int MAXBLOCKSIZE = 64;
int OFFSETINIT = 0;
int SHA256SIZE = 64; //This was 32 in the original code
int SIZEOFINT = 4... |
417150e9b4a10a89c79694432d127d0cc21f56da | b0d7fd0b33a3c92510769aa79e166e6903998108 | /src/kernel/cpu.h | 199db0b79a075838755d9c43bd39c5fd3d5444d6 | [
"MIT"
] | permissive | hexueyuan/virtualComputer | 5047281a3accd7b3744dd5020ef6edbfb2bf3ed8 | a20b5f089622c44260176a4233abd699c0430d8b | refs/heads/master | 2020-04-09T07:21:44.874965 | 2019-04-02T07:03:59 | 2019-04-02T07:03:59 | 160,152,074 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,335 | h | cpu.h | #ifndef __CPU_H__
#define __CPU_H__
#include "base/base.h"
#include "base/selector.h"
#include "base/alu.h"
#include "base/shiftor.h"
//base/
//CPU部件由两个选择器、ALU部件和移位器组成
//八个输入端口和一个输出端口，接受一条控制总线
namespace computer {
class CPU {
public:
//构造函数
//输入：
// R0 ~ R3 四个通用寄存器
... |
331bef7d0e70d646ac3ba88cf3f4676270dce58f | a61efa4c2e1fc6ccb580548f00a662a05b756291 | /C++ course/ex09/ex09.2_Palindrome.cpp | 47d30e4f33516a5e9bbf531650b3ed2f42ba052f | [] | no_license | barbararcbf12/DTU_Projects | d13a8c6db0c2d23ffbc897b7ca1e57568114b5b4 | 7eaeed0536a77e3f3b63b8912849deb53b4dacd2 | refs/heads/master | 2020-03-08T06:03:23.141031 | 2018-04-04T17:18:20 | 2018-04-04T17:18:20 | 127,962,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,199 | cpp | ex09.2_Palindrome.cpp | // Palindrome
#include <iostream>
#include <vector>
#include <algorithm> // std::reverse
#include <cmath>
using namespace std;
void reverseV(vector<int> v1, vector<int> &v2);
void printV(vector<int> v);
int main ()
{
int myint;
vector<int> myvector;
vector<int> myvectorInverse;
bool check = true;
... |
57a4a27207edb3e9ec8cd9250bde0030c27dc91b | 9bc7e204718e6935ddb23102d5c49b5259538929 | /src/SingleLinePatternEditWidget.cpp | c64405011a38c443fe5b1c84cce0a12e21a9a1e3 | [
"BSD-2-Clause"
] | permissive | Ashgun/LogView | e68beefb7b5d5d5d59e1455554dabd6061894ab5 | b080153d32e8af26069228798f0e0384edbb6aa8 | refs/heads/master | 2021-07-08T16:07:24.163801 | 2019-03-22T18:06:37 | 2019-03-22T18:06:37 | 143,643,393 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,438 | cpp | SingleLinePatternEditWidget.cpp | #include "SingleLinePatternEditWidget.h"
#include <QVBoxLayout>
#include <QLabel>
SingleLinePatternEditWidget::SingleLinePatternEditWidget(QWidget *parent) : QWidget(parent)
{
gui_patternName = new QLineEdit();
gui_patternLineEdit = new LinePatternEditWidget();
gui_viewColorEdit = new ColorSelect... |
02b6fbf0e229a4669d6ee39a9acce36f1a743b28 | 50a18a5c8f9443d16fe22736fa85098f4f5c1977 | /include/glowing_indexer.h | ef178a8a25e21b209741fcdb68321a5297741917 | [
"WTFPL"
] | permissive | elsampsa/skeleton-cpp | c185676200210c2087b9d2434e4fb225d9ce534a | b698684d4a0ad8906d11fd4a38a1f87896d8ae16 | refs/heads/master | 2020-04-07T16:11:52.497882 | 2018-03-07T11:46:26 | 2018-03-07T11:46:26 | 124,221,451 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,536 | h | glowing_indexer.h | #ifndef glowing_indexer_HEADER_GUARD
#define glowing_indexer_HEADER_GUARD
/*
* glowing_indexer.h : A brief description
*
* Copyright 2018 Sampsa Riikonen
*
* Authors: Sampsa Riikonen <sampsa.riikonen@iki.fi>
*
* This file is part of the skeleton library.
*
* Skeleton is free software: you can redistribut... |
6e2d8e834dbdcea6404d2ef6bf76f33b66d55b2a | 26f9fdff3c246e3a68ff9b0bb4f8f0a9a67bce1c | /dynamic_OWSC (copy)/1.5/nut | 3ad2a1ba0c668a0697c30b9f93f0f9d6b240b1e5 | [] | 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 | 174,179 | nut | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 5.x |
... | |
ce07f302160a549ff203b74a2417269102a99ed1 | ffdc77394c5b5532b243cf3c33bd584cbdc65cb7 | /mindspore/ccsrc/pybind_api/ir/py_execute_py.h | 7e372b13d6c3cbeecf98197cadd76abd54023d48 | [
"Apache-2.0",
"LicenseRef-scancode-proprietary-license",
"MPL-1.0",
"OpenSSL",
"LGPL-3.0-only",
"LicenseRef-scancode-warranty-disclaimer",
"BSD-3-Clause-Open-MPI",
"MIT",
"MPL-2.0-no-copyleft-exception",
"NTP",
"BSD-3-Clause",
"GPL-1.0-or-later",
"0BSD",
"MPL-2.0",
"LicenseRef-scancode-f... | permissive | mindspore-ai/mindspore | ca7d5bb51a3451c2705ff2e583a740589d80393b | 54acb15d435533c815ee1bd9f6dc0b56b4d4cf83 | refs/heads/master | 2023-07-29T09:17:11.051569 | 2023-07-17T13:14:15 | 2023-07-17T13:14:15 | 239,714,835 | 4,178 | 768 | Apache-2.0 | 2023-07-26T22:31:11 | 2020-02-11T08:43:48 | C++ | UTF-8 | C++ | false | false | 10,614 | h | py_execute_py.h | /**
* Copyright 2022-2023 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicabl... |
a404017e0e3dc2b2414719a9330c4efd6307e3ae | 3d3fc6704b61e9ae0a738b51d756eb4a17dbaebf | /src/ast/timeimpl.h | 5807271fb0415e3a35c46020dd88adff1eb23908 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | JackWolfard/cash | 6704715a4bea3308dc8a4b891929b9c8fd9b7bb6 | a646c0b94d075fa424a93904b7499a0dee90ac89 | refs/heads/master | 2022-04-24T14:13:42.956529 | 2020-04-30T01:44:52 | 2020-04-30T01:44:52 | 257,402,286 | 0 | 0 | NOASSERTION | 2020-04-20T20:58:34 | 2020-04-20T20:58:33 | null | UTF-8 | C++ | false | false | 295 | h | timeimpl.h | #pragma once
#include "ioimpl.h"
namespace ch {
namespace internal {
class timeimpl : public ioimpl {
public:
lnodeimpl* clone(context* ctx, const clone_map& cloned_nodes) const override;
protected:
timeimpl(context* ctx, const source_location& sloc);
friend class context;
};
}
}
|
1b0c5fbe1ea5d8b639ee1861020996afe1fb05d0 | 534b34d9d4817ffbb3a5ded0fdbdf76e79e5cbcf | /gametable.cpp | 6cccaf49ff7caf9ef109f68e19c2c40de2925830 | [] | no_license | levongh/Game | 30a2fc259e744c3c265bbed37d1a64429970f8ea | 5e8a5fb21ce7f7474a98640292d2cdc282c67bb5 | refs/heads/master | 2020-03-23T20:25:13.584507 | 2018-09-20T06:22:23 | 2018-09-20T06:22:23 | 142,040,119 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,254 | cpp | gametable.cpp | #include <QHeaderView>
#include <QtWidgets>
#include "gametable.h"
#include "inventarItem.h"
GameTable::GameTable(QWidget* parent)
: QTableWidget(parent)
{
setRowCount(3);
setColumnCount(3);
horizontalHeader()->setVisible(false);
horizontalHeader()->setSectionResizeMode( QHeaderView::Stretch );
... |
5af3ec0d51a227a40bbc375eb76cb973507675f3 | 77cab51d8312710b22907c787b0357aef46a710a | /TwoPointers/ShortestWordDistanceII.cpp | b024aa2c884fb4132f23c335f9f2a3eb6e82008f | [] | no_license | rockieCao/LeetCodeSolution | 994b82bd62b29953fa888a8bdf6b8932093971a7 | 0a4279a78669fd0c8c56a3ea0da7452f6494f8cb | refs/heads/master | 2021-01-19T02:54:36.990712 | 2016-09-26T15:55:43 | 2016-09-26T15:55:43 | 47,871,071 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,078 | cpp | ShortestWordDistanceII.cpp | #include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
using namespace std;
/*Problem: Shortest Word Distance II
This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different parame... |
e711939d029cf21ba7a667ae4bb2fad737d6018c | faadeeebc471ddbab3912571aecef5274a956390 | /hal/hal_led.cpp | 609a8690a2e7caead13c0cf271cf387d83e289e9 | [] | no_license | kwarc93/stm32f7-cpp-tests | df465a134527d596719dc22a8dc7cab1b8d2a240 | 3f7b58476b4f0a013d1bdb23640a1d3de3a502c2 | refs/heads/master | 2023-06-06T10:40:31.773138 | 2021-06-26T14:53:40 | 2021-06-26T14:53:40 | 305,626,871 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,587 | cpp | hal_led.cpp | /*
* hal_led.cpp
*
* Created on: 25 paź 2020
* Author: kwarc
*/
#include "hal_led.hpp"
#include <cmath>
#include <functional>
using namespace hal;
// Gamma brightness lookup table <https://victornpb.github.io/gamma-table-generator>
// gamma = 2.00 steps = 256 range = 0-255
static const uint8_t gamma_lut[... |
f0ee758d71464ffff03a14a2f6e5ad01da4c14fe | bb61c1bbb179a699e1c921f7fd75fbaa12c71c22 | /object-oriented-design/jukebox.cpp | 56e706552a91cd34a1f2c7783422e198d88700e0 | [
"MIT"
] | permissive | mayankamencherla/cracking-the-coding-interview-solutions | f31457e964dc0dd2383843667020500700c0d476 | 3cccad728cd4d41154eed9e93dd0546923a23fda | refs/heads/master | 2020-03-31T21:17:18.301764 | 2018-11-26T22:33:16 | 2018-11-26T22:33:16 | 152,574,685 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 15,637 | cpp | jukebox.cpp | /**
* Design a jukebox using object oriented principles
*/
#include <iostream>
#include <vector>
#include <limits>
#include <queue>
using namespace std;
class JukeBox;
class Song;
class CD;
class CDPlayer;
class Album;
class Artist;
class PlayList;
class Artist
{
private:
/**
* Name of the ar... |
6f9aaa9940bc3fbb182f508adaa67661330c921f | 1746d2ff02cfd9544c1676a1b49006b275d7536e | /infinite-evolution-master/06_产品验收/产品包/源代码及可执行文件/infiniteEvolution/skill.h | 9666dd710f862f94a173088a376e413ba5e4925e | [] | no_license | ZifeiMo96/Infinite-evolution | c2d5af08eaf3e9118237690fb1f29033702e4d51 | 32cbd26e3d6dee94411f1d691af664ffe82771fa | refs/heads/master | 2023-01-21T15:30:42.609574 | 2020-12-05T08:25:46 | 2020-12-05T08:25:46 | 318,730,654 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | h | skill.h | #ifndef SKILL_H
#define SKILL_H
#include"prop.h"
class Skill:public Prop
{
public:
Skill();
void init(double x,double y,int skillKind,int width=40,int height=40);
bool ifUsable=0;
int skillKind; //0治疗 1抗拒光环 2腐蚀 3昏睡 4yuan形吐息 5无敌 6强化普攻
void beGot(Obj&obj);
int cdOfSkill;
int skillTime;
v... |
15a57ad58d26555e0e26e6ad9f6f70eb10f264d2 | d87b3704802173c7c9cdd53546f13854310dc153 | /tools/sim65/ByteRegister.cpp | 78eb3c7b164dde2f150272d2d000890f92bd251f | [] | no_license | tub/photokeychain | d2d6251a30435f8b04557068589edcfbec4ca8a2 | e3786dff0584557acb4a4ffb05b78e5e1f426a4d | refs/heads/master | 2020-04-09T04:29:56.662203 | 2010-02-19T21:32:16 | 2010-02-19T21:32:16 | 32,686,729 | 2 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 675 | cpp | ByteRegister.cpp | //
// ByteRegister.cpp
// Copyright © 2003 William Sheldon Simms III
//
#include <cstdio>
#include "ByteRegister.h"
ByteRegister::ByteRegister (unsigned char * rptr)
{
ptr = rptr;
num_listeners = 0;
}
unsigned char ByteRegister::Read (void)
{
return *ptr;
}
void ByteRegister::Write (unsigned char b)
{
unsig... |
f1f8eb8666f3e3316ad7acfc02a6451bf4dfdce4 | 24bbb38a2fae7182c54d2e994c5a9ef0be7e0d20 | /2014省赛模板/New folder/2013工管5班英语听力/2013210127李茜/双百/数据结构/网络流/最小费用流/poj2135.cpp | da56aa6497e5d3d10fb317cf4f3eadb9d4b48fe7 | [] | no_license | pentium3/2014-ICPC-Regional | 7bf0719fed7393d6f7f096c1a023a11ebb72c206 | 561583f8f71f7e323cf884ad4164fbd30aa6cbe6 | refs/heads/master | 2020-06-03T20:33:47.876601 | 2015-01-13T10:16:01 | 2015-01-13T10:16:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,658 | cpp | poj2135.cpp | #include "iostream"
#include "cstdio"
#include "vector"
#include "queue"
#include "cstring"
using namespace std;
const int inf=200000000;
struct edge
{
int u,v,cap,flow,cost;
};
vector<edge> Edge;
vector<int> G[1005];
bool inq[1005];
int d[1005],p[1005],a[1005];
int N,M,U,V,w;
void add(int u,int v,int cap,int cost)... |
9326db3fa97058418a6281959780bcae6d895591 | d93e2829c19ac16f745c74f7e5fd319b02a479d8 | /C++/program8.cpp | 36d1fd9fc2555a77ead07ef4fa9716115adc9c45 | [] | no_license | SrushtiDeshmukh/CPP-Programs | df4662250c6865d8d7544281fdeef0f88682671d | 16e8d3c1d5a10f4c0e0a42bd463d559988e2789b | refs/heads/main | 2023-07-10T23:42:43.352942 | 2021-08-17T07:56:27 | 2021-08-17T07:56:27 | 381,909,610 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 644 | cpp | program8.cpp | #include<iostream>
using namespace std;
//input : _ _ _Abc_ _ _pqr_ _ _A_ _AB_ _
//output:4
class StringX
{
public:
char ptr[30];
void Accept()
{
cout<<"Enter String\n";
scanf("%[^'\n']s",ptr);
}
int WordCount()
{
int iCnt=0;
char *str=ptr;
while(*str!='\0')
{
if(*str==' ')
{
while((*... |
1c1672fa2ec465f8e83dc31d4d84875c445a69e0 | 4c2b5e4619d0a3447052304a7ecd2e49f9ed462d | /assignment5/SortingLab/heapsort.cpp | 8ac5cfbdbd8ec79ed07b53225324f536d2e40291 | [] | no_license | sergeynikiforov/CS106B | 0a974db6551f5a616a1b9713dca7d45e3edef38b | a308d51cbdd10e78cceb1530e5740188398c1db6 | refs/heads/master | 2021-01-21T13:21:07.374611 | 2016-04-23T09:32:42 | 2016-04-23T09:32:42 | 51,618,951 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,078 | cpp | heapsort.cpp | //
// heapsort.cpp
// SortingLab
//
// Created by Sergey Nikiforov on 04/03/16.
// Copyright © 2016 Sergey Nikiforov. All rights reserved.
//
#include "heapsort.hpp"
#include <iostream>
using namespace std;
// set of ints compare function: compares by the set sum
bool intSetSumCmp(const set<int> &lhs, const set... |
c002f8b0d21be20d9537e1b1aa25578405e87d4a | f7389ede7c743b8ce3d174eee24ebcab316354f6 | /Software/SumoBot/Tests/AttackSensorIF_test.cpp | 9eb96e78372bc2428c340746a1671a767b410173 | [] | no_license | Solvgraa-mager/E3PRJ3 | 7e2b70775c0d8b8312bc893e0c9014fd766af9b0 | fb507b5528417459714c00b73c75378d6465af19 | refs/heads/master | 2023-01-31T11:01:30.966313 | 2020-12-18T10:28:55 | 2020-12-18T10:28:55 | 294,479,612 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 351 | cpp | AttackSensorIF_test.cpp | #include <string.h>
#include <iostream>
#include <unistd.h>
#include "AttackSensorIF.h"
using namespace std;
int main(void)
{
AttackSensorIF Sensor;
while(1)
{
cout << "getAttackStatus called. New interrupt?";
if(Sensor.getAttackStatus() == 1)
{
cout << " yes" << endl;
}
else
{
cout << " no" << endl;
}... |
48dc8e9e0cc4fbf29374249cc74302f7eac3ef3e | 1044696afb3ca6a802a7308c317878a614ffdecf | /Programme_principal/recoverers/utile.cpp | 313777fb80b2cf5cb6cbae1f8994eb3044517590 | [] | no_license | radtek/PI-Ransomware | a53e6c92db7e40054ac3b67ddbe83517b44927f6 | 77f83e06ace64a29a0f87f17d7838c5a1c31a95f | refs/heads/master | 2021-02-12T18:03:03.623901 | 2019-03-08T13:32:47 | 2019-03-08T13:32:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,370 | cpp | utile.cpp | //#include "stdafx.h"
#include "utile.h"
#include <iostream>
#include "stdlib.h"
#include <stdint.h>
#include <time.h>
#include <string.h>
#include <math.h>
string executer(string commande)
{
char iRes[1024];
string res = "";
FILE *pipe = popen(commande.c_str(), "r");
while (fgets(iRes, 1024, pipe)) ... |
3741671255267aba7bd4834df0167b56f1f01332 | 09f17137f947c8fd5d01f6d9623bc1d69a3768ca | /include/Settings.h | 001d5f33c44c0a5f36f63b9b0f1ca00babedc01f | [] | no_license | buensons/totally_not_cummc | 9a141b4d126766a30e28495dd0ce1be4e765f058 | 8ebd91bf3ace91025dcfb792eb41470446549f80 | refs/heads/main | 2023-08-05T04:41:34.531311 | 2021-08-16T20:08:56 | 2021-08-16T20:08:56 | 401,485,553 | 0 | 0 | null | 2021-08-30T21:03:35 | 2021-08-30T21:03:35 | null | UTF-8 | C++ | false | false | 4,652 | h | Settings.h | /*
* Settings.h
*
* Created on: Aug 4, 2013
* Author: psz
*/
#ifndef SETTINGS_H_
#define SETTINGS_H_
#include <stdio.h>
#include <string>
#include "../src/lib/INIReader.h"
#include "../src/lib/common.h"
class Settings {
public:
Settings();
void init();
void print(int level = 0);
bool loadFromINI(st... |
0718fb0de47957dac1308587c31d80a7b6ef1a19 | 54adc4d554dce2769103a50d0af5aa20f8200aeb | /UVA Solutions/UVA/UVA 10051.cpp | 0e2b5ed704e5ae8cffff3f63935aed793122a5b5 | [] | no_license | MoustafaHussien/UVA | d75ac2b5231edde18c493919b4c50122ab247139 | 13fddf04901a536fc4a5ed6fac9eb0541e0085cf | refs/heads/master | 2020-07-03T19:48:34.518417 | 2016-11-19T21:23:04 | 2016-11-19T21:23:04 | 74,235,468 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,436 | cpp | UVA 10051.cpp | //============================================================================
// Name : UVA.cpp
// Author : moustafa
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
... |
7627fe7cf7ced56331f06e4e7a994ca53816caf7 | 022033d4c0c029d1761779270c58d774801b6e3c | /src/bind/uio/Embind.cpp | ffb3f9d9371cade7f9fa5a98c4854460c184228c | [
"Zlib"
] | permissive | hoelzl/mud | 3ce05416b743de92c0ca21fdde42ab22b964caa9 | 426497a097970350f215575057150cb48a7240d4 | refs/heads/master | 2020-04-15T03:42:01.824151 | 2019-01-11T14:00:10 | 2019-01-11T14:00:10 | 164,357,416 | 0 | 0 | null | 2019-01-07T00:18:53 | 2019-01-07T00:18:53 | null | UTF-8 | C++ | false | false | 1,363 | cpp | Embind.cpp | #include <uio/Api.h>
#include <emscripten/bind.h>
using namespace emscripten;
EMSCRIPTEN_BINDINGS(mud_uio)
{
// Enums
enum_<mud::EditNestMode>("mud::EditNestMode")
.value("Inline", mud::EditNestMode::Inline)
.value("Modal", mud::EditNestMode::Modal)
.value("Embed", mud::EditNestMo... |
ff9eca75d9b87a485ab784cfbbde377ee24379e7 | f9e6d3a1c5dd6ff6f51aad3c75bd84a89446f0f8 | /work_SNAProj/UIScreen.h | e320b159b9423c77a8a26a3ac59d645253e6c047 | [] | no_license | Rikuya-Matsuo/SNAproj | 8966932b78e038acf076d5d64496a686e6a09c02 | d688e97914c98b652b685d1c4235a1282b7e7c3a | refs/heads/master | 2021-07-07T11:04:18.029906 | 2020-11-16T01:34:22 | 2020-11-16T01:34:22 | 221,169,099 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 983 | h | UIScreen.h | #pragma once
#include <SDL/SDL.h>
#include <string>
#include <functional>
#include "Vector.h"
class Shader;
class Texture;
class Font;
class UIScreen
{
public:
UIScreen();
virtual ~UIScreen();
virtual void Update();
virtual void Draw(Shader * shader) const;
virtual void ProcessInput(const uint8_t * keys); //入... |
d61672d1c66840b4bf95b6b078e8f93b285830b9 | 734970826c8d7909b026a0acb813fb5d45a85d6e | /test/test_config_tuple.ipp | 8e5f02c700605c0c893b590ce1c625d0d6545fa5 | [] | no_license | yak1ex/cpp_utils | 970e5ad7ce305e0d9daaae4a7c471587119317cb | dce4b04b0c73f121907ed164a0b1ada118deab90 | refs/heads/master | 2016-09-06T16:57:00.900956 | 2014-02-25T09:11:57 | 2014-02-25T09:11:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 630 | ipp | test_config_tuple.ipp | // Automatically generated file, do not edit!
#include "config.hpp"
#include <boost/type_traits/is_same.hpp>
const int yak_boost_tuple_included =
#if defined(YAK_BOOST_TUPLE_INCLUDED)
1
#else
0
#endif
;
const int yak_std_tuple_included =
#if defined(YAK_STD_TUPLE_INCLUDED)
1
#else
0
#endif
;
const int yak_use_boost_tu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.