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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
42188659a25fcb3111331435d9cde1fdfe3dc874 | a5b5f56c37954bd9e6744c33806896856a9975d8 | /UDPserver.h | deeac0863d7a1c78074040ec846541f8383f77ac | [
"MIT"
] | permissive | shanilfernando/VRInteraction | 3890b9410c5a0c9b2f39e68a203dc72a9c35a2f5 | db1f4ffe10059eb6af01ecc12846c3b2bd0a003f | refs/heads/master | 2020-12-03T04:02:48.901246 | 2017-07-11T09:36:41 | 2017-07-11T09:36:41 | 95,807,804 | 26 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 472 | h | UDPserver.h | #pragma once
#include<stdio.h>
#include<winsock2.h>
#include <vector>
#include <string>
#include <sstream>
#include <iostream>
#include <ctime>
#pragma comment(lib,"ws2_32.lib")
#define BUFLEN 512
#define PORT 5555
class UDPserver
{
public:
UDPserver();
~UDPserver();
std::string getBuffer();... |
18cbead82164d02127cd556e385939f7c1f9094b | 8ba4c2d8ba65d48ae32f911a8a2c6f16afe5670d | /usb_cam/src/usb_cam/gps/src/agvc_gps/src/agvc_gps_2d_node.cpp | d74fa8ec1522c2814fa52e6b4ce616923fd1f0ae | [] | no_license | Gwylim23/owr_software | 6aeda6bf3228225167d3ba0d67843b7c01a9e702 | a81562202a47337ff92447c02511eb5449a5e233 | refs/heads/master | 2021-01-18T03:11:10.053391 | 2014-08-02T02:36:32 | 2014-08-02T02:36:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,913 | cpp | agvc_gps_2d_node.cpp |
#include <agvc_gps/agvc_gps_2d_node.h>
AGVCGPS2DNode::AGVCGPS2DNode()
{
ros::NodeHandle private_node_handle("~");
// Read in GPS topic to subscribe to.
std::string gps_topic("fix");
if (!private_node_handle.getParam("gps_fix_topic", gps_topic))
{
ROS_WARN("[AGVC GPS 2D Node] : <gps_fix_topic> not spec... |
e11904aea9e75ce8bed13e6687285798ece892ea | 81940315f6b945c2fab270272630d01785ec0fb1 | /red/101_week4_ListsQuiz/main.cpp | 82e36e7b53e92b32c7f7e74d6387677b3a02da01 | [] | no_license | adogadaev/CourseraYandexCpp | d3361fb6a8707ac2ea406f0cd6a259cde1176732 | b5ca2b8288410fbb23f36ee813cd12eb87b11eeb | refs/heads/master | 2023-06-22T21:47:57.437530 | 2021-07-20T12:14:29 | 2021-07-20T12:14:29 | 218,399,060 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 558 | cpp | main.cpp | #include <iostream>
#include <list>
using namespace std;
int main() {
list<int> mylist;
// set some initial values:
for (int i=1; i<=10; ++i)
mylist.push_back(i);
for (const auto& el : mylist)
cout << el << " ";
cout << "\n";
auto it1 = next(mylist.begin(), 2);
auto it2 = next(mylist.begin(), 7);
cout ... |
3172aaad1f0f7518c1b07a8dc2db2922769171f1 | b4be6b6d18cb35e8d5cfbf5b7ec04d0bdbab7f79 | /test/test_mesh.cpp | 89fd6ec25c58200c05b07be462077cef414db3bf | [] | no_license | amorilia/vcache | 1eb767a9d0393bbeec3d551a63fcbb3adb8c86fc | 0b62a292097844186a9e27acda935ff0c7d2e173 | refs/heads/master | 2016-09-09T19:29:30.600599 | 2011-11-20T10:55:18 | 2011-11-20T10:55:18 | 1,106,988 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,409 | cpp | test_mesh.cpp | #define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MAIN
#include <boost/test/unit_test.hpp>
#include <ostream>
#include "vcache/mesh.hpp"
#include "test_helpers.hpp"
BOOST_AUTO_TEST_SUITE(mesh_test_suite)
BOOST_AUTO_TEST_CASE(declare_test)
{
// check that declarations work as expected
BOOST_CHECK_NO_THROW(Face ... |
bb0ff982a7e00247470b7df76c5b712674a550f8 | c4f06fda7a887b590e5787422f87f047258765f6 | /MightyTCPClient/BufferManage.cpp | 34e2ee8e98bb69e153cb4b79b3c10d69fb3fab8f | [] | no_license | wangdy326/CyclonicGameEngine | 686e07f5eeb9880635845f0c565af95ef74d0633 | 566f98c038185934fa0437d74a83f7d89bfec4fc | refs/heads/master | 2021-05-26T18:09:50.319170 | 2011-06-02T05:42:04 | 2011-06-02T05:42:04 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,182 | cpp | BufferManage.cpp |
//Copyright (c) 2005, 中搜
//
//文件名称：BufferManage.cpp
//创建:冯立强
//last update 2005-8-31 0:18:20 by 冯立强
#include "StdAfx.h"
#include ".\buffermanage.h"
CBufferManage::CBufferManage(void)
{
this->m_count = 0;
}
CBufferManage::~CBufferManage(void)
{
}
ICE_BUF *CBufferManage::AllocBuffer(int len)
{
ICE_BUF *pRetValue = ... |
4a98382ce4eaa6154d4637affdbf846ddbb8f5e2 | 65b02eae4e6ea39beadb67c5efd62e0b429bb43b | /Problems/cccc/L1/L1-029.cpp | aabbdb2114817c49277c4d7638b516db064a466b | [] | no_license | ctuu/acm-icpc | c0a96a347feba414fce28455e9b71546ac1cb08d | 7fde619dce94dd2e722465cdcad32c76d30afa16 | refs/heads/master | 2021-07-08T06:14:57.837572 | 2018-12-29T04:09:40 | 2018-12-29T04:09:40 | 81,524,853 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 172 | cpp | L1-029.cpp | #include <iostream>
#include <iomanip>
int main()
{
double a;
std::cin >> a;
std::cout << std::setprecision(1) << std::fixed << (a - 100) * 1.8;
return 0;
} |
2117bda29f0594588f3c0e51b13d5aaa45f33fe9 | 969d14ce44343fb1866261efee01e652e217c35e | /commands.h | 90cba69e593473e28b5b1de7d28f6a358af2fb13 | [] | no_license | Jkreynin/Anomaly-detecion-server | 2c8565c0b84b6de5f77067217944eaf5c4020a7b | db5b966de288bd1e8091ff16a505a79dda5b80d5 | refs/heads/master | 2023-03-13T09:18:45.042534 | 2021-03-04T17:06:04 | 2021-03-04T17:06:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,851 | h | commands.h |
#ifndef COMMANDS_H_
#define COMMANDS_H_
#include<iostream>
#include <cstring>
#include <syscall.h>
#include <fstream>
#include <vector>
#include "HybridAnomalyDetector.h"
using namespace std;
class DefaultIO {
public:
virtual string read() = 0;
virtual void write(string text) = 0;
... |
f7765dac88086a8d85e936d455306a5c480547de | e28e3c5355b34560b0b2cbdd40e75c6e445fa5b1 | /generic_process/ex1/Solution/Deque.h | cf3f3d24966c77288dee18e00b92958dfbe3d823 | [] | no_license | cnsuhao/labs | 98ed85cca6df21adb3bdb67e0bc273f80a913192 | a8ec74e904f7d7144002efa7bfcc52da8efa7b1d | refs/heads/master | 2021-05-18T09:15:26.259492 | 2013-01-29T07:59:10 | 2013-01-29T07:59:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,391 | h | Deque.h | ///////////////////////////////////////////////////////////////////////////////
// Copyright 2007 Eric Niebler, David Abrahams.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef DEQUE_H_BOOST_CONSULT... |
9ae1ddb601518544f6efcae96bce5093a6b853ec | 65ff94add5bec27c4fcf2006809dc9b9b8c788f1 | /src/core/router/transports/ssu/packet.cc | ba20de79eba60af5872dcf36b1cdddf271161c5b | [
"BSD-3-Clause"
] | permissive | anonimal/kovri | 6e4c8c9b24ab597c783f55b75ffc8e2de6f12df2 | 3fa695156d287d05924ab29fc33f491e562b3b59 | refs/heads/master | 2020-04-05T19:26:30.555894 | 2018-08-05T22:12:24 | 2018-08-05T22:12:24 | 50,646,302 | 0 | 1 | null | 2018-07-30T22:16:53 | 2016-01-29T07:31:37 | C++ | UTF-8 | C++ | false | false | 16,014 | cc | packet.cc | /**
* Copyright (c) 2015-2018, The Kovri I2P Router Project
*
* 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, ... |
21378bad63a04199c008fbe1706bfe0a02241f68 | 6ca029e4b3242d19360a51d6e3941bab31c6163b | /src/vscp/common/udpsrv.h | daa4bb154bc0d1906d14651ed3f42a10263ac418 | [
"MIT"
] | permissive | grodansparadis/vscp | d9246e4762f5d9653e5c037dfea854fc64e78fbd | 57f7202ff305118db16b5be29424cb69b0b47549 | refs/heads/master | 2023-07-10T01:40:41.117634 | 2023-06-27T13:25:36 | 2023-06-27T13:25:36 | 5,659,452 | 42 | 21 | null | 2017-12-29T17:18:38 | 2012-09-03T13:46:36 | C | UTF-8 | C++ | false | false | 6,963 | h | udpsrv.h | // udpsrv.h
//
// This file is part of the VSCP (https://www.vscp.org)
//
// The MIT License (MIT)
//
// Copyright © 2000-2022 Ake Hedman, the VSCP project
// <info@vscp.org>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "S... |
b972ccb3fc0e6d6e08195a2e78fb42a3a65626f0 | 15dea4de84765fd04efb0367247e94657e76515b | /source/3rdparty/won/Firewall/FirewallAPI.cpp | a48ef8c7b0afae85d12442eba1a10852718db527 | [] | no_license | dppereyra/darkreign2 | 4893a628a89642121d230e6e02aa353636566be8 | 85c83fdbb4b4e32aa5f816ebfcaf286b5457a11d | refs/heads/master | 2020-12-30T13:22:17.657084 | 2017-01-30T21:20:28 | 2017-01-30T21:20:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,516 | cpp | FirewallAPI.cpp | #include "FirewallAPI.h"
#include "Socket/TCPSocket.h"
#include "Socket/TMsgSocket.h"
#include "msg/Firewall/SMsgFirewallDetect.h"
#include "msg/Firewall/SMsgFirewallStatusReply.h"
#include <iostream>
using namespace WONAPI;
using namespace WONMsg;
using namespace WONCommon;
class DetectFirewallData
{
public:
Err... |
87c977ddf0936e25c17effd0286ba0cde21dfe06 | 2623da23ebf4385795543e42a07104e0bc9aa9e0 | /src/engine.cpp | beefaf5fb3053bfd0c961e6e2a714e0746a824fb | [] | no_license | tathougies/eva | 660e9a877cb04b447ec6f8620ed3824e8f0d51b0 | e4d24c4a3f32df003d22e4402026af065619ad85 | refs/heads/master | 2020-12-31T22:54:05.152176 | 2020-02-08T03:38:41 | 2020-02-08T03:38:41 | 239,063,591 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,157 | cpp | engine.cpp | #include "engine.hpp"
namespace eva {
IEngineSubmission::~IEngineSubmission() {
}
StreamSource::StreamSource(Engine &engine, const interned_string &moduleName)
: m_engine(engine),
m_submission(engine.registerStreamSource(this)),
m_module(moduleName) {
}
StreamSource::~StreamSource() {
}
... |
e97d6de80952b11b8883b9fc84486350d3046860 | 6eeb2ace34ce205bf25cf99993a0972aa38859f3 | /Assignments/Assignment_01/Node.h | 62b7a1c6584fa90e5cb08240fb47b317fbf436ac | [] | no_license | mattjmoses/DataStructures | 05020529bd6432a8d84ee687c01417c782ca623f | f4acbb664a705e3a60e1a3b1530117edfce31958 | refs/heads/master | 2021-05-13T11:54:45.142914 | 2018-04-16T23:18:59 | 2018-04-16T23:18:59 | 117,143,816 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 411 | h | Node.h | //
// Created by Matt on 2018-01-10.
//
#ifndef ASSIGNMENT_01_NODE_H
#define ASSIGNMENT_01_NODE_H
#include<string>
using namespace std;
//Here's our node class which handles all the data and pointers on the nodes.
class Node {
public:
string nodeData; //This contains the text data in the node.
Node *nod... |
2fc04875981e76e9f33c9dfce49466dde3b63c9e | 24f26275ffcd9324998d7570ea9fda82578eeb9e | /base/task/promise/promise_value.cc | 23d501bb00124b099ae5121c5b3fd42ecdb0cd46 | [
"BSD-3-Clause"
] | permissive | Vizionnation/chromenohistory | 70a51193c8538d7b995000a1b2a654e70603040f | 146feeb85985a6835f4b8826ad67be9195455402 | refs/heads/master | 2022-12-15T07:02:54.461083 | 2019-10-25T15:07:06 | 2019-10-25T15:07:06 | 217,557,501 | 2 | 1 | BSD-3-Clause | 2022-11-19T06:53:07 | 2019-10-25T14:58:54 | null | UTF-8 | C++ | false | false | 638 | cc | promise_value.cc | // Copyright 2019 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 "base/task/promise/promise_value.h"
#include "base/task/promise/abstract_promise.h"
namespace base {
namespace internal {
// static
void Promi... |
294d1b28285c81d6cd891b7edba98ff26ee7d75c | a62153d5ac82729f228e2dc854aea325e3afad6d | /ESTAssemblyC++/Graph.cpp | 22d5671396948bcf5a88eb4c9c7dea827f0a43f5 | [] | no_license | dhungvi/mytestpjt | 17d95a8180be59988cde3e88f2a0694064951b0b | 4ede2b72ec28fce9cc909c01b5cf89463b645e03 | refs/heads/master | 2021-01-01T06:55:18.101041 | 2010-03-07T17:07:54 | 2010-03-07T17:07:54 | 37,358,601 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,292 | cpp | Graph.cpp | #include <math.h>
#include <iostream>
#include "Graph.h"
using namespace std;
Graph::Graph(InclusionNodes* in) {
numOfLevels = NUMOFLEVELS;
inc = in;
}
vector<SixTuple*> Graph::handleInclusion() {
vector<SixTuple*> nodes;
int nOfNodes = mst.size();
for (int i=0; i<nOfNodes; i++) {
bool flag =... |
2159c441f6f9782137f3de2f78819d2d35114d75 | 6ac43269dd6013c6f4e8e1afbb5337e3374dbf74 | /Interfaces/MassDiag/inc/ParSLHA.hpp | 8b2772a795cd57489a8d0e3bedbb72a7a01d014c | [] | no_license | HEPcodes/FeynRules | e520d30c98bdecb6fd54cfb8507ad39d9a3c8ae8 | d3c7ef89542e4101e1379298a0c932bc75d5dcf0 | refs/heads/master | 2022-05-10T19:46:48.980590 | 2022-02-08T18:49:35 | 2022-02-08T18:50:51 | 18,512,127 | 8 | 6 | null | 2021-05-26T11:34:01 | 2014-04-07T09:30:58 | Mathematica | UTF-8 | C++ | false | false | 857 | hpp | ParSLHA.hpp | #ifndef PARSLHA_HPP
#define PARSLHA_HPP
#include "headers.hpp"
//class to store parameters to be used in the SLHABlocks.
class ParSLHA
{
private:
/****parameters****/
//the value
double value;
//the comment to be used in the parametercard
string comment;
public: ... |
43bf5384f12e0bf224fa5f5cd006049fe6c3715b | 64732dfaeb3efb781db6e894bebfe23d627278e7 | /LoganEngine/src/lCore/lRenderer/lrRenderer/lGLRenderer/lGLUtils/lrGLRenderUtils.h | dc2b6f8bea2efeeb3f986f3fe80ad477dd6791fa | [
"MIT"
] | permissive | sereslorant/logan_engine | b791f843a36bd19caa4cc97dc4ec102a37cb650a | a596b4128d0a58236be00f93064e276e43484017 | refs/heads/master | 2020-05-21T19:41:45.676116 | 2018-01-28T10:25:43 | 2018-01-28T10:25:43 | 63,418,341 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,110 | h | lrGLRenderUtils.h | #ifndef LR_GL_RENDER_UTILS_H
#define LR_GL_RENDER_UTILS_H
#include <lRenderer/lrRenderer/lGLRenderer/lGLExt.h>
#include <lRenderer/lrRenderer/lGLRenderer/liGLShaderInterfaces.h>
#include <lRenderer/lrRenderer/lGLRenderer/lGL3Renderer/lGL3DCachedLayer/lrGL3SceneCache/lrGLData/lrGLMaterialData.h>
#include <lRenderer/l... |
1ac0ab00c5d14a0a1966a259161c13e2c1bec1ae | d7632bcbe8385f864752d5765869b09c6ec69303 | /MouseController/thread/thread_point.h | debc97d4e5fc1d075c563a4d199bc0bf693de66f | [] | no_license | tigerbobo/public | 4aac0f445aac9f06ea3a0d4533bc983b3a537084 | 4c6bcfe2ad015c95a9c5aaaf4405d04080ca9139 | refs/heads/master | 2022-11-21T10:14:41.579616 | 2022-10-21T01:23:04 | 2022-10-21T01:23:04 | 228,769,259 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 557 | h | thread_point.h | #pragma once
#include "base_thread.h"
#include "..\define\define.h"
class CThreadPoint : public CBaseThread
{
public:
CThreadPoint() {};
~CThreadPoint() {};
protected:
virtual unsigned int procedure(void *param)
{
POINT point;
HWND message_wnd = (HWND)param;
onstart(0, 0);
while (false == ... |
dff4da9fb397e96120bdb81bf60a1f8d11de9a99 | 037985edaf61f245644a1b6c4724c2b54174120e | /HW1/main.cpp | 6e6701c2eb7060dea907a9805121579507590664 | [] | no_license | SANDEEP95890/algorithm-implementations | c41cdaf7c580902a7f637abe2dbb8ad25a9320de | 59b82124f8d94ca8234349a4fc370db73ade8343 | refs/heads/master | 2023-03-17T13:01:51.099683 | 2020-09-30T22:38:23 | 2020-09-30T22:38:23 | 549,698,818 | 1 | 0 | null | 2022-10-11T15:39:28 | 2022-10-11T15:39:27 | null | UTF-8 | C++ | false | false | 1,862 | cpp | main.cpp | #include <iostream>
#include <cstdlib>
#include <vector>
#include <chrono>
#include <random>
using namespace std;
void find_duplications(unsigned int *arr, unsigned int arr_length, vector<unsigned int> &dup_vec) {
for (unsigned int i = 0; i < arr_length; i++) {
for (unsigned int j = i + 1; j < arr_length;... |
e1ff372336207bbcb2d4ad3e31a533e732a2dca9 | 429cbd00303dc2084344ca5fda79303cb120dd6f | /Assignment2/GeneratedFiles/ui_ReceiverOptions.h | facd54db2bd6fcc547b08acbeaa18e21c5ec4e43 | [] | no_license | jctee/TCP-UDP-FileTransfer | 0d83a182fc04ee8b6c704827f99150ea09dbf2b6 | 9484329576ae4500d9780fa1acb013d9810fa5ed | refs/heads/master | 2020-03-18T05:47:09.610644 | 2018-05-22T05:13:35 | 2018-05-22T05:13:35 | 134,361,334 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,083 | h | ui_ReceiverOptions.h | /********************************************************************************
** Form generated from reading UI file 'ReceiverOptions.ui'
**
** Created by: Qt User Interface Compiler version 5.9.3
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
*****************************... |
26b79938cece68f9e502f52805e73aac1f480e20 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /Codes/AC/2552.cpp | 172829fca33ee3ceebb943f2995c79f22dff9307 | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 990 | cpp | 2552.cpp | #include <iostream>
#include <cstring>
using namespace std;
#define N (int)1e7
int freq[N + 1], n, ans[N + 1];
bool is_prime[N + 1];
int presum[N + 1];
void seive()
{
for (int i = 2; i <= N; i++)
is_prime[i] = 1;
for (int i = 2; i*i <= N; i++)
if (is_prime[i])
for (int ... |
94f949a94e323348b4048c7bbacebd7a2dbcb00d | 3acacb08ce68dde28c6b400ec90977b0e7779454 | /PacketCommSrv/PacketTool.cpp | ae1120ba844f35138f314ed2dfe75b97e1ed81dd | [] | no_license | mqd520/NetworkCommucation-C- | 5d532743f9ce19ee24a6bf7952b0c7f1cfca7ca1 | 2be895c0864439b1c761b111ee3270e01596f6a7 | refs/heads/master | 2021-01-22T21:07:46.629692 | 2019-07-16T09:22:29 | 2019-07-16T09:22:29 | 85,392,410 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 732 | cpp | PacketTool.cpp | #include "stdafx.h"
#include "Include/pck/PacketTool.h"
#include "Include/pck/IGPacket.h"
#define PCR_PacketPointer(CMD, ClassName) if (cmd == EPacketCmd::CMD){return new ClassName;}
namespace pck
{
PacketTool::PacketTool()
{
}
bool PacketTool::IsCmdValid(EPacketCmd cmd)
{
if (cmd == EPacketCmd::None)
{
... |
0cfc294effb733d8366290574866e3617c4118a6 | 8ab5aab459348f84db0a11a5e9e289c1c3f4a43b | /rmf_traffic_editor/include/traffic_editor/crowd_sim/crowd_sim_impl.h | 619cbf640e7d72f2ee963160f50a9ddfaaa75d5a | [
"Apache-2.0"
] | permissive | xiyuoh/rmf_traffic_editor | 2e48d288a63b77564251e0eccc01f617a9b3b6a1 | 686d7a367f8cb2f7d5fe7221b3fd6873499d7be9 | refs/heads/main | 2023-08-27T09:10:40.524035 | 2021-11-08T08:30:56 | 2021-11-08T08:30:56 | 395,252,842 | 0 | 0 | Apache-2.0 | 2021-08-12T08:43:03 | 2021-08-12T08:43:02 | null | UTF-8 | C++ | false | false | 3,747 | h | crowd_sim_impl.h | /*
* Copyright (C) 2020 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by appl... |
d6986c4f7452adcf7a06ceb663709ebe21a5698d | 1c27c3689fed12f6378562df19f745f54b245fab | /zadanie6/StatekPasazerski.cpp | 8e20547f4799bc554503ba45474ef185e512d72c | [] | no_license | reko001/zadanie6 | 9eda6f0397b533b93912885d6fcce3babb5e1dda | 99713d136d08f5768b43e72fef1c85b06a847bae | refs/heads/master | 2023-04-27T07:51:43.212001 | 2021-05-09T13:38:30 | 2021-05-09T13:38:30 | 365,612,243 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 833 | cpp | StatekPasazerski.cpp | #include "StatekPasazerski.h"
int StatekPasazerski::get_pasazerowie() const {
return m_pasazerowie;
}
void StatekPasazerski::set_pasazerowie(int pasazerowie) {
m_pasazerowie = pasazerowie;
}
int StatekPasazerski::liczba_osob() const {
return m_pasazerowie + get_zaloga();
}
std::ostream& operator<<(std::ostream& ... |
8e62c58c70afbd180ba6707875fa7a6c242b37a5 | d9b8b19c0723a893856bdd613279e43028a1e757 | /FlockingHell/FlockingHell/Source/Private/Player.cpp | 91aa1816bd2f1136dec1cbcaaef6985134d37ad2 | [
"Apache-2.0"
] | permissive | AliElSaleh/Cosmic-Hell | 400c0849340cc0ff4b6a5a51add923c619496966 | 603ae26c4d1c0e05aad1be98bc98af093369121d | refs/heads/master | 2020-04-11T06:29:40.949609 | 2019-03-19T07:22:11 | 2019-03-19T07:22:11 | 161,582,151 | 16 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,990 | cpp | Player.cpp | #include "Globals.h"
#include "Player.h"
#include "Bullet.h"
#include "Assets.h"
#define ASSETS Assets::Get()
#define GetAsset(Name) ASSETS.GetSprite(#Name)
void Player::Init()
{
Sprite = GetAsset(Player);
Heart.clear();
Bomb.clear();
for (int i = 0; i < 6; i++)
Heart.emplace_back(GetAsset(Heart));
for (in... |
fdac34c01fcbfb1fbba5c0c29046dd1c0453ed4a | 9cb52fa70eb57fa0cc13bd37b6dd6b5f8b3468a5 | /oop/oop/move-constructors/Move.hpp | 1c07df072d684a0068d9324413d8ddde2d299ee9 | [] | no_license | AybarsAcar/cpp-learning-material | e095ebc006d933506c0f3516131074c6318eb461 | c00573dd6080e955aa9997b0e01c2a0ada6a4c4c | refs/heads/master | 2023-02-12T21:12:39.103841 | 2021-01-15T00:27:22 | 2021-01-15T00:27:22 | 329,767,628 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 531 | hpp | Move.hpp | //
// Move.hpp
// oop
//
// Created by Aybars Acar on 10/1/21.
//
#ifndef Move_hpp
#define Move_hpp
#include <stdio.h>
/**
* Class that has a move constructor
*/
class Move
{
private:
int *data;
public:
Move(int d); // constructor
Move(const Move &source); /... |
e800745457d6dca5835526380679e834f2a9f32d | e312cfd866411780194e923f7e34c3e849b7545b | /lib/word.cpp | 6dd357679b653af60ccc42214ebd7dc184f3e768 | [] | no_license | HishamLY/TugasUTSGrafika | d9eafb41a3504006140661abd2f4b4f7bdbdcac0 | 5615527a41fe65fee63135d2fe1df5e504a177f8 | refs/heads/master | 2021-09-27T21:46:50.005828 | 2018-11-11T22:35:18 | 2018-11-11T22:35:18 | 125,203,362 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 27,767 | cpp | word.cpp | #include "word.h"
#include <iostream>
using namespace std;
Word::Word(char _c):
c(_c)
{
start_fill_x = 11;
start_fill_y = 8;
}
Matriks Word::draw() {
if (c == 'p' || c == 'P')
return drawP();
else if (c == 'y' || c == 'Y')
return drawY();
else if (c == 'z' || c == 'Z')
ret... |
c918050f1d09fc50bed95f6a1bb05cb6da482ab3 | 4bf2ee10c6594f70c32feb3bcb50eec186daa9cf | /solutions/2482/2482.cpp14.cpp | 4792ba18c6fe363dc48e3ede44b3895032029f4e | [] | no_license | jwvg0425/boj | 7674928dc012ba3c404cef3a76aa753828e09761 | 4b7e7389cbe55270bd0dab546d6e84817477b0f1 | refs/heads/master | 2020-07-14T02:37:36.658675 | 2017-07-13T06:11:44 | 2017-07-13T06:11:44 | 94,295,654 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 758 | cpp | 2482.cpp14.cpp | #include <stdio.h>
#include <vector>
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <tuple>
#include <memory.h>
#define MOD 1000000003
int table[1001][1001];
//n개짜리 색상환에서 인접한 거 선택 안 하고 k개 고르는 경우의 수
int solve(int n, int k)
{
if (n <... |
29a1469af919431e8aae25a4521e961325263df9 | 5bddb7782c09facdef854f822f39f7d9aab597de | /Library Management System/onhold.h | 996617ce72174796782e9fae8b59c4c1f7748fc7 | [] | no_license | jamshaidsohail5/Library-Management-System | 2b3f7211f3e0c1e272773c2d1f2b6ff2f2d115cd | f8d8478b6bf4b6ea76bff643877092100b294954 | refs/heads/master | 2021-04-15T15:16:47.182689 | 2018-03-26T01:46:57 | 2018-03-26T01:46:57 | 126,757,526 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 269 | h | onhold.h | #ifndef ONHOLD_H
#define ONHOLD_H
#include"state.h"
#include "user.h"
#include "libitem.h"
#include "date.h"
#include "loan.h"
class onhold:public State
{
public:
onhold();
void add_loan(user * u,Libitem*li,Date ida,Date rda,loan *l);
};
#endif // ONHOLD_H
|
355110354e9dce2445e5ff535fb1de252062d5e5 | 6712f8313dd77ae820aaf400a5836a36af003075 | /zOrder.h | 6b75b840bd0d0848a7ddf0ad02d2b6d8c7490a11 | [] | no_license | AdamTT1/bdScript | d83c7c63c2c992e516dca118cfeb34af65955c14 | 5483f239935ec02ad082666021077cbc74d1790c | refs/heads/master | 2021-12-02T22:57:35.846198 | 2010-08-08T22:32:02 | 2010-08-08T22:32:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,001 | h | zOrder.h | #ifndef __ZORDER_H__
#define __ZORDER_H__ "$Id: zOrder.h,v 1.3 2006-12-01 18:47:47 tkisky Exp $"
/*
* zOrder.h
*
* This header file declares the zOrderMap_t and
* zOrderMapStack_t classes, which are used to keep
* track of the objects occupying a piece of screen
* real estate.
*
*
* Change History :
*
* $L... |
0b79f6d75535cb33fa8cd41fbb03751ba04ad243 | 6f635d39c3844633266eb7a23192ec1df2951c51 | /src/screens/vrScreenSelectMusic.h | bf72a3c5f5ee688f602c4bd0132868b6a2ddbaac | [] | no_license | mvallebr/VivaRock | 4e810fe0660a9fd8d1c39c7a80e050ab2dfc329a | 20426c15ec9a44526411e03700d896be24b4ab77 | refs/heads/master | 2021-01-01T05:51:16.810334 | 2011-11-20T16:04:49 | 2011-11-20T16:04:49 | 2,812,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 508 | h | vrScreenSelectMusic.h | #ifndef VRSCREENSELECTMUSIC_H_
#define VRSCREENSELECTMUSIC_H_
#include <system/vrScreen.h>
#include <core/vrPlayer.h>
#include <irrlicht.h>
using namespace irr;
class VRScreenSelectMusic : public VRScreen {
private:
int selectedMusic;
public:
VRScreenSelectMusic(string name);
virtual ~VRScreenSelectMusic();
virt... |
a7eb8c0435df26c1a78f172104731206df2196de | d205793571b39fe254f513f4437f37c47f4db011 | /src/StateVector.cpp | 7cc6e6b228869c59f64aea145f5f3eccd0d05287 | [] | no_license | memanuel/kepler-sieve | ba996c4008edec3458ac0afbfa3bee95367467cd | 9f11f377d82cb941d77159fd7b97ae2300b6ca6a | refs/heads/main | 2021-11-22T19:07:13.725263 | 2021-08-08T20:44:47 | 2021-08-08T20:44:47 | 236,581,914 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,562 | cpp | StateVector.cpp | /** @file StateVector.cpp
* @brief Implementation of class StateVector.
*
* @author Michael S. Emanuel
* @date 2021-07-02
*
*/
// *****************************************************************************
// Local dependencies
#include "StateVector.hpp"
// *****************************************... |
b4ac7d65b3db48261816e973aa3b776eb90709e9 | a4736d6be8fe24919dc899ca3ecf0da5ffd40c43 | /1133.cpp | 797d3505fc7536a972f7ef4a6edbf7058947e75a | [] | no_license | VauP/URI_Judge_SolutionsCPP | 4df49b6e8211e40b9c171f249d1983e85c42dfc1 | 9f0b504e281154aa7389b0b4001620f08c19b20a | refs/heads/master | 2023-02-17T13:21:47.868588 | 2021-01-13T18:15:46 | 2021-01-13T18:15:46 | 292,113,263 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 271 | cpp | 1133.cpp | #include <iostream>
using namespace std;
int main(){
int x,y,m=0,ma=0;
cin>>x;
cin>>y;
ma=x;
if(y>=ma){ma=y;m=x;}
else {ma=x; m=y;}
for(int i=m+1;i<ma;i++){
if(i%5==2 ||i%5==3){cout<<i<<endl;}
}
return 0;
}
|
efad82a9b3ae0ccb73002a89b3b52e7e817e4f07 | 08f258b8a4feec9d148632e2666cb8d030edccbf | /Actions/PlaySoundAction.cpp | 7e4f62ead1e20af79a27e5bfad39bef3c64260c9 | [] | no_license | alienjon/Escape- | 56eab369d8095b4332bed6c0421cd6037056e211 | 62741ed573b1c01209cd24a5eabc02325bdb4868 | refs/heads/master | 2020-04-13T20:51:15.526752 | 2013-06-29T05:25:58 | 2013-06-29T05:25:58 | 1,593,887 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 384 | cpp | PlaySoundAction.cpp | /*
* PlaySoundAction.cpp
*
* Created on: Aug 12, 2009
* Author: alienjon
*/
#include "PlaySoundAction.hpp"
using std::string;
PlaySoundAction::PlaySoundAction(const std::string& sound) :
mSound(sound)
{
}
void PlaySoundAction::activate(Level& level)
{
// Play the sound.
AudioManager::playSound(mS... |
f6fa410474ca82195eb2df45394fa00b1107f873 | a10bf0c86a5eb0b38fa42a159ac32a460c393cc1 | /main.cpp | 953fad3dad9eb94263c304b645ade89ce3afcb7a | [] | no_license | oliverxa/yolov3-sort-cpp | ae0fdc156f72ba310812623affb532d69852bc4b | fbf01aea73725b57308a2e8da980d68186b8c093 | refs/heads/master | 2020-12-11T10:52:53.272023 | 2020-06-20T05:03:38 | 2020-06-20T05:03:38 | 233,829,348 | 30 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 3,428 | cpp | main.cpp | #include <torch/torch.h>
#include <opencv2/opencv.hpp>
#include <iostream>
#include <chrono>
#include <string.h>
#include "Darknet.h"
#include "SORT.h"
#include "YOLOv3.h"
// global variables for counting
#define CNUM 20
//int total_frames = 0;
//double total_time = 0.0;
int main(int argc, const char* argv[])
{
... |
e910496702e91d174187d076948b9f6331af2d2e | f806d792bf22bc8306a0926f7b2306c0b3dd4367 | /Leetcode/P58 最后一个单词的长度/sl.cpp | 5cf21b8a10322af198a5a7d41aaf2d1f83c251ce | [
"MIT"
] | permissive | Wycers/Codelib | d7665476c810ddefd82dd758a4963f6b0e1b7ac1 | 7d54dce875a69bc998597abb1c2e2c814587c9b8 | refs/heads/master | 2023-03-05T13:57:44.371292 | 2022-09-22T02:23:17 | 2022-09-22T02:23:17 | 143,575,376 | 28 | 4 | MIT | 2023-03-04T22:05:33 | 2018-08-05T01:44:34 | VHDL | UTF-8 | C++ | false | false | 192 | cpp | sl.cpp | class Solution {
public:
int lengthOfLastWord(string s) {
istringstream iss(s);
string word;
while (iss >> word)
;
return word.size();
}
};
|
5ec9d20c9d23002c7ae1453b123210ef0599f018 | 02ab470d3187e5d3e2800859984a9ee58f9bd3c0 | /casmacat/Range.h | 48b6fc3e56fccc08b6adc5ae43a81b19e1572169 | [] | no_license | PRHLT/CATTI | e128883400b9637768da348205d5083841958969 | 61cff0de9c9c5dd0e32d9b560139b9e4a9c2c7f5 | refs/heads/master | 2021-05-01T21:28:14.304219 | 2018-02-06T11:40:12 | 2018-02-06T11:40:12 | 75,202,392 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,786 | h | Range.h | /*
* Copyright 2012, valabau
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or a... |
b1662ca4e8308ac7c0acbfbeb75c6fbe4d926bd0 | 093f6363e7728ea1a98254e75830ca7297b39436 | /MayChallenge/week3/PermutationInString.CPP | 63853f7922d2e66d3f5ac22262d476b661c38e6b | [] | no_license | srmalkan/Leetcode | 33fd50e0083343a2cabe78345cf51cf492913c7f | eee663a74655aa43ac954e26fc1ab25190eb85e3 | refs/heads/master | 2023-05-30T08:29:52.138428 | 2021-06-16T16:46:49 | 2021-06-16T16:46:49 | 261,119,298 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,812 | cpp | PermutationInString.CPP | class Solution {
public:
bool compareMaps(map<char,int> &temp, map<char,int> &P){
if(temp.size()!=P.size()){
return false;
}
for(auto itr=P.begin(),itr2=temp.begin();itr!=P.end();itr++,itr2++){
// cout<<itr->first<<" "<<itr2->first;
if(itr->first != itr2->... |
77fad8ee8dc72a9b2d9cdf744635d3461077d1f9 | 29871ec191cbbec8fe5ad4dc905dbbcef9484e9f | /C++/04042018/ex6.cpp | 24e014011a135e164a92c09912f9d3f5d5930e26 | [] | no_license | narosan/Algoritmo-UVA | 03b4e37b48a38b5f6e75da659c10bd366d1bda6d | 30caf6052c578f6f93aad149f2a463ef56142cd5 | refs/heads/master | 2020-03-10T14:55:43.362716 | 2018-06-21T21:07:37 | 2018-06-21T21:07:37 | 129,438,303 | 0 | 1 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 1,325 | cpp | ex6.cpp | /*
6) Fazer um programa para que o usuário opte por uma opção de
conversão “1 – Celsius 2 – Farenheit”. Após a escolha o usuário deverá
informar a temperatura. Criar uma nova função para aplicar a conversão
conforme opção escolhida.
Fórmulas:
C=5*(F-32)/9
F=(9*C/5) + 32
*/
#include <stdio.h>
#include <stdli... |
4ffe9bc95d5535a297e379b1d7fec9d9e10bda5a | b1679be076b6f72da0897fe5b3fc66cbe30fb2b0 | /codeforces/265-c.cpp | 32eb7116ddd7605029a6293d7536a60e1a01438f | [] | no_license | euyuil/icpc-training-solutions | a86b4a4bf12bd931fa2315683d8ee22dff253930 | d40c5b90dbe668ea80d5a7bc55592016a9c3d20d | refs/heads/master | 2020-06-04T15:40:52.854240 | 2013-09-24T03:15:03 | 2013-09-24T03:15:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 673 | cpp | 265-c.cpp | #include <iostream>
#include <algorithm>
using namespace std;
const int N = 1000111;
int id[N];
int main()
{
int i = 2, m = 2;
char c;
id[1] = 1;
while (cin >> c)
{
switch (c)
{
case 'l':
id[i++] = m++;
break;
case 'r':
if (i > ... |
80298727aa79c9b5bf3b9a49b18bb7915cc366f0 | ab17472543e64365ed23468b19f54a2e0fddb9ce | /scripts/EGammaTrigEff.cc | 59751e83586fc70b3a8f69cd1c83d837bcbce098 | [] | no_license | JessWYWong/postFWLJMETanalyzer-SS2L | 86cae06723f60c9dbe3316837efd71807b07c61b | c35d327fa88f84b1486653d03ea8de01e7af994b | refs/heads/master | 2022-06-17T03:16:15.909411 | 2019-06-24T19:37:03 | 2019-06-24T19:37:03 | 224,484,652 | 0 | 0 | null | 2019-11-27T17:35:40 | 2019-11-27T17:35:39 | null | UTF-8 | C++ | false | false | 5,385 | cc | EGammaTrigEff.cc | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <sstream>
#include <string>
#include "TFile.h"
#include "TTree.h"
#include "TH1.h"
#include "TGraphAsymmErrors.h"
#include "TCanvas.h"
#include "TLegend.h"
#include "TLatex.h"
#include "TMath.h"
#include "Math/ProbFunc.h"
using namespace std;
TGraphAsy... |
aeb7cd55dcc93a2819b03881d27f92f501314176 | 4d74aa247055ba254a7f3ab305634dffcc656185 | /tests/kernel_bundle/has_kernel_bundle_zero_device.h | 9149f8cd7d24fb90f4b137b1a88ba645cf56f1ac | [
"Apache-2.0"
] | permissive | KhronosGroup/SYCL-CTS | e2ecc8ffd0f80e90f6f44a2f5e1ce167aff53ba9 | cc653d0d88bb40d209e83267b5b91b070d84300a | refs/heads/SYCL-2020 | 2023-08-31T23:55:36.962775 | 2023-08-30T14:12:30 | 2023-08-30T14:12:30 | 160,528,100 | 51 | 60 | Apache-2.0 | 2023-09-14T15:49:21 | 2018-12-05T14:11:21 | C++ | UTF-8 | C++ | false | false | 4,169 | h | has_kernel_bundle_zero_device.h | /*******************************************************************************
//
// SYCL 2020 Conformance Test Suite
//
// Provides common code for zero device test case
//
*******************************************************************************/
#ifndef __SYCLCTS_TESTS_HAS_KERNEL_BUNDLE_ZERO_DEVICE_H
#def... |
f4b8a83e37fe10ce9ca70b80f2ee78dd0024e27f | 2dcc8c1fcb0427dbdae0f82c919989dcf2055c44 | /Test/sub_hwa.cpp | dc373ea175fbdc58c6c6ca58128282ca32fcca56 | [] | no_license | wnflrj123/Test | dd2527933aa71519e4110da6587188455bd93e0a | dfd3381937079141671cbe436045cd61483b5171 | refs/heads/jooool2 | 2020-05-17T04:21:45.631511 | 2015-08-13T13:08:18 | 2015-08-13T13:08:18 | 29,849,217 | 0 | 0 | null | 2015-08-13T13:08:18 | 2015-01-26T07:05:52 | C++ | UTF-8 | C++ | false | false | 341 | cpp | sub_hwa.cpp | //
// main.cpp
// Test
//
// Created by 서듈 on 2014. 10. 14..
// Copyright (c) 2014년 서듈. All rights reserved.
//
#include <stdio.h>
//int main() {
// // insert code here...
// int sub;
// double hwa;
//
// scanf("%d",&sub);
// hwa=9.0/5.0*sub+32;
//
// printf("%.1f",hwa);
//
// ret... |
66f8f7de76d544b39c75635d74b0b451d70e90cc | 6cc9420434eacf18814a033e92fe114e5bbfcf1f | /FinalPrj_NN_Framework/mnist_dataset_helper.h | 46d08cdb5e3c601d60defe0ddbcdb18d710a29a2 | [
"MIT"
] | permissive | dimant/gpu2021hpc | a043a92c7616fa1bb4b164c77e86be5e9e3f30a0 | c6a7dd94df9dc18f475ae4a89452335948de7eb5 | refs/heads/main | 2023-03-24T10:57:12.381443 | 2021-03-19T04:56:37 | 2021-03-19T04:56:37 | 328,256,637 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,877 | h | mnist_dataset_helper.h | #pragma once
// MNIST dataset loading and pre-processing
//
// full_path strings must be fully-qualified path to a valid MNIST datafile of IDX file format
//
#include <string>
#include <fstream>
typedef unsigned char uchar;
using namespace std;
auto reverseInt = [](int i) {
unsigned char c1, c2, c3, c4;
c1 ... |
6ecd597b6b5b5f8715ab7a1edd5154b7282c7f9f | af9c1566c7f8b7e30ee957ef40de647c1d86d17a | /tek2/maths/208chevillettes/Core.hpp | af65eb4c7e7d1c4396f7655c0acf79d058522545 | [] | no_license | Vasrek77/epitech-projects | 471b7503e189000ad1ab491915c950af4b661c01 | 6db30340f7accd04d037ba1ea2bc3e3ecd736251 | refs/heads/master | 2021-01-17T22:41:05.342477 | 2015-08-12T19:10:24 | 2015-08-12T19:10:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,161 | hpp | Core.hpp | #ifndef CORE_HPP_
# define CORE_HPP_
# include <iostream>
# include <iomanip>
# include <sstream>
# include <fstream>
# include <vector>
# include <cmath>
# include "gmpxx.h"
# include "Exception.hpp"
using namespace std;
class Core {
vector<int> _effectifs;
vector<double> _ajust;
vector<int> _pourcent... |
914c5175bb17bf6f32d9dd2bb55296ba75849901 | 2d3cb2f9ac1028e81abe725692f8e34d259da3f4 | /2nd year rahul sirc++/Inheritance/InheritData.cpp | 984055bc53018beb8a2157575d20d58271cd2c01 | [] | no_license | satinder147/c_plus_plus | f1c5f7c9b2b79871bea7b33a364d64d2e535d602 | 041e38803825c7b65c2b6ce78d5b5fb231ed8adc | refs/heads/master | 2021-07-08T07:14:31.096467 | 2020-08-13T15:11:37 | 2020-08-13T15:11:37 | 149,191,459 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 739 | cpp | InheritData.cpp | //Program to study :Inheritance of Data
//See : InheritData.png
//Refer : Inheritance.txt
#include <iostream>
using namespace std;
class A
{
private:
int x;
protected:
int y;
public :
int z;
A();
int getX();
~A();
};
A :: A()
{
cout<<"\n A()";
x = 10;
y = 20;
z = 30;
}
... |
f1478c18c6781e5b8ed6ed2dee8599ae274205a7 | f66ca7e6d96638d129c73e4dab57223ee57bd7fe | /p552/p552_2.cpp | 9b149d399bb17b1fdcda735f6e98f538eb0f3f7f | [
"MIT"
] | permissive | suzyz/leetcode_practice | e4a5ab30b60318dc087452daef7dab51727d396a | e22dc5a81e065dc962e5561b14ac84b9a2302e8a | refs/heads/master | 2021-01-19T01:17:49.194902 | 2019-01-12T13:27:56 | 2019-01-12T13:27:56 | 95,619,304 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,055 | cpp | p552_2.cpp | // Based on version 1.
// DP + enumerate A's position.
// And a little space optimization.
const int maxn = 100002;
class Solution {
public:
int f[3][2];
long long g[maxn];
const int mo = 1e9 + 7;
int checkRecord(int n) {
f[1][0] = f[1][1] = 1;
f[2][0] = f[2][1] = 2;
g[0] = 1;
g[1] =... |
0fb2225232e22769a0cd33029e76ff02e6211e77 | ce96b51f9becc72a63093edcc3bbc0188866e182 | /src/trialmanager.cpp | f985f7251c30499dfca00bb4a1797743efa5fdef | [] | no_license | magicphotos/magicphotos-bb10 | 086962883b9a49d09bb963335c3cf1ed62960083 | 8782983ee66cb0e26b71bf49a0b18d03ebf1e076 | refs/heads/master | 2020-05-19T04:31:53.524285 | 2018-05-30T20:51:48 | 2018-05-30T20:51:48 | 184,828,067 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 239 | cpp | trialmanager.cpp | #include "trialmanager.h"
TrialManager::TrialManager(QObject *parent) : QObject(parent)
{
}
TrialManager::~TrialManager()
{
}
bool TrialManager::trialMode() const
{
#ifdef TRIAL_VERSION
return true;
#else
return false;
#endif
}
|
dd1772e1756dbb70c1a3fee0f5284aa516bb21c5 | 3ca798d7c32019742bce89ba11d52c4b470ad872 | /Spoj/Maximum profit.cpp | 3b5c768cb4f9e829d3c542555228e3be3bba4e2f | [] | no_license | prakhar3agrwal/Online-Programming-Codes | 8537248d13d70ac118a475e531818e304539a979 | ed67b9ade7bbca463d9143757903191f7b0c3fba | refs/heads/master | 2023-08-06T08:03:19.175740 | 2023-08-01T09:46:52 | 2023-08-01T09:46:52 | 41,192,466 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 955 | cpp | Maximum profit.cpp | #include<stdio.h>
main()
{
unsigned long long int n,m,i,j,s,t,x,mx;
scanf("%llu",&t);
while(t--)
{
scanf("%llu%llu",&n,&m);
unsigned long long int a[n][m],b[n][m],c[n][m];
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%llu",&a[i][j]);
for(i=0;i<n;i++)
for... |
05df4b14a065c4f616a4b0ead03c0b6c1e801031 | a9e4c398451c8b0d1711d3dffb3fc19ab4a6eb8c | /C++/include/Poly3D.h | 19303dea5750bc3f62fd329a284f5a0271fde7a1 | [
"LicenseRef-scancode-us-govt-public-domain"
] | permissive | supriyantomaftuh/icarous | df0ef8c5571672f65e3baadb3b6ec1d50d919876 | b0d2262a89f5783bcad5664991d80b73be316b64 | refs/heads/master | 2017-12-07T15:16:49.563140 | 2017-03-10T04:37:26 | 2017-03-10T04:37:26 | 69,625,426 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 980 | h | Poly3D.h | /*
* Poly3D.h
*
* Copyright (c) 2011-2016 United States Government as represented by
* the National Aeronautics and Space Administration. No copyright
* is claimed in the United States under Title 17, U.S.Code. All Other
* Rights Reserved.
*/
#ifndef POLY3D_H_
#define POLY3D_H_
#include <vector>
#include "Po... |
7dd66c892d2a582fae932f62ad714e4049b40716 | bf2c42a581639c94138d6ec465f17ebfd73f3c29 | /customgauge.h | cc40375be68af44f57ce1615b44b63d42114776c | [] | no_license | wahello/CustomGauge | 5101c3c2ead58583050e10d4a6e3d5ea11d83178 | 423e2c1c9b2d7dc1d1db13a33e58b3a038d7a448 | refs/heads/master | 2023-03-20T01:01:30.121014 | 2017-05-25T15:56:25 | 2017-05-25T15:56:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,732 | h | customgauge.h | /*************************************************
* Name: customgauge.h
* Purpose: CustomGauge class definition
* Author: DJ_Kovrik (djkovrik at gmail.com)
* Created: 2013-01-23
* Source: https://github.com/djkovrik
*************************************************/
#ifndef CUSTOMGAUGE_H_... |
b3a1d9674c28962e7798b71f0036ff6b806601d9 | 1f77f63fc4bcf538fc892f6a5ba54058367ed0e5 | /src/base/foundation/EquationInitializer.hpp | 2426add04a57df558ee11960cf151dc63886bd54 | [
"Apache-2.0"
] | permissive | ChristopherRabotin/GMAT | 5f8211051b620562947443796fa85c80aed5a7cf | 829b7c2c3c7ea73d759c338e7051f92f4f2f6f43 | refs/heads/GMAT-2020a | 2022-05-21T07:01:48.435641 | 2022-05-09T17:28:07 | 2022-05-09T17:28:07 | 84,392,259 | 24 | 10 | Apache-2.0 | 2022-05-11T03:48:44 | 2017-03-09T03:09:20 | C++ | UTF-8 | C++ | false | false | 2,703 | hpp | EquationInitializer.hpp | //------------------------------------------------------------------------------
// EquationInitializer
//------------------------------------------------------------------------------
// GMAT: General Mission Analysis Tool
// CSALT: Collocation Stand Alone Library and Toolkit
//
// Copyright... |
c0d1cf66f64ce5777d5de396957d49cc3fe009b4 | 1a66a14a627ea0863a9feee8357df204b4dddb9a | /Gustavo_Bazan_pila.cpp | 4ac7204e871bb9453cffc178fa9f3f3d7e37588a | [] | no_license | gssbzn/taller_3_alg_prog_2_ordenamiento | 0076f33fc6962e98b3d5d930e5199467a40a4c80 | ed8b8245462bacf4edcabe1dd8d6749cb9b9ce8b | refs/heads/master | 2016-08-04T17:53:42.460244 | 2012-06-19T00:25:17 | 2012-06-19T00:25:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,400 | cpp | Gustavo_Bazan_pila.cpp | #ifndef __GUSTAVO_BAZAN_PILA_CPP__
#define __GUSTAVO_BAZAN_PILA_CPP__
#include "Gustavo_Bazan_lib.h"
/********************************PILAS*******************************/
//Constructor
pila :: pila () : lista(){
}
//Destructor
pila :: ~pila (void){
ptr_nodo aux;
while(!es_vacia()){
desempilar();
... |
03b1ceeb37d853533268ae522f1c63e03819d771 | 90517ce1375e290f539748716fb8ef02aa60823b | /solved/i-k/intersection-between-circle-and-rectangle/make_graph.cpp | fdd9c96e29e1472e84651827498fb0455570e7b7 | [
"Unlicense",
"LicenseRef-scancode-public-domain"
] | permissive | Code4fun4ever/pc-code | 23e4b677cffa57c758deeb655fd4f71b36807281 | 77ce51d692acf6edcb9e47aeb7b7f06bf56e4e90 | refs/heads/master | 2021-01-15T08:15:00.681534 | 2014-09-08T05:28:39 | 2014-09-08T05:28:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,180 | cpp | make_graph.cpp | #include <cstdio>
template <typename T>
struct _Point {
T x, y;
_Point(): x(0), y(0) {}
_Point(T X, T Y) : x(X), y(Y) {}
T distance(const _Point &p) const {
T dx = p.x - x, dy = p.y - y; return sqrt(dx*dx + dy*dy);
}
bool operator<(const _Point &p) const {
return x < p.x || (... |
61f1a2d6da54258a8415152dcee43b0dcc716812 | a95dafa235db297cd4bd768f193de9854c3d91cd | /game/foe.cc | 2a4409238c378807a0ed483e80da5e2519c17fe7 | [] | no_license | mpersano/not-qix | e53096f609ab5e462d32dd5b6e2a1c39a16c6760 | 3de0407a5c22e1ed6016e54ca74b88bdc0eba77c | refs/heads/master | 2020-04-06T03:40:26.109747 | 2016-02-13T15:46:55 | 2016-02-13T15:46:55 | 40,371,969 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,394 | cc | foe.cc | #include <cmath>
#include <ggl/vec2_util.h>
#include "game.h"
#include "foe.h"
foe::foe(game& g, const vec2f& pos, float radius)
: entity { g }
, pos_ { pos }
, dir_ { 1, 0 }
, speed_ { 0 }
, radius_ { radius }
{ }
void
foe::update_position()
{
// update position
pos_ += speed_*dir_;
// collide against border
... |
25a8e6e566bd08b79274629d9235fcb2e6a15d08 | 9e1dbea3884c259f472e197d12f0c35846bfca68 | /patern/dimand.cpp | efcfd912348f4669bbd8b3778914561f8741646e | [] | no_license | shrimansoft/Cpp | f1667e0664435784aa1cdd444eb100514ed9a228 | 1b6f51ca99b3228f1a61dea6b830825f3faaab32 | refs/heads/master | 2021-07-06T08:41:22.801290 | 2019-03-27T13:29:07 | 2019-03-27T13:29:07 | 143,712,326 | 0 | 3 | null | 2019-01-19T09:56:30 | 2018-08-06T10:21:27 | C++ | UTF-8 | C++ | false | false | 2,328 | cpp | dimand.cpp | /* This program is to printing paterns of different types. */
#include<iostream>
using namespace std;
//--------------*** hollow square star pattern ***----------------
void pro_1(int n){
for( int i=0;i<n*n;i++){
cout<<((i/n>n/2?n-i/n-1:i/n)*(i%n>n/2?n-i%n-1:i%n)?' ':'*');
if(i%n==(n-1))
cout<<endl;
}
}
... |
e1e7ea66c5e7c8e42c61baf505f768ece55d0de6 | 0337c1df871a431c6a8b03ad871d396826d7e210 | /src/musikcube/cursespp/Win32Util.cpp | 897179a358a51aa93316940b77e766ef370bd7ec | [
"BSD-3-Clause",
"LicenseRef-scancode-free-unknown"
] | permissive | clangen/musikcube | be1ad8c1567c9e3cfbf71e1f595ede9aa0152a97 | 64485978ea2e4483499996a8e2304ce5566573d9 | refs/heads/master | 2023-08-28T00:52:06.905519 | 2023-08-02T02:47:41 | 2023-08-02T02:47:41 | 32,483,164 | 4,049 | 370 | BSD-3-Clause | 2023-09-08T05:05:44 | 2015-03-18T20:41:57 | C++ | UTF-8 | C++ | false | false | 11,464 | cpp | Win32Util.cpp | //////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2004-2023 musikcube team
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redist... |
0caa9bbf1b431729a51c157d7bb8a5219235bd4d | 3eb87c6badf4bbf2d0bef74029afd9d2dec51a9f | /src/js/jit/C1Spewer.h | 002125e1d37d419afe07206f11a94e23b7e54b15 | [
"MPL-2.0",
"MIT"
] | permissive | zief/blazefox | 9da726fc6662976b5648ebae985ab1cd84bd9c56 | d8687161a2483f1fb27cce2f2928b67604fca4ca | refs/heads/master | 2020-04-16T06:27:57.210311 | 2019-01-12T01:31:07 | 2019-01-12T01:31:07 | 165,347,964 | 1 | 0 | MIT | 2019-01-12T04:53:25 | 2019-01-12T04:53:25 | null | UTF-8 | C++ | false | false | 1,282 | h | C1Spewer.h | /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
... |
90b92027a29bb28718b5c512772a6232851e6b63 | 4e4f15207f538847de1e1b8d9215531c7f858ec5 | /DynamicRandomVar.h | f1f406031d3ecd9f0381a7e5970aaf875d207e63 | [
"MIT"
] | permissive | aekul/aether | d896445c9b3d3e398ae62a6f4a9e8f081cb3a5b4 | 1e882f898561eaa92492de018bd2c09f71ba4c93 | refs/heads/master | 2019-07-09T01:01:43.118756 | 2018-11-05T13:43:13 | 2019-05-05T16:19:32 | 99,071,911 | 51 | 6 | MIT | 2019-05-05T16:19:34 | 2017-08-02T04:24:53 | C++ | UTF-8 | C++ | false | false | 4,986 | h | DynamicRandomVar.h | #ifndef DYNAMIC_RANDOM_VAR_H
#define DYNAMIC_RANDOM_VAR_H
#include <vector>
#include <numeric>
#include "aether/fwd/Math.h"
namespace aether {
template <typename T>
struct pdf_value_pair {
Real pdf;
T value;
};
template <typename T>
auto make_pdf_value_pair(Real pdf, T&& value) {
return pdf_value_pair<std::d... |
15840835f481cb5f490e01fc9be8dac8d40bda68 | 4d9ea3a81c9249aa41a02731488b1a109258d29d | /src/arduino-station/WindSpeedProvider.cpp | cdec9ff970fe43895b2d538437fb3c8975205bf3 | [] | no_license | kowalej/AnemIO | 552f319838c98c5c1196ac09eb27f43dc2c30258 | d0f5f6d22cd931b549bfb267c15268dda5aab02d | refs/heads/master | 2022-09-20T15:06:33.300628 | 2020-06-04T04:41:49 | 2020-06-04T04:41:49 | 198,953,824 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,956 | cpp | WindSpeedProvider.cpp | #include "WindSpeedProvider.h"
WindSpeedProvider::WindSpeedProvider() { }
bool WindSpeedProvider::setup()
{
pinMode(WIND_SPEED_SENSOR_SPEED_INPUT_PIN, INPUT);
pinMode(WIND_SPEED_SENSOR_TEMPERATURE_INPUT_PIN, INPUT);
_isOnline = true;
return _isOnline;
}
float WindSpeedProvider::getWindSpeedRaw()
{
float total =... |
cd002b0fb795bfa8b16fee54df672fd9a38a204f | 1885ce333f6980ab6aad764b3f8caf42094d9f7d | /test/e2e/test_input/ObjectArxHeaders/AcValue.h | 5e316e6535444e3f4586121eb11e9701a6cd9699 | [
"MIT"
] | permissive | satya-das/cppparser | 1dbccdeed4287c36c61edc30190c82de447e415b | f9a4cfac1a3af7286332056d7c661d86b6c35eb3 | refs/heads/master | 2023-07-06T00:55:23.382303 | 2022-10-03T19:40:05 | 2022-10-03T19:40:05 | 16,642,636 | 194 | 26 | MIT | 2023-06-26T13:44:32 | 2014-02-08T12:20:01 | C++ | UTF-8 | C++ | false | false | 12,413 | h | AcValue.h | //////////////////////////////////////////////////////////////////////////////
//
// Copyright 2018 Autodesk, Inc. All rights reserved.
//
// Use of this software is subject to the terms of the Autodesk license
// agreement provided at the time of installation or download, or which
// otherwise accompanies this ... |
a6682f72e94f0666bdc06e5373eb2fb3751a6c52 | 150936abf1a4ba3c9862631bbe45259256027d76 | /BDHSGQG - Da Lat 2019/Day 4 - Mr. Thuan/KhanhHoa/BALLOON.cpp | 6fe435229e03248eb068aca7060adcedb6e5399e | [] | no_license | btdat2506/IT.CLA.K18---CP---btdat2506 | 4a6242c637b28b6126e294f5cb1802b7ea4ea850 | 3adc76eebf81c799e5f82dfb946752cb65866a55 | refs/heads/master | 2021-07-04T21:48:13.054696 | 2020-12-01T15:18:46 | 2020-12-01T15:18:46 | 205,774,038 | 1 | 1 | null | 2019-09-05T02:13:13 | 2019-09-02T04:01:48 | C++ | UTF-8 | C++ | false | false | 1,116 | cpp | BALLOON.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 205, oo = 1e9;
int memo[4][N][N][N];
int col[200];
string s;
int calc(int c, int d, int l, int r) {
if (l == r) {
if (d == 1) return -oo;
else return d * d;
}
if (memo[c][d][l][r] != -1) return memo[c][d][l][r];
if (col[s[l]] == c) {
if (l == r - ... |
fb9b82faba080c8f0f0830a1e6712227c049ccb8 | 0c3eb56b60841be2ac30c8cdeb674b2414afb682 | /Codeforces/Nastya Is Playing Computer Games.cpp | 658f054c0e92a30781085fac682a421878bd10bf | [] | no_license | Akashkarmokar/Online-Judge-Solution | baf680adcfd1c1da0d8f07f961bf797b309f56d4 | 63fbe4a1cfdc4530e04bb3339ec722efe1a825cc | refs/heads/master | 2021-06-04T12:29:40.575281 | 2020-04-20T01:24:50 | 2020-04-20T01:24:50 | 141,269,981 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 381 | cpp | Nastya Is Playing Computer Games.cpp | /*
Problem Solved By : Akash Karmokar
Department of Computer Science and Technology
Metropolitan University,sylhet,Bangladesh.
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif
int n,k... |
63e3006cb9c4c853fdeb06ff1db24e29ce2687dd | e4d601b0750bd9dcc0e580f1f765f343855e6f7a | /kaldi-wangke/src/chainbin/nnet3-chain-acc-lda-stats.cc | b195f5ba1fbd5c8b93b187dff196f339dd7d00a0 | [
"Apache-2.0",
"LicenseRef-scancode-public-domain",
"MIT"
] | permissive | PeiwenWu/Adaptation-Interspeech18 | 01b426cd6d6a2d7a896aacaf4ad01eb3251151f7 | 576206abf8d1305e4a86891868ad97ddfb2bbf84 | refs/heads/master | 2021-03-03T04:16:43.146100 | 2019-11-25T05:44:27 | 2019-11-25T05:44:27 | 245,930,967 | 1 | 0 | MIT | 2020-03-09T02:57:58 | 2020-03-09T02:57:57 | null | UTF-8 | C++ | false | false | 7,297 | cc | nnet3-chain-acc-lda-stats.cc | // nnet3bin/nnet3-chain-acc-lda-stats.cc
// Copyright 2015 Johns Hopkins University (author: Daniel Povey)
// See ../../COPYING for clarification regarding multiple authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You... |
d070958c712dbae32f4161f61ca02b3c42f50412 | e026b9a2c8fca6d20c8e7412df686f02b2445465 | /utilities.cpp | 67073ed3b10cf1381fb6334cde06db66dc74e400 | [] | no_license | williamshiwenhao/jpeg_coder | 2016b042760351f971c7442866d13c274842e96c | 137327bffbd6ed7af1c2cbfe2eabcd2ab7510e96 | refs/heads/master | 2020-05-27T08:00:22.447583 | 2019-06-19T01:21:25 | 2019-06-19T01:21:25 | 188,538,485 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,506 | cpp | utilities.cpp | #include "utilities.h"
Img<Yuv> ImgRgb2YCbCr(const Img<Rgb> imgrgb) {
Img<Yuv> imgy;
imgy.w = imgrgb.w;
imgy.h = imgrgb.h;
imgy.data = new Yuv[imgy.w * imgy.h];
for (int i = 0; i < imgy.w * imgy.h; ++i) {
imgy.data[i] = Rgb2YCbCr(imgrgb.data[i]);
}
return imgy;
}
Img<Rgb> ImgYCbCr2Rgb(const Img<Yuv> imgy) {
... |
9f1686ebc5c1d9058a20a7946d02d56fd689e761 | f3105aa4b43a618f59e662c6907082dd782ea024 | /acmicpc.net/1107_리모컨.cpp | 9a5d09848736bd00637247b5bc82857ee419c293 | [] | no_license | inchoel/DailyCoding | b23b2524d7d5a45ea42c036727661bd759875e39 | 9d1291586ab8afea9866237002c3c64aedf8e855 | refs/heads/master | 2021-06-01T16:19:08.999296 | 2020-08-24T08:22:00 | 2020-08-24T08:22:13 | 109,554,116 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,229 | cpp | 1107_리모컨.cpp | #include <cstdio>
#include <cstring>
#include <bitset>
using namespace std;
// 100->500000 으로 증가하여 도달하거나, 999900 -> 500000 감소하여 도달하는 경우가 있다.
// 그러므로 MAX의 범위는 약 2배로 설정하여, 완전탐색을 하면 된다.
#define MAX (500000*2)
int main() {
int channel;
scanf (" %d", &channel);
bitset<10> remote;
remote.set();
int broken, num;
... |
ec3316218f102f6f23871e51d9dcfc73ba47a175 | 4dcc7fb1758e91fac49cddbb0e15f354e0a9355e | /LeetCode/cpp/3.longest-substring-without-repeating-characters.cpp | ef77fcfb388abc60b1a7b1e8d2ba48b20ce0896e | [] | no_license | Galibier/AlgoPractise | ac0d6c1b201f637e11bf683fa6197417f52aaf46 | e6138de6276e6b999da1ec44ec18effb13801a71 | refs/heads/master | 2021-07-18T16:11:12.665258 | 2021-05-18T17:53:57 | 2021-05-18T17:53:57 | 249,162,340 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 427 | cpp | 3.longest-substring-without-repeating-characters.cpp | /*
* @lc app=leetcode id=3 lang=cpp
*
* [3] Longest Substring Without Repeating Characters
*/
class Solution {
public:
int lengthOfLongestSubstring(string s) {
vector<int> dp(256, -1);
int maxLen = 0, start = -1;
for (int i = 0; i != s.length(); i++) {
if (dp[s[i]] > start) start = d... |
0caaaf46245f36b55457f2f4189a59a84c4bd699 | 54b9ee00bcd582d56853ddb90be5cfeb0c29ba29 | /src/utils/tera_zk_adapter.cc | 9c960eee387b7cf38bca2a73d449d3d9af00233c | [
"BSD-3-Clause"
] | permissive | pengdu/bubblefs | 8f4deb8668831496bb0cd8b7d9895900b1442ff1 | 9b27e191a287b3a1d012adfd3bab6a30629a5f33 | refs/heads/master | 2020-04-04T19:32:11.311925 | 2018-05-02T11:20:18 | 2018-05-02T11:20:18 | 156,210,664 | 2 | 0 | null | 2018-11-05T11:57:22 | 2018-11-05T11:57:21 | null | UTF-8 | C++ | false | false | 40,162 | cc | tera_zk_adapter.cc | // Copyright (c) 2015, Baidu.com, Inc. All Rights Reserved
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// Author: likang01(com@baidu.com)
// tera/src/zk/zk_adapter.cc
#include "utils/tera_zk_adapter.h"
#include <errno.h>
#include <functional>
#include "pl... |
b7fe308e4ba1e496d4c17c7020a30be72bcb55cd | 0ffe7f555733c8a8ba997518c36771e92c4caa3a | /C++/upload_file.cpp | 7c1d0e836cdcb46f493a287796897296b2d18790 | [] | no_license | 9176324/authentication-samples | 67b94bf676bc942d2e88910747a16dd1043e2ad3 | bcfdf621bbf716b7a0ce8b561d374c7b6ebc0443 | refs/heads/master | 2020-07-04T03:32:41.705599 | 2016-03-28T12:20:13 | 2016-03-28T12:20:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,223 | cpp | upload_file.cpp | #include "cpprest/http_client.h"
#include <iterator>
#include <fstream>
#include <iostream>
#include <string>
#include "stdlib.h"
using std::cerr;
using std::copy;
using std::endl;
using std::ifstream;
using std::ios;
using std::istreambuf_iterator;
using std::string;
using std::vector;
using utility::s... |
54e256386020c4244f9bf886b055a3e721835185 | 4520caea6e0871433a20612103ca61de04d76bd8 | /src/simplifier.cpp | bf6ff487d1fecd5a355aa3c8de5086661cd1bbce | [
"BSL-1.0",
"MIT"
] | permissive | JervenBolleman/vg | 094e5c7181b4f3beea7abcd440843ed3f2b78e28 | 054473dfb31b75e67e0ab544e1b7c02b5571acca | refs/heads/master | 2020-04-05T22:50:12.773343 | 2017-09-15T00:54:56 | 2017-09-15T00:54:56 | 42,646,990 | 2 | 0 | null | 2015-09-17T09:19:54 | 2015-09-17T09:19:54 | null | UTF-8 | C++ | false | false | 34,393 | cpp | simplifier.cpp | #include "simplifier.hpp"
namespace vg {
using namespace std;
Simplifier::Simplifier(VG& graph) : Progressive(), graph(graph), traversal_finder(graph) {
// create a SnarlManager using Cactus
CactusUltrabubbleFinder site_finder(graph, "", true);
site_manager = site_finder.find_snarls();
}
pair<size_... |
21a294a049c57560c6334891877da394f644b72a | 4a41e5b7e93d39386055ce8648e6c3354f97c61e | /cppDemo/boostDemo/logs/file/log.cpp | 6d89e306175f57068180d6dd9da53d117ead689f | [] | no_license | lianaipeng/demos | 52c78eed35f7921b2c425dc6c8443478d80a3061 | 6692aa6537ab56f56e5b6e374d16654dc17091c1 | refs/heads/master | 2021-01-17T12:00:12.192250 | 2017-07-19T09:12:37 | 2017-07-19T09:12:37 | 47,742,913 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 732 | cpp | log.cpp | #include "log.h"
void log_init(const std::string& prefix, const log_level& level){
logging::add_file_log(
keywords::file_name = prefix+"_%Y-%m-%d.log",
keywords::open_mode = (std::ios::out | std::ios::app),
keywords::rotation_size = 10 * 1024 * 1024, ... |
424b0dc06a8fb6512fe1ce8d23121dde8d084eb1 | 72a8340645e585ba2d49875723e2cc493399fe8e | /HW2/tests/client_test.cpp | 61583ffa986376c34b8f956adb8fa5395537ef9e | [] | no_license | jamesrcounts/CS537 | ee0bffdf5706e9c78a494fde0ef483e6b8cf7331 | 207e6b9a8795a442ad83508dd131a3868378e04d | refs/heads/master | 2020-04-06T04:31:12.927032 | 2013-05-08T20:11:48 | 2013-05-08T20:11:48 | 7,839,056 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,700 | cpp | client_test.cpp | /*test.cpp*/
#include <arpa/inet.h>
#include <igloo/igloo.h>
#include <netdb.h>
#include <signal.h>
#include <stdio.h>
#include <sys/socket.h>
#include <unistd.h>
#include "../TcpSocket.h"
#include "../TcpListeningSocket.h"
using namespace igloo;
void *caseServer( void *state );
void *pong( void *state );
Context( ... |
59cb638c6598b07e21ed194e8ee4e6f7f2036238 | 0bb8e42162e6cbb77abcf59d3721e74bcfc3df2b | /code/day04/src/BlinnPhongRenderer.h | bdb9a874b7fd4109fe765ed517024c1a23ad7f82 | [] | no_license | kato-toranosuke/advanced-cg-2021 | 744b20d86a82317a2bbe9adbc9c34de3dff10efa | f41fd1b35c4fc09dcfc12d613af892e60e47a6eb | refs/heads/master | 2023-05-08T14:20:26.312892 | 2021-06-05T21:14:57 | 2021-06-05T21:14:57 | 357,054,724 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 432 | h | BlinnPhongRenderer.h | #pragma once
#include "AbstractRenderer.h"
class BlinnPhongRenderer : public AbstractRenderer
{
public:
static void Init();
static AbstractRenderer* Create() { return new BlinnPhongRenderer(); }
static void ImGui();
void render(const PolygonMesh& mesh) const;
private:
static GLSLProgramObject* s_... |
fc6b4edce15a131f8cae00f054381ad6de7e1391 | 3f984937a1c186990a3e2174fa3facf9730e66fe | /Unsorted/Matrix/Functions_Basic.ino | 26d082c3d1a4154fa1806d5cccdb1990b299df15 | [] | no_license | LatvianModder/ProjArduino | 3fb52a446660269a52c02464280c3782ae8295a8 | a3cbbc2d78d57eeecc3bbc19fe43422b83e08c3e | refs/heads/master | 2021-01-20T01:53:38.564991 | 2015-11-27T10:50:12 | 2015-11-27T10:50:12 | 31,860,596 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 219 | ino | Functions_Basic.ino | void write(int data)
{
Serial.print(data, BYTE);
}
boolean read(int data)
{
if(Serial.read() == data) { return true; }
else { return false; }
}
void digiW(int data1, int data2)
{
digitalWrite(data1, data2);
}
|
82efc046b00e40e6717b06f91066ff37806b8b51 | 56a3df7f18d06005b6185152bd7941add18edfa9 | /bcos-sdk/tests/unittests/amop/TopicManagerTest.cpp | 339a0af660ddbdaa6640484fdcb40ee26756ccc6 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | FISCO-BCOS/FISCO-BCOS | bac8b40f12315e043f006fac8152af93662f3444 | 3014f5be43fe93ddb455d277d30837ab5ba8c14f | refs/heads/master | 2023-08-31T20:28:49.049631 | 2023-08-14T09:01:07 | 2023-08-14T09:01:07 | 113,932,055 | 2,413 | 829 | Apache-2.0 | 2023-09-14T12:01:28 | 2017-12-12T02:17:31 | Shell | UTF-8 | C++ | false | false | 4,880 | cpp | TopicManagerTest.cpp | /**
* Copyright (C) 2021 FISCO BCOS.
* SPDX-License-Identifier: Apache-2.0
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Un... |
6d74ac2e5dfb201657b8949cd62fe780e26bdf05 | ee6944de205f6ac8ef8b2873d99edf30cabea477 | /cplusplus/chap6/14_array_params_constant_params.cpp | 76ea400fe58fd6d9b8921458dd2233a2f7c9282e | [] | no_license | stareque-atlassian/cplusplus-learn | 6bfbda2ec0b6ddcf1f47c89fe361a5ea24408951 | cb81573f23d52f1c532c7fb19c605ffb76208685 | refs/heads/main | 2023-07-14T09:26:11.180328 | 2021-08-18T05:46:04 | 2021-08-18T05:46:04 | 397,440,415 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,848 | cpp | 14_array_params_constant_params.cpp | //
// main.cpp
// cplusplus
//
// Created by Shehab Tareque on 17/8/21.
//
#include <iostream>
void fillArray(int list[], int listSize)
{
int index;
cout<<"Enter "<<listSize<<" integers"<<endl;
for (index = 0; index < listSize; index++)
cin >> list[index];
}
void printArray(int list[], int list... |
1b7b0e55904f4c4ece736fa4ef6fb9d6b091983d | acdde1143c79084f33bd00e0b1c49f7364540662 | /src/import/chips/p9/procedures/hwp/memory/lib/freq/sync.H | 4f86248901fa9722109720547e3224fcd596df3a | [
"Apache-2.0"
] | permissive | dongshijiang/hostboot | 1329be9424dbd23325064cb89f659d7e636fb1ff | f1746c417531b1264be23a8dcf1284ae204f6153 | refs/heads/master | 2023-06-15T16:05:09.961450 | 2021-06-29T21:04:03 | 2021-07-06T20:33:51 | 385,787,842 | 0 | 0 | NOASSERTION | 2021-07-14T02:13:08 | 2021-07-14T02:13:08 | null | UTF-8 | C++ | false | false | 6,433 | h | sync.H | /* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/import/chips/p9/procedures/hwp/memory/lib/freq/sync.H $ */
/* ... |
a653693670461162ce96f522a0d2615d90df8a15 | 0154f04e7f2a20dc85fb933c9e0b518186f01ef4 | /include/common/path_reader.h | 6cfdad111c91fd35fe537c26cc7715b256ec326b | [] | no_license | julian1/shell | c6ca07da5f73ee3ddedecf682536c18f0cc6df82 | 57745384c2f7f50ef0e124949bac28cc193123e1 | refs/heads/master | 2020-04-28T02:37:49.343022 | 2014-04-17T13:05:31 | 2014-04-17T13:05:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,235 | h | path_reader.h |
#pragma once
/*
this class is used, because agg_path_storage includes and iterator. therefore even if we have a basically
const operation (just iterating the vertices using), it means we cannot pass agg_path_storage with const .
therefore use, this class as an adaptor to a const path_storage
it also makes the... |
854c8817dfd063429a5cf54bbb720181ba73d72b | cc63612e896bb05a8d5345c3525d4aa6d0e75265 | /Pow(x, n).cpp | d52fa04cac1411175df56a777254ec71dfe85269 | [] | no_license | avotaliff/tg_mpei_course | 5ed5f7c99037d19c8afd789e5f4956e2c74d98a8 | 4eedc6bcce0641f0062ffa23383e2974ed76b3c0 | refs/heads/master | 2020-07-19T09:35:58.094975 | 2020-01-11T11:43:31 | 2020-01-11T11:43:31 | 206,421,161 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 281 | cpp | Pow(x, n).cpp | //https://leetcode.com/problems/powx-n/
class Solution {
public:
double myPow(double x, long long n) {
if (n<0) return 1/myPow(x,-n);
if (n==0) return 1;
if (n % 2 ==1) return x* myPow(x,n-1);
double u=myPow(x,n/2);
return u*u;
}
};
|
fa04a440bfb258d23ea7dc312179cd6f3c594629 | 66e293057b7e0cd54b2b45f49174e3cdd5433a59 | /src/biser/src/main.cpp | bae1097e126508f3f5bdf9c6f60f1fa329824290 | [] | no_license | nick9bkru/UI | c068dd0598e297235e0d4dbec36988b123736c3c | b5fce7951d91d990eb95162d95a0f589056780b1 | refs/heads/master | 2016-09-15T22:22:59.757179 | 2015-10-20T07:33:27 | 2015-10-20T07:33:27 | 39,785,658 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,423 | cpp | main.cpp |
#include <memory>
#include <signal.h>
#include <functional>
#include "LogSingleton.h"
#include "util.h"
#include "nsdManage.h"
#include "TCPClientManage.h"
#include "TCPServerManage.h"
#include "Database.h"
#include "BDReadConf.h"
using namespace std;
///< Экземпляр класса для журналирования.
SKLib::Log *Log;
... |
c39dc4190bcc0a69cd00adbea17b2f799039a457 | bc93833a9a2606dd051738dd06d6d17c18cbdcae | /3rdparty/libSGM/src/stereo_sgm.cpp | c6e6b75e9b773b7d9c2278ef12022c9bb803646a | [
"MIT",
"Apache-2.0"
] | permissive | Wizapply/OvrvisionPro | f0552626f22d6fe96824034310a4f08ab874b62e | 41680a1f9cfd617a9d33f1df9d9a91e8ffd4dc4b | refs/heads/master | 2021-11-11T02:37:23.840617 | 2021-05-06T03:00:48 | 2021-05-06T03:00:48 | 43,277,465 | 30 | 32 | NOASSERTION | 2019-12-25T14:07:27 | 2015-09-28T03:17:23 | C | UTF-8 | C++ | false | false | 8,314 | cpp | stereo_sgm.cpp | /*
Copyright 2016 fixstars
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http ://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distribut... |
def8ef5eae663d2c015a5c360a66dcc5dfccb83e | dbf490d69ed3318e4eaade31cf6bd47f9b38b666 | /week-01/day-03/favnumb/main.cpp | c9473cd39fb0ee9891845863c5cd56bdee0e3387 | [] | no_license | green-fox-academy/Boritse | 138d30c80afc65988f29bd47fbdbc3f816598113 | 95458e3a71bddb865865f4a8ced52ec2da7bb36b | refs/heads/master | 2020-04-16T18:52:02.747715 | 2019-04-09T06:11:38 | 2019-04-09T06:11:38 | 165,837,942 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 168 | cpp | main.cpp | #include <iostream>
int main(int argc, char* args[]) {
int favnumb=7;
std::cout << "My favourite number is: " << favnumb << "." << std::endl;
return 0;
} |
d3d5245d9f07da6b67533958936e9e5728eadf0a | 060850028c6e112f3abfb76a1d0238ef86b2f188 | /examples/c++/publication_recon_dataset.cpp | bd77ad46a52e62a13aa5f03a9600cc0058380334 | [
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-warranty-disclaimer",
"LicenseRef-scancode-public-domain"
] | permissive | welcheb/ISMRMrd_old | 911cdea59e8c9a4f3225e9c0d28b66f87e07bbc5 | b6dedcaf7fad6be0787391b290cb6a41766f28c4 | refs/heads/master | 2020-05-20T05:59:55.080741 | 2014-02-04T10:06:53 | 2014-02-04T10:06:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,524 | cpp | publication_recon_dataset.cpp | /*
* test_recon_dataset.cpp
*
* Created on: Sep 6, 2012
* Author: Michael S. Hansen (michael.hansen@nih.gov)
*
*/
#include <iostream>
#include "ismrmrd.h"
#include "ismrmrd.hxx"
#include "ismrmrd_hdf5.h"
#include "fftw3.h"
//Helper function for the FFTW library
template<typename TI, typename TO> void circ... |
12ebb3d1b7d3580532be8e5b090b61958284fcee | cf617bbeaab3328813a61b3e103d6d6e2b9d3d67 | /node/src/node/node.cpp | 63a39e8a5262861ad261d053d8e589680749f96e | [
"MIT"
] | permissive | OAkyildiz/src_capstone | a77b1b6a0f01b45a970f0a5d49bab609adff9e8a | 4253962d7c01985c15f440cd4eab37d5c45f7af6 | refs/heads/master | 2020-12-26T02:22:06.281172 | 2016-12-16T04:45:11 | 2016-12-16T04:45:11 | 68,628,342 | 0 | 0 | null | 2016-12-02T22:15:34 | 2016-09-19T17:16:30 | C++ | UTF-8 | C++ | false | false | 1,553 | cpp | node.cpp | /*
* node.cpp
*
* Created on: Oct 24, 2016
* Author: oakyildiz, Ozan Akyıldız
* Email: oakyildiz@wpi.edu
*
*/
#include "node/node.h"
double RATE = 60;
Node::Node(int argc, char** argv):
nh_(0),
pnh_(0),
init_argc(argc),
init_argv(argv)
{}
Node::~Node() {
if(ros::isStarted()) {
r... |
b3ee6a8c1d3ea08d2ee05289485ae533ca3f7b20 | 1b3688fb1fced72b358429c30be0afdee79fe27b | /data/molecular_dynamics/experimental_salts/PPY.TF2.298.comremoved.Cp | f1ca2142d2c697a571a0fe266cb5d69ca371d3fa | [
"MIT"
] | permissive | wesleybeckner/adaptive_learning_salts | 25661b292fcebfe0395ce2d0a0761552519015ca | 51cc1cf74cef14d45592e5e2894c0b89304a3e8c | refs/heads/master | 2020-04-07T01:09:20.803206 | 2019-03-27T13:09:43 | 2019-03-27T13:09:43 | 157,932,653 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 40 | cp | PPY.TF2.298.comremoved.Cp | 559.134
572.214
550.939
557.914
553.233
|
b080c2109e5db0c0255f2bec410d8942d5aa9e56 | 7dadbd48949e6a1f216fa90e2d7ff8f7426bab90 | /src/cuda/api/multi_wrapper_impls/stream.hpp | ed2cc65aa21b8c88fd8b8419f3d303afad120400 | [
"BSD-3-Clause"
] | permissive | eyalroz/cuda-api-wrappers | b87b968acc032338d102e334a51cbdd5a2ae159d | 1833895b6a6ce905b6d3ac38226de6e0a030f09e | refs/heads/master | 2023-09-04T01:23:10.874145 | 2023-07-08T09:55:38 | 2023-07-08T10:48:12 | 73,505,627 | 656 | 90 | BSD-3-Clause | 2023-03-24T21:32:14 | 2016-11-11T19:31:08 | C++ | UTF-8 | C++ | false | false | 5,272 | hpp | stream.hpp | /**
* @file
*
* @brief Implementations requiring the definitions of multiple CUDA entity proxy classes,
* and which regard streams. Specifically:
*
* 1. Functions in the `cuda::stream` namespace.
* 2. Methods of @ref `cuda::stream_t` and possibly some relates classes.
*/
#pragma once
#ifndef MULTI_WRAPPER_IMPLS... |
da4070097641004d5d0b96e859e5af6838691a34 | d2a9836887261aaf3de0a4bd03ee0b3fadeefbd1 | /main.cpp | 2c180d1e5fb19f675c7bb72f6bc8e7286ccd1738 | [] | no_license | shadykdc/Enigma_Machine | f46cbc90c0808a1c2a091896c735e5ac2abe8e33 | d188003562aae38499b1365ec6a3c1d483f289f1 | refs/heads/master | 2021-01-20T20:09:06.043709 | 2016-06-23T14:10:09 | 2016-06-23T14:10:09 | 61,751,585 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,484 | cpp | main.cpp | // Integrated Programming Laboratory
// Exercise 2, The Enigma Machine
// Kathryn Shea, November 23, 2015
#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>
#include "classes.h"
#include "errors.h"
#include "helpers.h"
#include "checks.h"
using namespace std;
int main(int argc, char **argv)
... |
9259a90f76257407955158816f72bb20f22db711 | 5db5ddf10fb0b71f1fd19cb93f874f7e539e33eb | /Tech/src/foundation/stream/poutputstream.cpp | f8e0b105c3921aa630ce2bb73236abf0edb28ced | [] | no_license | softwarekid/FutureInterface | 13b290435c552a3feca0f97ecd930aa05fa2fb25 | 55583a58297a5e265953c36c72f41ccb8bac3015 | refs/heads/master | 2020-04-08T04:42:21.041081 | 2014-07-25T01:14:34 | 2014-07-25T01:14:34 | 22,280,531 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,558 | cpp | poutputstream.cpp | // poutputstream.cpp
// Write to file/memory/other.
//
// Copyright 2012 - 2014 Future Interface.
// This software is licensed under the terms of the MIT license.
//
// Hongwei Li lihw81@gmail.com
//
//
#include "poutputstream.h"
#include <PFoundation/pnew.h>
#include <PFoundation/plog.h>
#include <PFoundation/p... |
218ba608464db0bb07197b8f7420723ca1286ef7 | 5dd63addadcec9ffadaa0c5b8f6aad2eb12c6d9e | /server/session.h | 6bc8cc77d257a2e0a54a1861b45ecaa20adec424 | [] | no_license | AlexisVaBel/otus-cpp-hw_13 | 1c73e26789f509390dc1f33d411367d204639f48 | 985607d388d71c5db758520fe76c6adedbc658b2 | refs/heads/master | 2020-07-29T08:26:09.352848 | 2019-09-26T06:24:35 | 2019-09-26T06:24:35 | 209,729,978 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,099 | h | session.h | #ifndef SESSION_H
#define SESSION_H
#include <iostream>
#include <set>
#include <boost/bind.hpp>
#include <boost/asio.hpp>
#include "../threader/threadpool.h"
#include "../db_struct/basicdb.h"
#include "../cmds/dbprocessor.h"
using boost::asio::ip::tcp;
class Session: public std::enable_shared_from_this<Sessi... |
261fa884e6ec238329e4ac61ad97f63cdb8aa8bd | 7f53982a8b84a05d63e3e3b2f57c379da02d762a | /jsc/JavaScriptCore_cc153d71/unified-sources/UnifiedSource7.cpp | 7eecf2eb3dc731f727c525f7eecc192ba9e5a885 | [] | no_license | ufwt/browser-exploitation | 4f9a6a1efe6bf654b4bf78e43fe2bccaa60d7974 | 768e4751a42a2cb27238542bc5bfbae140a848cf | refs/heads/master | 2023-07-07T23:49:10.319022 | 2021-08-08T13:46:34 | 2021-08-08T13:46:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 280 | cpp | UnifiedSource7.cpp | #include "assembler/MacroAssemblerMIPS.cpp"
#include "assembler/MacroAssemblerPrinter.cpp"
#include "assembler/MacroAssemblerX86Common.cpp"
#include "assembler/PerfLog.cpp"
#include "assembler/Printer.cpp"
#include "assembler/ProbeContext.cpp"
#include "assembler/ProbeStack.cpp"
|
e253e6ed834fe32c54b4f1432162de92c9ff15b0 | 6a3ad56a2c029ec12fad89fab21bacb64df01289 | /SHOOTER.CPP | a3607a043f7520a2ec0b6287ea20ad6bf61e3429 | [] | no_license | yashdhing/C-Projects-Before-standardization- | eb28a630c2d6f10cf84c128b53421c5ed833e381 | 5dac0292c3875f1e6aa45d4a2d1886b02de079ad | refs/heads/master | 2020-04-14T03:26:13.358124 | 2018-12-30T18:18:08 | 2018-12-30T18:18:08 | 163,607,820 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,626 | cpp | SHOOTER.CPP | #include<iostream.h>
#include<graphics.h>
#include<conio.h>
#include<dos.h>
#include<stdlib.h>
void main() //Yash's upgraded version
{randomize();
int gdriver=DETECT,gmode;
initgraph(&gdriver,&gmode,"D:\\bgi");
int k=5,t=5,i=0,Ly,midx=200,score=0,midy=0,Px=15,Py=244,rad=10;
setbkcolo... |
00c6bebbe9f412d4930967d37b9c9f2eb0fadc52 | d34f07b5399ec91bf0998a94c55e69f3da45f5ae | /stree/builder.hpp | b0a16dcfab3ef01df5012b98954b436e3978fd05 | [] | no_license | mngr777/stree | ad093e7df922b752912fdf6221a038d6604b9902 | 49f372dffaf60f714eabfdaf844931e92bbcd98e | refs/heads/master | 2022-04-27T05:30:31.669423 | 2022-03-13T21:55:38 | 2022-03-13T21:55:38 | 91,375,024 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 858 | hpp | builder.hpp | #ifndef STREE_BUILDER_HPP_
#define STREE_BUILDER_HPP_
#include <stack>
#include <stree/environment.hpp>
#include <stree/tree.hpp>
namespace stree {
class Builder {
public:
Builder(Environment& env);
void set(const std::string& name);
void set(const SymbolPtr& symbol);
void set(const Value& value);
... |
017a978169b39aabd1297fc9ffc530baf952c322 | 4613c0fd08530adf61cbae5e425b9f9e1d302588 | /test/geometry/testaabb.cpp | 31fe620e7704d620a6bb407d33412e7b18588cff | [] | no_license | xchrdw/voxellancer | b0e39a883cc7d9a6607985e72267c205aae23b20 | 9d468a79c0c96a12170061958a4f06a8f8a9b197 | refs/heads/master | 2021-04-29T17:55:47.628442 | 2014-08-24T21:14:02 | 2014-08-24T21:14:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,016 | cpp | testaabb.cpp | #include <bandit/bandit.h>
#include <iostream>
#include "geometry/aabb.h"
#include "../bandit_extension/vec3helper.h"
#include "property/propertymanager.h"
using namespace bandit;
go_bandit([](){
describe("AABB", [](){
PropertyManager::instance()->reset();
PropertyManager::instance()->load("da... |
dd59109857ed547290b4e04670852758692a0395 | 27408150237ea8838f2ca442fcf987cf8287d224 | /src/exp_smoothing.cpp | e3aa769730a4dbb4d36c1d3ba5291879e695f19f | [] | no_license | dcmde/filters | 8f5fca0e5db73bfc7149639a5b7122acbea6519b | 037114e55f7ec00ada52489c8e5b1cfddf1ce9d2 | refs/heads/main | 2023-04-16T03:35:19.565367 | 2021-04-12T13:11:49 | 2021-04-12T13:11:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 857 | cpp | exp_smoothing.cpp | #include <iostream>
#include <fstream>
#include "ExpSmoothing.hpp"
int main(int argc, char *argv[]) {
double alpha, x0, temp;
std::string line;
if (argc != 4) {
std::cout << "Enter : file_name alpha init_value" << std::endl;
return 0;
}
alpha = std::stod(argv[2]);
x0 = std::st... |
9422071bf7f0ba62b4bbefa8ab16b923a65b066e | 0f0ef090f5e9c15745f9550a084f270d796a4e82 | /postmidsem/hashing/udbhavhashing/hashwithoutclass.cpp | c55e0f0a93e178e3641fd05fd0b01ebc19292450 | [] | no_license | udbhav-chugh/CS210-DataStructuresLab | ea97f58f3ff2959d515de59e909197711108b081 | fa7d68040c78b6cafe5a33e5424da086d757ff3c | refs/heads/master | 2020-04-17T14:54:29.566133 | 2019-05-27T23:02:06 | 2019-05-27T23:02:06 | 166,677,003 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,603 | cpp | hashwithoutclass.cpp | #include<bits/stdc++.h>
using namespace std;
int hashfunc(int val,int n)
{
return val%n;
}
struct node
{
int data;
node* next;
node(int d)
{
data=d;
next=NULL;
}
};
struct hashtab
{
int bucketsize;
node* *arr;
hashtab(int size);
void insert(int val);
int search(int val);
int del(int val);
void p... |
9096825572e39ac52fd9d927c97539cde13d635c | 55eaef34ac69f69625bfcf86359de2cc056d4a71 | /Source for linux/pawn.h | 40d0f1865e6a38c52db688f77d04c44041e23b29 | [] | no_license | prototype2904/StetskevichChulanov2381 | bdd057d8827934fe99adfbe5e6a83625b1282cbf | 5cae416398aeed72f1e2bb1c15e5152e4162f772 | refs/heads/master | 2021-01-23T13:18:11.068654 | 2015-05-25T16:44:09 | 2015-05-25T16:44:09 | 30,931,336 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 596 | h | pawn.h | #ifndef PAWN_H
#define PAWN_H
#include "square.h"
//class of pawn.
class Pawn : public Figure
{
private:
Square* nextMove;//next Move directly
bool firstMove; //is it first move?
void setNextMove();
void evolution();
void specialAttackFunction(Square *newSquare);
public:
Pawn();
vector<Squ... |
516af6a263abfb7e3b75087e27431fff17551a6d | 20ce5cf0fca6a7e0db7827cf112cbe4d7d8cf704 | /arrayList.cpp | d042bf3cbbb7156ac50827023b34997e0514ec17 | [] | no_license | aamirk2244/code-CPP | e7751459bd1afdf3c75c39de736e8da405394cb6 | c0e45123818d2360b66d9b0181e179c5a0c56a91 | refs/heads/master | 2023-04-10T08:58:32.086152 | 2023-03-28T14:05:36 | 2023-03-28T14:05:36 | 242,528,530 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,501 | cpp | arrayList.cpp | #include<iostream>
#define size 10
using namespace std;
class List{
int *list; // will get the list array
int *t; // temporary pointer we will use this later.
int length; // will count the total length
p... |
cd64abb7fc28b51b8a0c6579766fc095bac3c59b | d9c77e90be679cf9846fa76950e893e33ad9a414 | /player/sources/pixlButton/PixelButton.cpp | 697b3df1846100529c53673fd0c49f8a4b0e2cba | [] | no_license | jackdevelop/JEngin | 607d690505f120cfd7a718a25c64e746861abee1 | 2e08d32cd654cf0570d7f81f1e551b0c625985e9 | refs/heads/master | 2016-09-06T11:44:14.775480 | 2014-01-18T07:24:58 | 2014-01-18T07:24:58 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 3,588 | cpp | PixelButton.cpp | #include "PixelButton.h"
//#include "CCScale9Sprite.h"
using namespace std;
using namespace cocos2d;
USING_NS_CC_EXT;
bool PixelButton::init()
{
if(CCControlButton::init())
{
m_src = "";
setTouchEnabled(true);
setAnchorPoint(CCPointZero);
return true;
}
return false;
}
PixelButton* PixelButton::create(st... |
095cf8256896db1f264167f6f1e25a26a0355199 | d4a813ce8157670e08f0b17a2a8b5af75d6cc4d2 | /R-package/src/gbtorch.cpp | 8bd99dd2430dc1e506d5c093dd78c2832919d441 | [
"MIT"
] | permissive | yafee123/gbtorch | a3de45fb68edffec43cdee00386fff4607c8b7c2 | 7e53a1c8d4159a83930863eb994531a8dcdad079 | refs/heads/master | 2020-08-01T21:24:59.105467 | 2019-09-24T18:20:03 | 2019-09-24T18:20:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,061 | cpp | gbtorch.cpp |
/*
* gbtorch: Adaptive and automatic gradient boosting computations.
* Berent Lunde
* 07.09.2019
*/
#include "gbtorch.hpp"
//' @export ENSEMBLE
class ENSEMBLE
{
public:
double initialPred;
double learning_rate;
double initial_score;
GBTREE* first_tree;
Rcpp::List param;
// construc... |
eb61ad0cb22350b23e29923124c6e046e2d905b0 | 2b5b1354b01cd71cc77837d5a54e86b08e536487 | /course 1/lab5/I/I/main.cpp | ccf199d6117c8362975cfd968f8cb4c29659c70f | [] | no_license | vi34/Discrete-Math-Labs | 98b0ca266069bf0bb33a43d22ec16c1693aa5673 | 1250cdb8ae55feb9e6a86900eafd9863b1cc62e4 | refs/heads/master | 2021-01-21T04:59:46.010712 | 2016-06-04T07:23:07 | 2016-06-04T07:23:07 | 36,805,817 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,326 | cpp | main.cpp | #include <string>
#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define NAME "salesman"
#define mp make_pair
#define pb push_back
#define rep0(i, n) for(int i = 0; i < n; i++)
using namespace std;
long long INF = 10000000000;
vector< vector<pair<int, int> > > g;
vecto... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.