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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
7183a7bcc789f718336e25d0388a553c39091d42 | 3,417 | cpp | C++ | src/simple-2d-polydar.cpp | mdsumner/polydar | 44009e76fdbf36cb71d97253427e8b4000f53ec5 | [
"MIT"
] | 2 | 2020-05-05T07:07:27.000Z | 2020-05-05T07:19:17.000Z | src/simple-2d-polydar.cpp | mdsumner/polydar | 44009e76fdbf36cb71d97253427e8b4000f53ec5 | [
"MIT"
] | null | null | null | src/simple-2d-polydar.cpp | mdsumner/polydar | 44009e76fdbf36cb71d97253427e8b4000f53ec5 | [
"MIT"
] | null | null | null | /**
simple.cpp
Purpose: Example of using polylidar in C++
@author Jeremy Castagno
@version 05/20/19
*/
#include <Rcpp.h>
using namespace Rcpp;
#include <iostream>
#include <sstream> // std::istringstream
#include <vector>
#include <string>
#include <fstream>
#include <iomanip>
#include "include... | 30.508929 | 190 | 0.580334 | mdsumner |
71845503f276eb0333c946c1edf10ba8fc60df38 | 1,016 | cpp | C++ | src/NGFX/Private/Vulkan/vk_pipeline.cpp | PixPh/kaleido3d | 8a8356586f33a1746ebbb0cfe46b7889d0ae94e9 | [
"MIT"
] | 38 | 2019-01-10T03:10:12.000Z | 2021-01-27T03:14:47.000Z | src/NGFX/Private/Vulkan/vk_pipeline.cpp | fuqifacai/kaleido3d | ec77753b516949bed74e959738ef55a0bd670064 | [
"MIT"
] | null | null | null | src/NGFX/Private/Vulkan/vk_pipeline.cpp | fuqifacai/kaleido3d | ec77753b516949bed74e959738ef55a0bd670064 | [
"MIT"
] | 8 | 2019-04-16T07:56:27.000Z | 2020-11-19T02:38:37.000Z | #include "vk_common.h"
namespace vulkan
{
GpuRenderPipeline::GpuRenderPipeline(GpuDevice* device, ngfx::RenderPipelineDesc const& desc)
: GpuPipelineBase(device)
{
create_info_.stageCount;
create_info_.pStages;
create_info_.pVertexInputState;
create_info_.pInputAssemblyState;
create_info_.pTessellationSt... | 24.190476 | 97 | 0.806102 | PixPh |
71898089850d4aaee8c18f2f9f3e84cddecb0816 | 460 | cpp | C++ | HandAugementedReality/HandAugementedReality/Finger.cpp | nemcek/hand-augmented-reality | 6f4c1f23e1d18d35b3cc65bcc109ca06a8023ea6 | [
"MIT"
] | null | null | null | HandAugementedReality/HandAugementedReality/Finger.cpp | nemcek/hand-augmented-reality | 6f4c1f23e1d18d35b3cc65bcc109ca06a8023ea6 | [
"MIT"
] | null | null | null | HandAugementedReality/HandAugementedReality/Finger.cpp | nemcek/hand-augmented-reality | 6f4c1f23e1d18d35b3cc65bcc109ca06a8023ea6 | [
"MIT"
] | 1 | 2021-12-16T03:26:28.000Z | 2021-12-16T03:26:28.000Z | #include "Finger.h"
Finger::Finger()
{
}
Finger::Finger(const Point& finger_tip_point, FingerType type)
{
this->location = Location(finger_tip_point);
this->roi = Rect(Point(location.get().x - width / 2, location.get().y - height / 4), Size(width, height));
this->type = type;
}
/// Extracts finger from image by... | 18.4 | 107 | 0.684783 | nemcek |
718aad9333fdba92b3c5e4fc7de25fdc1906a5cd | 8,951 | hpp | C++ | hwlib/doxyfiles/texts/hwlib-doxygen-#0070-graphics.hpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 46 | 2017-02-15T14:24:14.000Z | 2021-10-01T14:25:57.000Z | hwlib/doxyfiles/texts/hwlib-doxygen-#0070-graphics.hpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 27 | 2017-02-15T15:13:42.000Z | 2021-08-28T15:29:01.000Z | hwlib/doxyfiles/texts/hwlib-doxygen-#0070-graphics.hpp | TheBlindMick/MPU6050 | 66880369fa7a73755846e60568137dfc07da1b5c | [
"BSL-1.0"
] | 39 | 2017-05-18T11:51:03.000Z | 2021-09-14T09:07:01.000Z | // ==========================================================================
//
// File : hwlib-doxygen-char-io.hpp
// Part of : C++ hwlib library for close-to-the-hardware OO programming
// Copyright : wouter@voti.nl 2017-2019
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanyin... | 43.451456 | 163 | 0.537594 | TheBlindMick |
718affb17c3349b1fbdd5e5ef593df60654db8a3 | 1,755 | cpp | C++ | 901-1000/928. Minimize Malware Spread II.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 901-1000/928. Minimize Malware Spread II.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | 901-1000/928. Minimize Malware Spread II.cpp | erichuang1994/leetcode-solution | d5b3bb3ce2a428a3108f7369715a3700e2ba699d | [
"MIT"
] | null | null | null | class Solution
{
public:
int minMalwareSpread(vector<vector<int>> &graph, vector<int> &initial)
{
int N = graph.size();
vector<bool> flag(N, false);
vector<vector<int>> connected(N, vector<int>());
vector<vector<int>> edges(N, vector<int>());
for (int i = 0; i < N; ++i)... | 26.19403 | 74 | 0.325356 | erichuang1994 |
718c201296b2b15165e073a60cdff475dc75aad9 | 7,348 | cpp | C++ | mwidgets/src/mediawidget/downloaddialog.cpp | quntax/qpcol | 290e2f0639eaee12fe6190070b3e2c38a8fd1ea7 | [
"BSD-3-Clause"
] | null | null | null | mwidgets/src/mediawidget/downloaddialog.cpp | quntax/qpcol | 290e2f0639eaee12fe6190070b3e2c38a8fd1ea7 | [
"BSD-3-Clause"
] | null | null | null | mwidgets/src/mediawidget/downloaddialog.cpp | quntax/qpcol | 290e2f0639eaee12fe6190070b3e2c38a8fd1ea7 | [
"BSD-3-Clause"
] | null | null | null | #include "downloaddialog.h"
DownloadDialog::DownloadDialog(QWidget * parent) : QDialog(parent)
{
dialogText = QString("Downloading file:\n%1\n\nTarget directory:\n%2\n");
pixmap = QIcon::fromTheme("download").pixmap(QSize(48, 48));
}
DownloadDialog::~DownloadDialog()
{
destroy();
}
// TODO prompt for dir... | 30.238683 | 104 | 0.662221 | quntax |
718f148237aa142c37818bef9b5a428a39a9e747 | 4,292 | cpp | C++ | Editor/src/ImGuiWidgets/Viewport.cpp | FelipeCalin/Hildur | 13e60a357e6f84ac1de842d9a9bd980155968cbc | [
"Apache-2.0"
] | null | null | null | Editor/src/ImGuiWidgets/Viewport.cpp | FelipeCalin/Hildur | 13e60a357e6f84ac1de842d9a9bd980155968cbc | [
"Apache-2.0"
] | null | null | null | Editor/src/ImGuiWidgets/Viewport.cpp | FelipeCalin/Hildur | 13e60a357e6f84ac1de842d9a9bd980155968cbc | [
"Apache-2.0"
] | null | null | null | #include "Viewport.h"
#include <Hildur.h>
#include <ImGui/imgui.h>
#define BIND_EVENT_FN(x) std::bind(&Viewport::x, this, std::placeholders::_1)
namespace Editor {
Viewport::Viewport()
{
}
Viewport::~Viewport()
{
}
void Viewport::Init(uint32_t width, uint32_t height)
{
m_ObjectIDFrameBuffer = Hild... | 30.657143 | 206 | 0.731827 | FelipeCalin |
7190cdfec8b8840ab8a822b73e34a51a587241eb | 5,883 | cpp | C++ | samples/flocking.cpp | jdduke/fpcpp | d9dba8aed135c85383a733fba3537d6afca5ddd7 | [
"MIT"
] | 16 | 2015-08-05T09:31:55.000Z | 2021-04-18T02:23:46.000Z | samples/flocking.cpp | jdduke/fpcpp | d9dba8aed135c85383a733fba3537d6afca5ddd7 | [
"MIT"
] | null | null | null | samples/flocking.cpp | jdduke/fpcpp | d9dba8aed135c85383a733fba3537d6afca5ddd7 | [
"MIT"
] | null | null | null | /////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2012, Jared Duke.
// This code is released under the MIT License.
// www.opensource.org/licenses/mit-license.php
/////////////////////////////////////////////////////////////////////////////
#include <fpcpp.h>
#include <ios... | 29.712121 | 97 | 0.536291 | jdduke |
7193bd769bf53d713ca1f480c94054ab7e371e06 | 683 | cpp | C++ | tools/ifaceed/ifaceed/scripting/querytable.cpp | mamontov-cpp/saddy | f20a0030e18af9e0714fe56c19407fbeacc529a7 | [
"BSD-2-Clause"
] | 58 | 2015-08-09T14:56:35.000Z | 2022-01-15T22:06:58.000Z | tools/ifaceed/ifaceed/scripting/querytable.cpp | mamontov-cpp/saddy-graphics-engine-2d | e25a6637fcc49cb26614bf03b70e5d03a3a436c7 | [
"BSD-2-Clause"
] | 245 | 2015-08-08T08:44:22.000Z | 2022-01-04T09:18:08.000Z | tools/ifaceed/ifaceed/scripting/querytable.cpp | mamontov-cpp/saddy | f20a0030e18af9e0714fe56c19407fbeacc529a7 | [
"BSD-2-Clause"
] | 23 | 2015-12-06T03:57:49.000Z | 2020-10-12T14:15:50.000Z | #include "querytable.h"
#include <QVector>
#include <renderer.h>
#include <db/dbdatabase.h>
#include <db/dbtable.h>
QVector<unsigned long long> scripting::query_table(
const sad::String& table,
const sad::String& type_of_objects
)
{
sad::db::Database* db = sad::Renderer::ref()->database(""... | 22.766667 | 77 | 0.590044 | mamontov-cpp |
7195d91b67b3890eda661e549e9f0936879e9562 | 1,105 | cpp | C++ | thread/example3.cpp | TedLyngmo/lyn_threads | 576230ded5d5f8f0b17aabec870a7201f4f9108e | [
"Unlicense"
] | null | null | null | thread/example3.cpp | TedLyngmo/lyn_threads | 576230ded5d5f8f0b17aabec870a7201f4f9108e | [
"Unlicense"
] | null | null | null | thread/example3.cpp | TedLyngmo/lyn_threads | 576230ded5d5f8f0b17aabec870a7201f4f9108e | [
"Unlicense"
] | null | null | null | #include "lyn/thread.hpp"
#include <chrono>
#include <iostream>
#include <thread>
// event example
lyn::thread::event<true> ev; // true = auto reset
int state = 0;
void a_thread() {
// waits for ev to be signaled
// runs the lambda
// sets ev to non-signaled
bool executed = ev.wait_for(std::chrono::... | 19.385965 | 66 | 0.472398 | TedLyngmo |
71969823bed10163f644eff544d814836e58e2da | 52,395 | cc | C++ | Modules/Registration/src/irtkRegisteredImage.cc | kevin-keraudren/IRTK | ce329b7f58270b6c34665dcfe9a6e941649f3b94 | [
"Apache-2.0"
] | 3 | 2018-10-04T19:32:36.000Z | 2021-09-02T07:37:30.000Z | Modules/Registration/src/irtkRegisteredImage.cc | kevin-keraudren/IRTK | ce329b7f58270b6c34665dcfe9a6e941649f3b94 | [
"Apache-2.0"
] | null | null | null | Modules/Registration/src/irtkRegisteredImage.cc | kevin-keraudren/IRTK | ce329b7f58270b6c34665dcfe9a6e941649f3b94 | [
"Apache-2.0"
] | 4 | 2016-03-17T02:55:00.000Z | 2018-02-03T05:40:05.000Z | /* The Image Registration Toolkit (IRTK)
*
* Copyright 2008-2015 Imperial College London
*
* 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... | 40.334873 | 129 | 0.616776 | kevin-keraudren |
719808bb3bebe7d1d308ff050376afa792945677 | 448 | cc | C++ | phastaIO/phiotimer_empty/phiotimer_empty.cc | polmes/phasta | 38a361e8033072fa0b5376e424dddd3efa5a65d5 | [
"BSD-3-Clause"
] | 49 | 2015-04-16T13:45:34.000Z | 2022-02-07T01:02:49.000Z | phastaIO/phiotimer_empty/phiotimer_empty.cc | polmes/phasta | 38a361e8033072fa0b5376e424dddd3efa5a65d5 | [
"BSD-3-Clause"
] | 21 | 2015-10-06T19:50:43.000Z | 2017-12-17T03:47:51.000Z | phastaIO/phiotimer_empty/phiotimer_empty.cc | polmes/phasta | 38a361e8033072fa0b5376e424dddd3efa5a65d5 | [
"BSD-3-Clause"
] | 38 | 2015-04-21T12:13:40.000Z | 2021-11-12T19:38:00.000Z | #include <phiotimer.h>
void phastaio_time(phastaioTime*) {}
size_t phastaio_time_diff(phastaioTime*, phastaioTime*) {
return 1;
}
void phastaio_addReadBytes(size_t) {}
void phastaio_addWriteBytes(size_t) {}
void phastaio_addReadTime(size_t) {}
void phastaio_addWriteTime(size_t) {}
void phastaio_setfile(int) {}
void p... | 29.866667 | 57 | 0.790179 | polmes |
719f1d89691cb01d7d1a0d34a117416f876f2bd1 | 920 | cpp | C++ | Examples/source/AddImage.cpp | kashifiqb/Aspose.Page-for-C | ac121edcf382d2543261f797d1dac108936ca69f | [
"MIT"
] | 3 | 2020-06-19T20:30:11.000Z | 2021-01-15T09:07:42.000Z | Examples/source/AddImage.cpp | kashifiqb/Aspose.Page-for-C | ac121edcf382d2543261f797d1dac108936ca69f | [
"MIT"
] | null | null | null | Examples/source/AddImage.cpp | kashifiqb/Aspose.Page-for-C | ac121edcf382d2543261f797d1dac108936ca69f | [
"MIT"
] | 1 | 2019-12-26T12:53:01.000Z | 2019-12-26T12:53:01.000Z | #include "stdafx.h"
//#include "ExampleDirectories.h"
#include "..\RunExamples.h"
using namespace Aspose::Page::Xps;
using namespace Aspose::Page::Xps::XpsModel;
void AddImage()
{
//ExStart: AddImage
// Create new XPS Document
System::SharedPtr<XpsDocument> doc = System::MakeObject<XpsDocument>();
// Add Image
S... | 41.818182 | 200 | 0.717391 | kashifiqb |
71a4545a18af8f66eda7bfb88777af13752a4729 | 16,127 | cpp | C++ | tests/tst_seasidefilteredmodel/seasidecache.cpp | LaakkonenJussi/nemo-qml-plugin-contacts | e94e468786000d4c4d403fea1bec8e49e37a471e | [
"BSD-3-Clause"
] | null | null | null | tests/tst_seasidefilteredmodel/seasidecache.cpp | LaakkonenJussi/nemo-qml-plugin-contacts | e94e468786000d4c4d403fea1bec8e49e37a471e | [
"BSD-3-Clause"
] | 3 | 2021-09-29T07:13:48.000Z | 2022-03-31T11:03:07.000Z | tests/tst_seasidefilteredmodel/seasidecache.cpp | LaakkonenJussi/nemo-qml-plugin-contacts | e94e468786000d4c4d403fea1bec8e49e37a471e | [
"BSD-3-Clause"
] | 1 | 2022-03-25T15:33:41.000Z | 2022-03-25T15:33:41.000Z | /*
* Copyright (C) 2013 Jolla Mobile <andrew.den.exter@jollamobile.com>
*
* You may use this file under the terms of the BSD license as follows:
*
* "Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
* * Redistrib... | 27.805172 | 151 | 0.688163 | LaakkonenJussi |
71a49600f84ea0f01d7ad4760c17e8c79fbcb7cc | 8,928 | cpp | C++ | src/monitormanager.cpp | dnnr/herbstluftwm | 3bed77ed53c11d0f07d591feb0ef29bb4e741b51 | [
"BSD-2-Clause-FreeBSD"
] | 1 | 2018-12-02T16:51:04.000Z | 2018-12-02T16:51:04.000Z | src/monitormanager.cpp | dnnr/herbstluftwm | 3bed77ed53c11d0f07d591feb0ef29bb4e741b51 | [
"BSD-2-Clause-FreeBSD"
] | 8 | 2019-03-03T21:12:40.000Z | 2019-05-05T13:30:19.000Z | src/monitormanager.cpp | dnnr/herbstluftwm | 3bed77ed53c11d0f07d591feb0ef29bb4e741b51 | [
"BSD-2-Clause-FreeBSD"
] | null | null | null | #include "monitormanager.h"
#include <X11/Xlib.h>
#include <cassert>
#include <memory>
#include "ewmh.h"
#include "floating.h"
#include "frametree.h"
#include "globals.h"
#include "ipc-protocol.h"
#include "layout.h"
#include "monitor.h"
#include "settings.h"
#include "stack.h"
#include "tag.h"
#include "tagmanager.h... | 27.640867 | 95 | 0.567092 | dnnr |
71a5684041c3b8c47eb09591a384c59fd46ce891 | 3,297 | cpp | C++ | Src/Legacy/Math/matrix4.cpp | visualizersdotnl/tpb-06-final | 7bd0b0e3fb954381466b2eb89d5edebef9f39ea7 | [
"MIT"
] | 4 | 2015-12-15T23:04:27.000Z | 2018-01-17T23:09:10.000Z | Src/Legacy/Math/matrix4.cpp | visualizersdotnl/tpb-06-final | 7bd0b0e3fb954381466b2eb89d5edebef9f39ea7 | [
"MIT"
] | null | null | null | Src/Legacy/Math/matrix4.cpp | visualizersdotnl/tpb-06-final | 7bd0b0e3fb954381466b2eb89d5edebef9f39ea7 | [
"MIT"
] | null | null | null |
#include <Shared/assert.h>
#include "matrix4.h"
#include "vector4.h"
#include "misc.h"
Matrix4 Matrix4::IDENTITY;
void Matrix4::Init()
{
IDENTITY.SetIdentity();
}
void Matrix4::SetIdentity()
{
_11 = 1.0f;
_12 = 0.0f;
_13 = 0.0f;
_14 = 0.0f;
_21 = 0.0f;
_22 = 1.0f;
_23 = 0.0f;
_24 = 0.0f;
_31 = 0.0f;
_... | 22.737931 | 96 | 0.575978 | visualizersdotnl |
71a929242d9c405f7e8288708bff8c01d1359c35 | 1,863 | hpp | C++ | FinalExam/PNGio.hpp | MetalheadKen/NTUST-Parallel-Course | 4a4e726a5220eaf7403375b61cf6ce8a7cd9cbb9 | [
"MIT"
] | null | null | null | FinalExam/PNGio.hpp | MetalheadKen/NTUST-Parallel-Course | 4a4e726a5220eaf7403375b61cf6ce8a7cd9cbb9 | [
"MIT"
] | null | null | null | FinalExam/PNGio.hpp | MetalheadKen/NTUST-Parallel-Course | 4a4e726a5220eaf7403375b61cf6ce8a7cd9cbb9 | [
"MIT"
] | null | null | null | #pragma once
#include <png.h>
#include <cstdint>
#include <list>
#include <array>
using std::list;
using std::array;
// struct for PNG image
struct inputImage {
int width, height; // width & height of the image
png_byte depth; // color depth of the image
png_byte colo... | 38.8125 | 197 | 0.721417 | MetalheadKen |
71a93b3de4fd9a828bfa604b1475bb1cf42e1368 | 2,350 | hxx | C++ | private/inet/xml/debug/include/headers.hxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 11 | 2017-09-02T11:27:08.000Z | 2022-01-02T15:25:24.000Z | private/inet/xml/debug/include/headers.hxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | null | null | null | private/inet/xml/debug/include/headers.hxx | King0987654/windows2000 | 01f9c2e62c4289194e33244aade34b7d19e7c9b8 | [
"MIT"
] | 14 | 2019-01-16T01:01:23.000Z | 2022-02-20T15:54:27.000Z | //+---------------------------------------------------------------------------
//
// Microsoft Windows
// Copyright (c) 1992 - 1999 Microsoft Corporation. All rights reserved.*///
// File: headers.hxx
//
// Contents: include files for Forms Debug DLL
//
//---------------------------------------------... | 19.747899 | 79 | 0.611489 | King0987654 |
71a9fd975cf1f7c322f09d4adc40cf2502d74143 | 687 | cpp | C++ | 03-Arrays/subarraysum2.cpp | ShreyashRoyzada/C-plus-plus-Algorithms | 9db89faf0a9b9e636aece3e7289f21ab6a1e3748 | [
"MIT"
] | 21 | 2020-10-03T03:57:19.000Z | 2022-03-25T22:41:05.000Z | 03-Arrays/subarraysum2.cpp | ShreyashRoyzada/C-plus-plus-Algorithms | 9db89faf0a9b9e636aece3e7289f21ab6a1e3748 | [
"MIT"
] | 40 | 2020-10-02T07:02:34.000Z | 2021-10-30T16:00:07.000Z | 03-Arrays/subarraysum2.cpp | ShreyashRoyzada/C-plus-plus-Algorithms | 9db89faf0a9b9e636aece3e7289f21ab6a1e3748 | [
"MIT"
] | 90 | 2020-10-02T07:06:22.000Z | 2022-03-25T22:41:17.000Z | #include<iostream>
using namespace std;
int main()
{
int n;cin>>n;
int a[1000];
int currentsum=0;
int maxsum=0;
int left=-1;
int right=-1;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)
{
currentsum=0;
... | 17.615385 | 38 | 0.404658 | ShreyashRoyzada |
71add08d7d3fac9fb11e2cd01e74016a21164d1a | 1,019 | cpp | C++ | PAT/A1155.cpp | iphelf/Programming-Practice | 2a95bb7153957b035427046b250bf7ffc6b00906 | [
"WTFPL"
] | null | null | null | PAT/A1155.cpp | iphelf/Programming-Practice | 2a95bb7153957b035427046b250bf7ffc6b00906 | [
"WTFPL"
] | null | null | null | PAT/A1155.cpp | iphelf/Programming-Practice | 2a95bb7153957b035427046b250bf7ffc6b00906 | [
"WTFPL"
] | null | null | null | #include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
const int MAXN=1e3;
int N,heap[MAXN],path[MAXN],cnt;
void dfs(int o) {
path[cnt++]=heap[o];
int lc=o*2+1,rc=o*2+2;
if(lc>=N && rc>=N)
for(int i=0; i<cnt; i++) printf("%d%c",path[i],i==cnt-1?'\n':' ');
... | 16.983333 | 75 | 0.50736 | iphelf |
71af7319bc7f7b6ab90ddfa8471be6bdba17c46a | 1,248 | cpp | C++ | genomes/scripts/bounds.cpp | whelena/ginkgo | 892b2e9f851f71a491cade6297f74f09f17acf4c | [
"BSD-2-Clause"
] | 40 | 2015-06-15T14:17:15.000Z | 2022-02-24T10:53:41.000Z | genomes/scripts/bounds.cpp | whelena/ginkgo | 892b2e9f851f71a491cade6297f74f09f17acf4c | [
"BSD-2-Clause"
] | 36 | 2016-04-10T07:35:39.000Z | 2022-02-23T17:09:43.000Z | genomes/scripts/bounds.cpp | whelena/ginkgo | 892b2e9f851f71a491cade6297f74f09f17acf4c | [
"BSD-2-Clause"
] | 28 | 2015-07-02T21:14:38.000Z | 2022-03-09T12:35:26.000Z | #include <iostream>
#include <fstream>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main(int argc, char *argv[]){
ifstream bin_file(argv[1], ios::out);
ofstream outfile(argv[2], ios::out);
if(argc < 3)
{
cout << "Provide input and output files" <... | 18.086957 | 61 | 0.564103 | whelena |
71afbf4202919189fedbc136b0c88992de25bc30 | 10,770 | cpp | C++ | csl/cslbase/tltime.cpp | arthurcnorman/general | 5e8fef0cc7999fa8ab75d8fdf79ad5488047282b | [
"BSD-2-Clause"
] | null | null | null | csl/cslbase/tltime.cpp | arthurcnorman/general | 5e8fef0cc7999fa8ab75d8fdf79ad5488047282b | [
"BSD-2-Clause"
] | null | null | null | csl/cslbase/tltime.cpp | arthurcnorman/general | 5e8fef0cc7999fa8ab75d8fdf79ad5488047282b | [
"BSD-2-Clause"
] | null | null | null | // tltime.c Copyright A C Norman 2019
// Released under the modified BSD license - you can find the terms
// of that easily enough!
// $Id: tltime.cpp 5331 2020-04-25 13:47:28Z arthurcnorman $
// Cygwin and mingw32 both seem to use "emutls" to support the C++11
// keyword "threa... | 36.883562 | 78 | 0.705478 | arthurcnorman |
71afde0f14be22a48d284bdc4de2c93b2696594a | 3,396 | cpp | C++ | src/software/gui/robot_diagnostics/threaded_robot_diagnostics_gui.cpp | jonl112/Software | 61a028a98d5c0dd5e79bf055b231633290ddbf9f | [
"MIT"
] | null | null | null | src/software/gui/robot_diagnostics/threaded_robot_diagnostics_gui.cpp | jonl112/Software | 61a028a98d5c0dd5e79bf055b231633290ddbf9f | [
"MIT"
] | null | null | null | src/software/gui/robot_diagnostics/threaded_robot_diagnostics_gui.cpp | jonl112/Software | 61a028a98d5c0dd5e79bf055b231633290ddbf9f | [
"MIT"
] | null | null | null | #include "software/gui/robot_diagnostics/threaded_robot_diagnostics_gui.h"
#include <QtCore/QTimer>
#include <QtWidgets/QApplication>
ThreadedRobotDiagnosticsGUI::ThreadedRobotDiagnosticsGUI(int argc, char** argv)
: FirstInFirstOutThreadedObserver<SensorProto>(),
termination_promise_ptr(std::make_shared<std... | 40.428571 | 152 | 0.717314 | jonl112 |
71b04db4d2e38dcdb2eacb58b34b5fefb1f20b26 | 1,715 | cpp | C++ | gen/src/model/Port.cpp | cpp-openapi/dockerctl | 44da21c32509fb7e44c93551a41ceb14c42c18b1 | [
"Apache-2.0"
] | null | null | null | gen/src/model/Port.cpp | cpp-openapi/dockerctl | 44da21c32509fb7e44c93551a41ceb14c42c18b1 | [
"Apache-2.0"
] | null | null | null | gen/src/model/Port.cpp | cpp-openapi/dockerctl | 44da21c32509fb7e44c93551a41ceb14c42c18b1 | [
"Apache-2.0"
] | null | null | null | /*
* Port.cpp
*
* An open port on a container
*/
#include "Port.h"
using namespace openapi;
// macro should do the same job. Not really
// OPENAP_JSON_CONVERT_FUNCS(Port, IP, PrivatePort, PublicPort, Type)
void Port::ToJSON(Json & j) const
{
// OPENAPI_FOR_EACH(OPENAPI_TO_JSON_MEMBER, __VA_ARGS__)
j.Add... | 35.729167 | 114 | 0.695627 | cpp-openapi |
71b0f782717d87abd9736880fcde2d5e0bfe6ab8 | 640 | cpp | C++ | src/context/StringType.cpp | pougetat/decacompiler | 3181c87fce7c28d742f372300daabeb9f9f8d3c6 | [
"MIT"
] | null | null | null | src/context/StringType.cpp | pougetat/decacompiler | 3181c87fce7c28d742f372300daabeb9f9f8d3c6 | [
"MIT"
] | null | null | null | src/context/StringType.cpp | pougetat/decacompiler | 3181c87fce7c28d742f372300daabeb9f9f8d3c6 | [
"MIT"
] | null | null | null | #include "StringType.h"
bool StringType::IsBooleanType()
{
return false;
}
bool StringType::IsFloatType()
{
return false;
}
bool StringType::IsIntType()
{
return false;
}
bool StringType::IsStringType()
{
return true;
}
bool StringType::IsVoidType()
{
return false;
}
bool StringType::IsClassTy... | 12.54902 | 54 | 0.682813 | pougetat |
71b183e0cbec056814a6fde953c91c890475351d | 15,257 | cpp | C++ | data/112.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | data/112.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | data/112.cpp | TianyiChen/rdcpp-data | 75c6868c876511e3ce143fdc3c08ddd74c7aa4ea | [
"MIT"
] | null | null | null | int Rgpz , u7,
nT//a
,M4ElL /*d*/,DhV , xKKv7,
Aev7f
,puj,
E,hI, TGe,oN /*G6Iat*/
, //k
aA, //U6
zWZLO ,//DEw
MTL ,rq ,
a9 //Xt
,vu5
,eHB,v8Y , osHw/*jo*/,
h
,M,IT,//fpe
dq5 ,PEwG, xq, dOu ,
AzCI,
Z3sCV
, sOO
,
LJ ,
WbN5,z ,pzg8
, duU4, QztyO
, oDdEz/*UQ*/, Fndz
, GdVz, OkxM,r,Vzf,
xi//
,Di... | 10.400136 | 81 | 0.457364 | TianyiChen |
71b186d6347bb2f3f565617bd1181323eddfeef8 | 703 | cpp | C++ | kattis/problems/pet.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | 1 | 2020-07-16T01:46:38.000Z | 2020-07-16T01:46:38.000Z | kattis/problems/pet.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | null | null | null | kattis/problems/pet.cpp | Rkhoiwal/Competitive-prog-Archive | 18a95a8b2b9ca1a28d6fe939c1db5450d541ddc9 | [
"MIT"
] | 1 | 2020-05-27T14:30:43.000Z | 2020-05-27T14:30:43.000Z | #include <iostream>
using namespace std;
inline
void use_io_optimizations()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int main()
{
use_io_optimizations();
unsigned int winner_number {0};
unsigned int winner_points {0};
for (unsigned int i {0}; i < 5; ++i)
{
unsigne... | 16.738095 | 58 | 0.517781 | Rkhoiwal |
71b40079abf37683b1db939e36f6493b8ea0ddbf | 3,794 | cpp | C++ | dev/Gems/CryLegacy/Code/Source/CryAnimation/SkeletonAnim_Params.cpp | jeikabu/lumberyard | 07228c605ce16cbf5aaa209a94a3cb9d6c1a4115 | [
"AML"
] | 1,738 | 2017-09-21T10:59:12.000Z | 2022-03-31T21:05:46.000Z | dev/Gems/CryLegacy/Code/Source/CryAnimation/SkeletonAnim_Params.cpp | jeikabu/lumberyard | 07228c605ce16cbf5aaa209a94a3cb9d6c1a4115 | [
"AML"
] | 427 | 2017-09-29T22:54:36.000Z | 2022-02-15T19:26:50.000Z | dev/Gems/CryLegacy/Code/Source/CryAnimation/SkeletonAnim_Params.cpp | jeikabu/lumberyard | 07228c605ce16cbf5aaa209a94a3cb9d6c1a4115 | [
"AML"
] | 671 | 2017-09-21T08:04:01.000Z | 2022-03-29T14:30:07.000Z | /*
* All or portions of this file Copyright (c) Amazon.com, Inc. or its affiliates or
* its licensors.
*
* For complete copyright and license terms please see the LICENSE at the root of this
* distribution (the "License"). All use of this software is governed by the License,
* or, if provided, by the license below or t... | 35.12963 | 168 | 0.584344 | jeikabu |
71b6ff277b32eb4d95b5d037136b872971c94da6 | 270 | cpp | C++ | 2. Search & Sort/07. Alternative Sorting (Easy).cpp | thekalyan001/DMB1-CP | 7ccf41bac7269bff432260c6078cebdb4e0f1483 | [
"Apache-2.0"
] | null | null | null | 2. Search & Sort/07. Alternative Sorting (Easy).cpp | thekalyan001/DMB1-CP | 7ccf41bac7269bff432260c6078cebdb4e0f1483 | [
"Apache-2.0"
] | null | null | null | 2. Search & Sort/07. Alternative Sorting (Easy).cpp | thekalyan001/DMB1-CP | 7ccf41bac7269bff432260c6078cebdb4e0f1483 | [
"Apache-2.0"
] | null | null | null | //https://practice.geeksforgeeks.org/problems/alternative-sorting1311/1/#
vector<int> alternateSort(int arr[], int n)
{
sort(arr,arr+n);int p=0;
vector<int>v(n);
for(int i=0;i<=n/2;i++)
{
v[p++]=arr[n-i-1];
p+1<n?v[p++]=arr[i]:0;
}
return v;
} | 18 | 74 | 0.577778 | thekalyan001 |
71bc9557cb256fe65b08a9dc3f39b0f98c39252d | 1,638 | cc | C++ | project1/src/main_ref.cc | jiunbae/ITE4065 | 3b9fcf9317e93ca7c829f1438b85f0f5ea2885db | [
"MIT"
] | 11 | 2017-10-28T08:41:08.000Z | 2021-06-24T07:24:21.000Z | project1/src/main_ref.cc | jiunbae/ITE4065 | 3b9fcf9317e93ca7c829f1438b85f0f5ea2885db | [
"MIT"
] | null | null | null | project1/src/main_ref.cc | jiunbae/ITE4065 | 3b9fcf9317e93ca7c829f1438b85f0f5ea2885db | [
"MIT"
] | 4 | 2017-09-07T09:33:26.000Z | 2021-02-19T07:45:08.000Z | #include <iostream>
#include <string>
#include <set>
#include <map>
using namespace std;
int main() {
int N;
set<string> word_list;
char cmd;
string buf;
std::ios::sync_with_stdio(false);
cin >> N;
for (int i = 0; i < N; i++){
cin >> buf;
word_list.insert(buf);
}
... | 26.419355 | 75 | 0.336386 | jiunbae |
71c1dc3f28f132d37fe2134d13e3edb3bcc2207c | 340 | cpp | C++ | Homeworks/2_ImageWarping/project/src/App/Warp.cpp | Qinxin-Yan/USTC_CG-1 | 80dc240bea879f000196986b98efcd0bbf8dec34 | [
"MIT"
] | null | null | null | Homeworks/2_ImageWarping/project/src/App/Warp.cpp | Qinxin-Yan/USTC_CG-1 | 80dc240bea879f000196986b98efcd0bbf8dec34 | [
"MIT"
] | null | null | null | Homeworks/2_ImageWarping/project/src/App/Warp.cpp | Qinxin-Yan/USTC_CG-1 | 80dc240bea879f000196986b98efcd0bbf8dec34 | [
"MIT"
] | null | null | null | #include "Warp.h"
Warp::Warp()
{
}
Warp::~Warp()
{
}
/*void Warp::add_static_point(QPoint P)
{
static_point_list.push_back(P);
}*/
void Warp::add_map_point(map_pair Pair)
{
map_pair_list.push_back(Pair);
}
int Warp::map_pair_length()
{
return map_pair_list.size();
}
map_pair Warp::get_map_pair(int i)
{
return... | 11.724138 | 39 | 0.7 | Qinxin-Yan |
71c399be913f9582063460f586691cee134df776 | 830 | cpp | C++ | Graph(BFS, DFS)/p1890.cpp | vocovoco/Algorithm-Study | ba9d47ae5c28eb5b7810ddef371859b0b101a695 | [
"MIT"
] | 1 | 2017-12-20T12:21:01.000Z | 2017-12-20T12:21:01.000Z | Graph(BFS, DFS)/p1890.cpp | vocovoco/Algorithm-Study | ba9d47ae5c28eb5b7810ddef371859b0b101a695 | [
"MIT"
] | null | null | null | Graph(BFS, DFS)/p1890.cpp | vocovoco/Algorithm-Study | ba9d47ae5c28eb5b7810ddef371859b0b101a695 | [
"MIT"
] | null | null | null | #if 1
#include <stdio.h>
int main() {
int map[101][101] = { 0, };
long long dp[101][101] = { 0, };
int width;
scanf("%d", &width);
for (int i = 1; i <= width; i++) {
for (int j = 1; j <= width; j++) {
scanf("%d", &map[i][j]);
}
}
for (int i = (width * 2 - 1); i > 1; i--) {
int a, b;
if (i > width) ... | 16.27451 | 47 | 0.375904 | vocovoco |
71c5c6e75d4d283387e8978cf8bd6449541fb6ac | 6,267 | cpp | C++ | source/services/service_manager/service_manager.cpp | aejsmith/kiwi | 756d5b85d7dff631ad54c942a9da137ea298794e | [
"0BSD"
] | 15 | 2015-08-02T18:20:40.000Z | 2022-03-22T13:36:44.000Z | source/services/service_manager/service_manager.cpp | aejsmith/kiwi | 756d5b85d7dff631ad54c942a9da137ea298794e | [
"0BSD"
] | null | null | null | source/services/service_manager/service_manager.cpp | aejsmith/kiwi | 756d5b85d7dff631ad54c942a9da137ea298794e | [
"0BSD"
] | 3 | 2016-03-04T06:15:34.000Z | 2020-12-12T03:01:42.000Z | /*
* Copyright (C) 2009-2021 Alex Smith
*
* 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.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DIS... | 30.871921 | 110 | 0.636828 | aejsmith |
71c67bb0c2829175fbe254522b45edc62e333f8b | 1,289 | cpp | C++ | src/learn/test_libevent.cpp | wohaaitinciu/zpublic | 0e4896b16e774d2f87e1fa80f1b9c5650b85c57e | [
"Unlicense"
] | 50 | 2015-01-07T01:54:54.000Z | 2021-01-15T00:41:48.000Z | src/learn/test_libevent.cpp | sinmx/ZPublic | 0e4896b16e774d2f87e1fa80f1b9c5650b85c57e | [
"Unlicense"
] | 1 | 2015-05-26T07:40:19.000Z | 2015-05-26T07:40:19.000Z | src/learn/test_libevent.cpp | sinmx/ZPublic | 0e4896b16e774d2f87e1fa80f1b9c5650b85c57e | [
"Unlicense"
] | 39 | 2015-01-07T02:03:15.000Z | 2021-01-15T00:41:50.000Z | #include "stdafx.h"
#include "test_libevent.h"
struct timeval lasttime;
int times = 0;
static void timeout_cb(evutil_socket_t fd, short e, void *arg)
{
struct timeval newtime, difference;
struct event *timeout = (event *)arg;
double elapsed;
evutil_gettimeofday(&newtime, NULL);
evutil_timersub(&n... | 23.017857 | 79 | 0.645462 | wohaaitinciu |
71c84e229d9425e488c02b0cfba33e7b477ceb70 | 311 | cpp | C++ | P1134.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | P1134.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | P1134.cpp | AndrewWayne/OI_Learning | 0fe8580066704c8d120a131f6186fd7985924dd4 | [
"MIT"
] | null | null | null | #include <cstdio>
using namespace std;
int n, ans = 1;
int num[4] = {6, 8, 4, 2};
int main() {
scanf("%d",&n);
for(int p = n; p > 0; p /= 5, ans = ans * num[p%4] %10)
for (int i = 1; i <= p%10; i++)
if(i != 5)
ans = ans * i %10;
printf("%d",ans);
return 0;
}
| 22.214286 | 59 | 0.421222 | AndrewWayne |
71ca4743af830dbe7955834b0a2b1a9455f39066 | 474 | cpp | C++ | src/DS/queue_demo.cpp | rrkarim/Algorithms-data-structues | 3e8f9bb06a0298bf19b76684d7e5e0b539cf56cd | [
"MIT"
] | 1 | 2021-09-08T08:15:40.000Z | 2021-09-08T08:15:40.000Z | src/DS/queue_demo.cpp | rrkarim/Algorithms-data-structues | 3e8f9bb06a0298bf19b76684d7e5e0b539cf56cd | [
"MIT"
] | null | null | null | src/DS/queue_demo.cpp | rrkarim/Algorithms-data-structues | 3e8f9bb06a0298bf19b76684d7e5e0b539cf56cd | [
"MIT"
] | null | null | null | /**
Queue implementation
Iterator pattern
Rasul Kerimov (CoderINusE)
*/
#include <inc_libs.h>
#include "queue.h"
#include <time.h>
using namespace alg;
using namespace std;
const int MAX_ELEMENTS = 10005;
int main() {
srand (time(NULL)); //init random
Queue<int> q0, q1;
for(int i = 0; i < 10; ++i) q0.pushBac... | 18.230769 | 85 | 0.64135 | rrkarim |
71d49d9f87d112f4351228c743214ec2e77b8f6e | 91 | cpp | C++ | src/params.cpp | DanielLenz/rFBP | fc8ae71a8ff58858f6800eeb3a3f25a56c143d18 | [
"MIT"
] | 7 | 2019-12-03T17:45:31.000Z | 2021-04-21T15:46:41.000Z | src/params.cpp | DanielLenz/rFBP | fc8ae71a8ff58858f6800eeb3a3f25a56c143d18 | [
"MIT"
] | 6 | 2020-09-28T06:57:23.000Z | 2020-10-22T05:41:12.000Z | src/params.cpp | DanielLenz/rFBP | fc8ae71a8ff58858f6800eeb3a3f25a56c143d18 | [
"MIT"
] | 1 | 2020-10-11T08:59:41.000Z | 2020-10-11T08:59:41.000Z | #include <params.hpp>
template class Params < MagP64 >;
template class Params < MagT64 >;
| 18.2 | 33 | 0.725275 | DanielLenz |
71d568094ded48d09db22efc6ad39d1f040c6eeb | 382 | cpp | C++ | test/Day1.cpp | schoradt/adventofcode-c | 09b9b5fc22cadc938190f5d83a895b601896d663 | [
"MIT"
] | null | null | null | test/Day1.cpp | schoradt/adventofcode-c | 09b9b5fc22cadc938190f5d83a895b601896d663 | [
"MIT"
] | null | null | null | test/Day1.cpp | schoradt/adventofcode-c | 09b9b5fc22cadc938190f5d83a895b601896d663 | [
"MIT"
] | null | null | null | #define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "doctest.h"
#include "Day1.h"
TEST_CASE("Testing Day 1")
{
Day1 day1;
vector<int> input = day1.parseIntegerLines(day1.loadLinesString("199\n200\n208\n210\n200\n207\n240\n269\n260\n263"));
CHECK_MESSAGE(7 == day1.process1(input), "test process 1");
... | 25.466667 | 121 | 0.717277 | schoradt |
71d6dd0a5a0bb3b6cb3fcc9f8f02e1d2a78fb94d | 9,391 | cpp | C++ | src/shogun/mathematics/Random.cpp | cloner1984/shogun | 901c04b2c6550918acf0594ef8afeb5dcd840a7d | [
"BSD-3-Clause"
] | 2 | 2015-01-13T15:18:27.000Z | 2015-05-01T13:28:48.000Z | src/shogun/mathematics/Random.cpp | cloner1984/shogun | 901c04b2c6550918acf0594ef8afeb5dcd840a7d | [
"BSD-3-Clause"
] | null | null | null | src/shogun/mathematics/Random.cpp | cloner1984/shogun | 901c04b2c6550918acf0594ef8afeb5dcd840a7d | [
"BSD-3-Clause"
] | null | null | null | /*
* This software is distributed under BSD 3-clause license (see LICENSE file).
*
* Authors: Viktor Gal, Bjoern Esser, Thoralf Klein, Heiko Strathmann,
* Soeren Sonnenburg
*/
#ifdef _WIN32
#define _CRT_RAND_S
#include <stdlib.h>
#endif
#include <shogun/mathematics/Random.h>
#include <shogun/base/Paramet... | 25.728767 | 124 | 0.695134 | cloner1984 |
71d7b3bb107ddf1c9f98fcdb0f91391e945d30b0 | 8,659 | cpp | C++ | DlgVolumeCalc.cpp | RDamman/SpeakerWorkshop | 87a38d04197a07a9a7878b3f60d5e0706782163c | [
"OML"
] | 12 | 2019-06-07T10:06:41.000Z | 2021-03-22T22:13:59.000Z | DlgVolumeCalc.cpp | RDamman/SpeakerWorkshop | 87a38d04197a07a9a7878b3f60d5e0706782163c | [
"OML"
] | 1 | 2019-05-09T07:38:12.000Z | 2019-07-10T04:20:55.000Z | DlgVolumeCalc.cpp | RDamman/SpeakerWorkshop | 87a38d04197a07a9a7878b3f60d5e0706782163c | [
"OML"
] | 3 | 2020-09-08T08:27:33.000Z | 2021-05-13T09:25:43.000Z | // DlgVolumeCalc.cpp : implementation file
//
#include "stdafx.h"
#include "audtest.h"
#include "DlgVolumeCalc.h"
#include "Utils.h"
#include "Math.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
// ------------------------------------------------------------------... | 26.975078 | 92 | 0.494861 | RDamman |
71d84de8bc7087a21e5a617b0828c7683b10eb62 | 2,649 | cpp | C++ | Visualizer/Visualizer.cpp | VendorSniper/reg | 825dd4c638ca9be58abd6fcf62989a9c1899b61a | [
"MIT"
] | null | null | null | Visualizer/Visualizer.cpp | VendorSniper/reg | 825dd4c638ca9be58abd6fcf62989a9c1899b61a | [
"MIT"
] | null | null | null | Visualizer/Visualizer.cpp | VendorSniper/reg | 825dd4c638ca9be58abd6fcf62989a9c1899b61a | [
"MIT"
] | null | null | null | #include "Visualizer.h"
reg::Visualizer::Visualizer(vtkImageData *image) {
Initialize(image);
Execute(image);
}
void reg::Visualizer::Execute(vtkImageData *image) {
Wrapper<vtkRenderWindow>::Get()->AddRenderer(Wrapper<vtkRenderer>::Get());
Wrapper<vtkRenderWindowInteractor>::Get()->SetRenderWindow(
... | 44.898305 | 105 | 0.702529 | VendorSniper |
71d885eb80a49039d76e763b48f31c8a840120a0 | 40,544 | cpp | C++ | sbg/src/libpdb/Atomo.cpp | chaconlab/korpm | 5a73b5ab385150b580b2fd3f1b2ad26fa3d55cf3 | [
"MIT"
] | 1 | 2022-01-02T01:48:05.000Z | 2022-01-02T01:48:05.000Z | sbg/src/libpdb/Atomo.cpp | chaconlab/korpm | 5a73b5ab385150b580b2fd3f1b2ad26fa3d55cf3 | [
"MIT"
] | 1 | 2021-11-10T10:50:08.000Z | 2021-11-10T10:50:08.000Z | sbg/src/libpdb/Atomo.cpp | chaconlab/korpm | 5a73b5ab385150b580b2fd3f1b2ad26fa3d55cf3 | [
"MIT"
] | 1 | 2021-12-03T03:29:39.000Z | 2021-12-03T03:29:39.000Z |
/*Implementation of the different methods of the Atom Class*/
#include <stdio.h>
#include "Atomo.h"
using namespace std;
/*Table with the principal elements*/
Element Table_Elements::table_Elements[NUM_ELEMENTS]=
{
// Symbol Symbol group period number weight atomic cov vdw ... | 64.355556 | 212 | 0.540475 | chaconlab |
71db72db15b02f52511cca6db4053c8727b4ca70 | 1,898 | cpp | C++ | gadgets/mri_core/ImageSortGadget.cpp | roopchansinghv/gadgetron | fb6c56b643911152c27834a754a7b6ee2dd912da | [
"MIT"
] | 1 | 2022-02-22T21:06:36.000Z | 2022-02-22T21:06:36.000Z | gadgets/mri_core/ImageSortGadget.cpp | apd47/gadgetron | 073e84dabe77d2dae3b3dd9aa4bf9edbf1f890f2 | [
"MIT"
] | null | null | null | gadgets/mri_core/ImageSortGadget.cpp | apd47/gadgetron | 073e84dabe77d2dae3b3dd9aa4bf9edbf1f890f2 | [
"MIT"
] | null | null | null | #include "ImageSortGadget.h"
namespace Gadgetron{
int ImageSortGadget::index(GadgetContainerMessage<ISMRMRD::ImageHeader>* m1)
{
std::string sorting_dimension_local = sorting_dimension.value();
if (sorting_dimension_local.size() == 0) {
return -1;
} else if (sorting_dimension_local.compare(... | 26.732394 | 80 | 0.620126 | roopchansinghv |
71dd3136da2779784f38d3e7e48498a500421044 | 899 | cpp | C++ | ojcpp/hht/015_kth_from_tail_list.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | 3 | 2019-05-04T03:26:02.000Z | 2019-08-29T01:20:44.000Z | ojcpp/hht/015_kth_from_tail_list.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | null | null | null | ojcpp/hht/015_kth_from_tail_list.cpp | softarts/oj | 2f51f360a7a6c49e865461755aec2f3a7e721b9e | [
"Apache-2.0"
] | null | null | null | //
// Created by rui.zhou on 5/6/2019.
//
#include <codech/codech_def.h>
using namespace std;
using namespace CODECH;
namespace {
class Solution {
public:
ListNode* findKth(ListNode *head,int k) {
ListNode *p1 = head;
ListNode *p2 = head;
if (k==0) return nullptr;
... | 23.051282 | 53 | 0.49277 | softarts |
71df9f81a9278723166d38b05e9e38d5014ee554 | 475 | cpp | C++ | leetcode-cpp/XOROperationinanArray_1486.cpp | emacslisp/cpp | 8230f81117d6f64adaa1696b0943cdb47505335a | [
"Apache-2.0"
] | null | null | null | leetcode-cpp/XOROperationinanArray_1486.cpp | emacslisp/cpp | 8230f81117d6f64adaa1696b0943cdb47505335a | [
"Apache-2.0"
] | null | null | null | leetcode-cpp/XOROperationinanArray_1486.cpp | emacslisp/cpp | 8230f81117d6f64adaa1696b0943cdb47505335a | [
"Apache-2.0"
] | null | null | null | #include<vector>
#include<iostream>
using namespace std;
class Solution {
public:
int xorOperation(int n, int start) {
vector<int> a(n);
for(int i=0;i<n;i++) {
a[i] = start + 2*i;
}
int x = a[0];
for(int i=1;i<n;i++) {
x ^= a[i];
}
... | 15.833333 | 42 | 0.465263 | emacslisp |
71dfb1c1d2b370433717364ae6a70d837f947e5e | 9,630 | cpp | C++ | uppsrc/HexView/HexView.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | 2 | 2016-04-07T07:54:26.000Z | 2020-04-14T12:37:34.000Z | uppsrc/HexView/HexView.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | null | null | null | uppsrc/HexView/HexView.cpp | dreamsxin/ultimatepp | 41d295d999f9ff1339b34b43c99ce279b9b3991c | [
"BSD-2-Clause"
] | null | null | null | #include "HexView.h"
NAMESPACE_UPP
#ifdef PLATFORM_WIN32
inline int FormatHexDigit(int c) {
return c < 10 ? c + '0' : c - 10 + 'a';
}
void FormatHex(char *buffer, int64 number, int n) {
buffer[n] = '\0';
while(n) {
buffer[--n] = FormatHexDigit((byte)number & 0x0f);
number >>= 4;
}
}
void HexViewInfo::Print... | 19.573171 | 94 | 0.569886 | dreamsxin |
71e06d25cb6c4cb43a9080e1acfb2b9511e0034e | 1,806 | cpp | C++ | 2018-2019_Term2/CSC3002-Programming_Paradigms/Course_Material/Week 3/04 Programs/PowersOfTwo/PowersOfTwo.cpp | Vito-Swift/CourseMaterials | f2799f004f4353b5f35226158c8fd9f71818810e | [
"MIT"
] | null | null | null | 2018-2019_Term2/CSC3002-Programming_Paradigms/Course_Material/Week 3/04 Programs/PowersOfTwo/PowersOfTwo.cpp | Vito-Swift/CourseMaterials | f2799f004f4353b5f35226158c8fd9f71818810e | [
"MIT"
] | null | null | null | 2018-2019_Term2/CSC3002-Programming_Paradigms/Course_Material/Week 3/04 Programs/PowersOfTwo/PowersOfTwo.cpp | Vito-Swift/CourseMaterials | f2799f004f4353b5f35226158c8fd9f71818810e | [
"MIT"
] | 2 | 2019-09-25T02:36:37.000Z | 2020-06-05T08:47:01.000Z | /*
* File: PowersOfTwo.cpp
* ---------------------
* This program generates a list of the powers of
* two up to an exponent limit entered by the user.
*/
#include <iostream>
#include <sstream>
#include <string>
#include <iomanip>
using namespace std;
/* Function prototypes */
int getInteger(string prompt);
int ... | 25.083333 | 67 | 0.608527 | Vito-Swift |
71e21a7d71ed77cc239111a19086c2570d797e32 | 3,728 | cpp | C++ | hal/src/driver/qt/epimage_qt.cpp | Euclideon/udshell | 795e2d832429c8e5e47196742afc4b452aa23ec3 | [
"MIT"
] | null | null | null | hal/src/driver/qt/epimage_qt.cpp | Euclideon/udshell | 795e2d832429c8e5e47196742afc4b452aa23ec3 | [
"MIT"
] | null | null | null | hal/src/driver/qt/epimage_qt.cpp | Euclideon/udshell | 795e2d832429c8e5e47196742afc4b452aa23ec3 | [
"MIT"
] | null | null | null | #include "driver.h"
#if EPIMAGE_DRIVER == EPDRIVER_QT
#include "hal/image.h"
#include <QImage>
#include <QImageReader>
#include <QBuffer>
void epImage_InitInternal()
{
}
void epImage_DeinitInternal()
{
}
epImageFormat ConvertQTImageFormatToEP(QImage::Format imageFormat)
{
switch (imageFormat)
{
case QImag... | 24.688742 | 129 | 0.720225 | Euclideon |
71e29fe3e2fab124ea2d209703403d9144b07590 | 18,789 | cpp | C++ | Src/media/NiceConnection.cpp | MrsZ/licode-windows | 578a779ddd200a7dbf5e84e0b5b0376c0c39827a | [
"MIT"
] | 60 | 2018-10-23T02:41:46.000Z | 2022-03-16T07:40:52.000Z | Src/media/NiceConnection.cpp | gupar/licode-windows | 578a779ddd200a7dbf5e84e0b5b0376c0c39827a | [
"MIT"
] | 3 | 2018-10-25T11:10:06.000Z | 2020-11-29T09:47:05.000Z | Src/media/NiceConnection.cpp | gupar/licode-windows | 578a779ddd200a7dbf5e84e0b5b0376c0c39827a | [
"MIT"
] | 46 | 2018-10-29T06:56:03.000Z | 2022-02-18T07:07:17.000Z | /*
* NiceConnection.cpp
*/
#include <nice/nice.h>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include "NiceConnection.h"
#include "SdpInfo.h"
using std::memcpy;
// If true (and configured properly below) erizo will generate relay candidates for itself
// MOSTLY USEFUL WHEN ERIZO ITSE... | 35.788571 | 120 | 0.685295 | MrsZ |
71e57b19baa1edddba9318d621d4734802662534 | 126 | cpp | C++ | src/file/file_system.cpp | clems4ever/myos | de1e05813ccc004e57ccc1727f41d65e844e7778 | [
"MIT"
] | null | null | null | src/file/file_system.cpp | clems4ever/myos | de1e05813ccc004e57ccc1727f41d65e844e7778 | [
"MIT"
] | null | null | null | src/file/file_system.cpp | clems4ever/myos | de1e05813ccc004e57ccc1727f41d65e844e7778 | [
"MIT"
] | 1 | 2020-02-25T17:04:12.000Z | 2020-02-25T17:04:12.000Z |
#include "file_system.h"
void FileSystem::openFile(int id)
{
return;
}
void FileSystem::closeFile(int id)
{
return;
}
| 7.875 | 34 | 0.68254 | clems4ever |
71e970b0385ff64f7666f9465940bafa94fa4c05 | 3,391 | cpp | C++ | questions/ui-process-update-31012449/main.cpp | SammyEnigma/stackoverflown | 0f70f2534918b2e65cec1046699573091d9a40b5 | [
"Unlicense"
] | 54 | 2015-09-13T07:29:52.000Z | 2022-03-16T07:43:50.000Z | questions/ui-process-update-31012449/main.cpp | SammyEnigma/stackoverflown | 0f70f2534918b2e65cec1046699573091d9a40b5 | [
"Unlicense"
] | null | null | null | questions/ui-process-update-31012449/main.cpp | SammyEnigma/stackoverflown | 0f70f2534918b2e65cec1046699573091d9a40b5 | [
"Unlicense"
] | 31 | 2016-08-26T13:35:01.000Z | 2022-03-13T16:43:12.000Z | #if 1
#include <QApplication>
#include <QGridLayout>
#include <QProcess>
#include <QLabel>
#include <QTimer>
#include <QTextStream>
#include <QRegExp>
#include <cstdio>
// QT 5, C++11
int main(int argc, char *argv[])
{
if (argc > 1) {
QCoreApplication app(argc, argv);
// output 3 random values per line... | 26.912698 | 110 | 0.624005 | SammyEnigma |
71efeb962cdec0a3b8a8e5b183162b74971fbcea | 558 | cpp | C++ | qir/qat/Rules/Patterns/AnyPattern.cpp | troelsfr/qat | 55ba460b6be307fc2ac7e8143bf14d7e117da161 | [
"MIT"
] | null | null | null | qir/qat/Rules/Patterns/AnyPattern.cpp | troelsfr/qat | 55ba460b6be307fc2ac7e8143bf14d7e117da161 | [
"MIT"
] | null | null | null | qir/qat/Rules/Patterns/AnyPattern.cpp | troelsfr/qat | 55ba460b6be307fc2ac7e8143bf14d7e117da161 | [
"MIT"
] | null | null | null | // Copyright (c) Microsoft Corporation.
// Licensed under the MIT License.
#include "Rules/IOperandPrototype.hpp"
#include "Rules/Patterns/AnyPattern.hpp"
namespace microsoft
{
namespace quantum
{
AnyPattern::AnyPattern() = default;
AnyPattern::~AnyPattern() = default;
bool AnyPattern::match(Value* inst... | 21.461538 | 66 | 0.68638 | troelsfr |
71f0a2f96e955c70479d6ea2c73fe6650449df67 | 3,076 | cpp | C++ | Code/System/Core/FileSystem/Platform/FileSystem_Win32.cpp | JuanluMorales/KRG | f3a11de469586a4ef0db835af4bc4589e6b70779 | [
"MIT"
] | 419 | 2022-01-27T19:37:43.000Z | 2022-03-31T06:14:22.000Z | Code/System/Core/FileSystem/Platform/FileSystem_Win32.cpp | jagt/KRG | ba20cd8798997b0450491b0cc04dc817c4a4bc76 | [
"MIT"
] | 2 | 2022-01-28T20:35:33.000Z | 2022-03-13T17:42:52.000Z | Code/System/Core/FileSystem/Platform/FileSystem_Win32.cpp | jagt/KRG | ba20cd8798997b0450491b0cc04dc817c4a4bc76 | [
"MIT"
] | 20 | 2022-01-27T20:41:02.000Z | 2022-03-26T16:16:57.000Z | #ifdef _WIN32
#include "../FileSystem.h"
#include "System/Core/Platform/PlatformHelpers_Win32.h"
#include "System/Core/Algorithm/Hash.h"
#include "System/Core/Math/Math.h"
#include <windows.h>
#include <shlwapi.h>
#include <shlobj.h>
#include <shellapi.h>
#include <fstream>
#include "../Time/Timers.h"
#i... | 31.71134 | 143 | 0.516255 | JuanluMorales |
71f37e064e4f31b9d0fed5724c98725d1715ef6f | 2,894 | hpp | C++ | include/nexus/quic/detail/connection_impl.hpp | cbodley/nexus | 6e5b19b6c6c74007a0643c55eb0775eb86e38f9b | [
"BSL-1.0"
] | 6 | 2021-10-31T10:33:30.000Z | 2022-03-25T20:54:58.000Z | include/nexus/quic/detail/connection_impl.hpp | cbodley/nexus | 6e5b19b6c6c74007a0643c55eb0775eb86e38f9b | [
"BSL-1.0"
] | null | null | null | include/nexus/quic/detail/connection_impl.hpp | cbodley/nexus | 6e5b19b6c6c74007a0643c55eb0775eb86e38f9b | [
"BSL-1.0"
] | null | null | null | #pragma once
#include <boost/intrusive/list.hpp>
#include <nexus/quic/detail/connection_state.hpp>
#include <nexus/quic/detail/service.hpp>
#include <nexus/quic/detail/stream_impl.hpp>
#include <nexus/udp.hpp>
struct lsquic_conn;
struct lsquic_stream;
namespace nexus::quic::detail {
struct accept_operation;
struct ... | 32.886364 | 81 | 0.701451 | cbodley |
71f582486aa97c49a2f0ffeb52f72f4fbc02860d | 1,099 | cpp | C++ | oi/homework/2015-9-26/4-7/main.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | 3 | 2018-08-30T09:43:20.000Z | 2019-12-03T04:53:43.000Z | oi/homework/2015-9-26/4-7/main.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | null | null | null | oi/homework/2015-9-26/4-7/main.cpp | Riteme/test | b511d6616a25f4ae8c3861e2029789b8ee4dcb8d | [
"BSD-Source-Code"
] | null | null | null | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAGIC_NUMBER 6174
void ReadDigits(int n,int digits[]){
for (int i=0;
i<4;
i++) {
digits[i]=n%10;
n/=10;
} // for
}
int MakeMaxNumber(int digits[],int n){
int tmp=0;
for (int i=n-1;
... | 15.263889 | 50 | 0.517743 | Riteme |
71f65b43654fd22565096dbb1c2584d29ee356b3 | 104 | hpp | C++ | redvoid/src/Logger.hpp | fictionalist/RED-VOID | 01bacd893f095748d784e494c80a6a9c96481acc | [
"MIT"
] | 1 | 2021-01-04T01:31:34.000Z | 2021-01-04T01:31:34.000Z | redvoid/src/Logger.hpp | fictionalist/RED-VOID | 01bacd893f095748d784e494c80a6a9c96481acc | [
"MIT"
] | null | null | null | redvoid/src/Logger.hpp | fictionalist/RED-VOID | 01bacd893f095748d784e494c80a6a9c96481acc | [
"MIT"
] | 1 | 2021-01-05T00:55:47.000Z | 2021-01-05T00:55:47.000Z | #pragma once
#include <string>
namespace Logger {
bool init();
void log(std::string pattern, ...);
} | 13 | 36 | 0.663462 | fictionalist |
71fa3188959942010b1f365a7c1f2e06b69a368c | 1,148 | hpp | C++ | graphExplorer/graphExplorer/lubySequence.hpp | fq00/lubySequenceEAs | 6a107de687b3c2e159c8486ccc7eb02385c351c6 | [
"MIT"
] | null | null | null | graphExplorer/graphExplorer/lubySequence.hpp | fq00/lubySequenceEAs | 6a107de687b3c2e159c8486ccc7eb02385c351c6 | [
"MIT"
] | null | null | null | graphExplorer/graphExplorer/lubySequence.hpp | fq00/lubySequenceEAs | 6a107de687b3c2e159c8486ccc7eb02385c351c6 | [
"MIT"
] | null | null | null | //
// lubySequence.hpp
// graphExplorer
//
// Created by Francesco Quinzan on 06.09.17.
// Copyright © 2017 Francesco Quinzan. All rights reserved.
//
#ifndef lubySequence_hpp
#define lubySequence_hpp
#include <vector>
#include <limits>
#include <thread>
#include "EA.hpp"
using namespace std;
/* overloaded vect... | 18.819672 | 81 | 0.587979 | fq00 |
9f95c942849cae822a980f8e016e7fb0726c9233 | 2,903 | cpp | C++ | tests/world/test_terrain.cpp | Bycob/world | c6d943f9029c1bb227891507e5c6fe2b94cecfeb | [
"MIT"
] | 16 | 2021-03-14T16:30:32.000Z | 2022-03-18T13:41:53.000Z | tests/world/test_terrain.cpp | Tzian/world | 3ebb33305acd2a751cf44099b07c1e5d47578194 | [
"MIT"
] | 1 | 2020-04-21T12:59:37.000Z | 2020-04-23T17:49:03.000Z | tests/world/test_terrain.cpp | Tzian/world | 3ebb33305acd2a751cf44099b07c1e5d47578194 | [
"MIT"
] | 4 | 2020-03-08T14:04:50.000Z | 2020-12-03T08:51:04.000Z | #include <catch/catch.hpp>
#include <world/core.h>
#include <world/terrain.h>
using namespace world;
TEST_CASE("Terrain - getExactHeightAt", "[terrain]") {
Terrain terrain(2);
terrain(0, 0) = 1;
terrain(0, 1) = 0;
terrain(1, 0) = 0;
terrain(1, 1) = 1;
SECTION("getExactHeightAt trivial coordi... | 31.554348 | 78 | 0.529452 | Bycob |
9f961d3d37347d99a083232bf2ce7b47d1265203 | 13,941 | hpp | C++ | tests/functional/coherence/util/ObservableMapTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-01T21:38:30.000Z | 2021-11-03T01:35:11.000Z | tests/functional/coherence/util/ObservableMapTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 1 | 2020-07-24T17:29:22.000Z | 2020-07-24T18:29:04.000Z | tests/functional/coherence/util/ObservableMapTest.hpp | chpatel3/coherence-cpp-extend-client | 4ea5267eae32064dff1e73339aa3fbc9347ef0f6 | [
"UPL-1.0",
"Apache-2.0"
] | 6 | 2020-07-10T18:40:58.000Z | 2022-02-18T01:23:40.000Z | /*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates.
*
* Licensed under the Universal Permissive License v 1.0 as shown at
* http://oss.oracle.com/licenses/upl.
*/
#include "cxxtest/TestSuite.h"
#include "common/TestUtils.hpp"
#include "mock/CommonMocks.hpp"
#include "coherence/lang.ns"
#include "coherenc... | 42.895385 | 94 | 0.604476 | chpatel3 |
9f9d603d223a3b2ba4227fcc361817e9598ffb05 | 3,001 | hpp | C++ | Support/Modules/Brep/NurbsFace.hpp | graphisoft-python/TextEngine | 20c2ff53877b20fdfe2cd51ce7abdab1ff676a70 | [
"Apache-2.0"
] | 3 | 2019-07-15T10:54:54.000Z | 2020-01-25T08:24:51.000Z | Support/Modules/Brep/NurbsFace.hpp | graphisoft-python/GSRoot | 008fac2c6bf601ca96e7096705e25b10ba4d3e75 | [
"Apache-2.0"
] | null | null | null | Support/Modules/Brep/NurbsFace.hpp | graphisoft-python/GSRoot | 008fac2c6bf601ca96e7096705e25b10ba4d3e75 | [
"Apache-2.0"
] | 1 | 2020-09-26T03:17:22.000Z | 2020-09-26T03:17:22.000Z | // *********************************************************************************************************************
// Data structure that represents one face of a NurbsBRep object.
//
// Note. All indices refer to containing NurbsBRep, starting from 0.
// *********************************************************... | 35.305882 | 120 | 0.64945 | graphisoft-python |
9f9f756378eafc8bf3696f73173f696477861477 | 11,741 | cc | C++ | common/src/LockOrderChecker.cc | liuxiang88/core-alljoyn | 549c966482d9b89da84aa528117584e7049916cb | [
"Apache-2.0"
] | 33 | 2018-01-12T00:37:43.000Z | 2022-03-24T02:31:36.000Z | common/src/LockOrderChecker.cc | liuxiang88/core-alljoyn | 549c966482d9b89da84aa528117584e7049916cb | [
"Apache-2.0"
] | 1 | 2020-01-05T05:51:27.000Z | 2020-01-05T05:51:27.000Z | common/src/LockOrderChecker.cc | liuxiang88/core-alljoyn | 549c966482d9b89da84aa528117584e7049916cb | [
"Apache-2.0"
] | 30 | 2017-12-13T23:24:00.000Z | 2022-01-25T02:11:19.000Z | /**
* @file
*
* Class implementing sanity checks for Mutex objects.
*/
/******************************************************************************
* Copyright (c) Open Connectivity Foundation (OCF), AllJoyn Open Source
* Project (AJOSP) Contributors and others.
*
* SPDX-License-Identifier: Apache-... | 36.015337 | 161 | 0.659399 | liuxiang88 |
9fa0c153fc675b4efb68ca66ef5bc763a8c62a69 | 582 | cpp | C++ | engine/src/awesome/editor/menu_items/save_scene_as_menu_item.cpp | vitodtagliente/AwesomeEngine | eff06dbad1c4a168437f69800629a7e20619051c | [
"MIT"
] | 3 | 2019-08-15T18:57:20.000Z | 2020-01-09T22:19:26.000Z | engine/src/awesome/editor/menu_items/save_scene_as_menu_item.cpp | vitodtagliente/AwesomeEngine | eff06dbad1c4a168437f69800629a7e20619051c | [
"MIT"
] | null | null | null | engine/src/awesome/editor/menu_items/save_scene_as_menu_item.cpp | vitodtagliente/AwesomeEngine | eff06dbad1c4a168437f69800629a7e20619051c | [
"MIT"
] | null | null | null | #include "save_scene_as_menu_item.h"
#include <awesome/data/archive.h>
#include <awesome/asset/asset.h>
#include <awesome/encoding/json.h>
#include <awesome/entity/world.h>
namespace editor
{
void SaveSceneAsMenuItem::render()
{
m_saveFileDialog.render();
}
void SaveSceneAsMenuItem::execute()
{
m_saveFileDi... | 20.785714 | 136 | 0.69244 | vitodtagliente |
9fa2031d57d6c5f85b382ff0dc8dda2ef87ab0b6 | 62,842 | cpp | C++ | java/jcl/src/native/harmony/org_apache_harmony_luni_platform_OSNetworkSystem.cpp | webos21/xi | 496d636232183c4cc4ec25ab45f6ee25d5eeaf43 | [
"Apache-2.0"
] | 1 | 2018-09-25T10:56:25.000Z | 2018-09-25T10:56:25.000Z | java/jcl/src/native/harmony/org_apache_harmony_luni_platform_OSNetworkSystem.cpp | webos21/xi | 496d636232183c4cc4ec25ab45f6ee25d5eeaf43 | [
"Apache-2.0"
] | 2 | 2021-04-07T00:18:48.000Z | 2021-04-07T00:20:08.000Z | java/jcl/src/native/harmony/org_apache_harmony_luni_platform_OSNetworkSystem.cpp | webos21/xi | 496d636232183c4cc4ec25ab45f6ee25d5eeaf43 | [
"Apache-2.0"
] | 1 | 2017-10-26T23:20:32.000Z | 2017-10-26T23:20:32.000Z | /*
* Copyright (C) 2007 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 appl... | 33.895361 | 160 | 0.708173 | webos21 |
9fa23845bd9ae69dfeeb888d6b0af48eb27c2ade | 2,329 | cpp | C++ | training/POJ/2923.cpp | voleking/ICPC | fc2cf408fa2607ad29b01eb00a1a212e6d0860a5 | [
"MIT"
] | 68 | 2017-10-08T04:44:23.000Z | 2019-08-06T20:15:02.000Z | training/POJ/2923.cpp | voleking/ICPC | fc2cf408fa2607ad29b01eb00a1a212e6d0860a5 | [
"MIT"
] | null | null | null | training/POJ/2923.cpp | voleking/ICPC | fc2cf408fa2607ad29b01eb00a1a212e6d0860a5 | [
"MIT"
] | 18 | 2017-05-31T02:52:23.000Z | 2019-07-05T09:18:34.000Z | #include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <complex>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack... | 24.010309 | 92 | 0.502362 | voleking |
9fa77f7f0f4bb47b995986a46df2dc868c12fe62 | 16,389 | cpp | C++ | Source/Lutefisk3D/Graphics/Technique.cpp | Lutefisk3D/lutefisk3d | d2132b82003427511df0167f613905191b006eb5 | [
"Apache-2.0"
] | 2 | 2018-04-14T19:05:23.000Z | 2020-05-10T22:42:12.000Z | Source/Lutefisk3D/Graphics/Technique.cpp | Lutefisk3D/lutefisk3d | d2132b82003427511df0167f613905191b006eb5 | [
"Apache-2.0"
] | 4 | 2015-06-19T22:32:07.000Z | 2017-04-05T06:01:50.000Z | Source/Lutefisk3D/Graphics/Technique.cpp | nemerle/lutefisk3d | d2132b82003427511df0167f613905191b006eb5 | [
"Apache-2.0"
] | 1 | 2015-12-27T15:36:10.000Z | 2015-12-27T15:36:10.000Z | //
// Copyright (c) 2008-2017 the Urho3D project.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, m... | 30.981096 | 159 | 0.680273 | Lutefisk3D |
9fa93990b20b2cb38fe1fcc5b1e486af5ec33b49 | 906 | cpp | C++ | src/engine/ui/src/ui/widgets/ui_gamepad_image.cpp | code-disaster/halley | 5c85c889b76c69c6bdef6f4801c6aba282b7af80 | [
"Apache-2.0"
] | 3,262 | 2016-04-10T15:24:10.000Z | 2022-03-31T17:47:08.000Z | src/engine/ui/src/ui/widgets/ui_gamepad_image.cpp | code-disaster/halley | 5c85c889b76c69c6bdef6f4801c6aba282b7af80 | [
"Apache-2.0"
] | 53 | 2016-10-09T16:25:04.000Z | 2022-01-10T13:52:37.000Z | src/engine/ui/src/ui/widgets/ui_gamepad_image.cpp | code-disaster/halley | 5c85c889b76c69c6bdef6f4801c6aba282b7af80 | [
"Apache-2.0"
] | 193 | 2017-10-23T06:08:41.000Z | 2022-03-22T12:59:58.000Z | #include "halley/ui/widgets/ui_gamepad_image.h"
using namespace Halley;
UIGamepadImage::UIGamepadImage(UIStyle style, JoystickButtonPosition button, std::function<Sprite(JoystickButtonPosition, JoystickType)> iconRetriever, Colour4f col)
: UIImage(Sprite())
, style(style)
, button(button)
, iconRetriever(std::mov... | 25.166667 | 165 | 0.758278 | code-disaster |
9fab6047b372e0878f52e5aaa59da9c9b6b8641e | 1,777 | cpp | C++ | cpp/A0153/main.cpp | Modnars/LeetCode | 1c91fe9598418e6ed72233260f9cd8d5737fe216 | [
"Apache-2.0"
] | 2 | 2021-11-26T14:06:13.000Z | 2021-11-26T14:34:34.000Z | cpp/A0153/main.cpp | Modnars/LeetCode | 1c91fe9598418e6ed72233260f9cd8d5737fe216 | [
"Apache-2.0"
] | 2 | 2021-11-26T14:06:49.000Z | 2021-11-28T11:28:49.000Z | cpp/A0153/main.cpp | Modnars/LeetCode | 1c91fe9598418e6ed72233260f9cd8d5737fe216 | [
"Apache-2.0"
] | null | null | null | // URL : https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
// Author : Modnar
// Date : 2020/03/14
// Thanks : armeria(@leetcode.cn)
#include <bits/stdc++.h>
/* ************************* */
/**
* 暴力搜索
* 直接遍历，获取最小元素即可。
* 本题存在一个简单优化，当发现某两个值之间发生“递减”，则可直接返回最小值。
*/
// Complexity: Tim... | 26.924242 | 147 | 0.517727 | Modnars |
9facdcebcc915c60cb029d28b96f99e5c8339ebd | 10,445 | cpp | C++ | simplemd/molecule-mappings/VelocityStoermerVerletMapping.cpp | HSU-HPC/MaMiCo | d6f8597bd41ac3a5d3929c5eb4f7ecbc1b80e2ee | [
"BSD-4-Clause"
] | 6 | 2021-02-06T17:21:10.000Z | 2022-01-27T21:36:55.000Z | simplemd/molecule-mappings/VelocityStoermerVerletMapping.cpp | HSU-HPC/MaMiCo | d6f8597bd41ac3a5d3929c5eb4f7ecbc1b80e2ee | [
"BSD-4-Clause"
] | 1 | 2021-06-24T15:17:46.000Z | 2021-06-25T11:54:52.000Z | simplemd/molecule-mappings/VelocityStoermerVerletMapping.cpp | HSU-HPC/MaMiCo | d6f8597bd41ac3a5d3929c5eb4f7ecbc1b80e2ee | [
"BSD-4-Clause"
] | 6 | 2021-12-16T11:39:24.000Z | 2022-03-28T07:00:30.000Z | // Copyright (C) 2015 Technische Universitaet Muenchen
// This file is part of the Mamico project. For conditions of distribution
// and use, please see the copyright notice in Mamico's main folder, or at
// www5.in.tum.de/mamico
#include "simplemd/molecule-mappings/VelocityStoermerVerletMapping.h"
simplemd::moleculem... | 55.558511 | 198 | 0.684442 | HSU-HPC |
9fb0b2bd4169c0347f4c5c58708b5fc551f12dbe | 12,100 | cc | C++ | test/common/t__xdrbuf.cc | codesloop/codesloop | d66e51c2d898a72624306f611a90364c76deed06 | [
"BSD-2-Clause"
] | 3 | 2016-05-09T15:29:29.000Z | 2017-11-22T06:16:18.000Z | test/common/t__xdrbuf.cc | codesloop/codesloop | d66e51c2d898a72624306f611a90364c76deed06 | [
"BSD-2-Clause"
] | null | null | null | test/common/t__xdrbuf.cc | codesloop/codesloop | d66e51c2d898a72624306f611a90364c76deed06 | [
"BSD-2-Clause"
] | null | null | null | /*
Copyright (c) 2008,2009,2010, CodeSLoop Team
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 following disclaim... | 23.495146 | 105 | 0.594215 | codesloop |
9fb10a609bba3beeed23f82451423f8c42959681 | 1,227 | cpp | C++ | _includes/leet310/leet310_1.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | null | null | null | _includes/leet310/leet310_1.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | 8 | 2019-12-19T04:46:05.000Z | 2022-02-26T03:45:22.000Z | _includes/leet310/leet310_1.cpp | mingdaz/leetcode | 64f2e5ad0f0446d307e23e33a480bad5c9e51517 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
vector<int> vec[n+1];
int degree[n+1];
for(int i=0;i<=n;i++)
degree[i]=0;
for(int i=0;i<n-1;i++){
int a=edges[i].first;
int b=edges[i... | 24.54 | 74 | 0.354523 | mingdaz |
9fb38af70a117431bbc2af22d78c136261cc0063 | 1,656 | cpp | C++ | src/http/http_request.cpp | Mojiajun/tinyreactor | 94adab8941b1d4cf46297adec9f14d7ce26c44d8 | [
"MIT"
] | 1 | 2020-10-19T07:57:32.000Z | 2020-10-19T07:57:32.000Z | src/http/http_request.cpp | Mojiajun/tinyreactor | 94adab8941b1d4cf46297adec9f14d7ce26c44d8 | [
"MIT"
] | null | null | null | src/http/http_request.cpp | Mojiajun/tinyreactor | 94adab8941b1d4cf46297adec9f14d7ce26c44d8 | [
"MIT"
] | null | null | null | //
// Created by mojiajun on 2020/3/6.
//
#include "http_request.h"
using namespace tinyreactor;
bool HttpRequest::setMethod(const char *start, const char *end) {
assert(method_ == kInvalid);
std::string m(start, end);
if (m == "GET") {
method_ = kGet;
} else if (m == "POST") {
method_... | 25.090909 | 84 | 0.551329 | Mojiajun |
9fb3953228e99b21cb2bf39dc0a6ec9819a8d14a | 7,885 | hpp | C++ | include/veriblock/blockchain/pop/vbk_block_tree.hpp | Dmytro-Kyparenko/alt-integration-cpp | df18abdd4bfeec757c2df47efcaf4020d78880bb | [
"MIT"
] | null | null | null | include/veriblock/blockchain/pop/vbk_block_tree.hpp | Dmytro-Kyparenko/alt-integration-cpp | df18abdd4bfeec757c2df47efcaf4020d78880bb | [
"MIT"
] | null | null | null | include/veriblock/blockchain/pop/vbk_block_tree.hpp | Dmytro-Kyparenko/alt-integration-cpp | df18abdd4bfeec757c2df47efcaf4020d78880bb | [
"MIT"
] | null | null | null | // Copyright (c) 2019-2020 Xenios SEZC
// https://www.veriblock.org
// Distributed under the MIT software license, see the accompanying
// file LICENSE or http://www.opensource.org/licenses/mit-license.php.
#ifndef ALT_INTEGRATION_INCLUDE_VERIBLOCK_BLOCKCHAIN_VBK_BLOCK_TREE_HPP_
#define ALT_INTEGRATION_INCLUDE_VERIBLO... | 36.674419 | 79 | 0.703361 | Dmytro-Kyparenko |
9fb731856a125135c016f17bbb1a3b5b94706faa | 1,226 | cpp | C++ | src/Selections/QCDNonIsolatedElectronSelection.cpp | jjacob/AnalysisSoftware | 670513bcde9c3df46077f906246e912627ee251a | [
"Apache-2.0"
] | null | null | null | src/Selections/QCDNonIsolatedElectronSelection.cpp | jjacob/AnalysisSoftware | 670513bcde9c3df46077f906246e912627ee251a | [
"Apache-2.0"
] | null | null | null | src/Selections/QCDNonIsolatedElectronSelection.cpp | jjacob/AnalysisSoftware | 670513bcde9c3df46077f906246e912627ee251a | [
"Apache-2.0"
] | null | null | null | /*
* QCDNonIsolatedElectronSelection.cpp
*
* Created on: 12 Apr 2012
* Author: kreczko
*/
#include "../../interface/Selections/QCDNonIsolatedElectronSelection.h"
namespace BAT {
QCDNonIsolatedElectronSelection::QCDNonIsolatedElectronSelection(unsigned int numberOfSelectionSteps) :
QCDPFRelIsoEPlusJetsSe... | 30.65 | 103 | 0.769168 | jjacob |
9fba761eaa4b2b6b753a3ee83261dc2a82e8e602 | 11,030 | cc | C++ | pycpp/compression/gzip.cc | Alexhuszagh/funxx | 9f6c1fae92d96a84282fc62be272f4dc1e1dba9b | [
"MIT",
"BSD-3-Clause"
] | 1 | 2017-07-21T22:58:38.000Z | 2017-07-21T22:58:38.000Z | pycpp/compression/gzip.cc | Alexhuszagh/funxx | 9f6c1fae92d96a84282fc62be272f4dc1e1dba9b | [
"MIT",
"BSD-3-Clause"
] | null | null | null | pycpp/compression/gzip.cc | Alexhuszagh/funxx | 9f6c1fae92d96a84282fc62be272f4dc1e1dba9b | [
"MIT",
"BSD-3-Clause"
] | null | null | null | // :copyright: (c) 2017 Alex Huszagh.
// :license: MIT, see licenses/mit.md for more details.
#if defined(HAVE_ZLIB)
// This module is basically identical to zlib,
// so just include the private error handling.
#include <pycpp/compression/zlib.cc>
#include <pycpp/compression/gzip.h>
#include <pycpp/preprocessor/byt... | 23.221053 | 118 | 0.63427 | Alexhuszagh |
9fc070a77f05979a683d6d8f19821838d8eaadd8 | 402 | hpp | C++ | day10/los.hpp | bcafuk/AoC-2019 | 5ff9b86f8483cd7a6e229d572ae9e34b894eb574 | [
"Zlib"
] | null | null | null | day10/los.hpp | bcafuk/AoC-2019 | 5ff9b86f8483cd7a6e229d572ae9e34b894eb574 | [
"Zlib"
] | null | null | null | day10/los.hpp | bcafuk/AoC-2019 | 5ff9b86f8483cd7a6e229d572ae9e34b894eb574 | [
"Zlib"
] | 2 | 2020-11-02T09:24:35.000Z | 2020-12-02T09:46:27.000Z | #ifndef AOC_2019_DAY10_LOS_HPP
#define AOC_2019_DAY10_LOS_HPP
#include <cstddef>
#include <set>
#include "Location.hpp"
std::set<Location> getVisible(const std::set<Location> &asteroids, const Location &origin, coordinate size);
inline size_t countVisible(const std::set<Location> &asteroids, const Location &origin,... | 25.125 | 108 | 0.776119 | bcafuk |
9fc096f1b782929bb005ffc810f315613fd61a44 | 2,236 | cpp | C++ | src/ImageDataWebP.cpp | jhasse/jngl | 1aab1bb5b9712eca50786418d44e9559373441a8 | [
"Zlib"
] | 61 | 2015-09-30T14:42:38.000Z | 2022-03-30T13:56:54.000Z | src/ImageDataWebP.cpp | jhasse/jngl | 1aab1bb5b9712eca50786418d44e9559373441a8 | [
"Zlib"
] | 57 | 2016-08-10T19:28:36.000Z | 2022-03-15T07:18:00.000Z | src/ImageDataWebP.cpp | jhasse/jngl | 1aab1bb5b9712eca50786418d44e9559373441a8 | [
"Zlib"
] | 3 | 2021-12-14T18:08:56.000Z | 2022-02-23T08:29:19.000Z | // Copyright 2021 Jan Niklas Hasse <jhasse@bixense.com>
// For conditions of distribution and use, see copyright notice in LICENSE.txt
#ifndef NOWEBP
#include "ImageDataWebP.hpp"
#include <boost/math/special_functions/round.hpp>
#include <future>
#include <thread>
#include <vector>
namespace jngl {
ImageDataWebP::Im... | 25.409091 | 93 | 0.706172 | jhasse |
9fc0ab3bd2d8693cef845cc80c3064733410334d | 445 | cpp | C++ | SKYLINE.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2019-05-23T20:03:40.000Z | 2019-05-23T20:03:40.000Z | SKYLINE.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | null | null | null | SKYLINE.cpp | Akki5/spoj-solutions | 9169830415eb4f888ba0300eb47a423166b8d938 | [
"MIT"
] | 1 | 2021-08-28T16:48:42.000Z | 2021-08-28T16:48:42.000Z | #include<stdio.h>
int arr[1005][1005]={{0}};
void catalan()
{
int i,j;
for(i=0;i<1005;i++)
{
for(j=0;j<=i;j++)
{
if(j==0)
arr[i][j]=1;
else
arr[i][j]=(arr[i][j-1]+arr[i-1][j])%1000000;
}
}
}
int main()
{
catalan();
i... | 15.344828 | 60 | 0.357303 | Akki5 |
9fc1608f0ef16a533eeb38a1a847e6cc9fe70607 | 1,473 | cpp | C++ | 890. Find and Replace Pattern.cpp | rajeev-ranjan-au6/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | 3 | 2020-12-30T00:29:59.000Z | 2021-01-24T22:43:04.000Z | 890. Find and Replace Pattern.cpp | rajeevranjancom/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | null | null | null | 890. Find and Replace Pattern.cpp | rajeevranjancom/Leetcode_Cpp | f64cd98ab96ec110f1c21393f418acf7d88473e8 | [
"MIT"
] | null | null | null | class Solution {
public:
vector<string> findAndReplacePattern(vector<string>& words, string pattern) {
vector<string>res;
for (auto& s: words) {
if (isValid(s, pattern)) {
res.push_back(s);
}
}
return res;
}
bool isValid(string& a,... | 23.758065 | 81 | 0.395791 | rajeev-ranjan-au6 |
9fc1d4d7fa89f2790b17bd8b59789645edc8221b | 41,199 | cpp | C++ | src/vehicle_status.cpp | PX4/micrortps_agent | f7fee30b4a88d0627b2f92ca141277ace1a13597 | [
"BSD-3-Clause"
] | 3 | 2020-11-14T08:35:19.000Z | 2022-01-25T05:21:14.000Z | src/vehicle_status.cpp | PX4/micrortps_agent | f7fee30b4a88d0627b2f92ca141277ace1a13597 | [
"BSD-3-Clause"
] | 1 | 2021-06-10T11:41:17.000Z | 2021-06-10T11:41:17.000Z | src/vehicle_status.cpp | PX4/micrortps_agent | f7fee30b4a88d0627b2f92ca141277ace1a13597 | [
"BSD-3-Clause"
] | 2 | 2020-10-13T08:16:05.000Z | 2021-06-03T05:57:31.000Z | // Copyright 2016 Proyectos y Sistemas de Mantenimiento SL (eProsima).
//
// 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 re... | 26.822266 | 101 | 0.767446 | PX4 |
9fc2c2a7f7a214ab9d6c5787343529ed720c8d07 | 36 | cpp | C++ | Software/CPU/myscrypt/build/cmake-3.12.3/Tests/CompileFeatures/cxx_alignas.cpp | duonglvtnaist/Multi-ROMix-Scrypt-Accelerator | 9cb9d96c72c3e912fb7cfd5a786e50e4844a1ee8 | [
"MIT"
] | 107 | 2021-08-28T20:08:42.000Z | 2022-03-22T08:02:16.000Z | Software/CPU/myscrypt/build/cmake-3.12.3/Tests/CompileFeatures/cxx_alignas.cpp | duonglvtnaist/Multi-ROMix-Scrypt-Accelerator | 9cb9d96c72c3e912fb7cfd5a786e50e4844a1ee8 | [
"MIT"
] | 3 | 2021-09-08T02:18:00.000Z | 2022-03-12T00:39:44.000Z | Software/CPU/myscrypt/build/cmake-3.12.3/Tests/CompileFeatures/cxx_alignas.cpp | duonglvtnaist/Multi-ROMix-Scrypt-Accelerator | 9cb9d96c72c3e912fb7cfd5a786e50e4844a1ee8 | [
"MIT"
] | 16 | 2021-08-30T06:57:36.000Z | 2022-03-22T08:05:52.000Z |
struct S1
{
alignas(8) int n;
};
| 6 | 19 | 0.555556 | duonglvtnaist |
9fc323305aff865969d7b9c2ee63bd7009a1c554 | 4,413 | cpp | C++ | src/wire/wire2lua/lua_source_stream.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 5 | 2016-04-07T19:49:39.000Z | 2021-08-03T05:24:11.000Z | src/wire/wire2lua/lua_source_stream.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | null | null | null | src/wire/wire2lua/lua_source_stream.cpp | zmij/wire | 9981eb9ea182fc49ef7243eed26b9d37be70a395 | [
"Artistic-2.0"
] | 1 | 2020-12-27T11:47:31.000Z | 2020-12-27T11:47:31.000Z | /*
* lua_source_stream.cpp
*
* Created on: Nov 23, 2017
* Author: zmij
*/
#include <wire/idl/generator.hpp>
#include <wire/idl/syntax_error.hpp>
#include <wire/wire2lua/lua_source_stream.hpp>
#include <iomanip>
namespace wire {
namespace idl {
namespace lua {
namespace {
::std::string const autogenerate... | 30.434483 | 109 | 0.469748 | zmij |
9fc4485039011f4bd14e9b94b527b57e8878848e | 3,077 | cpp | C++ | src/GBuffer.cpp | NotCamelCase/JBIC | 6304678696b65f66c560ecea91a52b5a1f528a7c | [
"MIT"
] | 5 | 2015-07-24T14:32:09.000Z | 2021-06-13T18:02:52.000Z | src/GBuffer.cpp | NotCamelCase/JBIC | 6304678696b65f66c560ecea91a52b5a1f528a7c | [
"MIT"
] | null | null | null | src/GBuffer.cpp | NotCamelCase/JBIC | 6304678696b65f66c560ecea91a52b5a1f528a7c | [
"MIT"
] | 1 | 2020-09-03T23:30:41.000Z | 2020-09-03T23:30:41.000Z | #include <GBuffer.h>
#include <Scene.h>
GBuffer::GBuffer(Scene* scene, GLuint texUnit)
: m_texUnitStart(texUnit), m_fbo(0), m_scene(scene)
{
assert(fillGBuffer() && "Error creating GBuffer content!");
}
GBuffer::~GBuffer()
{
glDeleteFramebuffers(1, &m_fbo);
}
bool GBuffer::fillGBuffer()
{
glGenFramebuffers(1, &... | 35.367816 | 130 | 0.809555 | NotCamelCase |
9fc644cb8aa87a0f9107502f02bc0d85ec21aa35 | 1,299 | cpp | C++ | Heap/K_Sorted_Array.cpp | susantabiswas/placementPrep | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | [
"MIT"
] | 19 | 2018-12-02T05:59:44.000Z | 2021-07-24T14:11:54.000Z | Heap/K_Sorted_Array.cpp | susantabiswas/placementPrep | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | [
"MIT"
] | null | null | null | Heap/K_Sorted_Array.cpp | susantabiswas/placementPrep | 22a7574206ddc63eba89517f7b68a3d2f4d467f5 | [
"MIT"
] | 13 | 2019-04-25T16:20:00.000Z | 2021-09-06T19:50:04.000Z | //given an array which is k sorted that means all the elements are atmost 'k'
//distance far from where they should be if they would have been sorted
//sort the array
/*
using heap:
take first 'k' elements and then heapify it
now for i = k to n-1 :
pop min from heap and insert arr[i] into heap
do this for th... | 21.65 | 84 | 0.639723 | susantabiswas |
9fcf670e1f4b22da78554e8d65612f76447fca22 | 8,609 | cc | C++ | src/GRPCClient.cc | mkaguilera/mvtx | 9e5e099a11131351b79aadea77ee5920100c352a | [
"BSD-2-Clause"
] | null | null | null | src/GRPCClient.cc | mkaguilera/mvtx | 9e5e099a11131351b79aadea77ee5920100c352a | [
"BSD-2-Clause"
] | null | null | null | src/GRPCClient.cc | mkaguilera/mvtx | 9e5e099a11131351b79aadea77ee5920100c352a | [
"BSD-2-Clause"
] | null | null | null | /*
* GRPCClient.cc
*
* Created on: Jun 7, 2016
* Author: theo
*/
#include <cassert>
#include <unistd.h>
#include "GRPCClient.h"
GRPCClient::RequestHandler::RequestHandler(GRPCClient *grpc_client, const std::string &addr)
: _grpc_client(grpc_client), _addr(addr) {}
GRPCClient::RequestHandler::~RequestH... | 30.856631 | 120 | 0.66988 | mkaguilera |
9fd9ac4012c5ab9d5add284d0b4e1f424c723443 | 10,195 | cc | C++ | src/test/admin_socket.cc | rpratap-bot/ceph | 9834961a66927ae856935591f2fd51082e2ee484 | [
"MIT"
] | 4 | 2020-04-08T03:42:02.000Z | 2020-10-01T20:34:48.000Z | src/test/admin_socket.cc | rpratap-bot/ceph | 9834961a66927ae856935591f2fd51082e2ee484 | [
"MIT"
] | 93 | 2020-03-26T14:29:14.000Z | 2020-11-12T05:54:55.000Z | src/test/admin_socket.cc | rpratap-bot/ceph | 9834961a66927ae856935591f2fd51082e2ee484 | [
"MIT"
] | 23 | 2020-03-24T10:28:44.000Z | 2020-09-24T09:42:19.000Z | // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2011 New Dream Network
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License ... | 32.365079 | 135 | 0.670917 | rpratap-bot |
9fda21634fe05289b2f757b3c3960e17085a5c27 | 453 | cc | C++ | src/kafka/kafka_handle.cc | Lanceolata/log2hdfs | 1ea1b572567dbe1e65f4134849b1970f21baf741 | [
"MIT"
] | null | null | null | src/kafka/kafka_handle.cc | Lanceolata/log2hdfs | 1ea1b572567dbe1e65f4134849b1970f21baf741 | [
"MIT"
] | null | null | null | src/kafka/kafka_handle.cc | Lanceolata/log2hdfs | 1ea1b572567dbe1e65f4134849b1970f21baf741 | [
"MIT"
] | null | null | null | // Copyright (c) 2017 Lanceolata
#include "kafka/kafka_handle.h"
namespace log2hdfs {
std::shared_ptr<KafkaHandle> KafkaHandle::Init(rd_kafka_t* rk) {
if (!rk)
return nullptr;
return std::make_shared<KafkaHandle>(rk);
}
const std::string KafkaHandle::MemberId() const {
char* str = rd_kafka_memberid(rk_);
... | 20.590909 | 64 | 0.693157 | Lanceolata |
9fdb04ad6e1367b30414caaaf5a1d4ffbcdc5487 | 4,076 | cpp | C++ | mozilla/gfx/layers/basic/TextureClientX11.cpp | naver/webgraphics | 4f9b9aa6a13428b5872dd020eaf34ec77b33f240 | [
"MS-PL"
] | 5 | 2016-12-20T15:48:05.000Z | 2020-05-01T20:12:09.000Z | mozilla/gfx/layers/basic/TextureClientX11.cpp | naver/webgraphics | 4f9b9aa6a13428b5872dd020eaf34ec77b33f240 | [
"MS-PL"
] | null | null | null | mozilla/gfx/layers/basic/TextureClientX11.cpp | naver/webgraphics | 4f9b9aa6a13428b5872dd020eaf34ec77b33f240 | [
"MS-PL"
] | 2 | 2016-12-20T15:48:13.000Z | 2019-12-10T15:15:05.000Z | /* -*- Mode: C++; tab-width: 20; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// * This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "mozilla/layers/TextureCl... | 27.917808 | 104 | 0.686212 | naver |
9fdb09273c63226f542a55c84cc12ba9588c67ce | 2,924 | hpp | C++ | Includes/Rosetta/PlayMode/Managers/CostManager.hpp | Hearthstonepp/Hearthstonepp | ee17ae6de1ee0078dab29d75c0fbe727a14e850e | [
"MIT"
] | 62 | 2017-08-21T14:11:00.000Z | 2018-04-23T16:09:02.000Z | Includes/Rosetta/PlayMode/Managers/CostManager.hpp | Hearthstonepp/Hearthstonepp | ee17ae6de1ee0078dab29d75c0fbe727a14e850e | [
"MIT"
] | 37 | 2017-08-21T11:13:07.000Z | 2018-04-30T08:58:41.000Z | Includes/Rosetta/PlayMode/Managers/CostManager.hpp | Hearthstonepp/Hearthstonepp | ee17ae6de1ee0078dab29d75c0fbe727a14e850e | [
"MIT"
] | 10 | 2017-08-21T03:44:12.000Z | 2018-01-10T22:29:10.000Z | // This code is based on Sabberstone project.
// Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva
// RosettaStone is hearthstone simulator using C++ with reinforcement learning.
// Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon
#ifndef ROSETTASTONE_PLAYMODE_COST_MANAGER_HPP
#define ROSETTA... | 35.228916 | 79 | 0.718194 | Hearthstonepp |
9fe4b95874e619cc13b8b9eac6346a531f84b57b | 4,209 | cxx | C++ | src/AcdCalib.cxx | fermi-lat/AcdUtil | 0fc8537ebc7c90dec9cb4a72e1ee274b78dd1b09 | [
"BSD-3-Clause"
] | null | null | null | src/AcdCalib.cxx | fermi-lat/AcdUtil | 0fc8537ebc7c90dec9cb4a72e1ee274b78dd1b09 | [
"BSD-3-Clause"
] | null | null | null | src/AcdCalib.cxx | fermi-lat/AcdUtil | 0fc8537ebc7c90dec9cb4a72e1ee274b78dd1b09 | [
"BSD-3-Clause"
] | null | null | null | #include "../AcdUtil/AcdCalib.h"
#include "CalibData/Acd/AcdPed.h"
#include "CalibData/Acd/AcdGain.h"
#include "CalibData/Acd/AcdVeto.h"
#include "CalibData/Acd/AcdCno.h"
#include "CalibData/Acd/AcdRange.h"
#include "CalibData/Acd/AcdHighRange.h"
#include "CalibData/Acd/AcdCoherentNoise.h"
#include "CalibData/Acd/AcdR... | 40.471154 | 146 | 0.665954 | fermi-lat |
9fe9571953e4d4146a418a8b4c8819d9753e8af5 | 2,374 | hpp | C++ | Aha/Aha/Math/Color.hpp | templateguy/aha | 8965f3dfa318a8ee02e38fa082bbc5c8c6afa100 | [
"MIT"
] | null | null | null | Aha/Aha/Math/Color.hpp | templateguy/aha | 8965f3dfa318a8ee02e38fa082bbc5c8c6afa100 | [
"MIT"
] | null | null | null | Aha/Aha/Math/Color.hpp | templateguy/aha | 8965f3dfa318a8ee02e38fa082bbc5c8c6afa100 | [
"MIT"
] | 1 | 2018-04-27T05:48:41.000Z | 2018-04-27T05:48:41.000Z | //
// Color.hpp
// Aha
//
// Created by Priyanshi Thakur on 01/05/18.
// Copyright © 2018 Saurabh Sinha. All rights reserved.
//
#pragma once
#include "../Math/Vec3.hpp"
#include "../Math/Vec4.hpp"
namespace aha
{
class Color : public Vec4f
{
public:
Color() : Vec4f()
{
... | 21.981481 | 118 | 0.420388 | templateguy |
9feb4218ede377ed9357259d7f8705e59a7bd910 | 4,349 | cpp | C++ | tiamoPCI/source/pci.agpintrf.cpp | godspeed1989/WDUtils | 69057e92a5759487ef6bd62a85db24644759b42c | [
"BSD-2-Clause"
] | 13 | 2015-05-29T14:18:53.000Z | 2020-08-12T14:26:33.000Z | tiamoPCI/source/pci.agpintrf.cpp | godspeed1989/WDUtils | 69057e92a5759487ef6bd62a85db24644759b42c | [
"BSD-2-Clause"
] | null | null | null | tiamoPCI/source/pci.agpintrf.cpp | godspeed1989/WDUtils | 69057e92a5759487ef6bd62a85db24644759b42c | [
"BSD-2-Clause"
] | 11 | 2015-06-10T19:27:28.000Z | 2020-03-05T10:14:41.000Z | //********************************************************************
// created: 27:7:2008 0:07
// file: pci.agpintrf.cpp
// author: tiamo
// purpose: agp interface
//********************************************************************
#include "stdafx.h"
#pragma alloc_text("PAGE",agpintrf_Constructor)
#pragma ... | 29.585034 | 141 | 0.74201 | godspeed1989 |
9ff346f51e74e53433c92387bf26cfed6598535d | 990 | cpp | C++ | Dynamic Programming/Filling_bookcase_shelves.cpp | Razdeep/LeetCode-Solutions | 934cadbf42f5c5da2c16778c9d2353df203dbd85 | [
"MIT"
] | 1 | 2019-02-14T14:20:28.000Z | 2019-02-14T14:20:28.000Z | Dynamic Programming/Filling_bookcase_shelves.cpp | Razdeep/LeetCode-Solutions | 934cadbf42f5c5da2c16778c9d2353df203dbd85 | [
"MIT"
] | null | null | null | Dynamic Programming/Filling_bookcase_shelves.cpp | Razdeep/LeetCode-Solutions | 934cadbf42f5c5da2c16778c9d2353df203dbd85 | [
"MIT"
] | null | null | null | class Solution {
#define trace(x) cout << #x << ": " << x << endl;
public:
int minHeightShelves(vector<vector<int>>& books, int shelfWidth) {
int oo = int(1e9);
int n = int(books.size());
vector<int> dp(n, 0);
int current_width = 0;
const int WIDTH = 0;
c... | 36.666667 | 97 | 0.483838 | Razdeep |
9ff59d3cac54cd8209ed57751e49f24f08645d63 | 1,263 | cpp | C++ | Evaluate Reverse Polish Notation.cpp | durgirajesh/Leetcode | 18b11cd90e8a5ce33f4029d5b7edf9502273bc76 | [
"MIT"
] | 2 | 2020-06-25T12:46:13.000Z | 2021-07-06T06:34:33.000Z | Evaluate Reverse Polish Notation.cpp | durgirajesh/Leetcode | 18b11cd90e8a5ce33f4029d5b7edf9502273bc76 | [
"MIT"
] | null | null | null | Evaluate Reverse Polish Notation.cpp | durgirajesh/Leetcode | 18b11cd90e8a5ce33f4029d5b7edf9502273bc76 | [
"MIT"
] | null | null | null | class Solution {
public:
int evalRPN(vector<string>& tokens) {
stack<long> st;
int n=tokens.size();
for(string str : tokens){
if(str=="+" || str=="-" || str=="*" || str=="/"){
int num1, num2;
if(!st.empty()){
num1... | 28.704545 | 62 | 0.262866 | durgirajesh |
9ffd23b0bc01c42e4f6bb23fabef45a1af9031f9 | 65 | cpp | C++ | Profiles/prog.cpp | hemishv111/Hacktoberfest2k19 | ead7c6c7cdd569e730a48257c7ca1ba2f76dfbae | [
"MIT"
] | 22 | 2019-10-10T12:16:58.000Z | 2020-10-28T09:09:52.000Z | Profiles/prog.cpp | hemishv111/Hacktoberfest2k19 | ead7c6c7cdd569e730a48257c7ca1ba2f76dfbae | [
"MIT"
] | 49 | 2019-10-09T11:23:06.000Z | 2020-10-01T07:26:14.000Z | Profiles/prog.cpp | hemishv111/Hacktoberfest2k19 | ead7c6c7cdd569e730a48257c7ca1ba2f76dfbae | [
"MIT"
] | 80 | 2019-10-06T16:40:06.000Z | 2020-10-22T16:34:58.000Z | include<iostream.h>
int main()
{
cout<<"1";
cout<<"Hello";
}
| 9.285714 | 19 | 0.569231 | hemishv111 |
b003e2a6c476dbee85b20b2d39d445b8d735481f | 781 | cpp | C++ | splus.tech/Source.cpp | sehe/splus.tech | c476305ef23253bb268d977aaf5b7f6ac60d9b3f | [
"MIT"
] | 2 | 2020-06-30T16:36:06.000Z | 2021-08-05T11:52:25.000Z | splus.tech/Source.cpp | sehe/splus.tech | c476305ef23253bb268d977aaf5b7f6ac60d9b3f | [
"MIT"
] | null | null | null | splus.tech/Source.cpp | sehe/splus.tech | c476305ef23253bb268d977aaf5b7f6ac60d9b3f | [
"MIT"
] | 1 | 2020-07-07T01:26:34.000Z | 2020-07-07T01:26:34.000Z | #include <string>
#include <iostream>
#include <vector>
#include "WebS.h"
#include <algorithm>
#include "menu.h"
using namespace std;
int main(int argc, char* argv[]) {
if (argc > 1 && argv[1][0] == '/') {
if (argv[1][1] == 's') {
string IP = argv[2];
int port = stoi(argv[3]);
WebS siteserv(IP.c_str(), po... | 18.595238 | 37 | 0.541613 | sehe |
b004e46b025814211cde93694094cc7a960cc93c | 39,694 | cpp | C++ | Source/HeliumRain/UI/Menus/FlareSkirmishSetupMenu.cpp | zhyinty/HeliumRain | 0096b9c9e9d0c0949d18624ea74b4991fdd175a2 | [
"BSD-3-Clause"
] | 646 | 2016-07-18T19:16:35.000Z | 2022-03-27T17:16:57.000Z | Source/HeliumRain/UI/Menus/FlareSkirmishSetupMenu.cpp | zhyinty/HeliumRain | 0096b9c9e9d0c0949d18624ea74b4991fdd175a2 | [
"BSD-3-Clause"
] | 2 | 2020-06-22T07:23:11.000Z | 2020-06-29T07:01:32.000Z | Source/HeliumRain/UI/Menus/FlareSkirmishSetupMenu.cpp | zhyinty/HeliumRain | 0096b9c9e9d0c0949d18624ea74b4991fdd175a2 | [
"BSD-3-Clause"
] | 114 | 2016-07-19T00:52:44.000Z | 2022-01-27T06:09:42.000Z |
#include "HeliumRain/UI/Menus/FlareSkirmishSetupMenu.h"
#include "../../Flare.h"
#include "../../Data/FlareCompanyCatalog.h"
#include "../../Data/FlareSpacecraftCatalog.h"
#include "../../Data/FlareSpacecraftComponentsCatalog.h"
#include "../../Data/FlareCustomizationCatalog.h"
#include "../../Data/FlareOrbitalMap.h"... | 26.114474 | 165 | 0.665617 | zhyinty |
b00d9f9b676e091eefc6eb42a6c888adf5b4a752 | 574 | cpp | C++ | ReceiveSms/ReceiveSms.cpp | ozekisms/cpp-send-sms-http-rest-ozeki | b4c9b2f675fb324bad1b0a55ae6504a5ea4b4dc3 | [
"MIT"
] | null | null | null | ReceiveSms/ReceiveSms.cpp | ozekisms/cpp-send-sms-http-rest-ozeki | b4c9b2f675fb324bad1b0a55ae6504a5ea4b4dc3 | [
"MIT"
] | null | null | null | ReceiveSms/ReceiveSms.cpp | ozekisms/cpp-send-sms-http-rest-ozeki | b4c9b2f675fb324bad1b0a55ae6504a5ea4b4dc3 | [
"MIT"
] | null | null | null | #include <iostream>
#include <string>
#include "Ozeki.Libs.Rest.h"
using namespace std;
int main()
{
//Function to create unique identifier for each messages
srand((unsigned)time(0));
Configuration configuration;
configuration.Username = "http_user";
configuration.Password = "qwe123";
configu... | 21.259259 | 60 | 0.660279 | ozekisms |
b00fbb2b5fdd0175dcfcb55263d3d40ca7e11b07 | 326 | cpp | C++ | cpp/4353.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 9 | 2021-01-15T13:36:39.000Z | 2022-02-23T03:44:46.000Z | cpp/4353.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | 1 | 2021-07-31T17:11:26.000Z | 2021-08-02T01:01:03.000Z | cpp/4353.cpp | jinhan814/BOJ | 47d2a89a2602144eb08459cabac04d036c758577 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;
#define double long double
const double PI = acos(-1);
int main() {
fastio;
cout << fixed << setprecision(3);
for (double D, V; cin >> D >> V && D;) {
const double val = D * D * D - V * 6 / PI;
cout << cbrt(val) << '\n'... | 21.733333 | 45 | 0.592025 | jinhan814 |
b0134943ddeb234b4e3a57a75b3d09037c4e9db3 | 9,060 | cpp | C++ | src/items/value_item_map.cpp | kitsudaiki/libKitsunemimiSakuraParser | 5cc3c2de7717b01b02912c9a2e0dc578877e963d | [
"Apache-2.0"
] | null | null | null | src/items/value_item_map.cpp | kitsudaiki/libKitsunemimiSakuraParser | 5cc3c2de7717b01b02912c9a2e0dc578877e963d | [
"Apache-2.0"
] | 54 | 2020-08-27T21:40:28.000Z | 2021-12-30T20:56:13.000Z | src/items/value_item_map.cpp | kitsudaiki/libKitsunemimiSakuraParser | 5cc3c2de7717b01b02912c9a2e0dc578877e963d | [
"Apache-2.0"
] | null | null | null | /**
* @file value_item_map.h
*
* @author Tobias Anker <tobias.anker@kitsunemimi.moe>
*
* @copyright Apache License Version 2.0
*
* Copyright 2019 Tobias Anker
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with ... | 23.410853 | 98 | 0.620751 | kitsudaiki |
b013c68f4340f9acf3d51682dbb95f6f987b293a | 1,502 | cpp | C++ | mdaio/usagetracking.cpp | magland/ap2d | 26aba9a6c90c19decdc4a2c729062c7de746439f | [
"MIT"
] | null | null | null | mdaio/usagetracking.cpp | magland/ap2d | 26aba9a6c90c19decdc4a2c729062c7de746439f | [
"MIT"
] | null | null | null | mdaio/usagetracking.cpp | magland/ap2d | 26aba9a6c90c19decdc4a2c729062c7de746439f | [
"MIT"
] | null | null | null | #include "usagetracking.h"
#include <QDebug>
static int num_files_open=0;
static int64_t num_bytes_allocated=0;
static int malloc_count=0;
static int num_bytes_read=0;
static int num_bytes_written=0;
FILE *jfopen(const char *path,const char *mode) {
//printf("jfopen.\n");
FILE *F=fopen(path,mode);
if (!F) return 0... | 19.763158 | 77 | 0.704394 | magland |