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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0eb79c5f24f453a1acccc471162331b3dbe2cad5 | 5637c3e1214650e3c95d5a882c3e30498219ece6 | /GameEngine/GameEngine/ForceComponent.cpp | 62386be320244d5b74a17a3ce7d77d35bf1901ec | [] | no_license | JacobGathof/GameEngine | 2e1ff8fbf2cebc46c789cb99cdbd317e0e97a7c1 | 1de135464dfa7ff48158aa5038274a499634b140 | refs/heads/master | 2020-03-28T16:10:59.829536 | 2018-09-13T17:53:54 | 2018-09-13T17:53:54 | 148,667,681 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 739 | cpp | ForceComponent.cpp | #include "ForceComponent.h"
#include "Object.h"
ForceComponent ForceComponent::comp;
ForceComponent::ForceComponent()
{
}
ForceComponent::~ForceComponent()
{
for (auto f : forces) {
delete f;
}
}
ForceComponent * ForceComponent::getComponent()
{
return ∁
}
bool ForceComponent::update(float dt)
{
parent... |
a86ca435789ab5f922f334f7f7432e8b219476d4 | a9c12a1da0794eaf9a1d1f37ab5c404e3b95e4ec | /XTServer/XTTradeServiceFactory.cpp | 112709146a4cd04a1bb0094a863a23fb843dc689 | [] | no_license | shzdtech/FutureXPlatform | 37d395511d603a9e92191f55b8f8a6d60e4095d6 | 734cfc3c3d2026d60361874001fc20f00e8bb038 | refs/heads/master | 2021-03-30T17:49:22.010954 | 2018-06-19T13:21:53 | 2018-06-19T13:21:53 | 56,828,437 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,140 | cpp | XTTradeServiceFactory.cpp | /***********************************************************************
* Module: XTTradeServiceFactory.cpp
* Author: milk
* Modified: 2015年3月8日 13:42:10
* Purpose: Implementation of the class XTTradeServiceFactory
***********************************************************************/
#include "XTTradeServic... |
eeb7ffa063f3c551b3f4abd0b2fd0ade677cea57 | 587e228aa2069010c5f65d9b767153aa8aeae558 | /LCLaser/src/display/drawSlice.h | 87fc369c19610fe369f5ada9eca5c14e521b620d | [] | no_license | zb939938758/RPLaser | f17347866e51fd7436ce6f6c5869c01456cea9df | dc15c34466242ab06e2d20492710e515a7f540d8 | refs/heads/master | 2020-04-01T20:07:44.020559 | 2018-10-18T08:33:17 | 2018-10-18T08:33:17 | 153,589,710 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 941 | h | drawSlice.h | /***************************************************************************
drawSlice.h - description
-------------------
begin : Jun. 3 2015
copyright : (C) 2015 by XI'AN JIAOTONG UNIVERSITY
author : Cui Bin
... |
c54e0006481da5f63a6e9dc65829971d3b7d4818 | ba15ea732d860cd1f699c4754a8ea1f0a7da9732 | /p112.cpp | 9f4bd15255207d0c25b97de510da50bf545308df | [] | no_license | kbukin1/euler | dfcd5339d7e5574fd20f748e02643ba969dbe574 | 8a181fbcd9ab4d85250182e289f28f45deabc467 | refs/heads/master | 2020-12-25T17:37:23.509555 | 2016-09-09T01:19:54 | 2016-09-09T01:19:54 | 24,296,228 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,155 | cpp | p112.cpp | #include <iostream>
#include <string.h>
#include <stdio.h>
typedef unsigned long long Int;
//typedef int Int;
bool is_bouncy(Int n) {
char s[12];
sprintf(s, "%llu", n);
Int size = strlen(s);
bool inc = true;
for (Int i = 0; i < (size-1); ++i) {
if (s[i] > s[i+1]) {
inc = fals... |
656b3fa0b1ab5ba87e3f8ce16e9f267f6b02d3b3 | fb7efe44f4d9f30d623f880d0eb620f3a81f0fbd | /chrome/browser/background_fetch/background_fetch_delegate_impl.cc | 7714df33ff5e89ed3d1795d2af57c982160c7e17 | [
"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,000 | cc | background_fetch_delegate_impl.cc | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/background_fetch/background_fetch_delegate_impl.h"
#include <utility>
#include "base/bind.h"
#include "base/guid.h"
#include "b... |
4b9df3b9dfd3f00c5f1b3c04589c0c9b57f94ece | 820b6af9fd43b270749224bb278e5f714f655ac9 | /Filters/Modeling/vtkLinearCellExtrusionFilter.cxx | 81690502ae6aed89714b0a7a53dd51a9a7104812 | [
"BSD-3-Clause"
] | permissive | Kitware/VTK | 49dee7d4f83401efce8826f1759cd5d9caa281d1 | dd4138e17f1ed5dfe6ef1eab0ff6643fdc07e271 | refs/heads/master | 2023-09-01T10:21:57.496189 | 2023-09-01T08:20:15 | 2023-09-01T08:21:05 | 631,615 | 2,253 | 1,243 | NOASSERTION | 2023-09-14T07:53:03 | 2010-04-27T15:12:58 | C++ | UTF-8 | C++ | false | false | 7,472 | cxx | vtkLinearCellExtrusionFilter.cxx | // SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#include "vtkLinearCellExtrusionFilter.h"
#include "vtkCellArray.h"
#include "vtkCellArrayIterator.h"
#include "vtkCellData.h"
#include "vtkInformation.h"
#include "vtkMergePoints.h"
#include "vt... |
eef54ca80dbd14a985dd2e9837c0e72048c278b9 | cf78a9f38e15a1f3e422b30fe247e3907ffa5b8f | /ExceptionList.cpp | f0643c3f2ffa620f3d03b978364709d91856801f | [] | no_license | xel23/StatisticsMultiset | 35d9e99d07225dc5cccdd6226191fb59b8e8c599 | 3f67413a1dff67cbd365ad4bf4ce6579313456f7 | refs/heads/master | 2020-04-21T21:15:43.570979 | 2019-02-09T14:16:01 | 2019-02-09T14:16:01 | 169,873,196 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 241 | cpp | ExceptionList.cpp | #include "ExceptionList.h"
ExceptionStatisticMultiset::ExceptionStatisticMultiset(const std::string & message) noexcept : text_error(message){}
const char * ExceptionStatisticMultiset::what() const noexcept
{
return text_error.c_str();
}
|
1fe76fef7ba2b244bd1529dee0cc18fecb17324f | 3d1d4001591d611c34cd1ce9bd48ffcb83ad0773 | /RubixCube/Output.hpp | be79196f7f49d1b0194a60a3a218353b84872924 | [] | no_license | JasonBonvie/Rubix-cube-solver- | d9a390695049b5cdc89bcae476d88b30940415b2 | b7a23e51e807a903c30d50b0b2fe8f19ec3be62c | refs/heads/master | 2021-06-12T19:55:28.271577 | 2017-04-18T17:37:01 | 2017-04-18T17:37:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 412 | hpp | Output.hpp | #ifndef Output_H
#define Output_H
#include <string>
using namespace std;
class OutputNode {
public:
string color;
int dir;
void Print(void);
OutputNode* next;
OutputNode* previous;
OutputNode(void);
void Add(int dir);
};
class Output {
public:
bool liveAdd;
OutputNode* first;
OutputNode* las... |
972aef03c41dae4f7bb865bfa59051c72410bb60 | eda2b5b80a7caff953ddabd69efbc62a15f49295 | /HuboCan/HuboCanId.hpp | 56f78d514cae294c6129af0b0f1f412ed4a15d03 | [
"BSD-2-Clause"
] | permissive | yeseuleee/HuboCan | 75def37fd20e2e8f9b8019bc3ea2d7d4e680635f | eff17979148692359d6b81303fc0159723c958be | refs/heads/master | 2020-05-16T15:35:42.333889 | 2017-03-27T21:12:54 | 2017-03-27T21:12:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,177 | hpp | HuboCanId.hpp | /*
* Copyright (c) 2015, Georgia Tech Research Corporation
* All rights reserved.
*
* Author(s): Michael X. Grey <greyxmike@gmail.com>
*
* Humanoid Robotics Lab
*
* Directed by Prof. Mike Stilman <mstilman@cc.gatech.edu>
*
* This file is provided under the following "BSD-style" License:
* Redistribution an... |
81e1aa7a26b594cc124b22f07508fe3232e0bb67 | b7aade913307bbc3843ac0fdbff0f1b36c3a5f54 | /src/sw/redis++/event_loop.h | 33e31025122328f251a399c397cb3c9b10226734 | [
"Apache-2.0"
] | permissive | sewenew/redis-plus-plus | c6bc5cc597d0b35898c033e9772ba1c3d756cb8f | fb020fa1f6e116738cda2dfcbb064a5320664b4a | refs/heads/master | 2023-08-22T16:00:04.370011 | 2023-08-03T08:39:07 | 2023-08-03T13:28:25 | 114,471,005 | 1,357 | 341 | Apache-2.0 | 2023-09-14T21:15:45 | 2017-12-16T15:35:05 | C++ | UTF-8 | C++ | false | false | 3,463 | h | event_loop.h | /**************************************************************************
Copyright (c) 2021 sewenew
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/licen... |
2d7b4a31bab26c710970c1c678787d3549761b9f | 380061c0415ed0d76acbbd1da00d9d42a650ba15 | /src/Integrative_Phys/Physiological_layer/Single_Time_property.cpp | 3908cb5942fb6085aebe0488e9bc95d2ff59fbe0 | [] | no_license | velociraptors/physio_mist | 551d266d3fb911088d83d5b735f080f4168a47c4 | d69aed766561cfb85071304797dba23af70a4aca | refs/heads/master | 2021-01-17T04:25:00.300402 | 2009-12-04T18:21:47 | 2009-12-04T18:21:47 | 313,483 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | cpp | Single_Time_property.cpp | /*************************************************************************************************
Single_Time_property.cpp
Implementation of the Class Single_Time_property
Contributor(s): E. Zeynep Erson
Created on: 26-Jul-2007 2:05:16 PM
***********************************************************************... |
3e34841a5d974a768e146ca2d983d6704930eabb | a803e9a42975f0e88da7cd8794dc518f528988e8 | /Drivers/Platform/PlatformBareMetal/inc/UartBareMetal.hpp | 2d7e59cbcb826523446c08170ee1ecf2376ceb49 | [] | no_license | engZafer35/Apartment_Management_System | a23128b80ff2c6a0597b94706177787ecf0ed6d8 | 256223a367f170a7e8acb2900d7fd1b2bd652d3e | refs/heads/master | 2020-08-24T16:13:16.432221 | 2020-03-20T18:38:51 | 2020-03-20T18:38:51 | 216,861,563 | 0 | 1 | null | 2020-03-20T18:38:52 | 2019-10-22T16:37:41 | C++ | UTF-8 | C++ | false | false | 2,403 | hpp | UartBareMetal.hpp | /******************************************************************************
* #Author : Zafer Satılmış
* #Revision : 1.0
* #Date : Nov 17, 2019 - 10:08:29 PM
* #File Name : UartBareMetal.hpp
* #File Path : /GezGor/Drivers/Platform/PlatformBareMetal/inc/UartBareMetal.hpp
*********************... |
c511cf00eb2c773a5ced38342662e6466df1fa99 | a9b69a4178503c6ec666b4cb41ad4ce560415d68 | /LinkLists/Iterator.h | fcb1c7c62cb170306ec5c8cee668af5a828764c8 | [] | no_license | Gage-Waguespack/LinkLists | d8bbfd606126f1fa917f5abf9acbee3cccef67e4 | 30a8136b0c79eb2a2b0156ef8ccb0450e69b867f | refs/heads/master | 2023-03-09T11:35:33.429405 | 2021-02-26T13:43:52 | 2021-02-26T13:43:52 | 335,709,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,482 | h | Iterator.h | #pragma once
#include "Node.h"
template<typename T>
class Iterator
{
public:
Iterator();
Iterator(Node<T>* node);
Iterator<T> operator++();
Iterator<T> operator--();
const bool operator == (const Iterator<T>& iter);
const bool operator != (const Iterator<T>& iter);
T operator * ();
private:
Node<T>* m_curren... |
fe4a9551c89bad0421af6c0048a661e8592a0ba4 | 869395920bfffb70e29949f14bdd7ca48e12ebdb | /winhttp/dllmain.cpp | 9e8bffd18da135f93ce5472159baef78099df5a0 | [] | no_license | buchacho/LSX-Dumper | 38e474963ff03147e03ef52d6b0aa35bf63831b1 | 3340d6bef6456bf45083e5856fb0b6fb270a6be1 | refs/heads/master | 2021-10-02T04:49:42.963638 | 2018-11-29T04:47:49 | 2018-11-29T04:47:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,339 | cpp | dllmain.cpp | #include "stdafx.h"
#include <windows.h>
#include <tchar.h>
#include "Hack.h"
#pragma pack(1)
extern "C" BOOL WINAPI DllMain(HINSTANCE hInst,DWORD reason,LPVOID)
{
static HINSTANCE hL;
if (reason == DLL_PROCESS_ATTACH)
{
hL = LoadLibrary(_T(".\\winhttp_org.dll"));
if (!hL) return false;
HackMain();
}
if (... |
ead8656effb91fb86e46e4668ed5b8249f75e61c | 6cf6e57b3ade80ac8bad676afcb623f1a52388f7 | /CPSim_MulticoreExtension/Simulator/engine/resource.cpp | ba73f2788e674d402a6e173fcd85959667eda008 | [] | no_license | CallorGRP/CPSim_linux | 97401c2d1e63b685e8e07fce0a8f5795a4eee2d3 | db40f2a33e4eafccb704b4d0d8b1636047bdf859 | refs/heads/master | 2020-04-14T09:54:52.685704 | 2018-01-22T12:49:42 | 2018-01-22T12:49:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 465 | cpp | resource.cpp | #include "components.h"
Resource::Resource(int id_input, int type_input, int ratio_input, int speed_input, char *name):Component(id_input)
{
type = type_input;
ratio = ratio_input;
speed = speed_input;
strcpy(resource_name, name);
}
Resource::~Resource()
{
}
int Resource::get_type()
{
return type;
}
int Resour... |
29f6b0d3ec401e93791c7ff8c007029c48895a70 | 0d4e28f7e9d961e45d32a4735ad7c1f76bbda34a | /ocs2_sqp/ocs2_sqp/include/ocs2_sqp/ConstraintProjection.h | 0e7dfe93fa0ebca101454ef1c871d5d7a5ff844a | [
"BSD-3-Clause"
] | permissive | RoboMark9/ocs2 | a4fc0c215ccb3a86afeffe93b6a67fb0d9dd9450 | b037d819c9a02a674de9badb628b32646ce11d6a | refs/heads/main | 2023-08-29T15:20:07.117885 | 2021-10-20T13:09:37 | 2021-10-20T13:09:37 | 453,286,119 | 1 | 0 | BSD-3-Clause | 2022-01-29T03:30:28 | 2022-01-29T03:30:27 | null | UTF-8 | C++ | false | false | 2,529 | h | ConstraintProjection.h | /******************************************************************************
Copyright (c) 2020, Farbod Farshidian. 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 mu... |
42b2d30438844dcece13122c6bfa66358928c7f7 | 7cde35a74052fe6311a6abb8fd8f5a7d98d27bd7 | /src/ui/output.h | 71132558448c88dd74305d0efa71ddb857e2b7a7 | [] | no_license | chys87/tiary | 7c2648857457d820bf1535865f25bc99c942d5a0 | 4beb95048280bb9096d5771b40c2f2071daf4333 | refs/heads/master | 2023-06-22T02:12:17.464305 | 2023-06-16T09:01:35 | 2023-06-16T09:01:35 | 3,160,484 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,716 | h | output.h | // -*- mode:c++; tab-width:4; -*-
// vim:ft=cpp ts=4
/***************************************************************************
*
* Tiary, a terminal-based diary keeping system for Unix-like systems
* Copyright (C) 2009, chys <admin@CHYS.INFO>
*
* This software is licensed under the 3-clause BSD license.
* See... |
99f65149743caebab7a8e59d7586f483edd56532 | 0ab3011e5da1ea5f1f149a2ec588dd814ec542df | /MatMultThr/main.cpp | eca0162db4398c627c42119ea408924cde0ad182 | [] | no_license | HubuserAlexanderKorneev/University-programming-projects | d1bdd59d74e84109da07fc98f85158d589745cdf | ae93b749a4e5950d1525e70b8db2226b0c4e7738 | refs/heads/master | 2020-04-18T08:46:42.906374 | 2017-12-28T19:46:02 | 2017-12-28T19:46:02 | 67,817,486 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,122 | cpp | main.cpp | #include <pthread.h>
#include <stdlib.h>
#include <stdio.h>
#include <cstdint>
#define SIZE 10 // Size by SIZE matrices
int num_thrd; // number of threads
int A[SIZE][SIZE], B[SIZE][SIZE], C[SIZE][SIZE];
// initialize a matrix
void init_matrix(int m[SIZE][SIZE])
{
int i, j, val = 0;
for (i = 0; i < SIZE; i++)... |
81d7711424df37cfe8d43c1f3dfb1ea8252c22b3 | 8d1b2eb8b5fe400489aa94b23734d46495b69b1d | /MedView/OpenGLWindow.h | be208c860f9a1f145ef23e4b6dab25b1f3478a3a | [] | no_license | hky5820/MedView | 724738679ce814ffcac7010bea5470832eba33b2 | 56fb938f046527918f7463c7da9421ed309c6e1d | refs/heads/master | 2021-01-02T13:29:01.748595 | 2019-08-16T08:09:25 | 2019-08-16T08:09:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,600 | h | OpenGLWindow.h | #ifndef __OPENGL_WINDOW_H__
#define __OPENGL_WINDOW_H__
#include <QWindow>
#include <QOpenGLFunctions_3_3_Core>
#include <QOpenGLBuffer>
#include <QOpenGLVertexArrayObject>
#include <QOpenGLTexture>
#include <QKeyEvent>
#include <QMatrix4x4>
#include <QQuaternion>
#include "DicomManager.h"
#include "Utils/ArcBall.h"
... |
1e7ec1c82aa3ffd483aa7f0b82c77ddf9b1982eb | 28369ddf6db658c03dbbfc45eb00305f2af1b01a | /Shape.h | 6cc3016d89074a160697c88198c45db63e833d94 | [] | no_license | Sidhanth-Kafley/Simon-Says-Game | ae5923e41dadc4825744cf23a130363bb1b83744 | 74ee94da185efc2ce53bdc87ef0b90b983203703 | refs/heads/master | 2023-03-16T05:42:56.521957 | 2020-05-01T22:08:02 | 2020-05-01T22:08:02 | 344,910,974 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,553 | h | Shape.h | //
// Created by Sydney Hildreth on 4/27/20.
//
#ifndef SH_SK_FINAL_PROJECT_GRAPHICS_SHAPE_H
#define SH_SK_FINAL_PROJECT_GRAPHICS_SHAPE_H
#include <cmath> // This allows you to use sqrt and pow functions
#include <string>
const double PI = 3.14159265358979323846;
struct color {
double red;
double green;
... |
9af494464f2c14e59a584c742106e895a017a3d8 | 9ff51146dc7b5893581237a05c2126e4292128a9 | /slist.cpp | 10babc1aa65ed2f5e5472b464090499176daad6b | [] | no_license | Hizkias-Negusu/List_of_Employees_temp | 7c9e5e0ee68accdad04f736585afac036d15be81 | 1b40592dc6b6565b0bf138d8b870a70cbc98b076 | refs/heads/master | 2020-05-24T23:14:18.871237 | 2019-05-19T18:14:54 | 2019-05-19T18:14:54 | 187,511,204 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,148 | cpp | slist.cpp | #include "slist.h"
//Negusu Hizkias Assignment 2
slist::slist () //Default constructor
{
head = NULL;
}
slist::~slist ()
{
//post-condition: All nodes in the list are deleted.
node* temp;
while (head != NULL)
{
temp = head;
head = head->getNext ();
... |
7caab1d2806e627b6f4048151f17f21ef950fa6e | df79ab66ce1f1a75b2db5d7de6e601c23b5015ef | /Conect_BD/main.cpp | df1a4869854529dacf97c4ed92eb1381541c4a6d | [] | no_license | VladZhylchuk/Course_project | 71a8b0eadeb672f6a04d5c38ea830e330453028b | 73691221cc945c11c878cb3c775138f4dcc51367 | refs/heads/master | 2022-11-06T01:04:43.870870 | 2020-06-24T09:34:04 | 2020-06-24T09:34:04 | 266,724,046 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 224 | cpp | main.cpp | #include "mainwindow.h"
#include <QApplication>
//#include "mainwindow.h"
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
MainWindow *main = new MainWindow();
main->show();
return a.exec();
}
|
e7b611b2a69949a38c255a439a725539d002c8d5 | 2195aa79fbd3cf2f048ad5a9ee3a1ef948ff6601 | /q3/qmpop3/src/pop3sendsession.cpp | cfeae735585b69ad1b987681297ecde6f73891cc | [
"MIT"
] | permissive | snakamura/q3 | d3601503df4ebb08f051332a9669cd71dc5256b2 | 6ab405b61deec8bb3fc0f35057dd880efd96b87f | refs/heads/master | 2016-09-02T00:33:43.224628 | 2014-07-22T23:38:22 | 2014-07-22T23:38:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,267 | cpp | pop3sendsession.cpp | /*
* $Id$
*
* Copyright(C) 1998-2008 Satoshi Nakamura
*
*/
#include <qmaccount.h>
#include <qmdocument.h>
#include <qmmessage.h>
#include "main.h"
#include "pop3sendsession.h"
#include "resourceinc.h"
#include "ui.h"
#include "util.h"
using namespace qmpop3;
using namespace qm;
using namespac... |
e9d4ed08a82d0e9f0d788fd7287b2372b309f7d8 | 9f9a189196b5118382339868c5a5da8874ac55b5 | /C++/03_提取/main_1.cpp | fc4deb0d02e04fa00bd622ec213ac1f01e747a3e | [] | no_license | wghfbj/Regex | 4c847723828d707bf74b9509b831bc59b751e0cd | 9102fae63024ae177b4232310a4ba8b53f5d2296 | refs/heads/master | 2020-04-10T11:33:12.636340 | 2018-12-09T02:38:21 | 2018-12-09T02:38:21 | 160,997,214 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 862 | cpp | main_1.cpp | #include <iostream>
#include <string>
#include <regex>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define TRUE 1
#define FALSE 0
class Demo
{
public:
Demo(string QQ);
string QQ;
bool CheckQQValid();
string QQShow(void);
};
Demo:... |
9cf6a2c8a796a2506f472e43b47f0bf34ebdbbaa | da1e13573e12f824403fda65882f369c6b76ee20 | /PWM1.ino | d9ce6f10015aad17b6055085bb1cea71e1317825 | [] | no_license | Jsamapro/arduino | 74daba2550ebb837d32f176e2c5af90d039edd2b | 18ce551585cfe9359343c62e3aa52f22efdd8f39 | refs/heads/main | 2023-03-23T04:45:53.954152 | 2021-03-19T12:42:36 | 2021-03-19T12:42:36 | 334,881,243 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 826 | ino | PWM1.ino | /*
DigitalReadSerial
Reads a digital input on pin 2, prints the result to the Serial Monitor
This example code is in the public domain.
http://www.arduino.cc/en/Tutorial/DigitalReadSerial
*/
// digital pin 2 has a pushbutton attached to it. Give it a name:
const int ledPin = 4;
const int buttonPin = 3;
void... |
f9b9b58ef14c1e0bea0e7be1a035aa9c5221bd3c | 74a11e21069f5a57bcf7643df171c3b6452c1d1c | /src/rogue-card/ActionBar.hpp | 77052474fee548453ba008971c5066aaa502bb83 | [
"MIT"
] | permissive | padawin/RogueCard | f8f5d56287af7c309d3d325365d52300924578cf | 7a5d04fa2d7be47c1542b6d4908e277ccbbd01fc | refs/heads/master | 2021-12-23T18:17:11.714704 | 2021-08-22T17:27:53 | 2021-08-25T15:00:14 | 170,905,465 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 672 | hpp | ActionBar.hpp | #ifndef __ACTION_BAR__
#define __ACTION_BAR__
#include <memory>
#include "ObjectCard.hpp"
#include "ObjectCardsLoopable.hpp"
const int ACTION_BAR_SIZE= 4;
class ActionBar : public IObjectCardsLoopable {
private:
std::shared_ptr<ObjectCard> m_objectCards[ACTION_BAR_SIZE] = {nullptr, nullptr, nullptr, nullptr};
pu... |
2378178c35e616f9f71a72455010e1b11a8bd149 | 43c62dd3d4d61261a30e17b876fa5bf852c6a364 | /dependencies/windows/ep_usbcamera/code/Media_Foundation.cpp | 462e0c38c497061a04b56079954bc1e82278e530 | [
"MIT"
] | permissive | iocafe/pins | 2fbc94fb16e5913d525606c7da64d5c136be5eb3 | 0d446aee48a4b0dd5b4bbb1eebc8ced14fbe767b | refs/heads/master | 2021-11-27T02:40:38.371957 | 2021-09-11T15:33:03 | 2021-09-11T15:33:03 | 208,724,298 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,430 | cpp | Media_Foundation.cpp |
#include <mfapi.h>
#include <mfplay.h>
#include "Media_Foundation.h"
#include "videoDevices.h"
#include "DebugPrintOut.h"
#include "Common.h"
Media_Foundation::Media_Foundation(void)
{
HRESULT hr = MFStartup(MF_VERSION);
if(!SUCCEEDED(hr))
{
DebugPrintOut *DPO = &DebugPrintOut::getInstance();
DPO->printOut... |
49d8ef6bf878af91cde727da1b15b010e59b4086 | 2a4ef849551205f4dc8b81c37b1f8d10684ea878 | /NoteBook/gcd_euclidesEx.cpp | 8bf9f7ae08c165077af5233ffec8ea376dc5a92b | [] | no_license | SergioRt1/Competitive-Programming | 6b20e87b34cc10d005d0b71105298bc9e55f1faf | 3913c099649f79d487e10edf5376cc723b3356fa | refs/heads/master | 2023-07-21T08:03:02.008252 | 2023-07-18T00:04:15 | 2023-07-18T00:04:15 | 167,759,672 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 1,221 | cpp | gcd_euclidesEx.cpp | Máximo común divisor - Algoritmo de Euclides (Euclides (300AC)] {0(log(arb))}
long gcd(long a, long b) {long t; while (b!=0) {t=b; b=a%b; a=t;} return a;}
Máximo común divisor precalculado {O(MP)}
int[][] gcd(int M) { // [O..M][0..M]
int r[][]=new int [M+1][M+1],i,j;
for (i=0; i<=M; i++) for (j=0; j<=M; j++) r[... |
6342b142bceeab076e5d4ed07f24fdc0596b92a1 | 497c528fd039d617c999e749739dceabca0ee405 | /WordOffice.cpp | 296bef43791d0cf9303f6be2b886fa4d46318075 | [] | no_license | 11Zero/MDIMonitor_MFC | 1bdfe9e02709bdcb00b5cecb9ad454300a27ee18 | 62a8fb88c207d730217ad3feef6a59b8839b6668 | refs/heads/master | 2021-01-20T02:19:23.097746 | 2017-03-08T15:40:26 | 2017-03-08T15:40:26 | 83,814,334 | 1 | 1 | null | null | null | null | GB18030 | C++ | false | false | 15,102 | cpp | WordOffice.cpp | #include "WordOffice.h"
CWordOffice::CWordOffice()
{
}
CWordOffice::~CWordOffice()
{
COleVariant vTrue((short)TRUE),
vFalse((short)FALSE),
vOptional((long)DISP_E_PARAMNOTFOUND, VT_ERROR);
m_wdApp.Quit(vFalse, // SaveChanges.
vTrue, // OriginalFor... |
d4dd9ad0033a628bd4894806ff824a5c3729f5b7 | 76cb020e670ef876d2b0f52781c8acc57849af62 | /bruinbase/BTreeIndex.cc | 8d57eae611b155d24a7157bd9ee628bb93520cd1 | [] | no_license | kes33/project2 | 5ce9e01f3797bb9e9c7c24a5fd2d322b212db945 | 3f75d537f93208fce9d13b0321fdb37bdcfacd8d | refs/heads/master | 2020-05-18T03:48:36.762308 | 2013-03-11T04:40:28 | 2013-03-11T04:40:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,497 | cc | BTreeIndex.cc | /*
* Copyright (C) 2008 by The Regents of the University of California
* Redistribution of this file is permitted under the terms of the GNU
* Public License (GPL).
*
* @author Junghoo "John" Cho <cho AT cs.ucla.edu>
* @date 3/24/2008
*/
#include "BTreeIndex.h"
#include "BTreeNode.h"
#include <iostream>
#defin... |
c6f3a2b4cb1fb97ff14a20176cfe4e8dee02a2f2 | 4e6e1e94f239d7a7d88403925f8f59e06b318989 | /anagram.cpp | 895702c015d1b4196277ea31801dae8d4fb7aa69 | [] | no_license | gpNethen/anagram | 98dbb165709b87a580b6e4ee0acde15947358730 | 85e7813174d76983a13ce948f66f979b5e201f3b | refs/heads/master | 2020-04-30T10:15:02.013361 | 2019-03-20T16:22:51 | 2019-03-20T16:22:51 | 176,772,207 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 408 | cpp | anagram.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
string stringIn;
cout << "This program analyzes two lines of input and confirms/disconfirms" << endl;
cout << "Their status as an anagram in relation to one another." << endl << endl;
cout << "Please enter your first line below:" <<... |
df9dbaef063a36fc7949f45243df695a0685b82c | efd43a5e5e4b2f0827140b8f3dc836983b2e0016 | /Hackerrank/BeautifulTriplets.cpp | e9ccc3eb5442976d70c5db173e68283ba69dd06a | [] | no_license | praveenagrawal/practiceCodes | c5641c01f41046797e2be917969599a8eb98458b | 62b3455d011bfe6681f00c43fc2977794612cd04 | refs/heads/master | 2020-12-24T07:18:27.424580 | 2019-08-18T13:00:17 | 2019-08-18T13:00:17 | 58,453,613 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 618 | cpp | BeautifulTriplets.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n,d;
cin>>n>>d;
int M = 20001;
std::vector<int> a(n);
std::vector<bool> status(M,0);
... |
89d8bd799134627e203f2e255987620924b99ead | 8ae41115b878aa5c14fbf13ddbc681282762ae32 | /FushigiDungeon/HUD.h | eb91f232480766b27e70c3b133c8463b5337ab91 | [] | no_license | assbee0/FushigiDungeonCplus | be0aab3151430204d379e70723ccee3a44d7a074 | e83978ba394aae116412b3e0ba46bfc97afa8d37 | refs/heads/master | 2023-03-07T15:22:08.795508 | 2021-02-20T15:11:53 | 2021-02-20T15:11:53 | 332,395,764 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 513 | h | HUD.h | #pragma once
#include "UIScreen.h"
class HUD : public UIScreen
{
public:
HUD(class Game* game);
// Should be called when floor is changed to update the status
void SetFloor(int f) { mFloor = f; UpdateValues(); }
// Should be called when any of the values (except floor) are changed to update the status
void SetSt... |
a0cdb6a5756ddcf37a127c20e0730a5740b3d6b5 | af3e74628def42209bbd059fe91aedf9dd7e7b40 | /Dan01/vezba1.cpp | a12d9c324d2c2de6625999e1b7078afb2233aa08 | [] | no_license | mirkocuidado/RTRK-tasks | 46e1a6d1fcd1d05275460ee0b71dabfcd27dbe42 | 53b877de4e75154c23ff26433b9797723179f281 | refs/heads/master | 2022-12-13T06:58:32.321702 | 2020-09-16T22:20:29 | 2020-09-16T22:20:29 | 296,159,645 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 617 | cpp | vezba1.cpp | #include <iostream>
struct Node {
Node() {}
Node(int e, Node* n) : elem(e), next(n) {}
int elem = 0;
Node* next = nullptr;
};
void add(Node& n, int x) {
n.next = new Node(x, n.next);
}
int main() {
Node head;
add(head, 1);
add(head, 2);
add(head, 3);
add(head, 4);
add(head, 5);
for (Node* p = head.next... |
f8ca5d9a05c741309f8e694158a248bcf52f8359 | 8f532ff3a52ed60e391eaa61ecb13700564cdc96 | /spring.cc | 1dc45ed29beba314bb3548e871c3713dbfd67cf5 | [] | no_license | ostingrey/tochnog | 2f3e085eb818c18381ad520076f52110cbfad26f | a2407e0059d681d7e76d37847b5ebc2822e04c32 | refs/heads/master | 2023-03-16T21:04:17.545278 | 2016-10-23T22:06:34 | 2016-10-23T22:06:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,985 | cc | spring.cc | /*
Copyright (C) 1998 Dennis Roddeman
email: dennis.roddeman@feat.nl
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 ... |
3bc294b0ed95e4e1e3011c89afe54361387609ec | a97b9ad50e283b4e930ab59547806eb303b52c6f | /class/4nov_plate/340/p | a27ed0a3471a1569093ebd68792006da29714bdd | [] | no_license | harrisbk/OpenFOAM_run | fdcd4f81bd3205764988ea95c25fd2a5c130841b | 9591c98336561bcfb3b7259617b5363aacf48067 | refs/heads/master | 2016-09-05T08:45:27.965608 | 2015-11-16T19:08:34 | 2015-11-16T19:08:34 | 42,883,543 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 114,704 | p | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.4.0 |
... | |
0053f0a59fccc49f61238ae687dab545804488a0 | e56cec9fe0e16436f2cdae4ab0b69080c488b368 | /src/binaryTreeMaximumPathSum.cc | 96fa08e90f73bfe33da90f230ba15962295ea1f9 | [] | no_license | sreenivaskodur/leetcode-solutions | 34fb4ec55bfccf5eff1eab985d998e1638466a87 | 888a248ec397281198b3d427ed5f6c0ee7ccda11 | refs/heads/master | 2021-01-10T19:24:47.754433 | 2014-01-27T17:40:43 | 2014-01-27T17:40:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 988 | cc | binaryTreeMaximumPathSum.cc | /**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
int maxSum;
int maxPathSumHelper(TreeNode *root){
int l = (root->left == NULL) ? INT_... |
b220eff61f007ca72436d7836fed45103494bc57 | 691abe5f62df930ae7420d00f48e5b2f7f57faed | /atcoder.jp/arc042/arc042_b/Main.cpp | 361e8c986cdaff4a489f266bff5333c913d536ab | [] | no_license | Volverman/procon-archive | 2fa9d10d0a655590f2c6342c5e494deff5718c73 | 834adc4a70a275eb28cea6d724ee5cc5d926ffe7 | refs/heads/master | 2022-12-18T23:40:48.494023 | 2020-09-12T07:48:48 | 2020-09-12T07:48:48 | 294,258,109 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 819 | cpp | Main.cpp | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... |
44aed6fed1737efc75a7982621b30c2c71fca1a1 | df0ea88f1b1dfb79f1aecff51d96d81702d2201f | /src/Ext/TechnoType/Body.cpp | 8557942e0832624e4b1d0c96735d745aaf500734 | [
"BSD-2-Clause"
] | permissive | secsome/Antares | ea62178d0fca56156f8d8549382f1733dc380f68 | 412b5500bae41104c9da2bc4169cb06a784472b8 | refs/heads/master | 2023-06-08T01:02:22.743252 | 2021-06-27T12:48:09 | 2021-06-27T12:48:09 | 380,737,035 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 29,917 | cpp | Body.cpp | #include "Body.h"
#include "../BuildingType/Body.h"
#include "../HouseType/Body.h"
#include "../Side/Body.h"
#include "../../Enum/Prerequisites.h"
#include "../../Misc/Debug.h"
#include "../../Utilities/TemplateDef.h"
#include <AbstractClass.h>
#include <HouseClass.h>
#include <PCX.h>
#include <Theater.h>
#include <Vo... |
36df9c2b22d717ea55ad675953c73b6e5f496d9d | 915df68a021c45fabadfeb9533a719992f209eca | /gabarito_prova/questao_02.cpp | 7b36dd97b25e6c9d195844717ca0db1c9b8495ad | [] | no_license | senapk/ed_2018_1 | a09e6a3da4b108feee385a6df2283263afd8dbb8 | d06848deea86e1218dbe9942fdcc42201be6f7ec | refs/heads/master | 2020-04-09T18:32:12.806810 | 2018-06-29T20:14:44 | 2018-06-29T20:14:44 | 124,239,446 | 1 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 999 | cpp | questao_02.cpp | #include <iostream>
#define NL 5
#define NC 5
#define OPEN 0
#define TREE 1
#define BURN 2
bool queimar(int mat[NL][NC], int c, int l){
if((c < 0) || (c >= NC) || (l < 0) || (l >= NL))
return false;
if(mat[l][c] != TREE)
return false;
mat[l][c] = BURN;
if(c == NC - 1) //ultima coluna
... |
b9b352aa190967d42e87b41c0789127fdf596440 | 68e09b438498177bc00f734ba043390a4baca4ee | /RubeusCore/Source/Architecture/game.cpp | 65c66a0af70ec0c679f35be6d08e19d806d7b0aa | [
"MIT"
] | permissive | sdslabs/Rubeus | 75912743419c487a225593caf809faf0c1d89c18 | 03c39a1f1c0465ba16609f273e8a8bde85590ea3 | refs/heads/v3 | 2021-06-12T04:40:10.397731 | 2021-03-22T23:00:44 | 2021-03-22T23:00:44 | 134,358,438 | 187 | 24 | MIT | 2023-07-22T14:09:24 | 2018-05-22T04:00:10 | C++ | UTF-8 | C++ | false | false | 337 | cpp | game.cpp | #include <game.h>
#include <engine.h>
namespace Rubeus
{
RGame * RGame::CurrentGame = NULL;
RLevel * RGame::CurrentLevel = NULL;
RGame::RGame()
: m_StartupLevel("")
{
Rubeus::UtilityComponents::RLogger::CreateLogFile();
m_Engine = new Rubeus::REngine();
CurrentGame = this;
}
RGame::~RGame()
{
delet... |
1317089901106bab82e0ba71ff706f3adc62d540 | 65433ee18c4d2f48099bc7b4d8b3ce7f859cb395 | /Fundamentals/CustomArray/Source.cpp | 47e4408e4eb4946fb031bab4fda6812c71bf57e8 | [] | no_license | dileepbalakrishnan/CPP | 81cbd915d8cdeb7c61f56bedab330a26fcfbfdfa | bf21b734443c59e59571e9877b9d27a4076ea9ca | refs/heads/master | 2020-06-03T15:10:13.426432 | 2019-06-25T17:16:05 | 2019-06-25T17:16:05 | 191,620,729 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,644 | cpp | Source.cpp | #include<iostream>
class IndexOutOfBoundsException{};
class IntArray
{
private:
int* _ptr{ nullptr };
int _size{0};
public:
IntArray() = default;
explicit IntArray(int size)
{
if (size != 0)
{
_ptr = new int[size] {};
_size = size;
}
}
// Copy constructor to prevent shallow copying... |
d5159c18bd03f1ae6cd7c789b9e0223a3cf7e4c2 | 0f3b6f1788df3feadd79df39e0bd930874572e01 | /C++ Language/textstats.cpp | e3f189df9b172617cce8695e2396a337d1d91817 | [] | no_license | ROOOOO/Study | 978c0c81cdc75573ac1480da2427bcf0e23e12ae | caf5636f8c12979ba6aa9941e6293f3ad8cfc3a7 | refs/heads/master | 2021-01-10T16:10:50.001231 | 2016-03-18T18:27:23 | 2016-03-18T18:27:23 | 54,218,816 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,068 | cpp | textstats.cpp | #include "textstats.hpp"
#include <algorithm>
void get_tokens(const string &s, const unordered_set<char> &delimiters, vector<string> &tokens){
int i, pos=0, len = 0, l = (int)s.length();
for(i = 0; i<=l; i++, len++){
if(delimiters.find(s[i])!=delimiters.end() || s[i]=='\0'){
string s1 = s.su... |
2562ea1bd5c1c588f355d96ca4a8942ab65d0d3f | 90a3d0060d256592ccd1aded3d901b9cccb8ad04 | /ircd/info.cc | 7f75782fe245e67f62b0d6e1b51aa9294a3ae850 | [
"BSD-3-Clause",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | Evidlo/construct-1 | f2e327463e9489256ec54ae0988544f3912d564c | 6bd26ecbb3ed36653fdcb964b34ee24e86b17241 | refs/heads/master | 2020-05-18T04:00:58.847758 | 2019-04-25T10:16:24 | 2019-04-25T10:16:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,964 | cc | info.cc | // Matrix Construct
//
// Copyright (C) Matrix Construct Developers, Authors & Contributors
// Copyright (C) 2016-2018 Jason Volk <jason@zemos.net>
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice... |
5bee7b8bb2f71fabc683ef7da0b79aed0c2faacd | da7adaf6568083dddfe74684f0812a0942dff0c4 | /src/compiler/libsherpa/utf8.cxx | 0e27a70d681f79db322b59e7bfc95562c784dc85 | [] | no_license | LakatosI/bitc | ea29692b87c430018b9a68da642a77d9b3137bf6 | e9f37d026ad2eeba221c73b2b6d7628c1b914205 | refs/heads/master | 2021-12-02T23:58:23.784850 | 2012-03-19T04:06:42 | 2012-03-19T04:06:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,839 | cxx | utf8.cxx | /**************************************************************************
*
* Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, The EROS
* Group, LLC.
* Copyright (C) 2004, 2005, 2006, Johns Hopkins University.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or
* wit... |
3489a2f6a551a776b5a59852ebbac7b2e408f8f1 | bc6e1c20e2542169f92597a00bbb8f281d409512 | /src/generator/digest.h | 2c5c1dea14a97af59a74cbb3c8b560ab5dafeaaf | [] | no_license | wiku30/Plagiarism_Detection | dbcc034351761e6a835cc8e9feafc2bcb80fc7a2 | 2efbe2124e5c15a2b227f53bf5086d93d3dee428 | refs/heads/master | 2022-02-19T16:19:25.074895 | 2019-09-16T22:45:04 | 2019-09-16T22:45:04 | 208,911,535 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 398 | h | digest.h | #pragma once
#include "cmp_kr.h"
#include <vector>
class digest: public cmp_kr
{
private:
const static int hash_length;
const static int window_range;
std::vector<long long> window;
std::vector<long long> list;
int length() const{return -1;}
int head;
bool isvalid;
public:
digest();
void load(const source& ... |
8423ded6fa6fcf335bd5e0ac93dae862bb2e6ba3 | 8e524bdb31b913a26e10f0a2798240ebfbbe6dae | /xlserialport.h | 173107298bfff36693a9777442086d00ef11ac21 | [] | no_license | xuleicode/xlSerialPort | 6e11c939df8d0d91b70f8cf55d2dbefb221a2ca4 | 4c0c65391f06ea2faeb495161543b95e1d557c19 | refs/heads/master | 2021-09-06T01:20:51.692953 | 2018-02-01T06:40:36 | 2018-02-01T06:40:36 | 119,655,852 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,328 | h | xlserialport.h | #ifndef XLSERIALPORT_H
#define XLSERIALPORT_H
#include <QtWidgets/QMainWindow>
#include "ui_xlserialport.h"
#include "qdrawwidget.h"
#include "qcomwidget.h"
class QAction;
class QToolBar;
class QPushButton;
class QLabel;
class QMenu;
class QSystemTrayIcon;
class QString;
class QTimer;
class QDockWidget;
class MainWin... |
97f2e690e14b7a5a47cd8061ed198507de6a6e05 | 3f88611f912020102df75d168a178d1c31b1755d | /src/detailgraphicsitem.h | 952c9b0cd903b921f915d8a69b13371a0344f3cd | [] | no_license | polevov/Sirius | a5e42cf6b0a68b76306a26d2bc6d2af4d70d0b36 | aeedae4af090b2f05b6620838ffea45e554cdb50 | refs/heads/master | 2021-05-08T17:47:10.393630 | 2018-05-30T03:43:27 | 2018-05-30T03:43:27 | 119,488,201 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 508 | h | detailgraphicsitem.h | #ifndef DETAILGRAPHICSITEM_H
#define DETAILGRAPHICSITEM_H
#include <QGraphicsPathItem>
class DetailGraphicsItem : public QGraphicsPathItem
{
public:
explicit DetailGraphicsItem(QGraphicsItem *parent = Q_NULLPTR);
explicit DetailGraphicsItem(const QPainterPath &path, QGraphicsItem *parent = Q_NULLPTR)... |
e4688396ef4b585fdc197f42d17525819bf4a7ee | 294c54b1112ca31b3e7452327c6f6276484918ca | /TheMole/Main.cpp | 1f39348eb6412b9b7c505ed074b0793ae7218672 | [] | no_license | LamePancake/The-Mole | 511ce0b7d40080a173eacbd3e19e6ebc637268aa | 711afd008177d367cf3af003e64c4215c217f3db | refs/heads/master | 2021-01-10T16:51:04.122879 | 2016-04-12T20:14:55 | 2016-04-12T20:14:55 | 53,621,029 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,101 | cpp | Main.cpp | #include <iostream>
#include <unordered_map>
#include <string>
#include <SDL2pp\SDL2pp.hh>
#include <SDL2\SDL_main.h>
#include <memory>
#include "GameManager.h"
#include "GameScreen.h"
#include "MenuScreen.h"
#include "LevelSelectScreen.h"
#include "Input.h"
#include "CutsceneScreen.h"
#include "CreditsScreen.h"
#inclu... |
220d17b875f49781e618802506e03998b694661e | 2cbcfb9b9046ac131dc01a6fd048b6920d29cd42 | /CPlusPlus/LeetCode/393. UTF-8 编码验证/main.cpp | 6ca6f080db83ca5303f49061bbb11f2c6020e576 | [] | no_license | pulinghao/LeetCode_Python | 6b530a0e491ea302b1160fa73582e838338da3d1 | 82ece6ed353235dcd36face80f5d87df12d56a2c | refs/heads/master | 2022-08-12T21:19:43.510729 | 2022-08-08T03:04:52 | 2022-08-08T03:04:52 | 252,371,954 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,588 | cpp | main.cpp | //
// main.cpp
// 393. UTF-8 编码验证
//
// Created by pulinghao on 2022/3/13.
//
#include <iostream>
#include "common.h"
class Solution {
public:
bool validUtf8(vector<int>& data) {
int i = 0;
bool res = true;
while (i < data.size()) {
int num = data[i];
if ((num >>... |
884c21ff3fd5fa41db364db6fefa88e23dc1a4b0 | bdc0b8809d52933c10f8eb77442bd0b4453f28f9 | /install/test_msgs/include/test_msgs/msg/nested.hpp | e23c9346901541f169c369f4a6042f5ae442391b | [] | no_license | ClaytonCalabrese/BuiltRos2Eloquent | 967f688bbca746097016dbd34563716bd98379e3 | 76bca564bfd73ef73485e5c7c48274889032e408 | refs/heads/master | 2021-03-27T22:42:12.976367 | 2020-03-17T14:24:07 | 2020-03-17T14:24:07 | 247,810,969 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 315 | hpp | nested.hpp | // generated from rosidl_generator_cpp/resource/idl.hpp.em
// generated code does not contain a copyright notice
#ifndef TEST_MSGS__MSG__NESTED_HPP_
#define TEST_MSGS__MSG__NESTED_HPP_
#include "test_msgs/msg/nested__struct.hpp"
#include "test_msgs/msg/nested__traits.hpp"
#endif // TEST_MSGS__MSG__NESTED_HPP_
|
df11e98058fdc79569fdef4f3e147d01493c6bb7 | 81e9adcb28394b5e19c1dbf561bd5b5bd6ec993f | /Leetcode/Design/155_Min_Stack.cpp | ea6ccf2d400acd6d3b94f8a1ddfceb4d930f50c2 | [] | no_license | poweihuang17/practice_leetcode_and_interview | eeb8d0091b56a5cc4ea566f1395dee1cfe021604 | 59c17c221ddc6e2a4dc95cf11fda34574611c832 | refs/heads/master | 2021-05-03T05:52:49.369265 | 2018-05-10T02:10:31 | 2018-05-10T02:10:31 | 120,585,290 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 957 | cpp | 155_Min_Stack.cpp | #include <utility>
#include <stack>
#include <algorithm>
#include <climits>
using namespace std;
class MinStack {
public:
/** initialize your data structure here. */
MinStack() {
}
void push(int x) {
if(s.size())
s.push(make_pair(x,min(x, this->getMin())));
el... |
346d4dfa9498c39b9b3c52559d6a7e1a10a3a06c | b30ff12e385530d8d5a555a2df28ed414b6195f3 | /src/threadprivate.h | 17de9e2c1ca59c9820b7e9917f48dc73625621b4 | [] | no_license | AIXHB/tjvm | ad5c0080e6454f65744e0882c8f250cdb1ff6d03 | d76c814d35ec9e5ad49942981d63fd0684db7499 | refs/heads/master | 2021-01-22T00:29:12.993102 | 2017-07-22T11:51:21 | 2017-07-22T11:51:21 | 102,189,780 | 0 | 0 | null | 2017-09-02T10:42:39 | 2017-09-02T10:42:39 | null | UTF-8 | C++ | false | false | 811 | h | threadprivate.h | #ifndef _THREADPRIVATE_H_
#define _THREADPRIVATE_H_
#include <boost/smart_ptr.hpp>
#include "def.h"
#include "stackframe.h"
#include "frame.h"
using namespace boost;
class ThreadPrivate;
class StackFrame;
class Frame;
typedef shared_ptr<Frame> FramePtr;
typedef shared_ptr<StackFrame> StackFramePtr;
type... |
b01f7bb692a8a31b5c390176d82d00f3159f449c | 072e33158adce4d5f3344bf51832ae16de06e848 | /Titan Quest/Titan Quest/IMovable.h | 8be7eb83549e38e8019761150701dceb3cf9e38d | [] | no_license | Rauf145/Titan-Quest | 20a74c0143cb05e83bd7c7a8b44a3e88621ae4c8 | bbea8babd2e86dbf1bc127a868137c0cbfb02482 | refs/heads/master | 2021-08-08T16:29:14.830678 | 2017-11-10T18:09:47 | 2017-11-10T18:09:47 | 108,013,970 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 154 | h | IMovable.h | #pragma once
#include "Enums.h"
class IMovable
{
Direction direction;
public:
virtual void move(Direction dir) = 0;
//IMovable();
//~IMovable();
};
|
c53b9e57993b78c1fdf837b5ad381330cdf23c88 | bb277a8fad2b58001fd7d3464ae3015c6ebcaeb9 | /include/microgin/Context.hpp | eaac797c8b98805ab6198c002a1d728d4c965642 | [] | no_license | linjunjj/microgin | 46473acd2a5065fdf28b6a0459338aa21df7e93f | 3b7ab9e4d11da885ed7453ba524ed3a5af38912c | refs/heads/master | 2022-04-24T05:50:46.039426 | 2020-04-26T13:54:18 | 2020-04-26T13:54:18 | 251,304,026 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,830 | hpp | Context.hpp | //
// Created by 林俊 on 2020/3/30.
//
#ifndef MICROGIN_CONTEXT_HPP
#define MICROGIN_CONTEXT_HPP
#include <memory>
#include <boost/beast/core.hpp>
#include <boost/beast/http.hpp>
#include <boost/beast/http/message.hpp>
#include <boost/beast/http/dynamic_body.hpp>
#include "microgin/Dict.hpp"
#include "Types.hpp"
#includ... |
7426a155bf4d1a0c07bceb95bc91d53432b0207f | 16954e0be4e1a21cd672bccc68a3ad65b613af76 | /1.7.cpp | 43011a8a2b6caac45d6135001ced6d01cd4f2b16 | [] | no_license | ryandev421/cracking-the-coding-interview-5th | 8b30cd139a3e837059acca44009483f995f0ef7d | 5c94e85e651da0db2002df385310c8fb9f035b7a | refs/heads/master | 2021-10-24T04:44:59.908778 | 2019-03-22T00:44:08 | 2019-03-22T00:44:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,335 | cpp | 1.7.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
string compressString(string str);
string shortenWithSameAlpha(char alpha, int duplicated_cnt);
void make_zeros(vector<vector<int> > &matrix)
{
if (matrix.size() == 0) {
return ;
}
vector<bool> rows (matrix.size(), false)... |
b772d0e4b9bef5a6ca0f14568738d175391a7e8b | c93341f1ef69942cceb3ce6b4c0e88815a2f07a1 | /ec_conb.cpp | b4a9c5d030222454125d3d6cac1cdb4967e53faa | [] | no_license | lashavih/Spoj-Solutions | 00217ec3d001f41cfb8c75e7bbc88ce7cefa8cfc | a24bdc43a71d1d902269a92c81b8b834fa9d94a5 | refs/heads/master | 2020-04-12T05:37:52.769790 | 2016-12-15T06:44:59 | 2016-12-15T06:44:59 | 59,835,505 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 521 | cpp | ec_conb.cpp | #include<bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define si(x) scanf("%d",&x)
#define pi(x) printf("%d\n",x)
#define s(x) scanf("%lld",&x)
#define p(x) printf("%lld\n",x)
using namespace std;
int main(){
int n,i,j;
si(n);
int a[n];
for(i=0;i<n;i++){
si(a[i]);
}
for(i=0;i... |
3cb3e2b5c4a0db6f4b263cf1d1207fe84a21aa05 | 785df77400157c058a934069298568e47950e40b | /include/HydStatic_StEqQ.hxx | b3c521c7287b9674c5dfb20cbd8cd4c8f0727b6a | [] | no_license | amir5200fx/Tonb | cb108de09bf59c5c7e139435e0be008a888d99d5 | ed679923dc4b2e69b12ffe621fc5a6c8e3652465 | refs/heads/master | 2023-08-31T08:59:00.366903 | 2023-08-31T07:42:24 | 2023-08-31T07:42:24 | 230,028,961 | 9 | 3 | null | 2023-07-20T16:53:31 | 2019-12-25T02:29:32 | C++ | UTF-8 | C++ | false | false | 634 | hxx | HydStatic_StEqQ.hxx | #pragma once
#ifndef _HydStatic_StEqQ_Header
#define _HydStatic_StEqQ_Header
#include <HydStatic_EqQ.hxx>
namespace tnbLib
{
class HydStatic_StEqQ
: public HydStatic_EqQ
{
/*Private Data*/
public:
static TnbHydStatic_EXPORT const HydStatic_EqQ null;
HydStatic_StEqQ()
{}
HydStatic_StEqQ
(
con... |
73d4ebfdbf8ccb939c50ab6f241320475ceb0836 | 28f18e6b5ec90ecbe68272ef1572f29c3e9b0a53 | /include/boost/geometry/strategies/geographic/buffer_join_miter.hpp | b479f5fb5741f8ae245fc6ed613e9546355e659f | [
"BSL-1.0"
] | permissive | boostorg/geometry | 24efac7a54252b7ac25cd2e9154e9228e53b40b7 | 3755fab69f91a5e466404f17f635308314301303 | refs/heads/develop | 2023-08-19T01:14:39.091451 | 2023-07-28T09:14:33 | 2023-07-28T09:14:33 | 7,590,021 | 400 | 239 | BSL-1.0 | 2023-09-14T17:20:26 | 2013-01-13T15:59:29 | C++ | UTF-8 | C++ | false | false | 4,308 | hpp | buffer_join_miter.hpp | // Boost.Geometry
// Copyright (c) 2022 Barend Gehrels, Amsterdam, the Netherlands.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_GEOMETRY_STRATEGIES_GEOGRAPHIC_B... |
6809d0f4d4a668c627927c3d0507c75c77a65cd4 | e8bc94644559fd8f3dbb371cac7082746334dee7 | /uno_h34rt_l3ds.ino | d366facd7b452afe8a8cb5c2a6a6b964f4652493 | [] | no_license | fbdan/Arduino-Raspberry-Projects | cfa3fc9ef3bf2cf148a25c74c7d77e20c8bc5014 | d36a59911a1933f6cfe9275f4857818992366c17 | refs/heads/master | 2021-06-12T11:16:17.289030 | 2016-12-26T21:43:40 | 2016-12-26T21:43:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,578 | ino | uno_h34rt_l3ds.ino | /*
GONNA MAKE HISTORY!
Heart-shaped leds
lvl: intermediate
8 LEDS
HAVE TO BRING IN RED LEDS DONE~
Florea Bogdan
Nothing new to add for now
Versiunea 1.0
Tired to work anymore 2:55 AM 17.08.2016
16.08.2016
*/
void StandBy()
{
int count = 0;
while(count % 3 == 0) {
for (int... |
f1bd513b18c0eda7419998af3d1c6f82a6f67ee8 | e246e6b676a5d24a4f377ae0e9cb36c579f60f26 | /Program.hpp | 448da2243f10e58d0209c60a18da7aff0193d6d0 | [] | no_license | yamhih/process_monitor | 76165f20f608855bc06352a09c882ffc9847aa8b | e34814d06ae263ee16f3352c8857825777a1e49c | refs/heads/master | 2020-03-29T18:32:08.069762 | 2013-08-16T17:39:22 | 2013-08-16T17:39:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 937 | hpp | Program.hpp | #include <sys/types.h>
#include <sys/socket.h>
//#include <unordered_map>
#include <map>
#include <string>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
#include "utils.hpp"
#include <fcntl.h>
class ArgvParse
{
public:
ArgvParse(const char *cmd);
~ArgvParse(... |
5d5010f1ab1f1222a2cc9e93b7fce9cebc5e3aa9 | bda1a38febd5b251a2fd6da56781d580d0dde5df | /LeetCode/SumofRootToBinaryNumbers.cpp | e7b17e62e4ad9e89897eae5ed50d3fe535e21530 | [] | no_license | FernandoZhuang/LeetCode | d9d8919e3985a3daa48206762163de8be1888810 | a05f097ac515450ad776ad73b658da37479a3df3 | refs/heads/master | 2020-04-20T10:03:27.814403 | 2020-01-31T08:03:47 | 2020-01-31T08:03:47 | 168,780,527 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 662 | cpp | SumofRootToBinaryNumbers.cpp | #include <iostream>
#include <vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
int mod = 1000000007;
void dfs(TreeNode* root, long long sum, vector<int>& addup) {
if (!root) { return; }
sum = (root->v... |
0cebc4fffec862b7058b93e8bb0a764b7ea9f979 | e2e133e5bfa0537e76c376e1e0a670af3ee2a24a | /ed2016/src/Commands/JoystickClimberArm.cpp | 0812e7516150f56a4964f98eef0b54e188fef5ff | [] | no_license | team116/ed2016 | 7b196ec8c0f0b6b558863ef877b07dd352e9e96f | 9bc51718b57a5cd1a84fc0b7795f4f84d0d95279 | refs/heads/master | 2021-01-20T17:26:32.392150 | 2016-12-02T01:44:06 | 2016-12-02T01:44:06 | 49,338,847 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,067 | cpp | JoystickClimberArm.cpp | #include "JoystickClimberArm.h"
#include <Subsystems/Climber.h>
#include <OI.h>
JoystickClimberArm::JoystickClimberArm()
{
Requires(&*climber);
}
// Called just before this Command runs the first time
void JoystickClimberArm::Initialize()
{
}
// Called repeatedly when this Command is scheduled to run
void Joystick... |
40eef212b6225493f0c39e4ace6b42fdbd2ba99a | a2022a756328e52fe4e63dc398533e5f0dd073bf | /DoorbellDetector/DoorbellDetector/DoorbellDetector.ino | ee360db8b9a2feffde46f92182c79f883e93358c | [] | no_license | rossdargan/Arduino-Projects | 16ae3b11eff4def062cb76420888a8191e2ed5a9 | e17362bbedfcb8950827c014b10895ad6a9073a5 | refs/heads/master | 2021-01-21T12:49:52.924861 | 2016-04-17T13:54:48 | 2016-04-17T13:54:48 | 3,023,388 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,496 | ino | DoorbellDetector.ino | #define analogPin A0 // RF data pin = Analog pin 0
byte dataBuffer[40];
int dataCounter = 0;
int lowDataCounter = 0;
int highDataCounter = 0;
int maxSignalLength = 30;
const unsigned int upperThreshold = 100;
const unsigned int lowerThreshold = 80;
int ding[] = {2,2,2,1,3,4,1,3,4,1,4,1,3,4,1,4,2,2,1,4};
void se... |
eac53a909e7945a4e8ec857e9abbfd3d4ef2c144 | 5dfd73d000548e0bc5ef2008cf2c0886ff71a839 | /symgen/optparse.cpp | 1f22071c2381e79e7ddff5a3f9c6578010ae7059 | [] | no_license | resonancellc/gen3tools | ab234d039b0cc514ac0e9beb5811b363c0e60cf8 | 4542b2b0c5ac20ef20b341d28f4f35db27b2e789 | refs/heads/master | 2020-06-22T23:47:28.849810 | 2019-06-27T22:47:35 | 2019-06-27T22:47:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,536 | cpp | optparse.cpp | #include "global.hpp"
#include "optparse.hpp"
#include <cstring>
using namespace std;
extern int runSelfTest();
static const char SOPT_TEMPLATE[] = { "-t" };
static const char FOPT_TEMPLATE[] = { "--template" };
static const char SOPT_ELF[] = { "-e" };
static const char FOPT_ELF[] = { "--elf" };
static const char FO... |
985b56807c056bbcdfa8917e3ca7f702f7dc8940 | 4cfb40675297dcb2d5999889aeef643be3351d42 | /alternating_current_test/tst_apptest.cpp | 33c0f639223b831a3d2b27d0d57ca2dc86940034 | [] | no_license | MikhailSklyarov1/KiNPO | 5c8a7ed613749cefadbc125ef3d0d0599cf35779 | 3aae38267faf4cb57c6d4c9d540eab8781bd8523 | refs/heads/master | 2023-05-30T19:27:26.309486 | 2021-06-17T14:47:09 | 2021-06-17T14:47:09 | 355,274,370 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 51,723 | cpp | tst_apptest.cpp | #include <QtTest>
#include <graph.h>
#include <branch.h>
#include <QObject>
#include <declaration.h>
Q_DECLARE_METATYPE(Element);
Q_DECLARE_METATYPE(ComplexVal);
Q_DECLARE_METATYPE(QVector<Element>);
Q_DECLARE_METATYPE(Branch);
Q_DECLARE_METATYPE(Graph);
Q_DECLARE_METATYPE(Link);
typedef QMap<int, Branch> branchLis... |
410a5fa73e5256832642e5bd77dc9065cf1aa377 | 23ce56797f9772b4a673ff66981a940771659c3a | /Tek sayıları bulma.cpp | 6a8e7c2b82796ad9a2d39a53de856dec18649f2b | [] | no_license | Burakkarakoyun/C-works | aa440c69a0da3461e6df48954d158379e68c5f79 | a96e55ee30b00fa21308c904ca7561481b188a2f | refs/heads/master | 2021-06-15T19:59:11.925021 | 2021-02-28T00:53:21 | 2021-02-28T00:53:21 | 152,913,534 | 0 | 0 | null | null | null | null | ISO-8859-9 | C++ | false | false | 391 | cpp | Tek sayıları bulma.cpp | //Girilen sayıya kadar olan tek sayıları bulma
//Burak KARAKOYUN
#include<stdio.h>
#include<locale.h>
#include<conio.h>
int main(){
setlocale(LC_ALL,"Turkish");
int sayi;
printf("Girilen Sayıya Kadar Olan Tek Sayıları Bulan Program\nLütfen Sayı giriniz...\n");
scanf("%d",&sayi);
for(int i=1;i<sayi;i++){
... |
a9f806fcccdff900b259a48bfbb298d3ce8bbfae | 04896c0dfb5e7d25c60a31097d0ea63b59d31811 | /src/materialsystem/shaderapiempty/ShaderAPIEmpty.h | 610adf902742b0119950e3cfcea6b3ac3cd3b14c | [] | no_license | Petercov/Quiver-Engine | f2e820c21c89682f284a6cc5718ed59c6023d525 | 05605a28072682a56ea099dba6b6043da38fa84c | refs/heads/master | 2023-08-15T06:07:40.251252 | 2021-10-19T09:23:05 | 2021-10-19T09:23:05 | 373,350,248 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,221 | h | ShaderAPIEmpty.h | //===== Copyright � 1996-2005, Valve Corporation, All rights reserved. ======//
//
// Purpose: Empty template shaderapi
// Replace this when creating a new shaderapi
//
// $NoKeywords: $
//
//===========================================================================//
#pragma once
#include "Mesh.h"
#include "Shade... |
0b578f2c9387b0634a6056535743bbc9e3c39480 | 167338fa7c9b268067f1233d1bbe7db881ab1702 | /src/funkcjeMat.cpp | fc52e2a6055917538d456c77b5520d3a460f6da9 | [] | no_license | Mefisto756/ProjektMacierze | c2f282f0976517f1bccdea8420d4782423f415ed | 7cc5766d76a3d14ef4e66c0019c2b92733cfcf17 | refs/heads/master | 2021-09-01T00:01:23.503429 | 2017-12-23T16:33:42 | 2017-12-23T16:33:42 | 114,801,376 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,227 | cpp | funkcjeMat.cpp | #include "../headers/header.hpp"
void dodawanieMacierzy(macierz &A, macierz &B, macierz &D)
{
for (int i = 0; i < M; i++)
{
for (int j = 0; j < M; j++)
{
D.T[i][j]=A.T[i][j]+B.T[i][j];
}
}
}
void roznicaMacierzy(macierz &A, macierz &B, macierz &D)
{
for (int i = 0; i < M; i++)
{
for (int j = 0; j < ... |
87de64f560820fe26b4b86505f0129b2a6f9cd21 | 4bcf960fa5cc52d998d83c3550f7bbc183d58898 | /turnin/party.cc | adbf9dff0816b8741527477ad110e14f47d0561d | [] | no_license | HarmonEpsilon/Restaurant | 0fc650cc87576f2697e16a0f7bb78cc5b87dbade | a52c6cf6a19a3da70cb2c6b3cb70f91cfd9f561e | refs/heads/master | 2021-01-13T17:13:08.135387 | 2017-02-24T04:10:02 | 2017-02-24T04:10:02 | 81,756,904 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 777 | cc | party.cc | /**
* @file party.cc
*
* @brief
* Functions for a party of diners in a restaurant, using party.h
*
* @author Landon Mote
* @date 2/12/2017
*/
#include <string>
#include "doublylinkedlist.h"
#include "party.h"
/**
* @brief Party default constructor
*/
Party::Party() {
reservationName = nullptr;
... |
4ebf59cf840f74f5054452193cd17a9fb12df4c4 | 8efd357ae78ab06c46834fac38ae67ddeca80f6e | /Sort Colors/Solution2.cpp | 5e99b8649b71bc5fa6c58a3f1abc3040f1a10334 | [] | no_license | shipengAlan/leetcode | f118fa3e3553d4421e4aa8b011a91a6a869946db | b719043ae379d1089c2452791f10940ea11a7a1f | refs/heads/master | 2020-12-19T01:27:08.159496 | 2016-08-12T23:09:03 | 2016-08-12T23:09:03 | 37,632,948 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,337 | cpp | Solution2.cpp | #include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
void sortColors(vector<int>& nums) {
int num0 = 0, num1 = 0, num2 = 0;
int label0 = 0;
int label1 = 0;
int label2 = 0;
for(int i=0;i<nums.size();i++){
if(nums[i]==0){
... |
abeae34f3e5b981f2400e08a64467147be2a145c | 2fd6d1333b73f21aa448e399ee9cc5f2140903fe | /VivienneVMM/capture_execution_context.cpp | 685f2f7a10ebf8d44b5687c65b4a9c20c188fdb8 | [
"MIT"
] | permissive | killvxk/VivienneVMM | e63723f4fa58d50774abe28860ccf0805cf6f561 | 211742f684b26468b884b9da3ce25ca94ffd6dea | refs/heads/master | 2020-03-24T16:04:41.933824 | 2019-12-02T03:27:34 | 2019-12-02T03:27:34 | 142,812,050 | 2 | 0 | MIT | 2019-12-02T03:27:36 | 2018-07-30T01:57:02 | C++ | UTF-8 | C++ | false | false | 31,674 | cpp | capture_execution_context.cpp | /*++
Copyright (c) 2019 changeofpace. All rights reserved.
Use of this source code is governed by the MIT license. See the 'LICENSE' file
for more information.
Module Name:
capture_execution_context.cpp
Abstract:
This module implements the capture execution context callback.
See CEC_MANAGER_STATE for... |
d0c546b63fbfe007d2e5f31a84edb12812f06673 | af349c3084f098cfff9eaca2ba5e6f0a7fb6def2 | /MLID/utility.cpp | e44120c077083c4c3f64222b9411f43c05aa312e | [] | no_license | LiangShuangSH/Inverse_Kinematics | 46a8d6ce39dbab3bd498f8c4a60761b3c0a3ebfc | 3283b55b890857d82e4b266202a0c1b6b7f1f875 | refs/heads/master | 2021-08-06T16:23:49.668006 | 2017-11-06T13:51:24 | 2017-11-06T13:51:24 | 109,701,504 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 689 | cpp | utility.cpp | #include "utility.h"
double normalize_angle(double angle) {
double new_angle = fmod(angle + PI, 2*PI);
if (new_angle < 0) {
new_angle += 2 * PI;
}
return new_angle - PI;
}
double euclidean_distance(vec a, vec b) {
double result = 0.0;
if (a.size() != b.size()) {
cout << "Warning::Euclidean_Distance()::SIZE_... |
51ade03355a2813bbee20a9aa0872dcb3823810a | 36b22ab3e8baa321d09da272cdfe5c103078adc1 | /tunnel.cpp | 4b8c7dd8790b3a60ef3cea9ac81315e284289a73 | [] | no_license | ac-dias/wxAMPS-2D | 071984bbb0efbcda8b1dab4212b37606283e2264 | fcc06e22e732a2baa355d0fc9b0f9736f7f48d88 | refs/heads/master | 2023-04-23T04:03:18.673210 | 2019-11-02T15:30:57 | 2019-11-02T15:30:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,983 | cpp | tunnel.cpp | #include "wx/wxprec.h"
#ifdef __BORLANDC__
#pragma hdrstop
#endif
#ifndef WX_PRECOMP
#include "wx/wx.h"
#endif
#include "Point.h"
#include "calculation.h"
#include "constant.h"
#include "LU.h"
void Point:: IterNTun(double *y, double*J,double*l,double*u,int num,double kT,double TopSn,double BtmSn,wxPr... |
542bc2d1454d924ab3ffad6aef274a33c9a600f7 | 3b04925b4271fe921020cff037b86e4a5a2ae649 | /windows_embedded_ce_6_r3_170331/WINCE600/PRIVATE/TEST/MULTIMEDIA/DIRECTX/D3D/MOBILE/LIBS/VERIFTESTCASELIBS/STENCILTESTCASES/depthstenciltools.cpp | 92f12a78460adc557169de7d7ef544c29aa5b871 | [] | no_license | fanzcsoft/windows_embedded_ce_6_r3_170331 | e3a4d11bf2356630a937cbc2b7b4e25d2717000e | eccf906d61a36431d3a37fb146a5d04c5f4057a2 | refs/heads/master | 2022-12-27T17:14:39.430205 | 2020-09-28T20:09:22 | 2020-09-28T20:09:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,528 | cpp | depthstenciltools.cpp | //
// Copyright (c) Microsoft Corporation. All rights reserved.
//
//
// Use of this source code is subject to the terms of the Microsoft shared
// source or premium shared source license agreement under which you licensed
// this source code. If you did not accept the terms of the license agreement,
// you are... |
6dcc2258eaa416cbc00ea076f3103b08da6e1d60 | 2430e49be3112f5e812c38123327acd8c6e132fb | /lab07/main.cpp | d07ab5d771d5f42af8a0491dbff06faab678bfe3 | [] | no_license | AleksandraRolka/IMN | e4dbce03b051f85f82bbcdadc772b48e9e23117b | 8f6e64ec6198509b92cdc36b2c8f66e60dcc0d62 | refs/heads/main | 2023-03-19T04:57:15.384832 | 2021-03-09T00:43:28 | 2021-03-09T00:43:28 | 345,823,459 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,631 | cpp | main.cpp | /*
* KOMENDY :
*
* make all - kompiluje program, uruchamia go tworząc odpowiednie pliki .dat oraz uruchamia skrypt gnuplota, który tworzy wykresy
* make clean - usuwa plik wykonywalny 'main' oraz pliki z roszerzeniami .o, .dat, .png
*
*/
#include <iostream>
#include <cmath>
#include <string>
#define... |
8ec79af7e963b9212c6b2c10c51040af89b73ec2 | 13500b849db6d62ac7ee94e32ddd76681af79d6b | /1039/1039极简.cpp | 3d9929d4ca735f5d4149ed5f575097a1a4c637cf | [] | no_license | syjsu/noip-with-vue.js | 055a90d13dedd2c00b2d449a39fa4f3128270480 | 6076cd41b5343dd3ff18b4c4afec207021f8c78b | refs/heads/master | 2020-03-17T20:15:42.362689 | 2018-05-24T05:10:27 | 2018-05-24T05:10:27 | 133,900,801 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 82 | cpp | 1039极简.cpp | #include<iostream>
using namespace std;int n;int main(){cin>>n;cout<<(1<<n);}
|
bfc4a472d63557d686424a0556a5f2d1c9f4a916 | 1468b015f5ce882dbd39dc75c9a6560179a936fb | /Emulator/Core/Event/AEntity.cpp | 3b0bb773bccf7b15dcb7408d0ba2578c8c01a666 | [] | no_license | Escobaj/HearthstoneResolver | cbfc682993435c01f8b75d4409c99fb4870b9bb3 | c93b693ef318fc9f43d35e81931371f626147083 | refs/heads/master | 2021-04-30T22:31:01.247134 | 2017-01-31T00:05:32 | 2017-01-31T00:05:32 | 74,474,216 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 835 | cpp | AEntity.cpp | //
// Created by escoba_j on 13/12/2016.
//
#include "AEntity.h"
AEntity::AEntity(Minion *minion) {
_type = EntityType::MINION;
_reference = _minion = minion;
_spell = NULL;
_weapon = NULL;
_heroPower = NULL;
}
AEntity::AEntity(Spell *spell) {
_type = EntityType::SPELL;
_r... |
0abd76f40ebada01da927e5a1af92ab195069fff | 7bf639453e7d114caf0d7c4e85b8384203ff1e41 | /exercise_4/src/main.cpp | 491f7968a7723b64e1552926bde18fc074a070c6 | [] | no_license | Lira999/lviv_cpp_training | 5698ce74a3d34291ba8d021a9d86a35bcf684b97 | 756be5a47ef4fb532a3b36762c6e1175804e6ccd | refs/heads/master | 2020-06-15T02:02:57.634826 | 2019-07-31T09:37:56 | 2019-07-31T09:37:56 | 195,180,914 | 1 | 0 | null | 2019-07-31T09:37:57 | 2019-07-04T06:21:45 | C++ | UTF-8 | C++ | false | false | 3,752 | cpp | main.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <sstream>
#include <vector>
#include <memory>
#include "IRecord.h"
#include "Course.h"
#include "Exam.h"
#include "Student.h"
#include "Teacher.h"
#include "Show.h"
void add_student_to_map(std::istringstream &iss_record, std::vecto... |
6d5a8cacb11f4ea123556f447e2541c3e4a7f45b | c6ff94c55bd9406d7189cb142c68ba6b006fa639 | /Source/NorilskDemo/Private/NorilskGameEngine.cpp | 4ab01b238e3cc9ae1ec0ce5c6f67bd04fb4e2138 | [] | no_license | MarkovDmitriy/NorilskIncident | 9de6759a973fcc2b409b84cb1ad4f3cd667e2cbe | d090c605efba0e5ee7a7917d5a936238e8f5705e | refs/heads/master | 2020-03-26T19:59:26.046195 | 2018-09-21T20:42:28 | 2018-09-21T20:42:28 | 145,297,786 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 737 | cpp | NorilskGameEngine.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "NorilskDemo.h"
#include "NorilskGameEngine.h"
UNorilskGameEngine::UNorilskGameEngine(const FObjectInitializer& ObjectInitializer)
: Super(ObjectInitializer)
{
}
void UNorilskGameEngine::Init(IEngineLoop* InEngineLoop)
{
// No... |
e575ce1127d31b84179e304b831ae7169d85f6d1 | bf8cb8e228ebb98c6d0b4eff507034f252510944 | /VizItem.h | 93d86d6bbe6a6535eee5cd593beb041ef69d00d6 | [] | no_license | Liu8018/Cocos2dPractice | f0d51fb30880314eaf6a5c4a2e193f6bf7424c79 | 3574f7015e7cdb4a66e639fa2aa3e08cd0d8630d | refs/heads/master | 2021-05-22T14:24:54.746923 | 2020-04-16T01:29:06 | 2020-04-16T01:29:06 | 252,961,103 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 316 | h | VizItem.h | #ifndef VIZITEM_H
#define VIZITEM_H
#include "cocos2d.h"
class VizItem
{
public:
VizItem();
cocos2d::SpriteFrame *getItemFrame(int);
private:
//
std::vector<std::vector<std::string>> m_itemTable;
//
cocos2d::Vector<cocos2d::Sprite*> m_itemSpriteList;
};
#endif // VIZITEM_H
|
3450117ab4db1711e164844a50ad147fd8ed499a | 3413409ca1f9aac0d1f70963ab441dec950bb65c | /permutation.cpp | d560214928db91325387745519566c02c31d0a40 | [] | no_license | Michael-ale000/cses-problem | 0f4d63bb1340ec2bfebc9232a549ce49d7decbcc | ab098efa1e34d321d9eddf242ceadaedfff0021f | refs/heads/main | 2023-05-09T02:08:03.571536 | 2021-05-30T05:10:48 | 2021-05-30T05:10:48 | 371,385,299 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 545 | cpp | permutation.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll int n;
cin>>n;
if(n==1)
{
cout<<"1 ";
}
if((n==2)||(n==3)){
cout<<"NO SO... |
713ecd5ab318e3f928a026e64c35936b9dae7670 | 757f949fd92e6986d287e54257e65b6a05506d10 | /src/swcomponents/cloud_publisher/src/cloud_publisher.cpp | a656629882f3aa74cdeb6eabf79e42e04775a510 | [
"Apache-2.0"
] | permissive | tlund80/MARVIN | 5a5d7da37aaa1e901a6e493589c4d7b3cb9802ae | 9fddfd4c8e298850fc8ce49c02ff437f139309d0 | refs/heads/master | 2021-05-01T02:57:47.572095 | 2015-03-27T13:51:07 | 2015-03-27T13:51:07 | 23,161,076 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,617 | cpp | cloud_publisher.cpp | // All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// 2... |
c46cb1ec511160292e65f45049e150710cf541a2 | 3ea34c23f90326359c3c64281680a7ee237ff0f2 | /Data/1301/H | 1a27f8b98aa394862a7a1a71e545ea8044e41775 | [] | no_license | lcnbr/EM | c6b90c02ba08422809e94882917c87ae81b501a2 | aec19cb6e07e6659786e92db0ccbe4f3d0b6c317 | refs/heads/master | 2023-04-28T20:25:40.955518 | 2020-02-16T23:14:07 | 2020-02-16T23:14:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 92,143 | H | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | foam-extend: Open Source Cstd::filesystem::create_directory();FD |
| \\ / O peration | Version: 4... | |
68c62f208a60f1a354933a75b5db66b9d40ea19c | 291401bb1fa7f07e906f5d3551585101afbd848a | /Sequence.h | ea1cec9db4032cab12c44479c3062e4249907993 | [] | no_license | ljmotta/2019_2022_GenESyS | 65c1dad3ab077bcfa1f4f2ac92203362cf4b5841 | 2d3331ec1998c9ac0cd88b2a826472fcff48e795 | refs/heads/master | 2023-04-12T14:41:39.638474 | 2021-04-24T12:34:32 | 2021-04-24T12:34:32 | 350,146,492 | 1 | 0 | null | 2021-04-09T17:39:11 | 2021-03-21T23:28:32 | C++ | UTF-8 | C++ | false | false | 4,020 | h | Sequence.h | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: Sequence.h
* Author: rlcancian
*
* Created on 03 de Junho de 2019, 15:12
*/
#ifndef SEQUENCE_H
#define SEQUENCE_H
... |
ae22eceb9a5d1d91d2ae596d304d229dbe4a8ed4 | 1abf842fb4aa78cb7494f1921cf4ee636d4ffd85 | /process.h | 2b9d203069e83a9c991a9c7c335c54b63eaa118c | [] | no_license | cabral450/OSP2 | d6cdda095ea27a62996c76c6dc5abcdf6406cae3 | 6d0907436cac06c9aa51ec6027b388f0fac5a405 | refs/heads/master | 2021-01-20T10:29:20.060251 | 2016-12-17T23:32:35 | 2016-12-17T23:32:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 419 | h | process.h | #ifndef _PROCESS
#define _PROCESS
#include <stdio.h>
#include <stdlib.h>
#include <vector>
class burst
{
public:
int arrivalTime;
int duration;
public:
burst(int arrival, int dur){ arrivalTime = arrival; duration = dur; }
};
class process
{
public:
int memSize;
char processName;
process();
process... |
23e79af62e607d0adc5afc58a53820aa97ad9e10 | 129b771015af7daf37c03c3b5a3740758a3aabe6 | /tools/pcd_merge.cpp | 5c99bc8da00925d20ecf4d2cd37e4e7e4bf56cea | [] | no_license | 18670025215/pcl_tools | 54747146f678e7aedb90662904b34d9253f8712d | 06057597b89a721e825b3f5059641b13acf64d1f | refs/heads/master | 2020-04-02T17:01:53.418877 | 2018-10-24T07:59:37 | 2018-10-24T07:59:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,135 | cpp | pcd_merge.cpp | #include <iostream>
#include <pcl/common/file_io.h>
#include <pcl/console/parse.h>
#include <pcl/console/print.h>
#include <pcl/console/time.h>
#include <pcl/features/normal_3d.h>
#include <pcl/filters/passthrough.h>
#include <pcl/filters/voxel_grid.h>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <p... |
20b7ffedad2ecb854c2f97e9e6c6aac45644e1db | 351f9c2a2595767fc76d195cd68adba3fc9cdbf2 | /Airport7.h | ea74cca154c7624f4b7a098f264e6a9ba89ad25d | [] | no_license | vmara2/CS211 | 645d17676f81ced3e867723cb4f3a78d713ab218 | 66cf4875065b3307affe266f37a8262a1550a8bb | refs/heads/master | 2020-04-27T09:00:36.593694 | 2019-03-06T18:24:31 | 2019-03-06T18:24:31 | 174,195,905 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,462 | h | Airport7.h | #include <cstdio>
#include <cstring>
#include <cstdlib>
class MyNode
{
private:
int val;
MyNode *next;
public:
MyNode(int v);
MyNode(int v, MyNode *n);
void setVal(int v);
int getVal();
void setNext(MyNode *n);
MyNode *getNext();
};
class MyList
{
private:
... |
d79cb4b64426a85206a73cf465d91c57cf75e4d1 | bae2697224a462f5083ca4aedded5cb06c977868 | /runQpsGrid_funxyzpp/runQpsGrid_funxyzpp.cpp | c5215166acd4e2f6161c805ddd94d0a0c6ab7824 | [] | no_license | 0000duck/ICRMKinematics | 50d7d9ef5be72ff4d72311f5430f386af561a81f | bf2714e765df348f1ca4efec59a2884d73e9ebde | refs/heads/master | 2020-04-09T21:25:56.830596 | 2016-12-15T15:27:55 | 2016-12-15T15:27:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,973 | cpp | runQpsGrid_funxyzpp.cpp | #include <iostream>
#include <fstream>
#include "kinematicsDLL.h"
int main(int argc, char **argv) {
printf("Starting runQpsGrid_funxyzpp\n");
for (int i = 0; i < argc; i++) {
printf("%d = %s\n", i, argv[i]);
}
// read qps file
char *fname = argv[1];
printf("\n\nOpening %s\n", fname);
FILE *pf = fopen(fnam... |
4964de2f4b2744f0caa0a393a361d330353b94b7 | 616f5710199eb247a0f68bec9e9602e412e7e8bd | /src/platformer/entity/VultureEnemy.cpp | 4e93438e875e094bf318b9b6d524e59cf558c52b | [] | no_license | maximilianfuller/sphere | 524fadfd330c661c5621a2fb7c422a2b41191117 | 65ef2e02f6f0aa177ca4938093e6063a84a77a39 | refs/heads/master | 2021-05-06T03:53:25.669067 | 2016-10-11T00:47:15 | 2016-10-11T00:47:15 | 114,930,166 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,223 | cpp | VultureEnemy.cpp | #include "VultureEnemy.h"
#include "engine/world/World.h"
#include "engine/entity/Entity.h"
VultureEnemy::VultureEnemy(World *world, float power, glm::vec3 color,
glm::vec3 pos,
float speed, glm::vec3 vel, glm::vec3 acc,
glm::vec3 goal, ... |
1489e949b20cd2fd60842466fa40d2fef6bd87e5 | 04c962bd3345e3ce4e57da8b8e99806c67abc07e | /RuleClass/Produce.h | e48d9fb75da524c91c0e621224fa02161509ee4f | [] | no_license | nxdong/RuleClass | 4040a58abfb91f1004cc559e578da7596a792914 | 129480ab5d12fe1b5911e05d28add4ca9ecd4eb6 | refs/heads/master | 2021-05-28T12:09:07.560961 | 2015-01-14T02:48:27 | 2015-01-14T02:48:27 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 531 | h | Produce.h | #pragma once
#include "Rules.h"
#include <cassert>
// error define
enum produceErr
{
PRODUCE_SUCCESS,
PRODUCE_ERR
};
class CProduce
{
public:
CProduce(wstring const &src,CRules const &rule);
~CProduce();
private:
wstring const m_src; // 源串
int m_degree; // 迭代次数
CRules const m_rules; // ... |
c2c46d2f3e49f9e61f295bc9510b7030204e5931 | ae04470c3c266513002c2c5c9ac9b034614930cb | /30XX/zoj.3027.src.1.cpp | 266ab478237d83122df275be39a2d269333adbb1 | [] | no_license | fish-ball/acm.zju.edu.cn | 281315b9aab0517801ca780972a327642867eb7d | 984d48539607ed082749204a81d4aecac5bdac53 | refs/heads/master | 2021-03-12T19:15:13.640962 | 2018-11-16T10:34:34 | 2018-11-16T10:34:34 | 14,883,882 | 1 | 1 | null | null | null | null | GB18030 | C++ | false | false | 8,376 | cpp | zoj.3027.src.1.cpp |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
class Point; // 点、矢量类（x 坐标和 y 坐标）
class Arrow; // 有向线段类（起点和终点）
class Line; // 直线类
class Circle; // 圆类
class Polygon; // 多边形
const double INF = 1e30;
const double EPS = 1e-8;
const double PI = acos( ... |
5afafdef21663f8d7728a77a21214b0a9a15b57c | 6f327b612994298821fd3e4d8fd2285bba71fd1c | /src/Main.cpp | 128efaa532dc89ce68919d29f07f96850723d63a | [] | no_license | marcielleal/sudoku_solver | fb7eb68eebff884d391ea7b7176049ee05fc482c | 40ffb921b2237cae8f642735f8e29d6dae9cc59c | refs/heads/master | 2020-07-07T15:12:04.636281 | 2019-08-20T14:11:03 | 2019-08-20T14:11:03 | 203,385,362 | 0 | 0 | null | 2019-08-20T13:46:37 | 2019-08-20T13:46:36 | null | UTF-8 | C++ | false | false | 776 | cpp | Main.cpp | #include <iostream>
#include <chrono>
#include "Cell.h"
#include "Sudoku.h"
#include "Manager.h"
int main(){
//auto begin = std::chrono::high_resolution_clock::now();
/*
Sudoku sudoku("900000400500219000023080070004700298001000003090300004052007060070004980030162500");
sudoku.show_sudoku();
sudoku.solve(... |
e8059667aa280270b337b96198d409e5b9ea3e8c | 136426d1ea1bb32ff01bddebad5a048ef80dcea7 | /Source Code/DLL.cpp | a5a6215d8c99aee721aa027d8f6ab6ff61f79b15 | [] | no_license | purvakulkarni15/Polygon-Triangulation | e54cb5cf8b8677607b6ca277cd3a0c9fc68de36f | efffa285fe0899516d0dc332705dbec19416b4f1 | refs/heads/master | 2020-06-11T20:30:42.979787 | 2019-07-05T13:30:50 | 2019-07-05T13:30:50 | 194,076,457 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,167 | cpp | DLL.cpp | #include "DLL.h"
Node* CreateNode(glm::vec2 data)
{
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = data;
newNode->next = newNode;
newNode->prev = newNode;
return newNode;
}
DLL::~DLL()
{
}
DLL::DLL(glm::vec2 vertices[], int size, int formType)
{
root = CreateNode(vertices[0])... |
d659057b98f00bad129eb859251754ea7e576a85 | 7141cb311c337e0692120a6bd29ccc9c31bb6d3a | /Algorithms/Greedy/LuckBalance/LuckBalance.cc | bbb2820f647a27b7b98b988b000afdcb8ccfd377 | [
"MIT"
] | permissive | simba101/hackerrank | 0770c268121f15e1aa30eb4c061aa51107d4ce99 | 09e5a3b62ee4aca5fe0fcc02e674a3f495419ae6 | refs/heads/master | 2021-01-17T16:07:58.350889 | 2017-04-04T09:26:43 | 2017-04-04T09:26:43 | 70,776,466 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,270 | cc | LuckBalance.cc | /*
Solution to the "LuckBalance" challenge by HackerRank:
https://www.hackerrank.com/challenges/luck-balance
by simba (szczerbiakadam@gmail.com).
*/
#include <iostream>
#include <vector>
#include <algorithm>
int main(int argc, char **argv)
{
int N, K;
std::cin >> N >> K;
std::vector<int> contests;
std::vecto... |
3ed1dd30600e26d1057cfcd9b471138a7816d74e | 4ec65f15fe577fdff355bb4a1a38c203e4aae4dc | /ED/Monitoria06 - Recursão/q1.cpp | 74bfcf0b74827c1d65196f60f56de86113a0adaf | [] | no_license | HenrickyL/monitoria-2020.2 | f08ffbaf7e7909bb91bc5926c3cb40149504859e | 75f7cbc39402baa9aabc67006424631678a272c0 | refs/heads/main | 2023-03-04T19:10:11.701583 | 2021-02-05T21:37:32 | 2021-02-05T21:37:32 | 315,457,169 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 560 | cpp | q1.cpp | #include<iostream>
using namespace std;
void inverte(int*v, int n, int i=0){
//caso base
if(i<n){
int aux = v[n-1];
v[n-1] = v[i];
v[i]=aux;
inverte(v,n-1,i+1);
}
//chamada da recursão
}
void printVet(int *v, int n){
for(int i=0;i<n-1;i++)
cout<<v[i]<<", "... |
48724625decc0088a65090c9dc5352be2d4ab392 | 3aea5ebfd7f0854e0ddcf7574003728b91395540 | /Classes/NetWork/SocketBase.h | b82eef60156437d6dfb018b5168750d07ea75d6f | [] | no_license | XSimba123/TJSSE-ZNB | 0e9ecdb6ae77f351f7402b4e0fdea73e86b87842 | d84ceb6bebf30e06a75bbbfd7a762bd701b5c063 | refs/heads/master | 2020-03-19T16:42:30.500704 | 2018-06-24T16:35:53 | 2018-06-24T16:35:53 | 136,726,366 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,811 | h | SocketBase.h | #ifndef __SOCKET_BASE_H__
#define __SOCKET_BASE_H__
#include "cocos2d.h"
#include <list>
#include <thread>
USING_NS_CC;
// 对于windows平台
#if (CC_TARGET_PLATFORM == CC_PLATFORM_WIN32)
#include <WinSock2.h>
#pragma comment(lib, "WS2_32.lib")
#define HSocket SOCKET
// 对于android平台
#elif (CC_... |
e2dade6bf2cb5a68ffac75a99e3621d2fee8a8d1 | 8e563cc721da036718e66bd11c7b48cdf184a9e1 | /LeetCode/verysimple/20180629_01_pasacals_triangle.cpp | 0eabbcb9976bcf13e26777e06b5b46797d347f41 | [] | no_license | c437yuyang/DayliExcercise_Old | 98812cc734c2e20d90f9f5bb8d2cf91ef2ab25a4 | f23d5424b64a4a3ed331f8a87e73223e2ef3fc9a | refs/heads/master | 2021-05-23T01:48:01.655314 | 2021-03-01T15:23:31 | 2021-03-01T15:23:31 | 253,179,383 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 987 | cpp | 20180629_01_pasacals_triangle.cpp | /*
Given an index k, return the k th row of the Pascal's triangle.
For example, given k = 3,
Return[1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
*/
#include <iostream>
#include <algorithm>
#include <vecto... |
2edbca2c8967e293081d0c4a31b92f71af4c510c | 90cd27232bf33520edf59adc01f2ecc2d44bed5c | /ape_v1/ape_lib/src/NeurUnconsci.cpp | de0b434ceb6dca793641cded6cd1d3dd13ca20c0 | [] | no_license | wangxl1029/my_ape | b32f9f1b2b36aefc71434e36cdb5b9daa6c96732 | ed46462ed82956e2ee43a4fbbd825f5d885a1d0b | refs/heads/master | 2020-03-22T17:05:13.405650 | 2018-08-18T14:25:29 | 2018-08-18T14:25:29 | 140,371,651 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,002 | cpp | NeurUnconsci.cpp | //
// NeurUnconsci.cpp
// ape_lib
//
// Created by alan king on 2018/8/4.
// Copyright © 2018 alan king. All rights reserved.
//
#include <atomic>
#include <iostream>
#include <mutex>
#include "ai_prop.hpp"
#include "EmotionTarget.hpp"
#include "BusClient.hpp"
#include "NeurUnconsci.hpp"
#include "NeuronalLayerP... |
79f2175485f2fead7f16f4ff38020676c64ff8e5 | a65e1933f065a24927b8906869d12e148420b000 | /ÒOP/Lab 1/1/main.cpp | 0d962938bc8b70a20d9856f2a2b32a7a5df0f799 | [] | no_license | 26prajval98/4th-Sem-Lab | ffa471ce90f8e0d2500a1415e30bf4c7e7d8d847 | 690d3febc8a7ab57a83acda65b91516e88e4eafa | refs/heads/master | 2020-04-08T04:26:24.176009 | 2018-11-25T10:04:32 | 2018-11-25T10:04:32 | 159,016,430 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 692 | cpp | main.cpp | #include <iostream>
#define PI 3.14
using namespace std;
int geo(int a, int b, int c){
cout<<"Cuboid selected"<<endl;
return a*b*c;
};
int geo(int a, int b){
cout<<"Cylinder selected"<<endl;
return PI*a*a*b;
};
int geo(int a){
cout<<"Cube selected"<<endl;
return a*a*a;
};
int main(){
int... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.