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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
77f5545c72223029be66419b5f91660641522577 | e73121fcfcc4df2e7092a82f4810ce9615e9dd83 | /Codeforces/Cormen --- The Best Friend Of a Man.cpp | a27d4eb99aa987fe2d92b35cae113e70ec18bee0 | [] | no_license | Redwanuzzaman/Online-Judge-Problem-Solutions | 1aba5eda26a03ed8cafaf6281618bf13bea7699b | f2f4ccac708bd49e825f2788da886bf434523d3c | refs/heads/master | 2022-08-29T04:10:31.084874 | 2022-08-14T18:20:30 | 2022-08-14T18:20:30 | 142,601,682 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 489 | cpp | Cormen --- The Best Friend Of a Man.cpp | //Rechecking
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k, sum = 0, tmp, dif;
cin >> n >> k;
int arr[n+2];
for(int i = 0; i < n; i++) cin >> arr[i];
for(int i = 1; i < n; i++)
{
tmp = arr[i] + arr[i-1];
if(tmp < k)
{
dif = k - tmp;
... |
8650f9d1647f67f875a03dcb32491264156d0c5d | 31e417531ed8dfc2f49db0626aa2694c3221f39d | /Synchronisation.ino | 19538e02aac0802879f7ad6ca60bb213b98416bc | [] | no_license | DmitriySM/C_code_sample_embedded | c5c1899cc05a2151d5b3aa09caa16b7e49eedb7c | 0814253176f9e491ca2830138cc71e023f17e8f7 | refs/heads/master | 2020-05-22T08:54:47.496205 | 2019-05-12T18:35:14 | 2019-05-12T18:35:14 | 186,289,514 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,259 | ino | Synchronisation.ino | char buffer[100];
int servo1pos;
void syncWithPC()
{
boolean communicationComplete = false;
char str[100];
int i = 0;
while (!backFlag)
{
while (ReceivedChar != '\n') {
if ( backFlag == true) break;
if (in_char)
{
in_char = 0;
str[i] = ReceivedChar;
i++;
}... |
ee5915bf6470b3cf7d10b62df4c0c1e989de328a | d86b6c6d4a2f099b4689e8fd5524c128ce603941 | /CatMullRomSpline.h | d77e4b10394eea06a18a9d3bfb6d21f3b4ef7a5f | [] | no_license | nikodems/tools-programming | 931f874b4c37a42152c8edcec107c75267ac4dba | 29476aa0e967a98baad7b268e85549999c1770fe | refs/heads/master | 2022-11-13T16:21:13.163141 | 2020-07-08T17:11:45 | 2020-07-08T17:11:45 | 278,148,829 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 466 | h | CatMullRomSpline.h | #ifndef _CAT_MULL_ROM_SPLINE_H
#define _CAT_MULL_ROM_SPLINE_H
#include <d3d11.h>
#include <SimpleMath.h>
#include "SceneObject.h"
#include <vector>
#include <algorithm>
class CatMullRomSpline
{
public:
CatMullRomSpline();
~CatMullRomSpline();
std::vector<std::vector<SceneObject>> FindAIObjects(std::vector<SceneOb... |
eff2e89570cc898b0ab9ba2dcf77be236c8d7d19 | b9bd6891231d2c78d058db5d19571975424e7376 | /Array/1.Sort Colors.cpp | 0a75933d941a3e56253bddf62673b78663d78aba | [] | no_license | suresh213/Dsa-practice | 7f70aa318638cef327b3d695dd0acb3b4b76db63 | e1031f734ebe4f4127bddb3b2c6d4065ef1c894d | refs/heads/master | 2023-06-29T18:32:30.542208 | 2021-08-06T18:52:52 | 2021-08-06T18:52:52 | 387,693,096 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 477 | cpp | 1.Sort Colors.cpp | //Time complexity: o(nlogn)
using merge sort
//Time complexity: o(n)
count 0,1,2 and make while to to rearrange;
//Time complexity: o(n)
//Single traversal
void sortColors(vector<int>& nums) {
int start=0,mid=0,end=nums.size()-1;
while(mid<=end){
if(nums[mid]==0){
swap(nums[start++],... |
0aaaac1fde81719eb736537ef6c78333f8d7e8c4 | f34b5a529e2fa17b5d83a1e4a11115d591414ffa | /lib/Implementation/aerosol_extinction_log_test.cc | b78f4a5abfac4d407197ff23e65b8ec15ab99210 | [] | no_license | ReFRACtor/framework | 89917d05e22dd031e12d12389157eb24cebeaada | 882e13c3e94e6faa1281a0445abc0e08b2f8bf30 | refs/heads/master | 2022-12-08T17:12:49.696855 | 2022-11-28T23:30:50 | 2022-11-28T23:30:50 | 98,920,384 | 4 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 872 | cc | aerosol_extinction_log_test.cc | #include "aerosol_extinction_log.h"
#include "met_data_fixture.h"
#include "unit_test_support.h"
using namespace FullPhysics;
using namespace blitz;
BOOST_FIXTURE_TEST_SUITE(aerosol_extinction_log, MetDataFixture)
BOOST_AUTO_TEST_CASE(basic)
{
// Arrays defining coeffs
blitz::Array<double, 1> aext(20);
aext =... |
175d06a7bc0a58f46b92f28e2d4c60719d1d45d6 | a181e4c65ccef369d4ab7e182e2818aa622debc1 | /yact/stub_dlls/msacm32_stub/msacm32.cpp | 9153fd0b959ebfa3039a609f8ea1ebb26cd42ef1 | [] | no_license | c1p31065/Win86emu | 259c32eb5bac1ed9c4f5ceebe2ca0aa07fdf4843 | 71c723fcab44d5aae3b6b3c86c87154ad3c4abb5 | refs/heads/master | 2021-12-02T18:24:51.564748 | 2014-02-06T14:12:11 | 2014-02-06T14:12:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,451 | cpp | msacm32.cpp | #include "dllstub_def.h"
static const char DLL_NAME[]="msacm32.nt.dll";
DEFINE_FUNC5(DriverProc)
DEFINE_FUNC9(XRegThunkEntry)
DEFINE_FUNC5(acmDriverAddA)
DEFINE_FUNC5(acmDriverAddW)
DEFINE_FUNC2(acmDriverClose)
DEFINE_FUNC3(acmDriverDetailsA)
DEFINE_FUNC3(acmDriverDetailsW)
DEFINE_FUNC3(acmDriverEnum)
DEFINE_FUNC3(ac... |
8f43933cf2c60b53af552775fdf951e407e7bc4d | c56c93f5e983fdca9a43f4ef6b04a673d745da44 | /transfer/common/server.cc | e308c998c2996d26c4edbaff293edc05bdda97b7 | [
"MIT"
] | permissive | djpetti/CSCI4230-DES | b138a510ad3b898592127ad2edb6759dffee2997 | 6a561987f0b658f6f7ca404ebcbf5b9b33d65091 | refs/heads/master | 2020-03-28T21:07:32.022321 | 2018-11-04T13:08:15 | 2018-11-04T13:11:21 | 149,130,499 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,990 | cc | server.cc | #include "server.h"
#include <arpa/inet.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <unistd.h>
#include <algorithm>
namespace hw1 {
namespace transfer {
namespace common {
namespace {
// Binds a socket to a port.
// Args:
// socket: The sock... |
0eba56a4225c1a0e25b3de0b465e8a4d2569f639 | e302db77bdfc8c088cd8acbdce3eb2d7f6c20aa1 | /Unit.h | f4648ddae0ad1a318c6c39ac45f0fd9abd427445 | [] | no_license | dong-yeon-lee/git_starcraft | e34b609362bc2065291d23102453f74b4ba5a89b | d1c8511d72ce120dfd40a2d5b94000041ba3438d | refs/heads/master | 2023-03-12T06:30:41.294222 | 2021-03-02T07:08:05 | 2021-03-02T07:08:05 | 343,677,596 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 680 | h | Unit.h | #pragma once
#include <iostream>
#include <cmath>
using namespace std;
struct Location
{
float x;
float y;
};
class Unit
{
public:
Unit();
Unit(Location currentLocation_ , Location targetLocation_);
Unit(const Unit& other);
virtual ~Unit();
virtual void SetLocation(... |
fca91a0af4fc54fb8fa6aa7fb983fb1ddea50ae7 | 1755e560141b34c4d5323ee7afe30caf7bffde92 | /include/ModuleGraph/Module.h | 560165a2e7855f86295ee8f2f57c6d78b5d0d0ce | [] | no_license | marakj/RealityNotFound | c9b969ee9c8842285e36c9b9cb5b0974eaca7291 | b848fb7107e6c33a11bf44431ec96314837729d9 | refs/heads/develop | 2020-04-08T11:04:00.106525 | 2017-05-01T09:24:52 | 2017-05-01T09:24:52 | 31,653,340 | 0 | 0 | null | 2017-05-16T13:15:31 | 2015-03-04T11:21:59 | C++ | UTF-8 | C++ | false | false | 556 | h | Module.h | #pragma once
#include <osg/PositionAttitudeTransform>
namespace ModuleGraph {
/**
* \class Module
* \brief
* \author Denis Illes
* \date 9. 11. 2016
*/
class Module : public osg::PositionAttitudeTransform
{
public:
Module();
float getLength();
float getWidth();
float getHeigth();
void setLength( floa... |
33f9bfa6aa5ca26164ca6fb70801044b2eeb01eb | a8915f0f1f95ba0902bf0873da013e7e8524bcc3 | /packages/UGV/octomap_scout/src/location/mapLoader.cpp | 8ee49883199a7e89dbe874427502e9baff75aaf4 | [] | no_license | FamiliennameistChow/ROS_beginner | b9007ff97d85ec0d0f80edad9ccf30ebe4f59c39 | 43edd30928f264fc0b2146e73ced08261e668956 | refs/heads/master | 2022-07-08T03:20:42.220520 | 2022-06-25T09:14:04 | 2022-06-25T09:14:04 | 206,729,014 | 14 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 3,014 | cpp | mapLoader.cpp | #include "mapLoader.h"
MapLoader::MapLoader(ros::NodeHandle &nh){
std::string pcd_file_path, map_topic;
nh.param<std::string>("pcd_path", pcd_file_path, "");
nh.param<std::string>("map_topic", map_topic, "point_map");
init_tf_params(nh);
pc_map_pub_ = nh.advertise<sensor_msgs::PointCloud2>(map_to... |
a0df0b242d8fd1fe5bade379bfad09801af50b00 | 39bcafc5f6b1672f31f0f6ea9c8d6047ee432950 | /src/main/database_path_and_type.cpp | 64f1f9cee426747eb181f839413ceb21c2c4643f | [
"MIT"
] | permissive | duckdb/duckdb | 315270af6b198d26eb41a20fc7a0eda04aeef294 | f89ccfe0ec01eb613af9c8ac7c264a5ef86d7c3a | refs/heads/main | 2023-09-05T08:14:21.278345 | 2023-09-05T07:28:59 | 2023-09-05T07:28:59 | 138,754,790 | 8,964 | 986 | MIT | 2023-09-14T18:42:49 | 2018-06-26T15:04:45 | C++ | UTF-8 | C++ | false | false | 866 | cpp | database_path_and_type.cpp | #include "duckdb/main/database_path_and_type.hpp"
#include "duckdb/main/extension_helper.hpp"
#include "duckdb/storage/magic_bytes.hpp"
namespace duckdb {
DBPathAndType DBPathAndType::Parse(const string &combined_path, const DBConfig &config) {
auto extension = ExtensionHelper::ExtractExtensionPrefixFromPath(combin... |
52711e7c0cf9e3dc6742ba130231f13f1ae3ebbc | 921772e18425b0532d71c051a8b189253ecbf600 | /큰 넓이 구하기/solution.cpp | 56d32bbaaff85bbde0a4840097f085829e6942dd | [] | no_license | alps-jbnu/alps-acm-problems-2015 | afd96548ce1312ea8825e9bf7669842c61a53f0c | e4a2611e456b41076ed53f006453f0a57cf12170 | refs/heads/master | 2020-12-28T22:52:59.168553 | 2015-09-24T00:32:06 | 2015-09-24T00:32:06 | 36,120,249 | 0 | 1 | null | 2015-06-01T03:43:26 | 2015-05-23T11:27:52 | C++ | UTF-8 | C++ | false | false | 347 | cpp | solution.cpp | #include <iostream>
using namespace std;
int main()
{
double a, b, c, d;
cin >> a >> b >> c >> d;
double triangle = c * d / 2.0;
double rectangle = a * b - triangle;
cout.setf(ios::fixed);
cout.precision(1);
if (triangle > rectangle)
cout << triangle;
else
cout << rect... |
a5125c569a373c1127ed6816b518a1fac1e409d0 | b75a312629ad5a68aa2cb377785acf2019514a4c | /Qt/mainwindow.h | ad45af4d738da401fe50e4e7d28021e18598f48c | [] | no_license | IvanRamyk/QChess | 69bb89b954feab2b601b65ab6f36b5cd972ac66e | a4b468a6a659754ac9447ffd0e153c7c6920be40 | refs/heads/master | 2020-09-29T06:23:40.144323 | 2019-12-17T10:43:21 | 2019-12-17T10:43:21 | 226,974,316 | 1 | 2 | null | 2019-12-16T19:30:43 | 2019-12-09T21:47:49 | C++ | UTF-8 | C++ | false | false | 3,367 | h | mainwindow.h | #ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include <QMainWindow>
#include <QPainter>
#include <QMenuBar>
#include <QMouseEvent>
#include <QLabel>
#include <QTextBrowser>
#include <QPoint>
#include <QCheckBox>
#include <string>
#include <iostream>
#include <string>
#include "images.h"
#include "field.h"
#include "../sr... |
0cac7f18d2dca79b7cede8d5a78cc0817c921b63 | b647c14c77df2d3c412fa2953ce63f15a2e08457 | /Regulator.hpp | bc4b1ba9ec28b0b9adce808faab30c94071ee68d | [] | no_license | AndreiMoiceanu29/DC-Motor-RPM-Control | aea54308462796619f1d93c54adc230bb1fda233 | d4b731b84437dce366b4c53ab428ce5ab42220fa | refs/heads/main | 2023-03-23T18:15:48.239180 | 2021-03-18T20:29:16 | 2021-03-18T20:29:16 | 349,208,582 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 217 | hpp | Regulator.hpp | #include "Semnal.hpp"
#include "Interval.hpp"
#ifndef H_REGULATOR
#define H_REGULATOR
class Regulator
{
virtual Semnal genereaza_comanda(Semnal) = 0;
virtual Semnal calculeaza_eroare(Semnal, Semnal) = 0;
};
#endif |
633d726fc8ebf77faeb33c8a4af99217d66776ba | 445818eb70a629c9f4fa68142d8bfd944bacd3a7 | /source/drivers/system/system_intf.hpp | 1da321202a830390404ebc304e872671f220d04e | [
"MIT"
] | permissive | brandonbraun653/Chimera | 7528520d9406f6c57e90c6d8e8451882abfa6e11 | b25d699f392882d7f4b3b1305f6181f5a5e1fbc1 | refs/heads/master | 2023-08-17T01:32:39.583277 | 2023-05-27T00:31:03 | 2023-05-27T00:31:03 | 127,049,804 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 937 | hpp | system_intf.hpp | /******************************************************************************
* File Name:
* system_intf.hpp
*
* Description:
* Models the Chimera system interface
*
* 2019-2020 | Brandon Braun | brandonbraun653@gmail.com
*****************************************************************************/
... |
9559d8c54faa439378e9e5e5d1863533425211b7 | 4fd9f29b20e26b7cc80d748abd8f1dcd94fbbfdd | /Software rasterizer/Lukas Hermanns/SoftPixelEngine/sources/Framework/Sound/spOpenSLESSoundDevice.hpp | c78152db783db6cc38d266c5a6b9691345c7c19e | [
"Zlib"
] | permissive | Kochise/3dglrtvr | 53208109ca50e53d8380bed0ebdcb7682a2e9438 | dcc2bf847ca26cd6bbd5644190096c27432b542a | refs/heads/master | 2021-12-28T03:24:51.116120 | 2021-08-02T18:55:21 | 2021-08-02T18:55:21 | 77,951,439 | 8 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 1,952 | hpp | spOpenSLESSoundDevice.hpp | /*
* OpenSL|ES sound device header
*
* This file is part of the "SoftPixel Engine" (Copyright (c) 2008 by Lukas Hermanns)
* See "SoftPixelEngine.hpp" for license information.
*/
#ifndef __SP_AUDIO_SOUNDDEVICE_OPENSLES_H__
#define __SP_AUDIO_SOUNDDEVICE_OPENSLES_H__
#include "Base/spStandard.hpp"
... |
3271af3c83c12a921799e21ed16b39c0cfa052fd | 6d6560e5a4a46dfe2e3570608812750245eb7c9c | /test/signal-pmf.cpp | bdc8eabe88e09a98c6cf0d937e825829b3a9d6ca | [
"MIT"
] | permissive | palacaze/sigslot | 627647b3f9c66d049ded980bc926c38eed6f6036 | da1a8b262b79da8f67ceca72c4e9318445beadba | refs/heads/master | 2023-08-30T18:28:22.193674 | 2023-08-27T16:46:29 | 2023-08-27T17:05:09 | 90,383,729 | 587 | 101 | MIT | 2023-07-06T01:38:11 | 2017-05-05T14:21:32 | C++ | UTF-8 | C++ | false | false | 2,422 | cpp | signal-pmf.cpp | #include <algorithm>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
// A program that computes the function pointer size and uniqueness for a variety
// of cases.
void fun() {}
struct b1 {
virtual ~b1() = default;
static void sm() {}
void m() {}
virtual void vm() {}
};
str... |
9902c69570af1205ded4a57e596ac829aa1c1f4a | 6ea59bbb80568313db82a3394f23225c01694fe5 | /Coursework_Edmand_Karp_max_flow/Test_Coursework/Edmonds_Karp_Unit_test.cpp | 319a309e57cffaf044c2ac663df3e3ca3c6d0bd2 | [] | no_license | RaifGaripov/Cantina | ccdbb08bcf30d9fe30fcf9c7c18bae49787fa508 | 45b6069795c1fa08204749c315b348a208994f55 | refs/heads/testing | 2021-07-16T06:21:38.604600 | 2020-05-31T08:04:44 | 2020-05-31T08:04:44 | 160,087,286 | 0 | 0 | null | 2020-05-14T11:54:03 | 2018-12-02T19:58:59 | C++ | WINDOWS-1252 | C++ | false | false | 1,371 | cpp | Edmonds_Karp_Unit_test.cpp | #include "pch.h"
#include "CppUnitTest.h"
#include "C:\Users\raifg\source\repos\Coursework_Emdomds_Carp_max_flow\Coursework_Emdomds_Carp_max_flow\Edmonds_Karp.h"
using namespace Microsoft::VisualStudio::CppUnitTestFramework;
namespace EdmondsKarpUnittest
{
TEST_CLASS(EdmondsKarpUnittest)
{
private:
Netw... |
e64759aa8b9c29cadc0fc8629d1e3128b5fcea9a | caf39a18af33704a23fdf5389c45b35f48f45163 | /Code/Objeto.h | 4820ca4fe1519377f7d5bf207940a979be437e52 | [] | no_license | fulano7/PGProjeto1 | c2532c1aa7820de972f32c61311305af6800a4ee | 4eb85a9b8d39a95070827f9ec20352136e2e3e0e | refs/heads/master | 2021-01-10T21:22:57.610310 | 2015-06-19T17:27:27 | 2015-06-19T17:27:27 | 35,845,591 | 1 | 1 | null | null | null | null | ISO-8859-1 | C++ | false | false | 3,023 | h | Objeto.h | #ifndef _OBJETO_H_
#define _OBJETO_H_
#include <vector>
#include <string>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
#include "common.h"
#define MAX_CHARS_LINHA 201
#define MAX_OBJS_ARQUIVO 12
using std::vector;
using std::string;
/*
modela um objeto.
o atributo 'vertices' eh um v... |
cd7c42a8a7f0d2b302a740d79bc6758492333d52 | e848b83f6add711fb40ce83fec70ba3ff976853d | /others/detect_vector4.cpp | dd6ead4f60e4b93a142f6a0efd10df065d768cfb | [] | no_license | xiongm/dotfiles | d81915fa9f684a84b55e1019b5a1e872bbf66bc8 | 3cc03b34f5ae26eb89e39e8f39e9ea7c41d37588 | refs/heads/master | 2020-04-06T05:06:36.356299 | 2019-10-17T05:14:39 | 2019-10-17T05:14:39 | 43,662,246 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,218 | cpp | detect_vector4.cpp | #include <type_traits>
#include <theme/mpl/detection.hpp>
#include <theme/mpl/static_if.hpp>
#include <vector>
#include <iostream>
template <typename>
struct is_vector : std::false_type {};
template <typename T>
struct is_vector< std::vector<T> > : std::true_type {};
template <typename T>
constexpr bool is_vector... |
66270f90675b82723b146ce8334370e182b435eb | bcfcad1c5d202cdaa172014afd260e02ad802cb4 | /Utility/Include/MipMapGenerator.hpp | f59972bc1eefd759b7b365b8b3d563b63bad070a | [
"BSL-1.0",
"LicenseRef-scancode-khronos",
"Zlib",
"MIT"
] | permissive | jordanlittlefair/Foundation | 0ee67940f405573a41be6c46cd9d2e84e34ae8b1 | ab737b933ea5bbe2be76133ed78c8e882f072fd0 | refs/heads/master | 2016-09-06T15:43:27.380878 | 2015-01-20T19:34:32 | 2015-01-20T19:34:32 | 26,716,271 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 570 | hpp | MipMapGenerator.hpp | #pragma once
#ifndef _UTILITY_MIPMAPGENERATOR_HPP_
#define _UTILITY_MIPMAPGENERATOR_HPP_
#include "Image.hpp"
#include <vector>
namespace Fnd
{
namespace Utility
{
class MipMapGenerator
{
public:
static unsigned int GetNumMipLevels( const Image& image );
static unsigned int GetNumMipLeve... |
526a50be17b7f79a1f1840c4433d31841e2cc76a | 03325a8cfe18e45996a9802d61537ccfb9cfde62 | /LinkedList.h | 913d5d3dac8d29f8f191e59d5a8d9cf9053ea614 | [] | no_license | kamdibus/LinkedList-Vector | b56a58d031ed2ae738dc83c16d02bc93f71f8664 | e1163f4430cbb9066646c9f915ab7d5db72a3be3 | refs/heads/master | 2021-03-27T20:01:49.187630 | 2017-07-09T18:47:15 | 2017-07-09T18:47:15 | 96,704,110 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,841 | h | LinkedList.h | #ifndef AISDI_LINEAR_LINKEDLIST_H
#define AISDI_LINEAR_LINKEDLIST_H
#include <cstddef>
#include <initializer_list>
#include <stdexcept>
namespace aisdi
{
template <typename Type>
class LinkedList
{
public:
using difference_type = std::ptrdiff_t;
using size_type = std::size_t;
... |
3b297de6e77002ebc3e29d4462a8dfcbd9197953 | 52d85cbcd60e01adbc7214a3511c5cfb2ae1e024 | /SoundFontInfoLib/iffdigest.h | 419f4864471e1729194ed31ed64bdb11595a3d68 | [
"MIT"
] | permissive | TrendingTechnology/SoundFonts | 0a9d6454bad7c6003a6c10e129a370423826f462 | ca40757a5a16fe79dc24fa16244d491b7057b1ed | refs/heads/master | 2021-03-01T02:32:13.381208 | 2020-03-08T01:09:40 | 2020-03-08T01:09:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,659 | h | iffdigest.h | // Copyright (c) 2019 Brad Howes. All rights reserved.
//
// Loosely based on iffdigest v0.3 by Andrew C. Bulhak. This code has been modified to *only* work on IFF_FMT_RIFF, and
// it safely parses bogus files by throwing an IFF_FMT_ERROR exception anytime there is an access outside of valid
// memory. Additional clean... |
d7b6c7cf4d032d31c9ad617fa3589f0ee9109aea | 3fd7e61268ffbb2b27c66c49644997acf8136abc | /grammar/elkhound/elsa-and-friends-master/elsa/astvisit.cc | 2127956b6643c5cee3158ef98c5e341e9730d73e | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yshinya6/ParserMark | 765de07900e85a7df2093c14c8e572aabccbab6c | b04ee603d963f32d8a3d8634e648cf304dfab499 | refs/heads/master | 2021-01-19T05:44:01.521438 | 2017-02-20T05:09:52 | 2017-02-20T05:09:52 | 64,631,802 | 2 | 4 | null | 2017-02-17T04:57:51 | 2016-08-01T03:10:44 | C | UTF-8 | C++ | false | false | 3,360 | cc | astvisit.cc | // astvisit.cc
// code for astvisit.h
#include "astvisit.h" // this module
ASTVisitorEx::ASTVisitorEx()
: loc(SL_UNKNOWN)
{}
void ASTVisitorEx::visitFunctionInstantiation(Function *obj)
{
obj->traverse(*this);
}
void ASTVisitorEx::foundAmbiguous(void *obj, void **ambig, char const *kind)
{}
bool ASTV... |
3d2e52bacf474d8a871fc6f23b88fad28a429b4c | 7edb36015a07782245a6d9f84a301a97a3eb668d | /code/userprog/exception.cc | a68c03445cd78ee88d4061f24801114111ac19ec | [
"MIT-Modern-Variant"
] | permissive | NicolasAfonso/NachOS | 7a3b951320cbef00113ad3da3459f3af70f9b46a | 22f879f25b7415bdae062d5c1c69ae877562b05a | refs/heads/master | 2020-04-06T03:43:40.963567 | 2013-03-28T08:07:59 | 2013-03-28T08:07:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,470 | cc | exception.cc | // exception.cc
// Entry point into the Nachos kernel from user programs.
// There are two kinds of things that can cause control to
// transfer back to here from user code:
//
// syscall -- The user code explicitly requests to call a procedure
// in the Nachos kernel. Right now, the only fun... |
0b8cfc7565c25d1d24dde782311f9bc4a4e6a0b4 | 4cec78b4ac3eadcb6f4b490e91e690685e49c674 | /MarkX_CalGamesOC/TKOClimber.cpp | b06b1d674c4383eee43a989b2ac9b3e70c9a3216 | [] | no_license | MittyRobotics/Mark-X | a86aa943fa63a30ee5b8065ee30348a3371aeeb9 | 03a692dd0adbc05ece01be15db96cefc76a95f4d | refs/heads/master | 2021-05-27T02:00:30.750612 | 2014-01-10T02:14:22 | 2014-01-10T02:14:22 | 15,834,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,732 | cpp | TKOClimber.cpp | //Last edited by Vadim Korolik
//on 09/08/2013
#include "TKOClimber.h"
//Constructor for the TKOClimber class
/*
* SetVoltageRampRate() When in PercentVbus or Voltage output mode, the rate at which the voltage changes can be limited to reduce current spikes.
* ConfigFaultTime()
* Configure how long the Jaguar wai... |
a71a13b1a380b8ab1a4efbf2280c58dc191aa1c4 | 0563fa83c4dddc925d241aed6b3a5d372360ea65 | /include/Resources.hpp | 8298c3c36c2c4790635b2cb3538445f767f59e52 | [] | no_license | pinbraerts/Energy-is-over- | c77345e3e614f16c280b7bbd3ee618e6f0dec9d0 | 5146ed52925bcd908b385f5cbd61eb10cded951a | refs/heads/master | 2020-04-21T14:01:21.918343 | 2019-03-26T05:53:57 | 2019-03-26T05:53:57 | 169,620,531 | 0 | 1 | null | 2019-03-05T18:59:51 | 2019-02-07T18:26:33 | C++ | UTF-8 | C++ | false | false | 1,919 | hpp | Resources.hpp | #ifndef EIO_GAME_HPP
#define EIO_GAME_HPP
#include "Widget.hpp"
struct Resources {
std::map<std::wstring, HMODULE> modules;
std::map<std::wstring, Factory> factories;
void load(std::wstring path, std::vector<IWidget*>& ws) {
std::wifstream source(path);
while (source) {
std::... |
0bc5ace0e428c8bb7f0e7e063002c6bfc93d391c | 39360906839fb8572f5a348906a501f950fa42bf | /lab_test.cpp | 971a07a2bde58d3359b1c11277e5d15a48348c89 | [] | no_license | subramanyamdvss/cpp-codes | 6a92272dfa8437b67086dedc44bd990ea8a99d72 | 305fdd12591ed1c69fda7fb089f6ea5c2f824da2 | refs/heads/master | 2021-01-19T13:56:17.047947 | 2017-02-24T08:35:59 | 2017-02-24T08:35:59 | 82,435,590 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,702 | cpp | lab_test.cpp |
// NAME: DVSS SUBRAMANYAM ROLL NO: 15CS10013 MACHINE NUMBER :56 ,,QUESTION PAPER :EVEN
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef vector< long long int > vi;
typedef double d;
typedef pair<lli,pair<lli,lli> > pipii;
#define bg begin()
#define rbg rbegin()
#define ren rend()
#def... |
63ed52e073434f15a2c93619931b0806416efeb0 | a6a9a18453209ee6787c15482053fb53b4fd1d43 | /Classes/Game/AI/AIBrain/States/JumpBrainState.h | a6f80fc4dbe0c7fed6b82d18945e5d300192235e | [] | no_license | derekmpeterson/BouncyHouseCocos | 4145fa75d42fe258f9cddab87020883b6877f2d0 | 51f248e703ddff0f90e05b45f7ef211ca8ec8232 | refs/heads/master | 2016-09-13T12:59:11.948897 | 2016-04-26T16:43:34 | 2016-04-26T16:43:34 | 57,144,998 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 723 | h | JumpBrainState.h | //
// JumpBrainState.hpp
// BouncyHouse
//
// Created by Derek Peterson on 1/15/16.
//
//
#ifndef JumpBrainState_hpp
#define JumpBrainState_hpp
#include "RunBrainState.h"
class JumpBrainState : public RunBrainState
{
private:
EntityHandle m_munitionHandle;
public:
JumpBrainState();
virtual ~JumpBrainS... |
b67439191bd8eff5d5c8d92aefe32521df1403b4 | 8dfc3bbb741bcd0a716c981ead0cbd48b7773bbf | /omnet/Enlace/fisico.cc | 5980ea2d4240019c42bd4e8adcd21c5ca4865fe4 | [] | no_license | armando-ferro/TFM | 2d0f49324cbd96e722f829fe6ee5129fd2bb5c98 | 1be812c035b522eafbdd8a18a8d5575d72ad8952 | refs/heads/master | 2021-06-02T06:46:08.608471 | 2016-09-19T09:27:48 | 2016-09-19T09:27:48 | 114,017,838 | 0 | 1 | null | 2017-12-12T17:11:56 | 2017-12-12T17:11:56 | null | ISO-8859-1 | C++ | false | false | 7,398 | cc | fisico.cc | //
// This program 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 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it wil... |
78e2a756f9711371b223bb57e7075a607e595330 | 9d90c683c0f8dbdf5a8cb0de46111e0d7c4d67f5 | /JSON.h | 5ebc7c0fd3b3e135c07cb0928df25e8dac87bccf | [] | no_license | mog422/ImgTL_Windows | 485da530cf5dc7cedce7335239b6c8237bd456f4 | a608ecafb5b1e84f934f51cc261cd70a2f64a66c | refs/heads/master | 2021-01-18T12:30:34.301178 | 2014-09-23T00:19:35 | 2014-09-23T00:19:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,241 | h | JSON.h | #pragma once
#include "Util.h"
#include <map>
#include <vector>
#include <memory>
class JSONParseException : public std::exception
{
public:
JSONParseException() : std::exception("Exception while parsing JSON string") {}
};
class JSONValueTypeMismatchException : public std::exception
{
public:
JSONValueTypeMismatc... |
52b8b6fc309b254e7fcf0dafda439fede4e866ee | a2badfee532cf096e9bd12b0892fdce3b49e54c8 | /src/modules/builderc.cpp | 4ad6eedfb0ddbd5484100c01fca7ae48c8342099 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | unghee/TorchCraftAI | 5e5e9b218990db8042198a12aeef78651b49f67b | e6d596483d2a9a8b796765ed98097fcae39b6ac0 | refs/heads/master | 2022-04-16T12:12:10.289312 | 2020-04-20T02:55:22 | 2020-04-20T02:55:22 | 257,154,995 | 0 | 0 | MIT | 2020-04-20T02:51:19 | 2020-04-20T02:51:18 | null | UTF-8 | C++ | false | false | 30,624 | cpp | builderc.cpp | /*
* Copyright (c) 2017-present, Facebook, Inc.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "modules/builderc.h"
#include "modules/builderhelper.h"
#include "commandtrackers.h"
#include "movefilters.h"
#include "utils.h... |
f43796662f34b064b0ebef6f53d6e1860e2abd96 | 19d41c4ae325277636383885388c83dd1555f8cf | /TIOJ/1224.cpp | 55d0b3767407ad0a870beb77a6b12902d69465c6 | [] | no_license | henrytsui000/online-judge | 5fd0f7b5c747fb5bfd5f84fb616b9f7346e8abaf | 337aa1d52d587fb653ceeb8b3ee64668804f5b13 | refs/heads/master | 2022-05-28T13:56:04.705485 | 2022-05-19T13:33:43 | 2022-05-19T13:33:43 | 226,999,858 | 3 | 0 | null | 2022-02-02T03:22:06 | 2019-12-10T01:10:15 | C++ | UTF-8 | C++ | false | false | 2,780 | cpp | 1224.cpp | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<ld,ld>;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define endl '\n'
#define all(a) a.begin()... |
bae495d96d53c7eec5b41fbcfe672c60ede2ccc3 | 56237e6b716a82ef3728d48ec28899a203e28216 | /week6/ex1.cpp | eb40d058f04aed8176009afcb3d431a1697b5e23 | [] | no_license | ramanqul/pp1-2019 | a07cb481aad9c61f274e4b6b78758e945e6a8746 | a05e4a843de593330f4549ea200da3a72340e072 | refs/heads/master | 2020-04-21T11:21:34.141580 | 2019-05-04T11:13:21 | 2019-05-04T11:13:21 | 169,522,171 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 217 | cpp | ex1.cpp | #include <iostream>
using namespace std;
string hello(string name) {
return "Hello, " + name; //must
}
int main() {
string name;
cin >> name;
string res = hello(name);
cout << res << endl;
return 0;
}
|
4a74e900b8bdc5b4c3783c3c716a9cf8dd11a3d1 | 9c0f172c0098449bd7a571c36c7b9e91286b7dec | /helloword/helloword/main.cpp | 77b6e76858f8385852258a6fe06ea2a76d131afb | [] | no_license | kenesbao/cplusplus | 0a40d5dbdfe0fa4372af5c6900820af63df29fc3 | fb8461cc1df0eb3225fe3b237900c75364cf2f66 | refs/heads/master | 2021-01-25T08:38:06.502621 | 2015-03-30T06:08:44 | 2015-03-30T06:08:44 | 33,101,955 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 274 | cpp | main.cpp | //
// main.cpp
// helloword
//
// Created by 包立明 on H27/03/30.
// Copyright (c) 平成27年 bao. All rights reserved.
//
#include <iostream>
int main(int argc, const char * argv[]) {
// insert code here...
std::cout << "Hello, World!\n";
return 0;
}
|
dfa26acf150beaef8af99c35e600a08f4112b681 | 1175638e96c27290074f0e0c0bcf131103d64883 | /main.cpp | e3697da20f6fc179362ef5d98128130beae1bfd9 | [] | no_license | Ryochan7/weiss-deck-builder-qtquick | 25dfae485dd5b97683bb7e0a4f8a2f812a2dfe1e | 138defe30903cf4001ac7a3c7ff49527bf183589 | refs/heads/master | 2021-05-04T06:20:13.002082 | 2016-10-18T21:24:44 | 2016-10-18T21:24:44 | 71,068,104 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 816 | cpp | main.cpp | #include <QApplication>
#include <QGuiApplication>
#include <QQmlApplicationEngine>
#include <QQmlContext>
#include "weisscard.h"
#include "weisscardmodel.h"
#include "weisscardfullmodel.h"
#include "util.h"
int main(int argc, char *argv[])
{
QApplication app(argc, argv);
WeissCardModel deckModel;
WeissC... |
13702e4f11dd7821bce4a203f743d5176feb62ca | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_1595491_1/C++/Bogdan/ProblemB.cpp | d15ef05418eaee15e51b3fc0b4e7efe814c2770e | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 969 | cpp | ProblemB.cpp | #include <iostream>
#include <cstring>
using namespace std;
void mainB() {
unsigned int T,N,S,p;
int minNormal, minSurprise;
unsigned int countNormal, countSurprise;
unsigned int score;
cin >> T;
for (unsigned int i=0;i<T;++i) {
cin >> N >> S >> p;
if (p == 0) {
... |
7549d3ccd8eed484dd1e6b8ca64e7d3776c3d47e | 1dd67be315c6c8241a9815a12d335e6bb6a7c8a8 | /software/PeaPod-Arduino/FloatSensor.h | e2d4f0b76ea9c11396b54e3019083b44798b425c | [
"MIT"
] | permissive | nataliiaaaa/PeaPod | 7ec0c252d1456b2cfe96597484da0d590aa1f459 | 7b3a3fe21ecdc11c024d94ce51e3612b7c8ccaae | refs/heads/master | 2023-08-17T11:25:24.075713 | 2021-03-13T19:20:28 | 2021-03-13T19:20:28 | 416,932,564 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 331 | h | FloatSensor.h | #ifndef FloatSensor_H
#define FloatSensor_H
#include "Arduino.h"
#include "Sensor.h"
class FloatSensor : public Sensor {
public:
FloatSensor(uint8_t pin);
private:
float read() override;
bool init() override;
/**
* Digital input pin.
* */
uint8_t pin;
... |
07667c182543c9f315485e1da7d0f46fea2ae793 | 10a57a1756eef8e7ae5db5ef0dfe4857d8176181 | /MeasureSensityResponse/AcousticTest/AcousticTest/TurnTable.cpp | 8bbec0571d0ca50f37e172690747f33638f10498 | [] | no_license | Janie91/GitAcoustic | a44cf3ac30e943450cb6f1a63ccc5a2f67164372 | ae1d19d07b0dd83dda3aa9e514365de059646d75 | refs/heads/master | 2021-09-09T11:08:59.107432 | 2018-03-15T10:19:56 | 2018-03-15T10:19:56 | 114,206,016 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 19,807 | cpp | TurnTable.cpp | // TurnTable.cpp : 实现文件
//
#include "stdafx.h"
#include "AcousticTest.h"
#include "TurnTable.h"
#include "afxdialogex.h"
#include "MyFunction.h"
// CTurnTable 对话框
IMPLEMENT_DYNAMIC(CTurnTable, CDialog)
CTurnTable::CTurnTable(CWnd* pParent /*=NULL*/)
: CDialog(CTurnTable::IDD, pParent)
{
m_CurrentAngle = _T("")... |
a66332a29a34179f7a89c1150186c24bd01c45fe | 9bf952de762c04c84ba1fc7f1499aa711d338364 | /hw8/hw8.cpp | f933e22a39cd996d1d3ea8e76fee026332d17fd0 | [] | no_license | Computational-Physics-Research/Computational-Physics-3 | 50447fc0c7c2d38915906fec538d7fa90a57714f | a2aba8b60d21ab3934986c1201aa4e688c07014f | refs/heads/master | 2021-12-11T06:45:39.236755 | 2016-10-31T04:12:24 | 2016-10-31T04:12:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,812 | cpp | hw8.cpp | /*
AEP 4380 HW #8
Dan Girshovich
4/12/13
Least Squares Curve Fitting
Compile with: g++ -std=c++0x -O2 -o gen_data hw8.cpp
Tested on Mac OSX 10.8.2 with a Intel Core 2 Duo
*/
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include "nr3.h"
using namespace std;
typedef ... |
5421a1c1284c29eb179d343d97eb97c525e99584 | fe3727a2a91858de4f813dedb027ac63601acc52 | /tester/gcd/gen.cpp | d06593a257397198448e49db026fb36989d14a32 | [] | no_license | fabik/cpspc2017 | 3f0edf5da364941606ea726f8d7aa2cec7f8ca80 | 39e780bd37a9ec35f88ee02a69209d246a774104 | refs/heads/master | 2021-03-27T16:29:45.850866 | 2017-06-30T17:15:55 | 2017-06-30T17:15:55 | 90,709,123 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,711 | cpp | gen.cpp | /* ingen for NWD
Autor: Piotr Smulewicz
*/
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <cassert>
#include <algorithm>
#include "oi.h"
using namespace std;
const int MAXC = 10 * 1000 * 1000;
const long long MAXZAK =1000LL*1000LL*1000LL*1000LL;
typedef long long LL;
const i... |
306f24bf30b669c164565e7a0d6a1b5482542445 | d7bbe2e1161bda20183df745332e73d344822d1c | /admin.cpp | 03728293e0a97e455698be75c890903d73f2e8fa | [] | no_license | prabhavagrawal7/School-Management-System | a9168fc01ececa9a2bbb3f7f977a1c726e66dadb | 8a8b73651b0c21056df3b8458ac1eacb0c71c454 | refs/heads/master | 2023-06-14T17:40:21.264877 | 2021-07-11T05:41:40 | 2021-07-11T05:41:40 | 381,802,260 | 1 | 3 | null | 2021-06-30T19:13:34 | 2021-06-30T18:46:23 | C++ | UTF-8 | C++ | false | false | 76,294 | cpp | admin.cpp | #include<bits/stdc++.h>
using namespace std;
#include "admin.h"
//#include"common.h"
//#include "exam_marks.h"
// struct exam_marks{
// int maths_marks;
// int english_marks;
// int hindi_marks;
// int science_marks;
// int social_marks;
// int computer_marks;
// };
void admin:: lib_add_b... |
52adab6d34cf1d6da48e03cb5ac7b7f69a47bfbc | 2c97e06cb0031b47baf889c79f9558ec1c1d8f24 | /week-02/day-2/practicegg/main.cpp | 727d3b401b9c010ad1c7f15a0ca3f98510c887ce | [] | no_license | green-fox-academy/KisG93 | c88d70721671ac3f5b6d4a94b240ca84cb859d98 | 133262e00fd7a82a7269a8f1adfec094114373ba | refs/heads/master | 2020-04-02T17:22:10.749501 | 2019-02-21T13:17:27 | 2019-02-21T13:17:27 | 154,655,065 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 611 | cpp | main.cpp | #include <iostream>
#include <vector>
#include <map>
#include <string>
int main() {
std::vector<int> myFavoriteNumbers2 = {8, 6 , 2, 0};
std::cout << myFavoriteNumbers2[3] << std::endl;
std::cout << myFavoriteNumbers2.size() << std::endl;
myFavoriteNumbers2.push_back(27);
std::map<std::string,... |
e1341870513dcc0cd3e950345027b2ed96e914bf | 52d97c724054fe880e8bb22e9ab5185227ed14f6 | /Strings2.cpp | c90b5c2008ab43efdb3c0809694ed4842859d101 | [] | no_license | mkwok94/School | 9c66d5c6cc93d4257b4a9891eb970f43d40f04b3 | bb1448629de4156243584a3e2e4ff05f208aafa1 | refs/heads/master | 2020-04-12T05:43:20.326900 | 2017-02-10T06:11:57 | 2017-02-10T06:11:57 | 62,365,085 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,978 | cpp | Strings2.cpp | // Lab 7 (Part 2), Arrays and Vectors in C++
// Programmer: Melinda (Mel) Kwok
// Editor(s) used: Notepad++
// Compiler(s) used: Visual Studio
//This library is for the buffer
#include <cstdlib>
//This library is for getting inputs and outputting
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
... |
4fb4747ae8d6171ce8c1cf54fdfafcb9213975f2 | 2c7cc09b17b78deb1491efeb219f9320191cf442 | /src/utils/Event.h | b9d20ad53d2f45219c506c2707a02b4b10f6b39f | [
"MIT"
] | permissive | awwit/httpserverapp | 221e146ea787ef9e8193e445dc708201d7aee92e | e269cde1d46c5e5c790fbed008c370251f391d4c | refs/heads/master | 2022-04-29T16:27:09.815606 | 2022-03-29T21:13:42 | 2022-03-29T21:13:42 | 19,515,460 | 26 | 23 | null | null | null | null | UTF-8 | C++ | false | false | 635 | h | Event.h | #pragma once
#include <mutex>
#include <condition_variable>
#include <atomic>
namespace Utils
{
class Event
{
private:
std::mutex mtx;
std::condition_variable cv;
std::atomic<bool> signaled;
bool manually;
public:
Event(const bool signaled = false, const bool manualy = false) noexcept;
~Event() noexc... |
3e20e7426012885641a6abfb3438bc9422478445 | 319cc56c41d4b167ba4b967a0989848837f0784e | /group_project_code/source/main.cpp | 590b1c824bc62fa408acdb1cb4255a0532ee2a34 | [
"MIT"
] | permissive | architsangal/Modifying-.ply-files | 75944c7ddf66aab0cf8815b7ecfbf873c27aebfd | 62b83c2df76eeecb1a317aa073c88035ce95577b | refs/heads/main | 2023-01-28T17:13:20.380911 | 2020-12-08T14:14:11 | 2020-12-08T14:14:11 | 319,653,463 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,761 | cpp | main.cpp | #include "../include/Task8.h"
#include "../include/Ply.h"
#include "../include/FileHandler.h"
#include "../include/TxtFileHandler.h"
#include "../include/IMT2019020_Task_3.h"
#include "../include/Task7PPMfile.h"
#include <iostream>
#include <string>
#include <bits/stdc++.h>
using namespace std;
void showMenu() //D... |
f9fcb400728588a81aae895edd384d3fd265ba1a | bb6f118d3bc1ea938ab5ee13f6c1b9d04d1f5a5c | /sketching/algorithm/elastic_sketch.h | eea05dea64cd941bd19238f48ea347fa9741bffd | [] | no_license | h2bit/PR-Sketch | c0f2b644901703a7f88ee62ed9c22e5949bb3c00 | e0f3324474856f1abba448e1ce0a853817102670 | refs/heads/master | 2023-05-29T12:01:06.557967 | 2021-06-04T12:26:19 | 2021-06-04T12:26:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 975 | h | elastic_sketch.h | #ifndef ELASTIC_SKETCH_H
#define ELASTIC_SKETCH_H
#include <stdint.h>
#include <vector>
#include <set>
#include "../tuple/tuple.h"
#include "./base_sketch.h"
using namespace std;
class ElasticSketchHeavyCounter{
public:
vector<uint32_t> pvotes;
vector<tuple_key_t> tuplekeys;
vector<bool> flags;
uint32_t n... |
8d7d658221580374e5f13b4e488733a5e9fd4415 | f99c0194278639456604ebf76443b65bf1c6ed04 | /common/include/common/P2PKHAddress.hpp | 9a910d8b2158c4008f9882d95f7393dbda3f8f9c | [] | no_license | RdeWilde/JoyStream | e4ed42ff61af1f348cb49469caa8e30ccf3f8a52 | 95c2b6fc50251fbe4730b19d47c18bec86e18bf4 | refs/heads/master | 2021-06-11T20:26:46.682624 | 2016-05-10T08:27:05 | 2016-05-10T08:27:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,164 | hpp | P2PKHAddress.hpp | /**
* Copyright (C) JoyStream - All Rights Reserved
* Unauthorized copying of this file, via any medium is strictly prohibited
* Proprietary and confidential
* Written by Bedeho Mender <bedeho.mender@gmail.com>, August 9 2015
*/
#ifndef COIN_P2PKH_ADDRESS_HPP
#define COIN_P2PKH_ADDRESS_HPP
#include <common/PubKe... |
f1473597c8e99cee2cd716260921503e10b4ee0d | 6d34fa23c708320b2e42d120d107f187106302e3 | /orca/gporca/libgpopt/include/gpopt/xforms/CXformUtils.h | fe8cee18a46286bfc8c324ed280e4737b7240169 | [
"Apache-2.0"
] | permissive | joe2hpimn/dg16.oss | a38ca233ba5c9f803f9caa99016a4c7560da9f08 | 2c4275c832b3e4b715b7475726db6757b127030c | refs/heads/master | 2021-08-23T19:11:49.831210 | 2017-12-06T05:23:22 | 2017-12-06T05:23:22 | 113,322,478 | 2 | 1 | null | 2017-12-06T13:50:44 | 2017-12-06T13:50:44 | null | UTF-8 | C++ | false | false | 30,682 | h | CXformUtils.h | //---------------------------------------------------------------------------
// Greenplum Database
// Copyright 2012 EMC Corp.
//
// @filename:
// CXformUtils.h
//
// @doc:
// Utility functions for xforms
//
// @owner:
//
//
// @test:
//
//
//------------------------------------------------------------------------... |
4e545ac3986e7fda0954d41b49579a5237eba44f | 1a218c67ad04f99e52c37425fdb933b053af6244 | /Ch03/exercise3.43.cc | ab2f87e3912e0a20f5d79b7882f49de32dbd15c8 | [] | no_license | xiaonengmiao/Cpp_Primer | 5a91cd223c9b0870f4ab9a45c6f679333a98fa20 | be20a29b49be19f6959b7873077ea698da940bf6 | refs/heads/master | 2020-12-25T14:23:58.976008 | 2020-06-18T07:54:43 | 2020-06-18T07:54:43 | 66,343,361 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 556 | cc | exercise3.43.cc | #include <iostream>
#include <vector>
using namespace::std;
int main()
{
constexpr size_t rowCnt = 3, colCnt = 4;
int ia[rowCnt][colCnt]={0};
// using a range for
for (auto &row : ia)
for (auto &col : row)
cout << col << " ";
cout << endl;
// using pointers
for (auto q=ia; q!=ia+rowCnt; ++q)
... |
3c40a459a0cc86e80bd3cc7d468b174cfa3a10ed | c8b39acfd4a857dc15ed3375e0d93e75fa3f1f64 | /Engine/Source/Editor/CurveTableEditor/Private/CurveTableEditor.h | 5d1ed7ab642621edb38ff9559f0c7a7887ec65de | [
"MIT",
"LicenseRef-scancode-proprietary-license"
] | permissive | windystrife/UnrealEngine_NVIDIAGameWorks | c3c7863083653caf1bc67d3ef104fb4b9f302e2a | b50e6338a7c5b26374d66306ebc7807541ff815e | refs/heads/4.18-GameWorks | 2023-03-11T02:50:08.471040 | 2022-01-13T20:50:29 | 2022-01-13T20:50:29 | 124,100,479 | 262 | 179 | MIT | 2022-12-16T05:36:38 | 2018-03-06T15:44:09 | C++ | UTF-8 | C++ | false | false | 5,909 | h | CurveTableEditor.h | // Copyright 1998-2017 Epic Games, Inc. All Rights Reserved.
#pragma once
#include "CoreMinimal.h"
#include "Types/SlateStructs.h"
#include "Layout/Visibility.h"
#include "Widgets/SWidget.h"
#include "Toolkits/IToolkitHost.h"
#include "ICurveTableEditor.h"
#include "Widgets/Views/STableViewBase.h"
#include "Widgets/V... |
1b1ab5fee750a5c63be4896a4ffccc85cddb6f28 | 5975ff5a30a059e34cbde93f57a58d8170d90d31 | /src/Plane.cpp | 8f2c91794144fd7a188d6fbc357144ac240c5b6e | [] | no_license | spaske00/RG113-virus-defender | 565a4a7a593e4a255333e728df1de94f284af169 | 74e1f88477f82ac3ceead22036c1c077a2ef8dd0 | refs/heads/master | 2020-12-26T22:17:54.712493 | 2019-04-04T22:06:45 | 2019-04-04T22:06:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 746 | cpp | Plane.cpp | #include "Plane.hpp"
#include <cmath>
namespace vd {
Plane::Plane() {
m_material.set_ambient(0.3, 0.3, 0.2, 1);
m_material.set_diffuse(0.4, 0.4, 0.8, 1);
m_material.set_specular(0.1, 0.1, 0.3, 1);
m_material.set_shininess(10);
m_material.set_side(GL_FRONT);
glShadeModel(GL_FLAT);
}
void Plane::init() {
... |
7fcd72dccbd89fad6d07e2bcdd44b8fd7eaf9f56 | beaeefee8412d35e8afee2643098dbc3870d47bc | /src/EAWebkit/Webkit-owb/BAL/OWBAL/Concretizations/Memory/WK/BCArenaWK.cpp | 4bcba4a3c1bb59994f8cc35545ff3458a2cd6ae6 | [] | no_license | weimingtom/duibrowser | 831d13626c8560b2b4c270dcc8d2bde746fe8dba | 74f4b51f741978f5a9d3b3509e6267fd261e9d3f | refs/heads/master | 2021-01-10T01:36:36.573836 | 2012-05-11T16:38:17 | 2012-05-11T16:38:17 | 43,038,328 | 1 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 9,045 | cpp | BCArenaWK.cpp | /*
* Copyright (C) 1998-2000 Netscape Communications Corporation.
* Copyright (C) 2003-6 Apple Computer
*
* Other contributors:
* Nick Blievers <nickb@adacel.com.au>
* Jeff Hostetler <jeff@nerdone.com>
* Tom Rini <trini@kernel.crashing.org>
* Raffaele Sena <raff@netwinder.org>
*
* This libra... |
d86651f08876a058b3542ea2a3ffe610205aa937 | df18dca0d8241679ae7cc08f2e3e9deacfd144a3 | /src/5.1-a.cpp | e558bc006104c694f2155955ec7266ccf45ab784 | [] | no_license | yuyu0127/DA | c22ca3699237551e494e1db353150a8d16731420 | 55053109d2d63c0a39b980ddbc955ce4752cb2c1 | refs/heads/master | 2020-04-15T15:25:18.710259 | 2019-01-09T05:17:18 | 2019-01-09T05:17:18 | 164,559,690 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,457 | cpp | 5.1-a.cpp | #include <iostream>
#include <string>
#define HASH_SIZE 701
class SinglyLinkedList {
private:
struct Node {
public:
std::string value;
Node* next;
};
Node* head;
public:
SinglyLinkedList()
{
head = nullptr;
}
Node* insert_first(std::string value)
{
... |
fb76be5455b5ed8e3b6bd866e4390e67638157e9 | 982bae350aaf9e106205901f7e39cc7d213e52af | /spoj/EPALIN.cpp | fe8620a391a58c60c84fed8aa6f2f74c26afa835 | [] | no_license | rafaelrds/competitive-programming | 74e2403cc18f7a6e56a424a932d015c656bcaa0c | 73b0364f88b744e266a7b2605ffc10b18e67b486 | refs/heads/master | 2023-06-10T02:15:32.849083 | 2023-06-02T23:07:09 | 2023-06-02T23:07:09 | 104,693,062 | 3 | 1 | null | 2022-12-12T14:45:29 | 2017-09-25T02:11:07 | C++ | UTF-8 | C++ | false | false | 799 | cpp | EPALIN.cpp | #include <cstdio>
#include <cstring>
using namespace std;
int L, pref[100000],k;
char T[100001],P[100001];
int main(){
while(scanf("%s",T)==1){
L = strlen(T);
for(int i = 0,j = L-1;i<L;++i,--j) P[i] = T[j];
pref[0] = 0;
for(int i = 1;i<L;++i){
k = pre... |
5f86b38a4774c22ce4f219dfd0a10d7e6ca09556 | 715aba5d770d25c999e081a099bdadacc9b9156a | /src/shared/solv/solvinfo.hpp | 64d108fd71a650c8972e4c7e56a703959aeef89d | [
"MIT"
] | permissive | master-clown/feata | 342b91025af5d1f7731a36b1c72892f1b9ca8fa3 | 306cbc3a402551fb62b3925d23a2d4f63f60d525 | refs/heads/master | 2020-05-29T09:37:44.311743 | 2019-08-14T06:02:57 | 2019-08-14T06:02:57 | 189,070,795 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 556 | hpp | solvinfo.hpp | #pragma once
struct MeshInfo;
/**
* All important fields will be marked with "[i][o]!".
* i -- important for input, o -- for output
*/
struct SolvInfo
{
typedef double num_t;
const MeshInfo* Mesh; /*i!*/
/**
* \brief DispLst
* Displacement vector list for every nod... |
479763708668936c73e2baf2400ad19ae67d91fa | beaccd4ca566e9f7f112b98dfe3e32ade0feabcc | /code chef/maxpr.cpp | 2ed15d7b98153f7eeea3813749d3f86aab129b30 | [] | no_license | maddotexe/Competitive-contest-programs | 83bb41521f80e2eea5c08f198aa9384cd0986cde | 4bc37c5167a432c47a373c548721aedd871fc6b7 | refs/heads/master | 2020-04-17T08:08:43.922419 | 2015-03-10T19:26:55 | 2015-03-10T19:26:55 | 31,177,844 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,060 | cpp | maxpr.cpp | #include<bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) cerr << #x << ": " << x << " | " << #y <... |
181cf09de4aca3656aa5b0e9692c2875e93e6864 | 325629fde51468c5d03f4028a13c43d967d1b05b | /signal-slot-benchmarks/benchmark/lib/jeffomatic/jl_signal/src/DoublyLinkedListTest.cpp | f113d2ee98e1cf3601d92e7d080270213280aa12 | [
"MIT",
"CPOL-1.02",
"LicenseRef-scancode-public-domain"
] | permissive | j-jorge/signals | cc05945517f377735e3b38741d41868dedafe9dd | 02653304840ed294bb907d13cdce3cc260b5d8ce | refs/heads/master | 2021-03-10T02:25:01.766388 | 2020-03-11T07:39:20 | 2020-03-11T07:39:20 | 246,407,802 | 0 | 0 | MIT | 2020-03-10T21:03:29 | 2020-03-10T21:03:28 | null | UTF-8 | C++ | false | false | 4,883 | cpp | DoublyLinkedListTest.cpp | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "DoublyLinkedList.h"
#include "ObjectPoolScopedAllocator.h"
using namespace jl;
namespace
{
typedef DoublyLinkedList<const char*> StringList;
typedef StaticObjectPoolAllocator< sizeof(StringList::Node), 100 > StringNodeAllocator;
}
void Dou... |
653caa40e9fa82c2c47984267c016794e2f358e6 | a8fc3ed50d169a2503de09d6448b08051595204e | /S.0824/S.0824/stack.cpp | 1ee0b4f279a0a34b354af854d4ca1237179f1a39 | [] | no_license | STong01/C-.0826 | 17cce96c86e68071a45ac97ea78929774a2c471e | c62d12916c129b30e87047abab994ff8be10f17e | refs/heads/master | 2020-07-11T03:18:43.622333 | 2019-08-26T08:47:29 | 2019-08-26T08:47:29 | 204,434,048 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 925 | cpp | stack.cpp | #include "stack.h"
void StackInit(Stack* psl, size_t capicity){
assert(psl);
psl->capicity = capicity;
psl->array = (StDataType*)malloc(capicity* sizeof(StDataType));
assert(psl->array);
psl->size = 0;
}
void StackDestory(Stack* psl){
assert(psl);
if (psl->array){
free(psl->array);
psl->array = NULL;
... |
6816077c6bb975172b9988169a12dc89d3210f03 | 055ed53c7de70c5d214254bc0c9bb797e4b4bae4 | /QDcm/dcmcore/src/DcmTagUL.cpp | 7d575e82a8f0034daf6242260408f075b99f6d9f | [] | no_license | kevinlq/MyQt | 8ad0593db71171be64008038c766fcd79c64540c | 1bfedfb6a186feb177f291b28fdf5ca2393ed0e4 | refs/heads/master | 2022-11-23T11:24:44.888305 | 2022-11-07T15:41:30 | 2022-11-07T15:41:30 | 91,306,496 | 21 | 8 | null | 2018-04-25T10:49:40 | 2017-05-15T07:13:54 | C++ | UTF-8 | C++ | false | false | 2,417 | cpp | DcmTagUL.cpp | /* 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.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will ... |
3f3f69eeb1aaf57112c0b28aa35799a6cc4cec56 | 9f9266a40a869e34c8627f66d0ef05ec25c40236 | /AnvilEldorado/Source/Game/Players/PlayerImpl.cpp | c8e342ac500d24ca14852c6f76823b878246b5e5 | [
"MIT"
] | permissive | AnvilOnline/AnvilClient | b2d6273de7c1f7d436f939e19948edf2c69631da | 9b7751d9583d7221fd9c9f1b864f27e7ff9fcf79 | refs/heads/development | 2020-04-13T22:12:16.638751 | 2017-04-22T17:22:10 | 2017-04-22T17:22:10 | 44,775,425 | 57 | 23 | null | 2017-04-22T17:22:10 | 2015-10-22T21:53:19 | C++ | UTF-8 | C++ | false | false | 12,208 | cpp | PlayerImpl.cpp | #include "PlayerImpl.hpp"
#include "Hooks.hpp"
#include <Game\Cache\StringIdCache.hpp>
#include <Game\Players\PlayerArmorExtension.hpp>
#include <Interfaces\Client.hpp>
#include <EngineImpl.hpp>
#include <Globals.hpp>
#include <codecvt>
using namespace AnvilEldorado::Game::Players;
const size_t AnvilEldorado::Game... |
e1575c3ea8471643f2a2f427d12c7aaa730bff75 | c335a90b03c3898ee66db88c19f5423b204ebb90 | /Source/DACrypt/DCryptAES.cpp | b26f098e012a2428c4ddac3881e9b983199d416a | [
"MIT"
] | permissive | XDAppDeprecated/DawnAppFramework | df28c4e6d428c64bea6b5ccaac80faa7f5ac3b56 | 8655de88200e847ce0e822899395247ade515bc6 | refs/heads/master | 2021-05-30T03:30:33.326587 | 2015-07-16T12:43:07 | 2015-07-16T12:43:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,945 | cpp | DCryptAES.cpp | #include "stdafx.h"
#include "DCryptAES.h"
#include "DAESKey.h"
#include "DCryptException.h"
DCryptAES::DCryptAES()
{
}
DCryptAES::~DCryptAES()
{
}
void DCryptAES::AES_Encrypt(DAESKey *key, unsigned char* &Crypt, size_t &CryptLength, const unsigned char* Origin, const size_t OriginLength, const unsigned char* iv)
{... |
ad33cd60fb292063dcad4cc1d8b9d735f07548a1 | f8f3da6fa276a1bbf9f18262bdb53f4f6772b31b | /graph/Graf.h | fd30731a630d42af96462870008711b399e02cb8 | [
"MIT"
] | permissive | azimiqbal/Structures | 3fe05493dd64ffe99d83db5f8e6051802623a738 | 71318d7c48fc3588451febc7c3d5a9855e55168e | refs/heads/main | 2023-04-16T06:30:44.835023 | 2021-04-26T23:49:37 | 2021-04-26T23:49:37 | 361,906,724 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 797 | h | Graf.h | //
// Created by Azim Iqbal on 2019-04-07.
//
#ifndef OBLIG2_GRAF_H
#define OBLIG2_GRAF_H
#include "std_lib_facilities.h"
struct node
{
int data;
vector<node*> naboer; //vector i nodene som inneholder peker til naboene til en node
void add_nabo(node* n);
};
class Graf
{
public:
Graf();
~Graf()... |
628414c970b98caf2948454e076b2004ab12110e | 82b16d6de8d9bced1cb0bc615a913af23169ed4e | /src/generation/semantic_remover.h | 7560f1bebd844a6a1e97b4a3010ccbef7fc677e4 | [] | no_license | FishingCactus/ShaderShaker2 | 753784f6a22896160a418e3b179d3c6a3ec2bc69 | b300ec80c00685325b1937cbfbbad3ea559373a8 | refs/heads/master | 2021-03-12T23:03:54.908551 | 2015-05-08T13:50:24 | 2015-05-08T13:50:24 | 18,032,320 | 9 | 0 | null | 2016-11-24T11:28:33 | 2014-03-23T11:59:26 | HTML | UTF-8 | C++ | false | false | 540 | h | semantic_remover.h | #ifndef SEMANTIC_REMOVER_H
#define SEMANTIC_REMOVER_H
#include <ast/empty_visitor.h>
namespace Generation
{
class SemanticRemover : public AST::EmptyVisitor
{
virtual void Visit( AST::TranslationUnit & translation_unit ) override;
virtual void Visit( AST::Functi... |
99f0c217679ce35e929aa98defab3be8a93b2ffd | 0577a46d8d28e1fd8636893bbdd2b18270bb8eb8 | /contact/contact_table.cc | 9182b0968c5a79bb9333a7bbe5c69b9e35890585 | [
"BSD-3-Clause"
] | permissive | ric2b/Vivaldi-browser | 388a328b4cb838a4c3822357a5529642f86316a5 | 87244f4ee50062e59667bf8b9ca4d5291b6818d7 | refs/heads/master | 2022-12-21T04:44:13.804535 | 2022-12-17T16:30:35 | 2022-12-17T16:30:35 | 86,637,416 | 166 | 41 | BSD-3-Clause | 2021-03-31T18:49:30 | 2017-03-29T23:09:05 | null | UTF-8 | C++ | false | false | 5,943 | cc | contact_table.cc | // Copyright (c) 2017 Vivaldi Technologies AS. All rights reserved
//
// Based on code that is:
//
// Copyright (c) 2012 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 "contact/contact_table.h"
#include <strin... |
0471008040f5b2590caa62c4fd18f11d89ef4e35 | 550e9c4a8d56d47aaf1df2e15a71cd4cd35d16b9 | /2out/NamedTest.cpp | 010f609122e62c2a741950273d468f0b907fb0bc | [
"MIT"
] | permissive | DronMDF/2out | 6ceadcdf74c63e46d8f5c769a619ce76afc162c5 | d41a8e8ca6bfb5c66a8b77cd62ac9ab69e61b295 | refs/heads/master | 2021-09-08T11:49:15.507642 | 2021-09-05T06:31:16 | 2021-09-05T06:31:16 | 91,911,330 | 12 | 3 | MIT | 2021-09-05T06:31:17 | 2017-05-20T19:23:16 | C++ | UTF-8 | C++ | false | false | 816 | cpp | NamedTest.cpp | // Copyright (c) 2017-2021 Andrey Valyaev <dron.valyaev@gmail.com>
//
// This software may be modified and distributed under the terms
// of the MIT license. See the LICENSE file for details.
#include "NamedTest.h"
#include "NamedResult.h"
#include "SuiteTest.h"
using namespace std;
using namespace oout;
NamedTest:... |
de355211cc666a4074bcc5ab2f0ac40c02733886 | 82e6375dedb79df18d5ccacd048083dae2bba383 | /src/main/y/hashing/digest.cpp | 3fdbe67f52d6f6801efaaa1e5f06c9363ef2c616 | [] | no_license | ybouret/upsylon | 0c97ac6451143323b17ed923276f3daa9a229e42 | f640ae8eaf3dc3abd19b28976526fafc6a0338f4 | refs/heads/master | 2023-02-16T21:18:01.404133 | 2023-01-27T10:41:55 | 2023-01-27T10:41:55 | 138,697,127 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,975 | cpp | digest.cpp | #include "y/hashing/digest.hpp"
#include "y/code/utils.hpp"
#include "y/string.hpp"
#include "y/exception.hpp"
#include "y/memory/allocator/pooled.hpp"
#include "y/ios/ostream.hpp"
namespace upsylon
{
bool digest:: UPPER_CASE = false;
static inline
uint8_t * __digest_acquire( size_t &blen )
{
... |
cd9101adc9f0e01c01bfdfba4990b89c400cc5ce | 9f4fccc004fd85bdecea7c5c353cf690b08052c7 | /Sorting_Algorithm/quick_sort.cpp | 4f522d928d69517f15d317df3f9060a72f248a62 | [] | no_license | Rawat-Sagar/LOVE-BABBAR-450-DSA | 40bf1fc11864708d1be99f9171974590661ac303 | d740e3a7be1702d8689a4d0a34174c9259657aee | refs/heads/main | 2023-05-07T09:48:46.851698 | 2021-06-01T05:37:54 | 2021-06-01T05:37:54 | 334,354,530 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,141 | cpp | quick_sort.cpp | // Quick Sort Complexity :
// Depends on pivot.
// 1.In best case , pivot would be median element.
// T(n) = 2T(n/2) + (n)
// The solution of above recurrence is O(nLogn). It can be solved using case 2 of Master Theorem.
// 2.In worst case , pivot would be end element.
// T(n) = T(n-1) + n
// The solution of above recu... |
c9241d75e9b7a0a7022ad12b8cb3aa20bb8b6ea7 | b162de01d1ca9a8a2a720e877961a3c85c9a1c1c | /871.minimum-number-of-refueling-stops.cpp | 8e6c4b31e319a8f97ccdf4cd41a426b6288519be | [] | no_license | richnakasato/lc | 91d5ff40a1a3970856c76c1a53d7b21d88a3429c | f55a2decefcf075914ead4d9649d514209d17a34 | refs/heads/master | 2023-01-19T09:55:08.040324 | 2020-11-19T03:13:51 | 2020-11-19T03:13:51 | 114,937,686 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,433 | cpp | 871.minimum-number-of-refueling-stops.cpp | /*
* [902] Minimum Number of Refueling Stops
*
* https://leetcode.com/problems/minimum-number-of-refueling-stops/description/
*
* algorithms
* Hard (27.13%)
* Total Accepted: 5.2K
* Total Submissions: 19K
* Testcase Example: '1\n1\n[]'
*
* A car travels from a starting position to a destination which is ... |
7044deeaee534f2ebeafcc85439303b5ad3b3ea3 | 3193195d1b08ce84e57957c1385e9e3756e42d9e | /set1/2.cpp | b080dbb696c4ff111d4aba831b04fa51efaec5b4 | [] | no_license | jmkjohns/Cryptopals | 8bb8872be357d4c13ab727e09369354919693822 | 781ab123fd468dfc73d2ec6e6d9cc429f2fb328e | refs/heads/master | 2021-07-21T09:42:40.582454 | 2017-11-01T09:23:58 | 2017-11-01T09:23:58 | 107,012,177 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 426 | cpp | 2.cpp | #include "..\Common\CryptoLib.cpp"
//==============================================================================
int main( int argc, char *argv[] )
//==============================================================================
{
ByteStream one = hexToBytes( "1c0111001f010100061a024b53535009181c" );
ByteSt... |
108411c714ea72144da32267bfe50157f6000f4f | 98a283daef91a5c6381708ffa41966f0a9dd88a2 | /Unique Binary Search Trees II.cpp | 907d6c77f21ddd496685271ee9af8545d3396599 | [] | no_license | shadowmydx/leetcode | b5aa9b00ad91fe66d9ec026f1b371098a44dbf5e | d907e38cb210669cb74478341a4ee4c8b79bebdd | refs/heads/master | 2021-01-13T02:04:16.767790 | 2014-11-15T16:21:07 | 2014-11-15T16:21:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,347 | cpp | Unique Binary Search Trees II.cpp | class Solution {
public:
vector<TreeNode *> generateTrees(int n) {
vector<int> number;
vector<TreeNode *> res;
for (int i = 0;i < n;i++)
number.push_back(i + 1);
buildTree(res,number,0,number.size());
return res;
}
// left and right vec is the last ca... |
43c29f557e5d6eaa2cc1e46354d2686b3cf1cb64 | dad6a8033f8412790cbf9c2cb1a27064689875a7 | /SKWIN/SkwinSDL.h | 67500dc64cecc7d44f6d7bdf46cb321b0fabf3a3 | [] | no_license | gbsphenx/skproject | d95b28221187ada06b12dfa7550c5540bdf262dc | 48fb31883df76ecff0b6ebe533c89f779b66b12c | refs/heads/master | 2023-09-04T10:57:47.634857 | 2023-09-01T17:15:56 | 2023-09-01T17:15:56 | 32,668,925 | 13 | 3 | null | 2022-12-07T17:22:37 | 2015-03-22T09:08:24 | C++ | UTF-8 | C++ | false | false | 1,576 | h | SkwinSDL.h |
#ifndef _SKWINSDL_H_
#define _SKWINSDL_H_
#include <SDL.h>
#include "SkWin.h"
class CSkWinSDL : public CSkWin {
public:
//
SDL_Surface *pScreen;
U8 curMiceState;
//
void UpdateRect(i16 x, i16 y, i16 cx, i16 cy);
void SndPlayHi(const U8 *buff, U32 buffSize, i8 vol);
void SndPlayLo(const U8 *buff, U32 buffSiz... |
1af9f64ce614f8dae0c9310df85e7fd473030b59 | 14a93a8d9a75bb5a9d115e193931d6291910f054 | /check.cpp | f6567d6ffc282721497bf452ba136bd3cb52eddd | [] | no_license | Sujay2611/Coding | 94a4f24fa5665d807fb2a95f8aa67c7fa8e9e518 | 67d95d4183592cdb6f92e81f38a88664273e117a | refs/heads/master | 2023-01-11T03:02:04.439617 | 2022-12-30T10:13:47 | 2022-12-30T10:13:47 | 244,128,290 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 976 | cpp | check.cpp | //
// check.cpp
// coding
//
// Created by sujay2611 on 25/07/20.
// Copyright © 2020 sujay2611. All rights reserved.
//
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cassert>
#include <fstream>
#include <string>
using namespace std;
int main()
{
int t... |
a49024dc319445e687a334ade8128cb72c6c9237 | e2a9835d3bc0b60177ca6b574b4a96e52868650b | /DragonBase.cpp | db8c514dbfaf44548f4d4d05ae23275bfef1e185 | [] | no_license | ErinDuXiao/DragonMovementPrototypeUE4 | 356be3830e81cfd78795a06c519a93dcff4d4dfe | 0f61a669eceae8ee18b14d96b2e39ed99bdd203e | refs/heads/master | 2021-05-10T21:03:07.957559 | 2018-01-25T19:59:56 | 2018-01-25T19:59:56 | 118,217,166 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,110 | cpp | DragonBase.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "DragonBase.h"
#include "Kismet/KismetMathLibrary.h"
#include "Kismet/GameplayStatics.h"
// Sets default values
ADragonBase::ADragonBase()
{
// Set this pawn to call Tick() every frame. You can turn this off to improve performa... |
6a3a2352aea668c82ff3275b1b870d6fb9659b3e | 53546284fd7d95c871f472731bb1ad52b69d7cdb | /23/F.cpp | 40261f775ba63da11213381d6e61cc62fc696279 | [] | no_license | BlackSamorez/cpp-algo | b5e42845ceac6378c983986f8c4d3f06d58ca5fc | 961ec044dd648148453a7e35e219c6abb7ed9e0b | refs/heads/master | 2023-01-24T22:41:34.571811 | 2020-12-11T10:32:40 | 2020-12-11T10:32:40 | 262,581,888 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,148 | cpp | F.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdint.h>
#include <set>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> numbers(n);
for (int i = 0; i < n; ++i){
cin >> numbers[i];
}
set<vector<int>> answer;
int req;
cin >> req;
for (int i = 0; i < n; ++i){
for (i... |
3de9b1743711d9d81c8107ba2e153637c1a1abbe | 1fb357bb753988011e0f20c4ca8ec6227516b84b | /Flavour/src/BR_Kmumu.h | 1981c4421eec12620e836a7f65f2fb23eaa75a2c | [
"DOC"
] | permissive | silvest/HEPfit | 4240dcb05938596558394e97131872269cfa470e | cbda386f893ed9d8d2d3e6b35c0e81ec056b65d2 | refs/heads/master | 2023-08-05T08:22:20.891324 | 2023-05-19T09:12:45 | 2023-05-19T09:12:45 | 5,481,938 | 18 | 11 | null | 2022-05-15T19:53:40 | 2012-08-20T14:03:58 | C++ | UTF-8 | C++ | false | false | 1,931 | h | BR_Kmumu.h | /*
* Copyright (C) 2012 HEPfit Collaboration
*
*
* For the licensing terms see doc/COPYING.
*/
#ifndef BR_KMUMU_H
#define BR_KMUMU_H
#include "ThObservable.h"
#include "OrderScheme.h"
#include "gslpp.h"
#include "CPenguinBoxMu.h"
class StandardModel;
/**
* @class BR_Kmumu
* @ingroup Flavour
* @brief A clas... |
aef916268d7cb9c83f5f26bdc9fefd722e567bff | 3b5241d097e6abeb5359ba147f2bd17471d94ec9 | /Lab/Lab022218/Savitch_9thEd_Chap1_ProgProj4_freefall/main.cpp | c8e8b5c610045d73b003e15214bc4f9dc84a4f63 | [] | no_license | elisechue/ChueElise_CSC5_Spring2018 | 19d80a4caa127763288d26001003d141f90f7387 | 72bc0b64b458cda76f50e5cf87580bc96cda6dd9 | refs/heads/master | 2018-09-10T05:42:28.021679 | 2018-06-05T08:52:16 | 2018-06-05T08:52:16 | 124,119,545 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,064 | cpp | main.cpp | /*
* File: main.cpp
* Author: Elise Chue
* Created on February 22, 2018, 12:17 PM
* Purpose: Calculate distance of object in Free Fall assuming no drag
*/
//System Libraries Here
#include <iostream>
using namespace std;
//User Libraries Here
//Global Constants Only, No Global Variables
//Math, Physics, Scie... |
1d9850e3c8953c16e13bc3f6727dca0cff62e144 | 332f9ba2997fcced6df503e4ce3bd827e117de6e | /include/jules/array/slicing/absolute.hpp | 8adfb7de4a216d7678e5972161255a73589d5d3e | [
"Zlib"
] | permissive | mutual-ai/jules | c1138672abaf69cbd880a10d92aa276e872d1907 | ce2417d90606cc0ba0868be56f6b67d6aa235afd | refs/heads/master | 2020-03-11T00:38:38.118603 | 2017-10-11T15:26:33 | 2017-10-11T15:26:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,384 | hpp | absolute.hpp | // Copyright (c) 2017 Filipe Verri <filipeverri@gmail.com>
#ifndef JULES_ARRAY_SLICING_ABSOLUTE_H
#define JULES_ARRAY_SLICING_ABSOLUTE_H
#include <jules/core/type.hpp>
namespace jules
{
inline namespace slicing
{
struct absolute_strided_slice
{
absolute_strided_slice() = delete;
constexpr absolute_strided_slic... |
b0a0e988a1734e40923fe90b20ca83960c7da1a5 | 25d01103cdceffd02aa09607791fc85708ba6d50 | /NJUPT_2018_SpringTraining/NJUPT_2018_SpringTraining_3/B_Highway/main.cpp | f540df6a2368fa28b138994bcfe0da1b0f1990df | [] | no_license | MoonChasing/ACM | 3aea87957c695eec5dced21e0cc53c2fcb0fe3e6 | aa5878646a47bf258cb2698d5068edb57fe1d03e | refs/heads/master | 2020-03-24T13:07:31.432360 | 2019-02-27T14:53:10 | 2019-02-27T14:53:10 | 142,735,585 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,609 | cpp | main.cpp | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <utility>
#include <algorithm>
#define MAXN 755
#define MAXM 1005
#define INF 0x3f3f3f3f
#define DEBUG
#define DataIn
typedef long long LL;
using namespace std;
int n,m... |
dc4c30dc79ec7b1f79fb1b89436c7633e206b9bd | 41160548cbbe4222db6064d3ed6d6b902a70fe3f | /zork/Project2/exit.h | bfcb23a73269528b054a591b927bba7d5640008f | [] | no_license | mizquierdo97/Zork- | cdd028fe77a8e4743e7859c6b1cef24d85bd3835 | f74946b7ca4ee7231eec524a668c24c0280fc6f3 | refs/heads/master | 2021-01-10T06:40:33.601425 | 2016-04-18T21:08:01 | 2016-04-18T21:08:01 | 52,227,312 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 307 | h | exit.h | #ifndef _EXIT
#define _EXIT
#include "entity.h"
class Exit :public Entity{
public:
Exit();
Exit(const char* name, const char* description, Room* origin, Room* destination, bool open, int direction);
Room* origin;
Room* destination;
bool open;
int direction;
Room* get_destination()const;
};
#endif |
385b51e411adec05ddc5ea24957699090cdb5960 | 772d932a0e5f6849227a38cf4b154fdc21741c6b | /CPP_Joc_Windows_Android/SH_Client_Win_Cpp_Cmake/App/src/rpg3D/gw/entity/module/toolsHandler/tool/melleArea/TMA_UnitContacts.h | 6969b29e4fc3e0ab263398e22b7740881b121316 | [] | no_license | AdrianNostromo/CodeSamples | 1a7b30fb6874f2059b7d03951dfe529f2464a3c0 | a0307a4b896ba722dd520f49d74c0f08c0e0042c | refs/heads/main | 2023-02-16T04:18:32.176006 | 2021-01-11T17:47:45 | 2021-01-11T17:47:45 | 328,739,437 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 328 | h | TMA_UnitContacts.h | #pragma once
#include <base/gh.h>
#include "TMA_Visual.h"
namespace rpg3D {
class TMA_UnitContacts : public TMA_Visual {priv typedef TMA_Visual super;pub dCtor(TMA_UnitContacts);
pub explicit TMA_UnitContacts(ToolConfigMelleArea* config, std::shared_ptr<ExtraData> extraData);
pub ~TMA_UnitContacts() override... |
46a06de2732c03c3a5c184838cf0e7dac8200c9f | ace20ae898aadf18c4ef8a2355b528422fc27bb5 | /codeforces/catchoverflow.cpp | 9dae2480e7f7447f39fbd1334ca6e45dae21ad7c | [] | no_license | pidddgy/competitive-programming | 19fd79e7888789c68bf93afa3e63812587cbb0fe | ec86287a0a70f7f43a13cbe26f5aa9c5b02f66cc | refs/heads/master | 2022-01-28T07:01:07.376581 | 2022-01-17T21:37:06 | 2022-01-17T21:37:06 | 139,354,420 | 0 | 3 | null | 2021-04-06T16:56:29 | 2018-07-01T19:03:53 | C++ | UTF-8 | C++ | false | false | 753 | cpp | catchoverflow.cpp | // https://codeforces.com/contest/1175/problem/B
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main() {
#define int long long
ios::sync_with_stdio(0);
cin.sync_with_stdio(0);
cin.tie(0);
const int lim = pow(2, 32);
stack<int> S;
int l;
cin >> l;
S.push(1);
... |
08850b0f6c6234c19de1b4a35b8444280ec92e33 | f0d7d208a2d2f93bf7cb5217e737ba066d31658f | /2019_W/Array/4344_overMean.cpp | c2ae48927968913c275fa17794fe3ece7e374918 | [] | no_license | Aranch422/Algorithm_Study | c26f82bc7884886e1558edbb2c13799df946dddd | a61a546cc8ddce4fa51272aa9c42ba4933880a58 | refs/heads/master | 2023-07-23T17:13:13.827634 | 2023-07-07T15:53:56 | 2023-07-07T15:53:56 | 234,075,498 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 533 | cpp | 4344_overMean.cpp | #include <iostream>
using namespace std;
int N,n;
int num[1000];
void init(){
cin>>n;
for(int i=0;i<n;i++){
cin>>num[i];
}
}
void solve(){
int sum=0;
int mean=0;
for(int i=0;i<n;i++){
sum+=num[i];
}
mean=sum/n;
double cnt=0;
for(int i=0;i<n;i++){
if(m... |
2e84b674815b523fda96ccb565485d815a353433 | b7d4fc29e02e1379b0d44a756b4697dc19f8a792 | /deps/icu4c/source/test/intltest/itercoll.h | 747f80f6689c70847674b1ec5bac125c0548b462 | [
"GPL-1.0-or-later",
"MIT",
"LicenseRef-scancode-unknown-license-reference",
"ICU",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"NAIST-2003",
"BSD-3-Clause",
"LicenseRef-scancode-unicode",
"GPL-3.0-or-later",
"NTP",
"LicenseRef-scancode-unicode-icu-58",
"LicenseRef-scancode-autoconf-... | permissive | vslavik/poedit | 45140ca86a853db58ddcbe65ab588da3873c4431 | 1b0940b026b429a10f310d98eeeaadfab271d556 | refs/heads/master | 2023-08-29T06:24:16.088676 | 2023-08-14T15:48:18 | 2023-08-14T15:48:18 | 477,156 | 1,424 | 275 | MIT | 2023-09-01T16:57:47 | 2010-01-18T08:23:13 | C++ | UTF-8 | C++ | false | false | 2,827 | h | itercoll.h | /********************************************************************
* COPYRIGHT:
* Copyright (c) 1997-2001, International Business Machines Corporation and
* others. All Rights Reserved.
********************************************************************/
/**
* Collation Iterator tests.
* (Let me reiterate m... |
fc3ac738b6c92cdb95c9cc55f9e7562aef8067e0 | e334e2d79cbb97d4de9e2c2b13daaa53156c9ee6 | /src/image-generator/include/Server.h | 9f024f41fa73f4a01722bf477b1f682e7d98b2a5 | [] | no_license | ueberaccelerate/image-generator-server-client | f96e57e9d93a6c31f7ce85f30cd48bc3aabe8fbd | 164809f9efe4e83b3480ec5b18840e1784974c04 | refs/heads/master | 2022-11-30T10:05:50.347889 | 2020-08-12T15:52:11 | 2020-08-12T15:52:11 | 286,090,226 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 680 | h | Server.h | #ifndef SENDER_INCLUDE_SERVER_HPP
#define SENDER_INCLUDE_SERVER_HPP
#include "Connection.h"
#include <resource/config.hpp>
#include <boost/asio.hpp>
#include <boost/shared_ptr.hpp>
namespace server {
using boost::asio::ip::tcp;
class ImageGeneratorServer
{
public:
ImageGeneratorServer(boost::asio::io_... |
2021ece1222912ad496931edb11758cc41b2adf6 | e9e8064dd3848b85b65e871877c55f025628fb49 | /code/MapEngine/MapDisp/MapDispLayer.cpp | 713fbc68ce9e0d30fbf99ed198a44c025af78239 | [] | no_license | xxh0078/gmapx | eb5ae8eefc2308b8ca3a07f575ee3a27b3e90d95 | e265ad90b302db7da05345e2467ec2587e501e90 | refs/heads/master | 2021-06-02T14:42:30.372998 | 2019-08-29T02:45:10 | 2019-08-29T02:45:10 | 12,397,909 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 16,359 | cpp | MapDispLayer.cpp | #include "stdafx.h"
#include "MapDispLayer.h"
#include "MapDisp.h"
CMapDispLayer::CMapDispLayer(void)
{
m_iBlockCount = 0;
}
//创建图层
void CMapDispLayer::Create( CMapDisp* pMapDisp )
{
m_hwnd = pMapDisp->m_hwnd;
m_pMapDisp = pMapDisp;
this->m_MapData.Init( pMapDisp );
//初始化所有数据块
/*for ( int i=0;i<_BLOCK_MAX_NUM;i++... |
08c8ed0baf5cfb18fc24086767d65aefbb653268 | 5c6194e025346e672d8d6d760d782eed0e61bb7d | /developer/VSSDK/VisualStudioIntegration/Common/Source/CPP/VSL/MockInterfaces/VSLMockIVsParentProject2.h | 4ebe128b45d65fef969bc198cf3b23ca3df07ccf | [
"MIT"
] | permissive | liushouhuo/windows | 888c4d9f8ae37ff60dd959eaf15879b8afdb161f | 9e211d0cd5cacbd62c9c6ac764a6731985d60e26 | refs/heads/master | 2021-09-03T06:34:51.320672 | 2018-01-06T12:48:51 | 2018-01-06T12:48:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,989 | h | VSLMockIVsParentProject2.h | /***************************************************************************
Copyright (c) Microsoft Corporation. All rights reserved.
This code is licensed under the Visual Studio SDK license terms.
THIS CODE IS PROVIDED *AS IS* WITHOUT WARRANTY OF
ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING ANY
IMPLIED WARRANTIES... |
abbc2b1f197f30f6f6c42a99d0f0e0719de96f1f | 04fee3ff94cde55400ee67352d16234bb5e62712 | /9.20不水题欢乐赛/2019-09-20/source/Stu-32-王宇飞/protect/protect.cpp | 5f99ea3e6d6f512cc21473daca5b9ff1469b334d | [] | no_license | zsq001/oi-code | 0bc09c839c9a27c7329c38e490c14bff0177b96e | 56f4bfed78fb96ac5d4da50ccc2775489166e47a | refs/heads/master | 2023-08-31T06:14:49.709105 | 2021-09-14T02:28:28 | 2021-09-14T02:28:28 | 218,049,685 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,258 | cpp | protect.cpp | #include<bits/stdc++.h>
using namespace std;
int n,x[20],y[20],a[20],l[20],r[20],ans;
struct edge{
int loca,num;
}use[20];
bool cmp(edge x,edge y){
return x.num<y.num;
}
bool judgeempty(){
int jecnt=0;
for(int jei=1;jei<=n;jei++){
if(use[jei].num==0) jecnt++;
}
if(jecnt==n) return false;
else re... |
b95c10581db5f6c46b5c7f56ab8b81bd8d1584e4 | b3e525a3c48800303019adac8f9079109c88004e | /nic/hal/plugins/sfw/alg_rtsp/rtsp_parse.hpp | 517dfbb95b9ab6120e72705910df48e8d8fea249 | [] | no_license | PsymonLi/sw | d272aee23bf66ebb1143785d6cb5e6fa3927f784 | 3890a88283a4a4b4f7488f0f79698445c814ee81 | refs/heads/master | 2022-12-16T21:04:26.379534 | 2020-08-27T07:57:22 | 2020-08-28T01:15:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,862 | hpp | rtsp_parse.hpp | //-----------------------------------------------------------------------------
// {C} Copyright 2017 Pensando Systems Inc. All rights reserved
//-----------------------------------------------------------------------------
#pragma once
#include "nic/include/base.hpp"
#include "nic/sdk/include/sdk/ip.hpp"
namespace ... |
63712a542c7462eff52a852c6db0ac2a1c58c27f | 1d98b3237c0efd1994c02910ed31f1f0ae0e8be5 | /src/liboslexec/llvm_gen.cpp | 8147640fafa43d6dc96704276b448bb30894439c | [
"CC-BY-4.0",
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla"
] | permissive | gkmotu/OpenShadingLanguage | 2a2c4dd27bbe645ac236d5e42208a0fc5d62358b | 5b32bd1a48b1c270cf78e956068196006b8ec4b7 | refs/heads/master | 2023-01-28T04:28:18.409638 | 2020-12-09T06:49:10 | 2020-12-09T06:49:10 | 320,123,063 | 1 | 0 | BSD-3-Clause | 2020-12-10T01:16:26 | 2020-12-10T01:16:26 | null | UTF-8 | C++ | false | false | 149,616 | cpp | llvm_gen.cpp | // Copyright Contributors to the Open Shading Language project.
// SPDX-License-Identifier: BSD-3-Clause
// https://github.com/imageworks/OpenShadingLanguage
#include <cmath>
#include <OpenImageIO/fmath.h>
#include "oslexec_pvt.h"
#include <OSL/genclosure.h>
#include "backendllvm.h"
using namespace OSL;
using names... |
6c80207f8c3606eeccafbd57bd7d7d6572b6f094 | 8898322737a937d5bddd808f098393b3a58e9758 | /C++/file.cpp | bb58c624578e2af2691f62a4888984163c0e28ae | [] | no_license | drycota/C | d692011d08a124b3f74370793a711ea4490a5137 | d416779b95ed712eca3bd8d68550a12df89a0f1f | refs/heads/master | 2020-04-22T04:41:10.404206 | 2019-02-11T13:27:38 | 2019-02-11T13:27:38 | 170,131,478 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 49,072 | cpp | file.cpp | #include "pch.h"
#include "file.h"
// Функции библиотеки stdio.h
/*
Функции библиотеки stdio.h
--------------------------------------------------------------------------------
FILE *fopen(const char *filename, const char *mode)
Функция открывает файл.
filename - путь к файлу
mode - тип доступа
r - чтение, если ... |
5ccf7c6995cdf999cd99f7006d23839e1c142fd5 | 29868bf4aa31c1ca8b8c86e5b5b07cc3509caf64 | /Perrin/Perrin/funciones.hpp | 6ebc159bf9277bff3b4022d1405383bee01ee485 | [] | no_license | Laura-Mora/PC-2016-03 | a137746a8c1939235a5176a0ecc2d8234ee87348 | 0cf0826bdb8a3be89c9da0e70a6726388c6ba0c6 | refs/heads/master | 2023-07-20T15:16:07.676365 | 2019-12-30T01:52:28 | 2019-12-30T01:52:28 | 222,524,088 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 372 | hpp | funciones.hpp | //
// funciones.hpp
// Perrin
//
// Created by Laura Juliana Mora on 3/08/16.
// Copyright © 2016 Laura Juliana Mora. All rights reserved.
//
#ifndef funciones_hpp
#define funciones_hpp
void datos(int *,int);
void imprimir(int *,int);
int primos(int *,int );
int menu();
void imprimir2(int **p,int n);
void primos2(... |
203987f881e1909062341f5e6514dc9eeaa7ad9f | 26fb880c20da5949f6c202ffd3e16269a904f7ef | /src/kernel_bi_clustering.cpp | 6157c901ca6754fda697d16a1bb31e165722f632 | [
"MIT"
] | permissive | anonymousclustering/biclustering | 1d08953b89faaab93109a4ce41d7216e4c22319e | 0ca08d9b2cd1a781bb0e87a0285d4a1beb971099 | refs/heads/main | 2023-02-28T06:48:09.023526 | 2021-02-05T00:23:55 | 2021-02-05T00:23:55 | 336,115,715 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,954 | cpp | kernel_bi_clustering.cpp | #include <RcppArmadillo.h>
// [[Rcpp::depends(RcppArmadillo)]]
#include <omp.h>
// [[Rcpp::plugins(openmp)]]
#include "InitializationMethod.h"
#include "RandomInitialization.h"
#include "KppInitialization.h"
#include "KernelFactory.h"
#include "RBFFactory.h"
#include "EnergyFactory.h"
#include "BiClustering.h"
#incl... |
b9e1cf2597e36c0a40fbff877355ea257f5c06e8 | 11c9c278b5758dc2e5ef42c06bf69a362fb1319d | /functions/return_functions.cpp | 8a3e4f2bf6ef8aba158262542c833664bc1cdb0a | [] | no_license | cjdarcy/cppSandbox | 4048f72636819f5e7c4b586dc83833e4f7a3b8c7 | c0ff423d89268074ca2dea00e6be017f479df151 | refs/heads/master | 2020-03-14T03:42:09.794701 | 2018-11-17T13:42:41 | 2018-11-17T13:42:41 | 131,425,656 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 294 | cpp | return_functions.cpp | #include <iostream>
#include <cmath>
using namespace std;
double area(double radius) {
return acos(-1.0) * radius * radius;
}
double absoluteValue(double x) {
if (x < 0) {
return -x;
} else if (x > 0) {
return x;
} else if (x == 0) {
return 0;
}
}
|
e4a94f4f808192f26e610d0b11054be9a121eb46 | c0cb4ffb337dc5e392d3bbafeb418f7580c05000 | /500/507.cpp | c9058edb8ca4d73f136b6588f12cdebe9f71091c | [] | no_license | ghj0504520/UVA | b3a7d6b6ba308916681fd8a6e25932a55f7455b3 | 8e49a1424538e907f4bdbe5543cc6966d4ea5a4e | refs/heads/master | 2023-05-01T07:49:18.162394 | 2023-04-24T07:48:11 | 2023-04-24T07:48:11 | 38,348,555 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 665 | cpp | 507.cpp | #include <iostream>
using namespace std;
int main() {
int b, r, s;
cin>>b;
for(int t=1 ; t<=b ; t++)
{
cin>>r;
int curSum=0,curI=-1,curJ=-1;
int maxSum=0,maxI=-1,maxJ=-1;
for(int it=0 ; it<r-1 ; it++)
{
cin>>s;
curJ=it+1;
if(curI==-1)curI=curJ;
curSum+=s;
if((curSum>maxSum) || (curS... |
acb25fae1d75117e8b7a94d5d2ac0fbbf06430f7 | 4eb58b82b857edde83e8ed99dc10f59e8ea2c71f | /01185/01185.cpp | 36679fa798e944faca7293468aa6427f2d754ae7 | [] | no_license | RezaMokaram/Solutions-to-UVAonlinejudge-problems | 18be6d1d7ca302c233e077546d7ad4bffa9f1448 | e4117ed247ff3f707cd71e84df662835affb1077 | refs/heads/master | 2023-06-11T06:47:05.602555 | 2023-06-03T01:59:10 | 2023-06-03T01:59:10 | 248,146,437 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 824 | cpp | 01185.cpp | //#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <string>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stdio.h>
#include <vector>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <functional>
#include <map>
#include <set>
usin... |
129d2ddc5984f803fe92ac6036a90360f6100d53 | be5f4d79910e4a93201664270916dcea51d3b9ee | /rovers/fastdownward/src/search/merge_and_shrink/merge_selector_score_based_filtering.cc | 14af30cd5bea0faa8ea447f37acdfccc79e85907 | [
"MIT",
"GPL-1.0-or-later",
"GPL-3.0-or-later"
] | permissive | mehrdadzakershahrak/Online-Explanation-Generation | 17c3ab727c2a4a60381402ff44e95c0d5fd0e283 | e41ad9b5a390abdaf271562a56105c191e33b74d | refs/heads/master | 2022-12-09T15:49:45.709080 | 2019-12-04T10:23:23 | 2019-12-04T10:23:23 | 184,834,004 | 0 | 0 | MIT | 2022-12-08T17:42:50 | 2019-05-04T00:04:59 | Python | UTF-8 | C++ | false | false | 4,273 | cc | merge_selector_score_based_filtering.cc | #include "merge_selector_score_based_filtering.h"
#include "factored_transition_system.h"
#include "merge_scoring_function.h"
#include "../options/option_parser.h"
#include "../options/options.h"
#include "../options/plugin.h"
#include <cassert>
using namespace std;
namespace merge_and_shrink {
MergeSelectorScoreB... |
0173dfee54ab0b0a26431a4455fdd1b512f904c8 | 3fc3a211e934adbad2d7326fd4aa64c220eb596e | /ForFudan/f2.cpp | 97d0f0ce2bf26a752f9550d9eb0430ded05b7bbd | [] | no_license | ejacky/c-plus-plus-primer | 86abd40dc7705092ee8b5d750eded0a9cb126188 | 6ee0bbaa0bc515eb637d32d441bb14a8f8b09630 | refs/heads/master | 2021-01-19T08:35:04.632777 | 2017-11-11T15:13:54 | 2017-11-11T15:13:54 | 100,654,175 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 752 | cpp | f2.cpp | #include <iostream>
using namespace std;
void e1()
{
double *p;
p = new double[3];
for (int i = 0; i < 3; i++)
cin >> *(p+i);
for (int i = 0; i < 3; i++)
cout << *(p+i) << " ";
delete p;
}
template <class T>
void max(T m1, T m2, T m3)
{
T temp;
temp = m1;
if (m1 > m2) {
temp = m1;
m1 = m2;
m2 = tem... |
e3568a415f219f65a2d5d11a2ed70c4926242863 | 92c4eb7b4e66e82fda6684d7c98a6a66203d930a | /src/DS/containers/rb_tree.h | 0dbbc8e827fc9efef0f0bebebc90082877b2303f | [] | no_license | grouptheory/SEAN | 5ea2ab3606898d842b36d5c4941a5685cda529d9 | 6aa7d7a81a6f71a5f2a4f52f15d8e50b863f05b4 | refs/heads/master | 2020-03-16T23:15:51.392537 | 2018-05-11T17:49:18 | 2018-05-11T17:49:18 | 133,071,079 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,885 | h | rb_tree.h | // -*- C++ -*-
// +++++++++++++++
// S E A N --- Signalling Entity for ATM Networks ---
// +++++++++++++++
// Version: 1.0.1
//
// Copyright (c) 1998
// Naval Research Laboratory (NRL/CCS)
// and the
// Defense Advanced Research Projects Agency (DARPA)
//
// All Rights Reserved.
/... |
4284554de44a2aecd822f5700fb54ffaebf7d722 | 0028c740dab82658b67c0ee21d474b455c2104c6 | /ants/lib/antsRegistration4DFloat.h | 88fed6e6cd7b942e74c7aa5c75defa010a6be965 | [
"Apache-2.0"
] | permissive | ncullen93/ANTsPy | 3ecdf7af1a3c67c6fa1ed171c609d25c1104fccd | a4c990dcd5b7445a45ce7b366ee018c7350e7d9f | refs/heads/master | 2021-01-20T21:35:11.910867 | 2017-08-29T14:30:48 | 2017-08-29T14:30:48 | 101,770,979 | 3 | 1 | null | 2017-08-29T14:33:06 | 2017-08-29T14:33:06 | null | UTF-8 | C++ | false | false | 300 | h | antsRegistration4DFloat.h | #include "antsRegistrationTemplateHeader.h"
#include "antsCommandLineParser.h"
#include "antsCommandLineOption.h"
namespace ants {
//Instantiate the 4DFloat version
int antsRegistration4DFloat(ParserType::Pointer & parser)
{
return DoRegistration<float, 4>( parser );
}
} //end namespace ants
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.