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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
e1f04095e61c5cb215d2dc48baab41f1c2368fc4 | 6247051fc105ee0f7847c9ad7d64e6dd22e2e5e2 | /codeforces/701-B/701-B-19438425.cpp | 2f138208111291ba0ae6f5c8153c72052556f7df | [] | no_license | satishrdd/comp-coding | 5aa01c79bd1269287f588a064d5d09f824daa8fd | 96d22817488d55623d77a2e7f3d4ef0955028086 | refs/heads/master | 2020-04-07T06:50:53.743622 | 2017-04-16T09:05:25 | 2017-04-16T09:05:25 | 46,654,615 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 490 | cpp | 701-B-19438425.cpp | #include<iostream>
#include<cstring>
#include<stdio.h>
#include<set>
using namespace std;
int main(int argc, char const *argv[])
{
/* code */
long long m,n;
cin>>n>>m;
long long res =n*n;
bool l1[n+1];
bool l2[n+1];
memset(l1,0,sizeof(l1));
memset(l2,0,sizeof(l2));
long long a =n,b=n;
while(m--){
long long x,y... |
11654f22f0d22983f4f10728f6b2690b7770c9d0 | a88f0ca4bc31b40ab414476f0a0df733418ff038 | /Include/GXCommon/Posix/GXMutex.h | 8a7f45edba0d5d9feaa133684ca84d3fc72885f8 | [] | no_license | Goshido/GXEngine-Windows-OS-x64 | 8c9011442a5ef47a3c2864bdc7e6471e622763d5 | 10a1428d0284552856528d519283295388eea35b | refs/heads/master | 2020-06-28T16:59:26.904805 | 2019-11-24T06:07:03 | 2019-11-24T06:09:40 | 74,490,143 | 11 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 310 | h | GXMutex.h | //version 1.0
#ifndef GX_MUTEX_POSIX
#define GX_MUTEX_POSIX
#include "../GXTypes.h"
#include <pthread.h>
class GXMutex
{
private:
pthread_mutex_t _mutex;
public:
GXMutex ();
~GXMutex ();
GXVoid Lock ();
GXVoid Release ();
};
#endif //GX_MUTEX_POSIX
|
cffba9512f512c851694e13eb9c40d413090bcce | e6d4a87dcf98e93bab92faa03f1b16253b728ac9 | /algorithms/cpp/kthSmallestInstructions/kthSmallestInstructions.cpp | bbcab8a9b3002a383cacd7faa767d4f79a018d32 | [] | no_license | MichelleZ/leetcode | b5a58e1822e3f6ef8021b29d9bc9aca3fd3d416f | a390adeeb71e997b3c1a56c479825d4adda07ef9 | refs/heads/main | 2023-03-06T08:16:54.891699 | 2023-02-26T07:17:47 | 2023-02-26T07:17:47 | 326,904,500 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,061 | cpp | kthSmallestInstructions.cpp | // Source: https://leetcode.com/problems/kth-smallest-instructions/
// Author: Miao Zhang
// Date: 2021-05-25
class Solution {
public:
string kthSmallestPath(vector<int>& destination, int k) {
int v = destination[0];
int h = destination[1];
vector<vector<int>> comb(h + v, vector<int>(h));... |
769f0c8165d21c32ce1de4ef180da0ad53c79f74 | a21d7710b1d193ae7ee12205c2af2c47db09905e | /LeetCode/Explore/June-LeetCoding-Challenge-2021/#Day#29_MaxConsecutiveOnesIII_sol3_prefix_sum_and_lower_bound_O(NlogN)_time_O(N)_extra_space_96ms_57.8MB.cpp | 75f7e907fd6d39f4becc69a7b706636024ada7a9 | [
"MIT"
] | permissive | Tudor67/Competitive-Programming | 0db89e0f8376cac7c058185b84fdf11dcb99dae8 | 827cabc45951ac33f63d1d6e69e57897207ea666 | refs/heads/master | 2023-08-19T05:22:10.451067 | 2023-08-14T21:21:51 | 2023-08-14T21:21:51 | 243,604,510 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 685 | cpp | #Day#29_MaxConsecutiveOnesIII_sol3_prefix_sum_and_lower_bound_O(NlogN)_time_O(N)_extra_space_96ms_57.8MB.cpp | class Solution {
public:
int longestOnes(vector<int>& nums, int k) {
const int N = nums.size();
vector<int> zerosPrefixSum(N);
zerosPrefixSum[0] = (nums[0] == 0);
for(int i = 1; i < N; ++i){
zerosPrefixSum[i] = zerosPrefixSum[i - 1] + (nums[i] == 0);
... |
22eaba72a4f721832bf837dd79f3d6031a689e7b | ae6dbcfd6a333bf598b871e15a7741fef81f964f | /Projects/Protect/src/ApiProtectObjectModelTests/TestDocument.h | 7aedbb98056593560285a652ac31a1facf49672e | [] | 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 | 665 | h | TestDocument.h | #pragma once
#include "..\ApiProtectObjectModel\workshare\protect\document.h"
#include "..\ApiProtectObjectModel\Workshare\Protect\application.h"
class TestDocument :
public TestCase
{
public:
TestDocument(std::tstring name) : TestCase(name), m_pDocument(0) {}
virtual ~TestDocument();
static Test* suite();
void... |
9470393595685a144fe7183fb52e5382d2fed64c | f242f69df361d871d6c8f512f9dacb2210fef9f6 | /SCS_openMesh/CSM/cityModule/cityScene.h | 1a70eaa55bc84eae37e965733bd75f8a402ec970 | [] | no_license | joilee/MCV_Platform | c4796957b08038dc9689f29825f36291728c7573 | 51760e54c6ab2bd32928b1d12d273e22f63339c0 | refs/heads/master | 2018-07-08T20:03:14.667927 | 2018-06-09T03:29:11 | 2018-06-09T03:29:11 | 110,204,214 | 1 | 1 | null | 2018-05-26T02:10:38 | 2017-11-10T04:54:36 | C++ | GB18030 | C++ | false | false | 1,607 | h | cityScene.h | #pragma once
#include "../util/vector.h"
#include "../util/emxUtilityInc.h"
#include <vector>
#include <string>
#include "cityGroundVector.h"
#include "cityBuilding.h"
using namespace std;
/*
建筑物类
包含：建筑物数组、地面模型
*/
class cityScene
{
public:
/*
@brief 从本地读文件
*/
cityScene(vector<string> _v, vector<string> _h, s... |
9306848eb293974c268c216ed08c02a7df0c6207 | dfa0014b3b2e1140694788dd8f385301588ebcbe | /P2/cadena.hpp | 52fd4ba1e7cd50c79eb47bc9af1feaaf92f40da2 | [] | no_license | aleeeesf/POO | 8af267109092887feb69b370dbae57c8ab1753a4 | 2f01eb19d0d89612f9794c09135c3372bd433e1e | refs/heads/master | 2022-09-18T18:06:16.105189 | 2020-06-04T19:12:35 | 2020-06-04T19:12:35 | 265,229,444 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,845 | hpp | cadena.hpp | #ifndef CADENA_HPP_
#define CADENA_HPP_
#include <iostream>
#include <cstring>
#include <iterator>
#include <string>
using namespace std;
class Cadena{
public:
/*Constructores*/
explicit Cadena(unsigned t = 0,char c = ' ');
Cadena(const char*);
Cadena(const Cadena&);
Cadena(Cadena&&);
~Cadena();
... |
658b49f69306fb88d51c99f8bd8a6bbec25b08fb | 03b5b626962b6c62fc3215154b44bbc663a44cf6 | /src/keywords/__m128.cpp | aac7b35f8b271c43a8450b386cb91bfa42202bc7 | [] | 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 | 157 | cpp | __m128.cpp | #include "__m128.h"
int C__m128::my_init(void *p)
{
this->name = "C__m128";
this->alias = "__m128";
return 0;
}
C__m128::C__m128()
{
this->my_init();
}
|
19b3d95e3911f165d7e89b4e60f5b76814e93ec2 | 88ae8695987ada722184307301e221e1ba3cc2fa | /third_party/webrtc/video/video_send_stream_impl_unittest.cc | c88ad06cfb4160a9def4eebf2261fbe0b5ab2051 | [
"Apache-2.0",
"LGPL-2.0-or-later",
"MIT",
"GPL-1.0-or-later",
"BSD-3-Clause",
"LicenseRef-scancode-google-patent-license-webrtc",
"LicenseRef-scancode-google-patent-license-webm",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | iridium-browser/iridium-browser | 71d9c5ff76e014e6900b825f67389ab0ccd01329 | 5ee297f53dc7f8e70183031cff62f37b0f19d25f | refs/heads/master | 2023-08-03T16:44:16.844552 | 2023-07-20T15:17:00 | 2023-07-23T16:09:30 | 220,016,632 | 341 | 40 | BSD-3-Clause | 2021-08-13T13:54:45 | 2019-11-06T14:32:31 | null | UTF-8 | C++ | false | false | 40,069 | cc | video_send_stream_impl_unittest.cc | /*
* Copyright 2018 The WebRTC project authors. All Rights Reserved.
*
* Use of this source code is governed by a BSD-style license
* that can be found in the LICENSE file in the root of the source
* tree. An additional intellectual property rights grant can be found
* in the file PATENTS. All contributing ... |
ee18e218ec7c47a8bc0382daffd03bb0ebac2593 | bc95d233db18ce8a4a50b047fdcfceadb43c5818 | /day2/stars.cpp | 628df0a5ea4f08f030a356767211c08b095ca0f1 | [] | no_license | kizzlebot/Intro-To-Cpp | cd253c0489a3868defd3de78e54429295dc3eb7d | 2136bae943940aae1e65a9ab6012c464c5f91a9a | refs/heads/master | 2021-01-02T22:45:05.117479 | 2014-05-07T07:20:41 | 2014-05-07T07:20:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 364 | cpp | stars.cpp | //This Program outputs a bunch of stars lol
#include <iostream>
using namespace std;
int main(){
// Declare
int noTime = 0;
// while user has not specified how many lines of stars they want, ask for it
while ( noTime = 0 ){
cout << "\n\n\tHow Many Lines of Stars?: " ;
cin >> noTime;... |
85e874166837f94ed78d309df9636b9bb129bf17 | 8c1add484810df818286a6bbf7331c213e945018 | /Chapter8/Level.cpp | f01e7ae6cb252d46235c9dbc27528e308c26c0cc | [
"BSD-3-Clause"
] | permissive | sgeos/book_sdl_game_development | 558075ed34177298fa9026c285ffe6af68d89485 | a37466bfe916313216f332cbcff07dc6b3800908 | refs/heads/master | 2020-05-04T21:02:00.730299 | 2019-06-13T06:16:20 | 2019-06-13T06:16:20 | 179,461,655 | 8 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 519 | cpp | Level.cpp | #include <string>
#include <vector>
#include "Level.h"
Level::Level(void) { }
Level::~Level(void) { }
void Level::render(void) {
int size = mLayerList.size();
for (int i = 0; i < size; i++) {
mLayerList[i]->render();
}
}
void Level::update(void) {
int size = mLayerList.size();
for (int i = 0; i < size... |
02f7334c20ff0ff33a3edfc551c2b54b2c828f45 | afb7006e47e70c1deb2ddb205f06eaf67de3df72 | /third_party/libwebrtc/audio/voip/test/audio_ingress_unittest.cc | d46154820818b7b8a8e53399590b5822e98fae3e | [
"LicenseRef-scancode-unknown-license-reference",
"BSD-3-Clause"
] | permissive | marco-c/gecko-dev-wordified | a66383f85db33911b6312dd094c36f88c55d2e2c | 3509ec45ecc9e536d04a3f6a43a82ec09c08dff6 | refs/heads/master | 2023-08-10T16:37:56.660204 | 2023-08-01T00:39:54 | 2023-08-01T00:39:54 | 211,297,590 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,016 | cc | audio_ingress_unittest.cc | /
*
*
Copyright
(
c
)
2020
The
WebRTC
project
authors
.
All
Rights
Reserved
.
*
*
Use
of
this
source
code
is
governed
by
a
BSD
-
style
license
*
that
can
be
found
in
the
LICENSE
file
in
the
root
of
the
source
*
tree
.
An
additional
intellectual
property
rights
grant
can
be
found
*
in
the
file
PATENTS
.
All
contributing... |
9b19c29bdd32ad7b8e8d2af5b81564888da79d26 | 27c8f4c3ce82ddd6ae2bcd1c0319936d90b36ce4 | /codeforces/1155b.cpp | 1c72d8cd8bd58770851a94440e1ba720d75baf40 | [] | no_license | liv1n9/competitive-programing | 8ed486390c4f1960fe8749c6a09ece0f030f3fc2 | ddc5a1dcc1ade30f64c9a374923ad5e6e419ecb1 | refs/heads/master | 2020-08-22T00:59:32.965539 | 2019-10-20T00:13:20 | 2019-10-20T00:13:20 | 216,286,007 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 730 | cpp | 1155b.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int eight = 0;
for (int i = 0; i < n; i++) {
eight += (int)(s[i] == '8');
}
int move = n - 11;
if (eight == 0) {
cout << "NO";
return 0;
}
if (move / 2 < e... |
af05f7c25b93e43f7c7b8cf8e88076b49021fd16 | e549fdb6af47cc19aa84da710e1311ddf1d363e1 | /src/Base/log/Log.h | faf33ba1da8b00febc58670bfd08bab872aa15fb | [] | no_license | shizhan-shelly/MotionControl | b331e0a53400fd2b5d325bf8a17bc04f099b43e5 | 99c815acf5047e7a9a2a43e49f08f990e878cb5c | refs/heads/master | 2021-07-07T01:39:50.728336 | 2020-07-22T10:53:40 | 2020-07-22T10:53:40 | 130,342,938 | 1 | 2 | null | 2020-03-25T15:27:08 | 2018-04-20T09:46:54 | C | UTF-8 | C++ | false | false | 584 | h | Log.h | // Copyright 2018 Fangling Software Co., Ltd. All Rights Reserved.
// Author: shizhan-shelly@hotmail.com (Zhan Shi)
#ifndef BASE_LOG_LOG_H__
#define BASE_LOG_LOG_H__
namespace base {
typedef unsigned int LogId;
typedef std::string LogArgument;
// LOG_UNIQUE_ID_BITS is always LOG_DATABASE_ID_BITS + LOG_ID_BITS
#defi... |
c6e6a864e968398d26a24f869a229583b1dc6622 | 166cfb7d5c3a09d7d252f611b34d723c1ac2cdb2 | /Week 11/Add two numbers without using arithmetic operators.cpp | 01e0eca5bb557e6a7de6259f97a0f286ed7c42d3 | [] | no_license | yash56244/DSA | 8db4fa9687e46207966cc17e0be827f0fd9fd78d | 3aea589aa7807544d188e40d88c5f0c9d60a9e52 | refs/heads/main | 2023-06-24T04:51:17.471693 | 2021-07-09T05:15:52 | 2021-07-09T05:15:52 | 353,593,125 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 288 | cpp | Add two numbers without using arithmetic operators.cpp | int Add(int x, int y)
{
if (y == 0)
return x;
else
return Add( x ^ y, (x & y) << 1);
}
// Another Method using half adder logic.
int add(int x, int y){
int sum, carry;
while(y ! = 0){
sum = x ^ y;
carry (x & y) << 1;
x = sum;
y = carry;
}
return x;
}
|
79718d59b36d0a22a2d17edb48763907433420c0 | 3d4b050616b00947a4afc55af1238cdc5bfd33a3 | /controller/genreartistsongsitem.h | 577986e961169ee8f251bae4bf2643e0bcf31d1f | [
"MIT"
] | permissive | duganchen/quetzalcoatl | 6910e2fc5d664382d22c4eaae9337c0b691c9442 | de09175810994b7a085e6aa0ac9eaacc89388f07 | refs/heads/master | 2023-04-30T13:48:53.238533 | 2023-04-19T16:54:30 | 2023-04-19T16:54:30 | 1,010,675 | 8 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 322 | h | genreartistsongsitem.h | #ifndef GENREARTISTSONGSITEM_H
#define GENREARTISTSONGSITEM_H
#include "item.h"
class GenreArtistSongsItem : public Item
{
public:
GenreArtistSongsItem(QString, QString);
QVector<Item *> fetchMore(Controller *) override;
private:
QString m_genre;
QString m_artist;
};
#endif // GENREARTISTSONGSITEM_... |
06a37231d42546653569bf4841c85fe752fc85c2 | 3d9c6163656436abed072a7b56534ecae1ca2f66 | /Sources/x10/xla_tensor/ops/all_to_all.h | 4a0cd0cf2566fee7604ef89cda7984e50dbaafd0 | [
"Apache-2.0"
] | permissive | kongzii/swift-apis | 5c807e12e443bf032cbf78f8cbbe0d75fed14082 | cd2236fb51c20d3c9bbf1b37524cf9bc2ed04ce6 | refs/heads/master | 2020-11-28T20:17:45.644349 | 2020-10-05T18:00:51 | 2020-10-05T18:00:51 | 220,660,173 | 0 | 0 | Apache-2.0 | 2019-11-09T15:14:09 | 2019-11-09T15:14:08 | null | UTF-8 | C++ | false | false | 1,084 | h | all_to_all.h | #pragma once
#include "tensorflow/compiler/tf2xla/xla_tensor/cross_replica_reduces.h"
#include "tensorflow/compiler/tf2xla/xla_tensor/ir.h"
namespace swift_xla {
namespace ir {
namespace ops {
class AllToAll : public Node {
public:
AllToAll(const Value& input, const Value& token, xla::int64 split_dimension,
... |
389f3ba655252042f72ead53a83e936a18196554 | 0c360ce74a4b3f08457dd354a6d1ed70a80a7265 | /src/components/application_manager/src/commands/mobile/register_app_interface_request.cc | 9ae2bac73ccf899e89d9ca198d8d1ad9da75d1be | [] | permissive | APCVSRepo/sdl_implementation_reference | 917ef886c7d053b344740ac4fc3d65f91b474b42 | 19be0eea481a8c05530048c960cce7266a39ccd0 | refs/heads/master | 2021-01-24T07:43:52.766347 | 2017-10-22T14:31:21 | 2017-10-22T14:31:21 | 93,353,314 | 4 | 3 | BSD-3-Clause | 2022-10-09T06:51:42 | 2017-06-05T01:34:12 | C++ | UTF-8 | C++ | false | false | 42,409 | cc | register_app_interface_request.cc | /*
Copyright (c) 2015, Ford Motor Company
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the fo... |
389f496b73bf4d14d4b86b1e51eefa651732189d | f81c34bc603914dc7d076924618cdd29d8e2acf7 | /Functions/Roo2SumExp.cxx | f0c4049b1ac0058c1b36b0db5547606170c954ed | [] | no_license | Xaunther/root-tools | 342704e362ddaf3d825298eafda9c3ca6afc28de | 1472980f9f72eac0685daf470b5892f9d008edd4 | refs/heads/master | 2023-08-23T07:06:35.728180 | 2021-09-28T09:25:53 | 2021-09-28T09:25:53 | 411,723,170 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,724 | cxx | Roo2SumExp.cxx | /********************************************************************
* *
* \[T]/ P R A I S E T H E R O O C L A S S F A C T O R Y \[T]/ *
* *
***************************************... |
069d8b6d5656ccec634c2fbff44e4884deb64e59 | 38269173c9e65bc090eef96c7dee1365b92e40c2 | /HashTable/CountingSort/CountingSort/main.cpp | def45b7f8ee1e60ec3207855b14318a6fb134bf4 | [] | no_license | SecurityQQ/CPlusPlus_MIPT_Algorithms | 0a25e7026a2f8c59305077f1e8c6901c5bee5daa | abb51f63a879abd3517a458499b17b101852b900 | refs/heads/master | 2020-04-16T01:46:08.294347 | 2015-10-09T09:01:17 | 2015-10-09T09:01:17 | 43,944,397 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,573 | cpp | main.cpp | //
// main.cpp
// CountingSort
//
// Created by Александр Малышев on 10.11.14.
// Copyright (c) 2014 SecurityQQ. All rights reserved.
//
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
const int MaxSize = 1000;
void countSort(int* ... |
39e6ce2dfedf57ea66f19f4763290c522a93f05b | 5e6b47d32d27bdb3e8fbe962dd3fb521a8a248a5 | /lab08/bigthree.cpp | 58a2c7900d10a178486e0d78927cecaf185494d1 | [] | no_license | tgroechel/F17-280 | 45db4bca7f29420e3faa4e405c1ef7508378a3a0 | fd79973a17dfaae94be034490687264c2d85af76 | refs/heads/master | 2021-08-28T18:44:18.683841 | 2017-12-13T00:42:59 | 2017-12-13T00:42:59 | 103,156,666 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,791 | cpp | bigthree.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class A {
private:
int size;
int * arr;
void copy_rhs(const A & right_hand_side) {
size = right_hand_side.size;
arr = new int[size];
for (int i = 0; i < size; ++i) {
arr[i] = right_hand_side.... |
0b44c9e4b8e310774075ff98ea0579016c53e0c0 | fecf09fb6dd1b102764890eb6d112af5d934fa21 | /基础练习代码/数组中的字符串匹配.cpp | 0afbfbe45f1c44f6ba1687cc92355a3458aa0a48 | [] | no_license | zhaomengchao/C- | 5821df6d004b791e1212140fa734d20b01b00e8c | 377b99061bc4d7122438fbe6c5c76a7201b0f993 | refs/heads/master | 2021-07-12T15:02:02.509446 | 2020-10-12T09:08:55 | 2020-10-12T09:08:55 | 209,292,144 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,110 | cpp | 数组中的字符串匹配.cpp |
/*
输入：words = ["mass","as","hero","superhero"]
输出：["as","hero"]
解释："as" 是 "mass" 的子字符串，"hero" 是 "superhero" 的子字符串。
["hero","as"] 也是有效的答案。
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/string-matching-in-an-array
*/
class Solution {
public:
static bool lengthcompare(string& a, string& b){
if(a.lengt... |
85fa60ac309afb22d477cc7fab5fb461be8ed427 | 3cd6d8c07fff1c7851418aaf0a0a10b0ae3d888c | /i2c-argon.ino | 4d65778d00866aced8b55ba9092e82dbf4170c68 | [] | no_license | elpeacey/SIT210_Task8.1D_RPi_I2C- | 6105fb65168f7192589cc015acacc7ac68394494 | a04ee2c0cadb97d6957f7cf54a7f55460a7987e5 | refs/heads/master | 2022-09-22T10:02:42.027858 | 2020-06-03T00:13:21 | 2020-06-03T00:13:21 | 268,932,756 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 803 | ino | i2c-argon.ino | #include "Particle.h"
void setup() {
Wire.begin(0x40); //Initialise argon on slave address 40
Wire.onReceive(observeEvent); //When master device sends signal, call observeEvent
Serial.print("Light value");
}
void observeEvent(int bytes) {
int c = Wire.read(); //Read value from RPi
... |
b3e6caedc194f749dbc4e5318e3340ab393af057 | 1eddfc58034e70dbf32c93c5ecdfc47e377eca84 | /examenes.cpp | 16ab79c21a8d8809a5e785a027de82443fe10b6c | [] | no_license | Rodagui/CodeForces-Solutions | ec90ad3806ca6025c9f588eb298b33a47f097bd4 | fbcce297deb645ea8f6d7a30297071a12e447489 | refs/heads/master | 2022-07-27T21:36:20.656936 | 2022-07-15T00:54:17 | 2022-07-15T00:54:17 | 178,289,421 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 427 | cpp | examenes.cpp | /*Problema E – Exámenes*/
#include <bits/stdc++.h>
#define EPS 1e-12
using namespace std;
int main(){
double T1, T2, r1, r2, ans1, ans2;
cin >> T1 >> T2 >> r1 >> r2;
ans1 = (100.0f * r1 / T1) + (100.0f * r2 / T2);
ans1 /= 2.0f;
ans2 = 100.0f * (r1 + r2) / (T1 + T2);
if(fabs(ans1 - ans... |
a91b8d8e052c643e15cd1261ad1585e59716ea97 | aec35d48351acac8513a1c793e74d56a7d72cdf4 | /CAsteroidGame.cpp | 800bec38ae6f102f3ce5f96cb389167119dbd1b2 | [] | no_license | JoshPenner/Asteroids | d1458fec5d937084bf902ce6abe885a58cf7221b | faa88854badfe35d491f4c66e21b7b2599fe0ee4 | refs/heads/master | 2023-05-07T22:57:48.294513 | 2021-05-31T17:59:46 | 2021-05-31T17:59:46 | 372,589,888 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,737 | cpp | CAsteroidGame.cpp | #include "stdafx.h"
#include "CAsteroidGame.h"
CAsteroidGame::CAsteroidGame()
{
}
CAsteroidGame::CAsteroidGame(int com_port)
{
uCtlr.init_com(com_port);
// add check for com function
// initialize canvas image to desired width and height
_Canvas = cv::Mat::zeros(cv::Size(1000, 800), CV_8UC3); // image type is CV... |
c7747df8bd991404bad3788cdb628ccd39e28ae5 | 877fff5bb313ccd23d1d01bf23b1e1f2b13bb85a | /app/src/main/cpp/dir7941/dir22441/dir22442/dir22443/dir22444/dir22808/file22861.cpp | 71d3f0ba78b3580ab7d4b9e88bf6ae704277f09d | [] | 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 | file22861.cpp | #ifndef file22861
#error "macro file22861 must be defined"
#endif
static const char* file22861String = "file22861"; |
a8a8ce7154c709a92ef8b83a12bd1a60af531fb5 | 6db847c4c3fb3ef0b5712f102e8686955a57beb7 | /cpp_tests/Test.hpp | ac37575cecfe00bbd13f370815bb6bf8ac5de2a1 | [] | no_license | manuelTorrealba/ndeAero | b3e73e4812e141b83cb3059f262f29f85d5bf405 | 254fc1b9f6028a14d24e2507c8458f3842b192fd | refs/heads/master | 2021-01-20T15:41:47.715590 | 2015-06-16T14:33:37 | 2015-06-16T14:33:37 | 22,061,833 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | hpp | Test.hpp | /**
* File: Test.hpp
* Author: kenobi
*
* Created on Jun 8, 2015, 11:00 PM
*/
#ifndef INCLUDE_TEST_HPP
#define INCLUDE_TEST_HPP
#include "Vector.hpp"
namespace nde {
bool testThinAirfoilTheory();
bool testODESolver();
bool testNACAAirfoil(const Vector<unsigned int> &naca_codenum,
const std::string&... |
b2e6656e9bd9e0335529cd4df2322cb5f06bcffe | b8dd0d9a23083d166c5173cc315041b1b00ba710 | /linkedlist2.cpp | b1b70348a905d0eece7b6b237f1603f3e3f1ac09 | [] | no_license | WonJoonPark/BOJ-Algorithm | 244fb955ce422ae2ca47f3c33e53f32a6c9c691f | 48353b3ed90829066e46bfae27ddc06c6918f0fd | refs/heads/main | 2023-04-08T23:23:16.138284 | 2021-04-12T00:45:32 | 2021-04-12T00:45:32 | 307,600,337 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 309 | cpp | linkedlist2.cpp | #include<iostream>
using namespace std;
class Double_LinkedList_Node {
public:
int number;
Double_LinkedList_Node * next;
Double_LinkedList_Node * prev;
Double_LinkedList_Node(int num) {
number = num;
next = NULL;
prev = NULL;
}
};
class Double_LinkedList {
public:
};
int main() {
return 0;
} |
eaf5756d26dbbdb02fcb2a750bedd6d606b51433 | 16d1b9eb73c970d96a5bf316ea01bdbe8e6fccd1 | /Classes/FirstBossScene.h | 16350f50413b0ea747189f92d26c979c475e7d06 | [] | no_license | xurui25/cocos2d-x- | 5cb2835f89018b92b281cc5f82a79283af0210d4 | 9a5ffb5597a0b5b9ec2b270122d07a96a899c9ae | refs/heads/master | 2021-05-15T01:47:03.240010 | 2016-11-28T10:52:36 | 2016-11-28T10:52:36 | 39,554,445 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,529 | h | FirstBossScene.h | #ifndef __FIRST_BOSS_SCENE_H__
#define __FIRST_BOSS_SCENE_H__
#include "cocos2d.h"
#include "SimpleAudioEngine.h"
#include "SkillButton.h"
#include "Man.h"
#include <iostream>
#include <string>
#include <vector>
USING_NS_CC;
using namespace std;
//
class FirstBossScene : public cocos2d::Layer, public CMTouchSpritePro... |
9706241d1e884625478649d065ae8bad27ae17fb | 8e3bed8a6cdd5f979840b205f9cedbe297769f13 | /Source/GameServer/include/Crywolf.h | c954a8b58bdb5bef86fc66560efa6add33a57a3f | [
"MIT"
] | permissive | vuonglequoc/ServerSimulator | 93cd48edf1cd5bec77e9c823b930bf35f26c7111 | 12bd6f24fcf957c657864a81da3dfb0467b48c2b | refs/heads/master | 2023-02-03T05:55:40.232793 | 2020-12-19T22:27:34 | 2020-12-19T22:27:34 | 35,360,781 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,033 | h | Crywolf.h | // Crywolf.h: interface for the CCrywolf class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_CRYWOLF_H__ADDDADAD_136F_4C82_9920_91B557B8C9B5__INCLUDED_)
#define AFX_CRYWOLF_H__ADDDADAD_136F_4C82_9920_91B557B8C9B5__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_... |
80d3eeccdd6501b1cc0c8bc7a227827f5f1c7cc5 | 1165a7e419ef77b9c21ff419b5ef11b03ea03467 | /src/Renderer/Material.h | e93a4ea208362efabb382f955db0c58263a5972b | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | Stral9315/xsngine | 19c171cb729c0126c8c7f845c17b2db8f261a34b | 4a4afe21f12483dbe266113b17a4b51ea850ee56 | refs/heads/master | 2020-03-07T18:11:46.674231 | 2018-04-01T13:20:42 | 2018-04-01T13:20:42 | 127,630,592 | 0 | 0 | MIT | 2018-04-01T13:12:40 | 2018-04-01T13:12:39 | null | UTF-8 | C++ | false | false | 794 | h | Material.h | #pragma once
#include <string>
#include <vector>
#include "Renderer/Buffer.h"
#include "Renderer/Texture.h"
namespace Renderer {
class ShaderProgram;
const uint32_t MF_NONE = 0x00000000u;
const uint32_t MF_WIREFRAME = 0x00000001u;
struct Material {
struct SamplerBinding {
int unit;
std::strin... |
c2d1fd5a092a83644f8ccf59924669142b512dbb | c371f8325cb85a77c1772d9ff48ca31d4602de68 | /labhelper/Model.h | cdb579c911ca9873313d5797653f1c51a3272ef5 | [] | no_license | ivanzamoraarias/lab_computer_graphics_1 | 0231ecc67ff54c7a63255b47865fab40bd1f5e2e | 6b08244f83156564a90ffd5a0408c87e2ed1308d | refs/heads/master | 2020-09-05T05:31:47.370238 | 2020-03-30T16:58:57 | 2020-03-30T16:58:57 | 219,997,909 | 1 | 0 | null | 2020-03-30T16:58:58 | 2019-11-06T13:01:30 | C | UTF-8 | C++ | false | false | 2,187 | h | Model.h | #pragma once
#include <string>
#include <vector>
#include <glm/glm.hpp>
namespace labhelper
{
struct Texture
{
bool valid = false;
uint32_t gl_id = 0;
std::string filename;
std::string directory;
int width, height;
uint8_t* data = nullptr;
bool load(const std::string& directory, const std::string& filename, int... |
5bf899215234fc43542e05d2f6cd21ff7a057176 | 91cd380b9d0d51c31ee8debde9a5073f73c67268 | /PAT/PAT/04.cpp | af43aa50e2d864259678739c494511c54764fd90 | [] | no_license | lrx0014/PATStudy | 28d57f17fee4e2f1177bcb6ec861560b04052959 | 74e81e49645079f5b3436979ccb28ba944d80d8e | refs/heads/master | 2021-05-16T16:08:49.938895 | 2018-04-02T12:58:09 | 2018-04-02T12:58:09 | 119,804,924 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,282 | cpp | 04.cpp | #include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef struct node{
int id;
int childs_num;
vector<int> childs;
}Node;
void dfs(const Node *tree,Node node,map<int,int>& m,int depth)
{
if(m[depth==0]) m[depth] = 0;
if(node.childs_num == 0)
{
++m[depth];
... |
03823a7a9c0b87c1959d0e5ef9eaedb4fff8bbf7 | 3235a542c9593c45ec3d526b066ceedcc0205f67 | /38.cpp | be3a2f8dd462d42fbde2e318fb7abb3620635a8d | [] | no_license | TomFrank/LeetCode | 2937c3ba8b54177b3f2979c9f40c2264d1d9b91d | 024b5ff09be841cb830219f23b6e74f85159ff1f | refs/heads/master | 2022-04-30T06:59:25.925446 | 2022-03-24T03:43:59 | 2022-03-24T03:43:59 | 106,986,742 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,170 | cpp | 38.cpp | #include <iostream>
#include <string>
#include <vector>
using namespace std;
class Solution {
public:
pair<char,int> max_cont_ch(string& s, int i) {
int cnt = 1;
char c = s[i];
for(;i+1<s.size();) {
if(s[i+1] == s[i]) {
cnt++;
i++;
} e... |
4f88c927be938d3c36f8edbd86aeafe015d744f5 | 822150d9dd48c6d7140364a01b778a66c90ecd2c | /protocol/offset_response.cc | 57d60c8c685a3c8e4c05f2b387e95f19ff725628 | [] | no_license | leo-987/kafkaconsumer | f66da43aa32a6b7fbfea5c6438ab29cf54270a73 | 3b88fd536e11dff9033159e4e9b40e5d1b7fe82a | refs/heads/master | 2023-03-05T13:54:56.505116 | 2016-06-19T03:55:39 | 2016-06-19T03:55:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,072 | cc | offset_response.cc | #include "offset_response.h"
#include "util.h"
#include "easylogging++.h"
PartitionOffsets::PartitionOffsets(char **buf)
{
partition_ = Util::NetBytesToInt(*buf);
(*buf) += 4;
error_code_ = Util::NetBytesToShort(*buf);
(*buf) += 2;
LOG_IF(error_code_ != 0, ERROR) << "OffsetResponse error code = " << error_code_;
... |
41d11b63658e56d85d7d59e6a5898dbbd86b2bd8 | 04a2a2378ee2d7d020edb79369dd4b9899baf9c2 | /tictactoe/botmove.h | ac720d4301af90dfd1caa50bcf5322ae0d6e5972 | [] | no_license | Unplugged2/tic-tac-toe-cpp | dbc8a6ea9374fc899b694dd90ef86e1821c8f034 | fcd0db1262f2792759cbd659575e4864bf29b8fe | refs/heads/main | 2023-04-16T10:34:25.836882 | 2021-05-04T13:24:39 | 2021-05-04T13:24:39 | 364,258,619 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,801 | h | botmove.h | #include<iostream>
using namespace std;
int bot_AI(){
int a;
bool chose = false;
if(board[1] == 'X' && board[2] == 'X' && board[3] != 'X' && board[3] != 'O'){ //1st row
a = 3;
chose = true;
}
else if(board[1] == 'O' && board[3] == 'O' && board[2] != 'X' && board[2] != 'O'){
... |
03d79765667f473758e92297513288205fa069b5 | 5d8cec1e270f3d21971c253818e35ea3ec144434 | /Element.cpp | f8443afc54a95945857d8b784d9e1220a01f3760 | [] | no_license | agouasmi/DG2D | 1692ed9f053dcba01d24fbc13f6f8eeba865b8c2 | 24c08cf0f4ed80316c08e128421a27ef30bcc254 | refs/heads/master | 2021-01-20T04:04:56.962800 | 2017-04-27T19:54:10 | 2017-04-27T19:54:10 | 89,634,678 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,497 | cpp | Element.cpp | #include "Element.h"
/* Base class */
Element::Element(){}
Element::~Element(){
//delete [] smax;
// ---------------- //
delete [] dofs_rhs;
delete [] dofs;
delete [] dofs_backup;
// ---------------- //
delete [] quad_F1;
delete [] quad_F2;
// ---------------- //
delete [] flux_faces;
// ---... |
580f0e41ea986850ef5403be1053c0828358ffb6 | f8c0b8a0ae169b6a86c08b3e4dcfc9a69f4a77d1 | /src/World/World.hpp | fbf4ef53045bc6e8db67875f4d2efe280ae1c5da | [
"MIT"
] | permissive | lvseouren/Swift2 | a25ca01b24dd77b162ece98a1374041fe70bb9f7 | 3dd898c0ca6f508fbf37f5e507c2998378de89e0 | refs/heads/master | 2021-01-21T05:36:14.638937 | 2015-01-19T02:46:05 | 2015-01-19T02:46:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,335 | hpp | World.hpp | #ifndef WORLD_HPP
#define WORLD_HPP
#include <string>
#include <vector>
#include <map>
/* SFML */
#include <SFML/System/Vector2.hpp>
#include <SFML/Graphics/View.hpp>
#include <SFML/Graphics/Drawable.hpp>
/* Resources */
#include "../ResourceManager/AssetManager.hpp"
/* Entity */
#include "../EntitySystem/Entity.hp... |
00e7a797004ce408f0b37092712b581f5ee17731 | 771b8d391585df59d8c7438e21e54976c4180011 | /lib/OTExtensionBristol/OT/OTExtension.cpp | 9a752a9bc176bcea68a084cb0d9b96325f5defaf | [
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-warranty-disclaimer",
"MIT"
] | permissive | cryptobiu/libscapi | 1f11f92065c1cea418e73b932c9810d374bac060 | 1f70a88548501eaca5fb635194443e7a2b871088 | refs/heads/master | 2023-08-10T08:34:21.304797 | 2022-08-16T16:48:20 | 2022-08-16T16:48:20 | 53,246,303 | 186 | 74 | MIT | 2023-07-20T11:01:17 | 2016-03-06T08:59:43 | C++ | UTF-8 | C++ | false | false | 24,651 | cpp | OTExtension.cpp | // (C) 2016 University of Bristol. See LICENSE.txt
#include "OTExtension.h"
#include "OT/Tools.h"
#include "Tools/aes.h"
#include "Tools/MMO.h"
#include <wmmintrin.h>
#include <emmintrin.h>
word TRANSPOSE_MASKS128[7][2] = {
{ 0x0000000000000000, 0xFFFFFFFFFFFFFFFF },
{ 0x00000000FFFFFFFF, 0x00000000FFFFFFFF... |
1e34f5964829a1883d7ff528221a41fd9776448c | dbc0e3582d65bcf9d8fba29d872d6407454f9e28 | /PRACTICE/activity_selection.cpp | 63715174454f501864f9f60d7b9ed525707ae79c | [] | no_license | sirAdarsh/CP-files | 0b7430e2146620535451e0ab8959f70047bd7ea2 | 8d411224293fec547a3caa2708eed351c977ebed | refs/heads/master | 2023-04-05T09:07:21.554361 | 2021-04-08T19:57:33 | 2021-04-08T19:57:33 | 297,582,418 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 886 | cpp | activity_selection.cpp | #include<bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int,int> Pair; //(start time, end time)
bool comp(Pair j1, Pair j2){
if(j1.first < j2.first){
return true;
}
else if(j1.first == j2.first && j1.second < j2.second){
return true;
}
return false;
}
int solve(vector<Pair> jobs){
in... |
b95614e778b30fb054a7588250cf1244c3c0f46e | 15db79adc4476f06f35cd4a219313aacda5890eb | /util.cpp | 7bf8118c178402ed3f5f2e9655f0b952e745e581 | [] | no_license | 12tqian/cryptanalysis | 2e61ca80015e7d2033460c540a8c96b0f7c4e320 | b38806fba41bc39b093c689011a51d0674818e7d | refs/heads/master | 2020-06-23T14:23:30.955360 | 2020-03-17T18:04:27 | 2020-03-17T18:04:27 | 198,648,463 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,251 | cpp | util.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll WS = 16;
ll one = 1;
ll rotl(ll n, ll d, ll MX = WS) {
return ((n << d)|(n >> (MX - d)))&((one<<MX) - one);
}
ll rotr(ll n, ll d, ll MX = WS) {
return (n >> d)|(n << (MX - d))&((one<<MX) - one);
}
ll flip(ll n, ll MX = WS){
return (((one... |
80082520ee81b51758f98573e725515eb021a896 | 9d6e7657ef109d4131a239ccd21b665a92f3b17b | /Observer/WeatherData.cpp | 0a9d11dad2c844bcbf05ea116fa25d0098857f2f | [] | no_license | CtfChan/DesignPatternsCpp | 380f445887156c5d356a4de14f503710bd080480 | 1ca4288b907e0b711b4d5418ff0dc0ade72b25f0 | refs/heads/master | 2022-07-06T02:16:10.142991 | 2020-05-19T19:05:45 | 2020-05-19T19:05:45 | 264,729,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 977 | cpp | WeatherData.cpp | #include "WeatherData.hpp"
#include "Observer.hpp"
#include <algorithm>
void WeatherData::registerObsever(Observer* o) {
observers_.push_back(o);
}
void WeatherData::removeObserver(Observer* o) {
auto it = std::find_if(observers_.begin(), observers_.end(), [&o](const auto& other_obs){
return other_obs... |
ae13ad3e7fed675a41e6ed8dd60087e2ad90c7b6 | 656cbd1962d676fadbecd430f2847c3d378daca9 | /1011C.cpp | 4baea9118306d9f72afebcbc79e44b1eef90edc3 | [] | no_license | AkazawaNozomu/codeforces | b642fdc85bfdff3010b81ef971faefe5d1c11e33 | c0da0e8095e482f0adfd02865b77412f4e6f25d5 | refs/heads/master | 2020-04-02T10:40:41.729352 | 2018-10-23T15:09:27 | 2018-10-23T15:09:27 | 154,349,586 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 728 | cpp | 1011C.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e3+5;
ll a[maxn],b[maxn];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll m,n;
cin>>n>>m;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
b[n]=b[0];
long double l=0,r=1e9,mid,curw;
for(int j=0... |
fc4562e8ee29e44c65e2cc776e284010beb3243a | e8dd6366a191a797c8b9ec08efc7bfbf35073636 | /include/doomtype.h | e26a09c196891141e9c736ea828e49cd0dcfa4ae | [] | no_license | meiavy/doom-legacy | f89888790c47ec8188c7d97cdbb559ea2d45af7e | 60b4651c64a1630868623a49fd6de7e78db5feac | refs/heads/master | 2020-12-29T08:43:48.813795 | 2014-05-23T21:27:21 | 2014-05-23T21:27:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,880 | h | doomtype.h | // Emacs style mode select -*- C++ -*-
//-----------------------------------------------------------------------------
//
// $Id$
//
// Copyright (C) 1993-1996 by id Software, Inc.
// Copyright (C) 1998-2007 by DooM Legacy Team.
//
// This program is free software; you can redistribute it and/or
// modify it under th... |
eff17753bf40d4a37f657e1b0fa585f005b4bca7 | 691ab076d1498018bee99eff9118e2f8df3ab764 | /mpi/src/Grid.h | 43c5692c986c837ff3275c04a0a4a6b515cffbb8 | [] | no_license | pedrorio/parallel_and_distributed_computing | 7b0375b22839b768d6d67af203c1b0483f09cf1c | e78f417411cbe78a1d8ae3bd4a3b18d480d89b2a | refs/heads/master | 2022-12-09T10:28:09.553931 | 2020-09-16T10:46:37 | 2020-09-16T10:46:37 | 244,902,238 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 125 | h | Grid.h | //
// Created by Pedro Rio on 28/05/2020.
//
#ifndef MPI_GRID_H
#define MPI_GRID_H
class Grid {
};
#endif //MPI_GRID_H
|
ce0168b0d78e3a3db107735b6f37933a0fc5ea8f | 07fe910f4a2c7d14e67db40ab88a8c91d9406857 | /game/xme/Reference.h | 14656824703c15aa9ce63f7e086bba9394a24c5e | [] | no_license | SEDS/GAME | e6d7f7a8bb034e421842007614d306b3a6321fde | 3e4621298624b9189b5b6b43ff002306fde23f08 | refs/heads/master | 2021-03-12T23:27:39.115003 | 2015-09-22T15:05:33 | 2015-09-22T15:05:33 | 20,278,561 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,339 | h | Reference.h | // -*- C++ -*-
//=============================================================================
/**
* @file Reference.h
*
* $Id$
*
* @author James H. Hill
*/
//=============================================================================
#ifndef _GAME_XME_REFERENCE_H_
#define _GAME_XME_REFERENCE_H_
#inc... |
c0849a0aa34ade31d7c7f44a9f25983b28fdd89c | be4e0185d682641023e98c35723bf3c9ca30192f | /src/sim_acceptance.cc | da1ae1db8a04e11a2cacf1b36a71afb0fcf9e1b4 | [] | no_license | mam-mih-val/hades_v1_even | 43a5d18cdd11969f4b377b18e29db5050eb959a4 | 088a62d16515b4b528964b91dc42d075f9f2450b | refs/heads/master | 2023-03-18T11:09:26.358677 | 2021-03-03T12:12:39 | 2021-03-03T12:12:39 | 343,820,016 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,581 | cc | sim_acceptance.cc | //
// Created by mikhail on 6/29/20.
//
#include "sim_acceptance.h"
#include <AnalysisTree/DataHeader.hpp>
namespace AnalysisTree {
void SimAcceptance::Init(std::map<std::string, void *> &branch_map) {
std::cout << "SimAcceptance::Init(): START" << std::endl;
sim_header_ = static_cast<EventHeader *>(branch_map.at... |
67c777752ffd2f87bc8d817e9849c3541289a42f | 87502da17952d4f4bc63f91ac1d8bf4d62eb068b | /Sequence_aligner.h | 23cfddda5d16c26a7cac87512dd188871b4b9e27 | [] | no_license | artiee/star | 9b4fd08145fa6ef7db64b7be1e7b0ea23068d3a3 | 0c6ee7b101301864d0754af7ae236dab18d9aa3a | refs/heads/master | 2016-09-06T08:07:41.502828 | 2014-03-07T15:57:48 | 2014-03-07T15:57:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,020 | h | Sequence_aligner.h | #ifndef SEQUENCE_ALIGNER_H
#define SEQUENCE_ALIGNER_H
#include <iostream>
#include <string>
#include <vector>
#include "Sequence.h"
using namespace std;
/**
* The abstract sequence aligner class.
* Based on the tutorial at http://www.sbc.su.se/~per/molbioinfo2001/dynprog/dynamic.html
*/
class Sequence_aligner
{
... |
8e11de6ed323ec98498a2f4c59be369c501dae16 | 1a91bdd47ab7829a278da1fb6ddcfc5c386293b3 | /third_party/dapcstp/include/bbnode.h | c118ec79e13f2a2d5df0f566e1b7fc1b734cf880 | [] | no_license | danzeng8/TopoSimplifier | 43738b843577fc34cc469bed24bdf23c4fcf088b | 10753151afac5bd35f574f834a029788ecd1e25e | refs/heads/master | 2023-07-09T22:06:18.850305 | 2021-08-04T21:09:00 | 2021-08-04T21:09:00 | 266,427,563 | 22 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 859 | h | bbnode.h | /**
* \file bbnode.h
* \brief branch-and-bound node
*
* \author Martin Luipersbeck
* \date 2015-05-03
*/
#ifndef BBNODE_H_
#define BBNODE_H_
#include "inst.h"
#include "ds.h"
class BBNode {
public:
weight_t lb = 0.0;
int v = -1, bdir = -1; // branching node and direction (0 or 1)
int depth = 0;
int n... |
ddaf1fc0a6a4a81cb383b42c3988a265a5099a1f | 09f01e31045092400652ca237a11ae9016a801e9 | /openGL/2D/MosPro/src/physics/bspNode2D.cpp | 587bcbea22f26ee35930cb74360a1177693ec07e | [] | no_license | forsythrosin/MosPro | 186078e72e909022f8cc9f0c0a8bf3d80c6ba403 | bd6566bc3052f5e17b15f4f3abd014bcc834f87c | refs/heads/master | 2016-09-10T20:05:15.125834 | 2013-11-26T12:52:10 | 2013-11-26T12:52:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,127 | cpp | bspNode2D.cpp | #include "BSPNode2D.h"
#include "rigidBody2D.h"
#include "potentialCollision2D.h"
#include "physicsEngine2D.h"
#include "../lib/debugInterface.h"
BSPNode2D::BSPNode2D(BSPNode2D *parent, BSPLocation2D location, double granularity) {
assert(parent);
this->location = location;
this->parent = parent;
this->bodies = ... |
3d17194557f17b2a4b930bc2bfad2f3176e1543b | 84c5f501eb2001f166470ce8d26de3eec8de9c99 | /5/server.cpp | c5c0e704637467d5f40d615d63997d404fdfe159 | [] | no_license | Aidenryan/Network-programming. | f2e1d69cdb5a0404356e5b0232d525b85398dbe9 | a45b6378b4de8a13a099c57dd2ae4bfe43d7b20f | refs/heads/main | 2023-04-24T04:07:17.012400 | 2021-05-05T08:28:43 | 2021-05-05T08:28:43 | 358,571,929 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,629 | cpp | server.cpp | #include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <assert.h>
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
#define buf_size 1024//设置缓冲区大小
int main(int argc, char* argv[])
{
if(argc <=2)
{
cout<<"us... |
1e1a392f0fbdc595f9b7a3cd6a64f72bf758a0cf | 29bbd8d1c15d3401d01fba25b2f7d99b755dee7f | /problem29/problem29/main.cpp | da73b7e67ed80c0528d4ee7375dfdacc6214bddb | [] | no_license | zackluckyf/Project-Euler | b1ad4c4e89d81bcd9ad27914d5f739494101cc53 | 478dd00a095c46a48a69486321e64b450bd97f79 | refs/heads/master | 2021-01-21T12:53:59.813574 | 2016-04-23T05:13:49 | 2016-04-23T05:13:49 | 47,661,130 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,343 | cpp | main.cpp | //
// main.cpp
// problem29
//
// Created by Zack Fanning on 12/13/15.
// Copyright © 2015 Zackluckyf. All rights reserved.
//
/*
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
2^2=4, 2^3=8, 2^4=16, 2^5=32
3^2=9, 3^3=27, 3^4=81, 3^5=243
4^2=16, 4^3=64, 4^4=256, 4^5=1024
5^2=25, 5^3=125... |
a37ab4392fd3d3ac901e32aba93519939cc545d8 | 281c2763051432271b132499702860bd2b3f5ffa | /Volume_11/1172_Chebyshev’s_Theorem.cpp | 7ff7b60d25512048d6d1d3f9c390330ba0c98798 | [
"Apache-2.0"
] | permissive | dtbinh/AOJ | 27c95c32a829adbee37431e6e5f510723992fe45 | f4fc75717e67b85977f5ba0ccf9e823762e44a45 | refs/heads/master | 2021-01-24T23:42:46.858379 | 2015-05-25T17:05:03 | 2015-05-25T17:05:03 | 36,429,163 | 1 | 0 | null | 2015-05-28T09:46:45 | 2015-05-28T09:46:44 | null | UTF-8 | C++ | false | false | 551 | cpp | 1172_Chebyshev’s_Theorem.cpp |
#include <iostream>
#include <deque>
#include <cstdio>
#include <vector>
#include <string>
#include <limits>
#include <algorithm>
#include <sstream>
using namespace std;
int dp[1000001];
int main(){
fill((int*)dp,(int*)dp + 1000000,1);
dp[0] = 0;
dp[1] = 0;
for(int i=2;i*i<=1000000;i++){
if(!dp[i]) con... |
79e20394d5718abf419a5c49d16b2a2cb252ac2f | e6cae0446ff336189f37f983614c853a8d4f4e7f | /PointFighting/form_advertisement.cpp | 8517e7b7128fad17d5c6822c1aa044c411136ba0 | [] | no_license | BarsukAlexey/xelarogi | de5b7e7424ade51f214e2289a29163ae0ce467b6 | 47dcee42bd4568d38b211e59bd38a540849fb8bd | refs/heads/master | 2020-04-05T22:55:46.988577 | 2020-02-06T13:17:00 | 2020-02-06T13:17:00 | 46,854,119 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 418 | cpp | form_advertisement.cpp | #include "forma_dvertisement.h"
#include "ui_form_advertisement.h"
FormAdvertisement::FormAdvertisement(QWidget *parent) :
QDialog(parent),
ui(new Ui::FormAdvertisement)
{
ui->setupUi(this);
}
FormAdvertisement::~FormAdvertisement()
{
delete ui;
}
void FormAdvertisement::setImage(QImage img)
{
im... |
7fe6a891e7bf5d71444dce0f6a7288f25085cc86 | 843e995a92a6ceb1c207cc3b58c528da073562bd | /Orbis Toolbox/Build_Overlay.cpp | 9c9a233395fa516efd11d3bb585ff47b2026ba7d | [] | no_license | PSTools/Orbis-Toolbox | d3dd710366c91d4478c76805050dc1a0513319af | 59caaf1d19b1787d2c67cb423dd4ea73d10c8784 | refs/heads/main | 2023-06-26T04:48:31.691451 | 2021-07-28T14:56:07 | 2021-07-28T14:56:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,390 | cpp | Build_Overlay.cpp | #include "Common.h"
#include "Build_Overlay.h"
bool Build_Overlay::Draw = false;
Widget* Build_Overlay::Root_Widget = nullptr;
void Build_Overlay::Update()
{
if (Draw)
{
if (Root_Widget->Has_Child("BUILDPANEL"))
return;
//Create new Label for the build string.
Label* BuildLabel = new Label("BUILDLABEL", 2... |
72bc9062fed26d334fda71a67ab7a1deaec351bc | 1b1c4c38707f500cdfdb8d37a7d9c436815a1d10 | /main.cpp | b3562ab5407b7437055927695f6619547ce1f092 | [] | no_license | syt92/Equivalence-relations | ab8a1cca707c0811e8b79c39aaaf8cd0a9306a6f | 46cd3c4bf7a986e84368da2e028cb54da5ce4fb0 | refs/heads/master | 2023-03-13T06:19:36.524525 | 2021-02-25T08:18:39 | 2021-02-25T08:18:39 | null | 0 | 0 | null | null | null | null | BIG5 | C++ | false | false | 876 | cpp | main.cpp | #include <iostream>
#include <fstream>
#include "linked_list.h"
#include "linked_list.cpp"
using namespace std;
int main(){
int list_number = 12;
List<int> *seq = new List<int>[list_number];
int i, j, x, y;
for(int i=0; i<9; i++){
cout<<"第"<<i+1<<"次輸入"<<endl;
cout<<"請輸入相關數字1:";
... |
38a9e42d404460240dfaf72e3a8b8e4b828ee915 | 8da79a17fb9dcf7400afed2bed07d313e1823d7a | /libhwcservice/IControls.h | ff78a74e8621c8c7abb61d3bbb9e4e43321be4fb | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | intel/hwc | 6109b7c498cffaab6309cda4b5e696dc8b4fc14d | 65f8fac3557ee4e88fe7a5dae83ea88bafdae7dc | refs/heads/master | 2023-08-29T22:49:30.063925 | 2022-08-04T22:55:55 | 2022-08-04T22:55:55 | 87,242,180 | 11 | 9 | null | 2018-07-29T20:09:18 | 2017-04-04T22:46:08 | C++ | UTF-8 | C++ | false | false | 3,074 | h | IControls.h | /*
// Copyright (c) 2017 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or... |
3d854aeffb5ca45e8c55e453e75df82b2ebf57ab | f38e1eeee8678d5b228d9340dbeab87edb6a9368 | /TeeNew/Builder2007/Function_High.h | 6ba59e591bb3dba0e05b59cd3b2d3e9ceaad1450 | [] | no_license | Steema/TeeChart-VCL-samples | 383f28bfb7e6c812ed7d0db9768c5c1c64366831 | cb26790fa9e5b4c1e50e57922697813e43a0b0bc | refs/heads/master | 2021-11-17T07:02:23.895809 | 2021-09-14T07:43:04 | 2021-09-14T07:43:04 | 8,649,033 | 23 | 14 | null | null | null | null | UTF-8 | C++ | false | false | 1,156 | h | Function_High.h | //---------------------------------------------------------------------------
#ifndef Function_HighH
#define Function_HighH
//---------------------------------------------------------------------------
#include <Classes.hpp>
#include <Controls.hpp>
#include <StdCtrls.hpp>
#include <Forms.hpp>
#include "Base.h"
#includ... |
7e57e85b5c577746a1682c8a0a7e31b5922ccc6f | ad0140e5a3fa1a8c963cb8d75f0aff29eb73446b | /04week/2day/07ex/src/07ex.cpp | 1f4cc3f2055a560999ef676fba5e477c5992d5f4 | [] | no_license | greenfox-zerda-sparta/wekkew | a8550337287b1cbc6a358b2a37d9f7d7bf8fb5ab | 1409e47b77dc7a1dfb8052352428f4cc3375f87c | refs/heads/master | 2021-01-12T18:15:09.853176 | 2017-04-23T20:29:30 | 2017-04-23T20:29:30 | 71,350,692 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 563 | cpp | 07ex.cpp | #include <iostream>
#include <string>
#include "Car.h"
using namespace std;
int main() {
// Create a class called "Car"
// It should have a "type" property that stores the car's type in a string eg: "Mazda"
// It should have a "km" property that stores how many kilometers it have run
// The km and the... |
4a27f5e5439986a1f8241f2f6053e8bb9564a6aa | 293d5084e57a015cca69038c9f0ee86005047bca | /sort-algo.cpp | a50c329a70efdae2e302e21c59876e4c2f9afbcc | [] | no_license | Max-Arbuzov/research-of-sorting | 53a15f09a09a9285ba8d44246ce0f2b1a78d7d2a | 1415407a9e8b44b499e7bea7eff1a8f5f5416919 | refs/heads/master | 2023-06-28T00:54:23.859549 | 2021-07-06T07:31:50 | 2021-07-06T07:31:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,440 | cpp | sort-algo.cpp | #if !defined(CSTRINGS) && !defined(CSTRINGS_SHORT) && !defined(CSTRINGS_LONG)
#include "opt/SortAlgo/SortAlgo-m.cpp" //sources are taken from https://github.com/chromi/sound-of-sorting/tree/master/src
//they were modified a bit - all hooks for visualisation are removed
//shells... |
7c6ab38d79c09459952ded354483757fad3f3db0 | f81124e4a52878ceeb3e4b85afca44431ce68af2 | /re20_2/processor3/constant/polyMesh/pointProcAddressing | 9ac9b033fdbfd2f97927dacbb69436a4a88f5703 | [] | no_license | chaseguy15/coe-of2 | 7f47a72987638e60fd7491ee1310ee6a153a5c10 | dc09e8d5f172489eaa32610e08e1ee7fc665068c | refs/heads/master | 2023-03-29T16:59:14.421456 | 2021-04-06T23:26:52 | 2021-04-06T23:26:52 | 355,040,336 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,414 | pointProcAddressing | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 7
\\/ M anipulation |
\*-------... | |
1bf91885bdcd55ad09a8054661cb37af2aec331d | 19257b8f4be8c0f6deaf02041a6ade7c44571d56 | /IMU_Table_Arduino/Brewer/LocalMailbox.h | 3a9fd79d7ffec9bebe0973e1606e7d7ed9766ebc | [] | no_license | JLReitz/Banderole_Bois | 02a811aa127f7acdd68a215a177996f56403dc47 | d60e99a61d8f8dc64773269e14d510e88ca01287 | refs/heads/master | 2020-04-18T14:24:20.366789 | 2019-04-11T00:38:00 | 2019-04-11T00:38:00 | 167,587,705 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 585 | h | LocalMailbox.h | #ifndef LOCALMAILBOX_H
#define LOCALMAILBOX_H
#include <string.h>
#include "Mailbox.h"
#include "serial.h"
//#include "src/Cereal/serial.h"
class LocalMailbox : MailBox {
public:
LocalMailbox();
void SendCereal(); //Testing
void ReadCereal();
float getPositionX();
float getPositionY();
float get... |
5dd483a5901eae3cce65015cf5ea40ac814d6a7a | 9bda87aaafcd95bffbc75421833102e863dde4df | /src/ZLogging.cpp | 7bdbf93f3fb0a9926d211e446c161e7688f3f5a6 | [
"MIT"
] | permissive | pbertie/esp8266-SK6812 | ceb951e72c698623fde189b32875a5f93d206ad9 | 27d00d9c16d5f2791f64ab1d93383dc3d85d1358 | refs/heads/main | 2023-05-27T04:45:09.420140 | 2021-06-03T22:13:56 | 2021-06-03T22:13:56 | 320,792,421 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 735 | cpp | ZLogging.cpp | //
// Created by paul on 30/11/2020.
//
#include "ZLogging.h"
namespace ZLogging {
#if Z_DEBUG_OUTPUT == true
void beginLogger(unsigned long baud) {
Serial.begin(baud);
}
void log(const char *str) {
div_t d = div(millis(), 1000);
Serial.print(d.quot), Serial.write('.'), Serial.p... |
3c900428674281e4c4812a121296f5585bf35358 | 792cc0154791006a2e4fc8a3088cd090a72fac2c | /clvm_operator.h | 4a20ac8049b6a949f20ba189bffb2c896181d09b | [] | no_license | kitech/ruby-jit-qt | 2298ee6d02780c68bd745f923e67e87649174d2c | a138abfcda16e0d26cd9c30f8255926adc10d2cc | refs/heads/master | 2020-12-24T13:36:14.567039 | 2017-05-02T14:48:36 | 2017-05-02T14:48:36 | 26,012,744 | 16 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,270 | h | clvm_operator.h | #ifndef CLVM_OPERATOR_H
#define CLVM_OPERATOR_H
#include <QtCore>
#include "llvm/IR/IRBuilder.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/Type.h"
#include "llvm/IR/TypeBuilder.h"
class FrontEngine;
bool irop_new(llvm::LLVMContext &ctx, llvm::IRBuilder<> &builder,
llvm::Module *module, QString klas... |
ad965472c2800a752277e1e5ae6b69fa7b1cc1e7 | cc6f684543e01ee8044934743ce3225da50076e2 | /canal/canal.ino | fd6e023bb6b274c5be3f6de86a38f4f8c072be77 | [] | no_license | RyanH1234/IOT | 837840041ed4428ec99032bb0d6b93e09d2d070c | b67a5ea8c64be5b8593cbe53a66531605120f238 | refs/heads/master | 2023-04-27T16:41:07.782826 | 2021-05-01T04:10:57 | 2021-05-01T04:10:57 | 344,107,597 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,386 | ino | canal.ino | #include "Wire.h"
#include <TimeLib.h>
#include <TinyGPS++.h>
#include <SoftwareSerial.h>
#include <SPI.h>
#include <SD.h>
#include <LiquidCrystal.h>
static const int MPU_ADDR = 0x68;
const char* fileName = "DATA.CSV";
TinyGPSPlus gps;
SoftwareSerial ss(6, 5); // e.g. ensure pin 6 on arduino is linked to TX on GPS
L... |
77f2373e6fb2726a35389f3f603b1ed6e333977f | ca7e94eb918c080fe256f0120613f1251709229f | /HK3/OOP/code/practice/Tuan_04/1712358_lab4_copyconstructor/1712358_lab4_copyconstructor/Tuan_04/main.cpp | 2733a423062ede6f7b32d26b4929063fc33e13ba | [] | no_license | minhduc2803/School | 8965d49a0994cf1cf4a44d7268a513a92fceeb62 | e636cdc9869312472b2ad508d0abc9f4c12892c4 | refs/heads/master | 2022-12-26T04:41:28.511045 | 2021-01-23T05:36:11 | 2021-01-23T05:36:11 | 245,672,910 | 0 | 0 | null | 2022-12-11T20:53:27 | 2020-03-07T17:07:39 | C++ | UTF-8 | C++ | false | false | 1,741 | cpp | main.cpp | #include "Point.h"
#include "LineV3.h"
#include "RectangleV3.h"
#include "DynamicArray.h"
int Point::InstanceCount = 0;
int Line::InstanceCount = 0;
int Rectangle::InstanceCount = 0;
int main()
{
Point *A = new Point(0, 0);
Point *B = new Point(1, 5);
cout << "Now we have here 2 points A(0,0) and B(1,5)";
cout <... |
ab4194056c26a8a7dbb46d6a8d0b8071df36df96 | 600df3590cce1fe49b9a96e9ca5b5242884a2a70 | /third_party/WebKit/Source/web/WebSelection.cpp | 75f263deed98380222d0e0675e300732f20bd2f6 | [
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"MIT",
"Apache-2.0",
"BSD-3-Clause",
"LicenseRef-scancode-warranty-disclaimer",
"LGPL-2.1-only",
"GPL-2.0-only",
"LGPL-2.0-only",
"BSD-2-Clause",
"LicenseRef-scancode-other-copyleft"
] | permissive | metux/chromium-suckless | efd087ba4f4070a6caac5bfbfb0f7a4e2f3c438a | 72a05af97787001756bae2511b7985e61498c965 | refs/heads/orig | 2022-12-04T23:53:58.681218 | 2017-04-30T10:59:06 | 2017-04-30T23:35:58 | 89,884,931 | 5 | 3 | BSD-3-Clause | 2022-11-23T20:52:53 | 2017-05-01T00:09:08 | null | UTF-8 | C++ | false | false | 2,050 | cpp | WebSelection.cpp | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "public/web/WebSelection.h"
#include "core/editing/SelectionType.h"
#include "core/layout/compositing/CompositedSelection.h"
namespace blink {
... |
b7d5103acea3675423423b5e14f110716246c5b0 | dd22c07fd0a4d033f085e7bb9b3c07d70acba707 | /tracer3/src/shader_factory.h | 3b2d2748a3ddb9fcda649b71198b193e63be02f9 | [] | no_license | marma/tracerpp | 5f67b607e12cb5539aaa4beebbcab8e352e44757 | cba54961cb6de38b9c484720f1799e4ed4c9e36f | refs/heads/master | 2021-05-27T14:59:51.943121 | 2013-02-03T14:19:01 | 2013-02-03T14:19:01 | 7,989,572 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 798 | h | shader_factory.h | #ifndef __SHADER_FACTORY_H__
#define __SHADER_FACTORY_H__
#include <map>
#include <string>
#include "shader.h"
namespace tracer {
class shader_factory {
public:
// contructors & destructors
// methods
static int registerShader(shader *s) {
//std::cerr << "Registering shader '" << s->__name << "'... |
03ce9856d3ec0d7773eb75e398f2c8db697cd58e | a68a7971d0a9357fc3fab0183d356a7cb52a783f | /mbolge-gen.cpp | 9259783035c9b6e76e42148eea5c93448ec08609 | [] | no_license | jmbjorndalen/Malbolge-gen | e95ac5babc12fc73ed518bd737e662b3ec11d042 | 0028d9dc5f9ded619ee6935580ec1a519c5c5174 | refs/heads/master | 2020-06-08T06:19:11.129299 | 2015-05-19T21:33:31 | 2015-05-19T21:33:31 | 35,908,823 | 5 | 2 | null | null | null | null | ISO-8859-15 | C++ | false | false | 16,285 | cpp | mbolge-gen.cpp | /*
* Searches for a short Malboge program that prints the target string
* by using a branch-on-memory-read based interpreter: every time a
* new memory location is read, the interpreter branches off in all
* possible directions (for all possible values of that location),
* recursively searching for the shortest M... |
8747e16d477fa6c634aea5f6e1ead029cece5bda | e0925ef9e7f09a2511b73c9f35b4397187207319 | /random/greatest_power_of_2.cpp | 8c49df323903efa509da6dcf8846d905bde686cb | [] | no_license | ksadhu/random | f9c7a34d5ea7cd25a73803173bf88042c9698d33 | 804cedde2cecd654fb892049326b15cbe22ab963 | refs/heads/master | 2021-01-22T18:18:41.349826 | 2014-01-17T22:39:19 | 2014-01-17T22:39:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 159 | cpp | greatest_power_of_2.cpp | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int ans=n&(-n);
cout<<"greatest power of 2 that divides n is "<<ans<<endl;
return 0;
}
|
fe01c11612b8e78830b85fc509b8c3f6de87ff63 | 4f37a2544e5c665dc5a505f009b62aed78afc455 | /2017/sem1/seminar2/intro_unit_testing/tests/polylen_calc_unittest.cpp | 9a80b1c5246a034c92f4c3e9e63c21e2a67a4738 | [
"MIT"
] | permissive | broniyasinnik/cpp_shad_students | b6ccab3c61943f4167e0621f78fde9b35af39156 | eaff4d24d18afa08ecf8c0c52dfd3acc74e370d0 | refs/heads/master | 2022-10-31T13:49:31.901463 | 2022-10-13T11:08:42 | 2022-10-13T11:08:42 | 250,561,827 | 1 | 0 | MIT | 2020-03-27T14:53:02 | 2020-03-27T14:53:01 | null | UTF-8 | C++ | false | false | 750 | cpp | polylen_calc_unittest.cpp | #include "gtest/gtest.h"
#include "polylen_calc.h"
TEST(GetPolylineLen, GenericPolyline)
{
// arrange
std::vector<Point> polyline{
{0., 0.},
{3., 4.},
{3., 0.}
};
// act
double res = get_polyline_len(polyline);
// assert
EXPECT_DOUBLE_EQ(9., res);
}
TEST(GetPolylineLen, EmptyPolyline)
{
std::vector<... |
85d092f49778331ccc4d1e15542a948d53c3301e | 8ded7c00ee602b557b31d09f8b1516597a9171aa | /cpp/simple.cpp | fa63b15a460d6ba5ccaa14cf8226ee477b5152ff | [] | no_license | mugur9/cpptruths | 1a8d6999392ed0d941147a5d5874dc387aecb34d | 87204023817e263017f64060353dd793f182c558 | refs/heads/master | 2020-12-04T17:00:20.550500 | 2019-09-06T15:40:30 | 2019-09-06T15:40:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 287 | cpp | simple.cpp | #include <iostream>
#include <conio.h>
using namespace std;
int i=10;
int main(void)
{
string myname;
cout << "Hello World" << endl;
cin >> myname;
cout << (void *)cout.rdbuf();
cout << "My name is: " << myname << endl;
getch();
return 0;
}
|
c774c27fb366c1b48f48c201ebb04eb85832e54e | 93b5ad97f2a4de14d80d129a6d8cb93ba4f81ff9 | /include/GameController.h | 766e2a2b1940092ec0094c9ec6877ab853219bcf | [] | no_license | alexkitching/Tiny-Tanks | 4f5b10bd19029cde33460e6ddb480e9045189412 | 373c808625abe5785d1f79dea803665d5d6b9482 | refs/heads/master | 2021-09-01T12:07:51.919497 | 2017-12-26T22:23:52 | 2017-12-26T22:23:52 | 108,608,482 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,164 | h | GameController.h | //////////////////////////////////////////////////////////////////////////
// File: <GameController.h>
// Author: <Alex Kitching>
// Date Created: <6/4/17>
// Brief: <Header file for the Game Controller class, functions and variables.>
/////////////////////////////////////////////////////////////////////////
#i... |
ef4b6b156119c16a8eb8db828fd80a5823647687 | 625fb07c453c671a44111a910ea48848667a4c21 | /core/include/Timer.hpp | 370c74c37b36c227928c2d264ad01d88b83d6136 | [] | no_license | Murami/nibbler | 030dcd41b28b08d52444194a561b84c26d6cf0cf | f28074ddcf5e76e2315361b8e9cc999603cabc39 | refs/heads/master | 2022-05-16T21:28:30.189690 | 2014-04-06T20:54:45 | 2014-04-06T20:54:45 | 244,874,224 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 398 | hpp | Timer.hpp | //
// Timer.hpp for in /home/guerot_a/rendu/cpp_nibbler/core
//
// Made by guerot_a
// Login <guerot_a@epitech.net>
//
// Started on Tue Apr 1 15:34:01 2014 guerot_a
// Last update Sat Apr 5 17:44:56 2014
//
#ifndef TIMER_HPP
#define TIMER_HPP
class Timer
{
public:
Timer();
~Timer();
int getElapsedTime(... |
8e3383a3c3b396d2180da70a0e3a2f0dcd48d249 | 18e3a95712203d6f81734ac5638c1bf89e85fa21 | /Solver.cpp | b1559006799b9f7e8fecb5cdc3e366fcc7de6528 | [
"MIT"
] | permissive | darkedge/GT1 | 1ba926497d8b542fa98da47b810ab50a3ffb09d2 | b9b569909c4d505f16400e8b744fba714077c952 | refs/heads/master | 2021-01-02T09:37:27.580345 | 2014-03-16T18:05:08 | 2014-03-16T18:05:08 | 14,470,623 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,472 | cpp | Solver.cpp | #include "Solver.h"
#include "RigidBody.h"
#include "Transform.h"
using namespace GT1;
using glm::vec3;
using glm::mat3;
const int Solver::ITERATION_COUNT = 100;
// For the Successive Overrelaxation Method;
// @see http://mathworld.wolfram.com/SuccessiveOverrelaxationMethod.html
const float Solver::RELAXATION = 1.0... |
6a4ded7e941feee23411696423f2470005511d4b | 5d40a3ff81a0efd61bfb6066e4a2fdf99849d5ae | /A-32896/khachhang.h | 4036cf1b142ea7bbb11cd7b19737eaf26754c735 | [] | no_license | nguyenquan17/quannnnnnn | 276cb410252dc442f998d55f81264307c5e1169d | 14fd3384ba30231ca78e216860b34a70129a3ab9 | refs/heads/master | 2020-05-18T19:43:45.239090 | 2019-06-23T04:55:55 | 2019-06-23T04:55:55 | 184,615,467 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 740 | h | khachhang.h | #pragma once
#include "accout.h"
#include "BMW.h"
class khachhang: public account{
protected:
double sodu;
public:
khachhang();
khachhang(string ,int, string, double);
void setsodu(double);
double getsodu()const;
//
double themtien(double money);
double trutien(BMW *a);
};
khachhang::kha... |
d44d791f45eca7fe0de54725c2095720740674dc | 464367c7180487bba74097d6b229174b53246676 | /base/src/MemoryTraits.cc | 33275ce7e4cb930973716b97b40b8b8e259bbee0 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | openhwgroup/force-riscv | 5ff99fd73456b9918a954ef1d29997da2c3f2df7 | 144fb52a99cde89e73552f88c872c05d2e90b603 | refs/heads/master | 2023-08-08T14:03:54.749423 | 2023-06-21T02:17:30 | 2023-06-21T02:17:30 | 271,641,901 | 190 | 53 | NOASSERTION | 2023-09-14T01:16:08 | 2020-06-11T20:36:00 | C++ | UTF-8 | C++ | false | false | 18,047 | cc | MemoryTraits.cc | //
// Copyright (C) [2020] Futurewei Technologies, Inc.
//
// FORCE-RISCV is 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
//
// THIS SOFTW... |
685c45c456e44feff215ba3336ace4f57ac96094 | 0212e535be3d51ca5ec8f75f6d00bd022b4b4d7b | /Lumos/src/Utilities/CommonUtils.cpp | 74e362a41c1a27519ca6bfe07e659003cd0c4a63 | [
"MIT",
"LicenseRef-scancode-public-domain"
] | permissive | heitaoflower/Lumos | e4be9d63677fae8b85edf63006ff3693ff994c6c | 9b7f75c656ab89e45489de357fb029591df3dfd9 | refs/heads/master | 2022-04-24T14:17:14.530531 | 2020-04-26T14:31:32 | 2020-04-26T14:31:32 | 256,513,707 | 0 | 0 | MIT | 2020-04-27T07:51:17 | 2020-04-17T13:40:48 | null | UTF-8 | C++ | false | false | 9,330 | cpp | CommonUtils.cpp | #include "lmpch.h"
#include "CommonUtils.h"
#include "Physics/LumosPhysicsEngine/SphereCollisionShape.h"
#include "Physics/LumosPhysicsEngine/PyramidCollisionShape.h"
#include "Physics/LumosPhysicsEngine/CuboidCollisionShape.h"
#include "Utilities/AssetsManager.h"
#include "Physics/LumosPhysicsEngine/LumosPhysicsEngine... |
caf89162887b71d04157fe7dc052ded55c7867cb | 8b5863165a41f5b86e1918352d49daed9a75c0a7 | /bigballer/Bot.h | d1bc9b51b0b7c068f2b1281a5a7a17af9767df49 | [] | no_license | jsajnani79/Mechatronics-Basketball-Robot | 25f492130cb99c9693d41529580ea9a6308d7cf5 | a4d280ce6226217023ef6449c2e67c81602bf6ee | refs/heads/master | 2021-01-17T11:40:52.125503 | 2015-03-12T02:50:47 | 2015-03-12T02:50:47 | 30,993,171 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 626 | h | Bot.h | /*---------------- Module Defines ---------------------------*/
#ifndef Bot_h
#define Bot_h
#include "Motor.h"
class Bot
{
public:
Bot(unsigned char enableLeft, unsigned char dirLeft, unsigned char enableRight, unsigned char dirRight);
void moveForward(int dutyCycleR, int dutyCycleL);
void moveBackward... |
2af2b704e0e8abb87bf557cf4217ad4f7ac7f4ef | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/admin/pchealth/helpctr/service/searchenginelib/wrapper_keyword/pchsewrap.cpp | bc52084d29fa15f84ba860137953e7c9fb136c58 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 7,415 | cpp | pchsewrap.cpp | /******************************************************************************
Copyright (c) 2001 Microsoft Corporation
Module Name:
PCHSEWrap.cpp
Abstract:
Implementation of SearchEngine::WrapperKeyword
Revision History:
Davide Massarenti (dmassare) 06/01/2001
created
*******... |
8b4282f19345608ed195e39e09a7f65a0392460a | baf32fa1a4d3ac49b59c35f0a9226ff2a786fbc6 | /NumberTheoryCodes/gcd.cpp | 3455b4f0083b154769860c0dbba9672653b65a15 | [] | no_license | rajnishgeek/DSandAlgorithmPracticeSolution | 1ef24f140a2a5d9d435b7fa36edf77074473f7b6 | 2cdd988c286f61552bd92ae995415e613d8af2fa | refs/heads/master | 2023-07-14T21:15:24.016176 | 2021-09-01T18:00:04 | 2021-09-01T18:00:04 | 271,195,284 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 415 | cpp | gcd.cpp | #include<bits/stdc++.h>
using namespace std;
int gcd(int &x, int &y)
{
int r;
if(x>y);
else
{
r=x;
x=y;
y=r;
}
int gcdvalue=0;
r=x%y;
if(r==0)
return x/y;
while(r)
{
gcdvalue=r;
x=y;
y=r;
r=x%y;
}
return ... |
12ce04c2031656e4772c6da03527db8b9e747f1d | da715bb23c2f5fbbb541ce1499346d82f10cc8a2 | /Library/DCmotor.h | b40d39c762494494051814765924ff6c28ac8758 | [] | no_license | redzenova/uRobot_Motor_Drive | 443a4feb806c819e84b8f7187f63c4d3730ba0a3 | 44a81c467f57c09badda95a384779f73473a8c65 | refs/heads/main | 2023-04-01T09:50:46.149462 | 2021-04-03T20:02:11 | 2021-04-03T20:02:11 | 354,383,363 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,209 | h | DCmotor.h | /*======================================================
| Multi-Function Motor Driver and Control Board |
| 4 CH x (DC Motor Control) |
| |
| Design by Raweeroj Thongdee |
==============================... |
fc1826fd35b130d941f85d7651f3000ed7c677da | c218d50fda93a26a35dd8452b2fecde4cafdfdf1 | /ParallelLoadBalancing/LoadBalancing/include/LoadBalancing/IMPI.h | d632ae15b01491e0039c3c9f644b390678cbf588 | [] | no_license | Yliana/load-balancing | f62928be8f4931628b7b4aaaa8d48b17a1367267 | 70aabe977cd10ae1006ddb2e2f5ea83588e32db3 | refs/heads/master | 2021-01-18T00:04:50.441858 | 2012-12-17T23:15:48 | 2012-12-17T23:15:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,845 | h | IMPI.h | // ****************************************************************************
// LOAD BALANCING
// Copyright (C) 2012 Gerasimov, Smoryakova, Katerov, Afanasov, Kulakovich, Sobolev
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as pub... |
8f89161d688493fb7b6a40856dec14605db248d9 | 1a9ccaa3e9edeadcae31ff81ee20ee22327b5c10 | /gihkim/etc 1/2751.cpp | b9ad508c8cd0fbb96ab3eb423dccfb6be9591bfa | [] | no_license | 42somoim/42somoim3 | e939a11f39ac5bc00f73df0bda4f5aa43bb99360 | 7b4b123e50363861475a9888ec330e4acc275fea | refs/heads/main | 2023-02-22T05:29:53.472744 | 2021-01-26T10:59:02 | 2021-01-26T10:59:02 | 300,508,013 | 0 | 1 | null | 2020-11-17T11:20:54 | 2020-10-02T05:15:00 | C++ | UTF-8 | C++ | false | false | 1,087 | cpp | 2751.cpp | #include <iostream>
using namespace std;
void change(int arry1, int arry2, int last, int *arry, int *table)
{
int tmp;
int idx_t;
idx_t = 0;
for (int idx = arry1; idx <= arry2-1; idx++)
{
for (int idx1 = arry2; idx1 <= last; idx1++)
{
if (arry[idx] > arry[idx1])
{
table[idx_t] = arry[idx1];
... |
7ac61f9b4bef1e0876117a0ce504eefa6b02db2b | e589fb440835151e7b9913ccad0bc1b1fc844ebe | /Commands/Deliver.cpp | 8c2ba23c598db4bde48de55db9920dc43a7bb878 | [] | no_license | lsthiros/NOROBOT2013 | 15a5ccce52ed831d8ecb3f4baa91d2d151535235 | 5bdd53cd44f49e52ffc780db0543edcd5b234c45 | refs/heads/master | 2016-09-15T23:43:50.638703 | 2013-03-01T00:52:52 | 2013-03-01T00:52:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 232 | cpp | Deliver.cpp | #include "Deliver.h"
#include "WPILib.h"
#include "DeliveryKick.h"
Deliver::Deliver(bool upper) {
AddSequential(new DeliveryKick(upper, true));
AddSequential(new WaitCommand(.5));
AddSequential(new DeliveryKick(upper, false));
} |
d86fc7bda33bd8c8e5a840101944d89e5a94d486 | cc2a953fc0a4f42f796a89d90dfb2d7703ecdb09 | /Contest & Online Judge/SPOJ/TAP2016E.cpp | 1516bf2b1f319c934cb2419a5b6ae0658eb5f472 | [] | no_license | 210183/CP | 107af662a3ab759760b14c6ed31fb21dc7c274e4 | bd0b74aa2a90e12c5e5f45ac251de9d6cf69a7c6 | refs/heads/master | 2020-08-05T05:41:36.075888 | 2019-07-07T02:23:05 | 2019-07-07T02:23:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,044 | cpp | TAP2016E.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 1005;
bool vis[N][N];
vector<int> radj[N][N];
int n, m;
bool init() {
if(scanf("%d %d",&n,&m) != 2) return 0;
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= m ; j++) {
int x; scanf("%d",&x);
radj[j][x].push_back(i);
}
return 1;
}
bool solv... |
097943870531981d4da2534661a2893dc8963755 | dffefb5bf3239436511af116ef3d60e377909437 | /chapter02/EX2.03(P13).cpp | 8817cec5adc429fde87eedb2b1596832ced9fe5c | [] | no_license | nideng/Data_Structures | d9e8ae067b9fb3b0d26655de769834ec885afd17 | 7165538624f186ccfe321f7e1f855df11d0842c7 | refs/heads/master | 2021-05-24T09:38:50.184718 | 2020-04-25T16:10:56 | 2020-04-25T16:10:56 | 253,500,791 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 93 | cpp | EX2.03(P13).cpp | /*
当不需频繁在存储的元素间进行插入和删除操作时，用顺序表较好
*/ |
00a58b3022f9517fa7755e49716085ca49819d8a | 8d991e979b3eb1051998ea7dd6195011c506c0fc | /HackerRank/HR_Chessboard_Game_Again.cpp | 042f56da6f13f2917cfca1de9208f3a074c1fd47 | [] | no_license | caogtaa/OJCategory | b33ccdfb6534f6856ab7b5668c9433c144d9f905 | cfedef5c64c48dd2b7245b1ff795af9312e7707e | refs/heads/master | 2020-09-21T13:06:25.028801 | 2020-02-05T09:05:18 | 2020-02-05T09:05:18 | 224,797,482 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,367 | cpp | HR_Chessboard_Game_Again.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int G[15][15];
pair<int, int> delta[4] = {
{-2, 1},
{-2, -1},
{1, -2},
{-1, -2}
};
int Grundy(int x, int y) {
int &ret = G[x][y];
if (ret == -1) {
vec... |
bbfe6c1b1b1643c43c9f6f21a5e252a87a437a2d | d17ea175e8047800e9e8adf78187b7e381428074 | /src/coronaOSL/oslUtils.cpp | 6ab4211078327dd6643130de8a10fba3b63714ac | [] | no_license | wildparky/mayaToCorona | 9aaa6de5d3a60735656cf9884f43be64dcefc414 | 38bd9618dac01e674899164425a289027a71aa10 | refs/heads/master | 2021-01-23T22:11:02.007879 | 2016-01-24T18:35:07 | 2016-01-24T18:35:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,516 | cpp | oslUtils.cpp | #include "oslUtils.h"
#include <maya/MPlugArray.h>
#include <maya/MFnDependencyNode.h>
#include "utilities/logging.h"
#include "utilities/tools.h"
static Logging logger;
namespace OSL{
void listProjectionHistory(MObject& mobject, ProjectionUtil& util)
{
MFnDependencyNode depFn(mobject);
MStatus stat;
MPlugArr... |
401522ed2e7adcf96aaa0cd164a2d2ac02bb2e74 | 786e39df00e252ab241bd024862a43a3ad4968ac | /VJTI Coding Club/VCC-1/Goku And Ancient Country.cpp | 6b27ea2ad5f4655aa39f51971ba2f63beb8d26ab | [] | no_license | mishka1980/competitive-programming | 51e9366c012eaa25cb48c588fdbcd089e6e5f1e0 | c13b805a7dd9ab1228a91a3d088331ce3f0f99bf | refs/heads/master | 2020-03-21T02:05:16.260788 | 2015-01-13T17:21:21 | 2015-01-13T17:21:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,001 | cpp | Goku And Ancient Country.cpp | #include <vector>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... |
22c5912afbf4fca4c71d5032da7c86474ec8e76b | 45b32ffcdc7ac3864c0b810b61deeee136616554 | /GameEditor/QtGameEditor/Src/TreeWidget/MyDirModel.h | f6ba9d944c0562e55164a308605322e32339d865 | [] | no_license | atom-chen/Tools-2 | 812071cf6ab3e5a22fb13e4ffdc896ac03de1c68 | 0c41e12bd7526d2e7bd3328b82f11ea1b4a93938 | refs/heads/master | 2020-11-29T10:05:24.253448 | 2017-07-12T06:05:17 | 2017-07-12T06:05:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 166 | h | MyDirModel.h | #ifndef __MyDirModel_H
#define __MyDirModel_H
#include "QtIncAll.h"
class MyDirModel : public QDirModel
{
public:
MyDirModel();
};
#endif // __FileSystemModel_H |
cd74df3862d8fd3e44a8ff8794eecc679d25da5a | 1cf5270086bd43fddf9989b282254d2464d031ea | /System Monitor/src/system.cpp | b5c6f8c7e37fdf5688f378f4587368b87fe62daa | [
"MIT"
] | permissive | Mostafa-Alakdawi/Personal-Projects | 2383ad6cd75d9192e775126e6601d6b8a33c441c | bffacda5a3aeac1ef33bb9cb19a3f5fc4368ccc7 | refs/heads/master | 2023-02-17T08:12:25.385856 | 2021-01-18T14:04:13 | 2021-01-18T14:04:13 | 292,952,761 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,334 | cpp | system.cpp | #include <dirent.h>
#include <unistd.h>
#include <cstddef>
#include <set>
#include <string>
#include <vector>
#include <iostream>
#include "system.h"
#include "process.h"
#include "processor.h"
#include "linux_parser.h"
using namespace LinuxParser;
using std::set;
using std::size_t;
using std::string;
using std::vec... |
4b38e9f964ca273921a42e63244f6e30b3526a94 | 494c26f6678ecfb6d2ea67bda94da860fb29e422 | /proj11/proj11.cpp | ae12abb9ec1eb1537e3b0500c3889bbd98064e10 | [] | no_license | mattmenna/CSE231 | 8d0b6cd62ecf8f280c5fe448ceeb0c5fb8299e1e | 390d7344dcbb04148b29c9651d6f725f23074094 | refs/heads/master | 2020-12-02T19:22:11.292805 | 2017-07-05T15:04:25 | 2017-07-05T15:04:25 | 96,331,121 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,290 | cpp | proj11.cpp | #include <iostream>
#include "mennamat.h"
#include "dummy.h"
#ifndef MOVE_
#define MOVE_
enum Move {Cooperate, Defect};
#endif
using namespace std;
main()
{
ostream & operator<<(ostream&, Move &m);
int rounds;
int player1Year =0;
int player2Year =0;
mennamatPlayer Player1;
dummyPlayer Player2;
Move move1=Cooperate;... |
90a15506b229ade058e46b494c04d6af1374af6a | d9a66840bf09cb926de8ee1749a47acc11bcdd05 | /old/AtCoder/agc003/B.cpp | e2e81e9509eb18e11d9977b5bc85914b6d67a999 | [
"Unlicense"
] | permissive | not522/CompetitiveProgramming | b632603a49d3fec5e0815458bd2c5f355e96a84f | a900a09bf1057d37d08ddc7090a9c8b8f099dc74 | refs/heads/master | 2023-05-12T12:14:57.888297 | 2023-05-07T07:36:29 | 2023-05-07T07:36:29 | 129,512,758 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 210 | cpp | B.cpp | #include "template.hpp"
int main() {
int64_t n, a, c = 0, res = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
res += (a + c) / 2;
c = a ? (a + c) % 2 : 0;
}
cout << res << endl;
}
|
64388717fff3f79f9fde174517207efb6d1d3cb4 | 9b86a8dfaa30306a12fac2687236d7931950b5a3 | /src/4_object_factory/main.cc | b8d957a344219f8fb70af3fb61e7cd5e43027dd7 | [] | no_license | SageWu/addon-example | 378ecfd95c7c5b7838f3b4ec7509158ac99dea82 | 30be79f0829a185fb0694a00c326a34ed422c638 | refs/heads/master | 2023-03-30T08:19:22.039943 | 2021-04-10T04:03:28 | 2021-04-10T04:03:28 | 351,468,204 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 532 | cc | main.cc | #include <node.h>
using namespace v8;
void CreateObject(const FunctionCallbackInfo<Value>& info) {
Isolate* isolate = Isolate::GetCurrent();
// 创建scope
HandleScope scope();
// 创建对象
Local<Object> obj = Object::New(isolate);
obj->Set(String::NewFromUtf8(isolate, "msg"), info[0]);
// 返回对象
info.GetRetur... |
311a8e667bb9b27fea954250a9b81501fb4a64e5 | fe7b1e7729a06e7294f14d3a504409dbc03ca9bb | /Echelle.h | 746e59b8d4142fddd86d87a1685b3cb393330c9c | [] | no_license | demandre/donkey-kong-cpp | 382a440009a7092be02859c65131d80dbe441f9f | 64b915fa38d08d16d32bd5f625c8fe6e1c364c2e | refs/heads/master | 2022-11-13T00:02:36.128550 | 2020-07-10T23:00:43 | 2020-07-10T23:01:13 | 279,153,422 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 70 | h | Echelle.h | #pragma once
#include "Entity.h"
class Echelle :
public Entity
{
};
|
e2b53802ddcee8ddf7266949b97e0559054c536a | f2eff57b83f7388b1df4bb660ac121d58eef2ce5 | /cpp04/ex01/Enemy.hpp | 6fd56ffaff6b166c6e4e751b7772cf24882ae964 | [] | no_license | janusz1995/CPP-MODULES | ea0acb7106c5930ba2cc9879b7507da49dd73fc7 | 43ed4e3a4a58c6bde1e11935976cc9bcb22b6c4f | refs/heads/master | 2023-03-11T20:25:16.602332 | 2021-03-01T11:09:20 | 2021-03-01T11:09:20 | 343,384,262 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 349 | hpp | Enemy.hpp | #ifndef ENEMY_HPP
# define ENEMY_HPP
# include <iostream>
class Enemy{
protected:
int hp;
std::string type;
Enemy();
public:
Enemy(int hp, std::string const &type);
Enemy(Enemy const &enemy);
int getHp() const;
std::string getType() const;
virtual void takeDamage(int);
Enemy& operator=(Enemy const &enemy);
... |
a55c147c1b6a7c07a7a8226a0f25830c27b3e25d | 479a9c76b19b84d6cde69305828031cd2531aa56 | /rest/rest_request_router.cc | 3a2371cd949e5dfdc9d93973d1aadf4783ef72b5 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | mldbai/mldb | d36801bd99dd3f82d7557cd0f438b0121f63f22c | 19bc4bc92a41ee8ad4eab0979dffd9c985d95758 | refs/heads/master | 2023-09-03T22:59:11.621839 | 2022-12-30T18:42:24 | 2022-12-30T18:42:24 | 47,634,692 | 701 | 107 | Apache-2.0 | 2023-02-10T23:08:05 | 2015-12-08T16:34:16 | C++ | UTF-8 | C++ | false | false | 30,778 | cc | rest_request_router.cc | // This file is part of MLDB. Copyright 2015 mldb.ai inc. All rights reserved.
/* rest_request_router.cc
Jeremy Barnes, 15 November 2012
Copyright (c) 2012 mldb.ai inc. All rights reserved.
*/
#include "mldb/types/url.h"
#include "mldb/rest/rest_request_router.h"
#include "mldb/utils/vector_utils.h"
#include ... |
30ffbb664089959dbe2b835ba09add4508813a86 | 2132b3aad607c4cec2a05ea0c523d59724dd2a68 | /modules/src/csdm_mm.cpp | d5905bfb5e5f64251db9dfd7539b42b9cf373e2d | [
"Apache-2.0"
] | permissive | zirplex/countering | a8745396631bb47e7b92dd65b922c4c20be4152e | a28cb8bed06bbb3269c41c2fdd0c35b432022785 | refs/heads/master | 2021-01-07T13:11:27.951913 | 2020-02-25T19:27:32 | 2020-02-25T19:27:32 | 241,704,592 | 0 | 0 | Apache-2.0 | 2020-02-20T09:25:10 | 2020-02-19T19:19:03 | Dockerfile | UTF-8 | C++ | false | false | 10,722 | cpp | csdm_mm.cpp | #include "amxxmodule.h"
#include "csdm_amxx.h"
#include "csdm_message.h"
#include "csdm_timer.h"
#include "csdm_config.h"
#include "csdm_player.h"
#include "csdm_util.h"
#include "csdm_tasks.h"
#include "csdm_spawning.h"
#define FRAMEWAIT 2.0f
#define GETINFOKEYBUFFER (*g_engfuncs.pfnGetInfoKeyBuffer)
#define SETC... |
7d0f17fdb0e870f81230a07975e8e589ce8e7675 | a34f083ca56929f9d0d40f7e36a9b94bc2b0830b | /src/diffuse.hpp | 4475a0b626f5deb43d42671f003f1e33f3f7fdab | [] | no_license | sakanaman/RayStatistics | c07c26e9989540173547bbb335de21af10215df6 | 7b69b0e140503bdbd84a6c40765c52b39d9f3664 | refs/heads/master | 2022-11-03T02:22:41.769532 | 2020-06-17T23:38:58 | 2020-06-17T23:38:58 | 256,610,697 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 194 | hpp | diffuse.hpp | #ifndef DIFFUSE_HPP
#define DIFFUSE_HPP
#include "vec.hpp"
Vec sample_cosine_hemisphere(float u, float v);
Vec brdf_diffuse(const Vec& albedo);
float pdf_diffuse(const Vec& wi);
#endif
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.