hexsha stringlengths 40 40 | size int64 7 1.05M | ext stringclasses 13
values | lang stringclasses 1
value | max_stars_repo_path stringlengths 4 269 | max_stars_repo_name stringlengths 5 108 | max_stars_repo_head_hexsha stringlengths 40 40 | max_stars_repo_licenses listlengths 1 9 | max_stars_count int64 1 191k ⌀ | max_stars_repo_stars_event_min_datetime stringlengths 24 24 ⌀ | max_stars_repo_stars_event_max_datetime stringlengths 24 24 ⌀ | max_issues_repo_path stringlengths 4 269 | max_issues_repo_name stringlengths 5 116 | max_issues_repo_head_hexsha stringlengths 40 40 | max_issues_repo_licenses listlengths 1 9 | max_issues_count int64 1 67k ⌀ | max_issues_repo_issues_event_min_datetime stringlengths 24 24 ⌀ | max_issues_repo_issues_event_max_datetime stringlengths 24 24 ⌀ | max_forks_repo_path stringlengths 4 269 | max_forks_repo_name stringlengths 5 116 | max_forks_repo_head_hexsha stringlengths 40 40 | max_forks_repo_licenses listlengths 1 9 | max_forks_count int64 1 105k ⌀ | max_forks_repo_forks_event_min_datetime stringlengths 24 24 ⌀ | max_forks_repo_forks_event_max_datetime stringlengths 24 24 ⌀ | content stringlengths 7 1.05M | avg_line_length float64 1.21 330k | max_line_length int64 6 990k | alphanum_fraction float64 0.01 0.99 | author_id stringlengths 2 40 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ccef907f0b16ea546b61a842b2c637ee439a8238 | 330 | hpp | C++ | include/Order.hpp | Xhiel23/Practica_Tienda_cpp | 412003c72498f28e67d4b9f41852e3545f82e7ed | [
"MIT"
] | null | null | null | include/Order.hpp | Xhiel23/Practica_Tienda_cpp | 412003c72498f28e67d4b9f41852e3545f82e7ed | [
"MIT"
] | null | null | null | include/Order.hpp | Xhiel23/Practica_Tienda_cpp | 412003c72498f28e67d4b9f41852e3545f82e7ed | [
"MIT"
] | null | null | null | #include "utilities.hpp"
#include "Food.hpp"
class Order
{
public:
std::vector<Product> products;
int orderDay;
int orderMonth;
int orderYear;
int totalProducts;
double totalPrice;
Order(int orderDay, int orderMonth, int orderYear);
Order();
void computeBill();
void printOrde... | 18.333333 | 55 | 0.657576 | Xhiel23 |
cceff5123fabb181d9c79012b5fa5807b59a5277 | 32,087 | cpp | C++ | src/reco/wordrec/common/LTKRecognitionContext.cpp | bhardwajhp/lipitk-git-repo | def89fffc64394ff310b07bb7775df2564ecea34 | [
"Apache-2.0"
] | null | null | null | src/reco/wordrec/common/LTKRecognitionContext.cpp | bhardwajhp/lipitk-git-repo | def89fffc64394ff310b07bb7775df2564ecea34 | [
"Apache-2.0"
] | null | null | null | src/reco/wordrec/common/LTKRecognitionContext.cpp | bhardwajhp/lipitk-git-repo | def89fffc64394ff310b07bb7775df2564ecea34 | [
"Apache-2.0"
] | null | null | null | /*****************************************************************************************
* Copyright (c) 2006 Hewlett-Packard Development Company, L.P.
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* ... | 30.100375 | 128 | 0.585066 | bhardwajhp |
ccf1217613402246c262ac1036dbac0d9c1bb5d9 | 4,019 | cpp | C++ | PokerGame/Classes/Hands.cpp | mettoboshi/poker-game | eae81438d55b2f66b768a6519350c4da0935e7c7 | [
"MIT"
] | 20 | 2016-03-28T08:00:28.000Z | 2019-07-01T04:23:48.000Z | PokerGame/Classes/Hands.cpp | mettoboshi/poker-game | eae81438d55b2f66b768a6519350c4da0935e7c7 | [
"MIT"
] | null | null | null | PokerGame/Classes/Hands.cpp | mettoboshi/poker-game | eae81438d55b2f66b768a6519350c4da0935e7c7 | [
"MIT"
] | 4 | 2017-03-28T16:11:06.000Z | 2019-02-20T17:27:59.000Z | //
// Hands.cpp
// PokerGame
//
#include "Hands.hpp"
USING_NS_CC;
Hands::Hands()
{}
Hands::~Hands()
{
for(auto card : this->cards)
{
CC_SAFE_RELEASE_NULL(card.second->card);
CC_SAFE_RELEASE_NULL(card.second);
}
}
bool Hands::init()
{
return true;
}
// 手札のn番目にカードをセット
void Hands::s... | 19.509709 | 60 | 0.485195 | mettoboshi |
ccf40d824395a01575342a23d6a985a49c672275 | 24,565 | cpp | C++ | libs/win/winexec.cpp | gknowles/dimapp | daadd9afe5fb1a6f716c431411e20c48ca180f9f | [
"BSL-1.0"
] | 1 | 2016-07-20T18:43:34.000Z | 2016-07-20T18:43:34.000Z | libs/win/winexec.cpp | gknowles/dimapp | daadd9afe5fb1a6f716c431411e20c48ca180f9f | [
"BSL-1.0"
] | 4 | 2016-08-30T05:29:18.000Z | 2016-11-07T04:02:15.000Z | libs/win/winexec.cpp | gknowles/dimapp | daadd9afe5fb1a6f716c431411e20c48ca180f9f | [
"BSL-1.0"
] | 1 | 2017-10-20T22:31:17.000Z | 2017-10-20T22:31:17.000Z | // Copyright Glen Knowles 2019 - 2021.
// Distributed under the Boost Software License, Version 1.0.
//
// winres.cpp - dim windows platform
#include "pch.h"
#pragma hdrstop
using namespace std;
using namespace Dim;
/****************************************************************************
*
* Declarations
*
**... | 26.876368 | 79 | 0.495095 | gknowles |
6901773a79e7819829a285391bbdc7d7c0feaf79 | 2,546 | cc | C++ | backends/npu/kernels/cast_kernel.cc | Aganlengzi/PaddleCustomDevice | 0aa0d2e1b2e5db556777604e6fe851a7d0697456 | [
"Apache-2.0"
] | null | null | null | backends/npu/kernels/cast_kernel.cc | Aganlengzi/PaddleCustomDevice | 0aa0d2e1b2e5db556777604e6fe851a7d0697456 | [
"Apache-2.0"
] | null | null | null | backends/npu/kernels/cast_kernel.cc | Aganlengzi/PaddleCustomDevice | 0aa0d2e1b2e5db556777604e6fe851a7d0697456 | [
"Apache-2.0"
] | null | null | null | // Copyright (c) 2022 PaddlePaddle Authors. All Rights Reserved.
//
// 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... | 35.859155 | 75 | 0.628437 | Aganlengzi |
6902fa66817a82195c3b78aac8867e849e1a6533 | 227 | cpp | C++ | verify/verify-yosupo-string/yosupo-z-algorithm.test.cpp | NachiaVivias/library | 73091ddbb00bc59328509c8f6e662fea2b772994 | [
"CC0-1.0"
] | 69 | 2020-11-06T05:21:42.000Z | 2022-03-29T03:38:35.000Z | verify/verify-yosupo-string/yosupo-z-algorithm.test.cpp | NachiaVivias/library | 73091ddbb00bc59328509c8f6e662fea2b772994 | [
"CC0-1.0"
] | 21 | 2020-07-25T04:47:12.000Z | 2022-02-01T14:39:29.000Z | verify/verify-yosupo-string/yosupo-z-algorithm.test.cpp | NachiaVivias/library | 73091ddbb00bc59328509c8f6e662fea2b772994 | [
"CC0-1.0"
] | 9 | 2020-11-06T11:55:10.000Z | 2022-03-20T04:45:31.000Z | #define PROBLEM "https://judge.yosupo.jp/problem/zalgorithm"
//
#include "../../template/template.hpp"
//
#include "../../string/z-algorithm.hpp"
using namespace Nyaan;
void Nyaan::solve() {
ins(s);
out(z_algorithm(s));
}
| 18.916667 | 60 | 0.669604 | NachiaVivias |
6904d91a526b6a87879cb54d2dc836bb8fa35704 | 9,863 | hxx | C++ | main/comphelper/inc/comphelper/stl_types.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/comphelper/inc/comphelper/stl_types.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/comphelper/inc/comphelper/stl_types.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 331 | 2015-01-06T11:40:55.000Z | 2022-03-14T04:07:51.000Z | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... | 35.351254 | 153 | 0.573963 | Grosskopf |
690ab434cbe96c481358662fbc419dc351a1d613 | 36,549 | cpp | C++ | hgpucl/hgpucl_devices.cpp | vadimdi/PRNGCL | e935c9139066a5384ef150de4a54716fc1c24b7b | [
"BSD-2-Clause"
] | 6 | 2015-06-29T16:59:17.000Z | 2017-12-14T13:50:36.000Z | hgpucl/hgpucl_devices.cpp | vadimdi/PRNGCL | e935c9139066a5384ef150de4a54716fc1c24b7b | [
"BSD-2-Clause"
] | null | null | null | hgpucl/hgpucl_devices.cpp | vadimdi/PRNGCL | e935c9139066a5384ef150de4a54716fc1c24b7b | [
"BSD-2-Clause"
] | 3 | 2015-03-26T15:08:52.000Z | 2020-01-07T06:11:29.000Z | /******************************************************************************
* @file hgpucl_devices.cpp
* @author Vadim Demchik <vadimdi@yahoo.com>
* @version 1.0.2
*
* @brief [HGPU library]
* Interface for OpenCL AMD APP & nVidia SDK environment
* devices submodule
*
*
* @sec... | 42.847597 | 173 | 0.744015 | vadimdi |
691113bd555bada5d5032b9618441c3c1bc9d8af | 4,144 | cpp | C++ | Circuit3C/src/main.cpp | padlewski/DLP_COMP444 | 7635517b50f2c806856fc748db6f6f6c5bc26d34 | [
"MIT"
] | null | null | null | Circuit3C/src/main.cpp | padlewski/DLP_COMP444 | 7635517b50f2c806856fc748db6f6f6c5bc26d34 | [
"MIT"
] | null | null | null | Circuit3C/src/main.cpp | padlewski/DLP_COMP444 | 7635517b50f2c806856fc748db6f6f6c5bc26d34 | [
"MIT"
] | null | null | null | #include <Arduino.h>
#include <Servo.h> //include the servo library
const int trigPin = 11; //connects to the trigger pin on the distance sensor
const int echoPin = 12; //connects to the echo pin on the distance sensor
const int redPin = 3; //pin to control the red LED ... | 34.533333 | 161 | 0.624759 | padlewski |
6911c61370affdff725c6a6f147cc296d2b5dfed | 3,489 | cpp | C++ | libsrc/jsonserver/JsonServer.cpp | juanesf/hyperion_openwrt_mt7620 | a29624e1ca03c37517b043956b55064b6021c7b4 | [
"MIT"
] | null | null | null | libsrc/jsonserver/JsonServer.cpp | juanesf/hyperion_openwrt_mt7620 | a29624e1ca03c37517b043956b55064b6021c7b4 | [
"MIT"
] | null | null | null | libsrc/jsonserver/JsonServer.cpp | juanesf/hyperion_openwrt_mt7620 | a29624e1ca03c37517b043956b55064b6021c7b4 | [
"MIT"
] | null | null | null | // system includes
#include <stdexcept>
// project includes
#include <jsonserver/JsonServer.h>
#include "JsonClientConnection.h"
#include "Poco/Net/HTTPRequestHandler.h"
#include "Poco/Net/HTTPRequestHandlerFactory.h"
#include "Poco/Net/WebSocket.h"
#include "Poco/Net/NetException.h"
#include "Poco/Net/HTTPServerRequ... | 32.305556 | 134 | 0.651476 | juanesf |
6914aa29492fe85b7864021a19b19a2aade8818e | 2,145 | hpp | C++ | Support/Modules/GSRoot/Point.hpp | graphisoft-python/TextEngine | 20c2ff53877b20fdfe2cd51ce7abdab1ff676a70 | [
"Apache-2.0"
] | 3 | 2019-07-15T10:54:54.000Z | 2020-01-25T08:24:51.000Z | Support/Modules/GSRoot/Point.hpp | graphisoft-python/GSRoot | 008fac2c6bf601ca96e7096705e25b10ba4d3e75 | [
"Apache-2.0"
] | null | null | null | Support/Modules/GSRoot/Point.hpp | graphisoft-python/GSRoot | 008fac2c6bf601ca96e7096705e25b10ba4d3e75 | [
"Apache-2.0"
] | 1 | 2020-09-26T03:17:22.000Z | 2020-09-26T03:17:22.000Z | // *****************************************************************************
//
// Point class
//
// Module: AC
// Namespace: -
// Contact person: AZS
//
// SG compatible
//
// *****************************************************************************
#ifndef POINT_HPP
#define POINT_HPP
#pragma once
... | 16.374046 | 80 | 0.49324 | graphisoft-python |
69158c9c357a594c3e78806e318ed2bba85b49da | 4,810 | cxx | C++ | MSEL_src/MSEL_core/dbdet_curvelet.cxx | yuliangguo/MSEL_contour_extraction_cxx | 723893a92370dfe084afd23d9a69d3e2fead2464 | [
"MIT"
] | 4 | 2020-04-23T12:28:41.000Z | 2021-06-07T05:54:16.000Z | MSEL_src/MSEL_core/dbdet_curvelet.cxx | yuliangguo/MSEL_contour_extraction_cxx | 723893a92370dfe084afd23d9a69d3e2fead2464 | [
"MIT"
] | null | null | null | MSEL_src/MSEL_core/dbdet_curvelet.cxx | yuliangguo/MSEL_contour_extraction_cxx | 723893a92370dfe084afd23d9a69d3e2fead2464 | [
"MIT"
] | 1 | 2017-06-05T18:00:21.000Z | 2017-06-05T18:00:21.000Z | #include "dbdet_curvelet.h"
#include <vcl_iostream.h>
#include <vcl_fstream.h>
#include <vcl_cassert.h>
#include <vcl_deque.h>
#include <vcl_algorithm.h>
//: copy constructor
dbdet_curvelet::dbdet_curvelet(const dbdet_curvelet& other)
{
//the edgels have to copied as links because curvelets are just groupings of th... | 26.574586 | 99 | 0.673805 | yuliangguo |
69169830c1ce01e00e1d9551f7e899d2e1cadcd4 | 346 | cc | C++ | tests/s-approximations-unittest.cc | vined/biosensor-modeling | dda882d70fbf7128bc45cf3aed2b73dbc70f6693 | [
"MIT"
] | null | null | null | tests/s-approximations-unittest.cc | vined/biosensor-modeling | dda882d70fbf7128bc45cf3aed2b73dbc70f6693 | [
"MIT"
] | null | null | null | tests/s-approximations-unittest.cc | vined/biosensor-modeling | dda882d70fbf7128bc45cf3aed2b73dbc70f6693 | [
"MIT"
] | null | null | null | #include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "../src/s-approximations.h"
using ::testing::ElementsAreArray;
namespace {
TEST(ApproximationsUtilsTest, GetProgressTest) {
std::vector<double> y_new {1, 2, 3, 4, 5};
std::vector<double> y_old {0, 1, 2, 3, 3};
EXPECT_DOUBLE_EQ(2.0, getProg... | 18.210526 | 53 | 0.66474 | vined |
69192dd65e8e8a19fafdc420ad72dabcb3b60a6d | 11,464 | hpp | C++ | Pods/GeoFeatures/GeoFeatures/Internal/geofeatures/operators/Intersects.hpp | xarvey/Yuuuuuge | 9f4ec32f81cf813ea630ba2c44eb03970c56dad3 | [
"Apache-2.0"
] | null | null | null | Pods/GeoFeatures/GeoFeatures/Internal/geofeatures/operators/Intersects.hpp | xarvey/Yuuuuuge | 9f4ec32f81cf813ea630ba2c44eb03970c56dad3 | [
"Apache-2.0"
] | null | null | null | Pods/GeoFeatures/GeoFeatures/Internal/geofeatures/operators/Intersects.hpp | xarvey/Yuuuuuge | 9f4ec32f81cf813ea630ba2c44eb03970c56dad3 | [
"Apache-2.0"
] | null | null | null | /**
* Intersects.hpp
*
* Copyright 2015 Tony Stone
*
* 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 applicab... | 43.097744 | 167 | 0.491626 | xarvey |
691dc3230f62e0fb18cb4241f8918f8e447cb4cf | 7,144 | hpp | C++ | src/dispatch.hpp | wenjian0202/mod-abm-2.0 | 0057126f583d76834237daf4dd9f96ffb4715eff | [
"MIT"
] | 6 | 2021-03-08T15:29:20.000Z | 2021-07-04T06:39:23.000Z | src/dispatch.hpp | wenjian0202/mod-abm-2.0 | 0057126f583d76834237daf4dd9f96ffb4715eff | [
"MIT"
] | 1 | 2021-03-25T03:36:57.000Z | 2021-03-25T03:36:57.000Z | src/dispatch.hpp | wenjian0202/mod-abm-2.0 | 0057126f583d76834237daf4dd9f96ffb4715eff | [
"MIT"
] | 3 | 2021-03-18T07:32:00.000Z | 2021-08-11T09:53:40.000Z | /// \author Jian Wen
/// \date 2021/02/02
#pragma once
#include "types.hpp"
#include <cstddef>
/// \brief Assign the pending trips to the vehicles using Insertion Heuristics.
/// \param pending_trip_ids A vector holding indices to the pending trips.
/// \param trips A vector of all trips.
/// \param vehicles A vecto... | 51.028571 | 100 | 0.638438 | wenjian0202 |
691e38ca93768071e24cbf69f255584a2bdbd21d | 1,630 | cpp | C++ | Code/BBearEditor/Engine/Render/BufferObject/BBTranslateFeedbackObject.cpp | xiaoxianrouzhiyou/BBearEditor | 0f1b779d87c297661f9a1e66d0613df43f5fe46b | [
"MIT"
] | 26 | 2021-06-30T02:19:30.000Z | 2021-07-23T08:38:46.000Z | Code/BBearEditor/Engine/Render/BufferObject/BBTranslateFeedbackObject.cpp | lishangdian/BBearEditor-2.0 | 1f4b463ef756ed36cc15d10abae822efc400c4d7 | [
"MIT"
] | null | null | null | Code/BBearEditor/Engine/Render/BufferObject/BBTranslateFeedbackObject.cpp | lishangdian/BBearEditor-2.0 | 1f4b463ef756ed36cc15d10abae822efc400c4d7 | [
"MIT"
] | 3 | 2021-09-01T08:19:30.000Z | 2021-12-28T19:06:40.000Z | #include "BBTranslateFeedbackObject.h"
#include "BBVertexBufferObject.h"
BBTranslateFeedbackObject::BBTranslateFeedbackObject(int nVertexCount, GLenum hint, GLenum eDrawPrimitiveType)
: BBBufferObject()
{
m_nVertexCount = nVertexCount;
m_eDrawPrimitiveType = eDrawPrimitiveType;
createTFO();
}
void BB... | 29.107143 | 114 | 0.725153 | xiaoxianrouzhiyou |
69244678a6c097ed04b869e4f77fd7482b68c4c2 | 6,618 | cxx | C++ | core/teca_index_executive.cxx | Data-Scientist-Wannabe/TECA | feb0ae7eb23e031842ca958b85168f7fdcae7f06 | [
"BSD-3-Clause-LBNL"
] | null | null | null | core/teca_index_executive.cxx | Data-Scientist-Wannabe/TECA | feb0ae7eb23e031842ca958b85168f7fdcae7f06 | [
"BSD-3-Clause-LBNL"
] | null | null | null | core/teca_index_executive.cxx | Data-Scientist-Wannabe/TECA | feb0ae7eb23e031842ca958b85168f7fdcae7f06 | [
"BSD-3-Clause-LBNL"
] | null | null | null | #include "teca_index_executive.h"
#include "teca_config.h"
#include "teca_common.h"
#include <string>
#include <sstream>
#include <iostream>
#include <utility>
using std::cerr;
using std::endl;
// --------------------------------------------------------------------------
teca_index_executive::teca_index_executive()
... | 28.649351 | 88 | 0.487307 | Data-Scientist-Wannabe |
69264d19724dd12efc8db02ec69470c5bec653b6 | 19,055 | cpp | C++ | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/utils/funcexp/func_bitwise.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/utils/funcexp/func_bitwise.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/vendor/mariadb-10.6.7/storage/columnstore/columnstore/utils/funcexp/func_bitwise.cpp | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | 2 | 2022-02-27T14:00:01.000Z | 2022-03-31T06:24:22.000Z | /* Copyright (C) 2014 InfiniDB, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; version 2 of
the License.
This program is distributed in the hope that it will be useful,
but W... | 33.312937 | 97 | 0.639097 | zettadb |
6926614fb6b20fda97e724ba86ff8030248cdb92 | 1,265 | cpp | C++ | src/core/deck_of_cards.cpp | maxkolotilin/Holding-cards | c4a07f44c468b4e47a0e6e9d9c90ca3a885ddd16 | [
"MIT"
] | 1 | 2015-06-07T16:09:45.000Z | 2015-06-07T16:09:45.000Z | src/core/deck_of_cards.cpp | maxkolotilin/Holding-cards | c4a07f44c468b4e47a0e6e9d9c90ca3a885ddd16 | [
"MIT"
] | null | null | null | src/core/deck_of_cards.cpp | maxkolotilin/Holding-cards | c4a07f44c468b4e47a0e6e9d9c90ca3a885ddd16 | [
"MIT"
] | null | null | null | /*
* Created on 20.03.2015 by Maxim Kolotilin
* e-mail: maxkolmail@gmail.com
*
* Distributed under the Boost Software License, Version 1.0.
* http://www.boost.org/LICENSE_1_0.txt
*
* It's a part of Texas Hold'em project
*
* Implementation for DeckOfCards.h
*
*/
#include <cstdlib>
#include <ctime>
#include ... | 20.737705 | 76 | 0.590514 | maxkolotilin |
6926cb35fce3bcef927d6d73a17cb849b534e390 | 950 | cpp | C++ | problems/166.Fraction_to_Recurring_Decimal/yin_simulate_nlogn.cpp | subramp-prep/leetcode | d125201d9021ab9b1eea5e5393c2db4edd84e740 | [
"Unlicense"
] | null | null | null | problems/166.Fraction_to_Recurring_Decimal/yin_simulate_nlogn.cpp | subramp-prep/leetcode | d125201d9021ab9b1eea5e5393c2db4edd84e740 | [
"Unlicense"
] | null | null | null | problems/166.Fraction_to_Recurring_Decimal/yin_simulate_nlogn.cpp | subramp-prep/leetcode | d125201d9021ab9b1eea5e5393c2db4edd84e740 | [
"Unlicense"
] | null | null | null | // Simulate
// Time Complexity O(nlogn)
// Space Complexity O(n)
class Solution {
public:
string fractionToDecimal(int numerator, int denominator)
{
long long n = numerator, d = denominator; // prevent overflow
string res = "";
// sign of result
if ((n < 0 && d > 0) || (... | 25.675676 | 69 | 0.392632 | subramp-prep |
6928e167ced08d070afdc700b552d5dd9c6833de | 624 | cpp | C++ | cf/Div2/B/Vanya and Lanterns/main.cpp | wdjpng/soi | dd565587ae30985676f7f374093ec0687436b881 | [
"MIT"
] | null | null | null | cf/Div2/B/Vanya and Lanterns/main.cpp | wdjpng/soi | dd565587ae30985676f7f374093ec0687436b881 | [
"MIT"
] | null | null | null | cf/Div2/B/Vanya and Lanterns/main.cpp | wdjpng/soi | dd565587ae30985676f7f374093ec0687436b881 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
// Turn off synchronization between cin/cout and scanf/printf
ios_base::sync_with_stdio(false);
// Disable automatic flush of cout when reading from cin cin.tie(0);
cin.tie(0);
int n, l;
cin >> n >> l;
vec... | 23.111111 | 72 | 0.573718 | wdjpng |
692bf79c7d220200f498c249b7da064afde48f59 | 1,906 | hpp | C++ | asps/modbus/pdu/semantic/pdu_client.hpp | activesys/asps | 36cc90a192d13df8669f9743f80a0662fe888d16 | [
"MIT"
] | null | null | null | asps/modbus/pdu/semantic/pdu_client.hpp | activesys/asps | 36cc90a192d13df8669f9743f80a0662fe888d16 | [
"MIT"
] | null | null | null | asps/modbus/pdu/semantic/pdu_client.hpp | activesys/asps | 36cc90a192d13df8669f9743f80a0662fe888d16 | [
"MIT"
] | null | null | null | // Copyright (c) 2021 The asps Authors. All rights reserved.
// Use of this source code is governed by a MIT license that can be
// found in the LICENSE file. See the AUTHORS file for names of contributors.
//
// Modbus PDU Client.
#ifndef ASPS_MODBUS_PDU_SEMANTIC_CLIENT_HPP
#define ASPS_MODBUS_PDU_SEMANTIC_CLIENT_HPP... | 28.878788 | 77 | 0.732424 | activesys |
692edafe41c3a64de468fbbbc2a38ba867907740 | 2,086 | cpp | C++ | solutions/0950.x-of-a-kind-in-a-deck-of-cards/0950.x-of-a-kind-in-a-deck-of-cards.1541745454.cpp | nettee/leetcode | 19aa8d54d64cce3679db5878ee0194fad95d8fa1 | [
"MIT"
] | 1 | 2021-01-14T06:01:02.000Z | 2021-01-14T06:01:02.000Z | solutions/0950.x-of-a-kind-in-a-deck-of-cards/0950.x-of-a-kind-in-a-deck-of-cards.1541745454.cpp | nettee/leetcode | 19aa8d54d64cce3679db5878ee0194fad95d8fa1 | [
"MIT"
] | 8 | 2018-03-27T11:47:19.000Z | 2018-11-12T06:02:12.000Z | solutions/0950.x-of-a-kind-in-a-deck-of-cards/0950.x-of-a-kind-in-a-deck-of-cards.1541745454.cpp | nettee/leetcode | 19aa8d54d64cce3679db5878ee0194fad95d8fa1 | [
"MIT"
] | 2 | 2020-04-30T09:47:01.000Z | 2020-12-03T09:34:08.000Z | /*
* [950] X of a Kind in a Deck of Cards
*
* https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/description/
*
* algorithms
* Easy (33.02%)
* Total Accepted: 7.7K
* Total Submissions: 23.2K
* Testcase Example: '[1,2,3,4,4,3,2,1]'
*
* In a deck of cards, each card has an integer written on it.
... | 16.555556 | 79 | 0.490892 | nettee |
69327c89e8e8109949bbeecf1eff31b65c76f042 | 2,114 | cpp | C++ | patch/game/rapmaker.cpp | Tonyx97/TombMP | 7eb2d265df2fe7312b7ed07dd5943736340b921c | [
"MIT"
] | 3 | 2021-10-10T11:12:03.000Z | 2021-11-04T16:46:57.000Z | patch/game/rapmaker.cpp | Tonyx97/TombMP | 7eb2d265df2fe7312b7ed07dd5943736340b921c | [
"MIT"
] | null | null | null | patch/game/rapmaker.cpp | Tonyx97/TombMP | 7eb2d265df2fe7312b7ed07dd5943736340b921c | [
"MIT"
] | null | null | null | #include <specific/stypes.h>
#include "objects.h"
#include "lara.h"
#include "lot.h"
#include "types.h"
#define MAX_RAPTORS 5
#define LARA_TOO_CLOSE SQUARE(WALL_L * 4)
int16_t RaptorItem[3] = { NO_ITEM, NO_ITEM, NO_ITEM };
void RaptorEmitterControl(int16_t item_num)
{
auto item = &items[item_num];
if (!(item->a... | 24.022727 | 122 | 0.685904 | Tonyx97 |
6934c1945f8a1f4015897ef2f9f40e73e5587b80 | 2,823 | cc | C++ | test/LRUcacheSingletonTest.cc | vsdmars/cpp_libs | d3a67006e9c3bd4806945a42d8e9ae9b16aa5b7d | [
"MIT"
] | null | null | null | test/LRUcacheSingletonTest.cc | vsdmars/cpp_libs | d3a67006e9c3bd4806945a42d8e9ae9b16aa5b7d | [
"MIT"
] | null | null | null | test/LRUcacheSingletonTest.cc | vsdmars/cpp_libs | d3a67006e9c3bd4806945a42d8e9ae9b16aa5b7d | [
"MIT"
] | null | null | null | #include "lrucache_api.h"
// posix header
#include <arpa/inet.h>
#include <sys/socket.h>
#include <thread>
#include <gtest/gtest.h>
using std::thread;
using namespace AtsPluginUtils;
namespace AtsPluginUtils {
constexpr int TEST_TYPE = 42;
template<>
struct CacheValue<static_cast<CACHE_VALUE_TYPE>(TEST_TYPE)> {
... | 26.885714 | 109 | 0.72972 | vsdmars |
693764b377374707b669ae6cd44e739a77dc6693 | 4,454 | cpp | C++ | src/options/didyoumean.cpp | FabianWolff/cvc4-debian | e38afe6cb10bdb79f0bae398b9605e4deae7578f | [
"BSL-1.0"
] | null | null | null | src/options/didyoumean.cpp | FabianWolff/cvc4-debian | e38afe6cb10bdb79f0bae398b9605e4deae7578f | [
"BSL-1.0"
] | null | null | null | src/options/didyoumean.cpp | FabianWolff/cvc4-debian | e38afe6cb10bdb79f0bae398b9605e4deae7578f | [
"BSL-1.0"
] | null | null | null | /********************* */
/*! \file didyoumean.cpp
** \verbatim
** Top contributors (to current version):
** Kshitij Bansal, Tim King, Clark Barrett
** This file is part of the CVC4 project.
** Copyright (c) 2009-2016 by the authors listed in the file AUTHOR... | 27.493827 | 80 | 0.540413 | FabianWolff |
69386a6d2df7d85712ee8d58045a6962d2181bb6 | 719 | cpp | C++ | baekjoon/6217/source.cpp | qilip/ACMStudy | c4d6f31b01358ead4959c92f1fac59a3826f3f77 | [
"CC-BY-3.0"
] | 4 | 2020-02-02T08:34:46.000Z | 2021-10-01T11:21:17.000Z | baekjoon/6217/source.cpp | qilip/ACMStudy | c4d6f31b01358ead4959c92f1fac59a3826f3f77 | [
"CC-BY-3.0"
] | 1 | 2021-09-04T14:03:50.000Z | 2021-09-04T14:03:50.000Z | baekjoon/6217/source.cpp | qilip/ACMStudy | c4d6f31b01358ead4959c92f1fac59a3826f3f77 | [
"CC-BY-3.0"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n, i, h, r;
scanf("%d %d %d %d", &n, &i, &h, &r);
vector<pair<int, int>> v;
vector<pair<int, int>> vq;
for(int a=0;a<r;a++){
int q, p;
scanf("%d %d", &q, &p);
if(q > p) swap(q, p);
if(q+1 < p){
vq.emplace_back(q+1, p);
}
}
... | 20.542857 | 53 | 0.493741 | qilip |
693dffeecbf76175ab9b9b0ba17420ca01a97e22 | 3,044 | cpp | C++ | clang/test/ClangScanDeps/modules-full.cpp | dan-zheng/llvm-project | 6b792850da0345274758c9260fda5df5e57ab486 | [
"Apache-2.0"
] | 158 | 2016-07-21T10:45:05.000Z | 2022-03-25T00:56:20.000Z | clang/test/ClangScanDeps/modules-full.cpp | dan-zheng/llvm-project | 6b792850da0345274758c9260fda5df5e57ab486 | [
"Apache-2.0"
] | 35 | 2016-07-25T01:23:07.000Z | 2021-09-27T16:05:50.000Z | clang/test/ClangScanDeps/modules-full.cpp | dan-zheng/llvm-project | 6b792850da0345274758c9260fda5df5e57ab486 | [
"Apache-2.0"
] | 62 | 2016-08-29T17:28:11.000Z | 2021-12-29T17:55:58.000Z | // RUN: rm -rf %t.dir
// RUN: rm -rf %t.cdb
// RUN: rm -rf %t.module-cache
// RUN: mkdir -p %t.dir
// RUN: cp %s %t.dir/modules_cdb_input.cpp
// RUN: cp %s %t.dir/modules_cdb_input2.cpp
// RUN: mkdir %t.dir/Inputs
// RUN: cp %S/Inputs/header.h %t.dir/Inputs/header.h
// RUN: cp %S/Inputs/header2.h %t.dir/Inputs/header2.... | 39.025641 | 97 | 0.554534 | dan-zheng |
6943a049660ee3277364c015dfb829533683e515 | 7,691 | cc | C++ | src/zjump.cc | vteromero/zjump | c8c0d38065f8779d144d05381f0945b5f0db43e3 | [
"MIT"
] | 2 | 2017-02-23T09:55:54.000Z | 2017-02-23T10:06:32.000Z | src/zjump.cc | vteromero/zjump | c8c0d38065f8779d144d05381f0945b5f0db43e3 | [
"MIT"
] | null | null | null | src/zjump.cc | vteromero/zjump | c8c0d38065f8779d144d05381f0945b5f0db43e3 | [
"MIT"
] | null | null | null | /**
Copyright (c) 2017 Vicente Romero. All rights reserved.
Licensed under the MIT License.
See LICENSE file in the project root for full license information.
*/
#include <cstdio>
#include <cstring>
#include <string>
#include "compress.h"
#include "constants.h"
#include "decompress.h"
using namespace std... | 27.467857 | 96 | 0.593421 | vteromero |
69449ea720c73b0352bf124099774276b9843361 | 1,410 | cpp | C++ | engine/conversion/source/ArtifactDumper.cpp | sidav/shadow-of-the-wyrm | 747afdeebed885b1a4f7ab42f04f9f756afd3e52 | [
"MIT"
] | 60 | 2019-08-21T04:08:41.000Z | 2022-03-10T13:48:04.000Z | engine/conversion/source/ArtifactDumper.cpp | cleancoindev/shadow-of-the-wyrm | 51b23e98285ecb8336324bfd41ebf00f67b30389 | [
"MIT"
] | 3 | 2021-03-18T15:11:14.000Z | 2021-10-20T12:13:07.000Z | engine/conversion/source/ArtifactDumper.cpp | cleancoindev/shadow-of-the-wyrm | 51b23e98285ecb8336324bfd41ebf00f67b30389 | [
"MIT"
] | 8 | 2019-11-16T06:29:05.000Z | 2022-01-23T17:33:43.000Z | #include <sstream>
#include "ArtifactDumper.hpp"
#include "Conversion.hpp"
#include "ItemDumper.hpp"
#include "TextKeys.hpp"
using namespace std;
ArtifactDumper::ArtifactDumper(const ItemMap& new_item_map, const GenerationValuesMap& new_igv_map, const uint new_num_cols)
: item_map(new_item_map), igv_map(new_igv_map),... | 26.111111 | 124 | 0.690071 | sidav |
6944e8a081f3a002f6638a7265f8665b6a7db528 | 3,368 | cpp | C++ | stream.cpp | ondra-novak/userver | 4ba4797637fedbb49c8f448469d7143746102ee5 | [
"MIT"
] | null | null | null | stream.cpp | ondra-novak/userver | 4ba4797637fedbb49c8f448469d7143746102ee5 | [
"MIT"
] | null | null | null | stream.cpp | ondra-novak/userver | 4ba4797637fedbb49c8f448469d7143746102ee5 | [
"MIT"
] | null | null | null | /*
* stream.cpp
*
* Created on: 9. 1. 2021
* Author: ondra
*/
#include "stream.h"
#include "async_provider.h"
namespace userver {
std::string_view SocketStream::read() {
std::string_view out;
if (curbuff.empty()) {
if (!eof) {
if (rdbuff.empty()) rdbuff.resize(1000);
int sz = sock->read(rdbuff.... | 20.662577 | 105 | 0.615202 | ondra-novak |
694510257d4c266d8c021b6aa035a78dc1ace904 | 1,395 | cpp | C++ | DP/House_Robber_198.cpp | obviouskkk/leetcode | 5d25c3080fdc9f68ae79e0f4655a474a51ff01fc | [
"BSD-3-Clause"
] | null | null | null | DP/House_Robber_198.cpp | obviouskkk/leetcode | 5d25c3080fdc9f68ae79e0f4655a474a51ff01fc | [
"BSD-3-Clause"
] | null | null | null | DP/House_Robber_198.cpp | obviouskkk/leetcode | 5d25c3080fdc9f68ae79e0f4655a474a51ff01fc | [
"BSD-3-Clause"
] | null | null | null | /* ***********************************************************************
> File Name: House_Robber_198.cpp
> Author: zzy
> Mail: 942744575@qq.com
> Created Time: Fri 22 Feb 2019 07:16:58 PM CST
********************************************************************** */
/*
你是一个专业的小偷，计划偷窃沿街的房屋。每间房内都藏有一定的现金，影... | 19.647887 | 92 | 0.53405 | obviouskkk |
6947647fc635cb94d51eca5ba5c1346daba305ab | 7,662 | cpp | C++ | user/drivers/acpi/src/bus/PciBus.cpp | tristanseifert/kush-os | 1ffd595aae8f3dc880e798eff72365b8b6c631f0 | [
"0BSD"
] | 4 | 2021-06-22T20:52:30.000Z | 2022-02-04T00:19:44.000Z | user/drivers/acpi/src/bus/PciBus.cpp | tristanseifert/kush-os | 1ffd595aae8f3dc880e798eff72365b8b6c631f0 | [
"0BSD"
] | null | null | null | user/drivers/acpi/src/bus/PciBus.cpp | tristanseifert/kush-os | 1ffd595aae8f3dc880e798eff72365b8b6c631f0 | [
"0BSD"
] | null | null | null | #include "PciBus.h"
#include "acpi.h"
#include "log.h"
#include <driver/DrivermanClient.h>
#include <mpack/mpack.h>
using namespace acpi;
std::string const PciBus::kBusName = "PCI";
std::string const PciBus::kDriverName = "AcpiPciRootBridge";
bool PciBus::gLogInterrupts = false;
/**
* Extracts the interrupt rout... | 28.273063 | 113 | 0.543461 | tristanseifert |
6947925b89d6354d11d2ebeb364896efe5c8f025 | 1,109 | cpp | C++ | Graph/DetectCycleUndirected/DetectCycleUsingUnionFind.cpp | PrachieNaik/DSA | 083522bb3c8a0694adec1f2856d4d4cd0fb51722 | [
"MIT"
] | null | null | null | Graph/DetectCycleUndirected/DetectCycleUsingUnionFind.cpp | PrachieNaik/DSA | 083522bb3c8a0694adec1f2856d4d4cd0fb51722 | [
"MIT"
] | null | null | null | Graph/DetectCycleUndirected/DetectCycleUsingUnionFind.cpp | PrachieNaik/DSA | 083522bb3c8a0694adec1f2856d4d4cd0fb51722 | [
"MIT"
] | null | null | null | /*
Problem statement: Given an undirected graph with V vertices and E edges, check whether it contains any cycle or not.
Constraints:
1 ≤ V, E ≤ 10^5
Approach: This is another method based on Union-Find. This method assumes that the graph doesn’t contain any self-loops.
We can keep track of the subsets in a 1D arr... | 23.595745 | 121 | 0.540126 | PrachieNaik |
6948c4b730f092e9aa145ba7b471eb6a9749d816 | 267 | cpp | C++ | source/framework/partitioned_array/src/array_partition_uint64.cpp | computationalgeography/lue | 71993169bae67a9863d7bd7646d207405dc6f767 | [
"MIT"
] | 2 | 2021-02-26T22:45:56.000Z | 2021-05-02T10:28:48.000Z | source/framework/partitioned_array/src/array_partition_uint64.cpp | pcraster/lue | e64c18f78a8b6d8a602b7578a2572e9740969202 | [
"MIT"
] | 262 | 2016-08-11T10:12:02.000Z | 2020-10-13T18:09:16.000Z | source/framework/partitioned_array/src/array_partition_uint64.cpp | computationalgeography/lue | 71993169bae67a9863d7bd7646d207405dc6f767 | [
"MIT"
] | 1 | 2020-03-11T09:49:41.000Z | 2020-03-11T09:49:41.000Z | #include "lue/framework/partitioned_array/array_partition_impl.hpp"
namespace lue {
template class ArrayPartition<std::uint64_t, 0>;
template class ArrayPartition<std::uint64_t, 1>;
template class ArrayPartition<std::uint64_t, 2>;
} // namespace lue
| 24.272727 | 67 | 0.749064 | computationalgeography |
694aadddf1dc57e6a0d2e3eb4ff5ac13043a5624 | 5,188 | cpp | C++ | lib/heif/Srcs/writer/auxiliaryimagewriter.cpp | anzksdk/tifig-by | 17a306b27e6e2dd2992e1c0896312047541f4be0 | [
"Apache-2.0"
] | null | null | null | lib/heif/Srcs/writer/auxiliaryimagewriter.cpp | anzksdk/tifig-by | 17a306b27e6e2dd2992e1c0896312047541f4be0 | [
"Apache-2.0"
] | null | null | null | lib/heif/Srcs/writer/auxiliaryimagewriter.cpp | anzksdk/tifig-by | 17a306b27e6e2dd2992e1c0896312047541f4be0 | [
"Apache-2.0"
] | null | null | null | /* Copyright (c) 2015-2017, Nokia Technologies Ltd.
* All rights reserved.
*
* Licensed under the Nokia High-Efficiency Image File Format (HEIF) License (the "License").
*
* You may not use the High-Efficiency Image File Format except in compliance with the License.
* The License accompanies the software and can ... | 33.25641 | 114 | 0.667887 | anzksdk |
694e41b62fd18581a35e497b57379741b0f936eb | 583 | cc | C++ | basic/bind/03.cc | chanchann/littleMickle | f3a839d8ad55f483bbac4e4224dcd35234c5aa00 | [
"MIT"
] | 1 | 2021-03-16T02:13:12.000Z | 2021-03-16T02:13:12.000Z | basic/bind/03.cc | chanchann/littleMickle | f3a839d8ad55f483bbac4e4224dcd35234c5aa00 | [
"MIT"
] | null | null | null | basic/bind/03.cc | chanchann/littleMickle | f3a839d8ad55f483bbac4e4224dcd35234c5aa00 | [
"MIT"
] | null | null | null | /*
bind()绑定时参数个数固定，类型需匹配
*/
#include <iostream>
#include <functional>
using namespace std;
void func3(int n1, int n2, int n3) {
cout << n1 << ' ' << n2 << ' ' << n3 << endl;
}
void test3_1() {
auto f3 = std::bind(func3, placeholders::_1, 101);
//f3(11); // 编译错误，因为bind函数中少了一个参数
}
void test3_2() {
au... | 23.32 | 75 | 0.600343 | chanchann |
6950341a5a7bdc98c804afb9768f304d09903d1e | 4,692 | cc | C++ | contrib/gnu/gcc/dist/gcc/brig/brigfrontend/brig-seg-inst-handler.cc | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gcc/dist/gcc/brig/brigfrontend/brig-seg-inst-handler.cc | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gcc/dist/gcc/brig/brigfrontend/brig-seg-inst-handler.cc | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | /* brig-seg-inst-handler.cc -- brig segment related instruction handling
Copyright (C) 2016-2020 Free Software Foundation, Inc.
Contributed by Pekka Jaaskelainen <pekka.jaaskelainen@parmance.com>
for General Processor Tech.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify... | 31.918367 | 72 | 0.708227 | TheSledgeHammer |
695075a6022cc3460f34c545bcc6ee5984704557 | 2,104 | cpp | C++ | test/spec/ts/psi/pat_spec.cpp | mrk21/ts-processor | 965d19939558e4c956bee7d35167f7483411c755 | [
"MIT"
] | 1 | 2018-08-13T04:01:11.000Z | 2018-08-13T04:01:11.000Z | test/spec/ts/psi/pat_spec.cpp | mrk21/ts-processor | 965d19939558e4c956bee7d35167f7483411c755 | [
"MIT"
] | null | null | null | test/spec/ts/psi/pat_spec.cpp | mrk21/ts-processor | 965d19939558e4c956bee7d35167f7483411c755 | [
"MIT"
] | 1 | 2018-09-23T03:36:20.000Z | 2018-09-23T03:36:20.000Z | #include <bandit_with_gmock/bandit_with_gmock.hpp>
#include <ts_processor/ts/data.hpp>
#include <ts_processor/ts/psi/pat.hpp>
#include <bitfield/iostream.hpp>
namespace ts_processor { namespace ts { namespace psi {
go_bandit([]{
using namespace bandit;
describe("ts::psi::pat", [&]{
ts::data data;
... | 33.935484 | 77 | 0.475285 | mrk21 |
6950c2cf28f88da37efe9b1e4c84267ceda1962b | 7,988 | inl | C++ | ssd/octree/OctreeCache.inl | csiro-workspace/pointcloudplugin | 815dd598ccf3780739b1ecae086ee78daa94ed5d | [
"BSD-3-Clause"
] | 5 | 2015-09-22T02:33:34.000Z | 2018-08-29T07:37:54.000Z | ssd/octree/OctreeCache.inl | csiro-workspace/pointcloudplugin | 815dd598ccf3780739b1ecae086ee78daa94ed5d | [
"BSD-3-Clause"
] | 1 | 2018-12-12T12:08:28.000Z | 2018-12-13T06:14:54.000Z | ssd/octree/OctreeCache.inl | csiro-workspace/pointcloudplugin | 815dd598ccf3780739b1ecae086ee78daa94ed5d | [
"BSD-3-Clause"
] | 4 | 2015-03-04T00:09:18.000Z | 2020-09-08T02:58:06.000Z | /*
Copyright (c) 2013, Fatih Calakli and Daniel Moreno
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 con... | 35.660714 | 138 | 0.591888 | csiro-workspace |
6953de013ac11a355e15d6181dc319853353a522 | 4,703 | cc | C++ | third_party/tmb/src/voltdb_procedure_factory.cc | spring-operator/quickstep | 3e98776002eb5db7154031fd6ef1a7f000a89d81 | [
"Apache-2.0"
] | 31 | 2016-01-20T05:43:46.000Z | 2022-02-07T09:14:06.000Z | third_party/tmb/src/voltdb_procedure_factory.cc | spring-operator/quickstep | 3e98776002eb5db7154031fd6ef1a7f000a89d81 | [
"Apache-2.0"
] | 221 | 2016-01-20T18:25:10.000Z | 2016-06-26T02:58:12.000Z | third_party/tmb/src/voltdb_procedure_factory.cc | spring-operator/quickstep | 3e98776002eb5db7154031fd6ef1a7f000a89d81 | [
"Apache-2.0"
] | 17 | 2016-01-20T04:00:21.000Z | 2019-03-12T02:41:25.000Z | // Copyright 2014-2015 Quickstep Technologies LLC.
//
// 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 b... | 43.953271 | 79 | 0.81246 | spring-operator |
69541216aa33eccc776467608d61f99b08bda6cd | 668 | cpp | C++ | src/examples/pcsupdater.cpp | framos-gemini/giapi-glue-cc | f59e1ce572494b57aad6985f3233f0e51167bb42 | [
"BSD-3-Clause"
] | null | null | null | src/examples/pcsupdater.cpp | framos-gemini/giapi-glue-cc | f59e1ce572494b57aad6985f3233f0e51167bb42 | [
"BSD-3-Clause"
] | 3 | 2017-06-14T15:21:50.000Z | 2020-08-03T19:51:57.000Z | src/examples/pcsupdater.cpp | framos-gemini/giapi-glue-cc | f59e1ce572494b57aad6985f3233f0e51167bb42 | [
"BSD-3-Clause"
] | 3 | 2017-06-13T13:59:36.000Z | 2021-02-09T02:01:14.000Z | /*
* A test application to demonstrate how to send zernikes corrections
* to the PCS via the GIAPI
*
* Created on: Dec 10, 2009
* Author: anunez
*/
#include <iostream>
#include <iomanip>
#include <giapi/GeminiUtil.h>
using namespace giapi;
int main(int argc, char **argv) {
try {
std::cout << "Star... | 17.578947 | 69 | 0.612275 | framos-gemini |
6956574a542563798f6067be8bd422597f891254 | 529 | hpp | C++ | src/application/appWindow.hpp | giffi-dev/GeimBoi | 6cf4f8cc3c07569d23bc70e2fa921ac870fd16f1 | [
"MIT"
] | null | null | null | src/application/appWindow.hpp | giffi-dev/GeimBoi | 6cf4f8cc3c07569d23bc70e2fa921ac870fd16f1 | [
"MIT"
] | null | null | null | src/application/appWindow.hpp | giffi-dev/GeimBoi | 6cf4f8cc3c07569d23bc70e2fa921ac870fd16f1 | [
"MIT"
] | null | null | null | #pragma once
#include <memory>
#include <thread>
#include <SDL2/SDL.h>
#include "../core/gbGameBoy.hpp"
namespace Giffi
{
class appWindow
{
public:
// Retruns true on success
static void Init();
static void Run();
static void CleanUp();
private:
static bool ShouldWindowClose();
static void DoEvents();
public:
... | 14.694444 | 44 | 0.718336 | giffi-dev |
695a43ee250ed0289249ded550bd3162e6a1419a | 2,082 | hpp | C++ | src/lib/cost_model/cost_feature.hpp | IanJamesMcKay/InMemoryDB | a267d9522926eca9add2ad4512f8ce352daac879 | [
"MIT"
] | 1 | 2021-04-14T11:16:52.000Z | 2021-04-14T11:16:52.000Z | src/lib/cost_model/cost_feature.hpp | IanJamesMcKay/InMemoryDB | a267d9522926eca9add2ad4512f8ce352daac879 | [
"MIT"
] | null | null | null | src/lib/cost_model/cost_feature.hpp | IanJamesMcKay/InMemoryDB | a267d9522926eca9add2ad4512f8ce352daac879 | [
"MIT"
] | 1 | 2020-11-30T13:11:04.000Z | 2020-11-30T13:11:04.000Z | #pragma once
#include <map>
#include "all_type_variant.hpp"
#include "types.hpp"
namespace opossum {
/**
* List of features usable in AbstractCostModels.
*
* Using enum to provide the unified "AbstractCostFeatureProxy" to access the same features for LQPs and PQPs.
* Also, this makes it easy to specify Cost for... | 29.742857 | 115 | 0.747839 | IanJamesMcKay |
695cc8171940192e6ed4e85c2a0842a4c2c9fd07 | 23,568 | cpp | C++ | blades/xbmc/xbmc/addons/Addon.cpp | krattai/AEBL | a7b12c97479e1236d5370166b15ca9f29d7d4265 | [
"BSD-2-Clause"
] | 4 | 2016-04-26T03:43:54.000Z | 2016-11-17T08:09:04.000Z | blades/xbmc/xbmc/addons/Addon.cpp | krattai/AEBL | a7b12c97479e1236d5370166b15ca9f29d7d4265 | [
"BSD-2-Clause"
] | 17 | 2015-01-05T21:06:22.000Z | 2015-12-07T20:45:44.000Z | blades/xbmc/xbmc/addons/Addon.cpp | krattai/AEBL | a7b12c97479e1236d5370166b15ca9f29d7d4265 | [
"BSD-2-Clause"
] | 3 | 2016-04-26T03:43:55.000Z | 2020-11-06T11:02:08.000Z | /*
* Copyright (C) 2005-2013 Team XBMC
* http://xbmc.org
*
* This Program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* ... | 30.6875 | 137 | 0.681814 | krattai |
695d90ca7d2170399ec7ba8c66ab5355e1365be4 | 363 | cpp | C++ | 2022/semana0/hw_0+/i.cpp | imeplusplus/ps | bc5b0539ce26b023962ca0f87e05027edf8d04cb | [
"MIT"
] | null | null | null | 2022/semana0/hw_0+/i.cpp | imeplusplus/ps | bc5b0539ce26b023962ca0f87e05027edf8d04cb | [
"MIT"
] | null | null | null | 2022/semana0/hw_0+/i.cpp | imeplusplus/ps | bc5b0539ce26b023962ca0f87e05027edf8d04cb | [
"MIT"
] | 1 | 2022-03-19T16:36:09.000Z | 2022-03-19T16:36:09.000Z | #include <bits/stdc++.h>
using namespace std;
const int N = 100;
int f[N];
int main(){
int n, m;
scanf("%d%d",&n, &m);
for(int i = 0; i < m; i++) scanf("%d", &f[i]);
sort(f, f + m);
int ans = f[n-1] - f[0];
for(int i = 0; i + n - 1 < m; i++){
ans = min(ans, f[i + n - 1] - f[i]);
... | 18.15 | 50 | 0.424242 | imeplusplus |
696037a3bc442b3bb621e969d50de7e921795a43 | 950 | hpp | C++ | 32 - Spawning Projectiles/src/C_ProjectileAttack.hpp | ThatGamesGuy/that_platform_game | 90c80ebb4e890b9e4684ec87841b4bf4e446a3d1 | [
"MIT"
] | 55 | 2018-06-19T08:22:47.000Z | 2022-03-30T01:02:59.000Z | 32 - Spawning Projectiles/src/C_ProjectileAttack.hpp | ThatGamesGuy/that_platform_game | 90c80ebb4e890b9e4684ec87841b4bf4e446a3d1 | [
"MIT"
] | null | null | null | 32 - Spawning Projectiles/src/C_ProjectileAttack.hpp | ThatGamesGuy/that_platform_game | 90c80ebb4e890b9e4684ec87841b4bf4e446a3d1 | [
"MIT"
] | 21 | 2019-04-19T15:39:08.000Z | 2022-02-20T11:21:13.000Z | #ifndef C_ProjectileAttack_hpp
#define C_ProjectileAttack_hpp
#include "Component.hpp"
#include "C_Animation.hpp"
#include "Input.hpp"
#include "ObjectCollection.hpp"
#include "WorkingDirectory.hpp"
class C_ProjectileAttack : public Component
{
public:
C_ProjectileAttack(Object* owner);
void Awake() over... | 25 | 79 | 0.742105 | ThatGamesGuy |
696126e293cc4b8ef990ec222c6fca82d0914430 | 1,241 | cpp | C++ | packages/utility/stats/src/Utility_SampleMomentCollection.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 10 | 2019-11-14T19:58:30.000Z | 2021-04-04T17:44:09.000Z | packages/utility/stats/src/Utility_SampleMomentCollection.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 43 | 2020-03-03T19:59:20.000Z | 2021-09-08T03:36:08.000Z | packages/utility/stats/src/Utility_SampleMomentCollection.cpp | bam241/FRENSIE | e1760cd792928699c84f2bdce70ff54228e88094 | [
"BSD-3-Clause"
] | 6 | 2020-02-12T17:37:07.000Z | 2020-09-08T18:59:51.000Z | //---------------------------------------------------------------------------//
//!
//! \file Utility_SampleMomentCollection.cpp
//! \author Alex Robinson
//! \brief The sample moment collection class definition
//!
//---------------------------------------------------------------------------//
// FRENSIE Includes
... | 44.321429 | 81 | 0.603546 | bam241 |
6963d1bb9788c97622a89edfdf28a71440a7195b | 1,268 | cc | C++ | cpp/sorting/insertion_sort.cc | stn/algorithms | 435c6b1bcdc042553c13a711d20f6d871988c251 | [
"Apache-2.0"
] | null | null | null | cpp/sorting/insertion_sort.cc | stn/algorithms | 435c6b1bcdc042553c13a711d20f6d871988c251 | [
"Apache-2.0"
] | null | null | null | cpp/sorting/insertion_sort.cc | stn/algorithms | 435c6b1bcdc042553c13a711d20f6d871988c251 | [
"Apache-2.0"
] | null | null | null | #include "insertion_sort.h"
void insertion_sort(int *arr, int n) {
for (int i = 1; i < n; ++i) {
for (int j = i; j > 0; --j) {
if (arr[j] < arr[j - 1]) {
int tmp = arr[j - 1];
arr[j - 1] = arr[j];
arr[j] = tmp;
}
}
}
}
voi... | 23.481481 | 80 | 0.391956 | stn |
69665ef375600e78e26e0cb11b8b112afb6df471 | 37,479 | cpp | C++ | experiments/aqfp.cpp | eletesta/mockturtle | 40e4e4cfc18ff2567ad7e89bfa22df99e06ad8fb | [
"MIT"
] | null | null | null | experiments/aqfp.cpp | eletesta/mockturtle | 40e4e4cfc18ff2567ad7e89bfa22df99e06ad8fb | [
"MIT"
] | null | null | null | experiments/aqfp.cpp | eletesta/mockturtle | 40e4e4cfc18ff2567ad7e89bfa22df99e06ad8fb | [
"MIT"
] | null | null | null | /* mockturtle: C++ logic network library
* Copyright (C) 2018-2019 EPFL
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights... | 36.002882 | 547 | 0.653112 | eletesta |
69667186065462c9306a5071a4ddc0aac6fb719b | 1,447 | cpp | C++ | sources/Dwarf/Declarations/PackageDeclaration.cpp | KonstantinTomashevich/dwarf-scripting-language | 1cb7e2719ee66c77172d647f33052358dfe36be3 | [
"MIT"
] | null | null | null | sources/Dwarf/Declarations/PackageDeclaration.cpp | KonstantinTomashevich/dwarf-scripting-language | 1cb7e2719ee66c77172d647f33052358dfe36be3 | [
"MIT"
] | null | null | null | sources/Dwarf/Declarations/PackageDeclaration.cpp | KonstantinTomashevich/dwarf-scripting-language | 1cb7e2719ee66c77172d647f33052358dfe36be3 | [
"MIT"
] | null | null | null | #include "PackageDeclaration.hpp"
#include <assert.h>
namespace Dwarf
{
PackageDeclaration::PackageDeclaration (std::string name, std::vector<Declaration *> declarationsInside) :
name_ (name),
declarationsInside_ (declarationsInside)
{
}
PackageDeclaration::~PackageDeclaration ()
{
if (!declarationsInsi... | 24.525424 | 106 | 0.67519 | KonstantinTomashevich |
696bc84d688fd35ea25b6456adca2b8d8b5a2073 | 4,894 | hpp | C++ | Native/Blackberry-Cascades/pushCollector/src/app.hpp | robertrumney/pushwoosh-sdk-samples | 55ccad683de8cec2f751ff1778045d04b9621c7e | [
"MIT"
] | 1 | 2022-02-08T14:01:20.000Z | 2022-02-08T14:01:20.000Z | Native/Blackberry-Cascades/pushCollector/src/app.hpp | robertrumney/pushwoosh-sdk-samples | 55ccad683de8cec2f751ff1778045d04b9621c7e | [
"MIT"
] | null | null | null | Native/Blackberry-Cascades/pushCollector/src/app.hpp | robertrumney/pushwoosh-sdk-samples | 55ccad683de8cec2f751ff1778045d04b9621c7e | [
"MIT"
] | null | null | null | /*!
* Copyright (c) 2012, 2013 BlackBerry Limited.
*
* 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 agr... | 33.751724 | 124 | 0.759297 | robertrumney |
696e00b7f954b87499a5b283968c390faf40164a | 19,133 | cpp | C++ | examples/guidedFilter_kinect_rgb.cpp | skn123/GuidedFilter | d701b41c46205e96587801a0382d6ce43fe51e94 | [
"MIT"
] | 29 | 2017-06-08T03:59:03.000Z | 2021-12-03T09:02:14.000Z | examples/guidedFilter_kinect_rgb.cpp | skn123/GuidedFilter | d701b41c46205e96587801a0382d6ce43fe51e94 | [
"MIT"
] | 2 | 2018-01-31T20:16:49.000Z | 2019-09-17T15:36:35.000Z | examples/guidedFilter_kinect_rgb.cpp | skn123/GuidedFilter | d701b41c46205e96587801a0382d6ce43fe51e94 | [
"MIT"
] | 11 | 2017-07-02T12:40:14.000Z | 2020-07-24T02:10:34.000Z | /*! \file guidedFilter_kinect_rgb.cpp
* \brief An example showcasing the effect of the `Guided Filter` algorithm on color images.
* \details This example demonstrates the performance of the [Guided Image Filtering]
* (http://research.microsoft.com/en-us/um/people/kahe/eccv10/)
* algorithm on ... | 32.650171 | 111 | 0.606596 | skn123 |
696fb7ad018d4e05ca177d3e382f8f0333793921 | 38,018 | cpp | C++ | mainwindow.cpp | mohawkjohn/bskQtViz | cf54077a82f9674273044a8305069056a3aaf0a0 | [
"0BSD"
] | null | null | null | mainwindow.cpp | mohawkjohn/bskQtViz | cf54077a82f9674273044a8305069056a3aaf0a0 | [
"0BSD"
] | null | null | null | mainwindow.cpp | mohawkjohn/bskQtViz | cf54077a82f9674273044a8305069056a3aaf0a0 | [
"0BSD"
] | null | null | null | /*
ISC License
Copyright (c) 2016-2017, Autonomous Vehicle Systems Lab, University of Colorado at Boulder
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copie... | 41.413943 | 192 | 0.690647 | mohawkjohn |
69727009d55ca59e3f3d27bf829c440bb003129e | 247 | cpp | C++ | VRP.FGA_2022/FirstIteration/Chromosome.cpp | DimaSidorenko/VRP.FGA_2022 | 3f08d9c976c9f86a25cdf51f287e3fc5b75c7451 | [
"MIT"
] | null | null | null | VRP.FGA_2022/FirstIteration/Chromosome.cpp | DimaSidorenko/VRP.FGA_2022 | 3f08d9c976c9f86a25cdf51f287e3fc5b75c7451 | [
"MIT"
] | null | null | null | VRP.FGA_2022/FirstIteration/Chromosome.cpp | DimaSidorenko/VRP.FGA_2022 | 3f08d9c976c9f86a25cdf51f287e3fc5b75c7451 | [
"MIT"
] | null | null | null | #include "Chromosome.h"
Chromosome::Chromosome() :
genes() {};
Chromosome::Chromosome(int32_t size)
{
genes.resize(size);
for (size_t i = 0; i < size; i++) {
genes[i] = Gene(size);
}
}
size_t Chromosome::Size()
{
return genes.size();
} | 13 | 36 | 0.62753 | DimaSidorenko |
6973333093d5a9b67e56918efc65ae4890baac11 | 3,416 | cpp | C++ | gdfast/src/functions.cpp | maartenbreddels/mab | 112dcfbc4a74b07aff13d489b3776bca58fe9bdf | [
"MIT"
] | 1 | 2018-12-01T04:10:34.000Z | 2018-12-01T04:10:34.000Z | gdfast/src/functions.cpp | maartenbreddels/mab | 112dcfbc4a74b07aff13d489b3776bca58fe9bdf | [
"MIT"
] | null | null | null | gdfast/src/functions.cpp | maartenbreddels/mab | 112dcfbc4a74b07aff13d489b3776bca58fe9bdf | [
"MIT"
] | null | null | null | #include "functions.hpp"
#include <boost/numeric/ublas/vector.hpp>
#include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/matrix_proxy.hpp>
namespace gd {
using namespace boost::numeric::ublas;
void py_export_functions() {
using namespace boost::python;
def("matmul_2d_3d", matmul_2d_3d);
def("mat... | 32.533333 | 212 | 0.60685 | maartenbreddels |
69755c97c66a733c90f12ed00a62408cd847e140 | 459 | cpp | C++ | Codechef/Monthly Long Off/aug/learn.cpp | TiwariAnil/Algorithmic_Puzzles | 13a6b2ed8e8fd0176b9b58c073b2e9847e7ba774 | [
"MIT"
] | null | null | null | Codechef/Monthly Long Off/aug/learn.cpp | TiwariAnil/Algorithmic_Puzzles | 13a6b2ed8e8fd0176b9b58c073b2e9847e7ba774 | [
"MIT"
] | null | null | null | Codechef/Monthly Long Off/aug/learn.cpp | TiwariAnil/Algorithmic_Puzzles | 13a6b2ed8e8fd0176b9b58c073b2e9847e7ba774 | [
"MIT"
] | null | null | null | #include <cstdio>
#include <algorithm>
using namespace std;
#define FOR(i, n) for (int i = 1; i <= n; ++i)
int main() {
int n, m, a, b, c;
int w[320][320];
long long s;
scanf("%d", &n);
FOR(i, n) FOR(j, n) scanf("%d", &w[i][j]);
scanf("%d", &m);
FOR(k, m) {
scanf("%d%d%d", &a, &b, &c);
s = 0;
FOR(i, n)... | 17.653846 | 103 | 0.457516 | TiwariAnil |
69773e46211d2b7a26e767416e7d3141f95437fd | 1,312 | hpp | C++ | include/callable_to_funcptr/callable_to_funcptr.hpp | ncorgan/cpp-callable-to-funcptr | fafc8bf4beba3f9398ba5e62a193b8636560a9c3 | [
"MIT"
] | 1 | 2019-09-13T08:25:03.000Z | 2019-09-13T08:25:03.000Z | include/callable_to_funcptr/callable_to_funcptr.hpp | ncorgan/cpp-callable-to-funcptr | fafc8bf4beba3f9398ba5e62a193b8636560a9c3 | [
"MIT"
] | null | null | null | include/callable_to_funcptr/callable_to_funcptr.hpp | ncorgan/cpp-callable-to-funcptr | fafc8bf4beba3f9398ba5e62a193b8636560a9c3 | [
"MIT"
] | null | null | null | /*
* Copyright (c) 2019 Nicholas Corgan (n.corgan@gmail.com)
*
* Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt
* or copy at http://opensource.org/licenses/MIT)
*/
#ifndef CALLABLE_TO_FUNCPTR_HPP
#define CALLABLE_TO_FUNCPTR_HPP
#include "detail/define_internal_macros.hpp"
#include "d... | 27.914894 | 106 | 0.765244 | ncorgan |
6981a6356647992695df325bb03489f783c4828d | 37,810 | cc | C++ | src/trace_processor/importers/proto/graphics_event_parser.cc | kuscsik/perfetto | 41874a94cbe332d4a253fe870af279cdd32bfab0 | [
"Apache-2.0"
] | null | null | null | src/trace_processor/importers/proto/graphics_event_parser.cc | kuscsik/perfetto | 41874a94cbe332d4a253fe870af279cdd32bfab0 | [
"Apache-2.0"
] | null | null | null | src/trace_processor/importers/proto/graphics_event_parser.cc | kuscsik/perfetto | 41874a94cbe332d4a253fe870af279cdd32bfab0 | [
"Apache-2.0"
] | null | null | null | /*
* Copyright (C) 2019 The Android Open Source Project
*
* 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 app... | 43.063781 | 107 | 0.687834 | kuscsik |
6981d94a4378de6858f672b08a598c7278f2b7d8 | 1,887 | cpp | C++ | ext/nuvo_image/src/SSIM.cpp | crema/nuvo_image | 7868601deca054dc1bd45507c8d01e640611d322 | [
"MIT"
] | null | null | null | ext/nuvo_image/src/SSIM.cpp | crema/nuvo_image | 7868601deca054dc1bd45507c8d01e640611d322 | [
"MIT"
] | 5 | 2016-08-02T13:33:02.000Z | 2020-11-03T15:22:52.000Z | ext/nuvo_image/src/SSIM.cpp | crema/nuvo-image | 365e4a54429fe4180e03adb1968ab9989e7ee5fb | [
"MIT"
] | null | null | null | #include "SSIM.h"
int QualitySSIM::InterpolationTargetSSIM(const QualitySSIM& min, const QualitySSIM& max, const double targetSSIM) {
auto slope = (max.quality - min.quality) / (max.ssim - min.ssim);
return (int)round(slope * (targetSSIM - min.ssim)) + min.quality;
}
SSIMData::SSIMData(const cv::Mat& mat) {
mat... | 28.164179 | 115 | 0.578166 | crema |
6982eb81b8671793a852a2d46155e8aaa3a3de45 | 2,716 | cpp | C++ | src/common/types/statistics.cpp | xhochy/duckdb | 20ba65f96794ab53f7a66e22d9bc58d59d8bc623 | [
"MIT"
] | null | null | null | src/common/types/statistics.cpp | xhochy/duckdb | 20ba65f96794ab53f7a66e22d9bc58d59d8bc623 | [
"MIT"
] | null | null | null | src/common/types/statistics.cpp | xhochy/duckdb | 20ba65f96794ab53f7a66e22d9bc58d59d8bc623 | [
"MIT"
] | 1 | 2019-09-06T09:58:14.000Z | 2019-09-06T09:58:14.000Z | #include "common/types/statistics.hpp"
#include "common/exception.hpp"
#include "common/limits.hpp"
#include "common/printer.hpp"
#include "common/types/vector.hpp"
#include "common/value_operations/value_operations.hpp"
#include "common/vector_operations/vector_operations.hpp"
using namespace duckdb;
using namespace... | 28.291667 | 105 | 0.726804 | xhochy |
6986813ff0789e8d9032fa6ecfba6411feee985c | 965 | cpp | C++ | 2017 JUST Programming Contest 4.0/B.cpp | lajiyuan/segmentation-fault-training | 71dfeeed52b18071a5c8c4d02f5e74fc01c53322 | [
"Apache-2.0"
] | 5 | 2019-04-07T05:39:11.000Z | 2020-07-23T01:43:02.000Z | 2017 JUST Programming Contest 4.0/B.cpp | lajiyuan/segmentation-fault-training | 71dfeeed52b18071a5c8c4d02f5e74fc01c53322 | [
"Apache-2.0"
] | null | null | null | 2017 JUST Programming Contest 4.0/B.cpp | lajiyuan/segmentation-fault-training | 71dfeeed52b18071a5c8c4d02f5e74fc01c53322 | [
"Apache-2.0"
] | null | null | null | #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1e5+10;
#define dbg(x) cout<<#x<<" = "<<x<<endl
#define ok cout<<"OK"<<endl
int a[maxn];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d%d",&n,&m);
fo... | 20.978261 | 49 | 0.344041 | lajiyuan |
698b5b2f8461d4565c4b7c9329ab4671aec59b3e | 944 | hpp | C++ | SDK/include/NDK/Widgets/BoxLayout.hpp | AntoineJT/NazaraEngine | e0b05a7e7a2779e20a593b4083b4a881cc57ce14 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | SDK/include/NDK/Widgets/BoxLayout.hpp | AntoineJT/NazaraEngine | e0b05a7e7a2779e20a593b4083b4a881cc57ce14 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | SDK/include/NDK/Widgets/BoxLayout.hpp | AntoineJT/NazaraEngine | e0b05a7e7a2779e20a593b4083b4a881cc57ce14 | [
"BSD-3-Clause-Clear",
"Apache-2.0",
"MIT"
] | null | null | null | // Copyright (C) 2017 Jérôme Leclercq
// This file is part of the "Nazara Development Kit"
// For conditions of distribution and use, see copyright notice in Prerequisites.hpp
#pragma once
#ifndef NDK_WIDGETS_BOXLAYOUT_HPP
#define NDK_WIDGETS_BOXLAYOUT_HPP
#include <NDK/Prerequisites.hpp>
#include <NDK/BaseWidget.hp... | 22.47619 | 84 | 0.745763 | AntoineJT |
698c5a84910801cc8b5f76fef3de78143080b527 | 1,004 | cpp | C++ | Cpp/229_majority_element_II/solution.cpp | zszyellow/leetcode | 2ef6be04c3008068f8116bf28d70586e613a48c2 | [
"MIT"
] | 1 | 2015-12-19T23:05:35.000Z | 2015-12-19T23:05:35.000Z | Cpp/229_majority_element_II/solution.cpp | zszyellow/leetcode | 2ef6be04c3008068f8116bf28d70586e613a48c2 | [
"MIT"
] | null | null | null | Cpp/229_majority_element_II/solution.cpp | zszyellow/leetcode | 2ef6be04c3008068f8116bf28d70586e613a48c2 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> majorityElement(vector<int>& nums) {
int len = nums.size(), num1, num2, count1 = 0, count2 = 0;
vector<int> res;
for (int i = 0; i < len; i ++)
{
if (num1 == nums[i]) count1 ++;
else if (num2 == nums[i]) count2 ++;
... | 25.1 | 66 | 0.351594 | zszyellow |
698d98ae147a4a384153896fe6aa3a1a7a3a4467 | 5,154 | cpp | C++ | Data Structures/Graphs/Boruvka_algorithm_for_finding_MST.cpp | siddhi-244/CompetitiveProgrammingQuestionBank | 4c265d41b82a7d4370c14d367f78effa9ed95d3c | [
"MIT"
] | 931 | 2020-04-18T11:57:30.000Z | 2022-03-31T15:15:39.000Z | Data Structures/Graphs/Boruvka_algorithm_for_finding_MST.cpp | siddhi-244/CompetitiveProgrammingQuestionBank | 4c265d41b82a7d4370c14d367f78effa9ed95d3c | [
"MIT"
] | 661 | 2020-12-13T04:31:48.000Z | 2022-03-15T19:11:54.000Z | Data Structures/Graphs/Boruvka_algorithm_for_finding_MST.cpp | siddhi-244/CompetitiveProgrammingQuestionBank | 4c265d41b82a7d4370c14d367f78effa9ed95d3c | [
"MIT"
] | 351 | 2020-08-10T06:49:21.000Z | 2022-03-25T04:02:12.000Z | /*
Boruvka’s Algorithm is a greedy algorithm used for finding Minimum Spanning Tree (MST) for
a connected, weighted, and undirected graph.
The goal of the algorithm is to connect “components” using the shortest or cheapest edge between
the components. It begins with all of the vertices considered as separate components... | 32.828025 | 144 | 0.504269 | siddhi-244 |
7e3453f96836fef78100e4b37d2e90bf05b4f6b5 | 1,202 | hpp | C++ | src/FileReader.hpp | TravisWheelerLab/ULTRA | a8f05424903b68cea630d7ef5102fb1b3cc9395c | [
"BSD-3-Clause"
] | 8 | 2019-10-06T14:46:29.000Z | 2022-03-27T14:09:50.000Z | src/FileReader.hpp | TravisWheelerLab/ULTRA | a8f05424903b68cea630d7ef5102fb1b3cc9395c | [
"BSD-3-Clause"
] | 6 | 2019-08-08T22:24:04.000Z | 2021-11-12T18:24:22.000Z | src/FileReader.hpp | TravisWheelerLab/ULTRA | a8f05424903b68cea630d7ef5102fb1b3cc9395c | [
"BSD-3-Clause"
] | 1 | 2019-11-28T00:47:59.000Z | 2019-11-28T00:47:59.000Z | //
// FileReader.hpp
// ultrax
//
// Created by Daniel Olson on 10/16/19.
// Copyright © 2019 Daniel Olson. All rights reserved.
//
#ifndef FileReader_hpp
#define FileReader_hpp
#include "FASTAReader.hpp"
#include "JSONReader.hpp"
#include <stdio.h>
typedef enum { UNKNOWN, FASTA, JSON } file_type;
class FileRea... | 22.259259 | 72 | 0.730449 | TravisWheelerLab |
7e36458397b0c141e4c22925d02cd9f818d67f96 | 460 | cpp | C++ | Pointers/second.cpp | dealbisac/cprograms | 89af58a30295099b45406cf192f4c4eb4a06f9fe | [
"Unlicense"
] | 4 | 2019-01-27T01:00:44.000Z | 2019-01-29T02:09:55.000Z | Pointers/second.cpp | dealbisac/cprograms | 89af58a30295099b45406cf192f4c4eb4a06f9fe | [
"Unlicense"
] | null | null | null | Pointers/second.cpp | dealbisac/cprograms | 89af58a30295099b45406cf192f4c4eb4a06f9fe | [
"Unlicense"
] | 1 | 2019-02-04T11:34:40.000Z | 2019-02-04T11:34:40.000Z | #include <stdio.h>
int main()
{
int* pc, c;
c = 22;
printf("Address of c: %u\n", &c);
printf("Value of c: %d\n\n", c);
pc = &c;
printf("Address of pointer pc: %u\n", pc);
printf("Content of pointer pc: %d\n\n", *pc);
c = 11;
printf("Address of pointer pc: %u\n", pc);
printf("Co... | 20 | 48 | 0.506522 | dealbisac |
7e3942e471817d240aeab7dfb612550a44ea6f42 | 1,300 | cpp | C++ | src/analysis/linpred/autocorr.cpp | dequis/in-formant | 129b9b399c75cdbd834b68f04dabcb1d406af250 | [
"Apache-2.0"
] | null | null | null | src/analysis/linpred/autocorr.cpp | dequis/in-formant | 129b9b399c75cdbd834b68f04dabcb1d406af250 | [
"Apache-2.0"
] | null | null | null | src/analysis/linpred/autocorr.cpp | dequis/in-formant | 129b9b399c75cdbd834b68f04dabcb1d406af250 | [
"Apache-2.0"
] | null | null | null | #include "linpred.h"
using namespace Analysis::LP;
std::vector<double> Autocorr::solve(const double *x, int length, int lpcOrder, double *pGain)
{
const int n = length;
const int m = lpcOrder;
double gain;
r.resize(m + 2, 0.0);
a.resize(m + 2, 0.0);
rc.resize(m + 1, 0.0);
int i = 1;... | 18.84058 | 93 | 0.348462 | dequis |
7e396efbcf5ec6137688f111ce93013d80bdd822 | 232 | cpp | C++ | tests/operations/flow_global/RegulatorAdj.cpp | amlalejini/signalgp-lite | f4ebe7580dc3610fca0a51d1ad743b0dbc21b6e9 | [
"MIT"
] | null | null | null | tests/operations/flow_global/RegulatorAdj.cpp | amlalejini/signalgp-lite | f4ebe7580dc3610fca0a51d1ad743b0dbc21b6e9 | [
"MIT"
] | null | null | null | tests/operations/flow_global/RegulatorAdj.cpp | amlalejini/signalgp-lite | f4ebe7580dc3610fca0a51d1ad743b0dbc21b6e9 | [
"MIT"
] | null | null | null | #define CATCH_CONFIG_MAIN
#include "Catch/single_include/catch2/catch.hpp"
#include "sgpl/operations/flow_global/RegulatorAdj.hpp"
TEST_CASE("Test RegulatorAdj") {
// TODO flesh out stub test
sgpl::global::RegulatorAdj{};
}
| 19.333333 | 55 | 0.762931 | amlalejini |
7e3d2df6ca477f2f89dca6b6487b8f6ba9d71e03 | 4,710 | cpp | C++ | src/simulation/architecture/asio/visMessageInterface/boost_communication.cpp | ian-cooke/basilisk_mag | a8b1e37c31c1287549d6fd4d71fcaa35b6fc3f14 | [
"0BSD"
] | null | null | null | src/simulation/architecture/asio/visMessageInterface/boost_communication.cpp | ian-cooke/basilisk_mag | a8b1e37c31c1287549d6fd4d71fcaa35b6fc3f14 | [
"0BSD"
] | 1 | 2019-03-13T20:52:22.000Z | 2019-03-13T20:52:22.000Z | src/simulation/architecture/asio/visMessageInterface/boost_communication.cpp | ian-cooke/basilisk_mag | a8b1e37c31c1287549d6fd4d71fcaa35b6fc3f14 | [
"0BSD"
] | null | null | null | /*
ISC License
Copyright (c) 2016, Autonomous Vehicle Systems Lab, University of Colorado at Boulder
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
... | 27.869822 | 96 | 0.616561 | ian-cooke |
7e3fcda429c2b500a22fb361bfcdbd774bc2878c | 2,152 | cxx | C++ | STEER/STEER/AliMatrixSq.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 52 | 2016-12-11T13:04:01.000Z | 2022-03-11T11:49:35.000Z | STEER/STEER/AliMatrixSq.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 1,388 | 2016-11-01T10:27:36.000Z | 2022-03-30T15:26:09.000Z | STEER/STEER/AliMatrixSq.cxx | AllaMaevskaya/AliRoot | c53712645bf1c7d5f565b0d3228e3a6b9b09011a | [
"BSD-3-Clause"
] | 275 | 2016-06-21T20:24:05.000Z | 2022-03-31T13:06:19.000Z | /**********************************************************************************************/
/* */
/* Abstract class for matrix used for */
/* millepede2 operation. ... | 36.474576 | 110 | 0.416822 | AllaMaevskaya |
7e40272a65b220d2f28ce34196ff3a7edd152cd9 | 84 | hpp | C++ | traits/sqrtconstexpr.hpp | colorhistory/cplusplus-general-programming | 3ece924a2ab34711a55a45bc41e2b74384956204 | [
"MIT"
] | 1 | 2019-09-28T09:40:08.000Z | 2019-09-28T09:40:08.000Z | traits/sqrtconstexpr.hpp | colorhistory/cplusplus-general-programming | 3ece924a2ab34711a55a45bc41e2b74384956204 | [
"MIT"
] | null | null | null | traits/sqrtconstexpr.hpp | colorhistory/cplusplus-general-programming | 3ece924a2ab34711a55a45bc41e2b74384956204 | [
"MIT"
] | null | null | null | #ifndef SQRTCONSTEXPR_HPP
#define SQRTCONSTEXPR_HPP
#endif // SQRTCONSTEXPR_HPP
| 12 | 27 | 0.809524 | colorhistory |
7e449e6721530dfa8add56ead774ea0bc2368cb7 | 709 | hpp | C++ | core/es/system/string/internal/Cpp11StringConverter.hpp | eaglesakura/protoground | 2cd7eaf93eaab9a34619b7ded91d3a2b89e9d5d6 | [
"MIT"
] | null | null | null | core/es/system/string/internal/Cpp11StringConverter.hpp | eaglesakura/protoground | 2cd7eaf93eaab9a34619b7ded91d3a2b89e9d5d6 | [
"MIT"
] | 1 | 2016-10-25T02:09:00.000Z | 2016-11-10T02:07:59.000Z | core/es/system/string/internal/Cpp11StringConverter.hpp | eaglesakura/protoground | 2cd7eaf93eaab9a34619b7ded91d3a2b89e9d5d6 | [
"MIT"
] | null | null | null | #pragma once
#include "es/system/string/IStringConverter.h"
#if defined(BUILD_MacOSX)
#include <codecvt>
#include <locale>
namespace es {
namespace internal {
class Cpp11StringConverter : public IStringConverter {
public:
Cpp11StringConverter() = default;
virtual ~Cpp11StringConverter() = default;
/... | 18.179487 | 83 | 0.70945 | eaglesakura |
7e47159978a9d855cd0a1073c96d95261b08f5d0 | 4,830 | cpp | C++ | software/src/unball/strategy/strategy_node.cpp | unball/ieee-very-small | 972758e03be24c5d7c9276e269e3f145e68c8dd1 | [
"MIT"
] | 5 | 2015-04-05T01:25:45.000Z | 2021-07-22T20:08:05.000Z | software/src/unball/strategy/strategy_node.cpp | unball/ieee-very-small | 972758e03be24c5d7c9276e269e3f145e68c8dd1 | [
"MIT"
] | 50 | 2015-02-27T13:21:05.000Z | 2016-01-11T01:03:42.000Z | software/src/unball/strategy/strategy_node.cpp | unball/ieee-very-small | 972758e03be24c5d7c9276e269e3f145e68c8dd1 | [
"MIT"
] | 4 | 2015-10-26T21:11:21.000Z | 2016-08-29T02:43:35.000Z | /**
* @file strategy_node.cpp
* @author Matheus Vieira Portela
* @date 21/03/2014
*
* @attention Copyright (C) 2014 UnBall Robot Soccer Team
*
* @brief Run strategy for robots
*
* This node subscribes to the vision topic, applies strategy to decide robots linear and angular velocities, and
* publishes t... | 33.082192 | 120 | 0.662112 | unball |
7e474d87bc3a52224ba71480f276ad923a2f697e | 7,686 | hxx | C++ | main/sw/inc/anchoreddrawobject.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 679 | 2015-01-06T06:34:58.000Z | 2022-03-30T01:06:03.000Z | main/sw/inc/anchoreddrawobject.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 102 | 2017-11-07T08:51:31.000Z | 2022-03-17T12:13:49.000Z | main/sw/inc/anchoreddrawobject.hxx | Grosskopf/openoffice | 93df6e8a695d5e3eac16f3ad5e9ade1b963ab8d7 | [
"Apache-2.0"
] | 331 | 2015-01-06T11:40:55.000Z | 2022-03-14T04:07:51.000Z | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... | 34.936364 | 84 | 0.60981 | Grosskopf |
7e4cf839ec626c68ac4dcd037d21183a2e16d7b1 | 573 | cpp | C++ | toy_compiler/munster/ast/stmt/compound_stmt.cpp | Wmbat/toy_compiler | 370a2e76aaaa874de5fb6c25e0755638dd84b8b4 | [
"MIT"
] | null | null | null | toy_compiler/munster/ast/stmt/compound_stmt.cpp | Wmbat/toy_compiler | 370a2e76aaaa874de5fb6c25e0755638dd84b8b4 | [
"MIT"
] | null | null | null | toy_compiler/munster/ast/stmt/compound_stmt.cpp | Wmbat/toy_compiler | 370a2e76aaaa874de5fb6c25e0755638dd84b8b4 | [
"MIT"
] | null | null | null | #include <toy_compiler/munster/ast/stmt/compound_stmt.hpp>
#include <toy_compiler/munster/ast/utility.hpp>
namespace munster::ast
{
compound_stmt::compound_stmt(std::vector<node_ptr>&& statements)
{
make_family<stmt>(std::move(statements));
}
void compound_stmt::accept(visitor_variant& visitor) con... | 23.875 | 83 | 0.670157 | Wmbat |
7e5a18f46883b774602c845cb7b711df0457a7d7 | 42,777 | hpp | C++ | src/ScaFES_Grid.hpp | nih23/MRIDrivenHeatSimulation | de6d16853df1faf44c700d1fc06584351bf6c816 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | src/ScaFES_Grid.hpp | nih23/MRIDrivenHeatSimulation | de6d16853df1faf44c700d1fc06584351bf6c816 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | src/ScaFES_Grid.hpp | nih23/MRIDrivenHeatSimulation | de6d16853df1faf44c700d1fc06584351bf6c816 | [
"BSL-1.0",
"BSD-3-Clause"
] | null | null | null | /* ScaFES
* Copyright (c) 2011-2015, ZIH, TU Dresden, Federal Republic of Germany.
* For details, see the files COPYING and LICENSE in the base directory
* of the package.
*/
/**
* @file ScaFES_Grid.hpp
* @brief Contains the class template Grid.
*/
#ifndef SCAFES_GRID_HPP_
#define SCAFES_GRID_HPP_
#include ... | 36.718455 | 81 | 0.510648 | nih23 |
7e5a72a3d6d86de773f989ec2c12c786b26f414e | 5,312 | cc | C++ | src/la/mat_dec.cc | obs145628/ai-cpp | 32ff9365e0d3a36d219352ee6e3a01e62c633cc9 | [
"MIT"
] | null | null | null | src/la/mat_dec.cc | obs145628/ai-cpp | 32ff9365e0d3a36d219352ee6e3a01e62c633cc9 | [
"MIT"
] | null | null | null | src/la/mat_dec.cc | obs145628/ai-cpp | 32ff9365e0d3a36d219352ee6e3a01e62c633cc9 | [
"MIT"
] | null | null | null | #include "la/mat_dec.hh"
#include "la/functions.hh"
Vector solve_lower(const Matrix& m, const Vector& b)
{
assert(m.rows() == m.cols());
assert(m.rows() == b.size());
std::size_t n = m.rows();
Vector x(n);
for (std::size_t k = 0; k < n; ++k)
{
num_t val = b[k];
for... | 24.479263 | 82 | 0.445971 | obs145628 |
7e5d1dedcd0ae12c2a1c8a9eacf5e0ecd79c8ded | 5,998 | cpp | C++ | Source/Common/Platform/NMR_ExportStream_GCC_Win32.cpp | geaz/lib3mf | fd07e571a869f5c495a3beea014d341d67c9d405 | [
"BSD-2-Clause"
] | null | null | null | Source/Common/Platform/NMR_ExportStream_GCC_Win32.cpp | geaz/lib3mf | fd07e571a869f5c495a3beea014d341d67c9d405 | [
"BSD-2-Clause"
] | null | null | null | Source/Common/Platform/NMR_ExportStream_GCC_Win32.cpp | geaz/lib3mf | fd07e571a869f5c495a3beea014d341d67c9d405 | [
"BSD-2-Clause"
] | null | null | null | /*++
Copyright (C) 2019 3MF Consortium
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the followi... | 32.247312 | 109 | 0.702568 | geaz |
7e5f898ee06344f571798d3c6d9564a146bd2e6e | 10,645 | hpp | C++ | map.hpp | majermou/ft_containers | b46a6941689819a74bb86cc2bd1b85fd7252ace7 | [
"MIT"
] | null | null | null | map.hpp | majermou/ft_containers | b46a6941689819a74bb86cc2bd1b85fd7252ace7 | [
"MIT"
] | null | null | null | map.hpp | majermou/ft_containers | b46a6941689819a74bb86cc2bd1b85fd7252ace7 | [
"MIT"
] | null | null | null | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* map.hpp :+: :+: :+: ... | 32.063253 | 98 | 0.584688 | majermou |
7e603cf8afddda3aae365332949d97c11f9264a2 | 1,866 | cpp | C++ | training/GCJ/2017/QR-A.cpp | voleking/ICPC | fc2cf408fa2607ad29b01eb00a1a212e6d0860a5 | [
"MIT"
] | 68 | 2017-10-08T04:44:23.000Z | 2019-08-06T20:15:02.000Z | training/GCJ/2017/QR-A.cpp | voleking/ICPC | fc2cf408fa2607ad29b01eb00a1a212e6d0860a5 | [
"MIT"
] | null | null | null | training/GCJ/2017/QR-A.cpp | voleking/ICPC | fc2cf408fa2607ad29b01eb00a1a212e6d0860a5 | [
"MIT"
] | 18 | 2017-05-31T02:52:23.000Z | 2019-07-05T09:18:34.000Z | // written at 16:53 on 8 Apr 2017
#include <bits/stdc++.h>
#define IOS std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr);
// #define __DEBUG__
#ifdef __DEBUG__
#define DEBUG(...) printf(__VA_ARGS__)
#else
#define DEBUG(...)
#endif
#define filename "A-large"
#define setfile() freop... | 24.88 | 122 | 0.489282 | voleking |
7e63c8f5b6f87a61e6895cabbfb49dbf1c0053e8 | 1,605 | cpp | C++ | Libraries/RobsJuceModules/rosic/modulators/rosic_DecayEnvelope.cpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 34 | 2017-04-19T18:26:02.000Z | 2022-02-15T17:47:26.000Z | Libraries/RobsJuceModules/rosic/modulators/rosic_DecayEnvelope.cpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 307 | 2017-05-04T21:45:01.000Z | 2022-02-03T00:59:01.000Z | Libraries/RobsJuceModules/rosic/modulators/rosic_DecayEnvelope.cpp | RobinSchmidt/RS-MET-Preliminary | 6c01cbaad7cce3daa3293c444dd9e4b74e5ebfbe | [
"FTL"
] | 4 | 2017-09-05T17:04:31.000Z | 2021-12-15T21:24:28.000Z | //#include "rosic_DecayEnvelope.h"
//using namespace rosic;
//-------------------------------------------------------------------------------------------------
// construction/destruction:
DecayEnvelope::DecayEnvelope()
{
c = 1.0;
y = 1.0;
yInit = 1.0;
tau = 200.0; ... | 20.576923 | 99 | 0.478505 | RobinSchmidt |
7e6595418fc17ae2f1b95b61f9e2afe099948280 | 5,683 | cpp | C++ | src/dialogs/options_dialog.cpp | johannphilippe/Tracker4 | e2eb6700bb8827dc8181aba889a78760f21a98f8 | [
"MIT"
] | null | null | null | src/dialogs/options_dialog.cpp | johannphilippe/Tracker4 | e2eb6700bb8827dc8181aba889a78760f21a98f8 | [
"MIT"
] | 1 | 2021-12-28T10:47:47.000Z | 2021-12-28T18:54:46.000Z | src/dialogs/options_dialog.cpp | johannphilippe/Tracker4 | e2eb6700bb8827dc8181aba889a78760f21a98f8 | [
"MIT"
] | null | null | null | #include<dialogs/options_dialog.h>
auto option_item::make_view()
{
auto tog_enable = plain_toggle_icon_button( icons::cancel, icons::ok, 1.0);
tog_enable.value(enabled);
tog_enable.on_click = [&](bool b)
{
enabled = b;
};
auto tb = input_box("Write a Csound option");
tb.second->set... | 28.557789 | 109 | 0.56801 | johannphilippe |
7e67c467e00420adcfb2b3de598b24025f715d71 | 6,863 | cpp | C++ | addons/ofxGuido/lib/guidolib-code/src/lib/GUIDOEngineJava.cpp | k4rm/AscoGraph | 9038ae785b6f4f144a3ab5c4c5520761c0cd08f2 | [
"MIT"
] | 18 | 2015-01-18T22:34:22.000Z | 2020-09-06T20:30:30.000Z | addons/ofxGuido/lib/guidolib-code/src/lib/GUIDOEngineJava.cpp | k4rm/AscoGraph | 9038ae785b6f4f144a3ab5c4c5520761c0cd08f2 | [
"MIT"
] | 2 | 2015-08-04T00:07:46.000Z | 2017-05-10T15:53:51.000Z | addons/ofxGuido/lib/guidolib-code/src/lib/GUIDOEngineJava.cpp | k4rm/AscoGraph | 9038ae785b6f4f144a3ab5c4c5520761c0cd08f2 | [
"MIT"
] | 10 | 2015-01-18T23:46:10.000Z | 2019-08-25T12:10:04.000Z |
// Following code was previously in GUIDOEngine.cpp
#ifdef JAVADLL
#include "creategif.h"
#include <jni.h>
JNIEXPORT jint JNICALL Java_NotationRenderer_parse__Ljava_lang_String_2
(JNIEnv *env,
jclass obj,
jstring filename)
{
const char * str = env->GetStringUTFChars(filename,0);
int i = GuidoParse2(st... | 20.1261 | 76 | 0.668367 | k4rm |
7e6913bf00ad1968b5095d0623ba0f228991ba57 | 5,426 | cpp | C++ | imp_bridge_ros/src/ros_bridge.cpp | rockenbf/ze_oss | ee04158e2d51acb07a267196f618e9afbc3ffd83 | [
"BSD-3-Clause"
] | 30 | 2016-09-27T07:41:28.000Z | 2021-12-03T20:44:28.000Z | imp_bridge_ros/src/ros_bridge.cpp | rockenbf/ze_oss | ee04158e2d51acb07a267196f618e9afbc3ffd83 | [
"BSD-3-Clause"
] | 1 | 2018-12-18T15:53:06.000Z | 2018-12-21T03:10:06.000Z | imp_bridge_ros/src/ros_bridge.cpp | rockenbf/ze_oss | ee04158e2d51acb07a267196f618e9afbc3ffd83 | [
"BSD-3-Clause"
] | 12 | 2016-11-05T07:51:29.000Z | 2020-07-13T02:26:08.000Z | // Copyright (c) 2015-2016, ETH Zurich, Wyss Zurich, Zurich Eye
// 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
// ... | 33.085366 | 97 | 0.661629 | rockenbf |
7e69362c87c64e6c8089a62c817bdaf0067ced2c | 2,489 | cpp | C++ | Source/Samples/99_Benchmark/Benchmark03_MoleculeLogic.cpp | pat2nav/Urho3D | cc0346f39bd365782d825e2e337a1f33bb225308 | [
"MIT"
] | null | null | null | Source/Samples/99_Benchmark/Benchmark03_MoleculeLogic.cpp | pat2nav/Urho3D | cc0346f39bd365782d825e2e337a1f33bb225308 | [
"MIT"
] | null | null | null | Source/Samples/99_Benchmark/Benchmark03_MoleculeLogic.cpp | pat2nav/Urho3D | cc0346f39bd365782d825e2e337a1f33bb225308 | [
"MIT"
] | null | null | null | // Copyright (c) 2008-2022 the Urho3D project
// License: MIT
#include "Benchmark03_MoleculeLogic.h"
#include <Urho3D/Scene/Scene.h>
#include <Urho3D/DebugNew.h>
using namespace Urho3D;
Benchmark03_MoleculeLogic::Benchmark03_MoleculeLogic(Context* context)
: LogicComponent(context)
, moleculeType_(0)
{
... | 29.630952 | 116 | 0.688228 | pat2nav |
7e69c58fe619dda520c796e42f83119eae54948b | 1,409 | cpp | C++ | safe_drive/src/safe_drive_node.cpp | RafalStaszak/autonomous-real | e45214ed323d9627de2c5f1f4188e330d65dd202 | [
"MIT"
] | null | null | null | safe_drive/src/safe_drive_node.cpp | RafalStaszak/autonomous-real | e45214ed323d9627de2c5f1f4188e330d65dd202 | [
"MIT"
] | null | null | null | safe_drive/src/safe_drive_node.cpp | RafalStaszak/autonomous-real | e45214ed323d9627de2c5f1f4188e330d65dd202 | [
"MIT"
] | 1 | 2018-06-05T18:08:29.000Z | 2018-06-05T18:08:29.000Z | #include <ros/ros.h>
#include <geometry_msgs/Twist.h>
class Safety
{
public:
Safety();
private:
void Callback(const geometry_msgs::Twist::ConstPtr& move);
ros::NodeHandle n;
ros::Publisher stop_pub;
ros::Subscriber twist_sub;
ros::Time current_time, last_time;
float czas;
};
Safety::Sa... | 24.719298 | 133 | 0.660043 | RafalStaszak |
7e69f826c471f129bcffa9d0d121ec25b7803a03 | 22,550 | cpp | C++ | zinew/extremephysics-2-2/extremephysics-2-2/c++/ExtremePhysics 2.2 DLL/gm_shape.cpp | Bitl/Game-Maker-Projects | 99f3eabcae8ef624f39f11715ebba327631dd78c | [
"MIT"
] | null | null | null | zinew/extremephysics-2-2/extremephysics-2-2/c++/ExtremePhysics 2.2 DLL/gm_shape.cpp | Bitl/Game-Maker-Projects | 99f3eabcae8ef624f39f11715ebba327631dd78c | [
"MIT"
] | null | null | null | zinew/extremephysics-2-2/extremephysics-2-2/c++/ExtremePhysics 2.2 DLL/gm_shape.cpp | Bitl/Game-Maker-Projects | 99f3eabcae8ef624f39f11715ebba327631dd78c | [
"MIT"
] | null | null | null | /*
* Copyright 2009-2011 Maarten Baert
* maarten-baert@hotmail.com
* http://www.maartenbaert.be/
*
* This file is part of ExtremePhysics.
*
* ExtremePhysics 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 Softwar... | 46.303901 | 191 | 0.732639 | Bitl |
7e6b737f169213de47acc271c58179e41354516f | 1,806 | cpp | C++ | Homework/Homework 2/Code/Updated Version/hw02Professor.cpp | MorganBergen/Learning-CPP | a8d8ed92a6e4cb6c96d091d6c7e1ef551968932b | [
"Unlicense"
] | null | null | null | Homework/Homework 2/Code/Updated Version/hw02Professor.cpp | MorganBergen/Learning-CPP | a8d8ed92a6e4cb6c96d091d6c7e1ef551968932b | [
"Unlicense"
] | null | null | null | Homework/Homework 2/Code/Updated Version/hw02Professor.cpp | MorganBergen/Learning-CPP | a8d8ed92a6e4cb6c96d091d6c7e1ef551968932b | [
"Unlicense"
] | null | null | null | #include <iostream>
#include <random>
int main(){
const int PAPER = 1;
const int SCISSOR = 2;
const int ROCK = 3;
std::random_devie rd;
std::mt19937 prng(rd());
std::uniform_int_distribution<int> pcOption(1, 3);
int playerChoice;
... | 26.558824 | 65 | 0.40144 | MorganBergen |
7e6c8ed8e094bb61ec48fc9783e786a6d6674b49 | 1,620 | cpp | C++ | 85_traversals.cpp | swapmali/Must-Do-Coding-Questions-For-Companies-GFG | b68340c150f572c0fad7311af87f79b684060fb9 | [
"MIT"
] | 1 | 2021-02-07T19:50:36.000Z | 2021-02-07T19:50:36.000Z | 85_traversals.cpp | swapmali/Must-Do-Coding-Questions-For-Companies-GFG | b68340c150f572c0fad7311af87f79b684060fb9 | [
"MIT"
] | null | null | null | 85_traversals.cpp | swapmali/Must-Do-Coding-Questions-For-Companies-GFG | b68340c150f572c0fad7311af87f79b684060fb9 | [
"MIT"
] | 1 | 2021-05-06T15:30:47.000Z | 2021-05-06T15:30:47.000Z | // https://practice.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node *left, *right;
Node(int new_data)
{
data = new_data;
left = right = NULL;
}
};
void print_inorder(struct Node *root)
{
if (root == NULL)
retu... | 17.052632 | 88 | 0.603704 | swapmali |
7e6fc41ce5a29f91f9dbed457bc49f66d346d4b9 | 635 | hpp | C++ | requester/test/mock_request.hpp | amboar/pldm | d0405c3555427c03b231c8d52958f8689b3fa114 | [
"Apache-2.0"
] | null | null | null | requester/test/mock_request.hpp | amboar/pldm | d0405c3555427c03b231c8d52958f8689b3fa114 | [
"Apache-2.0"
] | null | null | null | requester/test/mock_request.hpp | amboar/pldm | d0405c3555427c03b231c8d52958f8689b3fa114 | [
"Apache-2.0"
] | null | null | null | #pragma once
#include "requester/request.hpp"
#include <gmock/gmock.h>
#include <gtest/gtest.h>
namespace pldm
{
namespace requester
{
class MockRequest : public RequestRetryTimer
{
public:
MockRequest(int /*fd*/, mctp_eid_t /*eid*/, sdeventplus::Event& event,
pldm::Request&& /*requestMsg*/, ... | 21.166667 | 74 | 0.651969 | amboar |
7e73cf8dc991dd09a15f4e679121438ec0cb76aa | 33,335 | cpp | C++ | TAO/CIAO/tests/CIF/Receptacle/client.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 36 | 2015-01-10T07:27:33.000Z | 2022-03-07T03:32:08.000Z | TAO/CIAO/tests/CIF/Receptacle/client.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 2 | 2018-08-13T07:30:51.000Z | 2019-02-25T03:04:31.000Z | TAO/CIAO/tests/CIF/Receptacle/client.cpp | cflowe/ACE | 5ff60b41adbe1772372d1a43bcc1f2726ff8f810 | [
"DOC"
] | 38 | 2015-01-08T14:12:06.000Z | 2022-01-19T08:33:00.000Z | // $Id: client.cpp 93359 2011-02-11 11:33:12Z mcorino $
#include "Common/CIF_Common.h"
#include <vector>
//============================================================
// connect
//============================================================
::Components::Cookie *
connect (::Components::Receptacles_ptr rec,
... | 32.713445 | 89 | 0.508325 | cflowe |
7e752c5be62ec32fe6f9b85f1f7e1f8a6add85fb | 1,730 | cpp | C++ | 1199 Round #576 (Div.2)/F - Rectangle Painting 1.cpp | Jatin-Nagpal/CF-Complete | 2381ab746982676db3610d66ab33d4177f2d555f | [
"MIT"
] | 1 | 2019-08-17T05:35:30.000Z | 2019-08-17T05:35:30.000Z | 1199 Round #576 (Div.2)/F - Rectangle Painting 1.cpp | Jatin-Nagpal/CF-Complete | 2381ab746982676db3610d66ab33d4177f2d555f | [
"MIT"
] | null | null | null | 1199 Round #576 (Div.2)/F - Rectangle Painting 1.cpp | Jatin-Nagpal/CF-Complete | 2381ab746982676db3610d66ab33d4177f2d555f | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
#define MP make_pair
#define PB push_back
// #define ll long long
#define int long long
#define f(i,x,n) for(int i=x;i<n;i++)
#define ld long double
#define mod 1000000007
int a[51][51];
string s[51];
int n,ans;
int dp[51][51][51][51];
int... | 20.116279 | 77 | 0.573988 | Jatin-Nagpal |
7e7791ace9851d83f2066fe1ffb8462b8af17cb0 | 1,599 | hpp | C++ | src/include/cpp_playground/delayed_call.hpp | rxcompile/cpp_playground | 63cd54f18e15415f779d9a6d08c5dac8ba33e3be | [
"MIT"
] | null | null | null | src/include/cpp_playground/delayed_call.hpp | rxcompile/cpp_playground | 63cd54f18e15415f779d9a6d08c5dac8ba33e3be | [
"MIT"
] | null | null | null | src/include/cpp_playground/delayed_call.hpp | rxcompile/cpp_playground | 63cd54f18e15415f779d9a6d08c5dac8ba33e3be | [
"MIT"
] | null | null | null | #pragma once
#include "cpp_playground/python_container.hpp"
#include "cpp_playground/function_traits.hpp"
#include <vector>
#include <functional>
namespace CppTest
{
template <typename TRet, typename... TArgs>
class DelayedCall
{
public:
DelayedCall(std::function<TRet(TArgs...)> fn, Container &data)
: ... | 24.984375 | 118 | 0.627892 | rxcompile |
7e7bf634c4566a32456aefbb6d5e6ac06ea721cf | 683 | cpp | C++ | mainwindow.cpp | stweise/rico-cluster-qt | 7b712319de1b8feb53172b089867038c977c96d5 | [
"BSD-3-Clause"
] | 1 | 2020-07-12T19:33:25.000Z | 2020-07-12T19:33:25.000Z | mainwindow.cpp | stweise/rico-qt | 7b712319de1b8feb53172b089867038c977c96d5 | [
"BSD-3-Clause"
] | 1 | 2020-11-19T15:56:23.000Z | 2020-11-29T08:54:29.000Z | mainwindow.cpp | stweise/rico-qt | 7b712319de1b8feb53172b089867038c977c96d5 | [
"BSD-3-Clause"
] | null | null | null | // SPDX-License-Identifier: BSD-3-Clause
#include "mainwindow.h"
#include "./ui_mainwindow.h"
#include "graphicsscene.h"
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent), ui(new Ui::MainWindow) {
ui->setupUi(this);
scene = new GraphicsScene(this);
ui->graphicsView->setScene(scene);
}
MainWindo... | 27.32 | 70 | 0.727672 | stweise |
7e7c2a02776b994cb11e1ce65f4f15343f1cbfe1 | 35,191 | cpp | C++ | src/VAC/View3D.cpp | CELLINKAB/vpaint | 83f66645407a1467a450bd42bc3d62038bf7d11a | [
"ECL-2.0",
"Apache-2.0"
] | 1 | 2021-09-10T15:10:30.000Z | 2021-09-10T15:10:30.000Z | src/VAC/View3D.cpp | CELLINKAB/vpaint | 83f66645407a1467a450bd42bc3d62038bf7d11a | [
"ECL-2.0",
"Apache-2.0"
] | 1 | 2021-11-24T11:21:05.000Z | 2021-11-24T11:21:05.000Z | src/VAC/View3D.cpp | CELLINKAB/vpaint | 83f66645407a1467a450bd42bc3d62038bf7d11a | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | // Copyright (C) 2012-2019 The VPaint Developers.
// See the COPYRIGHT file at the top-level directory of this distribution
// and at https://github.com/dalboris/vpaint/blob/master/COPYRIGHT
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the ... | 32.554117 | 124 | 0.600466 | CELLINKAB |
7e7c5dddb92ae7751e8674adbc992a91043ad3ab | 2,905 | cc | C++ | test/persist_alloc_read.cc | moksha11/nvmalloc | 7ea255d09b1aed3acab8344be6904464aab8ba11 | [
"BSD-3-Clause"
] | 2 | 2015-06-11T17:50:53.000Z | 2015-07-04T08:24:50.000Z | test/persist_alloc_read.cc | moksha11/nvmalloc | 7ea255d09b1aed3acab8344be6904464aab8ba11 | [
"BSD-3-Clause"
] | null | null | null | test/persist_alloc_read.cc | moksha11/nvmalloc | 7ea255d09b1aed3acab8344be6904464aab8ba11 | [
"BSD-3-Clause"
] | null | null | null |
/*
* malloc-test
* cel - Thu Jan 7 15:49:16 EST 1999
*
* Benchmark libc's malloc, and check how well it
* can handle malloc requests from multiple threads.
*
* Syntax:
* malloc-test [ size [ iterations [ thread count ]]]
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unis... | 20.75 | 71 | 0.655422 | moksha11 |
7e7ca42618375ea4b409f9c82e40da4ee16a6116 | 14,659 | cpp | C++ | Libraries/AssetProcessor/ExAPImportTIFF.cpp | tom-weatherhead/exeter-asset-processor | e19c777427afe66684f308cb7b07448b3481c25e | [
"MIT"
] | null | null | null | Libraries/AssetProcessor/ExAPImportTIFF.cpp | tom-weatherhead/exeter-asset-processor | e19c777427afe66684f308cb7b07448b3481c25e | [
"MIT"
] | null | null | null | Libraries/AssetProcessor/ExAPImportTIFF.cpp | tom-weatherhead/exeter-asset-processor | e19c777427afe66684f308cb7b07448b3481c25e | [
"MIT"
] | null | null | null | /*
* ExAPImportTIFF.cpp
* Exeter AssetProcessor
*
* Created by Tom Weatherhead on Mon Jun 30 2003.
* Copyright (c) 2003 by Tom Weatherhead. All rights reserved.
*
*/
#ifdef _MSC_VER // TAW 2002/03/11 : ie. if MSVC
#ifndef MACINTOSH // TAW 2002/02/23 : ie. if MSVC
// Suppress warning C4786: I... | 28.408915 | 130 | 0.682925 | tom-weatherhead |
7e7edbfb94cbfde933bbb33f93444919b6348b2f | 7,814 | hpp | C++ | src/ibeo_8l_sdk/src/ibeosdk/datablocks/snippets/ObjectEcu.hpp | tomcamp0228/ibeo_ros2 | ff56c88d6e82440ae3ce4de08f2745707c354604 | [
"MIT"
] | 1 | 2020-06-19T11:01:49.000Z | 2020-06-19T11:01:49.000Z | include/ibeosdk/datablocks/snippets/ObjectEcu.hpp | chouer19/enjoyDriving | e4a29e6cad7d3b0061d59f584cce7cdea2a55351 | [
"MIT"
] | null | null | null | include/ibeosdk/datablocks/snippets/ObjectEcu.hpp | chouer19/enjoyDriving | e4a29e6cad7d3b0061d59f584cce7cdea2a55351 | [
"MIT"
] | 2 | 2020-06-19T11:01:48.000Z | 2020-10-29T03:07:14.000Z | //======================================================================
/*! \file ObjectEcu.hpp
*
* \copydoc Copyright
* \author Mario Brumm (mb)
* \date Apr 26, 2012
*///-------------------------------------------------------------------
#ifndef IBEOSDK_OBJECTECU_HPP_SEEN
#define IBEOSDK_OBJECTECU_HPP_SEEN
//=... | 41.343915 | 139 | 0.743665 | tomcamp0228 |
7e82f92af4c0ce09f7aed81137ebb8c1029cb47f | 11,944 | cpp | C++ | golg__resources.cpp | poikilos/golgotha | d3184dea6b061f853423e0666dba23218042e5ba | [
"CC0-1.0"
] | 5 | 2015-12-09T20:37:49.000Z | 2021-08-10T08:06:29.000Z | golg__resources.cpp | poikilos/golgotha | d3184dea6b061f853423e0666dba23218042e5ba | [
"CC0-1.0"
] | 13 | 2021-09-20T16:25:30.000Z | 2022-03-17T04:59:40.000Z | golg__resources.cpp | poikilos/golgotha | d3184dea6b061f853423e0666dba23218042e5ba | [
"CC0-1.0"
] | 5 | 2016-01-04T22:54:22.000Z | 2021-09-20T16:09:03.000Z | /********************************************************************** <BR>
This file is part of Crack dot Com's free source code release of
Golgotha. <a href="http://www.crack.com/golgotha_release"> <BR> for
information about compiling & licensing issues visit this URL</a>
<PRE> If that doesn't help, ... | 29.131707 | 93 | 0.567565 | poikilos |