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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20fa088bd169f276c6708742b9af76c4daab95f7 | 425 | cc | C++ | leetcode/101-200/190-reverse-bits/190.cc | punkieL/proCon | 7e994d67e5efdf7ac0b1bee5e0b19b317f07e8af | [
"MIT"
] | 1 | 2015-10-06T16:27:42.000Z | 2015-10-06T16:27:42.000Z | leetcode/101-200/190-reverse-bits/190.cc | punkieL/proCon | 7e994d67e5efdf7ac0b1bee5e0b19b317f07e8af | [
"MIT"
] | 1 | 2016-03-02T16:18:11.000Z | 2016-03-02T16:18:11.000Z | leetcode/101-200/190-reverse-bits/190.cc | punkieL/proCon | 7e994d67e5efdf7ac0b1bee5e0b19b317f07e8af | [
"MIT"
] | null | null | null | #include "iostream"
#include "bitset"
using namespace std;
class Solution {
public:
uint32_t reverseBits(uint32_t n) {
bitset<32> t(n);
for(int i = 0, j = 31; i < j; i++, j--){
bool flg = t[i];
t[i] = t[j];
t[j] = flg;
}
return (uint32_t)t.to_ulong();
}
};
int main(int argc, ch... | 16.346154 | 44 | 0.548235 | punkieL |
1f0673980661dc03149b8068f6a0f77ed2da78ec | 2,234 | cpp | C++ | test/doc/math/inv_e.cpp | clayne/eve | dc268b5db474376e1c53f5a474f5bb42b7c4cb59 | [
"MIT"
] | null | null | null | test/doc/math/inv_e.cpp | clayne/eve | dc268b5db474376e1c53f5a474f5bb42b7c4cb59 | [
"MIT"
] | null | null | null | test/doc/math/inv_e.cpp | clayne/eve | dc268b5db474376e1c53f5a474f5bb42b7c4cb59 | [
"MIT"
] | null | null | null | #include <eve/module/math.hpp>
#include <eve/wide.hpp>
#include <iostream>
#include <iomanip>
using wide_ft = eve::wide<float>;
using wide_dt = eve::wide<double>;
int main()
{
wide_ft wxf;
wide_dt wxd;
std::cout << "---- simd" << std::setprecision(9) << std::endl
<< "-> inv_e(as<wide_ft>()) ... | 55.85 | 121 | 0.427932 | clayne |
1f06a020d40f05b994aeb2e1f98587c8d3a3b5dc | 1,692 | hpp | C++ | janela_principal.hpp | marcio-mutti/msscellparse | 2b9ff0a5a59a5ba090eaf6c7e6614b6bd278b5f5 | [
"Apache-2.0"
] | null | null | null | janela_principal.hpp | marcio-mutti/msscellparse | 2b9ff0a5a59a5ba090eaf6c7e6614b6bd278b5f5 | [
"Apache-2.0"
] | null | null | null | janela_principal.hpp | marcio-mutti/msscellparse | 2b9ff0a5a59a5ba090eaf6c7e6614b6bd278b5f5 | [
"Apache-2.0"
] | null | null | null | #ifndef JANELA_PRINCIPAL
#define JANELA_PRINCIPAL
#include <memory>
#include <gtkmm-3.0/gtkmm.h>
#include <boost/thread.hpp>
# include "loader_thread.hpp"
class janela_principal : public Gtk::ApplicationWindow {
public:
janela_principal();
~janela_principal();
protected:
Glib::RefPtr<Gtk::Builder> ja... | 31.924528 | 91 | 0.699764 | marcio-mutti |
1f06c9929d44e6ba4a5a4beac65f793444f3c500 | 1,509 | hpp | C++ | src/Platform.Cocoa/GameHostMetal.hpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | src/Platform.Cocoa/GameHostMetal.hpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | src/Platform.Cocoa/GameHostMetal.hpp | ValtoForks/pomdog | 73798ae5f4a4c3b9b1e1e96239187c4b842c93b2 | [
"MIT"
] | null | null | null | // Copyright (c) 2013-2018 mogemimi. Distributed under the MIT license.
#pragma once
#include "Pomdog/Application/GameHost.hpp"
#include "Pomdog/Signals/EventQueue.hpp"
#include <memory>
#import <MetalKit/MTKView.h>
namespace Pomdog {
class Game;
struct PresentationParameters;
namespace Detail {
namespace Cocoa {... | 22.522388 | 77 | 0.720345 | ValtoForks |
1f07805d8b09bf1ed4c9c66c11902695dcbf7eb8 | 5,637 | cpp | C++ | embedded_deformables/Embedded_Deformables_Driver.cpp | yanshil/Nova_Examples | 0807c5a3bc24e4f3efc399f424e2e4fb0da2d4fe | [
"Apache-2.0"
] | 1 | 2022-02-01T18:04:45.000Z | 2022-02-01T18:04:45.000Z | embedded_deformables/Embedded_Deformables_Driver.cpp | yanshil/Nova_Examples | 0807c5a3bc24e4f3efc399f424e2e4fb0da2d4fe | [
"Apache-2.0"
] | null | null | null | embedded_deformables/Embedded_Deformables_Driver.cpp | yanshil/Nova_Examples | 0807c5a3bc24e4f3efc399f424e2e4fb0da2d4fe | [
"Apache-2.0"
] | 1 | 2018-12-30T00:49:36.000Z | 2018-12-30T00:49:36.000Z | //!#####################################################################
//! \file Embedded_Deformables_Driver.cpp
//!#####################################################################
#include <nova/Tools/Krylov_Solvers/Conjugate_Gradient.h>
#include "CG_System.h"
#include "Embedded_Deformables_Driver.h"
using name... | 47.369748 | 154 | 0.63846 | yanshil |
1f0884fed054fd22bbb9a3b00ef6ad91cd187a88 | 15,194 | cpp | C++ | firmware/L476_board_asserv/src/Board.cpp | romainreignier/robot2017 | 8d36689573a35d3f58184fecc5c3b17d8718f71a | [
"Apache-2.0"
] | 1 | 2019-04-01T12:17:26.000Z | 2019-04-01T12:17:26.000Z | firmware/L476_board_asserv/src/Board.cpp | romainreignier/robot2017 | 8d36689573a35d3f58184fecc5c3b17d8718f71a | [
"Apache-2.0"
] | null | null | null | firmware/L476_board_asserv/src/Board.cpp | romainreignier/robot2017 | 8d36689573a35d3f58184fecc5c3b17d8718f71a | [
"Apache-2.0"
] | null | null | null | #include "Board.h"
#include <cmath>
#include <cstdlib>
#define M_PI 3.14159265358979323846 /* pi */
BaseSequentialStream* dbg = (BaseSequentialStream*)&DEBUG_DRIVER;
#if defined(USE_ROS_LOG)
char logBuffer[LOG_BUFFER_SIZE];
#endif
static void gpt7cb(GPTDriver* _gptd)
{
(void)_gptd;
// Compute PID for motors
... | 24.427653 | 111 | 0.638344 | romainreignier |
1f095b0008f38943fe66c5df9cf7359ddf136787 | 5,096 | cpp | C++ | driver/response.cpp | symmetryinvestments/ldc | cac8eddfc68cfe5c972df0ede31d8975fb1c5fb2 | [
"Apache-2.0"
] | 858 | 2015-01-02T10:06:15.000Z | 2022-03-30T18:26:49.000Z | driver/response.cpp | symmetryinvestments/ldc | cac8eddfc68cfe5c972df0ede31d8975fb1c5fb2 | [
"Apache-2.0"
] | 2,533 | 2015-01-04T14:31:13.000Z | 2022-03-31T22:12:24.000Z | driver/response.cpp | symmetryinvestments/ldc | cac8eddfc68cfe5c972df0ede31d8975fb1c5fb2 | [
"Apache-2.0"
] | 220 | 2015-01-06T05:24:36.000Z | 2022-03-13T10:47:32.000Z | //===-- response.cpp ------------------------------------------------------===//
//
// LDC – the LLVM D compiler
//
// This file is distributed under the BSD-style LDC license. See the LICENSE
// file for details.
//
//===----------------------------------------------------------------------===/... | 26.962963 | 80 | 0.557104 | symmetryinvestments |
1f110276ddaf6ecd5bc30d78aafc2915730ca827 | 16,858 | cpp | C++ | plugins/hgl_parser/src/hgl_parser.cpp | The6P4C/hal | 09ce5ba7012e293ce004b1ca5c94f553c9cbddae | [
"MIT"
] | null | null | null | plugins/hgl_parser/src/hgl_parser.cpp | The6P4C/hal | 09ce5ba7012e293ce004b1ca5c94f553c9cbddae | [
"MIT"
] | null | null | null | plugins/hgl_parser/src/hgl_parser.cpp | The6P4C/hal | 09ce5ba7012e293ce004b1ca5c94f553c9cbddae | [
"MIT"
] | null | null | null | #include "hgl_parser/hgl_parser.h"
#include "hal_core/netlist/boolean_function.h"
#include "hal_core/utilities/log.h"
#include "rapidjson/filereadstream.h"
#include "rapidjson/stringbuffer.h"
namespace hal
{
std::unique_ptr<GateLibrary> HGLParser::parse(const std::filesystem::path& file_path)
{
m_path... | 37.132159 | 199 | 0.564836 | The6P4C |
1f110ce53d275d326de91005b7c5dfce8ed7417f | 669 | cpp | C++ | sdk/boost_1_30_0/libs/python/test/bienstman5.cpp | acidicMercury8/xray-1.0 | 65e85c0e31e82d612c793d980dc4b73fa186c76c | [
"Linux-OpenIB"
] | 2 | 2020-01-30T12:51:49.000Z | 2020-08-31T08:36:49.000Z | sdk/boost_1_30_0/libs/python/test/bienstman5.cpp | acidicMercury8/xray-1.0 | 65e85c0e31e82d612c793d980dc4b73fa186c76c | [
"Linux-OpenIB"
] | null | null | null | sdk/boost_1_30_0/libs/python/test/bienstman5.cpp | acidicMercury8/xray-1.0 | 65e85c0e31e82d612c793d980dc4b73fa186c76c | [
"Linux-OpenIB"
] | null | null | null | // Copyright David Abrahams 2002. Permission to copy, use,
// modify, sell and distribute this software is granted provided this
// copyright notice appears in all copies. This software is provided
// "as is" without express or implied warranty, and with no claim as
// to its suitability for any purpose.
#includ... | 26.76 | 70 | 0.701046 | acidicMercury8 |
1f1132570a7d148410512482329930a8f00b6828 | 502 | cpp | C++ | codeforces/667.3/B.cpp | swwind/code | 25c4c5ca2f8578ba792b44cbdf44286d39dfb7e0 | [
"WTFPL"
] | 3 | 2017-09-17T09:12:50.000Z | 2018-04-06T01:18:17.000Z | codeforces/667.3/B.cpp | swwind/code | 25c4c5ca2f8578ba792b44cbdf44286d39dfb7e0 | [
"WTFPL"
] | null | null | null | codeforces/667.3/B.cpp | swwind/code | 25c4c5ca2f8578ba792b44cbdf44286d39dfb7e0 | [
"WTFPL"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x, y, a, b, n;
scanf("%d", &t);
while (t --) {
scanf("%d%d%d%d%d", &a, &b, &x, &y, &n);
if (n >= a - x + b - y) {
printf("%lld\n", (long long) x * y);
continue;
}
long long res1 = n >= (a - x) ? (long long) x * (b - (n ... | 29.529412 | 98 | 0.420319 | swwind |
1f11f7ff0ee57eacd12da2befda877353db09b60 | 2,065 | hpp | C++ | app/include/shared/util/ResourceUtil.hpp | paulo-coutinho/cef-sample | ed6f400c1ecf5ec86454c963578ba27c5194afe0 | [
"MIT"
] | 5 | 2021-07-09T15:16:13.000Z | 2022-01-27T13:47:16.000Z | app/include/shared/util/ResourceUtil.hpp | paulo-coutinho/cef-sample | ed6f400c1ecf5ec86454c963578ba27c5194afe0 | [
"MIT"
] | null | null | null | app/include/shared/util/ResourceUtil.hpp | paulo-coutinho/cef-sample | ed6f400c1ecf5ec86454c963578ba27c5194afe0 | [
"MIT"
] | null | null | null | #pragma once
#include "include/cef_parser.h"
#include "include/wrapper/cef_stream_resource_handler.h"
#if defined(OS_WIN)
#include "include/wrapper/cef_resource_manager.h"
#endif
namespace shared
{
namespace util
{
class ResourceUtil
{
public:
// returns URL without the query or fragment components, if any
... | 29.927536 | 104 | 0.7477 | paulo-coutinho |
1f17c691b218143baff7673c402e90ac5b212d50 | 12,607 | hpp | C++ | Engine/Includes/Lua/Modules/wxLua/bindings/wxwidgets/wxadv_override.hpp | GCourtney27/Retina-Engine | 5358b9c499f4163a209024dc303c3efe6c520c01 | [
"MIT"
] | null | null | null | Engine/Includes/Lua/Modules/wxLua/bindings/wxwidgets/wxadv_override.hpp | GCourtney27/Retina-Engine | 5358b9c499f4163a209024dc303c3efe6c520c01 | [
"MIT"
] | null | null | null | Engine/Includes/Lua/Modules/wxLua/bindings/wxwidgets/wxadv_override.hpp | GCourtney27/Retina-Engine | 5358b9c499f4163a209024dc303c3efe6c520c01 | [
"MIT"
] | null | null | null | // ----------------------------------------------------------------------------
// Overridden functions for the wxWidgets binding for wxLua
//
// Please keep these functions in the same order as the .i file and in the
// same order as the listing of the functions in that file.
// ---------------------------------------... | 32.160714 | 143 | 0.728405 | GCourtney27 |
1f19e3f75f05d2012443307520d50a3a1c4cd878 | 50,130 | cpp | C++ | admin/wmi/wbem/providers/ping/dll/pingquery.cpp | npocmaka/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 17 | 2020-11-13T13:42:52.000Z | 2021-09-16T09:13:13.000Z | admin/wmi/wbem/providers/ping/dll/pingquery.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 2 | 2020-10-19T08:02:06.000Z | 2020-10-19T08:23:18.000Z | admin/wmi/wbem/providers/ping/dll/pingquery.cpp | sancho1952007/Windows-Server-2003 | 5c6fe3db626b63a384230a1aa6b92ac416b0765f | [
"Unlicense"
] | 14 | 2020-11-14T09:43:20.000Z | 2021-08-28T08:59:57.000Z | /******************************************************************
pingquery.CPP
Copyright (c) 2000-2001 Microsoft Corporation, All Rights Reserved
Description:
******************************************************************/
#include <stdafx.h>
#include <ntddtcp.h>
#include <ipi... | 23.814727 | 145 | 0.598624 | npocmaka |
1f1be8b11c7298824f6c8b9d5f71bdde39eb9afa | 1,609 | cpp | C++ | src/main.cpp | JimmyZhang12/SLIC_CUDA | 7a2bd5830d3447ae79eef7d824a7b0999ea6a3b7 | [
"MIT"
] | null | null | null | src/main.cpp | JimmyZhang12/SLIC_CUDA | 7a2bd5830d3447ae79eef7d824a7b0999ea6a3b7 | [
"MIT"
] | null | null | null | src/main.cpp | JimmyZhang12/SLIC_CUDA | 7a2bd5830d3447ae79eef7d824a7b0999ea6a3b7 | [
"MIT"
] | null | null | null | #include <iostream>
#include <opencv2/opencv.hpp>
#include <chrono>
#include<string>
#include "SlicCudaHost.h"
using namespace std;
using namespace cv;
int main() {
// VideoCapture cap("/home/jimmy/ece508/data/waterfall.avi");
// Parameters
int diamSpx = 32;
int wc = 35;
int nIteration = 10;
SlicCuda::InitT... | 24.378788 | 99 | 0.668738 | JimmyZhang12 |
1f1c4c97ab8919946e69cd923d2a814799cf37d8 | 874 | cpp | C++ | Matrix Multiplication.cpp | sayanroy058/C-Programs | 2bb591d5a322d1bf10e8a1627d92db05cb0ece75 | [
"CC0-1.0"
] | 2 | 2019-09-11T16:22:30.000Z | 2019-09-19T18:29:42.000Z | Matrix Multiplication.cpp | sayanroy058/C-Programs | 2bb591d5a322d1bf10e8a1627d92db05cb0ece75 | [
"CC0-1.0"
] | null | null | null | Matrix Multiplication.cpp | sayanroy058/C-Programs | 2bb591d5a322d1bf10e8a1627d92db05cb0ece75 | [
"CC0-1.0"
] | null | null | null | #include<stdio.h>
int main()
{
int i,j,k,r1,r2,c1,c2,sum=0,a[10][10],b[10][10],p[10][10];
printf("Enter the row and column of the 1st matrics:");
scanf("%d%d",&r1,&c1);
printf("Enter the row and column of the 2nd matrics:");
scanf("%d%d",&r2,&c2);
printf("Enter elements of first matrix:\n");
for(i=0;i<r... | 18.595745 | 60 | 0.442792 | sayanroy058 |
1f1d72c14c8761610c791ecea8fa1f858adfe114 | 247 | cpp | C++ | pub/1104.cpp | BashuMiddleSchool/Bashu_OnlineJudge_Code | 4707a271e6658158a1910b0e6e27c75f96841aca | [
"MIT"
] | 2 | 2021-05-01T15:51:58.000Z | 2021-05-02T15:19:49.000Z | pub/1104.cpp | BashuMiddleSchool/Bashu_OnlineJudge_Code | 4707a271e6658158a1910b0e6e27c75f96841aca | [
"MIT"
] | 1 | 2021-05-16T15:04:38.000Z | 2021-09-19T09:49:00.000Z | pub/1104.cpp | BashuMiddleSchool/Bashu_OnlineJudge_Code | 4707a271e6658158a1910b0e6e27c75f96841aca | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
int main()
{
int a[100001]={0};
int n,i,b=-1000000,m;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=1;i<=n;i++)
{
if(a[i]>=b) {
b=a[i];m=i;
}
}
cout<<b<<endl;
cout<<m;
return 0;
} | 11.761905 | 22 | 0.48583 | BashuMiddleSchool |
1f212f1f35be9cb4fa950adaaaf9c31200466c69 | 1,043 | cpp | C++ | cplus/BacterialExperimentGroup.cpp | chtld/Programming-and-Algorithm-Course | 669f266fc97db9050013ffbb388517667de33433 | [
"MIT"
] | 2 | 2019-06-10T11:50:06.000Z | 2019-10-14T08:00:41.000Z | cplus/BacterialExperimentGroup.cpp | chtld/Programming-and-Algorithm-Course | 669f266fc97db9050013ffbb388517667de33433 | [
"MIT"
] | null | null | null | cplus/BacterialExperimentGroup.cpp | chtld/Programming-and-Algorithm-Course | 669f266fc97db9050013ffbb388517667de33433 | [
"MIT"
] | null | null | null | #include <iostream>
int main(){
int n = 0, initial = 0, final = 0;
std::cin >> n;
int id[100] = {0};
double rate[100] = {0.0};
for (int i = 0; i < n; i++) {
std::cin >> id[i] >> initial >> final;
rate [i] = (double) final/initial;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1... | 22.673913 | 49 | 0.449664 | chtld |
1f22e36b74d418861823dcefdd65edd90cb639ae | 5,152 | cpp | C++ | qt-creator-opensource-src-4.6.1/src/libs/qmldebug/qmltoolsclient.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f | [
"MIT"
] | 5 | 2018-12-22T14:49:13.000Z | 2022-01-13T07:21:46.000Z | qt-creator-opensource-src-4.6.1/src/libs/qmldebug/qmltoolsclient.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f | [
"MIT"
] | null | null | null | qt-creator-opensource-src-4.6.1/src/libs/qmldebug/qmltoolsclient.cpp | kevinlq/Qt-Creator-Opensource-Study | b8cadff1f33f25a5d4ef33ed93f661b788b1ba0f | [
"MIT"
] | 8 | 2018-07-17T03:55:48.000Z | 2021-12-22T06:37:53.000Z | /****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance w... | 30.305882 | 90 | 0.644216 | kevinlq |
1f289f3a64863a9def62c79b27dae01a400b4167 | 8,280 | cpp | C++ | src/editor/src/resource/name_resource_pool.cpp | AirGuanZ/Atrc | a0c4bc1b7bb96ddffff8bb1350f88b651b94d993 | [
"MIT"
] | 358 | 2018-11-29T08:15:05.000Z | 2022-03-31T07:48:37.000Z | src/editor/src/resource/name_resource_pool.cpp | happyfire/Atrc | 74cac111e277be53eddea5638235d97cec96c378 | [
"MIT"
] | 23 | 2019-04-06T17:23:58.000Z | 2022-02-08T14:22:46.000Z | src/editor/src/resource/name_resource_pool.cpp | happyfire/Atrc | 74cac111e277be53eddea5638235d97cec96c378 | [
"MIT"
] | 22 | 2019-03-04T01:47:56.000Z | 2022-01-13T06:06:49.000Z | #include <agz/editor/editor.h>
#include <agz/editor/resource/pool/name_resource_pool.h>
#include <agz/tracer/utility/logger.h>
AGZ_EDITOR_BEGIN
namespace
{
constexpr int WIDGET_ITEM_HEIGHT = 35;
}
template<typename TracerObject>
NameResourcePool<TracerObject>::NameResourcePool(
ObjectContext &obj_ctx, Editor... | 30.32967 | 87 | 0.633937 | AirGuanZ |
1f29a5cd76154351d80fd0ef6dbc700209f3948b | 13,760 | cc | C++ | src/op_mysql/op_mysql.cc | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/op_mysql/op_mysql.cc | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | null | null | null | src/op_mysql/op_mysql.cc | zettadb/zettalib | 3d5f96dc9e3e4aa255f4e6105489758944d37cc4 | [
"Apache-2.0"
] | 2 | 2022-02-27T14:00:01.000Z | 2022-03-31T06:24:22.000Z | /*
Copyright (c) 2019-2021 ZettaDB inc. All rights reserved.
This source code is licensed under Apache 2.0 License,
combined with Common Clause Condition 1.0, as detailed in the NOTICE file.
*/
#include "op_mysql.h"
#include "error.h"
#include "stdlib.h"
#include "string.h"
#include <sys/stat.h>
#ifdef ZETTA_LIB... | 30.241758 | 80 | 0.659956 | zettadb |
1f2a14b538c40588484eb426a9886a93e77a21fd | 283 | cc | C++ | jax/training/21-03/21-03-23-night/c.cc | JaxVanYang/acm | ee41f1cbf692b7b1463a9467401bb6e7d38aecce | [
"MIT"
] | 2 | 2022-01-01T16:55:02.000Z | 2022-03-16T14:47:29.000Z | jax/training/21-03/21-03-23-night/c.cc | JaxVanYang/acm | ee41f1cbf692b7b1463a9467401bb6e7d38aecce | [
"MIT"
] | null | null | null | jax/training/21-03/21-03-23-night/c.cc | JaxVanYang/acm | ee41f1cbf692b7b1463a9467401bb6e7d38aecce | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
const int maxn = 505;
const int maxl = 2000;
char strs[maxn][maxl];
int main() {
int t;
cin >> t;
for (int i = 1; i <= t; ++i) {
int n;
for (int i = 1; i <= n; ++i) scanf("%s", strs + i);
string s;
}
} | 18.866667 | 59 | 0.487633 | JaxVanYang |
1f2a8e876145e8e862f63845b45959c03eba270d | 2,221 | cpp | C++ | Tests/UnitTests/Core/Time/SecondTests.cpp | SapphireSuite/Engine | f29821853aec6118508f31d3e063e83e603f52dd | [
"MIT"
] | 1 | 2022-01-20T23:17:18.000Z | 2022-01-20T23:17:18.000Z | Tests/UnitTests/Core/Time/SecondTests.cpp | SapphireSuite/Engine | f29821853aec6118508f31d3e063e83e603f52dd | [
"MIT"
] | null | null | null | Tests/UnitTests/Core/Time/SecondTests.cpp | SapphireSuite/Engine | f29821853aec6118508f31d3e063e83e603f52dd | [
"MIT"
] | null | null | null | // Copyright (c) 2021 Sapphire's Suite. All Rights Reserved.
#include <UnitTestHelper>
#include <SA/Collections/Time>
using namespace Sa;
namespace Sa::Second_UT
{
void Constants()
{
static_assert(1.0f / Second::ToTicks == Tick::ToSeconds, "1 / Second::ToTicks != Tick::ToSeconds");
static_assert(1.0f / Second:... | 24.141304 | 130 | 0.683926 | SapphireSuite |
1f2b33c45d51597918953f78724114fb628f0d30 | 566 | cpp | C++ | sg/generator/Generator.cpp | ebachard/ospray_studio | 78928c93b482f9f95aa300c8f58c728dadedbe2f | [
"Apache-2.0"
] | null | null | null | sg/generator/Generator.cpp | ebachard/ospray_studio | 78928c93b482f9f95aa300c8f58c728dadedbe2f | [
"Apache-2.0"
] | null | null | null | sg/generator/Generator.cpp | ebachard/ospray_studio | 78928c93b482f9f95aa300c8f58c728dadedbe2f | [
"Apache-2.0"
] | null | null | null | // Copyright 2009-2022 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#include "Generator.h"
namespace ospray {
namespace sg {
Generator::Generator()
{
createChild("parameters");
}
NodeType Generator::type() const
{
return NodeType::GENERATOR;
}
void Generator::preCommit()
{
... | 15.722222 | 54 | 0.64841 | ebachard |
1f2c827f768c52a73e73bf70aaf2df3859142f33 | 717 | hpp | C++ | Code/Engine/Math/FloatRange.hpp | yixuan-wei/PersonalEngine | 6f3b1df3ddeb662fbf65ca8b3ea7ddb446ef5a20 | [
"MIT"
] | 1 | 2021-06-11T06:41:29.000Z | 2021-06-11T06:41:29.000Z | Code/Engine/Math/FloatRange.hpp | yixuan-wei/PersonalEngine | 6f3b1df3ddeb662fbf65ca8b3ea7ddb446ef5a20 | [
"MIT"
] | 1 | 2022-02-25T07:46:54.000Z | 2022-02-25T07:46:54.000Z | Code/Engine/Math/FloatRange.hpp | yixuan-wei/PersonalEngine | 6f3b1df3ddeb662fbf65ca8b3ea7ddb446ef5a20 | [
"MIT"
] | null | null | null | #pragma once
#include <string>
class RandomNumberGenerator;
struct FloatRange
{
public:
float minimum = 0.f;
float maximum = 0.f;
public:
FloatRange() = default;
explicit FloatRange( float minAndMax );
explicit FloatRange( float initStart, float initEnd );
explicit FloatRange( const char* asText );
~FloatRan... | 23.129032 | 66 | 0.72106 | yixuan-wei |
1f2e21c6c089861783b0d9498512b8e29c6b3abe | 312 | cpp | C++ | aql/benchmark/lib_33/class_9.cpp | menify/sandbox | 32166c71044f0d5b414335b2b6559adc571f568c | [
"MIT"
] | null | null | null | aql/benchmark/lib_33/class_9.cpp | menify/sandbox | 32166c71044f0d5b414335b2b6559adc571f568c | [
"MIT"
] | null | null | null | aql/benchmark/lib_33/class_9.cpp | menify/sandbox | 32166c71044f0d5b414335b2b6559adc571f568c | [
"MIT"
] | null | null | null | #include "class_9.h"
#include "class_5.h"
#include "class_8.h"
#include "class_4.h"
#include "class_2.h"
#include "class_6.h"
#include <lib_32/class_6.h>
#include <lib_31/class_4.h>
#include <lib_24/class_5.h>
#include <lib_32/class_2.h>
#include <lib_32/class_1.h>
class_9::class_9() {}
class_9::~class_9() {}
| 20.8 | 27 | 0.714744 | menify |
1f30c63fc7d2c6e1d9a6bf0975ac1d1c817347e2 | 48,974 | cpp | C++ | src/Generic/events/stat/EventTriggerFinder.cpp | BBN-E/serif | 1e2662d82fb1c377ec3c79355a5a9b0644606cb4 | [
"Apache-2.0"
] | 1 | 2022-03-24T19:57:00.000Z | 2022-03-24T19:57:00.000Z | src/Generic/events/stat/EventTriggerFinder.cpp | BBN-E/serif | 1e2662d82fb1c377ec3c79355a5a9b0644606cb4 | [
"Apache-2.0"
] | null | null | null | src/Generic/events/stat/EventTriggerFinder.cpp | BBN-E/serif | 1e2662d82fb1c377ec3c79355a5a9b0644606cb4 | [
"Apache-2.0"
] | null | null | null | // Copyright 2008 by BBN Technologies Corp.
// All Rights Reserved.
#include "Generic/common/leak_detection.h"
#include "Generic/events/stat/EventTriggerFinder.h"
#include "Generic/events/stat/EventTriggerFeatureType.h"
#include "Generic/events/stat/EventTriggerFeatureTypes.h"
#include "Generic/events/stat/Ev... | 36.250185 | 151 | 0.675358 | BBN-E |
1f32d7e43b7606cfed9edb7710d4401205fa291b | 464 | cpp | C++ | LeetCode/Solutions/LC0572.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 54 | 2019-05-13T12:13:09.000Z | 2022-02-27T02:59:00.000Z | LeetCode/Solutions/LC0572.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 2 | 2020-10-02T07:16:43.000Z | 2020-10-19T04:36:19.000Z | LeetCode/Solutions/LC0572.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 20 | 2020-05-26T09:48:13.000Z | 2022-03-18T15:18:27.000Z | /*
Problem Statement: https://leetcode.com/problems/subtree-of-another-tree/
*/
class Solution {
public:
bool isSubtree(TreeNode* s, TreeNode* t) {
if (!s)
return false;
else
return same(s, t) || isSubtree(s->left, t) || isSubtree(s->right, t);
}
bool same(TreeNode* s, TreeNode* t) {
if (!s && !t)
r... | 21.090909 | 73 | 0.599138 | Mohammed-Shoaib |
1f3596186c8cea10fc791379045527980248c44c | 817 | cpp | C++ | Chapter1/Section1.5/numtri/numtri.cpp | suzyz/USACO | c7f58850f20693fedfc30ef462f898d20d002396 | [
"MIT"
] | null | null | null | Chapter1/Section1.5/numtri/numtri.cpp | suzyz/USACO | c7f58850f20693fedfc30ef462f898d20d002396 | [
"MIT"
] | null | null | null | Chapter1/Section1.5/numtri/numtri.cpp | suzyz/USACO | c7f58850f20693fedfc30ef462f898d20d002396 | [
"MIT"
] | null | null | null | /*
ID: suzyzha1
PROG: numtri
LANG: C++
*/
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
const int maxn = 1010;
int n;
int tri[maxn][maxn];
int max_sum[maxn][maxn];
void dfs(int row,int col)
{
if(max_sum[row][col]>=0) return;
if(row==n-1)
{
max_sum[row][col]=tri[row][col];
... | 14.589286 | 56 | 0.618115 | suzyz |
1f36a77bb5faea0d972992b2527dbe14682829f3 | 2,218 | cpp | C++ | libraries/wtf-gcit/src/module.cpp | flynnwt/espgc | a538c8e6ef5dc42a104b79b222bffa1a9364d11e | [
"MIT"
] | 9 | 2016-08-21T14:42:54.000Z | 2020-11-04T10:13:19.000Z | libraries/wtf-gcit/src/module.cpp | flynnwt/espgc | a538c8e6ef5dc42a104b79b222bffa1a9364d11e | [
"MIT"
] | null | null | null | libraries/wtf-gcit/src/module.cpp | flynnwt/espgc | a538c8e6ef5dc42a104b79b222bffa1a9364d11e | [
"MIT"
] | 2 | 2017-12-10T19:52:57.000Z | 2021-03-15T12:13:58.000Z | #include "module.h"
// for true gc, must have 1 eth/wifi and 1 ir/serial/relay
Module::Module(GCIT *p, unsigned int a, ModuleType t) {
int i;
parent = p;
type = t;
address = a;
numConnectors = 0;
for (i = 0; i < MODULE_MAX_CONNECTORS; i++) {
connectors[i] = NULL;
}
switch (type) {
case ModuleTyp... | 25.494253 | 120 | 0.640216 | flynnwt |
1f37974613799c4cd991138584048575b97ee9ce | 398 | cpp | C++ | TP3/Projectile.cpp | JonathanRN/TP3_prog | 194c364bf81cd8f83af184af8a49acbdf36b19ea | [
"MIT"
] | null | null | null | TP3/Projectile.cpp | JonathanRN/TP3_prog | 194c364bf81cd8f83af184af8a49acbdf36b19ea | [
"MIT"
] | null | null | null | TP3/Projectile.cpp | JonathanRN/TP3_prog | 194c364bf81cd8f83af184af8a49acbdf36b19ea | [
"MIT"
] | null | null | null | #include "Projectile.h"
using namespace tp3;
tp3::Projectile::Projectile(const Vector2f& position, const Color& couleur, const int animationMaximale)
: ANIMATION_MAXIMALE(animationMaximale),
animation(0), actif(false)
{
setPosition(position);
setColor(couleur);
}
Projectile::~Projectile()
{
}
void tp3::Projectil... | 15.92 | 104 | 0.738693 | JonathanRN |
1f39a8900751f84fe1e7319942122594d03bfbf8 | 238 | cpp | C++ | solutions/119.pascals-triangle-ii.241467849.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 78 | 2020-10-22T11:31:53.000Z | 2022-02-22T13:27:49.000Z | solutions/119.pascals-triangle-ii.241467849.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | null | null | null | solutions/119.pascals-triangle-ii.241467849.ac.cpp | satu0king/Leetcode-Solutions | 2edff60d76c2898d912197044f6284efeeb34119 | [
"MIT"
] | 26 | 2020-10-23T15:10:44.000Z | 2021-11-07T16:13:50.000Z | class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> DP(rowIndex + 1);
DP[0] = 1;
while (rowIndex--) {
for (int i = DP.size() - 1; i > 0; i--)
DP[i] += DP[i - 1];
}
return DP;
}
};
| 18.307692 | 45 | 0.478992 | satu0king |
1f3ec6ed763ba4ea345265f4236e89ad73044c73 | 16,091 | cpp | C++ | units/hw.cpp | rgbond/zapping-ants | 9f96fa07b4caacce91f5b0b4acd5235af1e2a67b | [
"Apache-2.0"
] | 3 | 2016-11-16T18:28:42.000Z | 2020-01-10T09:49:12.000Z | units/hw.cpp | rgbond/zapping-ants | 9f96fa07b4caacce91f5b0b4acd5235af1e2a67b | [
"Apache-2.0"
] | null | null | null | units/hw.cpp | rgbond/zapping-ants | 9f96fa07b4caacce91f5b0b4acd5235af1e2a67b | [
"Apache-2.0"
] | null | null | null | /*
* Copyright 2016 Robert Bond
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to ... | 24.793529 | 89 | 0.57181 | rgbond |
1f3fc0f7be93156f2a4b34b7d9fcba362be7ce6d | 2,958 | cpp | C++ | Code/Avernakis Nodejs/Avernakis-Nodejs/Private/ImgCodec.cpp | qber-soft/Ave-Nodejs | 80b843d22b0e0620b6a5af329a851ce9921d8d85 | [
"MIT"
] | 39 | 2022-03-25T17:21:17.000Z | 2022-03-31T18:24:12.000Z | Code/Avernakis Nodejs/Avernakis-Nodejs/Private/ImgCodec.cpp | qber-soft/Ave-Nodejs | 80b843d22b0e0620b6a5af329a851ce9921d8d85 | [
"MIT"
] | 1 | 2022-03-20T00:35:07.000Z | 2022-03-20T01:06:20.000Z | Code/Avernakis Nodejs/Avernakis-Nodejs/Private/ImgCodec.cpp | qber-soft/Ave-Nodejs | 80b843d22b0e0620b6a5af329a851ce9921d8d85 | [
"MIT"
] | 3 | 2022-03-26T01:08:06.000Z | 2022-03-27T23:12:40.000Z | #include "StdAfx.h"
#include "ImgCodec.h"
#include "ImgCommon.h"
#include "ImgImage.h"
#define ThisMethod($x) &ImgCodec::$x
#define AutoAddMethod($x, ...) AddMethod<__VA_ARGS__>( #$x, ThisMethod( $x ) )
#define MakeThisFunc($x) MakeFunc( this, &ImgCodec::$x )
namespace Nav
{
namespace
{
ObjectRegister<ImgCodec>... | 28.171429 | 96 | 0.669371 | qber-soft |
1f3fd874f2da74209926821372fe62724ed7f302 | 253,956 | inl | C++ | src/fonts/stb_font_times_bold_47_latin_ext.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | 3 | 2018-03-13T12:51:57.000Z | 2021-10-11T11:32:17.000Z | src/fonts/stb_font_times_bold_47_latin_ext.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | null | null | null | src/fonts/stb_font_times_bold_47_latin_ext.inl | stetre/moonfonts | 5c8010c02ea62edcf42902e09478b0cd14af56ea | [
"MIT"
] | null | null | null | // Font generated by stb_font_inl_generator.c (4/1 bpp)
//
// Following instructions show how to use the only included font, whatever it is, in
// a generic way so you can replace it with any other font by changing the include.
// To use multiple fonts, replace STB_SOMEFONT_* below with STB_FONT_times_bold_47_latin... | 71.136134 | 131 | 0.819571 | stetre |
1f432c4bd1146f7420fb388837d2977b5a0557bd | 31,130 | hpp | C++ | external/laz-perf-1.5.0/cpp/laz-perf/io.hpp | lbartoletti/pointcloud | 02662563ee57cb63be7fb91f6a6871f8b358d054 | [
"BSD-3-Clause"
] | null | null | null | external/laz-perf-1.5.0/cpp/laz-perf/io.hpp | lbartoletti/pointcloud | 02662563ee57cb63be7fb91f6a6871f8b358d054 | [
"BSD-3-Clause"
] | null | null | null | external/laz-perf-1.5.0/cpp/laz-perf/io.hpp | lbartoletti/pointcloud | 02662563ee57cb63be7fb91f6a6871f8b358d054 | [
"BSD-3-Clause"
] | null | null | null | /*
===============================================================================
FILE: io.hpp
CONTENTS:
LAZ io
PROGRAMMERS:
martin.isenburg@rapidlasso.com - http://rapidlasso.com
uday.karan@gmail.com - Hobu, Inc.
COPYRIGHT:
(c) 2007-2014, martin isenburg, rapidlasso - tools to catch r... | 29.479167 | 147 | 0.585384 | lbartoletti |
1f43eabfaa3b57637d2bf6ccde30adf8e7f98b52 | 548 | cpp | C++ | Neps/Problems/Zip - 35.cpp | lucaswilliamgomes/QuestionsCompetitiveProgramming | f0a2cf42bb5a00e5d677b7f3211ac399fe2bf6a0 | [
"MIT"
] | null | null | null | Neps/Problems/Zip - 35.cpp | lucaswilliamgomes/QuestionsCompetitiveProgramming | f0a2cf42bb5a00e5d677b7f3211ac399fe2bf6a0 | [
"MIT"
] | null | null | null | Neps/Problems/Zip - 35.cpp | lucaswilliamgomes/QuestionsCompetitiveProgramming | f0a2cf42bb5a00e5d677b7f3211ac399fe2bf6a0 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
int main (){
int a,b,c,d, pointa, pointb;
cin >> a >> b >> c >> d;
if (a==b) pointa = 2 * (a+b);
else if (a == b+1 or b == a+1) pointa = 3 * (a+b);
else pointa = a + b;
if (c==d) pointb = 2 * (c+d);
else if (c == d+1 or d == c+1) pointb =... | 21.92 | 57 | 0.474453 | lucaswilliamgomes |
1f44accefc95d801e13c1900b8f96e33f1a8908b | 895 | cc | C++ | third_party/blink/renderer/core/css/parser/css_lazy_property_parser_impl.cc | zipated/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 2,151 | 2020-04-18T07:31:17.000Z | 2022-03-31T08:39:18.000Z | third_party/blink/renderer/core/css/parser/css_lazy_property_parser_impl.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 395 | 2020-04-18T08:22:18.000Z | 2021-12-08T13:04:49.000Z | third_party/blink/renderer/core/css/parser/css_lazy_property_parser_impl.cc | cangulcan/src | 2b8388091c71e442910a21ada3d97ae8bc1845d3 | [
"BSD-3-Clause"
] | 338 | 2020-04-18T08:03:10.000Z | 2022-03-29T12:33:22.000Z | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/core/css/parser/css_lazy_property_parser_impl.h"
#include "third_party/blink/renderer/core/css/parser/css_lazy_parsi... | 38.913043 | 85 | 0.749721 | zipated |
1f4861b660c7ac97c5873e63c199efa7e74de58e | 732 | cc | C++ | src/ipcz/node_name.cc | krockot/ipcz | 6a6ebe43c2cb86882b0df9bf888dc5d34037f015 | [
"BSD-3-Clause"
] | null | null | null | src/ipcz/node_name.cc | krockot/ipcz | 6a6ebe43c2cb86882b0df9bf888dc5d34037f015 | [
"BSD-3-Clause"
] | null | null | null | src/ipcz/node_name.cc | krockot/ipcz | 6a6ebe43c2cb86882b0df9bf888dc5d34037f015 | [
"BSD-3-Clause"
] | null | null | null | // Copyright 2022 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ipcz/node_name.h"
#include <cinttypes>
#include <cstdint>
#include <cstdio>
#include <string>
#include <type_traits>
#include "third_party/abs... | 24.4 | 78 | 0.693989 | krockot |
1f4f0cdbbf93f934fe37d224274fc9cbf041f2c3 | 1,556 | cc | C++ | src/platform/unix_thread.cc | AnthonyBrunasso/test_games | 31354d2bf95aae9a880e7292bc78ad8577b3f09c | [
"MIT"
] | null | null | null | src/platform/unix_thread.cc | AnthonyBrunasso/test_games | 31354d2bf95aae9a880e7292bc78ad8577b3f09c | [
"MIT"
] | null | null | null | src/platform/unix_thread.cc | AnthonyBrunasso/test_games | 31354d2bf95aae9a880e7292bc78ad8577b3f09c | [
"MIT"
] | 2 | 2019-11-12T23:15:18.000Z | 2020-01-15T17:49:27.000Z | #include "thread.h"
#include <pthread.h>
#include <sched.h>
#include <climits>
#include <cstddef>
static_assert(offsetof(Thread, id) == 0 &&
sizeof(Thread::id) >= sizeof(pthread_t),
"Thread_t layout must be compatible with pthread_t");
namespace platform
{
void*
pthread_shim(void* pthrea... | 14.961538 | 67 | 0.647172 | AnthonyBrunasso |
1f514034e9d0344acd0c573e8b3bc1addaaba1d8 | 1,308 | cpp | C++ | graphs/cycle_detection_using_dsu.cpp | Ashish2030/C-_Language_Code | 50b143124690249e5dbd4eaaddfb8a3dadf48f1f | [
"MIT"
] | 7 | 2021-05-05T00:14:39.000Z | 2021-05-16T07:10:06.000Z | graphs/cycle_detection_using_dsu.cpp | Ashish2030/C-_Language_Code | 50b143124690249e5dbd4eaaddfb8a3dadf48f1f | [
"MIT"
] | null | null | null | graphs/cycle_detection_using_dsu.cpp | Ashish2030/C-_Language_Code | 50b143124690249e5dbd4eaaddfb8a3dadf48f1f | [
"MIT"
] | 4 | 2021-05-17T07:54:57.000Z | 2021-06-29T15:36:54.000Z | #include<iostream>
#include<map>
#include<list>
#include<cstring>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;
class dsu{
vector<int>part;
public:
dsu(int n){
part.resize(n);
for(int i=0;i<n;i++){
part[i]=i;
}
... | 16.35 | 56 | 0.474006 | Ashish2030 |
1f56078dc315f07ce8c8a983d0fc31ce267fd54a | 1,968 | cpp | C++ | Graphics2D/Source/DDraw1DrawList.cpp | TaylorClark/PrimeTime | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | [
"MIT"
] | null | null | null | Graphics2D/Source/DDraw1DrawList.cpp | TaylorClark/PrimeTime | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | [
"MIT"
] | null | null | null | Graphics2D/Source/DDraw1DrawList.cpp | TaylorClark/PrimeTime | 3c62f6c53e0494146a95be1412273de3cf05bcd2 | [
"MIT"
] | null | null | null | #include "..\PrivateInclude\DDraw1DrawList.h"
/// Test if the rectangle intersects any of the dirty rectangles
bool DDraw1DrawList::IntersectsDirtyRects( const Box2i& destRect ) const
{
// Go through each dirty rectangle and test for intersection
for( std::list<Box2i>::const_iterator iterRect = m_DirtyRects.begin()... | 26.958904 | 133 | 0.740346 | TaylorClark |
1f5c713e1791b673ed007f8bac5fb3134b7643f3 | 2,027 | cpp | C++ | binary.tree.cpp | lucasfrct/intro-C-PlusPlus | 4f0ca777c655c00ce8c4e2e3e1ddab7dc6fd2b57 | [
"MIT"
] | null | null | null | binary.tree.cpp | lucasfrct/intro-C-PlusPlus | 4f0ca777c655c00ce8c4e2e3e1ddab7dc6fd2b57 | [
"MIT"
] | null | null | null | binary.tree.cpp | lucasfrct/intro-C-PlusPlus | 4f0ca777c655c00ce8c4e2e3e1ddab7dc6fd2b57 | [
"MIT"
] | null | null | null | #include <iostream>
using namespace std;
class Node
{
private:
Node *left, *right;
int key;
public:
Node(int key)
{
this->key = key;
this->left = NULL;
this->right = NULL;
}
int getKey()
{
return this->key;
}
Node* getLeft()
{
return t... | 16.216 | 55 | 0.443019 | lucasfrct |
1f5cd7d826074a1caeb9fd00d225e1f0eaabad62 | 1,094 | cpp | C++ | Netcode/Graphics/DX12/DX12Texture.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | Netcode/Graphics/DX12/DX12Texture.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | Netcode/Graphics/DX12/DX12Texture.cpp | tyekx/netcode | c46fef1eeb33ad029d0c262d39309dfa83f76c4d | [
"MIT"
] | null | null | null | #include "DX12Texture.h"
#include <Netcode/Graphics/ResourceEnums.h>
namespace Netcode::Graphics::DX12 {
TextureImpl::TextureImpl(DirectX::ScratchImage && tData) : textureData{ std::move(tData) } { }
ResourceDimension TextureImpl::GetDimension() const {
switch(textureData.GetMetadata().dimension) {
case Direc... | 28.051282 | 95 | 0.761426 | tyekx |
1f6095e0501b3180f137aed60a32735022874f28 | 121,952 | cc | C++ | Translator_file/examples/step-32/step-32.cc | jiaqiwang969/deal.ii-course-practice | 0da5ad1537d8152549d8a0e4de5872efe7619c8a | [
"MIT"
] | null | null | null | Translator_file/examples/step-32/step-32.cc | jiaqiwang969/deal.ii-course-practice | 0da5ad1537d8152549d8a0e4de5872efe7619c8a | [
"MIT"
] | null | null | null | Translator_file/examples/step-32/step-32.cc | jiaqiwang969/deal.ii-course-practice | 0da5ad1537d8152549d8a0e4de5872efe7619c8a | [
"MIT"
] | null | null | null |
/* ---------------------------------------------------------------------
*
* Copyright (C) 2008 - 2021 by the deal.II authors
*
* This file is part of the deal.II library.
*
* The deal.II library is free software; you can use it, redistribute
* it, and/or modify it under the terms of the GNU Lesser Gene... | 42.315059 | 776 | 0.639662 | jiaqiwang969 |
48f65f0e6699a515f68b054415877b7325865330 | 2,169 | cpp | C++ | RowOperation.cpp | spencerparkin/MatrixMath | 3fb3c95e4948e5a37912ee098176598d46ab6759 | [
"MIT"
] | null | null | null | RowOperation.cpp | spencerparkin/MatrixMath | 3fb3c95e4948e5a37912ee098176598d46ab6759 | [
"MIT"
] | null | null | null | RowOperation.cpp | spencerparkin/MatrixMath | 3fb3c95e4948e5a37912ee098176598d46ab6759 | [
"MIT"
] | null | null | null | // RowOperation.cpp
#include "RowOperation.h"
#include "Element.h"
#include "Matrix.h"
void MatrixMath::DeleteRowOperationList( RowOperationList& rowOperationList )
{
while( rowOperationList.size() > 0 )
{
RowOperationList::iterator iter = rowOperationList.begin();
RowOperation* rowOperation = *iter;
delete r... | 21.058252 | 90 | 0.681881 | spencerparkin |
48f824644beec0164416cd3e0b96bef31a14d756 | 158 | cpp | C++ | notebooks/funcs1.cpp | itachi4869/sta-663-2021 | 6f7a50f4a95207a26b01afa4439d992d767a1387 | [
"MIT"
] | null | null | null | notebooks/funcs1.cpp | itachi4869/sta-663-2021 | 6f7a50f4a95207a26b01afa4439d992d767a1387 | [
"MIT"
] | null | null | null | notebooks/funcs1.cpp | itachi4869/sta-663-2021 | 6f7a50f4a95207a26b01afa4439d992d767a1387 | [
"MIT"
] | null | null | null | #include <pybind11/pybind11.h>
namespace py = pybind11;
int add(int a, int b) {
return a + b;
}
void init_f1(py::module &m) {
m.def("add", &add);
}
| 14.363636 | 30 | 0.601266 | itachi4869 |
48f9e695830e4fcebacbfa114da02000578d9f94 | 2,818 | cpp | C++ | src/Pauli_Matrix.cpp | nicksacco17/QPU | 29949a6dfe6a43673413925908440138862a3050 | [
"MIT"
] | null | null | null | src/Pauli_Matrix.cpp | nicksacco17/QPU | 29949a6dfe6a43673413925908440138862a3050 | [
"MIT"
] | null | null | null | src/Pauli_Matrix.cpp | nicksacco17/QPU | 29949a6dfe6a43673413925908440138862a3050 | [
"MIT"
] | null | null | null |
#include <iostream>
#include <iomanip>
#include "../include/Pauli_Matrix.h"
using std::cout;
using std::endl;
using namespace std::complex_literals;
Pauli_Matrix::Pauli_Matrix(string pauli_type)
{
// Pauli-X Matrix
// | 0 1 |
// | 1 0 |
if (pauli_type == "X" || pauli_type == "x")
{
m_num_row = 2;
m_num_col ... | 20.273381 | 125 | 0.565649 | nicksacco17 |
48fdcaa20efb0e9c90e88e2295002da29f9a7ade | 1,838 | cc | C++ | pw_thread_threadx/sleep.cc | antmicro/pigweed | a308c3354a6131425e3f484f07f05a1813948860 | [
"Apache-2.0"
] | null | null | null | pw_thread_threadx/sleep.cc | antmicro/pigweed | a308c3354a6131425e3f484f07f05a1813948860 | [
"Apache-2.0"
] | null | null | null | pw_thread_threadx/sleep.cc | antmicro/pigweed | a308c3354a6131425e3f484f07f05a1813948860 | [
"Apache-2.0"
] | null | null | null | // Copyright 2020 The Pigweed Authors
//
// 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
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agre... | 34.679245 | 80 | 0.736126 | antmicro |
5b01e9f8a7ecf5aa9af4bd4b721f5a604bf0f518 | 1,343 | cpp | C++ | Vic2ToHoI4Tests/HoI4WorldTests/Regions/RegionsTests.cpp | CarbonY26/Vic2ToHoI4 | af3684d6aaaafea81aaadfb64a21a2b696f618e1 | [
"MIT"
] | 25 | 2018-12-10T03:41:49.000Z | 2021-10-04T10:42:36.000Z | Vic2ToHoI4Tests/HoI4WorldTests/Regions/RegionsTests.cpp | CarbonY26/Vic2ToHoI4 | af3684d6aaaafea81aaadfb64a21a2b696f618e1 | [
"MIT"
] | 739 | 2018-12-13T02:01:20.000Z | 2022-03-28T02:57:13.000Z | Vic2ToHoI4Tests/HoI4WorldTests/Regions/RegionsTests.cpp | IhateTrains/Vic2ToHoI4 | 5ad7f7c259f7495a10e043ade052d3b18a8951dc | [
"MIT"
] | 43 | 2018-12-10T03:41:58.000Z | 2022-03-22T23:55:41.000Z | #include "HOI4World/Regions/Regions.h"
#include "HOI4World/Regions/RegionsFactory.h"
#include "gtest/gtest.h"
TEST(HoI4World_Regions_RegionsTests, ProvinceInUnmappedRegionsReturnsNullptr)
{
const auto regions = HoI4::Regions::Factory().getRegions();
EXPECT_EQ(std::nullopt, regions->getRegion(0));
}
TEST(HoI4Wor... | 25.826923 | 77 | 0.787789 | CarbonY26 |
5b090d1d235ea99090453fb502d25c409a36e385 | 437 | cpp | C++ | src/ooni/tcp_connect.cpp | alessandro40/libight | de434be18791844076603b50167c436a768e830e | [
"BSD-2-Clause"
] | null | null | null | src/ooni/tcp_connect.cpp | alessandro40/libight | de434be18791844076603b50167c436a768e830e | [
"BSD-2-Clause"
] | null | null | null | src/ooni/tcp_connect.cpp | alessandro40/libight | de434be18791844076603b50167c436a768e830e | [
"BSD-2-Clause"
] | null | null | null | #include <ight/ooni/tcp_connect.hpp>
using namespace ight::common::settings;
using namespace ight::ooni::tcp_connect;
void
TCPConnect::main(std::string input, Settings options,
std::function<void(ReportEntry)>&& cb)
{
options["host"] = input;
have_entry = cb;
client = connect(options, [th... | 25.705882 | 71 | 0.652174 | alessandro40 |
5b0b2b772b7a54dc8872b0c5c97e82516bea0976 | 6,858 | cpp | C++ | extras/usd/examples/usdDancingCubesExample/fileFormat.cpp | chen2qu/USD | 2bbedce05f61f37e7461b0319609f9ceeb91725e | [
"AML"
] | 88 | 2018-07-13T01:22:00.000Z | 2022-01-16T22:15:27.000Z | extras/usd/examples/usdDancingCubesExample/fileFormat.cpp | chen2qu/USD | 2bbedce05f61f37e7461b0319609f9ceeb91725e | [
"AML"
] | 1 | 2022-01-14T21:25:56.000Z | 2022-01-14T21:25:56.000Z | extras/usd/examples/usdDancingCubesExample/fileFormat.cpp | chen2qu/USD | 2bbedce05f61f37e7461b0319609f9ceeb91725e | [
"AML"
] | 26 | 2018-06-06T03:39:22.000Z | 2021-08-28T23:02:42.000Z | //
// Copyright 2019 Pixar
//
// Licensed under the Apache License, Version 2.0 (the "Apache License")
// with the following modification; you may not use this file except in
// compliance with the Apache License and the following modification to it:
// Section 6. Trademarks. is deleted and replaced with:
//
// 6. Trad... | 34.989796 | 86 | 0.729805 | chen2qu |
5b0bc75ab024c51e45cbebf36350bfb7371fa7f8 | 1,110 | cpp | C++ | 5. Longest Palindromic Substring/main.cpp | majianfei/leetcode | d79ad7dd8c07e9f816b5727d1d98eb55c719cb6d | [
"MIT"
] | null | null | null | 5. Longest Palindromic Substring/main.cpp | majianfei/leetcode | d79ad7dd8c07e9f816b5727d1d98eb55c719cb6d | [
"MIT"
] | null | null | null | 5. Longest Palindromic Substring/main.cpp | majianfei/leetcode | d79ad7dd8c07e9f816b5727d1d98eb55c719cb6d | [
"MIT"
] | null | null | null | #include <iostream>
//TODO,优化
/**
* Runtime: 200 ms, faster than 24.74% of C++ online submissions for Longest Palindromic Substring.
* Memory Usage: 186.7 MB, less than 8.03% of C++ online submissions for Longest Palindromic Substring.
*/
class Solution {
public:
string longestPalindrome(string s) {
... | 30.833333 | 104 | 0.405405 | majianfei |
5b0d1239ad6bc344a9de0962a281c2bd72ab450d | 34,960 | cpp | C++ | tester_src/mockgenSampleTestBody.cpp | zettsu-t/cppMockgen | 4e33e904f50beeb90388c533e9bb21890d68d26e | [
"BSD-3-Clause"
] | null | null | null | tester_src/mockgenSampleTestBody.cpp | zettsu-t/cppMockgen | 4e33e904f50beeb90388c533e9bb21890d68d26e | [
"BSD-3-Clause"
] | null | null | null | tester_src/mockgenSampleTestBody.cpp | zettsu-t/cppMockgen | 4e33e904f50beeb90388c533e9bb21890d68d26e | [
"BSD-3-Clause"
] | null | null | null | // Declare forwarders
#include "varDecl_mockgenSample1.hpp"
// Swap class names used later to their decorator
#include "typeSwapper_mockgenSample1.hpp"
#include "mockgenSample2.hpp"
#include "mockgenTesterUtility.hpp"
#include <gtest/gtest.h>
using namespace MyUnittest;
using namespace Sample1;
using nam... | 42.738386 | 127 | 0.631922 | zettsu-t |
5b0f16732c0d3bae4e7472b5eb745cf1c43a17da | 2,784 | cc | C++ | exam_in_class/1/yet_another_beautiful_merged_sequence.cc | jamie-jjd/110_spring_IDS | 7f15c0c73b9d663373b791b9ddcc836957dcc3d2 | [
"MIT"
] | 2 | 2022-02-21T10:37:22.000Z | 2022-03-02T01:43:30.000Z | exam_in_class/1/yet_another_beautiful_merged_sequence.cc | jamie-jjd/110_spring_IDS | 7f15c0c73b9d663373b791b9ddcc836957dcc3d2 | [
"MIT"
] | null | null | null | exam_in_class/1/yet_another_beautiful_merged_sequence.cc | jamie-jjd/110_spring_IDS | 7f15c0c73b9d663373b791b9ddcc836957dcc3d2 | [
"MIT"
] | 3 | 2022-02-21T05:06:19.000Z | 2022-03-27T07:58:11.000Z | /*
* author: redleaf
* email: redleaf23477@gapp.nthu.edu.tw
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
/*
* Actually this problem is Dilworth theorem:
* Let (x1, y1) <= (x2, y2) iff x1 <= x2 and y1 <= y2
* Let (x1, y1) || (x2, y2) iff x1 < x2 and y1 > y2 (incompariable)
*
* T... | 23.2 | 108 | 0.426006 | jamie-jjd |
5b12d17b3c8615a467e02e6de9544628872890f3 | 823 | cpp | C++ | AlignmentApprox.cpp | caiks/AlignmentC | 65800c03ff78369718e4d590e35b8c1e915adfa0 | [
"MIT"
] | 1 | 2020-02-19T14:58:14.000Z | 2020-02-19T14:58:14.000Z | AlignmentApprox.cpp | caiks/AlignmentC | 65800c03ff78369718e4d590e35b8c1e915adfa0 | [
"MIT"
] | null | null | null | AlignmentApprox.cpp | caiks/AlignmentC | 65800c03ff78369718e4d590e35b8c1e915adfa0 | [
"MIT"
] | null | null | null | #include "AlignmentApprox.h"
using namespace Alignment;
// histogramsEntropy :: Histogram -> Double
double Alignment::histogramsEntropy(const Histogram& aa)
{
auto s = histogramsSize(aa);
double e = 0.0;
for (auto it = aa.map_u().begin(); it != aa.map_u().end(); ++it)
if (it->second > 0)
{
doub... | 26.548387 | 68 | 0.607533 | caiks |
5b1335d4fbb2657d3f9f60a18cf5f049b3d8bdcd | 4,411 | hpp | C++ | src/vec4.hpp | kiwicom/catboost-cxx | 7ae872fe9418215b6592e1a947d1cd4bc5b10b3d | [
"MIT"
] | 5 | 2021-02-17T14:46:26.000Z | 2021-08-28T20:10:02.000Z | src/vec4.hpp | kiwicom/catboost-cxx | 7ae872fe9418215b6592e1a947d1cd4bc5b10b3d | [
"MIT"
] | null | null | null | src/vec4.hpp | kiwicom/catboost-cxx | 7ae872fe9418215b6592e1a947d1cd4bc5b10b3d | [
"MIT"
] | 3 | 2020-12-18T07:43:29.000Z | 2021-04-26T13:29:43.000Z | #pragma once
#ifndef NOSSE
// SSE4.1
#include <smmintrin.h>
#include <cstdint>
namespace catboost {
struct Vec4i {
__m128i v;
Vec4i() : v(_mm_set_epi32(0, 0, 0, 0)) {}
explicit Vec4i(__m128i x) : v(x) {}
explicit Vec4i(__m128 x) : v(_mm_castps_si128(x)) {}
explicit Vec4i(uint32_t x0, uint32_t x... | 27.06135 | 108 | 0.590569 | kiwicom |
5b1657def1ed0ccf941d0cba721f2570ed1536dc | 7,816 | cpp | C++ | test/test_FMinus.cpp | skmuduli92/libprop | 982753ee446a44aef2bfa92c944a3ce20c4a45ad | [
"BSD-3-Clause"
] | null | null | null | test/test_FMinus.cpp | skmuduli92/libprop | 982753ee446a44aef2bfa92c944a3ce20c4a45ad | [
"BSD-3-Clause"
] | null | null | null | test/test_FMinus.cpp | skmuduli92/libprop | 982753ee446a44aef2bfa92c944a3ce20c4a45ad | [
"BSD-3-Clause"
] | 2 | 2020-10-06T15:26:51.000Z | 2020-10-11T12:55:00.000Z |
#include <gtest/gtest.h>
#include "formula.h"
#include "parse_util.h"
#include "formula_util.h"
#include "trace.h"
#include "formula_util.h"
using namespace HyperPLTL;
using namespace std;
PHyperProp propertyOnceMinusOperator() {
PVarMap varmap = std::make_shared<VarMap>();
varmap->addIntVar("x");
varmap->ad... | 29.94636 | 87 | 0.670164 | skmuduli92 |
5b16a4ac2415ecf7c2f5d50a7f5f5b7738fafef7 | 9,075 | cpp | C++ | listeners/GPII_RFIDListener/src/Diagnostic.cpp | colinbdclark/windows | 3eb9e8c4bda54bc583af7309998ab202370bde23 | [
"BSD-3-Clause"
] | null | null | null | listeners/GPII_RFIDListener/src/Diagnostic.cpp | colinbdclark/windows | 3eb9e8c4bda54bc583af7309998ab202370bde23 | [
"BSD-3-Clause"
] | null | null | null | listeners/GPII_RFIDListener/src/Diagnostic.cpp | colinbdclark/windows | 3eb9e8c4bda54bc583af7309998ab202370bde23 | [
"BSD-3-Clause"
] | null | null | null | ///////////////////////////////////////////////////////////////////////////////
//
// Diagnostic.cpp
//
// Copyright 2014 OpenDirective Ltd.
//
// Licensed under the New BSD license. You may not use this file except in
// compliance with this License.
//
// You may obtain a copy of the License at
// https://github.com/... | 30.555556 | 98 | 0.53168 | colinbdclark |
5b1889c5959378c5db3f7e2f15ab2b20ed176b81 | 2,291 | cpp | C++ | YorozuyaGSLib/source/US__AbstractThreadDetail.cpp | lemkova/Yorozuya | f445d800078d9aba5de28f122cedfa03f26a38e4 | [
"MIT"
] | 29 | 2017-07-01T23:08:31.000Z | 2022-02-19T10:22:45.000Z | YorozuyaGSLib/source/US__AbstractThreadDetail.cpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 90 | 2017-10-18T21:24:51.000Z | 2019-06-06T02:30:33.000Z | YorozuyaGSLib/source/US__AbstractThreadDetail.cpp | kotopes/Yorozuya | 605c97d3a627a8f6545cc09f2a1b0a8afdedd33a | [
"MIT"
] | 44 | 2017-12-19T08:02:59.000Z | 2022-02-24T23:15:01.000Z | #include <US__AbstractThreadDetail.hpp>
#include <common/ATFCore.hpp>
START_ATF_NAMESPACE
namespace US
{
namespace Detail
{
Info::US__AbstractThreadctor_AbstractThread2_ptr US__AbstractThreadctor_AbstractThread2_next(nullptr);
Info::US__AbstractThreadctor_A... | 46.755102 | 122 | 0.647316 | lemkova |
5b1f73ee50254763be96b6984639258706861a64 | 3,640 | cpp | C++ | Boggle/code_1.cpp | Jatin-Goyal5/Data-Structures-and-Algorithms | f6bd0f77e5640c2e0568f3fffc4694758e77af96 | [
"MIT"
] | 27 | 2019-01-31T10:22:29.000Z | 2021-08-29T08:25:12.000Z | Boggle/code_1.cpp | Jatin-Goyal5/Data-Structures-and-Algorithms | f6bd0f77e5640c2e0568f3fffc4694758e77af96 | [
"MIT"
] | 6 | 2020-09-30T19:01:49.000Z | 2020-12-17T15:10:54.000Z | Boggle/code_1.cpp | Jatin-Goyal5/Data-Structures-and-Algorithms | f6bd0f77e5640c2e0568f3fffc4694758e77af96 | [
"MIT"
] | 27 | 2019-09-21T14:19:32.000Z | 2021-09-15T03:06:41.000Z | //
// code_1.cpp
// Algorithm
//
// Created by Mohd Shoaib Rayeen on 23/11/18.
// Copyright © 2018 Shoaib Rayeen. All rights reserved.
//
#include <iostream>
using namespace std;
#define char_int(c) ((int)c - (int)'A')
#define SIZE (26)
#define M 3
#define N 3
struct TrieNode {
TrieNode *Child[SIZE];
... | 28.4375 | 97 | 0.467308 | Jatin-Goyal5 |
5b1fc763f2b4d71d72ca122a57c98b9e2f695e8a | 1,821 | hpp | C++ | src/hex_pathfinding.hpp | cbeck88/HexWarfare | 94a70b1889afc2fbd990892ed66be874ac70d1b4 | [
"Apache-2.0"
] | null | null | null | src/hex_pathfinding.hpp | cbeck88/HexWarfare | 94a70b1889afc2fbd990892ed66be874ac70d1b4 | [
"Apache-2.0"
] | null | null | null | src/hex_pathfinding.hpp | cbeck88/HexWarfare | 94a70b1889afc2fbd990892ed66be874ac70d1b4 | [
"Apache-2.0"
] | null | null | null | /*
Copyright 2014 Kristina Simpson <sweet.kristas@gmail.com>
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 ... | 34.358491 | 153 | 0.772103 | cbeck88 |
5b212909a05b5b47a6fb5f163a4ee1a9f760e082 | 2,291 | cpp | C++ | src/options.cpp | spjewkes/jrnz | 5a7706c102e19f7e004ffc4fda87843790f804b3 | [
"MIT"
] | null | null | null | src/options.cpp | spjewkes/jrnz | 5a7706c102e19f7e004ffc4fda87843790f804b3 | [
"MIT"
] | 29 | 2017-03-18T08:29:08.000Z | 2019-09-13T12:20:25.000Z | src/options.cpp | spjewkes/jrnz | 5a7706c102e19f7e004ffc4fda87843790f804b3 | [
"MIT"
] | null | null | null | /**
* @brief Source file implementing the programm options class.
*/
#include <iostream>
#include <getopt.h>
#include "options.hpp"
void Options::print_help()
{
std::cout << "Run: " << m_argv[0] << "[--help] [--debug] [--rom <filename>] [--break <line_no>]\n";
std::cout << "\t--help - displays t... | 21.212963 | 103 | 0.507639 | spjewkes |
5b21786e54a5cf1abf566e8988f8e7e8d35cf6a7 | 542 | cpp | C++ | Example/signals2_09/main.cpp | KwangjoJeong/Boost | 29c4e2422feded66a689e3aef73086c5cf95b6fe | [
"MIT"
] | null | null | null | Example/signals2_09/main.cpp | KwangjoJeong/Boost | 29c4e2422feded66a689e3aef73086c5cf95b6fe | [
"MIT"
] | null | null | null | Example/signals2_09/main.cpp | KwangjoJeong/Boost | 29c4e2422feded66a689e3aef73086c5cf95b6fe | [
"MIT"
] | null | null | null | #include <boost/signals2.hpp>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace boost::signals2;
template <typename T>
struct return_all
{
typedef T result_type;
template <typename InputIterator>
T operator()(InputIterator first, InputIterator last) const
{
return T(first, last);... | 20.074074 | 61 | 0.654982 | KwangjoJeong |
5b21815c57f4d6d963a85fa20cd49e71e3769472 | 881 | cpp | C++ | solutions/LeetCode/C++/708.cpp | timxor/leetcode-journal | 5f1cb6bcc44a5bc33d88fb5cdb4126dfc6f4232a | [
"MIT"
] | 854 | 2018-11-09T08:06:16.000Z | 2022-03-31T06:05:53.000Z | solutions/LeetCode/C++/708.cpp | timxor/leetcode-journal | 5f1cb6bcc44a5bc33d88fb5cdb4126dfc6f4232a | [
"MIT"
] | 29 | 2019-06-02T05:02:25.000Z | 2021-11-15T04:09:37.000Z | solutions/LeetCode/C++/708.cpp | timxor/leetcode-journal | 5f1cb6bcc44a5bc33d88fb5cdb4126dfc6f4232a | [
"MIT"
] | 347 | 2018-12-23T01:57:37.000Z | 2022-03-12T14:51:21.000Z | __________________________________________________________________________________________________
class Solution {
public:
Node* insert(Node* head, int insertVal) {
if (!head) {
head = new Node(insertVal, NULL);
head->next = head;
return head;
}
Node *pre... | 36.708333 | 98 | 0.642452 | timxor |
5b22a1f788e2575fadac2c4ae7a61c8d2985312a | 1,180 | cc | C++ | chrome/browser/ui/commander/commander.cc | chromium/chromium | df46e572c3449a4b108d6e02fbe4f6d24cf98381 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 14,668 | 2015-01-01T01:57:10.000Z | 2022-03-31T23:33:32.000Z | chrome/browser/ui/commander/commander.cc | chromium/chromium | df46e572c3449a4b108d6e02fbe4f6d24cf98381 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 86 | 2015-10-21T13:02:42.000Z | 2022-03-14T07:50:50.000Z | chrome/browser/ui/commander/commander.cc | chromium/chromium | df46e572c3449a4b108d6e02fbe4f6d24cf98381 | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 5,941 | 2015-01-02T11:32:21.000Z | 2022-03-31T16:35:46.000Z | // Copyright 2020 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/commander/commander.h"
#include "base/no_destructor.h"
#include "chrome/browser/ui/commander/commander_controller.h"
#include... | 27.44186 | 73 | 0.754237 | chromium |
5b22f927d629a0595735e30fa52ce74c0d7fcbd7 | 2,201 | cpp | C++ | 44_DigitsInSequence/DigitsInSequence.cpp | NoMoreWaiting/CodingInterviewChinese2 | 458b2fb52b91a6601fd9b70dd3b973d30c2f3f52 | [
"BSD-3-Clause"
] | null | null | null | 44_DigitsInSequence/DigitsInSequence.cpp | NoMoreWaiting/CodingInterviewChinese2 | 458b2fb52b91a6601fd9b70dd3b973d30c2f3f52 | [
"BSD-3-Clause"
] | null | null | null | 44_DigitsInSequence/DigitsInSequence.cpp | NoMoreWaiting/CodingInterviewChinese2 | 458b2fb52b91a6601fd9b70dd3b973d30c2f3f52 | [
"BSD-3-Clause"
] | null | null | null | /*******************************************************************
Copyright(c) 2016, Harry He
All rights reserved.
Distributed under the BSD license.
(See accompanying file LICENSE.txt at
https://github.com/zhedahht/CodingInterviewChinese2/blob/master/LICENSE.txt)
***************************************************... | 22.690722 | 76 | 0.569741 | NoMoreWaiting |
5b23bffd5b659712ed85ddb653b3f0201114a184 | 2,060 | cc | C++ | cnet_network_delegate.cc | yahoo/cnet | d36ee43bd86ac13df5bd034f61af96b98bfed65a | [
"BSD-3-Clause"
] | 16 | 2015-02-04T17:15:04.000Z | 2019-05-14T11:53:29.000Z | cnet_network_delegate.cc | yahoo/cnet | d36ee43bd86ac13df5bd034f61af96b98bfed65a | [
"BSD-3-Clause"
] | null | null | null | cnet_network_delegate.cc | yahoo/cnet | d36ee43bd86ac13df5bd034f61af96b98bfed65a | [
"BSD-3-Clause"
] | 13 | 2015-04-15T07:28:05.000Z | 2019-06-19T01:47:26.000Z | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Changes to this code are Copyright 2014, Yahoo! Inc.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "yahoo/cnet/cnet_network_delegate.h"
#include "net/base/net_errors.h"
namespace cne... | 28.611111 | 86 | 0.766505 | yahoo |
5b240a57d34a46dc1bec99d97e7f964d1405ae3d | 2,761 | cpp | C++ | src/Utils/String.cpp | vincentdelpech/biorbd | 0d7968e75e182f067a4d4c24cc15fa9a331ca792 | [
"MIT"
] | null | null | null | src/Utils/String.cpp | vincentdelpech/biorbd | 0d7968e75e182f067a4d4c24cc15fa9a331ca792 | [
"MIT"
] | null | null | null | src/Utils/String.cpp | vincentdelpech/biorbd | 0d7968e75e182f067a4d4c24cc15fa9a331ca792 | [
"MIT"
] | null | null | null | #define BIORBD_API_EXPORTS
#include "Utils/String.h"
#include <map>
#include <algorithm>
#include <vector>
#include <boost/lexical_cast.hpp>
#include "Utils/Error.h"
biorbd::utils::String::String()
: std::string("")
{
}
biorbd::utils::String::String(const char *c)
: std::string(c)
{
}
biorbd::utils::Strin... | 25.330275 | 105 | 0.648678 | vincentdelpech |
5b24ce8aae34b943b10c84e33e9fb73e4a00f68e | 16,480 | hh | C++ | dune/gdt/interpolations/boundary.hh | pymor/dune-gdt | fabc279a79e7362181701866ce26133ec40a05e0 | [
"BSD-2-Clause"
] | 4 | 2018-10-12T21:46:08.000Z | 2020-08-01T18:54:02.000Z | dune/gdt/interpolations/boundary.hh | dune-community/dune-gdt | fabc279a79e7362181701866ce26133ec40a05e0 | [
"BSD-2-Clause"
] | 154 | 2016-02-16T13:50:54.000Z | 2021-12-13T11:04:29.000Z | dune/gdt/interpolations/boundary.hh | dune-community/dune-gdt | fabc279a79e7362181701866ce26133ec40a05e0 | [
"BSD-2-Clause"
] | 5 | 2016-03-02T10:11:20.000Z | 2020-02-08T03:56:24.000Z | // This file is part of the dune-gdt project:
// https://github.com/dune-community/dune-gdt
// Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.
// License: Dual licensed as BSD 2-Clause License (http://opensource.org/licenses/BSD-2-Clause)
// or GPL-2.0+ (http://opensource.org/lice... | 48.328446 | 120 | 0.694782 | pymor |
5b2686e34d63b86fc5a4ba61e692695f64e1e914 | 6,000 | cpp | C++ | test/marker.cpp | fizyr/dr_marker | 039cdff23516749c5830acdce7f7be5ba71cae02 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | test/marker.cpp | fizyr/dr_marker | 039cdff23516749c5830acdce7f7be5ba71cae02 | [
"Apache-2.0",
"BSD-3-Clause"
] | null | null | null | test/marker.cpp | fizyr/dr_marker | 039cdff23516749c5830acdce7f7be5ba71cae02 | [
"Apache-2.0",
"BSD-3-Clause"
] | 1 | 2018-06-06T10:07:13.000Z | 2018-06-06T10:07:13.000Z | /**
* Copyright 2014-2018 Fizyr BV. https://fizyr.com
*
* 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... | 32.258065 | 83 | 0.716833 | fizyr |
5b275307317bec0185acada3bc496e71c96d3347 | 32,316 | cpp | C++ | src/Services/PickerService/PickerService.cpp | irov/Mengine | b76e9f8037325dd826d4f2f17893ac2b236edad8 | [
"MIT"
] | 39 | 2016-04-21T03:25:26.000Z | 2022-01-19T14:16:38.000Z | src/Services/PickerService/PickerService.cpp | irov/Mengine | b76e9f8037325dd826d4f2f17893ac2b236edad8 | [
"MIT"
] | 23 | 2016-06-28T13:03:17.000Z | 2022-02-02T10:11:54.000Z | src/Services/PickerService/PickerService.cpp | irov/Mengine | b76e9f8037325dd826d4f2f17893ac2b236edad8 | [
"MIT"
] | 14 | 2016-06-22T20:45:37.000Z | 2021-07-05T12:25:19.000Z | #include "PickerService.h"
#include "Interface/InputServiceInterface.h"
#include "Interface/ApplicationInterface.h"
#include "Interface/EnumeratorServiceInterface.h"
#include "Kernel/Arrow.h"
#include "Kernel/Scene.h"
#include "Kernel/VectorAuxScope.h"
#include "Kernel/Logger.h"
#include "Kernel/VectorAuxScope.h"
#in... | 30.089385 | 172 | 0.453398 | irov |
5b2a210b884266a9629387e4c463dc844adb3705 | 1,182 | cpp | C++ | examples/twiscanner/main.cpp | 2ni/aprico | 0b421a1dcf523474d17df06ab5467ef5c369a6cd | [
"MIT"
] | 1 | 2021-03-02T19:54:04.000Z | 2021-03-02T19:54:04.000Z | examples/twiscanner/main.cpp | 2ni/aprico | 0b421a1dcf523474d17df06ab5467ef5c369a6cd | [
"MIT"
] | null | null | null | examples/twiscanner/main.cpp | 2ni/aprico | 0b421a1dcf523474d17df06ab5467ef5c369a6cd | [
"MIT"
] | null | null | null | #include <util/delay.h>
#include <avr/io.h>
#include "uart.h"
#include "twi.h"
#include "mcu.h"
int main(void) {
mcu_init();
twi_init();
DL("start scanning");
for (uint8_t addr = 0; addr<128; addr+=1) {
// DF("0x%02x: %s\n", addr, twi_start(addr) ? "-" : "yes");
if (!twi_start(addr)) {
DF("0x%... | 22.730769 | 79 | 0.551607 | 2ni |
5b334ef7343ddfff5c1f6c39173f40733da94898 | 536 | cpp | C++ | Inheritance/hierarchical.cpp | git-elliot/competitive_programming_codes | b8b5646ae5074b453e7f1af982af174b9c4138e1 | [
"MIT"
] | 1 | 2021-06-20T17:28:54.000Z | 2021-06-20T17:28:54.000Z | Inheritance/hierarchical.cpp | git-elliot/competitive_programming_codes | b8b5646ae5074b453e7f1af982af174b9c4138e1 | [
"MIT"
] | null | null | null | Inheritance/hierarchical.cpp | git-elliot/competitive_programming_codes | b8b5646ae5074b453e7f1af982af174b9c4138e1 | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
//Hierarchical inheritance is defined as the process of deriving more than one class from a base class.
class Shape{
public:
int a = 10;
int b = 20;
};
class Rectange : public Shape{
public:
int area(){
return a*b;
}
};
class Triangle : public Sh... | 18.482759 | 103 | 0.602612 | git-elliot |
5b35ba30ca6d5dfdd25a376ffe5581c1cef53dc4 | 582 | cpp | C++ | libcxx/test/libcxx/modules/stdint_h_exports.sh.cpp | clayne/libcudacxx | b6908c62833db1f0bb5ae06944f6613f23d814b3 | [
"Apache-2.0"
] | 778 | 2015-01-01T03:30:02.000Z | 2022-03-20T15:58:39.000Z | libcxx/test/libcxx/modules/stdint_h_exports.sh.cpp | clayne/libcudacxx | b6908c62833db1f0bb5ae06944f6613f23d814b3 | [
"Apache-2.0"
] | 47 | 2019-12-11T02:34:13.000Z | 2020-06-08T19:26:59.000Z | libcxx/test/libcxx/modules/stdint_h_exports.sh.cpp | clayne/libcudacxx | b6908c62833db1f0bb5ae06944f6613f23d814b3 | [
"Apache-2.0"
] | 412 | 2015-01-01T06:25:38.000Z | 2022-03-26T16:58:34.000Z | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... | 26.454545 | 80 | 0.508591 | clayne |
5b35e72d4a64ecc037629c4f870702465262d8e3 | 156 | cpp | C++ | examples/core/static/application/main.cpp | smeualex/cmake-examples | d443a5d9359565f474f56f0251a511544b2168eb | [
"MIT"
] | 979 | 2019-03-10T15:31:09.000Z | 2022-03-26T03:58:49.000Z | examples/core/static/application/main.cpp | smeualex/cmake-examples | d443a5d9359565f474f56f0251a511544b2168eb | [
"MIT"
] | 9 | 2019-03-11T13:05:08.000Z | 2021-09-27T21:27:07.000Z | examples/core/static/application/main.cpp | smeualex/cmake-examples | d443a5d9359565f474f56f0251a511544b2168eb | [
"MIT"
] | 56 | 2019-03-11T07:05:54.000Z | 2022-02-23T14:00:59.000Z | #include <iostream>
#include "calculator-static/calculator.h"
int main(int argc, char** argv)
{
std::cout << calc::square(4) << "\n";
return 0;
}
| 15.6 | 41 | 0.621795 | smeualex |
5b376114194c63acba15113fcd514aec00167d28 | 492 | hpp | C++ | FootCommander.hpp | Revertigo/wargame-b | 8cd4591586b275923c38047c480a61529cc199dc | [
"MIT"
] | null | null | null | FootCommander.hpp | Revertigo/wargame-b | 8cd4591586b275923c38047c480a61529cc199dc | [
"MIT"
] | null | null | null | FootCommander.hpp | Revertigo/wargame-b | 8cd4591586b275923c38047c480a61529cc199dc | [
"MIT"
] | null | null | null | //
// Created by osboxes on 5/19/20.
//
#ifndef WARGAME_A_FOOTCOMMANDER_HPP
#define WARGAME_A_FOOTCOMMANDER_HPP
#include "FootSoldier.hpp"
class FootCommander : public FootSoldier {
using FootSoldier::FootSoldier;
static const int DMG = 20;
static const int HP = 150;
protected:
void act(pair<int, in... | 19.68 | 76 | 0.721545 | Revertigo |
5b38ab5fa55a82fcad14eb97c0489a7ae842c601 | 14,132 | cpp | C++ | test/input_cases/csp_financial_defaults.cpp | JordanMalan/ssc | cadb7a9f3183d63c600b5c33f53abced35b6b319 | [
"BSD-3-Clause"
] | 61 | 2017-08-09T15:10:59.000Z | 2022-02-15T21:45:31.000Z | test/input_cases/csp_financial_defaults.cpp | JordanMalan/ssc | cadb7a9f3183d63c600b5c33f53abced35b6b319 | [
"BSD-3-Clause"
] | 462 | 2017-07-31T21:26:46.000Z | 2022-03-30T22:53:50.000Z | test/input_cases/csp_financial_defaults.cpp | JordanMalan/ssc | cadb7a9f3183d63c600b5c33f53abced35b6b319 | [
"BSD-3-Clause"
] | 73 | 2017-08-24T17:39:31.000Z | 2022-03-28T08:37:47.000Z | #include "../input_cases/code_generator_utilities.h"
/**
* Default parameters for the PPA singleowner (utility) financial model
*/
ssc_data_t singleowner_defaults()
{
ssc_data_t data = ssc_data_create();
ssc_data_set_number(data, "analysis_period", 25);
ssc_number_t p_federal_tax_rate[1] = { 21 };
ss... | 54.563707 | 88 | 0.755095 | JordanMalan |
5b42fd012491ec36c26d7ab0e6fa47e8c7a80fb4 | 3,763 | cpp | C++ | Co-Simulation/Sumo/sumo-1.7.0/src/libsumo/MeanData.cpp | uruzahe/carla | 940c2ab23cce1eda1ef66de35f66b42d40865fb1 | [
"MIT"
] | null | null | null | Co-Simulation/Sumo/sumo-1.7.0/src/libsumo/MeanData.cpp | uruzahe/carla | 940c2ab23cce1eda1ef66de35f66b42d40865fb1 | [
"MIT"
] | null | null | null | Co-Simulation/Sumo/sumo-1.7.0/src/libsumo/MeanData.cpp | uruzahe/carla | 940c2ab23cce1eda1ef66de35f66b42d40865fb1 | [
"MIT"
] | null | null | null | /****************************************************************************/
// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.org/sumo
// Copyright (C) 2017-2020 German Aerospace Center (DLR) and others.
// This program and the accompanying materials are made available under the
// terms of the Ecli... | 33.900901 | 126 | 0.581982 | uruzahe |
5b45ee309280c6904efe8f66d6a15b6d8a4ae950 | 3,673 | cpp | C++ | 3rdparty/webkit/Source/JavaScriptCore/runtime/RegExpCachedResult.cpp | mchiasson/PhaserNative | f867454602c395484bf730a7c43b9c586c102ac2 | [
"MIT"
] | null | null | null | 3rdparty/webkit/Source/JavaScriptCore/runtime/RegExpCachedResult.cpp | mchiasson/PhaserNative | f867454602c395484bf730a7c43b9c586c102ac2 | [
"MIT"
] | 9 | 2020-04-18T18:47:18.000Z | 2020-04-18T18:52:41.000Z | Source/JavaScriptCore/runtime/RegExpCachedResult.cpp | ijsf/DeniseEmbeddableWebKit | 57dfc6783d60f8f59b7129874e60f84d8c8556c9 | [
"BSD-3-Clause"
] | 1 | 2019-01-25T13:55:25.000Z | 2019-01-25T13:55:25.000Z | /*
* Copyright (C) 2012, 2016 Apple Inc. 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 condit... | 39.494624 | 178 | 0.725565 | mchiasson |
5b46ab1a6aff59cd4e94dd3da52da4c678152257 | 1,801 | hh | C++ | src/server/world/world.hh | TheBenPerson/Game | 824b2240e95529b735b4d8055a541c77102bb5dc | [
"MIT"
] | null | null | null | src/server/world/world.hh | TheBenPerson/Game | 824b2240e95529b735b4d8055a541c77102bb5dc | [
"MIT"
] | null | null | null | src/server/world/world.hh | TheBenPerson/Game | 824b2240e95529b735b4d8055a541c77102bb5dc | [
"MIT"
] | null | null | null | /*
*
* Game Development Build
* https://github.com/TheBenPerson/Game
*
* Copyright (C) 2016-2018 Ben Stockett <thebenstockett@gmail.com>
*
* 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 Soft... | 26.880597 | 81 | 0.738479 | TheBenPerson |
5b4808b262aef707ea7a7c1d8ebef6dda219df62 | 518 | cpp | C++ | CodeForces/fair_playoff.cpp | PieroNarciso/cprogramming | d3a53ce2afce6f853e0b7cc394190d5be6427902 | [
"MIT"
] | 2 | 2021-05-22T17:47:01.000Z | 2021-05-27T17:10:58.000Z | CodeForces/fair_playoff.cpp | PieroNarciso/cprogramming | d3a53ce2afce6f853e0b7cc394190d5be6427902 | [
"MIT"
] | null | null | null | CodeForces/fair_playoff.cpp | PieroNarciso/cprogramming | d3a53ce2afce6f853e0b7cc394190d5be6427902 | [
"MIT"
] | null | null | null | // https://codeforces.com/contest/1535/problem/A
#include <bits/stdc++.h>
using namespace std;
int s1, s2, s3, s4;
void solve() {
cin >> s1 >> s2 >> s3 >> s4;
int maxFirst = max(s1, s2);
int maxSec = max(s3, s4);
if ((maxFirst > s3 || maxFirst > s4) && (maxSec > s1 || maxSec > s2)) {
cout << "YES" << endl;
} ... | 17.862069 | 72 | 0.557915 | PieroNarciso |
5b49d4572a0c31abe9a58c95e07b28d9644d623f | 1,017 | hpp | C++ | include/boost/simd/function/definition/divfix.hpp | yaeldarmon/boost.simd | 561316cc54bdc6353ca78f3b6d7e9120acd11144 | [
"BSL-1.0"
] | null | null | null | include/boost/simd/function/definition/divfix.hpp | yaeldarmon/boost.simd | 561316cc54bdc6353ca78f3b6d7e9120acd11144 | [
"BSL-1.0"
] | null | null | null | include/boost/simd/function/definition/divfix.hpp | yaeldarmon/boost.simd | 561316cc54bdc6353ca78f3b6d7e9120acd11144 | [
"BSL-1.0"
] | null | null | null | //==================================================================================================
/*!
@file
@copyright 2016 NumScale SAS
@copyright 2016 J.T.Lapreste
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
*... | 26.763158 | 100 | 0.621436 | yaeldarmon |
5b4ad5e9c00c8c56a79d05f88a8e6c79b366f86b | 485 | c++ | C++ | Hackerrank/Pairs [Medium].c++ | ammar-sayed-taha/problem-solving | 9677a738c0cc30078f6450f40fcc26ba2a379a8b | [
"MIT"
] | 1 | 2020-02-20T00:04:54.000Z | 2020-02-20T00:04:54.000Z | Hackerrank/Pairs [Medium].c++ | ammar-sayed-taha/Problem-Solving | c3ef98b8b0ebfbcc31d45990822b81a9dc549fe8 | [
"MIT"
] | null | null | null | Hackerrank/Pairs [Medium].c++ | ammar-sayed-taha/Problem-Solving | c3ef98b8b0ebfbcc31d45990822b81a9dc549fe8 | [
"MIT"
] | null | null | null | #include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the pairs function below.
int pairs(int k, vector<int> arr) {
sort(arr.begin(), arr.end()); // O(nlgn)
int counter=0;
for(auto i = 0; i < arr.size(); i++){ // O(n)
for(auto j=i+1; j<arr.size(); j++){ ... | 20.208333 | 51 | 0.503093 | ammar-sayed-taha |
5b4d50307cb7b27c957e3b6c53e64d10fb71b23b | 13,609 | cc | C++ | device/usb/usb_service_impl.cc | kjthegod/chromium | cf940f7f418436b77e15b1ea23e6fa100ca1c91a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 1 | 2019-11-28T10:46:52.000Z | 2019-11-28T10:46:52.000Z | device/usb/usb_service_impl.cc | kjthegod/chromium | cf940f7f418436b77e15b1ea23e6fa100ca1c91a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | null | null | null | device/usb/usb_service_impl.cc | kjthegod/chromium | cf940f7f418436b77e15b1ea23e6fa100ca1c91a | [
"BSD-3-Clause-No-Nuclear-License-2014",
"BSD-3-Clause"
] | 2 | 2015-03-27T11:15:39.000Z | 2016-08-17T14:19:56.000Z | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "device/usb/usb_service.h"
#include <map>
#include <set>
#include "base/bind.h"
#include "base/lazy_instance.h"
#include "base/memory/weak_ptr.... | 32.557416 | 80 | 0.718936 | kjthegod |
5b5ab5562b01dcd69905548ea74ec37568c4e7cf | 1,005 | cpp | C++ | acmp.ru/0691/691.cpp | mstrechen/cp | ffac439840a71f70580a0ef197e47479e167a0eb | [
"MIT"
] | null | null | null | acmp.ru/0691/691.cpp | mstrechen/cp | ffac439840a71f70580a0ef197e47479e167a0eb | [
"MIT"
] | null | null | null | acmp.ru/0691/691.cpp | mstrechen/cp | ffac439840a71f70580a0ef197e47479e167a0eb | [
"MIT"
] | null | null | null | #include <iostream>
#include <set>
#include <string>
using namespace std;
char goodChars[12] = {'A', 'B', 'C', 'E', 'H', 'K', 'M', 'O', 'P', 'T', 'X', 'Y'};
char goodNumbers[10] = {'0','1','2','3','4','5','6','7','8','9'};
set<char> setOfChars(goodChars, goodChars+12);
set<char> setOfNums(goodNumbers, goodNumber... | 27.916667 | 83 | 0.610945 | mstrechen |
5b5f5435b492c3a5da001a943fa4102f9f138e54 | 784 | cpp | C++ | Week02-Sorting/291A.cpp | AAlab1819/Andrew-00000019529 | 7f1fc9dd3a217ca23b119438ee0366af08918c76 | [
"MIT"
] | null | null | null | Week02-Sorting/291A.cpp | AAlab1819/Andrew-00000019529 | 7f1fc9dd3a217ca23b119438ee0366af08918c76 | [
"MIT"
] | null | null | null | Week02-Sorting/291A.cpp | AAlab1819/Andrew-00000019529 | 7f1fc9dd3a217ca23b119438ee0366af08918c76 | [
"MIT"
] | null | null | null | #include<iostream>
using namespace std;
void shellSort(int arr[], int n)
{
for (int gap = n/2; gap > 0; gap /= 2)
{
for (int i = gap; i < n; i += 1)
{
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
... | 15.68 | 67 | 0.373724 | AAlab1819 |
5b5fa1086a789e5a089b07233585014982484c16 | 5,098 | hpp | C++ | viennacl/ocl/device_utils.hpp | yuchengs/viennacl-dev | 99f250fdb729de01ff5e9aebbed7b2ed3b1d8dfa | [
"MIT"
] | 224 | 2015-02-15T21:50:13.000Z | 2022-01-14T18:27:03.000Z | viennacl/ocl/device_utils.hpp | yuchengs/viennacl-dev | 99f250fdb729de01ff5e9aebbed7b2ed3b1d8dfa | [
"MIT"
] | 189 | 2015-01-09T17:08:04.000Z | 2021-06-04T06:23:22.000Z | viennacl/ocl/device_utils.hpp | yuchengs/viennacl-dev | 99f250fdb729de01ff5e9aebbed7b2ed3b1d8dfa | [
"MIT"
] | 84 | 2015-01-15T14:06:13.000Z | 2022-01-23T14:51:17.000Z | #ifndef VIENNACL_OCL_DEVICE_UTILS_HPP_
#define VIENNACL_OCL_DEVICE_UTILS_HPP_
/* =========================================================================
Copyright (c) 2010-2016, Institute for Microelectronics,
Institute for Analysis and Scientific Computing,
... | 26.414508 | 161 | 0.624166 | yuchengs |
5b6157f723c18eed98ad8e405446ae2b433f388a | 868 | cpp | C++ | .LHP/.Lop10/.O.L.P/.T.Vinh/OL3/DAUXE/DAUXE/DAUXE.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/.Lop10/.O.L.P/.T.Vinh/OL3/DAUXE/DAUXE/DAUXE.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | .LHP/.Lop10/.O.L.P/.T.Vinh/OL3/DAUXE/DAUXE/DAUXE.cpp | sxweetlollipop2912/MaCode | 661d77a2096e4d772fda2b6a7f80c84113b2cde9 | [
"MIT"
] | null | null | null | #include "pch.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#pragma warning(disable:4996)
#define maxN 101
#define maxL 121
#define empty '.'
#define block 'X'
typedef int maxn, maxl;
maxn n, L;
std::vector <maxl> a;
void Add(maxl &x) {
x = x - L + 1;
while (x > 0) {
a.push_... | 14 | 72 | 0.535714 | sxweetlollipop2912 |
5b617b02df27c604edcbef53d1e78a5e445ff04b | 1,546 | cpp | C++ | new folder/55.cpp | bprithiraj/DSA-CPsolvedproblemscode | 4b3765e4afb26016fade1f1e526b36934583c668 | [
"Apache-2.0"
] | null | null | null | new folder/55.cpp | bprithiraj/DSA-CPsolvedproblemscode | 4b3765e4afb26016fade1f1e526b36934583c668 | [
"Apache-2.0"
] | null | null | null | new folder/55.cpp | bprithiraj/DSA-CPsolvedproblemscode | 4b3765e4afb26016fade1f1e526b36934583c668 | [
"Apache-2.0"
] | null | null | null | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 13.327586 | 52 | 0.487063 | bprithiraj |
5b6417ea47699d0e216ee0f95a98b07f34c5e405 | 22,749 | cc | C++ | lib/kahypar/tests/partition/refinement/two_way_fm_refiner_test.cc | Ace-Ma/LSOracle | 6e940906303ef6c2c6b96352f44206567fdd50d3 | [
"MIT"
] | null | null | null | lib/kahypar/tests/partition/refinement/two_way_fm_refiner_test.cc | Ace-Ma/LSOracle | 6e940906303ef6c2c6b96352f44206567fdd50d3 | [
"MIT"
] | null | null | null | lib/kahypar/tests/partition/refinement/two_way_fm_refiner_test.cc | Ace-Ma/LSOracle | 6e940906303ef6c2c6b96352f44206567fdd50d3 | [
"MIT"
] | null | null | null | /*******************************************************************************
* This file is part of KaHyPar.
*
* Copyright (C) 2014 Sebastian Schlag <sebastian.schlag@kit.edu>
*
* KaHyPar is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as publishe... | 39.84063 | 109 | 0.684514 | Ace-Ma |
5b6d3b36244ff88ef2574a5109f44e7677af00aa | 1,355 | cpp | C++ | Broccoli/src/Broccoli/Renderer/Buffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | 1 | 2021-08-03T01:38:41.000Z | 2021-08-03T01:38:41.000Z | Broccoli/src/Broccoli/Renderer/Buffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | null | null | null | Broccoli/src/Broccoli/Renderer/Buffer.cpp | tross2552/broccoli | d7afc472e076fa801d0e7745e209553b73c34486 | [
"Apache-2.0"
] | null | null | null | #include "brclpch.h"
#include "Buffer.h"
#include "Renderer.h"
#include "Platform/OpenGL/OpenGLBuffer.h"
namespace brcl
{
std::unique_ptr<VertexBuffer> VertexBuffer::Create(uint32_t size)
{
switch (renderer::GetAPI())
{
case RendererAPI::API::None: BRCL_CORE_ASSERT(false, "RendererAPI::None is currently no... | 29.456522 | 123 | 0.732841 | tross2552 |
5b6fa607acf172b32aca9f7f553df46ba37ad09c | 2,195 | cpp | C++ | SerialTesting/SerialHelper.cpp | jj9146/Arduino | bfee6d42067b342eb51cbe42bb3c2020f9c9c858 | [
"MIT"
] | null | null | null | SerialTesting/SerialHelper.cpp | jj9146/Arduino | bfee6d42067b342eb51cbe42bb3c2020f9c9c858 | [
"MIT"
] | null | null | null | SerialTesting/SerialHelper.cpp | jj9146/Arduino | bfee6d42067b342eb51cbe42bb3c2020f9c9c858 | [
"MIT"
] | null | null | null | /*
SerialHelper.cpp - Library for auto-magically determining
if a board is being powered by the USB port, and will halt
all attempts to connect to and send data over COM when
there is no computer/device to listen or respond.
*** For Arduino Nano boards ***
* NOTE: Requires a 10k resistor soldered between P... | 30.486111 | 100 | 0.69795 | jj9146 |
ac8e3c77f4e63badec83e7197309bc8015c60dd4 | 836 | cc | C++ | aoj/2/2013.cc | eagletmt/procon | adbe503eb3c1bbcc1538b2ee8988aa353937e8d4 | [
"MIT"
] | 1 | 2015-04-17T09:54:23.000Z | 2015-04-17T09:54:23.000Z | aoj/2/2013.cc | eagletmt/procon | adbe503eb3c1bbcc1538b2ee8988aa353937e8d4 | [
"MIT"
] | null | null | null | aoj/2/2013.cc | eagletmt/procon | adbe503eb3c1bbcc1538b2ee8988aa353937e8d4 | [
"MIT"
] | null | null | null | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
void read(int& s0, int& s1)
{
char d;
int h0, m0, h1, m1;
cin >> h0 >> d >> m0 >> d >> s0;
cin >> h1 >> d >> m1 >> d >> s1;
s0 += 3600*h0 + 60*m0;
s1 += 3600*h1 + 60*m1;
}
int main()
{
int n;
while (cin >>... | 20.390244 | 54 | 0.505981 | eagletmt |
ac93d08e920e7e3262ff43b035551fa9a6aaa854 | 5,889 | cpp | C++ | examples/chess/src/chess.cpp | KazDragon/munin | ca5ae77cf5f75f6604fddd1a39393fa6acb88769 | [
"MIT"
] | 6 | 2017-07-15T10:16:20.000Z | 2021-06-14T10:02:37.000Z | examples/chess/src/chess.cpp | KazDragon/munin | ca5ae77cf5f75f6604fddd1a39393fa6acb88769 | [
"MIT"
] | 243 | 2017-05-01T19:27:07.000Z | 2021-09-01T09:32:49.000Z | examples/chess/src/chess.cpp | KazDragon/munin | ca5ae77cf5f75f6604fddd1a39393fa6acb88769 | [
"MIT"
] | 2 | 2019-07-16T00:29:43.000Z | 2020-09-19T09:49:00.000Z | #include <munin/button.hpp>
#include <munin/compass_layout.hpp>
#include <munin/filled_box.hpp>
#include <munin/grid_layout.hpp>
#include <munin/image.hpp>
#include <munin/scroll_pane.hpp>
#include <munin/text_area.hpp>
#include <munin/view.hpp>
#include <munin/window.hpp>
#include <terminalpp/canvas.hpp>
#include <ter... | 30.994737 | 142 | 0.533707 | KazDragon |
ac9640d797a8fd7c5ec67170aa1b8e67cf01ed1b | 22,810 | cxx | C++ | osf-to-esf/dbsk2d/algo/dbsk2d_bnd_preprocess_common.cxx | wenhanshi/lemsvxl-shock-computation | 1208e5f6a0c9fddbdffcc20f2c1d914e07015b45 | [
"MIT"
] | 1 | 2022-01-01T20:43:47.000Z | 2022-01-01T20:43:47.000Z | osf-to-esf/dbsk2d/algo/dbsk2d_bnd_preprocess_common.cxx | wenhanshi/lemsvxl-shock-computation | 1208e5f6a0c9fddbdffcc20f2c1d914e07015b45 | [
"MIT"
] | null | null | null | osf-to-esf/dbsk2d/algo/dbsk2d_bnd_preprocess_common.cxx | wenhanshi/lemsvxl-shock-computation | 1208e5f6a0c9fddbdffcc20f2c1d914e07015b45 | [
"MIT"
] | null | null | null | // This is brcv/shp/dbsk2d/algo/dbsk2d_bnd_preprocess_common.cxx
//:
// \file
#include "dbsk2d_bnd_preprocess.h"
#include <vcl_algorithm.h>
#include <vgl/vgl_closest_point.h>
#include <vgl/vgl_distance.h>
#include <vtol/vtol_list_functions.h>
#include "../../dbgl/algo/dbgl_circ_arc.h"
#include "../../dbgl/algo/d... | 31.11869 | 91 | 0.604822 | wenhanshi |
ac96cdfc0f02aabe82becbdefc53c58933372f17 | 6,091 | cc | C++ | tests/unit/rdma/test_rdma_collection_handle.extended.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 26 | 2019-11-26T08:36:15.000Z | 2022-02-15T17:13:21.000Z | tests/unit/rdma/test_rdma_collection_handle.extended.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 1,215 | 2019-09-09T14:31:33.000Z | 2022-03-30T20:20:14.000Z | tests/unit/rdma/test_rdma_collection_handle.extended.cc | rbuch/vt | 74c2e0cae3201dfbcbfda7644c354703ddaed6bb | [
"BSD-3-Clause"
] | 12 | 2019-09-08T00:03:05.000Z | 2022-02-23T21:28:35.000Z | /*
//@HEADER
// *****************************************************************************
//
// test_rdma_collection_handle.extended.cc
// DARMA/vt => Virtual Transport
//
// Copyright 2019-2021 National Technology & Engineering Solutions of Sandia, LLC
// (NTESS). Under the ... | 31.076531 | 83 | 0.66902 | rbuch |
ac9a566724a51c7315b883fcd236ca39fd49b1e6 | 677 | cpp | C++ | HackerRank/Algorithms/Medium/M0023.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 54 | 2019-05-13T12:13:09.000Z | 2022-02-27T02:59:00.000Z | HackerRank/Algorithms/Medium/M0023.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 2 | 2020-10-02T07:16:43.000Z | 2020-10-19T04:36:19.000Z | HackerRank/Algorithms/Medium/M0023.cpp | Mohammed-Shoaib/HackerRank-Problems | ccfb9fc2f0d8dff454439d75ce519cf83bad7c3b | [
"MIT"
] | 20 | 2020-05-26T09:48:13.000Z | 2022-03-18T15:18:27.000Z | /*
Problem Statement: https://www.hackerrank.com/challenges/hackerland-radio-transmitters/problem
*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int hackerlandRadioTransmitters(int k, vector<int> &x) {
int n, i, pos, transmitters;
n = x.size();
transmitters = i = 0;
sort(x.beg... | 17.815789 | 94 | 0.589365 | Mohammed-Shoaib |
ac9dd0541a5ed85c2fb5017510845e234dbc75a0 | 991 | cpp | C++ | RTCSDK/service/biz_service_factory.cpp | tyouritsugun/janus-client-cplus | f478ddcf62d12f1b0efe213dd695ec022e793070 | [
"MIT"
] | 1 | 2020-12-18T09:11:05.000Z | 2020-12-18T09:11:05.000Z | RTCSDK/service/biz_service_factory.cpp | tyouritsugun/janus-client-cplus | f478ddcf62d12f1b0efe213dd695ec022e793070 | [
"MIT"
] | null | null | null | RTCSDK/service/biz_service_factory.cpp | tyouritsugun/janus-client-cplus | f478ddcf62d12f1b0efe213dd695ec022e793070 | [
"MIT"
] | 1 | 2021-08-11T01:09:22.000Z | 2021-08-11T01:09:22.000Z | /**
* This file is part of janus_client project.
* Author: Jackie Ou
* Created: 2020-10-01
**/
#include "biz_service_factory.h"
#include "notification_service.h"
namespace core {
BizServiceFactory::BizServiceFactory(const std::shared_ptr<IUnifiedFactory>& unifiedFactory)
: _unifiedFactory(unifiedFactor... | 19.82 | 109 | 0.691221 | tyouritsugun |
aca384b5a196316a513c4cf34e807d77cb1efa12 | 1,515 | cpp | C++ | blank-plugin/src/cpp/GUI/__Plugin__Controller.cpp | pongasoft/jamba | 0af93fc973c61b06d7a63c8e0e67329ed9ad656c | [
"Apache-2.0"
] | 93 | 2018-08-29T22:37:20.000Z | 2022-03-24T01:57:58.000Z | blank-plugin/src/cpp/GUI/__Plugin__Controller.cpp | pongasoft/jamba | 0af93fc973c61b06d7a63c8e0e67329ed9ad656c | [
"Apache-2.0"
] | 13 | 2018-09-01T15:10:54.000Z | 2021-12-23T16:13:27.000Z | blank-plugin/src/cpp/GUI/__Plugin__Controller.cpp | pongasoft/jamba | 0af93fc973c61b06d7a63c8e0e67329ed9ad656c | [
"Apache-2.0"
] | 1 | 2021-02-22T09:47:10.000Z | 2021-02-22T09:47:10.000Z | #include "[-name-]Controller.h"
namespace [-namespace-]::GUI {
//------------------------------------------------------------------------
// Constructor
//------------------------------------------------------------------------
[-name-]Controller::[-name-]Controller() : GUIController("[-name-].uidesc"), fParams{}, fS... | 32.934783 | 113 | 0.392739 | pongasoft |
acaa87f0d9bab3fc3ee20deb36c8734699557abb | 6,828 | cc | C++ | project/c++/mri/src/refdata/src/utilxtreme/xmlpload.cc | jia57196/code41 | df611f84592afd453ccb2d22a7ad999ddb68d028 | [
"Apache-2.0"
] | null | null | null | project/c++/mri/src/refdata/src/utilxtreme/xmlpload.cc | jia57196/code41 | df611f84592afd453ccb2d22a7ad999ddb68d028 | [
"Apache-2.0"
] | null | null | null | project/c++/mri/src/refdata/src/utilxtreme/xmlpload.cc | jia57196/code41 | df611f84592afd453ccb2d22a7ad999ddb68d028 | [
"Apache-2.0"
] | null | null | null | // Copyright @2012 JDSU Xtreme
#include "xtreme/refdata/internal/utilxtreme/xmlpload.h"
#include <log4cxx/logger.h>
#include <boost/property_tree/xml_parser.hpp>
#include <boost/property_tree/ptree.hpp>
#include <boost/foreach.hpp>
#include <boost/bimap.hpp>
#include <boost/assign/list_of.hpp>
#include "xtreme/comm... | 35.936842 | 95 | 0.650996 | jia57196 |