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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
d4634301240650c806d2706aecefe02a31c77904 | 35d4d90e4577dbb02b701a499add117462e06d76 | /Problem09_SpecialPythagoreanTriplet.cpp | 641f6f1670ebd37f14be6c7fffb5a68e2cc16db0 | [] | no_license | edutamura/projecteuler | a6aebb5a665ae8736aabdd0f2e92e7a315c6ba70 | c5692333f26cca8ee1c9677b33f120cc8882f769 | refs/heads/master | 2020-06-23T12:30:37.385180 | 2019-08-20T13:39:05 | 2019-08-20T13:39:05 | 198,625,070 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,331 | cpp | Problem09_SpecialPythagoreanTriplet.cpp | // Problem09_SpecialPythagoreanTriplet.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include "pch.h"
#include <iostream>
#include <math.h>
using namespace std;
bool verificaTriplet2(int num1, int num2, int num3) {
cout << "chamou a funcao -- quadrados: " << e... |
d1998b0f02be433fb507b21fa3f174a81d6cc225 | 3c25475e4bd5a634d7980e291ae02ae62ab6e74a | /Source/Urho3D/Plugins/Plugin.h | 4e351a92a08180d0b71579de27aa1d81987a96ea | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | eugeneko/rbfx | e1c8b41861093b5df03f616cd614f4a73795b16b | 379641ebfeb63a2ceba901eb06be4309d3973272 | refs/heads/master | 2023-03-19T05:06:32.714516 | 2022-09-26T12:14:05 | 2022-09-26T12:14:05 | 186,170,069 | 1 | 0 | MIT | 2019-05-11T18:45:46 | 2019-05-11T18:45:46 | null | UTF-8 | C++ | false | false | 3,476 | h | Plugin.h | //
// Copyright (c) 2017-2020 the rbfx project.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, mer... |
a66633dfd61b5890c4c0e9a8d994dd565d8bc200 | 775acebaa6559bb12365c930330a62365afb0d98 | /source/open/components/buttonui/utils/UserInterfaceUtils.cpp | c82685aa18b3f2e531e11d179bbce72acd9494ac | [] | no_license | Al-ain-Developers/indesing_plugin | 3d22c32d3d547fa3a4b1fc469498de57643e9ee3 | 36a09796b390e28afea25456b5d61597b20de850 | refs/heads/main | 2023-08-14T13:34:47.867890 | 2021-10-05T07:57:35 | 2021-10-05T07:57:35 | 339,970,603 | 1 | 1 | null | 2021-10-05T07:57:36 | 2021-02-18T07:33:40 | C++ | UTF-8 | C++ | false | false | 18,475 | cpp | UserInterfaceUtils.cpp | //========================================================================================
//
// $File: //depot/devtech/16.0.x/plugin/source/open/components/buttonui/utils/UserInterfaceUtils.cpp $
//
// Owner: Tim Wright
//
// $Author: pmbuilder $
//
// $DateTime: 2020/11/06 13:08:29 $
//
// $Revision: #... |
0bffb91cf72bf66c80e48cda4f902bf37d139c67 | ae6dbcfd6a333bf598b871e15a7741fef81f964f | /Projects/bdda/src/CPP/Word/inc/WrdStringWithDataTable.h | 2c61651fd47ecbdc494b0de5725573ff24b36b49 | [] | no_license | xeon2007/WSProf | 7d431ec6a23071dde25226437583141f68ff6f85 | d02c386118bbd45237f6defa14106be8fd989cd0 | refs/heads/master | 2016-11-03T17:25:02.997045 | 2015-12-08T22:04:14 | 2015-12-08T22:04:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,865 | h | WrdStringWithDataTable.h | /**
* @file WrdStringWithDataTable.h
*
* Declares the WrdStringWithDataTable class.
*
* (c) Schema Software Inc., 2002 - 2003
*
* @ingroup Word
*/
#ifndef __WRD_STRING_WITH_DATA_TABLE_H__
#define __WRD_STRING_WITH_DATA_TABLE_H__
#include "WrdObject.h"
#include "ChVector.h"
/**
* Class that corresponds to the way t... |
4240cef350a1f94aa841cdf351da1ecc86d5d44d | f05fc1c3eebbdbac27b0ac3523ab9809b674456b | /kollmorgen/orocos_kinematics_alter/src/chainjnttojacdotsolver.cpp | c0c40d849754edaa0beeeb2b17f3215606fbfb65 | [] | no_license | Tianhuanyu/RGM_controller | 43fc4f0f9c323267580e1c8068fd25ce3db603c6 | dbd42d006e468628a3382fa681e3329a84bb40cd | refs/heads/master | 2020-03-15T23:15:07.346846 | 2019-09-02T13:08:26 | 2019-09-02T13:08:26 | 132,389,804 | 5 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 7,328 | cpp | chainjnttojacdotsolver.cpp | /*
Computes the Jacobian time derivative
Copyright (C) 2015 Antoine Hoarau <hoarau [at] isir.upmc.fr>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.... |
d9d9a807396934e289e2e3b99dedfb7c112de9d6 | 4498c2737934ca43b0607346f1bbfcc47ed468a1 | /zoj/zoj1789.cpp | c3426d62582e41628ce5f568536c9257eeccf5af | [] | no_license | tsukipipi/C-Project | 7c8a2b6a1d70f6438b28f0e10ce0817ce3ca63a9 | 161d4f0d72be683ba73fbdeb4bd58a3f02442d88 | refs/heads/master | 2021-04-09T14:27:39.855929 | 2018-04-30T15:09:23 | 2018-04-30T15:09:23 | 125,604,895 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,656 | cpp | zoj1789.cpp | #include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
//并查集
int parent[30001];
//实际学生数
int n;
//实际组数
int m;
//每组学生数
int k;
//每组学生
int student[30001];
//并查集合并
void SetUnion(int i,int j)
{
//结点数之和
int temp=parent[i]+parent[j];
//树i结点比较多
if(parent[i]<parent[j])
{
pa... |
b178a0c7c03c1454091ab74c909d147351c2c3d8 | 3acafaea6ada570668aeea4e076110aba8724bb5 | /cxxlib/test/test_SharedPtr.h | ab0260ececb25f0a81d843a2e6cd7b19ebc06e52 | [] | no_license | frankyueh/cxxlib | 4ca1698d3847ca86204122550b8d1b2e5f520aac | d5d508eae79a53d6a73207ea5cea4afaffb736cd | refs/heads/master | 2020-05-27T00:31:43.736151 | 2015-09-23T06:47:54 | 2015-09-23T06:47:54 | 41,167,531 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 286 | h | test_SharedPtr.h | #pragma once
#include "SharedPtr.h"
namespace SharedPtrTest
{
class ForwardDeclared;
class TestForwardDeclared
{
public:
TestForwardDeclared(int *);
~TestForwardDeclared() {} // expect: without no deleter warning
private:
cxxlib::SharedPtr<ForwardDeclared> m_qcPtr;
};
}
|
b129cb9b6a52d41af8f93d21da177e616999d005 | 42a7f492f624dccf9ac2cc3d4ef991402a757d4b | /Source/OneWars/OWButton.cpp | 036b828389f646f75d33153e272f4b2c83d3ba0e | [] | no_license | zeazer/OneWars | ec3098c27fdb266262d5ce67906085cdeab99c8b | f477a5d38a92f2c8ec16cd2f40af61f50ed9ff4d | refs/heads/master | 2023-02-18T02:15:15.431074 | 2020-07-10T18:47:14 | 2020-07-10T18:47:14 | 278,668,544 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 263 | cpp | OWButton.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "OWButton.h"
UOWButton::UOWButton()
{
mPressedButtonText = TEXT("Just Pressed This Button");
}
const FString& UOWButton::PressedButton()
{
return mPressedButtonText;
}
|
2c7afd1a5167e2d3ccffdf6d46a7590944863d08 | 23ec33e86adfe96a0d49a88e91f880b2154b2c9b | /USACO/cryptcow.cpp | a11b768f16a206f012cb4a7e218342bad2eabf9a | [] | no_license | ck89119/Algorithm | 88ee13e267406f8531b8625fbd2c20c807f535d4 | 94d39795706f07a8240b610927e709978a2ff5d6 | refs/heads/master | 2023-09-01T06:35:09.132142 | 2023-08-29T01:27:47 | 2023-08-29T01:27:47 | 30,058,525 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,071 | cpp | cryptcow.cpp | /*
ID: ck891191
PROG: cryptcow
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <functional>
#include <numeric>
#incl... |
045d4a1ad7c3f2610d7955912da7ee0ae7905e1d | b797d93c9f01734ce8a8dbd3803fd4b49112ac46 | /DrawComponent.cpp | b87ce81b364c033cd321eb5ac8a6fd1a49595bb3 | [] | no_license | xinshoujiajia/Test2 | b659cac83c4fc85f0d31636cb428cba854049233 | 66672ffd59a53eeffe637385147780ee82a45ebe | refs/heads/main | 2023-02-17T06:54:48.684975 | 2021-01-07T15:52:33 | 2021-01-07T15:52:33 | 325,922,836 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 873 | cpp | DrawComponent.cpp | #include"DrawComponent.h"
#include"Actor.h"
#include"Game.h"
DrawComponent::DrawComponent(Actor *owner,Game *game,int updateOrder)
:Component(owner,updateOrder)
{
game->AddDrawComponent(this);
mSize=0;
mColor={0,0,0,0};
}
DrawComponent::~DrawComponent()
{
mOwner->GetGame()->RemoveDrawC... |
0efd73dfc565a78ef419e577c25321d747e4eacd | 123ed592598184e38f1527bd6ed76797f00277fe | /src/kudu/tools/fs_tool.h | ec123cd4efc865cebe414c98e638016bdc9f4a02 | [
"Apache-2.0",
"BSD-3-Clause",
"Zlib",
"GPL-1.0-or-later",
"LicenseRef-scancode-protobuf",
"bzip2-1.0.6",
"MIT",
"NCSA",
"CC0-1.0",
"GPL-2.0-or-later",
"BSL-1.0",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause"
] | permissive | yuanjingkai/kudu | ee331cd9f5a41f1bd8acf237fa972bb97ce3dcac | 3543c3534defcadd342d4a36f38501f2b84695a3 | refs/heads/master | 2020-04-09T12:45:46.424364 | 2015-09-16T01:34:47 | 2015-10-07T18:46:41 | 40,165,963 | 0 | 1 | Apache-2.0 | 2023-03-20T11:57:17 | 2015-08-04T05:53:05 | C++ | UTF-8 | C++ | false | false | 4,816 | h | fs_tool.h | // Copyright 2014 Cloudera, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to ... |
0b30e733d27db8118b0d9852df2cc509f449a474 | c505feab29f4e78f46f7143e3ca254b48095347c | /GuidanceSDK/Guidance-SDK-master/demo/obstacle_bypass/discontinuity-balance_strategy/src/dji_sdk/src/dji_sdk_node.cpp | b019fa400b99f71a4bbea6cf97f43bbf13f2f22b | [] | no_license | seudrone/doc-for-dji | dece2910c074a563d43bb52cbe9bdfa9907635bb | 5387a59e28b233692452adf177106d8048d2154d | refs/heads/master | 2021-07-06T02:01:40.161580 | 2017-09-27T15:47:44 | 2017-09-27T15:47:44 | 105,038,341 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 33,891 | cpp | dji_sdk_node.cpp | /*
============================================================================
Name : dji_sdk_node.cpp
Author : Mario Chris
Description : Obstacle Avoidance
============================================================================
*/
/* Onboard */
#include <stdio.h>
#include <stdlib.h>
#include <... |
d2aa7854b75cbb777952deea47ef7a3de19847b4 | d27b8032c7f5149279046917c72191db0a70bc07 | /2018_06_12_02_State/console/ShopState.cpp | 6111b0c5fd6e120dc8d3663f1dfecd6c17f4e1c0 | [] | no_license | jungwoo9454/Console-Shooting-Game | d5fcfed4315e8b661d92968b5cd2f128a8bab935 | 0ad838f8d51834428464e8920e75f66a53539325 | refs/heads/master | 2023-05-12T18:29:41.686676 | 2020-07-15T03:16:02 | 2020-07-15T03:16:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,235 | cpp | ShopState.cpp | #include "Include.h"
CShopState::CShopState()
{
for (int i = 0; i < E_SHOP_MAX; i++)
{
m_bUse[i] = false;
m_wFcolor_[i] = GREEN;
}
m_nCoin = 1000000;
m_nX = 9;
m_nY = 6;
m_wBColor = BLACK;
m_nCoinMul = 1;
m_dwLimitTime = 80;
m_dwStandTime = GetTickCount();
}
CShopState::~CShopState()
{
}
void CShopState:... |
b9547f5fb992785c949b31a6712cf6fd7a96b80b | 16fb8d6b3cfa3535f8bf4989b62ace0a0a9ae980 | /HBaseClient/cpp/src/Hbase_client.h | 112ca8340deb6b4092dc4409e33736565148f614 | [] | no_license | shineit/iFlyQA | 9dc458abaf5f008e610300590357474212815273 | e94a469afba6b1ac4df156e47ccec026d559e769 | refs/heads/master | 2018-03-23T22:20:20.773734 | 2015-04-20T06:07:28 | 2015-04-20T06:07:28 | 86,664,882 | 0 | 0 | null | 2017-03-30T06:01:58 | 2017-03-30T06:01:58 | null | UTF-8 | C++ | false | false | 1,751 | h | Hbase_client.h | /*
* Copyright 2012 iflytek.com inc.
* File: Hbase_client.h
* Author: qfdai2@iflytek.com
* Create Date: 2012-12-21
* Modify:
* Desc:
*/
#ifndef HBASECLIENT_H__
#define HBASECLIENT_H__
#include <iostream>
#include <string>
#include <vector>
#include <thrift/protocol/TBinaryProtocol.h>
#include <thrift/transpo... |
cec3421d50711704358ffe8f987d74453ed8ddc0 | 08f54099e00c399b3a3eda30e158073f0c5de447 | /TellerEvent.h | 77bcc7a7456438b9738d63835aa14762c239b6ab | [] | no_license | hsmarch/CS2303_qSim | e5c3308d69c0e1aa78ef3f24921f6fbd1e5f4d3e | 6535a72fc4aed1f9110ac8b8a38c0dff2aec5b1b | refs/heads/master | 2021-03-19T20:38:53.042911 | 2018-02-15T03:37:09 | 2018-02-15T03:37:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 264 | h | TellerEvent.h | //
// Created by Harrison March on 2/14/2018.
//
#ifndef QSIM_HSMARCH_TELLEREVENT_H
#define QSIM_HSMARCH_TELLEREVENT_H
#include "Event.h"
class TellerEvent : public Event {
public:
TellerEvent(double serviceTime);
};
#endif //QSIM_HSMARCH_TELLEREVENT_H
|
de82d9e6dd853331fbdf58080b2c8e9aff4e4809 | c09ffb7701d38365123beea17150a056d7e6090c | /HDU/HDU5976 Detachment.cpp | 16d287473df3c802f6fd1e9abbbd3c35021e0fe4 | [] | no_license | Reno-Jarrison/Code-Repository-for-Problem-Solving | f100aa1190c3a7d23955d4756a9afa8353c8edbe | b2715b696cdb4b0416e334a5bd231beea66cfca0 | refs/heads/main | 2023-04-12T08:08:16.151731 | 2021-05-11T01:29:07 | 2021-05-11T01:29:07 | 315,653,788 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | cpp | HDU5976 Detachment.cpp | #include<cstdio>
#include<cmath>
#define ll long long
using namespace std;
const int maxn=1e5+5;
const ll mod=1e9+7;
ll fac[maxn]={1},inv[maxn];
ll qpow(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1) ans=ans*a%mod;
a=a*a%mod,b>>=1;
}
return ans;
}
int main()
{
for(int i=1;i<maxn;i++)
... |
5d74cb20d3eb5c5662afd7122318ec067c8e5f42 | e8e8ed1ddbc842516d5d74858fb345c5b5f88f5d | /yhmvc/Builders/Builder.cpp | b8db118c47f697849370248a34abb5a3e1ff29db | [] | no_license | trarck/yhmvc | 9a2d788b76647e5fc4d97b61123a26b6adf8c856 | c2b5eee4c668e28918c19cb7332eecd0d2ff2ae6 | refs/heads/master | 2021-01-02T08:20:44.422590 | 2014-02-20T08:53:33 | 2014-02-20T08:53:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 915 | cpp | Builder.cpp | #include "Builder.h"
NS_CC_YHMVC_BEGIN
Builder::Builder()
{
}
Builder::~Builder()
{
}
bool Builder::init()
{
return true;
}
CCNode* Builder::buildFromFile(const std::string& filename)
{
return NULL;
}
CCNode* Builder::buildFromFile(const std::string& filename,CCObject* parameter)
{
return NULL... |
c8d2870b5e7458a9fff0fdacd8d0fa7ed414bf57 | e9c4f33f3f485d7bb0389700b0c63d92206b1d35 | /Classes/Coin.h | 3510706e6ecac6f99152a96b7a97e9b24174a3b5 | [
"MIT"
] | permissive | wjingzhe/A_ParkourJingz | 3d782c2a10df037734fc5185dfe886fe54dce9e2 | 62b56d804192918f44ef1fb262b83ca34db62a40 | refs/heads/master | 2021-01-18T04:27:15.259750 | 2019-04-17T09:32:07 | 2019-04-17T09:32:07 | 39,508,845 | 2 | 6 | null | null | null | null | GB18030 | C++ | false | false | 939 | h | Coin.h | #pragma once
#include "cocos2d.h"
#include "MoveAbleElem.h"
class Coin :public MoveAbleElem
{
#define DEFAULT_MODEL_RES_PATH "model/coin.c3b"
protected:
Coin();
public:
virtual ~Coin();
bool init(const std::string &pathName = DEFAULT_MODEL_RES_PATH);
static Coin* createWithAutoRealse()
{
Coin *pRet = new(s... |
b217f304e3ba73d3b29a6464b658d3631e8f90d7 | 1b5c69d3d3c8c5dc4de9735b93a4d91ca7642a42 | /other/alds/alds1_2_C.cpp | cdef6095d44e4882fb338cb1b73379fba1308fcf | [] | no_license | ritsuxis/kyoupro | 19059ce166d2c35f643ce52aeb13663c1acece06 | ce0a4aa0c18e19e038f29d1db586258970b35b2b | refs/heads/master | 2022-12-23T08:25:51.282513 | 2020-10-02T12:43:16 | 2020-10-02T12:43:16 | 232,855,372 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,324 | cpp | alds1_2_C.cpp | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
struct Card {char suit, value;};
void print(struct Card A[], int N){
for (int i = 0; i < N; i++){
if (i) cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
void BubbleSort(struct Card A[], int N){
for (int... |
71194c80605bf53edd60ee6f23104810fbcb238a | 90ace2db2cc15bc0439c2341e9445e6a65420757 | /CompetitiveProgramming/RBLtree.cpp | 69a04813fd760c222fe4b5ce763e27a237b2685f | [] | no_license | naukarshah/DSandAlgo | 10ed6845cf160299c610b6aa15c2ba5861d8b3d7 | 6e516980ddba4bfbd9b02156b62f4ee6d63435f0 | refs/heads/master | 2022-04-12T01:50:10.973198 | 2020-04-11T17:40:30 | 2020-04-11T17:40:30 | 254,872,181 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,625 | cpp | RBLtree.cpp | //
// RBLtree.cpp
// CompetitiveProgramming
//
// Created by Ashutosh Pandey on 11/04/20.
// Copyright © 2020 Ashutosh Pandey. All rights reserved.
//
#include "RBLtree.hpp"
//print the keys of Red Black Tree
void RBT::InorderTraversal(RBTnode* node){
if (node == nullptr) {
return;
}
InorderT... |
c995d00401ed78673d21a71d541bd6627faf3ba1 | 032ceb96c84d2b2a88c15b5e1b8e90fc492776c7 | /Engine/Callback.hpp | 4241b6ad8716187cf6113e009309f6ddd6fb6702 | [] | no_license | antiqe/RType | ae8859cfe589cfcfbd5ba8c0fc82480bfcd759d5 | 6165ad1dd11c179c82946d8be07c862db82483b4 | refs/heads/master | 2016-09-06T09:31:13.177842 | 2013-12-04T09:59:40 | 2013-12-04T09:59:40 | 14,722,487 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 331 | hpp | Callback.hpp | #ifndef _CALLBACK_H_
# define _CALLBACK_H_
namespace Engine
{
class Widget;
class Event;
namespace Callback
{
typedef void (*EventFunction)(Widget*, Event*);
void quit(Widget*, Event*);
void followMouse(Engine::Widget*, Engine::Event*);
typedef void* (*ThreadFunction)(void*);
void* run(void* param);
}... |
ea11f3b4b3da405bc575d3c3ec9218b9f2de6ebc | 4608185b04438ed82efdaba51b077cfd67cb66bf | /mainwindow.cpp | a04fa593a5b6514e7dd04ec6459f2c00b2caba3b | [] | no_license | longwei/UI-prototype | 6883951732dda2987568dffd36dd53ccacd169b0 | 5c3fa725cb7ae2e4b9c494174bb9e2606bba2c23 | refs/heads/master | 2021-01-19T18:29:49.536733 | 2013-09-13T06:39:00 | 2013-09-13T06:39:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,667 | cpp | mainwindow.cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QDebug>
class CustomTabStyle : public QProxyStyle
{
public:
QSize sizeFromContents(ContentsType type, const QStyleOption *option,
const QSize &size, const QWidget *widget) const
{
QSize s = QProxyStyle::sizeFromCont... |
5f65055e65a934659133d1dde19838400fcd4307 | d25389bd4f05a2ec4a9c8c86930f2fe909b462d5 | /cob_people_detection/ros/src/SceneDrawer.cpp | e3e0194aab7b01667cbac5a5939d5441bdc7dc9b | [] | no_license | ipa-rmb/cob_people_perception | 0f7af6c1763039efc108bf5079ec21bc2fc15274 | 9c78b9fa082bb181fd39a3eab46c4a393d2ffc3b | refs/heads/indigo_dev | 2020-04-05T23:16:30.903078 | 2019-03-14T14:44:09 | 2019-03-14T14:44:09 | 2,598,635 | 30 | 42 | null | 2017-07-28T08:25:29 | 2011-10-18T12:03:40 | C++ | UTF-8 | C++ | false | false | 4,895 | cpp | SceneDrawer.cpp | /*****************************************************************************
* *
* OpenNI 1.0 Alpha *
* Copyright (C) 2010 PrimeSense Ltd. *
... |
f6cb63b59f5b2e304836cb8fb8b74e0eae927b43 | 0fe7089dd415fc2d985fb20582eccac71a123ab4 | /src/gmc4sim/Board.cpp | cd2217fb24b68604de53f6ca887fc219d9d9f5cb | [] | no_license | tearitco/gmc4sim | 5cf680540b123e429683b27653d83a8b765eaf66 | 85a8c26c5cf2e709da5081ade885c017ea93fa7c | refs/heads/master | 2021-12-14T09:53:38.166057 | 2017-04-24T02:10:48 | 2017-04-24T02:10:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,956 | cpp | Board.cpp | // GMC-4 Simulator
// Copyright (C) 2009-2017 ypsitau
// https://github.com/ypsitau/gmc4sim
#include "stdafx.h"
#include "Board.h"
//-----------------------------------------------------------------------------
// Board
//-----------------------------------------------------------------------------
Board::Board(wxWin... |
93c21ee02f9a29881b04853a774b595c6d1ea6e1 | 4b1bf024abc9065814ec0a56ba408484fb686790 | /src/QrCodeModel.cpp | b4102a4bbcb2c6befcd2a5eb4567dda9373df74b | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | monich/harbour-qrclip | 40b6b70618c4ac1fe6ec24a68167a6f99ad40df7 | 7c9fcb2cd3501df117722f7cad47a1d49dcbd5b9 | refs/heads/master | 2023-03-03T22:25:14.771100 | 2023-02-19T23:28:08 | 2023-02-19T23:28:08 | 184,955,371 | 1 | 7 | NOASSERTION | 2021-06-28T23:17:04 | 2019-05-04T23:53:53 | QML | UTF-8 | C++ | false | false | 9,173 | cpp | QrCodeModel.cpp | /*
* Copyright (C) 2021 Jolla Ltd.
* Copyright (C) 2021 Slava Monich <slava@monich.com>
*
* You may use this file under the terms of BSD license as follows:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
... |
711f307e152b77e724833ef76fe344946be00f31 | 05b458a94b13328c4ab0bb474513e69c5f253ec0 | /analysis-sources/raylib-analysis/_cppstats/raylib/projects/VS2017.UWP/raylib.App.UWP/BaseApp.h | b4578eef78fd657c4d5c3ea2f8c680fc1da7a72d | [] | no_license | paulobernardoaf/dataset-files | c7b3a5f44f20a6809b6ac7c68b9098784d22ca52 | 6cc1726ee87e964dc05117673e50e3e364533015 | refs/heads/master | 2022-04-23T06:52:15.875641 | 2020-04-25T18:28:48 | 2020-04-25T18:28:48 | 253,626,694 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,090 | h | BaseApp.h | #pragma once
#if defined(PCH)
#include PCH
#endif
#include <chrono>
#include <memory>
#include <wrl.h>
#include <EGL/eglplatform.h>
#include "raylib.h"
#include "utils.h"
using namespace Windows::ApplicationModel::Core;
using namespace Windows::ApplicationModel::Activation;
using nam... |
374d97fda5073366f287b2ebe4bfedbc74274e80 | 2239de4115fc8ced9ca9653a459dcce376443e64 | /mess/Net/TcpClient.h | 52d407cc41604d42c4fbc6386fc7ee1a27513bfe | [] | no_license | TangLingxiao/learn | 6c7ebb00b134333cbbf417c2bda48afbcdceeda3 | 2927e3145e7c1b99d82fd2e1270de6c710461ed2 | refs/heads/master | 2021-06-29T15:58:56.047994 | 2020-10-09T03:54:14 | 2020-10-09T05:26:35 | 167,476,740 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 833 | h | TcpClient.h | #pragma once
#include <memory>
#include "CallBack.h"
#include "Pattern/NonCopyable.h"
#include <atomic>
class EventLoop;
class Connector;
class InetAddr;
class TcpConnection;
class TcpClient : public NonCopyable
{
public:
TcpClient(EventLoop *lp, const std::string& name);
~TcpClient();
void setMsgCb(MsgC... |
6cf8db65bc4d76f8cb405a4480d819c18efc231d | b22588340d7925b614a735bbbde1b351ad657ffc | /athena/PhysicsAnalysis/MuonID/MuonPerformanceAnalysis/MuonCalibrationFit/src/GRLReader.cxx | 9c7051d02cfe92a304f25fc0f7e4ee109034dde8 | [] | no_license | rushioda/PIXELVALID_athena | 90befe12042c1249cbb3655dde1428bb9b9a42ce | 22df23187ef85e9c3120122c8375ea0e7d8ea440 | refs/heads/master | 2020-12-14T22:01:15.365949 | 2020-01-19T03:59:35 | 2020-01-19T03:59:35 | 234,836,993 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,824 | cxx | GRLReader.cxx | /*
Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
*/
#define GRLReader_cxx
#include "../MuonCalibrationFit/GRLReader.h"
GRLReader::GRLReader( string grl_name ) {
string line;
ifstream grl_file( grl_name.c_str() );
vector< string > all_runs;
if( grl_file.is_open() ) {
//regex ... |
9e32f9c187c64061706a3a612a4bdbbf4b3b716c | 1dbf007249acad6038d2aaa1751cbde7e7842c53 | /cfw/src/v1/model/UpdateRuleAclDto.cpp | 9f1ff602b0968756d04240b7170dc36a9497ef89 | [] | permissive | huaweicloud/huaweicloud-sdk-cpp-v3 | 24fc8d93c922598376bdb7d009e12378dff5dd20 | 71674f4afbb0cd5950f880ec516cfabcde71afe4 | refs/heads/master | 2023-08-04T19:37:47.187698 | 2023-08-03T08:25:43 | 2023-08-03T08:25:43 | 324,328,641 | 11 | 10 | Apache-2.0 | 2021-06-24T07:25:26 | 2020-12-25T09:11:43 | C++ | UTF-8 | C++ | false | false | 15,092 | cpp | UpdateRuleAclDto.cpp |
#include "huaweicloud/cfw/v1/model/UpdateRuleAclDto.h"
namespace HuaweiCloud {
namespace Sdk {
namespace Cfw {
namespace V1 {
namespace Model {
UpdateRuleAclDto::UpdateRuleAclDto()
{
addressType_ = 0;
addressTypeIsSet_ = false;
name_ = "";
nameIsSet_ = false;
sequenceIsSet_ = false;
direc... |
66734db7d0281d8606696e94d7693d1fc7435cf8 | 096728b65053d713d3ef56dc598ab4090a6f74e2 | /test.cpp | b556b721fa77e0c4113a26ded85fc33b55ce0eeb | [] | no_license | ds1993/abstract_factory_test | 87b310a420112cffcdd974627c60987e10b1f5d4 | 365170d36cbd455ba68a34b5ee6846814f36470c | refs/heads/master | 2021-01-25T13:18:08.765223 | 2018-03-05T03:41:32 | 2018-03-05T03:41:32 | 123,550,700 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 137 | cpp | test.cpp | #include "MazeFactory.h"
#include "MazeGame.h"
int main()
{
MazeFactory factory;
MazeGame maze;
maze.CreateMaze(factory);
}
|
b2be34e0c37d9b8b84f9a217f446957ccb694060 | 7abfebc6b47be941e3f915428e803785286a9872 | /smartWatch_v2/smartWatch_v2.ino | 2e4557cddae2f08b15968b394fcb853ecc854e6a | [] | no_license | mumahack/flirtyDancing | 26bd73c67212fa7a37ce32a31fadbddcd7e692f3 | 6367cac9d7a2947bb8c2992a6be86003e34179e1 | refs/heads/master | 2021-08-24T11:58:06.605762 | 2017-12-09T17:15:21 | 2017-12-09T17:15:21 | 113,670,182 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,698 | ino | smartWatch_v2.ino | #include "Arduino.h"
#include "Servo.h"
#include "SimpleTimer.h"
#include "Adafruit_NeoPixel.h"
#include "Adafruit_GFX.h"
#include "Adafruit_SSD1306.h"
#include "Adafruit_MPR121.h"
#include <EEPROM.h>
#include <RtcDS3231.h>
//
//TODO _> I2c DS1302 or DS3231
//#define TIME_24_HOUR false
//RTC_DS1307 rtc = RTC_DS13... |
d2881b037e98afa777f060cff11311880840be29 | 75dec89e66e21eeb173eda353dc2549dcbb25a0e | /Leetcode/c_200_Number_of_Islands.cpp | 542cb134b0dc2daf1ac75107ff56e290db483932 | [] | no_license | chenghu17/Algorithm | 459569b1cf62f96b767ea00bb04c08fe4ff60897 | d54e5b8435db8975e5938933c49807a2bfe3ca20 | refs/heads/master | 2022-03-13T02:37:18.263752 | 2019-10-14T10:16:07 | 2019-10-14T10:16:07 | 118,882,001 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,181 | cpp | c_200_Number_of_Islands.cpp | //
// Created by Mr.Hu on 2018/8/14.
//
// leetcode 200 number of islands
//
// 题目给定一个二维的数组来表示一块区域，其中1表示岛屿，0表示海洋，要求求出岛屿的个数。
// 其中如果在垂直或水平方向上有连续的1，则说明是一个岛屿
//
// 这个题目之前遇到过，大致解题思想还记得。
// 对于这样一个区域，如果存在某个位置为1，则我们需要继续去判断其上下左右是否也为1，
// 如果其上下左右在这个区域内，且存在为1，则继续判断当前位置的上下左右是否为1。很容易想到用递归的思想。
//
// 既然是每次判断上下左右是否为1，我们也可以把这个思路转换为图来考... |
a70851c78130323c4488febbbc4f4c8cefa1e50c | 2f400d77e43ef968deba3156187bbe439359685d | /TestFtpClient/TestFtpClient/FtpClient.h | 2f7d3a990da0fa925c571efb9c6a5fb080a52e7c | [] | no_license | agmzg/FtpClient | a52304f2415b83818a69d41e26403efffffc35b7 | 1f1d93810cacd45fbd21d8586213a4139d207287 | refs/heads/master | 2021-01-04T14:06:19.236412 | 2017-08-01T14:10:00 | 2017-08-01T14:10:00 | 98,971,080 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,350 | h | FtpClient.h | #ifndef _FtpClient_H_
#define _FtpClient_H_
#include <string>
#include <vector>
#include <deque>
#include <curl/curl.h>
#include <Poco/Mutex.h>
#include <Poco/Thread.h>
#include <Poco/Runnable.h>
#include "AtomicBool.h"
class ProgressObserver
{
public:
virtual ~ProgressObserver(){}
virtual void OnUploadProg... |
76ff61291b2b83b1102f75722beddb8b31c91774 | 24be8a8674bebc94db474388c51b346681938f5d | /GlobalVar.h | 029dcab7f03f05caf9ae5ede11ed2a8aedbf6a81 | [] | no_license | armear3000/Platform-allegro | b87318626ae0ca66208b966faefa595d6033d61b | e69363a108842928f246a95bd6fd9ba6e8e993c3 | refs/heads/master | 2020-05-01T17:30:49.275894 | 2019-03-26T16:58:18 | 2019-03-26T16:58:18 | 177,601,542 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 638 | h | GlobalVar.h | #define _CRT_SECURE_NO_WARNINGS
#include <cstdlib>
#include <allegro5/allegro.h>
#include <allegro5/allegro_primitives.h>
#include <allegro5/allegro5.h>
#include <allegro5/allegro_image.h>
#include <allegro5/allegro_font.h>
#include <allegro5/allegro_ttf.h>
#include <allegro5/allegro_native_dialog.h>
#includ... |
0c07c71d52ace7bc9ff4c3196436ccbfd1585495 | d209bace8bcf307448316c356578f1d602f140c1 | /suturo_manipulation_move_robot/include/suturo_manipulation_move_robot.h | a5230534b02f0645b440c66a7d44284e328d964d | [] | no_license | SUTURO/legacy_suturo_manipulation | 39de35adc0388e2513d85e843ec6e1ddab3ea1c8 | 200c4da883279af4f7d9b991061d81d42259dd76 | refs/heads/master | 2021-05-29T16:59:41.057026 | 2014-05-16T11:07:09 | 2014-05-16T11:07:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,404 | h | suturo_manipulation_move_robot.h | #ifndef SUTURO_MANIPULATION_MOVE_ROBOT
#define SUTURO_MANIPULATION_MOVE_ROBOT
#include <iostream>
#include <ros/ros.h>
#include <geometry_msgs/Twist.h>
#include <geometry_msgs/PoseWithCovarianceStamped.h>
#include <geometry_msgs/PoseStamped.h>
#include <tf/transform_listener.h>
#include <tf/transform_datatypes.h>
... |
6b04592408ad657fb974d448eedfe2bd884dc2a9 | b3931bc2e18fe54799b805edc1b8934e28606b33 | /2013-2014/Exams/Exam_2/Task_1/Task_1.cpp | 77a1c366d7d5cee620f93082594eb2bbf92043cc | [] | no_license | maxim-yakupov/University | 0830cfa36038bef8932c134a6a035bea76471e90 | bcc0f5ed6bf28430f7d740a43867e7cd47271731 | refs/heads/master | 2021-01-17T13:03:30.068669 | 2017-01-30T21:55:23 | 2017-01-30T21:55:23 | 58,821,128 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 480 | cpp | Task_1.cpp | #include <iostream>
using namespace std;
unsigned int fibonachi(unsigned int step);
int main()
{
cout << "Write number of Fibonachi number: ";
unsigned int n = 0;
cin >> n;
cout << "Fib(" << n << ") = " << fibonachi(n);
return 0;
}
unsigned int fibonachi(unsigned int step)
{
if (!step)
{... |
2cc0d24317f4641d58297be1753fcbcf30c3e99c | 4955f3b54dace91022f896e2346049124f20cd6e | /Assignment 1/New assignment 6.cpp | 8decaeaf341cf6a596f552425af328a20ce79534 | [] | no_license | qrapheneee/cpp-Assignments | b5a3a08bb574117dbf609ab352233e56372bd76e | b591aac4c57e40ac22a8e47c3262f23d1aa348bf | refs/heads/master | 2021-01-10T04:48:24.437809 | 2015-05-22T17:51:13 | 2015-05-22T17:51:13 | 36,082,568 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,531 | cpp | New assignment 6.cpp | /*
* Question6.cpp
*
* Name: [ Inim Andrew Esiet ]
* Department: [ Computer departmemt ]
* Matric. No: [ 47123818DC ]
*
* Body Mass Index (BMI) calculator application that reads
* the user’s weight in kilograms and height in meters,
* calculates and display the user’s body mass index
... |
464cdb3da312f11842b57d176917cda24ec41718 | 0eca16668f1ba547f3f24ec55cb10e053df4492e | /test/Case9.cpp | 5762861d4c511580e9d13567ee926b927db22b52 | [] | no_license | mateog4712/SparseRNAFolD | 5ef4e06720eb75676ac3d30d1b1ff177ad028c1c | dea0b6cd627b97c1c4835d2e96ba18532809a872 | refs/heads/main | 2023-08-10T17:35:35.084413 | 2023-07-19T08:23:43 | 2023-07-19T08:23:43 | 301,299,157 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,604 | cpp | Case9.cpp | #include <string>
#include <fstream>
#include <vector>
#include <iostream>
#include <tuple>
#include <iomanip>
#include <sstream>
#include <limits>
#include <iterator>
#include <cstring>
#include <cassert>
#include <numeric>
#include <map>
//#define CATCH_CONFIG_MAIN
#include "catch.hpp"
// Make random input struct... |
fd3fc3b6e3f3b82340302fa5ba1bd0e84430fb0f | 66661a9f3fd486c0277519accc9a4f0901709574 | /tasks/BMaksimumMaksimumaIzMinimumov.cpp | 75e58d3fb8fe52bc94d96514d4031edaaa07d5c2 | [] | no_license | emli/competitive | b112ba3aee0009af68aa9bc997b2f35eb00cdfd8 | e1e2b5f9e67b86a709a9719e072e8a8732ae76b3 | refs/heads/master | 2022-05-19T21:53:27.531860 | 2022-05-05T17:27:39 | 2022-05-05T17:27:39 | 154,149,766 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,310 | cpp | BMaksimumMaksimumaIzMinimumov.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(),x.end()
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
class BMaksimumMaksimumaIzMinimumov {
public:
static void solve(std::istream &cin, std::ostream &cout) {
int n, k;
cin >> n >> k;
... |
e1536303fab8b7cdb7fb8d1a85e7a6dbb3f97474 | 639b59d5f361339b70ddb0ee23f61497752e8554 | /eigen_physiks.cpp | 4c962d7e93603fb1b8c7bd77ce05754b1d4d0008 | [] | no_license | rrti/eigenphys-iks | 01037a715db195d562337ad09f2ed45a81df15d6 | 73c9579b0193502c8984518a7294970700eccdb4 | refs/heads/master | 2021-01-23T00:10:03.438308 | 2017-03-23T01:03:07 | 2017-03-23T01:03:07 | 85,703,804 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,403 | cpp | eigen_physiks.cpp | #include <GL/glew.h>
#include <GL/gl.h>
#include <GL/freeglut.h>
#include "eigen_engine.hpp"
static epiks::t_eigen_engine g_engine;
static void update_frame() { g_engine.update_frame(); }
static void render_frame() { g_engine.render_frame(); }
static void regular_key_pressed (uint8_t key, int32_t, int32_t) { g_engi... |
9e89f5cf9b393eeb2279e69f430978090e5f4cbf | f7006c9f2ae60e94b4ac2c5a13ce62329dd3db71 | /partialmodel_hrt/pmraynode.h | 233f627679fe060a1fb5358e07e5a2d2dad4a9a1 | [
"BSD-3-Clause"
] | permissive | CHLMYR/vpl | 9d61e310371346be29bbda95b6c5ad427db5570b | 1a6e88353395ca0e43a0c4d0d6b38f7c7e2925f7 | refs/heads/master | 2023-03-15T16:24:58.187700 | 2018-08-17T14:26:14 | 2018-08-17T14:26:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,705 | h | pmraynode.h | /*
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 2012 <copyright holder> <email>
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 ve... |
4add402d06bb2780d5378c7d607cd8a66980a7ca | 7d83df57b7cb4a98733c76ad8c6a9691b2ca7890 | /dev/ese/src/os/blockcache/_cachedfilehash.hxx | 9c7f988f9e2b99485e0cdcd88d404b25e695e6a7 | [
"MIT"
] | permissive | microsoft/Extensible-Storage-Engine | 30ab5bf8b5f8f2c2b5887b1dfa59b82c0588de70 | 933dc839b5a97b9a5b3e04824bdd456daf75a57d | refs/heads/main | 2023-08-13T11:53:52.563089 | 2022-07-29T17:16:38 | 2022-07-29T17:16:38 | 331,747,853 | 844 | 66 | MIT | 2023-06-15T11:57:35 | 2021-01-21T20:34:01 | C++ | UTF-8 | C++ | false | false | 3,619 | hxx | _cachedfilehash.hxx | // Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
#pragma once
// Cached file table key.
class CCachedFileKey
{
public:
CCachedFileKey()
: m_volumeid( volumeidInvalid ),
m_fileid( fileidInvalid ),
m_fileserial( fileserialInvalid )
... |
54d2522da3e4dfb1e4e96ee3aef69aba2b0926eb | 6c3e3b35867408aef48c94a020070bb8e9519469 | /tests/newtonian/two_dimensional/gresho_vortex_2o/test.cpp | f886da46b26731385a2dbbe64e2a11501fbc8f1a | [] | no_license | bolverk/huji-rich | 9f579bf4c16732f56a8b128886f07b1ac9aabd67 | 58ec1a7e71b00ddb387160b39196d8dd9e40bd3f | refs/heads/master | 2022-10-02T20:25:09.887543 | 2022-03-31T19:18:47 | 2022-03-31T19:18:47 | 32,133,420 | 16 | 13 | null | 2021-07-25T01:16:41 | 2015-03-13T06:09:39 | C++ | UTF-8 | C++ | false | false | 5,677 | cpp | test.cpp | #ifdef RICH_MPI
#include "source/mpi/MeshPointsMPI.hpp"
#endif
#include <iostream>
#include <cmath>
#include "source/newtonian/two_dimensional/hdsim2d.hpp"
#include "source/newtonian/two_dimensional/geometric_outer_boundaries/SquareBox.hpp"
#include "source/tessellation/VoronoiMesh.hpp"
#include "source/newtonian/commo... |
e69e49b20a45e8196e79f2835983222df4ec0d4b | 34083fb5c21e0ccbbfb8b3a27d864154e1731b31 | /src/common/davcollectionsfetchjob.cpp | 34c6287df20fcf8c061469867f083efbdb880f0a | [] | no_license | KDE/kdav | f1c147eb1e6545e082d819d8933f70d162d093f3 | a2b6819d7a8b08d9e974a4cd56c6c4b8f800ea5b | refs/heads/master | 2023-08-17T08:02:27.787178 | 2023-08-08T02:22:33 | 2023-08-08T02:22:33 | 77,642,671 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,751 | cpp | davcollectionsfetchjob.cpp | /*
SPDX-FileCopyrightText: 2010 Tobias Koenig <tokoe@kde.org>
SPDX-License-Identifier: LGPL-2.0-or-later
*/
#include "davcollectionsfetchjob.h"
#include "davjobbase_p.h"
#include "daverror.h"
#include "davmanager_p.h"
#include "davprincipalhomesetsfetchjob.h"
#include "davprotocolbase_p.h"
#include "utils_p.... |
dea6fe2618f68b252e35e7cc05f59908b662fb79 | 84090973310d01d8fb38a391f9aa182a5886e17e | /challenge/2020/october-leetcoding-challenge/asteroid-collision.cpp | 99b0a848ea49f4ec88d3a616aabf3bd4dc4ae133 | [] | no_license | VasuGoel/leetcode | 29e4d7fe6654d76ae625037e6266ec9e8d25f304 | 2de293a5acbbe653a9e0757fea99eca37ac84e54 | refs/heads/master | 2023-04-14T11:19:16.995592 | 2021-04-30T16:35:57 | 2021-04-30T16:35:57 | 324,527,300 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 686 | cpp | asteroid-collision.cpp | // O(n) time and space. Stack-based approach.
class Solution {
public:
vector<int> asteroidCollision(vector<int>& asteroids) {
vector<int> ret; // simulates stack
for(int cur: asteroids) {
bool destroyed = false;
while(!ret.empty() and ret.back() > 0 and ... |
5eca8f6b22d3ce403f8789139cb8b94c2aaa62ad | 9aeba5dbf1140a78d2fb6515331b3d84af93ce71 | /l5q2.cpp | 7ba4089d2de8e3e8685f69e16066dde661019340 | [] | no_license | MohsinAliIrfan/3rd_Sem_all_Codes | c521a71ff76d4ce8ba5f3917c0f54a4c0a02639f | 53d5d12caeed5e5962ed47b46f1a3e1094debf26 | refs/heads/main | 2023-03-22T08:19:05.426663 | 2021-03-13T12:00:12 | 2021-03-13T12:00:12 | 347,354,079 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,102 | cpp | l5q2.cpp | #include<iostream>
using namespace std;
class Employee
{
char* firstName;
char* lastName;
const double hourlyRate = 10;
double hours, pay;
public:
// Parameterized Constructor with default arguments
Employee(char* firstname = nullptr, char* lastname = nullptr, double hours = 0.0)
{
setFirstNam... |
f371d122d85afbad31859dcce6e41c04650e7d47 | 0c6da8b04ba38ba930364155fd3596b94c41dfbb | /Problemset/binary-tree-paths/binary-tree-paths.cpp | 2a6edd0a6e77e67a973faf2a5affee9b5ad9c91e | [] | no_license | rubychen0611/LeetCode | 200725a80cf4e27b8180a14276d4f5c8958b5c39 | 185a0f9de2624345ca1f219be633ed1e891e6d8d | refs/heads/main | 2023-08-26T11:33:02.711733 | 2021-10-21T03:22:12 | 2021-10-21T03:22:12 | 306,789,533 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,524 | cpp | binary-tree-paths.cpp |
// @Title: 二叉树的所有路径 (Binary Tree Paths)
// @Author: rubychen0611
// @Date: 2021-02-08 15:14:46
// @Runtime: 8 ms
// @Memory: 12.3 MB
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {... |
0e31efd26fc1b5d028a1ea641942c835c963a0cd | 73e3ead49cfcff43bc4fc584aca4964722472458 | /src/Server/Games/BoardGames/Chess/ChessBoard/ChessPieces/King.h | 7a0303726545fdc4abc51d917d750e1250164f77 | [] | no_license | Alek96/WebGamesCentre | b45c074fde56e80105c7de90a025e23c2a858fb6 | 8ab46ad34220f041a669b838ad4a0a8ebd34c502 | refs/heads/master | 2021-01-19T22:20:27.995799 | 2017-06-13T12:54:04 | 2017-06-13T12:54:04 | 84,977,102 | 0 | 0 | null | 2017-06-13T12:54:05 | 2017-03-14T17:18:19 | JavaScript | UTF-8 | C++ | false | false | 539 | h | King.h | #ifndef KING_H
#define KING_H
#include <string>
#include <iostream>
#include <memory>
#include <map>
#include <functional>
#include "ChessPiece.h"
#include "ChessPieceFactory.h"
class King : public ChessPiece
{
public:
typedef std::shared_ptr<ChessPiece> ChessPiecePtr;
typedef std::vector<ChessBoardPosition> vecto... |
bf240b90b6cf8dd0ff091ecdeeeae4643b58d3b6 | 8b64d3dff8358825f9e9c59c4a2d4aa9d60eabac | /include/llvm/DebugInfo/CodeView/TypeSerializer.h | f785d4509547503a46a242700e4ef3603742dced | [
"NCSA"
] | permissive | kavon/ghc-llvm | 43e4c76c9e89b57204b34f7d27e20db0dc27bf47 | df1f7afc1e1be993d9789581876fd7c5bc2cffa7 | refs/heads/master | 2021-03-27T16:33:56.925361 | 2017-06-19T09:40:51 | 2017-06-19T09:40:51 | 88,052,346 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,861 | h | TypeSerializer.h | //===- TypeSerializer.h -----------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
568a5ad7e200411de979501de46763676593ff10 | bf596878b2672d5ecd13b24dfb69485ef73b6717 | /map_globaldata/map_globaldata_appdata.h | 91167f411c26d01b09c3afb88ddf8eb4219af919 | [] | no_license | CHENGPUYUAN/OSGEarth-Demo | 87742f2fb2eb3cb3e0f4988d4d7d9131d49b5c53 | 839755225212e278ba3445809f229c5cc060dfe7 | refs/heads/master | 2023-03-16T02:03:37.104206 | 2020-02-05T02:27:15 | 2020-02-05T02:27:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,834 | h | map_globaldata_appdata.h | #ifndef MAP_GLOBALDATA_APPDATA_H
#define MAP_GLOBALDATA_APPDATA_H
#include <QObject>
#include <osgViewer/View>
#include <osgEarth/MapNode>
#include <osgEarth/SpatialReference>
#include <osgEarthUtil/EarthManipulator>
#include "map_controller/map_controller_mainwindowcontroller.h"
#include "map_controller/map_control... |
b29f0cff0e40e96ec3cadc1cb9a4ad54d09f02be | f5f451c3e1c420789107addacb0da3107685bc4f | /Common/TCMMemory/TCMPoolObject.h | e1194613c489990c6d24fcf422fa9315ac82a8b2 | [] | no_license | cl4nk/TayCaMead-Engine | 4db6089fd7d952f1aecee82378db0c3bad407c99 | 4e6a9281fbaf9b7708db95a95078e97b5aeb2772 | refs/heads/master | 2021-01-01T19:21:17.655499 | 2019-06-11T09:11:39 | 2019-06-11T09:11:39 | 98,566,424 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 975 | h | TCMPoolObject.h | #pragma once
#include "TCMMemory/MemoryDefines.h"
namespace TCM
{
namespace Engine
{
namespace Memory
{
/**
* \brief Base class for every "poolable" object
*/
class MEMORY_ALWAYS_EXPORT TCMPoolObject
{
public:
TCMPoolObject() = default;
virtual ~TCMPoolObject() = default;
/**
... |
1a90495c92d79dbd53a373463630c61f42071d11 | fa63d027a94c97c43b19d5e94a0daf1b82780d0e | /TGEngine/private/graphics/GameGraphicsModule.cpp | 41b8f359d0645cce746b47375f1ede3514da118e | [
"CC-BY-ND-4.0",
"Apache-2.0",
"LicenseRef-scancode-public-domain"
] | permissive | Troblecodings/TGEngine | ef154ede62968a75324c69b722b4300d6b2baa9c | 9e364840b5db3b3d642c2921264e07b5148783f2 | refs/heads/master | 2022-02-09T00:20:52.898615 | 2022-01-04T13:09:11 | 2022-01-04T13:09:11 | 84,971,946 | 11 | 6 | Apache-2.0 | 2021-09-12T10:08:48 | 2017-03-14T16:28:23 | C++ | UTF-8 | C++ | false | false | 17,049 | cpp | GameGraphicsModule.cpp | #include "../../public/graphics/GameGraphicsModule.hpp"
#define TINYGLTF_IMPLEMENTATION
#define STB_IMAGE_IMPLEMENTATION
#define STB_IMAGE_WRITE_IMPLEMENTATION
#include "../../public/Util.hpp"
#include "../../public/graphics/GameShaderModule.hpp"
#include "../../public/graphics/vulkan/VulkanShaderPipe.hpp"
#include ".... |
330e0647366f25d3143b6ab73682cffec073551d | 8635e9e8cde70ce1f55aac7b50d8090add38a163 | /Problems/codeforces/454div2/A.cpp | 4d13f8c545c2f8cf569555d5ceb158f5a9454ed3 | [] | no_license | 99hgz/Algorithms | f0b696f60331ece11e99c93e75eb8a38326ddd96 | a24c22bdee5432925f615aef58949402814473cd | refs/heads/master | 2023-04-14T15:21:58.434225 | 2023-04-03T13:01:04 | 2023-04-03T13:01:04 | 88,978,471 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 962 | cpp | A.cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long ll;
int v1, v2, v3, v4, flag, a[5];
bool check(int i) { return i >= v4 && 2 * v4 >= i; }
bool check2(int i) { return i >= v4 && 2 * v4 < i; }
int main() {
scanf("%d%d%d%d", &v1, &v2, &v3, &v4);
fo... |
d60fd6a448a231991de994171adbab31420092cc | 63a791ef24332bed1ae06da442719ea8a7388aef | /src/sparams.cpp | 5340c2e3937dfa24601a67c3c6a0cb31c9e3ef3f | [] | no_license | sanllier/QGen | c975b1c631d4c04639b5e0482a9d78796b68d337 | 15492c9142b7cfed824669d092bec72e21c75d87 | refs/heads/master | 2021-01-10T22:02:11.592725 | 2015-04-08T10:38:06 | 2015-04-08T10:38:06 | 25,967,884 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,809 | cpp | sparams.cpp | #include "sparams.h"
#include "mpicheck.h"
#include "pugixml.hpp"
#include <vector>
//------------------------------------------------------------
namespace QGen {
//-----------------------------------------------------------
SParams::SParams( MPI_Comm comm/* = MPI_COMM_NULL*/, const char* file/* = 0*/, IFitness* f... |
f9bc6aa96c9f29549efb9fec1862251945fac64a | e40e883292051898726acb1712cf3131977b99b7 | /src/my_sqrt.cpp | 1f38c52ae50305bc8c160714522a6fba2c68acdb | [] | no_license | nathanmccardel/hw2 | 49964f5506e2d06266985adf8ea010820ff535f6 | a240d77ee676a3a3c758e95682e080afbd7027d7 | refs/heads/master | 2021-01-16T00:35:45.113998 | 2016-01-25T00:11:39 | 2016-01-25T00:11:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 195 | cpp | my_sqrt.cpp | #include "eecs230.h"
static const double eps {1e-8};
int main()
try {
// your code goes here
}
catch (runtime_error& e) {
cerr << "runtime error: " << e.what() << '\n';
return 1;
}
|
2043849a05164415b5a4645e7fbc829c8eff52fd | 8e6a9e63d76b8dc298a5dc0b38ac744ebeffe821 | /VehicleSimulation/camera.cpp | ed258fe3bd10d9d93d97969453760ff0ba697dd3 | [] | no_license | MhdAljuboori/Vehicle-Simulation | a023ec5e389253c8289efcb42423f2d175b07cc8 | 574ba381e3f230adc81f70638026743593c3cf96 | refs/heads/master | 2020-05-16T14:29:46.464505 | 2012-05-23T00:21:55 | 2012-05-23T00:21:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,154 | cpp | camera.cpp | #include "camera.h"
#include "math.h"
Camera::Camera(Vector3D pos, Vector3D view)
{
Position = pos;
View = view;
Right = Vector3D (1.0, 0.0, 0.0);
Up = Vector3D (0.0, 1.0, 0.0);
RotatedX = RotatedY = RotatedZ = 0.0;
}
void Camera::Move(Vector3D& Direction)
{
Position = Position + Direction;
}
void Camera::Rota... |
47abbda5a2b6683d209d6440078eed4a74724ad1 | b10720c75f759564b8d214cf6eef9be70ff3894a | /array.cpp | 6194ef398ad966763dd63b5bcb79aeb90f6616a4 | [] | no_license | anonymouskirill/cpp | d6f2e8ccfc5e7232bd4d28dd435d60c169d4766e | 8d59be628f14b5266faace815dd450d495c4c29a | refs/heads/master | 2021-06-04T08:07:09.123721 | 2016-10-04T00:43:43 | 2016-10-04T00:43:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 306 | cpp | array.cpp | #include<iostream>
int factorial(int c)
{
if (c>2)
{
c=c*factorial(c-1);
}
return c;
}
int main()
{
int b;
std::cout << "Please enter an integer: \n";
std::cin >> b;
int a[b];
for (int n=0; n<=b-1; n++)
{
a[n]=factorial(n+1);
}
for (int n=0; n<=b-1; n++)
{
std::cout << a[n] << "\n";
}
return 0;
} |
48a45d9347f14de2540ddf51e1b69bf05e696bb0 | 67401351095c5ed45460c3e47a80806fcc672c41 | /1651-Range Update Queries.cpp | 89b21dfb0bfac38e9cfea808a30147d4675b81b7 | [] | no_license | cwza/cses | 5f3d9feefb04a99a3b68b3da653269ea4fe3f09e | 1923cadc355fcdc28a6d542dc53e4b46e75644e9 | refs/heads/master | 2023-04-03T09:29:23.588680 | 2021-03-29T01:05:48 | 2021-03-29T01:05:48 | 344,027,634 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,101 | cpp | 1651-Range Update Queries.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
/*
Binary Index Tree with Difference Array Concept
*/
// int n, q;
// const int maxN = 2e5;
// // int x[maxN+1];
// ll tree[maxN+2];
// void add(int idx, int delta) {... |
b160332fe7bff0697459d5570e2ef73d239cff29 | 39748c7d5cf45a7c109c33c957c416b8657fdb08 | /FEBioMech/FEDiscreteElementMaterial.h | d480d11e75ce228ccc4840e20ab43187774f1116 | [
"MIT"
] | permissive | febiosoftware/FEBio | 46f895daf2927b320c9f6bcbee4ac2accc598b8b | 9b8d9371af6edba794a308b82424f9bc2eef74e0 | refs/heads/develop | 2023-08-13T12:57:21.134397 | 2023-08-11T18:25:12 | 2023-08-11T18:25:12 | 272,567,637 | 122 | 46 | MIT | 2023-08-07T07:06:01 | 2020-06-15T23:52:36 | C++ | UTF-8 | C++ | false | false | 2,708 | h | FEDiscreteElementMaterial.h | /*This file is part of the FEBio source code and is licensed under the MIT license
listed below.
See Copyright-FEBio.txt for details.
Copyright (c) 2021 University of Utah, The Trustees of Columbia University in
the City of New York, and others.
Permission is hereby granted, free of charge, to any person obtaining a... |
2e2820f9d2816480e7f9b5ea246e3587961b94e8 | c638dc9b72c1a148830639546652e2b6a8fa94da | /src/gfx/gfx.h | f036c14e38d39b54945f40c36c2bbbde730a2d60 | [
"MIT"
] | permissive | ChronosWS/test_games | 133e9c9a38800bc4a49e8d4156d7b6e68f34ed70 | ccb3a83cd4b4b379ec271a2855c5723f1810b56f | refs/heads/master | 2020-12-12T13:46:15.846481 | 2020-01-15T17:51:55 | 2020-01-15T18:02:33 | 234,138,817 | 1 | 0 | MIT | 2020-01-15T17:49:27 | 2020-01-15T17:49:27 | null | UTF-8 | C++ | false | false | 334 | h | gfx.h | #pragma once
#include "math/mat.h"
#include "math/quat.h"
#include "math/vec.h"
#include "math/rect.h"
#include "platform/platform.cc"
// Do our best to keep all graphics related calls in here.
namespace gfx
{
bool Initialize();
void Render();
void PushText(const char* msg, float screen_x, float screen_y);
} // ... |
b91071c91a9e911699ece2b726df68f107067e72 | dfe1f796a54143e5eb8661f3328ad29dbfa072d6 | /psx/_dump_/17/_dump_c_src_/diabpsx/source/objprint.cpp | 2fa7bc73d3597451e0b890201f833cf4bc711bf8 | [
"Unlicense"
] | permissive | diasurgical/scalpel | 0f73ad9be0750ce08eb747edc27aeff7931800cd | 8c631dff3236a70e6952b1f564d0dca8d2f4730f | refs/heads/master | 2021-06-10T18:07:03.533074 | 2020-04-16T04:08:35 | 2020-04-16T04:08:35 | 138,939,330 | 15 | 7 | Unlicense | 2019-08-27T08:45:36 | 2018-06-27T22:30:04 | C | UTF-8 | C++ | false | false | 23,721 | cpp | objprint.cpp | // C:\diabpsx\SOURCE\OBJPRINT.CPP
#include "types.h"
// address: 0x800749F0
// size: 0x28
// line start: 287
// line end: 314
struct POLY_FT4 *DefaultObjPrint__FP12ObjectStructiiP7TextDatiii(struct ObjectStruct *OStr, int ScrX, int ScrY, struct TextDat *ObjDat, int OtPos, int XOffSet, int YOffSet) {
// register: 1... |
cfad0c72402e724c2c386d8a3525b2534dcdfbf5 | a07e8ce8748e1c11dcb2fb4f1d8438759a791c0d | /year2/STRINGS/A_attempt/a/main.cpp | b2b69ccbe18927b68b20131cf43863666ba8a9fa | [] | no_license | celidos/programming-mipt-2015-2017 | 7aef789009cf63dfe415070e6907c634a0b89c7a | cd27a7798f2f50164228b3ab0b7c3015a9c7c049 | refs/heads/master | 2021-06-16T14:22:29.455077 | 2017-05-13T15:33:58 | 2017-05-13T15:33:58 | 91,165,940 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,052 | cpp | main.cpp | #include <bits/stdc++.h>
#define clr(x) memset((x), 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define For(i, st, en) for(int i=(st); i<=(int)(en); i++)
#define Ford(i, st, en) for(int i=(st); i>=(int)(en); i--)
#define forn(i, n) for(int i=0; i<(int)(n); i++)
#define ... |
def72b538a39471beb8138b56cc0ec8994638422 | da297ea32be30cac55d7ba65ad9cd5dbe32b76bb | /apps/sspro4/sspro4_src/sspro/Predict.cxx | 7fc7d85eb4b18334dd503aaaf3cad0d404b2838b | [] | no_license | bjornwallner/ProQ_scripts | e5b03f6c8e997bc65683e5036fd198ee8bd173e7 | 3c0ced2a1d840a6824581cbecb73b9ac6d355a27 | refs/heads/master | 2021-01-18T21:10:27.569130 | 2016-09-20T10:23:55 | 2016-09-20T10:23:55 | 10,240,829 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 2,213 | cxx | Predict.cxx |
#include "Ensemble.h"
#include "Sequence.h"
#include "fstream.h"
/*
Predict the secondary structure for one sequence. Data set file only contains one sequence.
*/
int
main(int argc, char** argv)
{
if (argc!=5)
{
cerr << "Usage: " << argv[0] << " model_definition dataset_file alignment_directory dataset_format\... |
3c0a4e39386c67cd6607e4c9b9e9e3c21f3d38e3 | cd0068a04a706aa902947d5f1233a7f07bec150c | /CPP/namespace/set1/namespace2.cpp | 88c152eecdab6f2e77c374f76a0cf0c8a1938b53 | [] | no_license | eLtronicsVilla/Miscellaneous | b0c579347faad12cee64408c2a112b33b38a6201 | e83f44af985faad93336c1307aeae8694905c3e3 | refs/heads/master | 2021-11-28T04:22:08.278055 | 2021-08-14T19:53:29 | 2021-08-14T19:53:29 | 161,993,103 | 0 | 0 | null | 2021-08-14T19:53:29 | 2018-12-16T11:11:10 | C++ | UTF-8 | C++ | false | false | 433 | cpp | namespace2.cpp | // using namespace we can create two variable or member function with the same name scope.
// more than one variable are used without reporting any error because they are declared in different namespace.
#include <iostream>
using namespace std;
// variable created inside namespace
namespace one
{
int val = 500;
}
... |
5a17cb4516bc9d34e34f2ff9d972cdce3d3ba4d8 | c27c16841fc89922a18b71671677a01476a8f061 | /memorypool/palloc.h | 0c5805e55eac96d6080c335447f8b979f2f36bb8 | [] | no_license | wangzhengyang/TreasureChest | 389b8ede43e59254283276c2854db1c0a6445fbc | 737bd84f49ac246ddfde30b22cce8d43acf359a1 | refs/heads/master | 2023-02-11T09:14:17.338661 | 2021-01-07T07:20:32 | 2021-01-07T07:20:32 | 258,927,349 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 766 | h | palloc.h | #ifndef _PALLOC_H
#define _PALLOC_H
#include "alloc.h"
class palloc{
private:
enum{ _ALIGN = 8 };
enum{ _MAX_BYTES = 128 };
enum{ _NFREELISTS = 16 };
union Obj{
union Obj *free_list_link;
char data[1];
};
static Obj* volatile free_list[_NFREELISTS];
static char *start_... |
7b1a88779e2758a9de87b493f822c9c12a92d29a | 2a7e77565c33e6b5d92ce6702b4a5fd96f80d7d0 | /fuzzedpackages/RiemBase/inst/include/manifolds/riem_04stiefel.h | e167826ee5c0b37fb01005c3614973a24d3ae6f4 | [] | no_license | akhikolla/testpackages | 62ccaeed866e2194652b65e7360987b3b20df7e7 | 01259c3543febc89955ea5b79f3a08d3afe57e95 | refs/heads/master | 2023-02-18T03:50:28.288006 | 2021-01-18T13:23:32 | 2021-01-18T13:23:32 | 329,981,898 | 7 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,233 | h | riem_04stiefel.h | #ifndef RIEM_04STIEFEL_H
#define RIEM_04STIEFEL_H
#define ARMA_NO_DEBUG
// [[Rcpp::depends(RcppArmadillo)]]
#include <RcppArmadillo.h>
using namespace arma;
// 01. dim(x)
inline int stiefel_dim(arma::mat x){
int n = x.n_rows;
int p = x.n_cols;
int output = ((n*p)-(p*(p+1)/2));
return(output);
}
// 02. inne... |
b1d8c7bcfabf868bb44d078c58c87294c4855bdb | deb3b26388ff579425d23235230cec1517e25d81 | /LeastCommonAncestors.cpp | da8893a9f9521500dc785973a73208444b32a708 | [] | no_license | GauravHokai/DS-Algo | b84232d5e6c03a81bf62afa8dea9f80aa6e2dd4b | bc7339127f8055fe633df6f7ba01527c69af59ff | refs/heads/master | 2020-12-22T12:34:19.413755 | 2020-06-16T15:47:13 | 2020-06-16T15:47:13 | 236,782,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,029 | cpp | LeastCommonAncestors.cpp | /**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
void search(TreeNode *A,int B, bool &flag)
{
if(A==NULL) return;
if(A->val==B)
{
flag = true;
return;
... |
65740612ec0bf321e2a8bdf4fff482bd48aeceb1 | fcedd7f4aad518c16c528ad082e7a37d6b346434 | /winpcapTest/gpsExample_thread_ip.cpp | c3a0cd0a79e9e2cd2fb99fe1e162c59777e54f10 | [] | no_license | qoo/winpcapTest-GPS-only | 09950139126462ee34e504ea8262921f860ed1eb | d234f5e39bc60782a40469ceece9ebdd64c03bb7 | refs/heads/master | 2021-07-01T00:03:11.263497 | 2017-09-19T20:02:41 | 2017-09-19T20:02:41 | 104,223,917 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,016 | cpp | gpsExample_thread_ip.cpp | /*
Adept MobileRobots Robotics Interface for Applications (ARIA)
Copyright (C) 2004-2005 ActivMedia Robotics LLC
Copyright (C) 2006-2010 MobileRobots Inc.
Copyright (C) 2011-2015 Adept Technology, Inc.
Copyright (C) 2016 Omron Adept Technologies, Inc.
This program is free software; you can redistribute it and/or modif... |
dd16d2bd0d235454ea449a2ba01832bbe6855f06 | 8a3649b3fd343b85fa5e1a64c4e6261d3c0a2fe3 | /on_tap_thi_cuoi_ki/1.1.14.cpp | 3650b0fadece06eec2e3458386350a52ba05ee4c | [] | no_license | azaharbarbie/Bai_tapC | 3c58405185e63b37f928eab46ca7e645a0a42779 | 59cdf98807c2971ec7fe8297b5a0bf84693d4bfd | refs/heads/main | 2023-07-13T02:40:11.528098 | 2021-08-20T15:22:47 | 2021-08-20T15:22:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 591 | cpp | 1.1.14.cpp | #include<iostream>
#include<math.h>
using namespace std;
bool kt1(int a, int k)// kiem tra co k chu so hay khong
{
if(a>=pow(10,k-1) && a<=(pow(10,k)-1)) return 1;
return 0;
}
bool kt2(int a)// kiem tra so nguyen to
{
if(a<2) return 0;
for(int i=2;i<=sqrt(a);i++){
if(a%i==0) return 0;
}
return 1;
}
bo... |
932ec1b1cc564f78ddfe5845793c19eda154c542 | 1f13efa14eddb3def86759e51197465cd17225ba | /L1-039/L1-039.cpp | 4d63147a57508e46db2d8d4efe7ff5359b9026f1 | [
"MIT"
] | permissive | codexvn/PTA | d4b131f5e9f582ef9ec6ec9434f96644a4fa57f4 | f258c312565643d9a15a45f8f7bbc6811cff4019 | refs/heads/master | 2021-06-25T01:44:02.159428 | 2021-04-22T02:57:51 | 2021-04-22T02:57:51 | 221,205,341 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 476 | cpp | L1-039.cpp | #include <iostream>
#include<vector>
using namespace std;
int main()
{
int N;
cin >> N >> ws;
vector<char>* str;
str = new vector<char>[N];
char get = 0;
while (true)
{
for (int i = 0; i < N; i++)
{
cin.get(get);
if (get == '\n')
goto out_loop;
str[i].push_back(get);
}
}
out_loop:
for (int i... |
3f56bc300f981b35cd3e8183ff6d495cfeb589be | aa804932a697ab16ad1463f4f68702c7f1c176d8 | /Chapter 5/EngineTest/EngineTest/Source/Core/M5ArcheTypes.h | 6feba9a267e8ad97d63590172f241db1db98481d | [
"MIT"
] | permissive | PacktPublishing/Game-Development-Patterns-and-Best-Practices | ab78d635d4942468a658a89d30ffd6a5d81249ce | 5fabb45cb4e509472a71f6d72e63eafe4a89de66 | refs/heads/master | 2023-01-27T22:25:20.453578 | 2023-01-18T10:00:02 | 2023-01-18T10:00:02 | 88,573,350 | 21 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,127 | h | M5ArcheTypes.h | /******************************************************************************/
/*!
\file M5ArcheTypes.h
\author UserPreBuild.bat
\par email: lazersquad\@gmail.com
\par Mach5 Game Engine
This file gets auto generated based on the names of the ArcheTypes in the
current project. UserPreBuild.bat looks ... |
ac8a0bf8cea3186381ad78c2edceed829ffdc844 | 0a69cd1aabc62c1ed58d316f46da69ed0f18ff78 | /src/include/HdPoseNode.h | c4b7f6bc9a4d62a94d10eba5fb341b055f56acaf | [
"MIT"
] | permissive | jonntd/hyperdrive | b25f396777bdf2aac38582afae4f7a38235c45a5 | f542dd4c2c76ad6a6550fae8f277fd33d0316bdd | refs/heads/master | 2020-06-18T03:05:31.023812 | 2019-04-29T20:27:57 | 2019-04-29T20:27:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,172 | h | HdPoseNode.h | /* * -----------------------------------------------------------------------------
* This source file has been developed within the scope of the
* Technical Director course at Filmakademie Baden-Wuerttemberg.
* http://technicaldirector.de
*
* Written by Tim Lehr
* Copyright (c) 2019 Animationsinstitut of Filmakad... |
27fefc87945dfcd4527169635560cb6a61c91e58 | b4330417dd1590cf7ea3484c4dda20a0ecfee3b4 | /Online_judge/poj/poj_3244.cpp | d28ccf5ab302bfb2bc124fd041dd89c5a9443cf2 | [] | no_license | Q10Viking/ACM_ICPC | d2b2c69e451a4e8de2fafdf346797900c61e65ee | d3d6547313a4400ed9c3eef1339a79466ffa5d97 | refs/heads/master | 2021-01-01T17:26:04.629801 | 2014-07-03T06:54:15 | 2014-07-03T06:54:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,612 | cpp | poj_3244.cpp | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <cstring>
#include <cmath>
#define error {puts("-1");return 0;}
#define mp(a,b) make_pair(a , b)
#define mpp(a,b,c) mp(mp(a,b),c)
#define HASH 1000000007
using namespace std;
typedef long long LL... |
e2ba039013c06584c77f0c222ff8030b8702d6ee | 520fc6eb972594a707424cebfb6b32210db2e5e4 | /src/phenotype.hpp | 3c53e89732e41c1797f13180b0eadf931099c2a8 | [
"MIT"
] | permissive | adamd1008/gaxx | 17172aa38f3ed453adc969b625b72bb3d93c7a67 | 6c35d72ba6d690ea4c06f703d55d3abd3737a76a | refs/heads/master | 2021-06-24T03:26:51.407921 | 2021-01-03T20:20:06 | 2021-01-03T20:20:06 | 185,960,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,211 | hpp | phenotype.hpp | #ifndef __PHENOTYPE_HPP__
#define __PHENOTYPE_HPP__
/*
* Phenotype describes the individual in the population. The phenotype has a
* genotype (chromosomes).
*/
#include "genotype.hpp"
namespace gaxx
{
/**
* TFT - target fitness type, i.e. the type of the variable passed into
* calcFitness() to... |
e49c005cca18b926d768552edcdcf644e07aeee8 | a55b25054e7a59d9f37b039b38be9988058c17f7 | /src/ABActor.h | eb5f936d92bdc162b73076e6299b9db6ed3de2b5 | [] | no_license | sv-91/coro_async | 8ed942945c5c65656364dc5ec10b94aed7d739e7 | 4f5f49ea850294b540056519defd64b480dc2eac | refs/heads/master | 2022-04-19T17:26:05.482648 | 2020-03-25T08:38:04 | 2020-03-25T08:38:04 | 249,925,910 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,483 | h | ABActor.h | #ifndef COROUTINES_ABACTOR_H
#define COROUTINES_ABACTOR_H
#include "Actors/Actor.h"
#include "Actors/Callback.h"
#include "Coroutine/ActorAwaiter.h"
#include "Coroutine/CoroTask.h"
class ABActor: public Actor {
public:
using GetACallback = Callback<void(int result)>;
using GetBCallback = Callback<void(int ... |
f55559554fdf071617102c91476124b486864746 | 31f81380b60850e14b14f3a847cecd9daedacd92 | /src/utils/inducers/path_inducer.cpp | 7ca8ed710524565ca3928b1ffaf9b1b7484f76e2 | [] | no_license | lizgorb/GraphExaminer | fa7216abf785b81eeeaf04ebb14f03dcfac0faae | 8761355bdcf3221c20db4a76762e7ed8b428f44c | refs/heads/master | 2022-02-01T07:55:05.284137 | 2018-05-24T12:53:47 | 2018-05-24T12:53:47 | 115,273,605 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,970 | cpp | path_inducer.cpp | /*
* path_inducer.cpp
*
* Created on: Feb 25, 2018
* Author: liz
*/
#include "path_inducer.h"
#include <boost/graph/adjacency_list.hpp>
using namespace boost;
template <typename Graph>
PathInducer<Graph>::PathInducer(int n) {
path_size = n;
}
template <typename Graph>
bool PathInducer<Graph>::IsInduced... |
547107326e60e0dbb33129a937380983c455ded1 | c8f257630aaae015576d3e0a6c62686f30bc57bf | /easy/array/Minimum steps to make product equal to one.cpp | ce8f51ceb3886871f75f0a4d23569089549a3f3c | [] | no_license | hamza-badar/gfg_problems | d08172a20f9be8ff5ae2c7c6e70cca3b89c7e015 | f7d7bbd04ffe5ddc9b82e92d620eb4b5319f9bd5 | refs/heads/master | 2023-05-09T04:40:32.383236 | 2021-06-03T17:28:17 | 2021-06-03T17:28:17 | 364,642,749 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 750 | cpp | Minimum steps to make product equal to one.cpp | class Solution {
public:
int makeProductOne(int arr[], int N) {
int step=0;
int negNo=0;
int noZero=0;
for(int i=0;i<N;i++)
{
if(arr[i]<0)
{
step=step+(-1-arr[i]);
negNo++;
}
else if(arr[i]==0)
... |
6068dd9e6e0ea28677e78fb3d77c2cd428e1ab90 | 1fac990457241ca8406e1ee2ba1e3399ca20b355 | /devtool/u3asm/main.cc | 661251e04ff3ba2c9967e85f0763716bb38ddafe | [
"BSD-2-Clause"
] | permissive | ekscrypto/Unununium | 4861ad1f2a7bb258241d4adf84cf6205b54a5c3a | 4b67e7c5e63cf1be2157382ffd4c1e9d12957a1f | refs/heads/master | 2020-04-26T11:27:42.209268 | 2019-03-03T01:56:22 | 2019-03-03T01:56:22 | 1,208,417 | 9 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,656 | cc | main.cc | /*
* U3ASM
* $Header: /cvsroot/uuu/devtool/u3asm/main.cc,v 2.6 2003/06/18 04:18:32 daboy Exp $
* Copyright 2003 by Phil Frost; see file "License".
*/
/** \file main.cc
*
* definition of \c main(). */
#include "assembler.h"
#include <iostream>
Mem_stats mem_stats;
int main( int argc, char *argv[] )
{
... |
f3eb183376f6c479111ada7447cba104bd1f81fc | fed4fe8b87ce968e854e3ba656bae05e2d54d2a1 | /c/算法/p34-15.cpp | 11cf0ce8fffa030378a0b883c55fc1bfd62920b6 | [] | no_license | jingdongHe/my-code | fabc8901523a20d2150396a91e2892fb9b88a097 | 2c25580253a8536eb91d8e9394d49e698304f0ad | refs/heads/master | 2020-03-23T14:15:23.457597 | 2018-07-20T05:22:00 | 2018-07-20T05:22:00 | 141,665,641 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,752 | cpp | p34-15.cpp | #include<stdio.h>
#include<stdlib.h>
typedef struct node {
int point;
struct node *next;
}node;
int po[1000];
int pr[1000];
node w[1000];
int n,s,k,q;
bool visit(int d)
{
node *p;
p=&w[d];
p=p->next;
while(p!=NULL)
{
if(po[p->point]==0)
return true;
p=p->next;
}
return false;
}
void DFS(int d,int k1)
{
... |
5df0c36330262e2af36ae375f41d5ed51bb161d6 | f4f60b0aff487461d64873b2b690fbd9d67c6ad0 | /include/containos/ptr.h | 8706be169ef333957b346cb9525aa0ca00dc9179 | [
"MIT"
] | permissive | napina/containos | eb2dcdc489d96ee098403a7ae3f6d9e6bf872cf0 | 9be97e2f768ffdbed1ec9f893b31c3c63b3ce81a | refs/heads/master | 2020-12-24T08:23:17.671663 | 2016-10-30T06:50:06 | 2016-10-30T06:50:06 | 7,767,992 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,198 | h | ptr.h | /*=============================================================================
Copyright (c) 2013 Ville Ruusutie
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including wi... |
6148979fd9d7408d3c663df50368511533747352 | 38b9daafe39f937b39eefc30501939fd47f7e668 | /tutorials/2WayCouplingOceanWave3D/basicTutorialwtProbesResultsWtPhiCoupled_180625/13.4/phi | 27d8fd9ff8bd1bda2b2932c5120310369fa3951c | [] | no_license | rubynuaa/2-way-coupling | 3a292840d9f56255f38c5e31c6b30fcb52d9e1cf | a820b57dd2cac1170b937f8411bc861392d8fbaa | refs/heads/master | 2020-04-08T18:49:53.047796 | 2018-08-29T14:22:18 | 2018-08-29T14:22:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 530,635 | phi | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.1 |
... | |
9e5d841b8d110a1c05e77c06cb528f632f4bf762 | 53bea944a71aa50fea6a1980b82a7572ecb9d885 | /Timber/timber.cpp | 0b635a7cceb33add0f8f4ca62539aab068a839cb | [] | no_license | alleboudy/practicingcpp | 6e5b59ddfa701eaa78f0fe749326601801fef6de | 1df16cc2cd0f3da94f896c7dd80cb5b9d356b835 | refs/heads/master | 2021-04-18T19:18:34.483734 | 2018-03-28T14:53:15 | 2018-03-28T14:53:15 | 126,491,229 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,575 | cpp | timber.cpp | // hellosfml.cpp : Defines the entry point for the console application.
#include "stdafx.h"
#include <SFML/Graphics.hpp>
#include <sstream>
#include<SFML/Audio.hpp>
using namespace sf;
void updateBranches(int seed);
const int NUM_BRANCHES=6;
Sprite branches[NUM_BRANCHES];
enum class Side {LEFT,RIGHT,NONE... |
8066611907599c3bb37a42acab36a09865d248b4 | 299b377022f52b20e3c9696950da9007e9b078a4 | /src/blas_like/level3/Trsm/RLT.hpp | 1166cc030e980336075b1c2f449f247a130991ad | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | sg0/Elemental | 43cba65d001de299167363c349127cf8c23f7403 | 614f02509690449b553451e36bc78e7e132ea517 | refs/heads/master | 2021-01-15T09:33:56.394836 | 2016-02-29T18:25:53 | 2016-02-29T18:25:53 | 19,929,637 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,461 | hpp | RLT.hpp | /*
Copyright (c) 2009-2015, Jack Poulson
All rights reserved.
This file is part of Elemental and is under the BSD 2-Clause License,
which can be found in the LICENSE file in the root directory, or at
http://opensource.org/licenses/BSD-2-Clause
*/
namespace El {
namespace trsm {
// Right Lower (Conju... |
825b14e7de6e9402d12292a42126cbd41c69774a | 20a5975e1ffe7d03a84b404af87bda6638ba7c18 | /allCodes/3.Takrorlanuvchi jarayonlar(41-79)/example-46/index.cpp | 31dbb6a31ddb03920a4a03c7f43c723f0b09ef13 | [] | no_license | qobulovasror/c-da-oddiy-dasturlar | 8442c6d0ae175048ea17d444ee01632dffef4951 | d7a413e18cdea0973dd36ef1d7a5b8aedea0a802 | refs/heads/main | 2023-02-18T19:56:20.513970 | 2023-02-08T11:39:25 | 2023-02-08T11:39:25 | 324,215,466 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 230 | cpp | index.cpp | // 46. 10 dan 40 gacha bo’lgan barcha butun sonlarning kvadratlarini chop etuvchi dastur tuzing
#include <iostream>
using namespace std;
int main()
{ float i,s=0;
for(i=10;i<40;i++)
{s=i*i;cout<<s<<endl;
}return 0;}
|
3a4e9b0f74a71d7bd2c2d57714777def0a96673b | b269392cc4727b226e15b3f08e9efb41a7f4b048 | /CodeForces/CodeForces 2A.cpp | 9271c46fc77ef7ad9f35a5a7f7b95beebc676e20 | [] | no_license | ThoseBygones/ACM_Code | edbc31b95077e75d3b17277d843cc24b6223cc0c | 2e8afd599b8065ae52b925653f6ea79c51a1818f | refs/heads/master | 2022-11-12T08:23:55.232349 | 2022-10-30T14:17:23 | 2022-10-30T14:17:23 | 91,112,483 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,053 | cpp | CodeForces 2A.cpp | #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct player
{
string name;
int score;
} sum[1005],temp[1005],fin[1005];
int main()
{
int i,j,k,n,cnt=0;
cin >> n;
for(i=0,k=0; i<n; i++,k++)
{
sum[k].score=0;
cin >> temp[i].name >> temp[i].score;
... |
798ff179a170e974a8accb9e1d272b4c5aab93cf | 71ff6e960a3acbfe4cfa2c275a727e6456161b59 | /LetterCounter.cpp | 600bf83428ac4500c5aad63a0a8d8edc062e8bb2 | [] | no_license | rodgerthat/CSCI_3080_LetterCounter | 244be9f88c246209afbef7109ff38533cfd49bd0 | 88af12162e792f46831595b3ba4143b66f7b6b2e | refs/heads/master | 2021-01-22T19:40:51.634864 | 2017-03-20T00:30:40 | 2017-03-20T00:30:40 | 85,223,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 667 | cpp | LetterCounter.cpp | // LetterCounter.cpp : Count the frequency of a letter in an array of chars
#include <iostream>
using namespace::std;
int main()
{
int x[26] = { 0 };
int i;
char c;
cout << "start typing. hit enter to get results" << endl;
while ((c = cin.get()) != '\n') {
++x[c - 'a'];
}
for (i = 0; i... |
1dea8c869a62b7bd4f9db256a1377e1c5e823fae | f96f9244a9e1e4711c27c6d969e513999c4e84a5 | /middleware/buffer/sample/client/source/octet.cpp | c7ec49bd10f7566d2919b7f2371bcfb0ffd36d86 | [
"MIT"
] | permissive | casualcore/casual | 88965684f908a46dcc998238aa78726e0143bb05 | 7311cc481f3b823d0c86fc09171fbd17e3c39fc1 | refs/heads/feature/1.7/main | 2023-09-04T01:22:09.633159 | 2023-07-07T15:33:29 | 2023-07-18T08:48:49 | 477,282,028 | 14 | 4 | MIT | 2023-09-14T07:52:38 | 2022-04-03T08:34:20 | C++ | UTF-8 | C++ | false | false | 925 | cpp | octet.cpp | //!
//! Copyright (c) 2015, The casual project
//!
//! This software is licensed under the MIT license, https://opensource.org/licenses/MIT
//!
/*
* Disclaimer: This might not be a valid C-function
*
* Disclaimer: A lot of error handling is missing
*/
#include "xatmi.h"
#include "casual/buffer/octet.h"
#incl... |
0111e87745d5dba117d11a8e1754525bd8f4b1a3 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir7942/dir8062/dir8063/dir8254/dir8444/dir8720/dir11459/file11520.cpp | e760fc322ab6ed9d4e151304f83a21f6ee8aa2d8 | [] | no_license | tgeng/HugeProject | 829c3bdfb7cbaf57727c41263212d4a67e3eb93d | 4488d3b765e8827636ce5e878baacdf388710ef2 | refs/heads/master | 2022-08-21T16:58:54.161627 | 2020-05-28T01:54:03 | 2020-05-28T01:54:03 | 267,468,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 115 | cpp | file11520.cpp | #ifndef file11520
#error "macro file11520 must be defined"
#endif
static const char* file11520String = "file11520"; |
0dff2a9ac7abd4d9e2ec963f6ecfba27c5ad75c8 | c20714631fd345f86ab4babcbd98fd0fd7082e5f | /GLRender/GLRender/src/Model.h | 931b2849a755b9d8a1429fade3f2c6bfee100b25 | [] | no_license | kvanderlaag/OpenGLRenderer | b25e62881af6e52304ee16e860324f5bd6e76806 | 8ed883d975241d0e5bd96452ec8e8ae2c5159bb0 | refs/heads/master | 2023-07-07T14:05:34.948634 | 2023-06-29T20:10:53 | 2023-06-29T20:10:53 | 59,981,332 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,517 | h | Model.h | #pragma once
#include <Windows.h>
#include <GL/glew.h>
#include <GL/GL.h>
#include <GL/GLU.h>
#include "glm/glm.hpp"
#include "glm/gtc/matrix_transform.hpp"
#include "glm/gtc/type_ptr.hpp"
#include "SOIL.h"
#include "tiny_obj_loader.h"
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
struct ... |
9bc33b06bca16e612f465b83ad94f734a46f9d5b | 76cc7f092b553aa01ca5db30107a6bb38a6f5f4e | /C++Project/LoanControl.cpp | 2e8b73dba3d91bb554384abb4a5fd5cad2510f3b | [] | no_license | AlexcityU/C-Project | c8c846b06ea59aaa17b89be4bec8884e5e2532d5 | b7ac20aae9d05813c627cb0c46aa96d28f30b5d7 | refs/heads/master | 2020-05-04T00:21:28.396402 | 2019-04-16T14:19:58 | 2019-04-16T14:19:58 | 178,882,714 | 1 | 1 | null | 2019-04-16T09:14:47 | 2019-04-01T14:36:59 | C++ | UTF-8 | C++ | false | false | 4,642 | cpp | LoanControl.cpp | #include "LoanControl.h"
User ** LoanControl::retrieveUsers()
{
string str = readFile("user.txt");
if (str.empty())
return false;
stringstream ss(str);
string token;
// count the number of line inside the user.txt
int u = 0;
while (getline(ss, token)) {
if (!token.empty())
u++;
}
// reset the defa... |
9a14e0fd002794c99c7cf6e460fbf912889d2c56 | 1b80722ec75e2b5f62104daacc6a8234f937b283 | /SuperMyrio_src/Reward.cpp | 471236aafb80b4132c3d5eb024d898f2a7defd43 | [] | no_license | YaJinK/Super-Myrio | a4e0bfccc95bc1f5379cb2d327f50a799f8c2a40 | 8266e840cc0d8a114d8912d3ae06c94da7e82b40 | refs/heads/master | 2020-06-21T04:19:03.249685 | 2016-11-26T09:47:27 | 2016-11-26T09:47:27 | 74,805,899 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,649 | cpp | Reward.cpp | #include "Reward.h"
Reward::Reward(LPDIRECT3DDEVICE9 pD3DDevice, char * fileName, float srcWidth, float srcHeight, float x, float y, short currentFrame) : GameResource(pD3DDevice, fileName, srcWidth, srcHeight, x, y)
{
m_CurrentFrame = currentFrame;
m_Status = REWARD_HIDE;
short vector = rand() % 2;
if (vector == ... |
edf41ed1d1bdf03e770a0e314d6c030ad780e975 | d5e082cd714abd15be80bdfe69163d47246aa32c | /sequential/clp/tsp_clp_old.cpp | 77efb3c610684bf43dcd63eb51c977c6a5d7a15d | [] | no_license | xwang182/CS598Parallel | 679c4244e0d7927d263e3d5ec62d2457181012fc | 50f0f534bf73ca437c11cda66372f7a95922d87b | refs/heads/master | 2021-05-03T10:51:09.936529 | 2016-12-18T07:20:55 | 2016-12-18T07:20:55 | 69,373,775 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 12,408 | cpp | tsp_clp_old.cpp | // Example of using COIN-OR OSI, building the instance internally
// with sparse matrix object
#include <iostream>
#include "OsiClpSolverInterface.hpp"
#include "CoinPackedMatrix.hpp"
#include "CoinPackedVector.hpp"
#include <vector>
#include <queue>
#include <set>
#include <cassert>
#include <cstdlib>
#include <cmat... |
a2010ecbb40b07144b23288e2b81b7c6cf97ff25 | 678ab5259f2f17a3b7577c4681b081127608ca6a | /Activity 14 One-dimensional arrays.cpp | 76226e06b91b47f097a1762c3fc8eee2bf8cc531 | [] | no_license | estultz22/CISP-360 | 87557ed824db32a3afc6338baaeed7a9e2e27745 | d5e1f6b8823d09d69cc3607c575beaafb447faff | refs/heads/master | 2020-08-16T05:59:02.953996 | 2019-12-22T01:18:36 | 2019-12-22T01:18:36 | 215,464,957 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,228 | cpp | Activity 14 One-dimensional arrays.cpp | #include <iostream>
using std::cout;
using std::cin;
using std::endl;
void getInput(int [], int);
void mode(int [], int, int&);
int main()
{
int arraySize, modeNum = 0;
cout << "Enter how many numbers you want tested: ";
cin >> arraySize;
cout << endl;
int numArray[arraySize] = {0};
ge... |
0690b845b38037f4b88b663ce51068390cc01910 | 0a60f0778f9f64430278ccdb599eb169d4ca4154 | /include/DBoW2/FCNN.h | e3761f68d3c5ad61dc754350057344a9079278d3 | [
"BSD-2-Clause"
] | permissive | ahmorsi/DBoW2 | 0597c579c1db3f37eccb33b65fab476f2935f19d | 41023240d8f6e120d50a32dc2f8d7f493d0e9ee1 | refs/heads/master | 2021-01-01T04:47:08.752529 | 2018-01-10T16:27:40 | 2018-01-10T16:27:40 | 97,243,809 | 0 | 0 | null | 2017-07-14T14:43:06 | 2017-07-14T14:43:06 | null | UTF-8 | C++ | false | false | 1,600 | h | FCNN.h | #ifndef FCNN_H
#define FCNN_H
#include "FClass.h"
namespace DBoW2 {
class FCNN : protected FClass
{
public:
/// Descriptor type
typedef std::vector<double> TDescriptor;
/// Pointer to a single descriptor
typedef const TDescriptor *pDescriptor;
/// Descriptor length
static const int L = 256;//... |
68ea65d2a859150c28cec6be7825ff14b9943a6f | 03b5b626962b6c62fc3215154b44bbc663a44cf6 | /src/instruction/FDIVP.h | 0624d894b8bce50b913f55c221864137fec6cc48 | [] | no_license | haochenprophet/iwant | 8b1f9df8ee428148549253ce1c5d821ece0a4b4c | 1c9bd95280216ee8cd7892a10a7355f03d77d340 | refs/heads/master | 2023-06-09T11:10:27.232304 | 2023-05-31T02:41:18 | 2023-05-31T02:41:18 | 67,756,957 | 17 | 5 | null | 2018-08-11T16:37:37 | 2016-09-09T02:08:46 | C++ | UTF-8 | C++ | false | false | 215 | h | FDIVP.h | #ifndef FDIVP_H
#define FDIVP_H
#include "../object.h"
namespace n_FDIVP {
class CFDIVP :public Object
{
public:
CFDIVP();
~CFDIVP();
int my_init(void *p=nullptr);
};
}
using namespace n_FDIVP;
#endif
|
c17ec203b7fdf955add75abc8000c657fbcc6266 | d32f5552b7fd679f4d3fd3ccf6f8b4fb0247bb9f | /viewer/Saba/Viewer/ModelDrawer.h | 461dc9354cdeadf3c7b1102ce9746fa86b91739e | [
"MIT"
] | permissive | benikabocha/saba | 62f442e0f3ea8c47dfc3c5180367e69f077c3978 | fa2ea89b1e2108271591c8bcdfcff8fb32e7f528 | refs/heads/master | 2023-05-14T06:28:56.784898 | 2023-05-08T13:51:55 | 2023-05-08T13:51:55 | 78,288,889 | 406 | 77 | MIT | 2023-05-07T22:38:41 | 2017-01-07T16:08:14 | C++ | UTF-8 | C++ | false | false | 1,861 | h | ModelDrawer.h | //
// Copyright(c) 2016-2017 benikabocha.
// Distributed under the MIT License (http://opensource.org/licenses/MIT)
//
#ifndef SABA_VIEWER_MODELDRAWER_H_
#define SABA_VIEWER_MODELDRAWER_H_
#include "ViewerContext.h"
namespace saba
{
enum class ModelDrawerType
{
OBJModelDrawer,
MMDModelDrawer,
XFileModelDraw... |
4dcc21d45c6c928a5e00ef7845ba9da971aeb743 | d9ee600433df4bd055cb824168f3914ff01034d4 | /6.2.cpp | f13b657b24db05adb18bc27c33862d79ad9aeab8 | [] | no_license | mhcoderwl/leetcode | 6f756aea274ef385b23b5fe5725e5cac45ba45c9 | 6b4d89b1b989ac0328a6b709edd3a9e583282509 | refs/heads/master | 2021-01-19T22:04:36.070696 | 2017-05-18T11:30:24 | 2017-05-18T11:30:24 | 88,744,875 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 775 | cpp | 6.2.cpp | //给两个有序链表,归并//
#include<iostream>
using namespace std;
struct ListNode{
int val;
ListNode* next;
ListNode(int x):val(x),next(NULL){}
};
class Solution{
public:
ListNode* mergeTwoList(ListNode* head1,ListNode* head2){
ListNode dummy(-1);
ListNode* cur;
ListNode* l1=head1;
ListNode* l2=head2;
for(cur=&dumm... |
b7c4a382a10b67060e29cd476b2436f1d0c229aa | 025e62fa2ffae19aaf415a3288f2dcd20de288a3 | /array/28.cpp | b7614829fa8cdaddfeaa14287ae08aab75a74578 | [] | no_license | kjy-robin/leetcode | 6acf202e3301670dec794cfcbeca272ace655d25 | d95e611efafa0a896148bec0e8feecfc76863899 | refs/heads/main | 2023-04-16T13:37:02.557722 | 2021-04-29T12:52:16 | 2021-04-29T12:52:16 | 355,017,455 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,701 | cpp | 28.cpp | // *** 两数相除 ***
#include <iostream>
#include <vector>
#include <string>
using namespace std;
// Definition for a binary tree node.
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullp... |
ab51a0b2d9755af734b759c746bb98a79394e447 | 607829232b9ec8d6733fb67be85e8555d19e1ee0 | /libs/core/include/fcppt/algorithm/array_init_move.hpp | 4d321329886dd7ce90b3b5c2a12828dcde16598d | [
"BSL-1.0"
] | permissive | cnsuhao/fcppt | 3b917196d5faf477d769b8f04e0001361a857776 | 104c035118a04011c5fd9574cc78b2889550ea65 | refs/heads/master | 2021-01-13T06:30:29.527419 | 2016-11-05T13:33:41 | 2016-11-05T13:33:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,231 | hpp | array_init_move.hpp | // Copyright Carl Philipp Reh 2009 - 2016.
// 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 FCPPT_ALGORITHM_ARRAY_INIT_MOVE_HPP_INCLUDED
#define FCPPT_ALGORITHM_ARRAY_INIT_MOVE_HPP_I... |
52ee092ff82ba1294dbd5b6986b8dad719c4a90b | 5a1876836b8014111363eaf52120fc5e05dd40d2 | /2012 ACM-ICPC World Finals/I.cpp | 4b3bdd560c61f6f022397175e96a15576855feef | [] | no_license | wcysai/Continued-Story | afb197ef8393882595a7a0579e3a11026dd8ecca | e7845f9c65e8eb837ab6f923676851e06453681d | refs/heads/main | 2023-06-18T00:58:25.364645 | 2021-07-14T07:35:27 | 2021-07-14T07:35:27 | 301,825,686 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,905 | cpp | I.cpp | #include<bits/stdc++.h>
#define maxn 1000005
using namespace std;
int r,c,m,n,cas;
set<int> R[maxn],C[maxn];
map<pair<int,int>,int> tp;
struct Line
{
int x,y,xx,yy;
Line(int x=0,int y=0,int xx=0,int yy=0):x(x),y(y),xx(xx),yy(yy){}
};
vector<Line> g;
//dir:0 right,1:down,2:left,3:up
bool go1()
{
int x=1,y=0,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.