blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 905
values | visit_date timestamp[us]date 2015-08-09 11:21:18 2023-09-06 10:45:07 | revision_date timestamp[us]date 1997-09-14 05:04:47 2023-09-17 19:19:19 | committer_date timestamp[us]date 1997-09-14 05:04:47 2023-09-06 06:22:19 | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 22
values | gha_event_created_at timestamp[us]date 2012-06-07 00:51:45 2023-09-14 21:58:39 ⌀ | gha_created_at timestamp[us]date 2008-03-27 23:40:48 2023-08-21 23:17:38 ⌀ | gha_language stringclasses 141
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 115
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d185508e37bbb5072739652e54e7a4a308fa2494 | 582fb473d12beeb612beeb4fd2e15362163868d2 | /linux.davidson.cc.nc.us/student/public/P685.CPP | 32e6fcdb65b0ef9f0ade7619583ac7c8563c1a07 | [] | no_license | fsamuels/highschool-coursework | 3bb97d39681d300296f671c4a55737e8682dfe87 | eb9fcc741941c07391906c2527d9e76daf0e5295 | refs/heads/master | 2021-01-13T11:12:35.942585 | 2017-02-08T23:59:31 | 2017-02-08T23:59:31 | 81,388,890 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 591 | cpp | // Demonstrate that one bag can be assigned to another
#include <iostream.h>
typedef int BAG_ELEMENT_TYPE;
#include "bag" // Does not have a pointer data member; vector
// defines =
void show(const bag& b)
{
for(b.first(); ! b.isDone(); b.next())
{
cout << b.currentItem() << " ";
}
cout << endl;
}
int mai... | [
"forrest@homegauge.com"
] | forrest@homegauge.com |
c78d900a37cfc360a92e761dbb01ae066c114499 | 93fbf65a76bbeb5d8e915c14e5601ae363b3057f | /Codevita 2020 round 2/MaxFunds.cpp | 0868f27603d169f4cae133c80cc73ba423052462 | [] | no_license | sauravjaiswa/Coding-Problems | fd864a7678a961a422902eef42a29218cdd2367f | cb978f90d7dcaec75af84cba05d141fdf4f243a0 | refs/heads/master | 2023-04-14T11:34:03.138424 | 2021-03-25T17:46:47 | 2021-03-25T17:46:47 | 309,085,423 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,319 | cpp | //Max Funds
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
class Graph{
lli vertices;
list<lli> *adj;
public:
Graph(lli vertices){
this->vertices=vertices;
adj=new list<lli>[vertices+1];
}
void addEdge(lli u,lli v){
adj[u].push_back(v);
adj[v].push_back(u);
}
void ... | [
"41826172+sauravjaiswa@users.noreply.github.com"
] | 41826172+sauravjaiswa@users.noreply.github.com |
e44271baef185686f8ae00eb8212281b261f8813 | ef2a556f9b79a5428a13ef65df4998c99a7240fc | /Trie.cpp | 11631708816e496206d6c0df0f38bbc0a2c17f54 | [] | no_license | ppzzyy11/codes | 451b74cc500f0741b5b2079409122cb32772b7f7 | 306852aabc2bf7bd79b37572905314e7deb46bbc | refs/heads/master | 2021-10-21T19:49:14.386026 | 2019-03-06T06:21:50 | 2019-03-06T06:21:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,747 | cpp | /*
* Trie
*
* We will implement an Trie of Alphabet
* Every word should be lower case
*
* We didnt implement delete function,but we may have zero or one or two things to do:
* 1.set the last node's isEndOfWord 0
* 2.delete the useless node
*
* so if u want to use the 2th idea to delete word in Trie. U must ma... | [
"190366758@qq.com"
] | 190366758@qq.com |
006e88b82c0a18da35fd39cc3aa8a50fa052bf87 | 87252f880b0348c58a556ab966c6c39b8945e3c5 | /28-Rand10()-using-Rand7().cpp | ba019c78b24d57d89f3bac344b2a06319d04227b | [] | no_license | lrakla/Leetcode-August-2020-Challenge | 8c8430838692a54896977ac6f480472aa06196e4 | aad7ed396e032d595bbe996002b39f516977647b | refs/heads/master | 2022-12-07T04:46:54.094116 | 2020-09-03T04:31:58 | 2020-09-03T04:31:58 | 285,034,736 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 310 | cpp | // The rand7() API is already defined for you.
// int rand7();
// @return a random integer in the range 1 to 7
class Solution {
public:
int rand10() {
int v1 = rand7(), v2= rand7();
while(v1 > 5) v1= rand7();
while(v2 ==7) v2 = rand7();
return (v2<=3)? v1 : v1+5;
}
}; | [
"raklalulua@gmail.com"
] | raklalulua@gmail.com |
a1df3f602794a7ac9f86b81678af949823b10b98 | 0a6a43b691996499230276055523eb895da6ffec | /.history/spectrum/spectrum_20190117010601.hpp | 9fd68bbd92961363afaec13478cabefd1219b335 | [] | no_license | SoundRabbit/voice-changer | 362890a6e0ef1dda37c1666b946879fc12125370 | e5a5d64426fc072504477ae30c96e8e293a07a52 | refs/heads/master | 2020-03-27T09:49:50.340212 | 2019-01-16T17:55:04 | 2019-01-16T17:55:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,024 | hpp | #include <cmath>
#include <array>
#pragma once
template<std::size_t length>
class Spectrum {
private:
class Intensity {
private:
double& r1;
double& i1;
double& r2;
double& i2;
double intensity;
Intensity() {};
public:
Intensity(double& _r1, double& _i1, d... | [
"neu1neu9neu9neu9neu@gmail.com"
] | neu1neu9neu9neu9neu@gmail.com |
c606bcd01e54b4f4c077fa38abb6d6f83250b78f | 0711b9cda47bbc6fdab2de23c483fe1c6424ff58 | /taskEightBarbershopProblem/task eight/stdafx.cpp | b309ae2c085cde88525c701c7e0fb82d2ce5c8f3 | [] | no_license | vladimirdemoshin/MultiThreadedTasks | ad00b46b95d4bda46083003d2194cb64bd2ce9f9 | 3318c007d8bca473832730c4e000735e1577f756 | refs/heads/master | 2021-05-05T21:40:04.897570 | 2017-12-28T22:28:42 | 2017-12-28T22:28:42 | 115,664,376 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 574 | cpp | // stdafx.cpp: исходный файл, содержащий только стандартные включаемые модули
// task eight.pch будет предкомпилированным заголовком
// stdafx.obj будет содержать предварительно откомпилированные сведения о типе
#include "stdafx.h"
// TODO: Установите ссылки на любые требующиеся дополнительные заголовки в файле STDAF... | [
"vladimirdemoshin@gmail.com"
] | vladimirdemoshin@gmail.com |
b6a9408ec0145fa2b006241d7f9088438389906d | f7a157df276c932cdc71595a6eecf12944532645 | /source/Library/MatrixHelper.cpp | 574b53580c0af56079d42e0f679e045e167be18e | [] | no_license | st1310/pbl19t4 | e14bb209891e87f95559b407d40023b1450c5c59 | 6199545f8f3c6a21212d8f9d68d98ca692e4d197 | refs/heads/master | 2020-05-05T11:59:34.380294 | 2019-04-22T22:44:48 | 2019-04-22T22:44:48 | 180,010,934 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,809 | cpp | #include "MatrixHelper.h"
namespace Library
{
const XMFLOAT4X4 MatrixHelper::Identity = XMFLOAT4X4(1.0f, 0.0f, 0.0f, 0.0f,
0.0f, 1.0f, 0.0f, 0.0f,
0.0f, 0.0f, 1.0f, 0.0f,
0.0f, 0.0f, 0.0f, 1.0f);
void MatrixHelper::GetForward(CXMMATRIX matrix, XMFLOAT3 &vector)
{
XMFLOAT4 m3;
XMStoreFloat4(&m3, matrix.r[... | [
"stetsenkoandrew@gmail.com"
] | stetsenkoandrew@gmail.com |
278ae478e9420517a8c690addd0d27192a670fc4 | b66490eddc44585d9e4f8c5fda33e912ea01df73 | /src/sm/log_storage.h | 0c510e7ce6890da39e35a2c6b0e245f37c4f53ad | [
"LicenseRef-scancode-mit-old-style",
"Spencer-94"
] | permissive | kevhong/zero-xum | ba411a190e22f8e23a0ff4c9292963b6493f5e07 | fd4a9a88c185cbeb1e9973ad8bf1de1e71ceab02 | refs/heads/master | 2021-01-11T10:18:09.599458 | 2016-11-16T06:17:24 | 2016-11-16T06:17:24 | 72,508,269 | 1 | 0 | null | 2016-11-01T05:58:54 | 2016-11-01T05:58:54 | null | UTF-8 | C++ | false | false | 4,452 | h | /*
* (c) Copyright 2011-2014, Hewlett-Packard Development Company, LP
*/
/* -*- mode:C++; c-basic-offset:4 -*-
Shore-MT -- Multi-threaded port of the SHORE storage manager
Copyright (c) 2007-2009
Data Intensive Applications and Systems Labaratory (DIAS)
Ecole Polytec... | [
"csauer@cs.uni-kl.de"
] | csauer@cs.uni-kl.de |
275e88315754cbfa9100b3b0d30436badef96be3 | 40ba4b682862a4b2894ccf4f418ba1b138ba2ad3 | /framework/plugins/renderable/IRenderable.cpp | 9a4951fd939bb461bdc182571714f991c18a2759 | [] | no_license | tj10200/game | fd8f3043e1aa3a869b9e9b0739c7f6c0941581ab | 77102812c32c4f6b507b7aa19bd72b59b9aff7e5 | refs/heads/master | 2021-01-19T03:24:14.826798 | 2015-11-30T14:21:24 | 2015-11-30T14:21:24 | 28,565,096 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,630 | cpp | #include "IRenderable.h"
#include "json/json.h"
#include <fstream>
namespace framework
{
std::string IRenderable::ms_shaderDir = "";
//-----------------------------------------------------------------------//
IRenderable::IRenderable ( const char* ap_name,
const uint16_t a_i... | [
"tjjohnson10200@gmail.com"
] | tjjohnson10200@gmail.com |
25fae3e1600347df54b382d479b7b38171e78bc8 | 4f2dd8732d674a80208b37b04730785a3dd093a5 | /up.cc | 78e4a9886ba800afe8ee595af98737897374b32f | [] | no_license | grasingerm/PL | 5fa05b1147e8a51cc1144ec392adf3b260fbb9fd | c271d3d4135f3b1dec28cdabbb4298c77a981c5f | refs/heads/master | 2022-11-10T23:05:48.931924 | 2022-09-26T03:58:43 | 2022-09-26T03:58:43 | 21,368,370 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 206 | cc | #include <memory>
#include <iostream>
using namespace std;
int main()
{
unique_ptr<double> up(nullptr);
if (up) cout << "Evaluates to true?\n";
else cout << "Evaluates to false.\n";
return 0;
}
| [
"grasingerm@gmail.com"
] | grasingerm@gmail.com |
472f77525c3a0db173c710da7342cce7fd463f71 | 28586377811c2a054dbaf85d54c5b1674a13e528 | /libraries/glm/glm/gtx/handed_coordinate_space.inc | 722fa7caf569596b8f3e0d392ec04ef364bebaad | [
"LicenseRef-scancode-warranty-disclaimer",
"LicenseRef-scancode-happy-bunny",
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | robertsdionne/wheels | be0745ead9c6ffca5be64e64f5ce1fb49c74ed18 | aed2942a05372db8b676ec84d8b218b705c652bd | refs/heads/master | 2020-04-13T16:19:11.058747 | 2016-01-21T04:08:14 | 2016-01-21T04:08:14 | 50,081,405 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,209 | inc | ///////////////////////////////////////////////////////////////////////////////////
/// OpenGL Mathematics (glm.g-truc.net)
///
/// Copyright (c) 2005 - 2015 G-Truc Creation (www.g-truc.net)
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documen... | [
"robertsdionne@gmail.com"
] | robertsdionne@gmail.com |
9cb6f91f82aeda0b51ef29aab04776f7c329afd5 | 0eb999539710945d6e11ba406f298cf1f937685f | /Generators/GenerateDenseMatrix.h | 60d77f3b1a3ab33848d44a6852603d6d1f1bf630 | [] | no_license | lubitelpospat/SOLASolvers | 9feef1b4dfddf3f749e03fe8f1784248f99c1bfd | 91d28b5afa4e13b2f9b9fda4329b2a36b7b71a12 | refs/heads/master | 2023-03-18T17:53:07.126843 | 2021-03-07T12:35:39 | 2021-03-07T12:35:39 | 342,952,568 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 540 | h | //
// Created by alex on 04.03.2021.
//
#ifndef SOLASOLVERS_GENERATEDENSEMATRIX_H
#define SOLASOLVERS_GENERATEDENSEMATRIX_H
template<typename T>
std::set<Triplet<T>> GenerateSquareDenseMatrix(const size_t& size, const int& min, const int& max) {
srand(time(0));
std::set<Triplet<T>> result;
for (size_t i=... | [
"sizykh.ad@phystech.edu"
] | sizykh.ad@phystech.edu |
9bc473a2c31103c2b31a84516e9ebb2305803d5d | 905caede2a6759edd20a94282b6631051897911b | /include/Simulation.h | c362a4bd1b66739f115a75902392d8f0a670bc7f | [] | no_license | dan-heaton/Agent_Survival_Simulation | 4303c1b83949d95dc2a961ff456d0df4ed9a5405 | 35674e6e15c6103e69b33ad4634ef55e1246c1c0 | refs/heads/main | 2023-03-10T19:51:08.902565 | 2021-02-28T22:41:00 | 2021-02-28T22:41:00 | 329,189,929 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 998 | h | #ifndef SIMULATION_H
#define SIMULATION_H
#include <vector>
#include <string>
#include "../include/BasicEnvironment.h"
using namespace std;
class Simulation {
private:
int time_delay;
int time_steps;
int x_bound;
int y_bound;
int min_energy_to_replicate;
int max_e... | [
"dheaton815@gmail.com"
] | dheaton815@gmail.com |
fab0066574b9a40fefa85bc1503ef9410fc685a6 | e653287ff8cebe2220106d7d9e8535571c26caae | /exercises/miminalTree.cpp | 3929fa49fd41e0616b027c0587d4fa3a9e400130 | [
"MIT"
] | permissive | andrelrg/cppexercises | 85c57100eb55307deb86f9da331657290c963d43 | 3a12b6a7ac51d75ea973fe77237a81b7a0c08261 | refs/heads/master | 2022-06-12T14:43:28.477844 | 2020-05-06T13:49:43 | 2020-05-06T13:49:43 | 258,827,735 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,186 | cpp | //4.2
// Minimal Tree: Given a sorted (increasing order) array with unique integer
//elements, write an algo- rithm to create a binary search tree with minimal height.
#include <iostream>
#include <stdio.h>
typedef struct node {
node *left, *right;
int value;
} Node;
Node *newNode(int value){
Node *n = ... | [
"agaspar@esapiens.com.br"
] | agaspar@esapiens.com.br |
81b7faa98000d793a4f7c51e9fc59eb44d04ec9f | 7bb793c39d512bc3490608ec028c06677fdd7b05 | /hrdesktop/common/3rdParty/src/http/httpclient/proxy_socket.h | 19df41921ed7adefe1b8e2d580f286d00db50d88 | [
"MIT",
"BSD-2-Clause"
] | permissive | rineishou/highwayns_rin | 11564fc667633720db50f31ff9baf7654ceaac3f | dfade9705a95a41f44a7c921c94bd3b9e7a1e360 | refs/heads/master | 2021-06-17T23:06:29.082403 | 2018-12-17T12:13:09 | 2018-12-17T12:13:09 | 88,716,361 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,150 | h | /**
* @file proxy_socket.h
* @brief 支持代理的Socket类
* @author xiangwangfeng <xiangwangfeng@gmail.com>
* @data 2011-4-23
* @website www.xiangwangfeng.com
*/
#pragma once
#include <string>
#include "proxy_config.h"
#include "streaming_socket.h"
NAMESPACE_BEGIN(Http)
//支持代理的Socket类封装
class HTTP_CLASS ProxySoc... | [
"tei952@hotmail.com"
] | tei952@hotmail.com |
6eb230bc4b6a50f786bb32475fa30b370bb9f968 | 02f83d523e82c49c64e36d4d6e1e04d96688299c | /src/algorithms/pc_vec/test/point_cloud_vectorization_test.cpp | 8ae488b836c0f30e095c30fe93c091bc0eaacdb6 | [] | no_license | TexnoMann/robotics_math | 8d0f4bcb751698432d9e61b05ae989e83198133c | 88b7afd34c6f9811fc5442d88a866571b93ef918 | refs/heads/master | 2021-06-21T23:27:41.641818 | 2020-07-14T14:41:33 | 2020-07-14T14:41:33 | 254,506,974 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,704 | cpp | #include "../pointcloud_vectorize.h"
#include <iostream>
#include <fstream>
#include <string>
#include "../../../../matplotlibcpp/matplotlibcpp.h"
namespace plt = matplotlibcpp;
float get_uniform_rand_float(float min, float max);
int main(int argc , char *argv[]) {
std::cout << "Start linear tls fit test\n";
... | [
"electrodans@yandex.ru"
] | electrodans@yandex.ru |
49a68218f0cc18ed558919ed625ec8eb986890a5 | b9115b524856b1595a21004603ce52bc25440515 | /simple-VN/header_files/TSingleton.hpp | 96ba752e49ad1247ea7ce2e6436a1feba1da0bd1 | [] | no_license | martu/simple-VN | 74a3146b3f03d1684fa4533ba58b88c7bb61057c | ed175b8228433d942a62eb8229150326c831bbd7 | refs/heads/master | 2021-01-10T18:46:04.218361 | 2010-10-11T23:09:53 | 2010-10-11T23:09:53 | 962,351 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,404 | hpp | /*
* TSingleton.hpp
*
* Created on: 20.07.2010
* Author: Martu
*/
#ifndef TSINGLETON_HPP_
#define TSINGLETON_HPP_
template <class T>
class TSingleton
{
protected: // protected da andere klassen von dieser erben sollen
// Membervariablen
static T *m_psingleton; // static weil wir nur ... | [
"martu_xd@gmx.de"
] | martu_xd@gmx.de |
561123bf0e6b4b538b0218191e3903b206d09f0e | cf8e0d582ccf83e5cb0dca7c621e98eefcd6ca39 | /MFCDlgWithTabctrlOPTMatn/ElectricModelingDLGMoreThermal.h | 59a60d373e9438b5ddb6cbe98d7fa624c38c161c | [] | no_license | yeehlin/PMP | 437e9aeff25387c49c265315e4aafde87b3b8722 | b156b2e64299ebee656a76c18fb646fd28489a97 | refs/heads/master | 2021-01-10T01:06:11.438419 | 2015-10-20T13:49:45 | 2015-10-20T13:49:45 | 44,536,551 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,048 | h | #pragma once
#include "ElectricModelingDLGThermal.h"
// ElectricModelingDLGMoreThermal dialog
class ElectricModelingDLGMoreThermal : public CDialog
{
DECLARE_DYNAMIC(ElectricModelingDLGMoreThermal)
public:
ElectricModelingDLGMoreThermal(CWnd* pParent = NULL); // standard constructor
virtual ~Electr... | [
"1206368661@qq.com"
] | 1206368661@qq.com |
3697b2daabf540da8c5623bca143110cbd45e739 | 91a882547e393d4c4946a6c2c99186b5f72122dd | /Source/XPSP1/NT/inetsrv/msmq/src/lib/xds/lib/xds.cpp | 18a3d7b028d254fa79e1999f39a74a02a86b9706 | [] | no_license | IAmAnubhavSaini/cryptoAlgorithm-nt5src | 94f9b46f101b983954ac6e453d0cf8d02aa76fc7 | d9e1cdeec650b9d6d3ce63f9f0abe50dabfaf9e2 | refs/heads/master | 2023-09-02T10:14:14.795579 | 2021-11-20T13:47:06 | 2021-11-20T13:47:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,718 | cpp | /*++
Copyright (c) 1995-2000 Microsoft Corporation
Module Name:
xds.cpp
Abstract:
Xml digital signature functions
Author:
Ilan Herbst (ilanh) 28-Feb-00
Environment:
Platform-independent,
--*/
#include <libpch.h>
#include <Xds.h>
#include "Xdsp.h"
#include <utf8.h>
#include "xds.tmh"
LPSTR
Xds... | [
"support@cryptoalgo.cf"
] | support@cryptoalgo.cf |
9ba7d7afa620b2e65a3b24f3174c222b2a3c54c4 | fe3d0999a411422fdc5ae8ab5631a5c170d1d962 | /acm/shuoj/1123.cpp | 943d16ffc5d3990e49186aedac7d1f4abcdc264a | [
"MIT"
] | permissive | randoruf/cpp | 7063feb1ea72d59902c5ad1b5f82ed161125a593 | c28bdb79ecb86f44a92971ac259910546dba29a7 | refs/heads/master | 2023-03-18T11:28:24.573297 | 2016-08-01T17:56:29 | 2016-08-01T17:56:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 257 | cpp |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
n = 200000;
cout<<0;
for(long long i = 1;i<=200000;i++){
int n = (long long)log10(i);
n = (long long)pow(10,n+1);
//cout<<i<<" "<<n<<endl;;
if(i*i%n == i)cout<<" "<<i;
}
}
| [
"[18717899732@163.com]"
] | [18717899732@163.com] |
bed276d1041f59b4d2f92b21f52e2332164b1570 | 05670bf2371418fdfd98fbc12e67464f48d47b63 | /FTLPOO/maquinas.h | d2c56d0f955b094706b0852195a51b7440f36ef2 | [] | no_license | NunoRCurado/FTLPOO | 41856a9899c23a97fc1f2c931c2c4d535e19a6a1 | 3efd2f6a9ec77e320741aa149679b61845d1327f | refs/heads/master | 2016-08-12T15:40:52.185920 | 2015-12-26T23:57:16 | 2015-12-26T23:57:16 | 48,623,319 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 234 | h | #pragma once
#ifndef MAQUINAS_H
#define MAQUINAS_H
#include <iostream>
#include <string>
#include <vector>
#include "sala.h"
using namespace std;
class maquinas: public sala{
public:
maquinas();
virtual getIntegridade
};
#endif | [
"adrielpt91@gmail.com"
] | adrielpt91@gmail.com |
fa0cd3688f77e9a72abe1870c6ccb7450521027c | b334dcacfd6936429390ac922515b101b78a95d6 | /Libs/GridM.h | 7b2eff7a2fe95b64fa87804e894203268bec3cea | [] | no_license | mrinmoysarkar/IRC2014 | 800a7e4622efe6fd8cbf835c797b63e12d4a94b1 | 2070fdf166feccef3a6ad0ea03b6b5237beb7a5f | refs/heads/master | 2020-05-23T09:07:21.792697 | 2017-01-30T15:25:55 | 2017-01-30T15:25:55 | 80,433,397 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,034 | h | #ifndef GridM_h
#define GridM_h
#include "Arduino.h"
#ifndef len_of_int
#define len_of int 100
#endif
typedef struct
{
boolean left;
boolean right;
boolean up;
boolean down;
}
vertice;
typedef struct
{
int name;
vertice path;
}
node;
class GridM
{
public:
GridM(int row ,int... | [
"mrinmoy.pol@gmail.com"
] | mrinmoy.pol@gmail.com |
79f374e354f6df1b050aa74efd677ad9070d587a | 05bfb1626df055475a18d28bc99bb9c34064157f | /Test/include/Elements/TBTK/Test/Atom.h | 68ed9641b90d9713081a78312fd31c8f5ffdd2b8 | [
"Apache-2.0",
"MIT",
"BSL-1.0"
] | permissive | undisputed-seraphim/TBTK | 8366351c2cae1f0c07647785afa0c64a72292740 | 45a0875a11da951f900b6fd5e0773ccdf8462915 | refs/heads/master | 2022-01-25T11:17:13.581537 | 2021-06-19T10:32:49 | 2021-06-19T10:32:49 | 126,213,024 | 0 | 0 | null | 2018-03-21T17:01:57 | 2018-03-21T17:01:57 | null | UTF-8 | C++ | false | false | 166 | h | #include "TBTK/Atom.h"
#include "gtest/gtest.h"
namespace TBTK{
//TBTKFeature Elements.Atom.construction.0 2020-07-05
TEST(Atom, construction0){
Atom atom;
}
};
| [
"dafer45@hotmail.com"
] | dafer45@hotmail.com |
8b406a3b8bc2f8e9d93094a562ae3748fdb554c7 | c30cff1935d73d2fce146cde0590d82e1837f80f | /RougeLike/Source/Debug/MemTrack.cpp | 5381d32cd6f73be347a450ca47c8ee55fe8649f3 | [] | no_license | SamanGharatchorlou/RougeLike | e0fb743ec26278a0c115919b59b91c7b1f81438b | f9dbe76d48a1d832b3e525807557f61c81ef12a9 | refs/heads/master | 2021-07-02T05:42:03.232194 | 2021-06-17T14:14:09 | 2021-06-17T14:14:09 | 240,692,319 | 2 | 0 | null | 2020-02-15T12:40:49 | 2020-02-15T11:02:53 | C++ | UTF-8 | C++ | false | false | 19,197 | cpp | #include "pch.h"
#if MEMORY_TRACKING
/*
Copyright (c) 2002, 2008 Curtis Bartley
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright
notice, t... | [
"samangharat@gmail.com"
] | samangharat@gmail.com |
df37ac05788a7559e54a95bb764cb70d93a900a0 | 0a674caa5afd13fe2118acb843af1b0c9619fc54 | /15w_air/assignment09/include/city.hpp | 1ab6b57e6c0e8bab6dbc0524748357001100a793 | [] | no_license | minhnh/hbrs_courses | 8c70afaed4ef302d41b0c1e2bba59f506ea299e3 | f93bf54888bd9e82edddfe46dfd6ee563aab4cf8 | refs/heads/master | 2021-01-09T05:12:35.030316 | 2019-02-27T20:33:09 | 2019-02-27T20:33:09 | 56,776,169 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 625 | hpp | /*
* city.h
*
* Created on: Nov 20, 2015
* Author: elhe
*/
#ifndef _ASSIGNMENT09_CITY_H_
#define _ASSIGNMENT09_CITY_H_
using namespace std;
class City {
private:
float x;
float y;
float deadline;
float dist_from_start;
float arrival_time = -1.0f;
public:
... | [
"minhnh.91@gmail.com"
] | minhnh.91@gmail.com |
af16b5a0bf24cc03c0d892e4aa56f9dba31e68f4 | c11da72ede8450aad6767eb5d9d6b00cace13042 | /wasm/libs/protobuf/src/google/protobuf/compiler/csharp/csharp_field_base.cc | e2011b76ca282d64acc9f384f7531ff4a459c915 | [
"MIT"
] | permissive | mendix/virocore | 192d1e79f5b5d36d920a4608939843c3e808c2d4 | fd3cf5ac4222bb48a5b3af984f0c428ea316d762 | refs/heads/master | 2023-02-17T17:25:58.449812 | 2021-01-06T17:23:28 | 2021-01-06T17:23:28 | 258,201,318 | 1 | 2 | MIT | 2021-01-06T17:28:07 | 2020-04-23T12:54:36 | C++ | UTF-8 | C++ | false | false | 15,580 | cc | // Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// ... | [
"radvani@viromedia.com"
] | radvani@viromedia.com |
429991fe6b439f06dee9ea623802fd908034749f | 4750fe54a18eac014c58cd581a9994b040e35d66 | /src/index/base.h | e07511a5f66921248012eaa5aa169c645a813ad2 | [
"MIT"
] | permissive | bitcoin-rush/bitcoinrush | b326b5c6a9efd68fac35d008df5363cf49931090 | 4329a6a7b9ce7a2188225f4abfc307e68de7dae0 | refs/heads/master | 2020-06-07T06:02:13.111203 | 2019-06-21T12:04:04 | 2019-06-21T12:04:04 | 192,943,402 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,618 | h | // Copyright (c) 2017-2018 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef BITCOINRUSH_INDEX_BASE_H
#define BITCOINRUSH_INDEX_BASE_H
#include <dbwrapper.h>
#include <primitives/block.h>
#incl... | [
"yasinaktimur@gmail.com"
] | yasinaktimur@gmail.com |
201b72b0a7644608af287c0be226a78221bd3bdc | 71a4873f518f035333734d36299e3ba4356679ef | /SOURCE/DRAWSBrain.cpp | 6e84aaad65170a30a896255283b92d4db6eefb7a | [
"BSD-3-Clause"
] | permissive | GhengopelALPHA/Evagents | e31fef8421838c127953c21b6c1e4b1436cb42d4 | c51cbfcf57f69fc06757901767340635c98b6f74 | refs/heads/master | 2022-12-27T10:43:17.365234 | 2022-02-27T05:18:51 | 2022-02-27T05:18:51 | 77,200,753 | 25 | 7 | null | 2022-02-27T05:18:52 | 2016-12-23T05:39:24 | C++ | UTF-8 | C++ | false | false | 12,500 | cpp | #include "DRAWSBrain.h"
using namespace std;
DRAWSBox::DRAWSBox(int maxid)
{
w.resize(CONNS,0);
id.resize(CONNS,0);
type.resize(CONNS,0);
//constructor
for (int i=0;i<CONNS;i++) {
if(randf(0,1)<conf::BRAIN_DEADCONNS) w[i]=0; //we want to simulate brain development over time, so set some conns to zero weight
... | [
"julian.hershey@gmail.com"
] | julian.hershey@gmail.com |
a1994ce11f101b1625dba54b4371fc18341b9288 | e59e10bada977fce3ae26c851cea35709c58e080 | /A-Set/785A_AntonAndPolyhedrons.cpp | 4d5e01b95e56b738ec89a2ca0d03affac33b838b | [] | no_license | rubengp39/CodeForces | de1d6512b6253b7d6f336ce2309b63ea5b39f8d8 | 4ea21c076bf96ca8fb975df4a3354a4396ec286d | refs/heads/main | 2023-08-19T00:09:48.335497 | 2021-09-23T16:26:36 | 2021-09-23T16:26:36 | 395,106,048 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 389 | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const int INFINITE = 10000000;
int main()
{
map<string, int> map {{"Tetrahedron", 4}, {"Cube", 6}, {"Octahedron", 8}, {"Dodecahedron", 12}, {"Icosahedron", 20}};
int n, sum = 0;
string str;
cin >> n;
for (int i = 0; i < n; ... | [
"62309228+rubengp39@users.noreply.github.com"
] | 62309228+rubengp39@users.noreply.github.com |
9210355f009c43b9b9fccd19afb90862764c8d25 | 65616981bb41c90258b0070e3003463ebcb77e8e | /src/World.h | 5c7d6718cddc08c66d4cfc5ddb8f2015a43ee877 | [
"MIT"
] | permissive | eaymerich/cateye | a3c462ac43a93ec4f9103827a443faf7de196812 | 8939a9cca3f3e4e04ec9e7ed7da60e3d4a5acb51 | refs/heads/master | 2022-06-06T09:31:32.744994 | 2020-04-30T21:57:11 | 2020-04-30T21:57:11 | 260,301,593 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 673 | h | /*****************************************************************************
* File: World.h
* Author: Edward Aymerich Sanchez
* Year: 2020
*****************************************************************************/
#ifndef __WORLD_H__
#define __WORLD_H__
#include <vector>
#include "LightSource.h"
#include "... | [
"edward.aymerich@gmail.com"
] | edward.aymerich@gmail.com |
dd183a5f4807f16522d52ba7f3b1d8ad9b054bc2 | 9eaf679a99a88ccf42920fe7076856398b095402 | /Server/MaJiangServer/src/XLRoomStateAskForRobotGang.h | 59c4ff9787fccf73d278a43d26fafaae89ad3fc0 | [] | no_license | daxingyou/MJ | 1fce631d11c14a2d08928260704a6c359bcca12b | 4fdfc39d710562cf6e493292c5e4afc967866a40 | refs/heads/master | 2021-06-18T19:18:08.864754 | 2017-07-11T10:05:56 | 2017-07-11T10:05:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,596 | h | #include "MJRoomStateAskForRobotGang.h"
class XLRoomStateAskForRobotGang
:public MJRoomStateAskForRobotGang
{
public:
void enterState(IMJRoom* pmjRoom, Json::Value& jsTranData)override
{
MJRoomStateAskForRobotGang::enterState(pmjRoom, jsTranData);
// check if have already hu player ?
std::vector<uint8... | [
"dengh_dhsea@126.com"
] | dengh_dhsea@126.com |
4c83f8ea5363d625e160c9b7a0b9ff00b20d8417 | 88ea0d57c64cc0400e9ffe37303c58cd68e365dc | /studioDemo/Classes/HelloWorldScene.cpp | b575236817b7fb1378bc4e21cb73a25757cc764b | [] | no_license | BellyABC123/CocostudioDemo | f5c666b207a136a67dae2d557529e88e04aac008 | c10c6afe0e59e9187a652080df45b54485ac4a7d | refs/heads/master | 2021-05-27T16:38:38.690838 | 2013-09-23T07:29:29 | 2013-09-23T07:29:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,731 | cpp | #include "HelloWorldScene.h"
#include "SceneManager.h"
USING_NS_CC;
CCScene* HelloWorld::scene()
{
// 'scene' is an autorelease object
CCScene *scene = CCScene::create();
// 'layer' is an autorelease object
HelloWorld *layer = HelloWorld::create();
// add layer as a child to scene
scene-... | [
"shujun.qiao@chukong-inc.com"
] | shujun.qiao@chukong-inc.com |
8b15d4f020c51e6b5b35364c6340a5825b947074 | 43a2fbc77f5cea2487c05c7679a30e15db9a3a50 | /Cpp/External/SDK/BP_male_makeup_black_04_Desc_classes.h | 66b9b1fa3aa8b3312521801279af43c30c31667a | [] | no_license | zH4x/SoT-Insider-SDK | 57e2e05ede34ca1fd90fc5904cf7a79f0259085c | 6bff738a1b701c34656546e333b7e59c98c63ad7 | refs/heads/main | 2023-06-09T23:10:32.929216 | 2021-07-07T01:34:27 | 2021-07-07T01:34:27 | 383,638,719 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 836 | h | #pragma once
// Name: SoT-Insider, Version: 1.102.2382.0
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Classes
//-----------------------------------------------... | [
"Massimo.linker@gmail.com"
] | Massimo.linker@gmail.com |
a39d5b3896efc8fb22d54fd6a6f3515f385456b4 | 514e53d25623da6f29dc9b95eb5d3f9a74e6b52c | /docs/examples/IRect_041.cpp | 901d569824aeec29a7131edd33d3559c5fe10a98 | [
"BSD-3-Clause"
] | permissive | xiaofei2ivan/skia | f7230aa17f7f1cf11420a3c3d355ee8955794917 | d95286de1dda8c1c0403de22151e1b2a9b7ddf96 | refs/heads/master | 2021-10-22T11:59:22.331872 | 2019-03-16T22:05:45 | 2019-03-16T23:04:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 530 | cpp | // Copyright 2019 Google LLC.
// Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.
#include "fiddle/examples.h"
// HASH=d35fbc9fdea71df8b8a12fd3da50d11c
REG_FIDDLE(IRect_041, 256, 256, true, 0) {
void draw(SkCanvas* canvas) {
SkIRect result;
if (result.intersectNo... | [
"halcanary@google.com"
] | halcanary@google.com |
0aadffa641cb010a46b0003574de63cebb273c76 | 3d02ed7a5284410a10e2ff254d6c00d7067a4822 | /AICard/CardClient/DeskBusi.cpp | 4e177a94bcf3918fb080dc449ef5aead37cea055 | [] | no_license | lilien1010/mycode | 1a1795999906581aec460b5224d9d6d7e8278b88 | 822f0445ab9ddceffb7d2d8454aa07224301545a | refs/heads/master | 2020-12-24T13:52:27.136900 | 2014-01-17T02:07:43 | 2014-01-17T02:07:43 | 14,484,960 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,748 | cpp | #include "StdAfx.h"
#include "DeskBusi.h"
DeskBusi::DeskBusi(void)
{
memset(m_infoList,0,LOG_MAX_DESCRIPTION_SIZE);
m_EmptySeatNum = m_AllowedPlayerNum = 4;
//m_hWnd->unused = 0;
m_bJoinable = TRUE;
m_Player[0].m_CanHoldCardNum = WINNER_CARD_NUM; //设置第一个入场的玩家为庄家
InitDesk();
DistrubueCard(m_Allow... | [
"38617665@qq.com"
] | 38617665@qq.com |
52c1e75065785a05eaecf65e9edddb1bb2f25c75 | 8c1f1c1f90fc8312b6e02e7232115aa3af26fd90 | /examples/ex02/ex02opengl.cpp | 71b92e148dec988cadf6924f1e7423f335833372 | [] | no_license | kagr7595/csci5239 | b672991da149efa16283d1e718bafc9d4ea2458e | d4d703150d56d6fbf250bd036d0e3baf7ad4260e | refs/heads/master | 2020-12-20T02:37:06.175399 | 2020-04-29T10:18:31 | 2020-04-29T10:18:31 | 235,935,022 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,782 | cpp | //
// OpenGL widget
//
#include "ex02opengl.h"
#include <QtOpenGL>
#include <QMessageBox>
#include "Cube.h"
#include "Icosahedron.h"
#include "WaveOBJ.h"
#include "Teapot.h"
#include <math.h>
#define Cos(th) cos(M_PI/180*(th))
#define Sin(th) sin(M_PI/180*(th))
//
// Constructor
//
Ex02opengl::Ex02opengl(QWidget* pa... | [
"kagr7595@colorado.edu"
] | kagr7595@colorado.edu |
2705355f8a5e7ac3fa1dec4ae3bf4a521973d82c | 3fe0d6114e8d0f63e94e4a528336bb2406da849d | /branches/CasADiUpdate/ModelicaCasADiInterface/src/SharedNode.hpp | ec8d9461133f0f6a296f2298dfe59a02e0e9f191 | [] | no_license | GYskyfall/jmodelica | 48bd08158566dc279fa5fb0c21f72b0f6355d2b4 | 21db9a4f9c1f558f7a67b747089d7bfec6e6a945 | refs/heads/master | 2020-12-11T22:15:08.092890 | 2019-01-18T15:17:34 | 2019-01-18T15:17:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,520 | hpp | /*
Copyright (C) 2013 Modelon AB
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, version 3 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; w... | [
"santiago@7ae51c65-13d5-4921-9d80-6511ddd1419c"
] | santiago@7ae51c65-13d5-4921-9d80-6511ddd1419c |
4574e7ae209c216088e988c97dede1a20dfc95ac | ca57d57bec37faeb57899a80df5b4d267a536ac5 | /test/feature/light_test.cpp | 6354bec0f047831487296bfa67eb61922235a733 | [
"BSD-3-Clause"
] | permissive | fuersten/sun_ray | ed875b2a5a2c0f9fd8bfb7321921b1b70c205a3a | b882d67cd9747f61b50def4c1414e7552ba917c0 | refs/heads/main | 2023-04-17T04:08:18.860499 | 2021-04-27T10:15:50 | 2021-04-27T10:15:50 | 335,270,596 | 2 | 0 | BSD-3-Clause | 2021-04-27T10:03:57 | 2021-02-02T11:46:17 | C++ | UTF-8 | C++ | false | false | 836 | cpp | //
// light_test.cpp
// sun_ray_test
//
// Created by Lars-Christian Fürstenberg on 12.01.20.
// Copyright © 2020 Lars-Christian Fürstenberg. All rights reserved.
//
#include <sun_ray/feature/light.h>
#include <sstream>
#include <catch2/catch.hpp>
TEST_CASE("create lights", "[lights]")
{
SECTION("create ligh... | [
"lcf@miztli.de"
] | lcf@miztli.de |
5b3fb1831892cc5e444b0eed5f02313381084aa2 | 93c04cc0928cfbd67b6bd0bc9c7e5b0b58c1b86b | /SystemCode/binder_test/common/IAddService.cpp | 8c30c0622431b348e27e157f1eb1364c3bf47dde | [] | no_license | wangjunyan/android | 21076e31cbe856b87ed2c49cf862a6248fb73189 | e97907adcdab2570096152c7e1b644019313e166 | refs/heads/master | 2020-04-05T23:47:37.269473 | 2019-05-21T02:02:59 | 2019-05-21T02:02:59 | 27,423,646 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,729 | cpp | #define LOG_TAG "example.wjy.AddService"
#include<utils/Log.h>
#include"IAddService.h"
using namespace android;
enum
{
OP_ADD = IBinder::FIRST_CALL_TRANSACTION,
OP_MUL
};
class BpAddService : public BpInterface<IAddService>
{
public:
BpAddService(const sp<IBinder>& impl) : BpInterface<IAddService>(impl)
{
}
... | [
"wangjunyan1984@gmail.com"
] | wangjunyan1984@gmail.com |
39fca24e28b1ad5aea0001c0baf9d43f9e10547a | 7ba02eec3decc76f001ae6d2b6d285026d861f0c | /Codeforces/Round639/3.cpp | 3edd0c3be626ae15b162a2bc4c9e7e981a27cdad | [] | no_license | CubixPro/Transfer | a9cd298774380d3811f570c151e8d4b4b8324824 | 86a971b42c1fe84a9480de65703f27871aec2ce0 | refs/heads/master | 2020-06-23T02:32:17.236328 | 2020-06-07T06:23:28 | 2020-06-07T06:23:28 | 198,478,443 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 679 | cpp | #include <bits/stdc++.h>
#include <cmath>
#define lld long long int
#define llf long long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define cases \
lld T = 0; \
cin >> T; \
while (T--)
#define pb push_... | [
"titir.adhikary@hotmail.com"
] | titir.adhikary@hotmail.com |
cc1b928a8e2ed9a390d47cbefd729b28b99555f7 | c0b4145ee2ebd7e20ea44316ede9dc7b97ffd48a | /_interfaces/IRenderable.h | dd6f80a33b91bab3edf0fa702ffec9fd62a2d05c | [] | no_license | TheMrIron2/spelunky-psp | 1b6f962c71bc342a962901ac69ab7b35bef6c9be | 9139dc894763770ec60ac0be2f7ef3b5d25a8ac2 | refs/heads/master | 2020-06-13T17:19:31.214220 | 2019-07-02T16:30:21 | 2019-07-02T16:30:21 | 194,729,555 | 0 | 0 | null | 2019-07-01T19:10:26 | 2019-07-01T19:10:26 | null | UTF-8 | C++ | false | false | 1,894 | h | //
// Created by xdbeef on 29.12.18.
//
#ifndef SPELUNKYDS_IRENDERABLE_H
#define SPELUNKYDS_IRENDERABLE_H
#include <nds.h>
#include "../../memory/SpritesheetType.hpp"
#include "IBase.h"
// Renderable provides fields neccesary to render graphic on screen, which are:
// * xy position
// * sprite width/height
// * spr... | [
"daniel.zalega@gmail.com"
] | daniel.zalega@gmail.com |
d7cf5486fe0054e696a17f585d174fe087dfc1a5 | 0ca7c9c0abef4c86f0ba46d6d1806ba20435a728 | /strings/palindromic_tree.cpp | 79712b0938ccf72cabb88f7d527e632af19f2475 | [] | no_license | SPbSU3/algorithms | 118ac5bd8993122dec51848d6a03151e64e4ac0c | 395fe7879e35d914aa6844daabe06fbae56fe9f3 | refs/heads/master | 2021-03-31T02:00:27.013541 | 2018-11-23T19:37:44 | 2018-11-23T19:37:44 | 124,572,940 | 5 | 1 | null | 2018-04-06T13:16:42 | 2018-03-09T17:34:39 | C++ | UTF-8 | C++ | false | false | 5,717 | cpp | #include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <memory.h>
#include <cassert>
#include <tuple>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define ford(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define all(c) (c).begin(), (c).end()
#define sz(c) int... | [
"savchenkov@adorable.ai"
] | savchenkov@adorable.ai |
8aad92cc24acbe3dea4b78c271d5fb6a8c8427e3 | 6b93316ef521085a23bc9b6013625fd99d373c7a | /Arrays/firstmissing.cpp | d2307c536efee758889092ae2388d968fd7a8af1 | [] | no_license | subhag071196/InterviewBit | e4b3489f9ac4ab3aa3ace5c882c3c4a19f2cadb3 | c250000576de154acf0b2b7d1a37be47627bf9a7 | refs/heads/master | 2020-03-25T09:04:09.046580 | 2018-08-06T14:18:30 | 2018-08-06T14:18:30 | 143,645,781 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 423 | cpp | int Solution::firstMissingPositive(vector<int> &A)
{
for(int i=0; i<A.size(); ++i)
{
if(A[i] <= A.size() && A[i] > 0)
{
if(A[A[i]-1] != A[i])
{
swap(A[i],A[A[i]-1]);
i--;
}
}
}
for(int i=0; i<A.size(); ++i)
... | [
"subhag0721@gmail.com"
] | subhag0721@gmail.com |
271e192436a2bc928667152474ea1acbb393195f | 8f130a18c82b59750349403bb249d22315acd650 | /libs/base/include/mvg/utils/mvg_macros.h | c32e2ef66450b0522edb9dfd8741e5f3b7779f1e | [] | no_license | jh-001/3DReconstruction | 82a82b54ce20c12e23a2546ca9a1a6366dbac408 | 6c3f475123df4f57be339230f28e5559278600e6 | refs/heads/master | 2023-03-15T16:05:07.600152 | 2015-11-27T14:29:07 | 2015-11-27T14:29:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,431 | h | /*******************************************************************************
* 文件： mvg_macros.h
* 时间： 2014/11/21 22:52
* 作者： 冯兵
* 邮件： fengbing123@gmail.com
*
* 说明： 定义一些通用的宏，例如不可复制，简化异常，断言机制等
*
********************************************************************************/
#ifndef MVG_UTILS_MVG_MACROS_H_
... | [
"fengbing123@gmail.com"
] | fengbing123@gmail.com |
a1df13c97c619d9573c6de063e0fc7c227fc99ef | 9a3ec3eb5371a0e719b50bbf832a732e829b1ce4 | /NPC Stoneheim/OraclePortal6.cpp | 6ddf3c68a8a89c5acc00752ec5258684c03f8d8c | [] | no_license | elestranobaron/T4C-Serveur-Multiplateformes | 5cb4dac8b8bd79bfd2bbd2be2da6914992fa7364 | f4a5ed21db1cd21415825cc0e72ddb57beee053e | refs/heads/master | 2022-10-01T20:13:36.217655 | 2022-09-22T02:43:33 | 2022-09-22T02:43:33 | 96,352,559 | 12 | 8 | null | null | null | null | UTF-8 | C++ | false | false | 862 | cpp | #pragma hdrstop
#include "OraclePortal6.h"
OraclePortal6::OraclePortal6()
{}
OraclePortal6::~OraclePortal6()
{}
extern NPCstructure::NPC PortalNPC;
void OraclePortal6::Create( ){
npc = PortalNPC;
SET_NPC_NAME( "[7396]A shimmering portal" );
npc.InitialPos.X = 2744;
npc.InitialPos.Y = 2236;
npc.InitialPos.worl... | [
"lloancythomas@hotmail.co"
] | lloancythomas@hotmail.co |
e61ffa52490dfde46f5916def14262955a76a371 | 5deab316a4ab518e3a409ab69885d372f4d45706 | /PreNationals/Contests/1511D.cpp | 7069beb1222cf4b5c161c1d9e4611fe8fbc0db8b | [] | no_license | af-orozcog/competitiveProgramming | 9c01937b321b74f3d6b24e1b8d67974cad841e17 | 5bbfbd4da9155a7d1ad372298941a04489207ff5 | refs/heads/master | 2023-04-28T11:44:04.320533 | 2021-05-19T19:04:30 | 2021-05-19T19:04:30 | 203,208,784 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 593 | cpp | #include<bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
int main(){
int n,k;
scanf(" %d %d",&n,&k);
char ans[n+1];
ans[n] = '\0';
char let = 'a';
char ot = 'a';
char upTo = 'a' + k;
for(int i = 0; i < n;){
ans[i] = let;... | [
"af.orozcog@uniandes.edu.co"
] | af.orozcog@uniandes.edu.co |
984deb57e392972ff2bc34269f97a8fde4cd2b84 | 52f16b13d21074dcd05a716c330a6ebe1dd3755b | /Visualizeridl.h | 53ebc99751677d1701992103a6ed225cca17d915 | [
"MIT"
] | permissive | m1h4/Visualizer | f31cd9c77c383dbb8330790771b04cb80aeadd32 | d6f7b0f9cc5a26504bcd3da37d9695fa24a689d2 | refs/heads/master | 2023-04-14T16:36:06.170740 | 2023-04-11T08:30:46 | 2023-04-11T08:30:46 | 43,632,414 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,565 | h |
/* this ALWAYS GENERATED file contains the definitions for the interfaces */
/* File created by MIDL compiler version 6.00.0366 */
/* at Sun Nov 18 03:23:32 2007
*/
/* Compiler settings for .\Visualizer.idl:
Oicf, W1, Zp8, env=Win32 (32b run)
protocol : dce , ms_ext, c_ext, robust
error checks: alloca... | [
"mihovilic@gmail.com"
] | mihovilic@gmail.com |
56e878e255aeb20e72ed1ec657792d0a654be9a3 | f1ee65fbe1ffc43c2aac45e41515f1987eb534a4 | /src/base/threading/hang_watcher.cc | f55bcc864856349b4b1f837b2a6c784ac3a4622b | [
"BSD-3-Clause"
] | permissive | klzgrad/naiveproxy | 6e0d206b6f065b9311d1e12b363109f2d35cc058 | 8ef1cecadfd4e2b5d57e7ea2fa42d05717e51c2e | refs/heads/master | 2023-08-20T22:42:12.511091 | 2023-06-04T03:54:34 | 2023-08-16T23:30:19 | 119,178,893 | 5,710 | 976 | BSD-3-Clause | 2023-08-05T10:59:59 | 2018-01-27T16:02:33 | C++ | UTF-8 | C++ | false | false | 46,936 | cc | // Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/threading/hang_watcher.h"
#include <atomic>
#include <utility>
#include "base/containers/flat_map.h"
#include "base/debug/alias.h"
#include "base/debug/crash_l... | [
"kizdiv@gmail.com"
] | kizdiv@gmail.com |
2d3ea45d5fc38e35a05004363ec8327e9a2fce19 | 499a00e1c5eb964cf91fcdd393faa16265b54588 | /src/chapter12/chapter12_1.h | f7c867d82ec0c5297b844b72675930aed8484ca8 | [] | no_license | macedonianking/testtemplate | 42d8ab29b542f3f0fac4f0333b1a6fbfca08955f | 7391b367c944199157e659a5bf368ef95ef72377 | refs/heads/master | 2021-01-10T20:17:47.201006 | 2017-01-12T10:06:54 | 2017-01-12T10:06:54 | 28,774,447 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,631 | h | #ifndef CPRIMER_CHAPTER12_CHAPTER12_1_H
#define CPRIMER_CHAPTER12_CHAPTER12_1_H
#include <stdlib.h>
#include <string>
#include <iostream>
#include <vector>
#include "macros.h"
#define INVALID_SCREEN_ID -1
namespace chapter12_1 {
class Person {
public:
Person(const std::string &name, std::string &address)
... | [
"lhb@oppo.com"
] | lhb@oppo.com |
5e269a3e4059a23a91352558e950518b12b614ba | e529eec5ed06e1e13da81205da6bc99c15e0bf0b | /Software/power.cpp | f6f4b0c3043a08930ffd7dc06e9670a73947124a | [] | no_license | FabLabNeuenstadt/Schluesselkasten | c927b1ab5bb459b28adc2aa671ba895bf9c6ac9b | 3a3ce0a23641e77ab64af30207df4daf68f250c5 | refs/heads/master | 2021-09-20T14:18:46.814963 | 2018-05-18T15:24:22 | 2018-05-18T15:24:22 | 100,042,787 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 164 | cpp | #include "power.hpp"
#include <Arduino.h>
bool powerState = false;
void setPowerState(bool state){
powerState = state;
digitalWrite(powerPin, !powerState);
}
| [
"kim-cheng@gmx.de"
] | kim-cheng@gmx.de |
6b4f3bf33101c3160d3884aa3e48125f685664af | f22531361bd64e44fa1ad450530b1b9d2ff14e03 | /moveRook.cpp | 02cf829156fb677735a929cd251f0127122f346c | [] | no_license | dcboules/chess | 96eb47a81d42fd6110df2a4d7cfe5c89e1b7f268 | 2bf4fa41a3582a70ded8a4ff360dd5e17fc66d5d | refs/heads/master | 2023-06-20T04:59:58.746720 | 2021-07-16T05:04:49 | 2021-07-16T05:04:49 | 386,514,795 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,151 | cpp | #include "moveRook.hpp"
#include <math.h>
#include <cstdint>
bool MoveRook::testMove(uint64_t position, uint64_t newMove, uint64_t playerState, uint64_t boardState) const {
if ((newMove & playerState) == 0) {
for (int i = 1; i < 8 - getRow(position); i++) { //+y
if (newMove == po... | [
"dcboules@admins-MacBook-Air.local"
] | dcboules@admins-MacBook-Air.local |
38e73175b9090b2f168db272897f968e11d2e4be | 5a5669f6add4d4475e0b7194e09d01c6a090a2da | /496.Next_Greater_Element_I/test.cpp | b548c79bc07dcdbd285ea48c96eb827c6da42fc1 | [] | no_license | WenhaoSu/leetcode | 5d0e0ec71264ba8a4663700019ab225535c1ff06 | f17161bb63a9af85ab8a800bb74a3b768d934fa4 | refs/heads/master | 2020-04-14T04:57:26.761406 | 2019-09-03T21:37:56 | 2019-09-03T21:37:56 | 163,650,422 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 352 | cpp | #define CATCH_CONFIG_MAIN
#include "../Catch/catch.hpp"
#include "solution.h"
TEST_CASE("Next Greater Element I", "[nextGreaterElement]") {
Solution s;
vector<int> nums1_1 = {4, 1, 2};
vector<int> nums1_2 = {1, 3, 4, 2};
vector<int> result1 = {-1, 3, -1};
REQUIRE(s.nextGreaterElement(num... | [
"suwenhao@umich.edu"
] | suwenhao@umich.edu |
3251670e5b53b8d19a805203b62758fd82a373d1 | 8bee69af1a9b6b253ef6e9eccab2ee7209152b03 | /ByteSafe/Bit.cpp | 3f110a4de0d0a1701fa6c1f0aad86143b46d248f | [
"MIT"
] | permissive | 00steve/ByteSafe | 9d61b06a13143e8d839c4cd8f70986d56c0d820f | eb476b217dd9e8f9a197ae4281b2f9cd704b626b | refs/heads/master | 2020-04-05T02:55:28.386238 | 2018-11-07T05:27:56 | 2018-11-07T05:27:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 998 | cpp | #include "stdafx.h"
#include "Bit.h"
//most significant bit is at the lowest address
//for binary, that means the 0/1 is at bit 7,
//the 0/127 is at bit 0
bool Bit::bigEndian = true;
int Bit::bi = 0;
Bit::Bit()
{
}
Bit::~Bit()
{
}
bool Bit::Get(const char b,const unsigned int i) {
return ((b >> i) & 0x01);
}
bo... | [
"stevemkrenz@gmail.com"
] | stevemkrenz@gmail.com |
54df9017f8b32eadbbdf5d3e43c4938974fa4ddc | a1821757e9fadfe956aa695f4c00701d4cae50e3 | /potionRH.h | 53700d1cd73091e9c2843c70ba50ad42807ecbfa | [] | no_license | Hyperloop001/Game-Chamber-Crawler-3000 | cb5b8777f83709821636196935d2408601edc310 | 1518a7b575e21d4341dba7aed466e63ac2b55e6a | refs/heads/master | 2021-05-11T21:35:20.517273 | 2019-04-12T15:18:37 | 2019-04-12T15:18:37 | 117,470,987 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 240 | h | #ifndef potionRH_h
#define potionRH_h
#include "global.h"
#include "potion.h"
class PC;
class RestoreHealth : public Potion {
public:
RestoreHealth(int row, int col);
~RestoreHealth();
void beConsumed(PC * user) override;
};
#endif
| [
"billtong1998@outlook.com"
] | billtong1998@outlook.com |
b1f38cb56ea45c0119b268c800d3961ac85cedda | 33d7b757500d2d9f9c38cd4f9cd0e5b7cb41edb9 | /src/utilities.cpp | 8a11da4eacf4b7988b40cf158e071576ce765afb | [] | no_license | jbouhier/mycrd | 01c7eb2a42dff5b5db58d654f0dcf43d3699d738 | 5144d9687d5b18fb9a077ab6ed7fcc1d0bfd10cf | refs/heads/master | 2021-01-20T11:55:00.974945 | 2016-10-07T07:50:08 | 2016-10-07T07:50:08 | 65,146,158 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,079 | cpp | #include <stdio.h>
#include <string.h>
#include "../include/LinkedHashMap.hpp"
void my_putchar (char c)
{
std::cout << c;
}
void my_putNotFound ()
{
std::cout << "-1\n";
}
int my_putstr(char *str)
{
while (*str != 0)
{
my_putchar(*str);
str++;
}
my_putchar('\n');
return (0);
}
char *my_s... | [
"jb.bouhier@gmail.com"
] | jb.bouhier@gmail.com |
ec0d8913edc07d5fa48be7149cb0e092175587f5 | c9741a56012fb77c3be0e35e8c6987a6344bd3a7 | /config.cpp | 946bf9a8e15252cf8530eb91a5e0cadade239279 | [] | no_license | yujifei/Mine | 5b89169b02230362024de46fbe5ed75b160df856 | 373d4e7f0603036ee8f85c7047c0c7488b4b7436 | refs/heads/master | 2021-01-01T05:24:37.975228 | 2016-05-09T14:40:35 | 2016-05-09T14:40:35 | 58,383,621 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,018 | cpp | /************************************************************
> File Name: config.cpp
> Author: 庾吉飞
> Mail: yujihui.xidian@gmail.com
> Created Time: 2013年10月02日 星期三 21时37分15秒
************************************************************/
#include "config.h"
#include <QObject>
#include <cstdio>
unsigned long DefaultGri... | [
"jfyu@rd.netease.com"
] | jfyu@rd.netease.com |
01b85c723eb9ef6da62819ee43635bf54a761fa6 | 0d8754038e3d4de11ccb39690be9cb18754b892f | /Game/Source/Application.cpp | 9fce8805f3ccf1f31869686c4de819a2d8065637 | [] | no_license | Florian-Heringa/Minecraft-CPP-OpenGL | 50496929085e5046c450034f132cd9f67973ce0a | b35d22a880a3be21047d58aa31fb278aec25b22a | refs/heads/master | 2021-01-18T19:33:29.506294 | 2017-09-26T22:34:26 | 2017-09-26T22:34:35 | 100,533,234 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 599 | cpp | #include "Application.h"
#include "Display.h"
#include "States/Playing.h"
Application::Application()
{
pushState(std::make_unique<State::Playing>(*this));
}
void Application::runMainGameLoop()
{
while (Display::isOpen())
{
Display::clear();
m_states.top()->input();
m_states.top()-... | [
"florian_music@hotmail.com"
] | florian_music@hotmail.com |
8b0136eeb7850c4ba4f8ed9867122abebeaae645 | 2af943fbfff74744b29e4a899a6e62e19dc63256 | /IntelligentSI/Communication/OpenIGTLink/Source/igtlMacro.h | e46c5595ce571b0ec1eb99dc7760d1801c78c811 | [
"BSD-3-Clause"
] | permissive | lheckemann/namic-sandbox | c308ec3ebb80021020f98cf06ee4c3e62f125ad9 | 0c7307061f58c9d915ae678b7a453876466d8bf8 | refs/heads/master | 2021-08-24T12:40:01.331229 | 2014-02-07T21:59:29 | 2014-02-07T21:59:29 | 113,701,721 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 38,022 | h | /*=========================================================================
Program: Open IGT Link Library
Module: $RCSfile: $
Language: C++
Date: $Date: $
Version: $Revision: $
Copyright (c) Insight Software Consortium. All rights reserved.
This software is distributed WITHOUT ANY WARRANT... | [
"tokuda@5e132c66-7cf4-0310-b4ca-cd4a7079c2d8"
] | tokuda@5e132c66-7cf4-0310-b4ca-cd4a7079c2d8 |
f84bb383d05d7af4220702da19e453fcf86e0162 | 80d17f09c98be69e75c3de23e157d6f4eba22f69 | /test/test_group_table.cpp | 1e6f11b8e117e5bc8224ff7c17dce681366ba9aa | [] | no_license | xiao004/chat_geloutingyu | d50cd623789edee9dba4d7528f1f58a511af7731 | c3382f87265303898498ee0a476be14d27069a6e | refs/heads/master | 2020-06-04T18:40:44.815172 | 2019-06-16T04:41:09 | 2019-06-16T04:41:09 | 192,148,569 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 300 | cpp | #include <iostream>
#include "../mysql/group_table.h"
using namespace std;
void test_insert(const int uid, const std::string &gname) {
int id = group_table::insert(uid, gname);
std::cout << id << std::endl;
}
int main(int argc, char const *argv[]) {
test_insert(2, "family");
return 0;
} | [
"371293374@qq.com"
] | 371293374@qq.com |
43600136fce3b78f517076b3fa5b69379379d44c | c90caf85cc8f823a9a098e191baab4fa58109a64 | /Server/Include/FireRateBooster.hpp | 326dac13c96ee79f128068313beb6c89ec22c253 | [] | no_license | Lozoute/Rtype | 805d29f50e762888f55dd2e2006a043090a590f9 | 0c241eb0cac90bc4d4c01996fb39233e2f6667b7 | refs/heads/master | 2021-06-16T16:17:18.833846 | 2017-03-13T15:44:41 | 2017-03-13T15:44:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 468 | hpp | #ifndef FIRERATEBOOSTER_HPP_
# define FIRERATEBOOSTER_HPP_
# include <iostream>
# include <string>
# include "AObject.hpp"
class Game;
class FireRateBooster : public AObject
{
private:
int _Gain;
public:
FireRateBooster (int, Game *, int);
FireRateBooster (const FireRateBooster &);
FireRateBooster&... | [
"thibaud.auzou@gmail.com"
] | thibaud.auzou@gmail.com |
4fa224a65194eb7b79de6fa5f7e95c16cfce9c31 | e2e9b8836edbb8db4d593c91a46b7161cac8be0c | /Strings_Sabeel/DistinctPalindromicSubstrings.cpp | 455996b9d5ee8290508044066186667c4ad3f401 | [] | no_license | sabeelahmad/interviewPrep | eb3244947ae5cf9f58eca0e4c1b485cd7dd12d51 | f7023df20b0b4df48e6d463ba01bffadcf9015cb | refs/heads/master | 2020-05-27T17:28:04.135955 | 2019-07-20T20:36:09 | 2019-07-20T20:36:09 | 188,721,651 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,109 | cpp | #include <bits/stdc++.h>
using namespace std;
// we will use same concept of longest palindromic substrings
// dp table will have true for all palindromic substrings, but since we want distinct, we will insert them in set
int main() {
int t;
cin >> t;
while(t--) {
string s;
cin >> s;
int n = s.size(... | [
"sabeelbasharat@gmail.com"
] | sabeelbasharat@gmail.com |
47e0f2c68b71da51d883a4c3402fc50749443be8 | ef6168bab4254eee2eb36e899461b3ecdd0b173c | /src/ob/string.hh | dd01d797baac319fc96a8bf07f95cfd62d26ef85 | [
"MIT"
] | permissive | markkun/fltrdr | 9cae61ca19eee7231ec3352658770223914ae2fb | cee8f45aadb6153640726a7492b12af393dcdca5 | refs/heads/master | 2022-01-07T04:34:16.108768 | 2019-05-10T02:36:05 | 2019-05-10T02:36:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 977 | hh | #ifndef OB_STRING_HH
#define OB_STRING_HH
#include <cstddef>
#include <string>
#include <optional>
#include <regex>
#include <limits>
#include <vector>
namespace OB::String
{
std::vector<std::string> split(std::string const& str, std::string const& delim,
std::size_t size = std::numeric_limits<std::size_t>::max()... | [
"octo.banana93@gmail.com"
] | octo.banana93@gmail.com |
a7a9c39ec059e5bbd48276778afdf122a86ce89f | 2695285f1acd7c5ddf54548faf9480eb18644c54 | /0717_spaceinvader/Enemy.cpp | 48516050651eb19a87e7bd34a456888fd84a109c | [] | no_license | CoJang/Inha_study_API | 534bf2130bb01ab4e6c00b2a5da2dafd2d02c393 | b460d5557fd3658232b8eafd36109b596d745ed7 | refs/heads/master | 2022-12-16T19:51:01.894839 | 2020-09-22T08:36:41 | 2020-09-22T08:36:41 | 282,125,271 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,661 | cpp | #include "stdafx.h"
#include "Enemy.h"
Enemy::Enemy()
{
vertex[0].x = pos.x - r; vertex[1].x = pos.x + r;
vertex[0].y = pos.y - r; vertex[1].y = pos.y - r;
vertex[3].x = pos.x - r; vertex[2].x = pos.x + r;
vertex[3].y = pos.y + r; vertex[2].y = pos.y + r;
pos = { 55, 55 };
state = NOT_ACTIVE;
moveSpeed = 15;
... | [
"bbh1039@naver.com"
] | bbh1039@naver.com |
caff33e5b035dac57e2f48a069b733f5802c0f01 | d642d80c42647d33a4fb4f66d6e6bf2241a42126 | /main.cpp | 39483f8c7843d12b081a169722703188526bf84a | [] | no_license | 43reyerhrstj/software-Rendering | d72fff556db95ec7543d668d605eade9e7da9e30 | 4cf93eeb95a0e6cf4f322de2b910a2cc814e5da6 | refs/heads/master | 2022-03-08T00:37:39.879562 | 2018-04-01T13:29:42 | 2018-04-01T13:29:42 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 4,534 | cpp | //´úÂë²Î¿¼×Ô£ºhttps://www.zhihu.com/question/24786878
//https://www.zhihu.com/question/33712299
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include"MyMath.h"
#include"Transform.h"
#include"DrawElement.h"
using namespace std;
CHAR fpsBuffer[256];
LARGE_INTEGER delta;
double vertexData[36][8] = {
{ -1.0... | [
"441867138@qq.com"
] | 441867138@qq.com |
743d3afcdcd2e7219ddff2be1566d90254afecc0 | 600df3590cce1fe49b9a96e9ca5b5242884a2a70 | /components/exo/keyboard.cc | 7ccf3eef6cd0167af2a18ed68fd60e0346cbdbbc | [
"BSD-3-Clause"
] | permissive | metux/chromium-suckless | efd087ba4f4070a6caac5bfbfb0f7a4e2f3c438a | 72a05af97787001756bae2511b7985e61498c965 | refs/heads/orig | 2022-12-04T23:53:58.681218 | 2017-04-30T10:59:06 | 2017-04-30T23:35:58 | 89,884,931 | 5 | 3 | BSD-3-Clause | 2022-11-23T20:52:53 | 2017-05-01T00:09:08 | null | UTF-8 | C++ | false | false | 7,108 | cc | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/exo/keyboard.h"
#include "components/exo/keyboard_delegate.h"
#include "components/exo/shell_surface.h"
#include "components/exo/sur... | [
"enrico.weigelt@gr13.net"
] | enrico.weigelt@gr13.net |
249ccd54f0e490ac9ff94a44e9827b08b6b0b29a | fb7efe44f4d9f30d623f880d0eb620f3a81f0fbd | /third_party/WebKit/Source/core/page/scrolling/RootScrollerController.h | 2bfbc39252a56d05f993a853d383f2f04174d71a | [
"BSD-2-Clause",
"LGPL-2.1-only",
"LGPL-2.0-only",
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"MIT",
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer",
"GPL-2.0-only",
"LicenseRef-scancode-other-copyleft",
"BSD-3-Clause"
] | permissive | wzyy2/chromium-browser | 2644b0daf58f8b3caee8a6c09a2b448b2dfe059c | eb905f00a0f7e141e8d6c89be8fb26192a88c4b7 | refs/heads/master | 2022-11-23T20:25:08.120045 | 2018-01-16T06:41:26 | 2018-01-16T06:41:26 | 117,618,467 | 3 | 2 | BSD-3-Clause | 2022-11-20T22:03:57 | 2018-01-16T02:09:10 | null | UTF-8 | C++ | false | false | 5,489 | h | // Copyright 2016 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 RootScrollerController_h
#define RootScrollerController_h
#include "core/CoreExport.h"
#include "platform/heap/Handle.h"
namespace blink {
clas... | [
"jacob-chen@iotwrt.com"
] | jacob-chen@iotwrt.com |
9771c29621ad9c3a788e155befff401cd9a8a0fa | a7c1d71890b463ef57d3c56b6b6086d489aa798e | /LeetCode/September_Challenge/Day4.cpp | 100dfc9fbaa4708d6d469d3206339b48ce201f1f | [] | no_license | anilchoudhary/DSA | 7016eb5172a6e4762384ab4e3906401085bd9f7a | 19b2816afe38ec95a736daeea99165259cb98a1c | refs/heads/master | 2020-12-26T10:05:24.678772 | 2020-10-26T06:25:01 | 2020-10-26T06:25:01 | 237,475,644 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 597 | cpp | class Solution {
public:
vector<int> partitionLabels(string S) {
int a[26] = {0};
for (int i = 0; i < S.size(); i++) {
a[S[i] - 'a'] = i;
}
int i = 0;
//int j=0;
vector<int>v;
int k = 0;
while (i < S.size()) {
int j = a[S[i] - '... | [
"masteranilchoudhary@gmail.com"
] | masteranilchoudhary@gmail.com |
f2f7c25b0b272326ef237f9bb1f3260c4165bfce | ea04bfc6fd704b52393f3f635a67644f0012d152 | /include/rsSim/robotgroup.tpp | 5849586048525e786a444367039ece71f6d6d194 | [] | no_license | gucwakj/librs | d3181e7df9de9036232ae0a5fcd037d7af8d3555 | 222ae28db46cd47f3b32cdb6a32b360df68b75b8 | refs/heads/master | 2021-01-13T09:43:48.565374 | 2014-12-04T19:29:49 | 2014-12-04T19:29:49 | 69,404,202 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,166 | tpp | template<class T>
int Group<T>::addRobot(T &robot) {
_robots.push_back(&robot);
return 0;
}
template<class T>
int Group<T>::addRobots(T robots[], int num) {
for (int i = 0; i < num; i++) {
_robots.push_back(&robots[i]);
}
return 0;
}
template<class T>
int Group<T>::blinkLED(double delay, int num) {
for (int i... | [
"gucwakj@gmail.com"
] | gucwakj@gmail.com |
f5814fc79dcce07e6fb4dd9e97cf1d2c618e2500 | 012a5e5d819504013a85c2478abd1cc29707ef32 | /spoj/LASTDIG/LASTDIG-10958329.cpp | d2b4cadbadb3402687d65804fea85df6c28abbe0 | [] | no_license | mohitpandey94/SPOJ-Solutions | 2c70d032e1c091d18e310b5c50901709c3293c17 | 2fea99f43b76b3c2a8d3aa509fb5d320581b1f95 | refs/heads/master | 2021-09-15T22:00:19.792878 | 2018-06-11T19:28:50 | 2018-06-11T19:28:50 | 105,742,283 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 626 | cpp | #include<stdio.h>
#include<math.h>
int main()
{
int a,mod,t;
unsigned long b;
scanf("%d",&t);
while (t--){
scanf("%d %lu",&a,&b);
if(b==0&&a!=0) {
printf("1\n");
continue;
}
if(!a){
printf("0\n");
continue;
}
else{
mod=a%10;
... | [
"mohitpandey94@gmail.com"
] | mohitpandey94@gmail.com |
1dd8cff45642ca226df5bf6899f4f3612c3bc98b | 16a572aa7254ae9515d00449eb3efe7f9558c011 | /OOP_Concepts/Enum Movement Game.cpp | a6cd513f7afddf18b452524306abda2760b514f9 | [] | no_license | Sciencethebird/Cpp | 58ee961449b08ffcc8d13f7d5a943f05d9e56637 | 0a9634ed014cb3921d61a066fb9620bce2cbbfba | refs/heads/master | 2020-04-01T22:32:32.255096 | 2019-09-16T13:47:36 | 2019-09-16T13:47:36 | 153,713,951 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,163 | cpp | #include<iostream>
using namespace std;
enum coordinate {x, y}; ///coordinate is like a variable type
template <class T, int N>
void printmap(T Map[N][N])
{
for(int i = 0; i<N; i++)
{
for(int j= 0; j< N; j++)
{
cout << Map[i][j] << " ";
}
cout << end... | [
"sciencethebird@gmail.com"
] | sciencethebird@gmail.com |
e5fe875f00a1261f4071b45e101e758d1460fcc8 | 20ab41e698ee88645d7cac3947d7ee89d441baac | /util.cpp | 6f45db795d6c0332a018abec0ebcc56c2dc6f6ff | [] | no_license | daniel-huang-1230/Graph-Search-Six-Degrees-of-Kevin-Bacon- | 7162fc03f95ce20b165b9acf38a66272665a2ae4 | 14c65f9c3c8492e3b451de63ab64d817e2449561 | refs/heads/master | 2022-02-22T23:47:20.520607 | 2017-09-08T23:40:36 | 2017-09-08T23:40:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 752 | cpp | #include <iostream>
#include <sstream>
#include "util.h"
using std::istream;
using std::endl;
using std::cout;
using std::istringstream;
using std::string;
using std::vector;
/**
* Name: Daniel Huang
* Date: 2/06/2017
* Assignment: PA2
*/
/*
* Starts the timer. Saves the current time.
*/
void Timer::begin_tim... | [
"gn03249822@DanieltekiMacBook-Pro.local"
] | gn03249822@DanieltekiMacBook-Pro.local |
8fa3192fa954d3147a0ed5c450acb76566998f45 | d3b2b1ab5c4ef93e090671dc28d762bcffbaef04 | /code.cpp | b7e5737afbb199b1757004d351bc3422af478cd1 | [] | no_license | yyNoBug/PPCA-RISC-V-simulation | 45a6755d0f61cf76f904a6d53729a4ee855f9081 | ecda6f45fde73e86e03c09d70c5646f2d24f4b23 | refs/heads/master | 2020-06-16T23:03:21.892240 | 2019-08-10T15:50:33 | 2019-08-10T15:50:33 | 195,727,772 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,487 | cpp | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <cmath>
#include <vector>
#include "storage.hpp"
#include "ultility.hpp"
#include "transcode.hpp"
#include "excecution.hpp"
#include "readin.hpp"
using std::cout;
bool stop;
int memcnt;
void IF();
void ID();
void EX();
void MEM();
void WB();
void dis... | [
"yaoyuan2000@sjtu.edu.cn"
] | yaoyuan2000@sjtu.edu.cn |
e8a1a3437df7ec3b31f3b5080454b419936b4ea4 | 207a0d5150cb3ed5b38fcf83a09993172ca3603c | /Classes/Game/EndGameLayer/EndGameLayer.h | f4fd38b21e36f238ba3c960602d419b37016e645 | [] | no_license | Moirai7/DiamondGame | d0fa957e767342ada8caa16c6cb1b2802680fdc7 | 6ae0b63b67111190a5f72ad287b6fe19e586fa48 | refs/heads/master | 2016-09-08T01:19:23.053228 | 2015-05-09T12:19:15 | 2015-05-09T12:19:15 | 34,556,387 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 745 | h |
#ifndef __LLgame__EndGameLayer__
#define __LLgame__EndGameLayer__
#include <iostream>
#include "cocos2d.h"
using namespace cocos2d;
using namespace std;
class EndGameLayer: public CCLayer
{
private:
Sprite* background;
void setupGUI();
public:
Size winSize;
virtual bool init();
... | [
"emma@moirai.cn"
] | emma@moirai.cn |
fcf6badd1f4f8b222b7ae58fd66d3e552485855a | 959d5778aab11837d22687cde1ace8bd84f1166e | /str_brute_force.cpp | 2fe397e0405a97955bb985d97a0d9187aca065e6 | [] | no_license | xiecheng1991/data-struct | e2981a0fecef9d31553f1d62ca1a538ef4b8a682 | 995dde1186914720483daa3c70214e07ad011387 | refs/heads/master | 2020-04-27T11:07:12.298351 | 2020-04-03T08:45:51 | 2020-04-03T08:45:51 | 174,283,467 | 1 | 0 | null | 2019-03-07T07:28:26 | 2019-03-07T06:14:51 | null | UTF-8 | C++ | false | false | 1,117 | cpp | #include<iostream>
#include<string>
using namespace std;
//BF算法
/*
算法分析: 每次从第一个位置开始始主串和模式串进行匹配如果遇到一个不匹配的字符，则往后挪动一位
如果完全匹配则匹配成功，总共需要匹配n-m+1次的原因是如果移动到某个字符后面字符少于模式串的长度时没必要再匹配
时间复杂度: o(n*m)
*/
int brute_force( string& str1, string& str2 ) {
int m = str1.size(), n = str2.size();
//这里可以优... | [
"36882006+xiecheng1991@users.noreply.github.com"
] | 36882006+xiecheng1991@users.noreply.github.com |
ee38407f9e34d648573bc57219263ba8dd7b3e66 | 848d30990f4f9af7efe5c0512c751d2b767ff1f6 | /src/parse.hpp | 6239acc71896f274a95d7fc19a691f7cc8942aae | [] | no_license | paulfauthmayer/schemeplusplus | bfd76af733c3f7c7cf24b7c58546addc130abe25 | efb0f6f1479bfcc4fce65f26d3dcc06ed1a6c0bd | refs/heads/master | 2022-12-12T14:32:42.017450 | 2020-09-17T23:02:21 | 2020-09-17T23:02:21 | 260,155,121 | 3 | 0 | null | 2020-09-02T16:11:46 | 2020-04-30T08:27:41 | C++ | UTF-8 | C++ | false | false | 245 | hpp | #pragma once
#include <iostream>
#include <vector>
#include "scheme.hpp"
namespace scm {
Object* interpretInput(std::vector<std::string>::iterator& current);
Object* readInput(std::istream* streamPtr, bool isFile = true);
} // namespace scm
| [
"paulfauthmayer@gmail.com"
] | paulfauthmayer@gmail.com |
2eadde0aee1cd22bdb58a2d504144760023fd937 | c52edbf7ef96b02087183b4c9b1e846b45bb0962 | /Appli/Src/isrs.cpp | b0e122eb25283858d3a32199a3fbad08bae74082 | [] | no_license | chlipounni/Data_Looger | a3dc77a5373240802456421685f6546ef9b85d1a | 949125697de81e191953df206896049669f74236 | refs/heads/main | 2023-07-14T20:12:05.174543 | 2021-08-25T11:54:25 | 2021-08-25T11:54:25 | 375,964,698 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,986 | cpp | #include "main.h"
#include "usbd_cdc_if.h"
#include "Appli/Inc/controller.h"
extern ADC_HandleTypeDef hadc1;
extern ADC_HandleTypeDef hadc3;
extern TIM_HandleTypeDef htim2;
extern TIM_HandleTypeDef htim3;
extern uint16_t adc1Buffer[ADC_BUFFER_SIZE] __attribute__ ((aligned (8)));
extern uint16_t adc3Buffer[ADC_BUFFER_... | [
"50593554+chlipounni@users.noreply.github.com"
] | 50593554+chlipounni@users.noreply.github.com |
f7821fb38be0d74abaf4a684d44c51f096d2d4ab | 7d830df06ab35cabba058602c072573c042a371a | /154-Find Minimum in Rotated Sorted Array II.cpp | 1ed34d0dc2f91b3cb7e8486326651a67ee8475ae | [] | no_license | vinsonleelws/LeetCode | 26b04f5a9e05f2093e1207ab8760986220564355 | 92275a92ef68d6726b84218c01dab9da9d05d6d6 | refs/heads/master | 2020-03-12T21:13:00.890172 | 2018-10-22T03:24:39 | 2018-10-22T03:24:39 | 130,823,369 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,551 | cpp | /*
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
Find the minimum element.
The array may contain duplicates.
Example 1:
Input: [1,3,5]
Output: 1
Example 2:
Input: [2,2,2,0,1]
Output: 0
*/
class Solution {
pu... | [
"16210720072@fudan.edu.cn"
] | 16210720072@fudan.edu.cn |
17d1ace24d0da550063bedf2dd76ca8970df68ca | 44549951f76546c048724511083ae0e4f85eb67f | /DesignPatternCpp/20160328/2_5_thiscall_타이머캡슐화.cpp | 690a237a3cef03e9f56024faac57ac3a90a1f7ad | [] | no_license | goodgodgd/DesignPatternCpp | 74f95179c8ee1a94c80428d994771d841631207f | 73cbb2be8da6b284270fa4099610a4024fad95da | refs/heads/master | 2021-01-17T14:46:09.593625 | 2016-06-25T14:14:17 | 2016-06-25T14:14:17 | 54,876,837 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,001 | cpp | // 타이머를 캡슐화 해봅시다.
// C언어 함수를 클래스로 래핑하는 패턴은 thread와 비슷
// static 멤버 함수 포인터와
// http://d.pr/n/ZBH
// http://d.pr/n/191Lz
// ioacademy.h
// http://d.pr/n/17nrr
#include <string>
#include <iostream>
using namespace std;
#include "ioacademy.h"
using namespace ioacademy;
#if 0 // 일반 함수 타이머 호출
void foo(int id)
{
cout ... | [
"goodgodgd@yonsei.ac.kr"
] | goodgodgd@yonsei.ac.kr |
627ccabdecfcac4632a63a88a13fba774153ad7a | b63ee4ac0fd3cfcd2e0b67020afe50f600f61a44 | /BullCowGame/FBullCowGame.h | d8d08a3f194238fb77e1afec83db13a78bffa92b | [] | no_license | MikeyUchiha/BullCowGame | 58a5762e1c1272b8aa431b2a0cd6350f5c73b550 | f05443f164522f901ec555177dfa4d2ba0847984 | refs/heads/master | 2020-04-02T04:18:59.370384 | 2016-07-15T03:00:09 | 2016-07-15T03:00:09 | 63,193,047 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 884 | h | /* The game logic (no view code or direct user interaction)
The game is a simple guess the word game based on Mastermind
*/
#pragma once
#include <string>
// to make syntax Unreal friendly
using FString = std::string;
using int32 = int;
struct FBullCowCount
{
int32 Bulls = 0;
int32 Cows = 0;
};
enum class EGuessS... | [
"mikey@starfantasygames.com"
] | mikey@starfantasygames.com |
53a095878dc3f3c021e31790865f4df8fc6140f9 | 2de8f5ba729a846f8ad5630272dd5b1f3b7b6e44 | /src/server/gameserver/EffectAddItemToCorpse.h | fef96d2fdea55d9a69c7519860a4354476c15167 | [] | no_license | najosky/darkeden-v2-serverfiles | dc0f90381404953e3716bf71320a619eb10c3825 | 6e0015f5b8b658697228128543ea145a1fc4c559 | refs/heads/master | 2021-10-09T13:01:42.843224 | 2018-12-24T15:01:52 | 2018-12-24T15:01:52 | null | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 2,211 | h | //////////////////////////////////////////////////////////////////////////////
// Filename : EffectAddItemToCorpse.h
// Written by : Reiot
// Description :
//////////////////////////////////////////////////////////////////////////////
#ifndef __EFFECT_ADD_ITEM_TO_CORPSE_H__
#define __EFFECT_ADD_ITEM_TO_CORPSE_H__
... | [
"paulomatew@gmail.com"
] | paulomatew@gmail.com |
dbc8f920d47d130fbf9e34116a50ea8963d6ce4b | 6d088ec295b33db11e378212d42d40d5a190c54c | /core/vil/Templates/vil_copy+uint_32-.cxx | 6542c308b2cf9a84286fd84173ccf9cbf4d05777 | [] | no_license | vxl/vxl | 29dffd5011f21a67e14c1bcbd5388fdbbc101b29 | 594ebed3d5fb6d0930d5758630113e044fee00bc | refs/heads/master | 2023-08-31T03:56:24.286486 | 2023-08-29T17:53:12 | 2023-08-29T17:53:12 | 9,819,799 | 224 | 126 | null | 2023-09-14T15:52:32 | 2013-05-02T18:32:27 | C++ | UTF-8 | C++ | false | false | 87 | cxx | #include "vil/vil_copy.hxx"
#include "vxl_config.h"
VIL_COPY_INSTANTIATE(vxl_uint_32);
| [
"hans.j.johnson@gmail.com"
] | hans.j.johnson@gmail.com |
f22a8d7527c56946b40cf828e1dc819a8057ca41 | f6e5425c7688223ad1835d9a73949ccd92538ce2 | /Compass/AngularControllerInts/AngularController/AngularController.ino | 77c0a13d1daab1de3d827ecac6c77ea741124c9e | [] | no_license | d-zhelyazkov/Arduino | 731b7463222cd1ee82bbc6db0b6b91a90a7567a8 | 48e8ab0adf75839644fb685ceb020dd5dc3985e6 | refs/heads/master | 2021-01-13T15:04:19.640014 | 2018-09-08T14:18:04 | 2018-10-01T11:04:21 | 79,268,543 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,321 | ino | /*
Name: AngularController.ino
Created: 2/13/2016 5:20:08 PM
Author: XRC_7331
*/
#include <Wire.h>
#include <Adafruit_Sensor.h>
#include <Adafruit_HMC5883_U.h>
#include "libs\controller\AngularController.h"
#include "libs\compass\AdafruitCompass.h"
#include "libs\interruptor\WaitInterruptor.h"
Compass* compass;
A... | [
"d.zhelyazkov.7331@gmail.com"
] | d.zhelyazkov.7331@gmail.com |
8414155061063faa28e3cc19beaf7f382c59db65 | 158dcea688a02f686e431e558b6eeca50c89db67 | /Classes/Level4.h | 72078df3257a307c66aec143ed59652c958d1edf | [] | no_license | joeaoregan/LIT-Yr4-PlatformGameDevelopment | 1bef5b1464c3dd9c7133c74b8bdb1c5d1207eb00 | a39d25d2cb951c3db286cb715a970175b383757e | refs/heads/master | 2020-03-13T21:06:34.492852 | 2020-01-09T04:50:30 | 2020-01-09T04:50:30 | 131,288,481 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,387 | h | /*
Level4.h
Joe O'Regan
K00203642
18/02/2018
*/
#ifndef __LEVEL_4_H__
#define __LEVEL_4_H__
#include "Level.h"
#include "EnemyShipDerpStar.h"
class Level4 : public Level {
public:
static cocos2d::Scene* createScene(); // there's no 'id' in SpaceQuest, so we recommend returning the class instance pointer
... | [
"k00203642@student.lit.ie"
] | k00203642@student.lit.ie |
8509e96bc378602205af6cbd2093d7c3109b8c81 | 637017865834dadb940f6f6ad1fba20c6a127e3e | /uidesigner/uidframe/src/Editor/TemplateEditorWindow.cpp | a62738e035191adfd9bb04cc462c4111b88f5c54 | [] | no_license | weimingtom/MPF_fork | 7b3ec9e278d928290a76ee16df21eefa4fd66198 | b6757833d520f9328a5cb0af865eb95cdf8b6088 | refs/heads/master | 2021-01-21T21:06:10.451739 | 2016-10-13T04:09:59 | 2016-10-13T04:09:59 | 94,776,561 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,666 | cpp | /////////////////////////////////////////////////////
// TemplateEditorWindow.cpp
#include "stdafx.h"
#include <Main/DesignPanel.h>
#include <Editor/ThemeEditorWindow.h>
#include <Editor/TemplateEditorWindow.h>
#include <Core/StyleNode.h>
#include <Editor/XamlWalker.h>
#include <Framework/Controls/Rectang... | [
"china0851@6fc91ae5-6b3c-4328-b870-8ec626a46ab3"
] | china0851@6fc91ae5-6b3c-4328-b870-8ec626a46ab3 |
3a7612f3b97677874e2203d8dc212d2ab3334c6b | 5e6cda9a847e8868fec8a7fa0f6193573238f31e | /ORDINARY_PROGS/PEREBOR/4ch_numbers/nums.cpp | 418da7b5f0fa1e6e953b636d7b924534e961f7c6 | [] | no_license | orcchg/StudyProjects | 33fb2275d182e46a8f5a9578dbbf4566bd7f1013 | 269550e37100e1eacc49a766b5f0db9c2e7ade2d | refs/heads/master | 2020-04-30T17:56:11.268350 | 2014-04-07T10:57:43 | 2014-04-07T10:57:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 593 | cpp | #include <conio.h>
#include <stdio.h>
int main()
{
int NUM=1000;
int N=0,s[4],SUM=0;
printf("Enter 0<N<37: ");
scanf("%d",&N);
fflush(stdin);
for(int i=0; i<9000; i++) {
s[0] = NUM / 1000;
s[1] = (NUM - 1000*s[0]) / 100;
s[2] = (NUM - 1000*s[0] - 100*s[1]) / 10;
s[3] = NUM - 1000*s[0]... | [
"alovmax@yandex.ru"
] | alovmax@yandex.ru |
1d368bc83cfeea6abe86f124752467ad286750d8 | 9e55a0a6ef6b77141ff8cf67bc1f54e567065085 | /ConsoleDemo/Main.cpp | 9be66eebdfafb7b87508d8c914ea0bc30d6498b2 | [] | no_license | mqd520/Log4cplusDemo | cdf7273502e66312a5fc269f708ce7bbe3a8f999 | 21d8992a995e618d18e52511e5d231fc3fe36bea | refs/heads/master | 2020-09-12T06:13:20.078278 | 2019-11-18T14:05:45 | 2019-11-18T14:05:45 | 222,337,449 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 415 | cpp | // ConsoleDemo.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include "LogHelper.h"
#include "LogThread.h"
int _tmain(int argc, _TCHAR* argv[])
{
LogHelper::Init();
LogThread thd;
thd.Run();
char ch[128] = { 0 };
while (true)
{
gets_s(ch);
if (strcpy_s(ch, "exit") == 0)
{
break;
}
::Sleep(1... | [
"1506816370@qq.com"
] | 1506816370@qq.com |
30954f3e747462e12e56802bbd0e54482bad3f03 | f7138953cb14157ae8847cdc6a0382e548d1e891 | /Medium/238 - Product of Array Except Self.cpp | a5223086b7ce68b0e0c07fb2b4e5ca02b77a6add | [
"WTFPL"
] | permissive | WangZixuan/Leetcode | 3be28f6cb815862e66629382bf7ccabdb8aa51a7 | fd372924fe052e9ca4b4ed5f9c94aecdfdabbc50 | refs/heads/master | 2023-07-08T15:05:40.979860 | 2023-06-27T08:57:39 | 2023-06-27T08:57:39 | 40,244,695 | 11 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,033 | cpp | /*
Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
Solve it without division and in O(n).
For example, given [1,2,3,4], return [24,12,8,6].
Follow up:
Could you solve it with c... | [
"wzxllx@gmail.com"
] | wzxllx@gmail.com |
23280e88ad8523f0575d99ff01a071cfbd9c2f6c | 112d59f56a1a6f4f0f80d4c57df88cdb43a2e5eb | /libs/minecraft/server/set_compression.cpp | 1a0254b0832141a6d5f1d70e01601302573f9db9 | [] | no_license | AlexAndDad/gateway | bd1b1eb30d15d98b2ea31f69f450a440300a3a50 | 7e4f543bd8918d38ab437f0e825c8c2a86d39188 | refs/heads/master | 2022-09-17T05:23:38.895693 | 2020-04-22T20:06:38 | 2020-04-22T20:06:38 | 254,867,366 | 4 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 850 | cpp | //
// Created by rhodges on 17/04/2020.
//
#include "set_compression.hpp"
#include "minecraft/encode.hpp"
namespace minecraft::server
{
auto compose(set_compression const &packet, std::vector< char > &buffer) -> void
{
var_int const id = static_cast<std::int32_t>(packet.id());
auto max_bytes =... | [
"hodges.r@gmail.com"
] | hodges.r@gmail.com |
da52b639587fbfadff0f67b60be16b34bd9b8c81 | 47c5206c1425b1de7f1fbb8b8c5d8bfc648b9019 | /src/highlighters.cc | 310ab223686f115d3703a63859749f08cb2e3f95 | [
"Unlicense"
] | permissive | davidaciko/kakoune | 6801e4a5c74305b9051956597196bfdb50655496 | fc53a80395d569d94bd98e3aa3cdc3baf7baea4d | refs/heads/master | 2021-01-21T01:17:57.086646 | 2014-10-01T22:41:06 | 2014-10-01T22:41:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 38,791 | cc | #include "highlighters.hh"
#include "assert.hh"
#include "buffer_utils.hh"
#include "context.hh"
#include "display_buffer.hh"
#include "face_registry.hh"
#include "highlighter_group.hh"
#include "line_modification.hh"
#include "option_types.hh"
#include "parameters_parser.hh"
#include "register_manager.hh"
#include "s... | [
"frrrwww@gmail.com"
] | frrrwww@gmail.com |
d02ccc15a648148326da6da3a1fa78f393d6ebce | 73bd731e6e755378264edc7a7b5d16132d023b6a | /CodeForces/984C-1.cpp | bf411f36b609cb3e8c0b6b4a4a4f866669c6fe48 | [] | no_license | IHR57/Competitive-Programming | 375e8112f7959ebeb2a1ed6a0613beec32ce84a5 | 5bc80359da3c0e5ada614a901abecbb6c8ce21a4 | refs/heads/master | 2023-01-24T01:33:02.672131 | 2023-01-22T14:34:31 | 2023-01-22T14:34:31 | 163,381,483 | 0 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 443 | cpp | // BISMILLAHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
#define MAX 100005
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll p, q, b;
int test;
cin>>test;
while(test--){
cin>>p>>q>>b;
if((__gcd(p, q) == 1 && q != 1)){
... | [
"iqbalhrasel95@gmail.com"
] | iqbalhrasel95@gmail.com |
e712eb76ad5c47169479e35627da488d52b7d5a4 | 12f1f7ab61455837e5dc378493e9db527905c1d9 | /3_纯惯导/pureINS_c_plus/ins.cpp | 85283cd5ea7d8b87a282aec3178dad9a38b7c9ec | [] | no_license | huhujiajia/GPS-INS | acb00f2d199ce570ebca2c743ef4ecfd0fb00ffa | 49c92b1cd47c5f67afc00ef19a08f764e00eb6df | refs/heads/master | 2020-09-10T03:04:09.363543 | 2019-03-26T04:05:29 | 2019-03-26T04:05:29 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 8,918 | cpp | #include "ins.h"
int INS::read_file(string filename, InsData *ins_data)
{
FILE *fp;
// 以"r"模式打开时，读到0x1A会意外终止
if((fp = fopen(filename.c_str(), "rb")) == NULL)
{
cout<<"can't open file "<<filename.c_str()<<endl;
return 0;
}
int ncount = 0;
double buf[7];
while(!feof (fp))
{
try
{
f... | [
"none"
] | none |
3de1eb1ef369a7a3aa59d7076f043ddb0ac8ef29 | 3aa9a68026ab10ced85dec559b6b4dfcb74ae251 | /love babbar series/Arrays/move_neg_to_left.cpp | 107a7f94aff1e0a8cbde8a499df5f7a909510d2e | [] | no_license | kushuu/competitive_programming_all | 10eee29c3ca0656a2ffa37b142df680c3a022f1b | 5edaec66d2179a012832698035bdfb0957dbd806 | refs/heads/master | 2023-08-17T15:09:48.492816 | 2021-10-04T20:09:37 | 2021-10-04T20:09:37 | 334,891,360 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,171 | cpp | /**********************************************
Author: kushuu File: move_neg_to_left.cpp Date: Tue Nov 03 2020
**********************************************/
#include <bits/stdc++.h>
//shorts
#define ll long long int
#define sll stack<long long int>
#define vll vector<long long int>
#define ld long double
#defi... | [
"sonikushu007@gmail.com"
] | sonikushu007@gmail.com |
7071e1eea6f79a60f5770568810b8c61a236301b | 2c721e4b4f9b4e893578f6ea728a7bf70bd1be87 | /20200210 前K个高频元素 字符串 堆排序 桶排序 多方法.cpp | d25c3db69764159c8f1c0da66e421c0ce09b6185 | [] | no_license | Y-puyu/Everyday_Coding | 74060ae37de7c64d48bdb16cc02fd06bbab20eb1 | b6204c986116c0a158b6e087045c32818febe162 | refs/heads/master | 2020-07-19T01:50:00.412119 | 2020-04-20T15:13:12 | 2020-04-20T15:13:12 | 206,354,309 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,102 | cpp | // 执行用时 :20 ms, 在所有 C++ 提交中击败了86.59%的用户
// 内存消耗 :11.6 MB, 在所有 C++ 提交中击败了12.01%的用户
class Solution {
public:
vector<int> topKFrequent(vector<int>& nums, int k) {
unordered_map<int, int> m;
priority_queue<pair<int, int>> q;
vector<int> res;
for (auto a : nums) ++m[a];
for (auto it : m) q.push({ it.second, it.f... | [
"345462072@qq.com"
] | 345462072@qq.com |
2d35f5b69b5eee22c7c65d75206d831997dcf5e0 | c3ae8f4514802b7e43001bad7267b493c62ca293 | /C:C++/1152.cpp | 25d1b60545c97fbf1d18116dc8cdd49d0c11d8b0 | [] | no_license | Byeong-Chan/ByeongChan_PS_Note | 249db7602044cbb8ecd9c4fd0376a04203fa2059 | 4bd6931e876bd5663ca9dc6bd40fe7fcf45f80e8 | refs/heads/master | 2021-01-22T12:18:41.246693 | 2017-05-31T00:11:50 | 2017-05-31T00:11:50 | 92,718,603 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 146 | cpp | #include <stdio.h>
int main() {
char o[1000001];
int t = 0;
while(1) {
if(scanf("%s",o) == -1) break;
t++;
}
printf("%d",t);
return 0;
} | [
"SeoByeongChan@seobyeongchan-ui-MacBook-Pro.local"
] | SeoByeongChan@seobyeongchan-ui-MacBook-Pro.local |
068f1f6a868e21175789bc7b6d273d3a6c3c0757 | 50a80a61237aad8de8aae729c84225fc52eec03e | /lighting-controller.ino | 029a14c22691c6fcb26cab40d4a8c20b9139a5a8 | [
"MIT"
] | permissive | ContinentalBreakfast17/lighting-controller | 627350a1752f90e95bde8e02e4200e0b21cfdfdf | cda5a3c7d1493513eb8e519ac7b0c3da90ade84c | refs/heads/master | 2020-04-03T13:45:07.405743 | 2019-01-01T20:39:27 | 2019-01-01T20:39:27 | 155,296,631 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,727 | ino | #include <SPI.h>
#include <SD.h>
#include <ArduinoJson.h>
#include <FastLED.h>
#include "lighting.hpp"
typedef union SerialLong{
unsigned long l;
byte bytes[4];
}SerialLong;
// function declarations
void initFastLed();
bool pinIsValid(int pin);
CLEDController& getFastLed(int pin);
void initConfig();
int pa... | [
"hunterrhollant@gmail.com"
] | hunterrhollant@gmail.com |
264327422383cac9640f67049ea0878aa3a06edc | 2654ee72f08ae44e4d8f2aa4dc78cc3b8280ac1a | /Source/ProjectGhost/Weapon.h | c15b2b879ffe3153ee9291e7f99855b559cfcec1 | [
"MIT"
] | permissive | KristenSH/ProjectGhost | ff0fb8d6ddb9d48ba99ea715d480f73a59f2d57b | 3e07fb8fd71b2e21c259370a7d171804be5542a9 | refs/heads/master | 2022-06-29T21:43:34.540255 | 2022-06-16T15:05:55 | 2022-06-16T15:05:55 | 180,227,918 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,870 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "GameFramework/Actor.h"
#include "DrawDebugHelpers.h"
//#include "Kismet/GameplayStatic.h"
#include "Particles/ParticleSystem.h"
#include "PhysicalMaterials/PhysicalMaterial.h"
#include "Proje... | [
"kristen.s.haave@outlook.com"
] | kristen.s.haave@outlook.com |
4346d24dbec1dcd46234f46b064a7df1ad653b2e | 073dfce42b384c9438734daa8ee2b575ff100cc9 | /RCF/include/RCF/RcfServer.hpp | bdd9f8f653830f057ca7185d244736460db13d81 | [] | no_license | r0ssar00/iTunesSpeechBridge | a489426bbe30ac9bf9c7ca09a0b1acd624c1d9bf | 71a27a52e66f90ade339b2b8a7572b53577e2aaf | refs/heads/master | 2020-12-24T17:45:17.838301 | 2009-08-24T22:04:48 | 2009-08-24T22:04:48 | 285,393 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,977 | hpp |
//******************************************************************************
// RCF - Remote Call Framework
// Copyright (c) 2005 - 2009, Jarl Lindrud. All rights reserved.
// Consult your license for conditions of use.
// Version: 1.1
// Contact: jarl.lindrud <at> gmail.com
//*****************************... | [
"r0ssar00@gmail.com"
] | r0ssar00@gmail.com |
c49ab16d4e39b9740b4e886ac4ff7a8eba3b8f9c | a02cf531acab22e3bc78f435121f8043eeee102d | /algorithm/uglyNumber/uglyNumber.cpp | 97202ada40cccd0cdd25015d67452388d1f728c0 | [] | no_license | zhwufd/emmettLeetCode | dfc6ae7febc81ca064e2643281a011f040a3363a | c6f5a252a5aef0f2dacd9346039bb5e4ddb3486d | refs/heads/master | 2022-11-16T06:20:15.312324 | 2015-12-10T07:07:28 | 2015-12-10T07:07:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 354 | cpp | class Solution {
public:
bool isUgly(int num) {
if(num <= 0){
return false;
}
else{
num = divby(num,2);
num = divby(num,3);
num = divby(num,5);
if(num == 1){
return true;
}
else{
return false;
}
}
}
int divby(int num, int d) {
while(num%d == 0){
num = ... | [
"zehuiwu@126.com"
] | zehuiwu@126.com |
7a9bb0c4fe5f58a270f3b4b6e9fb692e91a151fd | 3b434d11911b603093db937397b807157affe7fd | /programs/util/sign_transaction.cpp | 6ea1cb0885223be326afa9c7dbb150eb2f653a9c | [
"MIT",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | pranishg/VIDPOW | 7616f4995c0c8db8b002448d96067eb56059962c | 9b72a70ff70f3e0b87b85fb3fb70cb5a70755db4 | refs/heads/master | 2020-03-26T20:13:14.409806 | 2018-08-19T14:50:14 | 2018-08-19T14:50:14 | 145,311,450 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,623 | cpp |
#include <iostream>
#include <string>
#include <boost/algorithm/string.hpp>
#include <fc/io/json.hpp>
#include <fc/reflect/reflect.hpp>
#include <fc/variant.hpp>
#include <graphene/utilities/key_conversion.hpp>
#include <wls/protocol/transaction.hpp>
#include <wls/protocol/types.hpp>
struct tx_signing_request
{
... | [
"pranish@fnt.com.np"
] | pranish@fnt.com.np |
94cc16c30c672a027ee8794cef555b3768af836b | 393320d4dc9463ae7047390e4afe6f3e25fd70b9 | /tek2/C++/Pool/cpp_d09/ex02/Mage.cpp | e0a3e273d2462d03c8c2f6795aece053a17b4804 | [] | no_license | Lime5005/epitech-1 | d1c4f3739716173c8083ea4e6a04260d6dc92775 | cb25df1fa5d540624b9e7fd58de6e458cd5cc250 | refs/heads/master | 2023-02-09T07:38:57.850357 | 2019-10-14T15:03:44 | 2019-10-14T15:03:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,366 | cpp | /*
** Mage.cpp for cpp_d09 in /home/gogo/rendu/tek2/cpp_d09/ex02/Mage.cpp
**
** Made by Gauthier CLER
** Login <gauthier.cler@epitech.eu>
**
** Started on Thu Jan 12 16:16:07 2017 Gauthier CLER
** Last update Thu Jan 12 16:16:07 2017 Gauthier CLER
*/
#include <iostream>
#include "Mage.hh"
Mage::Mage(const std::st... | [
"gauthier.cler@epitech.eu"
] | gauthier.cler@epitech.eu |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.