id int64 0 755k | file_name stringlengths 3 109 | file_path stringlengths 13 185 | content stringlengths 31 9.38M | size int64 31 9.38M | language stringclasses 1
value | extension stringclasses 11
values | total_lines int64 1 340k | avg_line_length float64 2.18 149k | max_line_length int64 7 2.22M | alphanum_fraction float64 0 1 | repo_name stringlengths 6 65 | repo_stars int64 100 47.3k | repo_forks int64 0 12k | repo_open_issues int64 0 3.4k | repo_license stringclasses 9
values | repo_extraction_date stringclasses 92
values | exact_duplicates_redpajama bool 2
classes | near_duplicates_redpajama bool 2
classes | exact_duplicates_githubcode bool 2
classes | exact_duplicates_stackv2 bool 1
class | exact_duplicates_stackv1 bool 2
classes | near_duplicates_githubcode bool 2
classes | near_duplicates_stackv1 bool 2
classes | near_duplicates_stackv2 bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
10,405 | power_of_a_number.cpp | OpenGenus_cosmos/code/divide_conquer/src/power_of_a_number/power_of_a_number.cpp | /*
PROBLEM STATEMENT:
Given 2 numbers x and y, you need to find x raise to y.
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FIO ios::sync_with_stdio(0);
ll power(ll a,ll b)
{
ll res=1;
while(b!=0)
{
if(b%2!=0)
{
res=(res*a)%1000000007;
b--;
}
else
{
a=(a*a)%1000... | 533 | C++ | .cpp | 35 | 12.371429 | 55 | 0.607646 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,408 | karatsubamultiply.cpp | OpenGenus_cosmos/code/divide_conquer/src/karatsuba_multiplication/karatsubamultiply.cpp | // Author: Tote93
#include <iostream>
#include <string>
#include <sstream>
#include <cstdlib>
/* Prototypes */
int getBiggerSize(const std::string &number1, const std::string &number2);
void checkNumbers(int size, std::string &number1, std::string &number2);
std::string KaratsubaMultiply(std::string &number... | 5,039 | C++ | .cpp | 154 | 25.538961 | 86 | 0.564219 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,409 | main.cpp | OpenGenus_cosmos/code/divide_conquer/src/strassen_matrix_multiplication/main.cpp |
//The following program contains the strassen algorithm along with the Currently Fastest Matrix Multiplication Algorithm for sparse matrices
// Developed by Raphael Yuster and Uri Zwick
// I have also included a time calculator in case anyone wanted to check time taken by each algorithms
// Although mathematcially t... | 14,156 | C++ | .cpp | 422 | 24.222749 | 140 | 0.46854 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,411 | inversion_count.cpp | OpenGenus_cosmos/code/divide_conquer/src/inversion_count/inversion_count.cpp | // divide conquer | inversion count | C++
// Part of Cosmos by OpenGenus Foundation
#include <iostream>
using namespace std;
int mergesort(int arr[], int l, int r);
int merge(int arr[], int l, int m, int r);
int main()
{
int n, a[100], i;
cout << "Enter nuber of elements : ";
cin >> n;
cout << "E... | 1,245 | C++ | .cpp | 56 | 16.946429 | 63 | 0.443308 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,412 | test_search.cpp | OpenGenus_cosmos/code/search/test/test_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*/
#define CATCH_CONFIG_MAIN
#include "../../../test/c++/catch.hpp"
#include <list>
#include <vector>
#include <iterator>
#include <algorithm>
#include "../src/binary_search/binary_search.cpp"
#include "../src/exponential_search/exponential_search.cpp"
#include "../src/fib... | 4,265 | C++ | .cpp | 104 | 24 | 100 | 0.441226 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,413 | ternary_search.cpp | OpenGenus_cosmos/code/search/src/ternary_search/ternary_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*
* Ternary Search Uses Divide And Conquer Technique
*
* ternary search synopsis
*
* namespace ternary_search_impl
* {
* template<typename _RandomAccessIter,
* typename _ValueType = typename std::iterator_traits<_RandomAccessIter>::value_type,
* t... | 3,381 | C++ | .cpp | 85 | 33.717647 | 101 | 0.665652 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,415 | interpolation_search.cpp | OpenGenus_cosmos/code/search/src/interpolation_search/interpolation_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*
* interpolation search synopsis
*
* warning: in order to follow the convention of STL, the interface is [begin, end) !!!
*
* // [begin, end)
* template<typename _Random_Access_Iter,
* typename _Type = typename std::iterator_traits<_Random_Access_Iter>::val... | 2,412 | C++ | .cpp | 69 | 28.275362 | 96 | 0.586473 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,416 | sentinellinearsearch.cpp | OpenGenus_cosmos/code/search/src/linear_search/sentinellinearsearch.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*/
/*
* Author: Visakh S
* Github: visakhsuku
* Input: The number of elements in an array, The element to be searched, An integer array.
* Output: if found returns "found" else "not found", using the sentinel linear search algorithm.
*/
#include <iostream>
#include <... | 878 | C++ | .cpp | 38 | 19.236842 | 97 | 0.587112 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,417 | linear_search.cpp | OpenGenus_cosmos/code/search/src/linear_search/linear_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*
* linear search synopsis
*
* warning: in order to follow the convention of STL, the interface is [begin, end) !!!
*
* namespace linear_search_impl
* {
* template<typename _Input_Iter,
* typename _Tp = typename std::iterator_traits<_Input_Iter>::value_type... | 2,258 | C++ | .cpp | 67 | 29.746269 | 101 | 0.651716 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,419 | exponential_search.cpp | OpenGenus_cosmos/code/search/src/exponential_search/exponential_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*
* jump search synopsis
*
* warning: in order to follow the convention of STL, the interface is [begin, end) !!!
*
* namespace exponenial_search_impl
* {
* template<typename _Random_Access_Iter, typename _Comp,
* typename _Tp = typename std::iterator_trait... | 4,677 | C++ | .cpp | 122 | 31.5 | 103 | 0.595862 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,420 | binarysearchrecursion.cpp | OpenGenus_cosmos/code/search/src/binary_search/binarysearchrecursion.cpp | #include <iostream>
using namespace std;
int BinarySearch(int arr[], int start, int end, int item){
if(start > end)
return -1;
int mid = start + (end-start)/2;
if (arr[mid] == item)
return mid;
else if(arr[mid] < item)
BinarySearch(arr, mid+1, end, item);
else
Bin... | 621 | C++ | .cpp | 24 | 20.541667 | 58 | 0.567063 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,421 | binary_search.cpp | OpenGenus_cosmos/code/search/src/binary_search/binary_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*
* binary search synopsis
*
* warning: in order to follow the convention of STL, the interface is [begin, end) !!!
*
* namespace binary_search_impl
* {
* struct binary_search_tag {};
* struct recursive_binary_search_tag :public binary_search_tag {};
* struct itera... | 6,088 | C++ | .cpp | 150 | 33.26 | 108 | 0.598853 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,422 | binary_search_2.cpp | OpenGenus_cosmos/code/search/src/binary_search/binary_search_2.cpp | /* Part of Cosmos by OpenGenus Foundation */
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
/* Utility functions */
void fill(std::vector<int> &v)
{
for (auto& elem : v)
elem = rand() % 100;
}
void printArr(std::vector<int> &v)
{
for (const auto& elem : v)
std:... | 1,087 | C++ | .cpp | 47 | 18.787234 | 81 | 0.526777 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,423 | jump_search.cpp | OpenGenus_cosmos/code/search/src/jump_search/jump_search.cpp | /*
* Part of Cosmos by OpenGenus Foundation
*
* jump search synopsis
*
* warning: in order to follow the convention of STL, the interface is [begin, end) !!!
*
* namespace jump_search_impl
* {
* template<typename _Random_Access_Iter,
* typename _Tp = typename std::iterator_traits<_Random_Access_Iter>... | 3,026 | C++ | .cpp | 81 | 32.654321 | 98 | 0.646458 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,424 | test_huffman.cpp | OpenGenus_cosmos/code/compression/test/lossless_compression/huffman/test_huffman.cpp | #include "../../../src/lossless_compression/huffman/huffman.cpp"
#include <iostream>
#include <fstream>
#include <iterator>
using namespace std;
// test only for Huffman::base_type is 64bit
class HuffmanTest {
public:
HuffmanTest()
{
if (sizeof(Huffman::base_type) != 8)
cout << "the test re... | 7,993 | C++ | .cpp | 215 | 28.483721 | 103 | 0.574053 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,427 | space001.cpp | OpenGenus_cosmos/guides/coding_style/c++/uncrustify_tests/input/space001.cpp | #include <iostream>
#include<vector>
using namespace std;
void bar(int,int,int)
{
// less space
if(true)
{
vector<int> vec{1,2,3};
int i=(1+2)*3;
}
}
void foo( )
{
// more space
if (true)
{
vector<int> vec{1 , 2 , 3};
int i = (1 + 2) * 3; ... | 696 | C++ | .cpp | 36 | 11.222222 | 43 | 0.343988 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,428 | test_sample.cpp | OpenGenus_cosmos/test/c++/test_sample.cpp | #define CATCH_CONFIG_MAIN
#include "catch.hpp"
// this function should be stored in code folder
bool isEqual(int a, int b) {
return a == b;
}
TEST_CASE("just sample", "[sample]") {
REQUIRE(isEqual(1, 0) == false);
}
| 225 | C++ | .cpp | 9 | 23 | 48 | 0.682243 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,429 | validate_ip.cc | OpenGenus_cosmos/code/networking/src/validate_ip/validate_ip.cc | #include <arpa/inet.h>
bool Config::validateIpAddress(const string &ipAddress)
{
struct sockaddr_in sa;
int result = inet_pton(AF_INET, ipAddress.c_str(), &(sa.sin_addr));
return result != 0;
}
// add drive / test code | 232 | C++ | .cc | 8 | 26.375 | 71 | 0.695067 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,430 | dfa.hh | OpenGenus_cosmos/code/theory_of_computation/src/deterministic_finite_automaton/dfa.hh | #ifndef DFA_H
#define DFA_H
#endif
#define MAX_TRANSITION 50
#define MAX_STATES 100
using namespace std;
typedef struct
{
int (*condition)(char);
int stateId;
} dfaTransition;
typedef struct
{
int id;
bool actionable;
int noOfTransitions;
std::string actionName;
dfaTransition transitions[MAX_TRANSITIONS];
... | 845 | C++ | .h | 33 | 24.030303 | 108 | 0.790323 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,431 | lgraph_struct.h | OpenGenus_cosmos/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_c/lgraph_struct.h | /*
* Part of Cosmos by OpenGenus Foundation.
* Author : ABDOUS Kamel
* Here we have the definition of a graph using adjacency-list representation.
* NB : LG stands for "list graph".
*/
#ifndef GRAPH_STRUCT_H
#define GRAPH_STRUCT_H
#include <stdlib.h>
typedef size_t Node_ID;
/*
* One directed edge.
*/
typedef... | 3,801 | C++ | .h | 150 | 23.553333 | 80 | 0.651754 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,432 | lgraph_stack.h | OpenGenus_cosmos/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_c/lgraph_stack.h | /*
* Part of Cosmos by OpenGenus Foundation.
* Author : ABDOUS Kamel
* Stack for pushing nodes ids.
*/
#ifndef LGRAPH_STACK_H
#define LGRAPH_STACK_H
#include "lgraph_struct.h"
/*
* A common stack definition.
*/
typedef struct
{
size_t n;
Node_ID* nodes;
int head;
} LG_Stack;
/*
* Creates a stack of s... | 1,645 | C++ | .h | 69 | 21.942029 | 95 | 0.696737 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,433 | mgraph_struct.h | OpenGenus_cosmos/code/graph_algorithms/src/data_structures/adjacency_matrix_c/mgraph_struct.h | /*
* Part of Cosmos by OpenGenus Foundation.
* Author : ABDOUS Kamel
* Here we have the definition of a graph using adjacency-matrix representation.
* NB : MG stands for "matrix graph".
*/
#ifndef MGRAPH_STRUCT_H
#define MGRAPH_STRUCT_H
#include <stdlib.h>
/* Change this to change weighting type, if there is on... | 1,239 | C++ | .h | 56 | 20.375 | 80 | 0.69257 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,434 | luvector.hpp | OpenGenus_cosmos/code/computational_geometry/src/sphere_tetrahedron_intersection/luvector.hpp | /*
* N dimensional loop unrolled vector class.
*
* https://github.com/RedBlight/LoopUnrolledVector
*
* Refactored a little bit for "cosmos" repository.
*
*/
#ifndef LU_VECTOR_INCLUDED
#define LU_VECTOR_INCLUDED
#include <sstream>
#include <string>
#include <complex>
#include <vector>
#include <iostream>
nam... | 24,342 | C++ | .h | 723 | 26.874136 | 145 | 0.542818 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | true | true | true | false |
10,436 | types.h | OpenGenus_cosmos/code/string_algorithms/src/finite_automata/c/types.h | /*
* Part of Cosmos by OpenGenus.
* Author : ABDOUS Kamel
*/
#ifndef AUTOMATA_TYPES_H
#define AUTOMATA_TYPES_H
#include <stdbool.h>
/* States are labelled by positive integers instead of strings */
typedef int state_id_t;
/* A symbol is a single char */
typedef char symbol_t;
typedef enum dfs_color_e
{
WHITE,... | 801 | C++ | .h | 38 | 19.105263 | 65 | 0.718667 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,437 | dfa.h | OpenGenus_cosmos/code/string_algorithms/src/finite_automata/c/dfa.h | /*
* Part of Cosmos by OpenGenus.
* Author : ABDOUS Kamel
*/
#ifndef AUTOMATA_DFA_H
#define AUTOMATA_DFA_H
#include "types.h"
/*
* Definition of a DFA.
*/
typedef struct dfa_s
{
int alpha_size;
state_t* states;
int states_nb;
state_id_t start_id;
/*
* This is a transition matrix.
* -1 indicat... | 1,204 | C++ | .h | 58 | 18.775862 | 63 | 0.704947 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,438 | maxHeap.h | OpenGenus_cosmos/code/data_structures/src/maxHeap/maxHeap.h |
#ifndef COSMOS_MAXHEAP_H
#define COSMOS_MAXHEAP_H
#include <iostream>
class maxHeap {
private :
int* heap;
int capacity;
int currSize;
void heapifyAdd(int idx);
void heapifyRemove(int idx);
public:
maxHeap(int capacity);
void insert(int itm);
void remove();
void print();
};
... | 346 | C++ | .h | 17 | 16.705882 | 32 | 0.7 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,440 | array_stack.h | OpenGenus_cosmos/code/data_structures/src/stack/abstract_stack/cpp/array_stack/array_stack.h | #ifndef ARRAYSTACH_H
#define ARRAYSTACK_H
#include <string>
#include <sstream>
#include "../istack.h"
template<typename T>
class ArrayStack : public IStack<T> {
private:
int capacity;
int top;
T **elements;
void expandArray();
public:
ArrayStack(int capacity = 10);
... | 3,806 | C++ | .h | 133 | 22.827068 | 82 | 0.564896 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,441 | dlink.h | OpenGenus_cosmos/code/data_structures/src/list/doubly_linked_list/menu_interface/dlink.h | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <dirent.h>
#define MAX_LENGTH 20
void insert_beg(int num);
void insert_end(int num);
void insert_at_loc(int num, int loc);
void insert_after_value(int num, int val);
void delete_beg();
void delete_end();
void delete_node(int loc);
void delete_value(i... | 5,979 | C++ | .h | 392 | 12.989796 | 70 | 0.611733 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,442 | doubly_linked_list.h | OpenGenus_cosmos/code/data_structures/src/list/doubly_linked_list/c/doubly_linked_list.h | #ifndef _D_L_LIST_H_
#define _D_L_LIST_H_
#include <stdint.h>
#define SUCCESS 0
#define ERR_NO_LIST -1
#define ERR_EMPTY_LIST -2
#define ERR_MALLOC_FAIL -3
typedef struct node_s {
int32_t id;
int32_t data;
struct node_s *next;
struct node_s *prev;
} node_t ;
typedef struct ... | 1,006 | C++ | .h | 30 | 31.2 | 74 | 0.59814 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,444 | link.h | OpenGenus_cosmos/code/data_structures/src/list/singly_linked_list/menu_interface/link.h | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <dirent.h>
#define MAX_LENGTH 20
typedef struct list
{
int info;
struct list* next;
}list;
list *start=NULL, *node=NULL, *curr=NULL, *prev=NULL;
void insert_beg(int);
void insert_end(int);
void insert_at_loc(int, int);
void insert_after_value(int... | 5,592 | C++ | .h | 370 | 12.905405 | 69 | 0.615325 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,445 | btree.h | OpenGenus_cosmos/code/data_structures/src/tree/b_tree/b_tree/b_tree_c/btree.h | // Part of Cosmos by OpenGenus Foundation
// Author : ABDOUS Kamel
// Implementation of a disk-stored B-Tree
#ifndef BTREE_H_INCLUDED
#define BTREE_H_INCLUDED
#include <stdio.h>
#define MIN_DEGREE 2
#define MAX_N ((MIN_DEGREE * 2) - 1) /* Max nb of values stored in a node */
#define MAX_C (MIN_DEGREE * 2) /* Max nb ... | 3,018 | C++ | .h | 95 | 29.368421 | 97 | 0.680829 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,446 | red_black_tree.h | OpenGenus_cosmos/code/data_structures/src/tree/multiway_tree/red_black_tree/red_black_tree.h | /**
* author: JonNRb <jonbetti@gmail.com>
* license: GPLv3
* file: @cosmos//code/data_structures/red_black_tree/red_black.h
* info: red black tree
*/
#ifndef COSMOS_RED_BLACK_H_
#define COSMOS_RED_BLACK_H_
#include <stdint.h>
/**
* this macro subtracts off the offset of |member| within |type| from |ptr|,
* al... | 2,199 | C++ | .h | 59 | 31.864407 | 78 | 0.60673 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,447 | path_sum.hpp | OpenGenus_cosmos/code/data_structures/src/tree/binary_tree/binary_tree/path_sum/path_sum.hpp | /*
Part of Cosmos by OpenGenus Foundation
*/
#ifndef path_sum_hpp
#define path_sum_hpp
#include <memory>
#include <vector>
#include <functional>
#include "../node/node.cpp"
template<typename _Ty, typename _Compare = std::equal_to<_Ty>, class _TreeNode = TreeNode<_Ty>>
class PathSum
{
private:
template<typename... | 1,121 | C++ | .h | 39 | 22.871795 | 95 | 0.61028 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | true | false | false | true | false | false |
10,448 | canny.h | OpenGenus_cosmos/code/artificial_intelligence/src/image_processing/canny/canny.h | //
// canny.h
// Canny Edge Detector
//
#ifndef _CANNY_
#define _CANNY_
#include "opencv2/imgproc/imgproc.hpp"
#include "opencv2/highgui/highgui.hpp"
#include <vector>
class canny {
private:
cv::Mat img; //Original Image
cv::Mat grayscaled; // Grayscale
cv::Mat gFiltered; // Gradient
cv::Mat sFilt... | 885 | C++ | .h | 28 | 28.714286 | 94 | 0.695652 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,450 | queue.h | OpenGenus_cosmos/code/operating_system/src/scheduling/round_robin_scheduling/round_robin_c/queue.h | /*
* Part of Cosmos by OpenGenus Foundation.
* Basic queue.
* Author : ABDOUS Kamel
*/
#ifndef QUEUE_H
#define QUEUE_H
#include <stdlib.h>
typedef int QUEUE_VAL;
typedef struct
{
QUEUE_VAL* vals;
size_t n;
int head, tail;
} queue;
int
init_queue(queue* q, size_t n);
void
free_queue(queue* q);
int
que... | 455 | C++ | .h | 28 | 14.428571 | 42 | 0.731884 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,451 | mythreads.h | OpenGenus_cosmos/code/operating_system/src/concurrency/peterson_algorithm_for_mutual_exclusion/peterson_algorithm_in_c/mythreads.h | // mythread.h (A wrapper header file with assert
// statements)
#ifndef __MYTHREADS_h__
#define __MYTHREADS_h__
#include <pthread.h>
#include <assert.h>
#include <sched.h>
void Pthread_mutex_lock(pthread_mutex_t *m)
{
int rc = pthread_mutex_lock(m);
assert(rc == 0);
}
void Pthread_mutex_unlock(pthread_mutex_... | 751 | C++ | .h | 29 | 23.206897 | 66 | 0.671788 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,452 | monitors.h | OpenGenus_cosmos/code/operating_system/src/concurrency/monitors/monitors_system_v/monitors.h | /*
* Part of Cosmos by OpenGenus Foundation.
* Implementation of Hoare monitors using System V IPC.
* Author : ABDOUS Kamel
*/
#ifndef MONITORS_H
#define MONITORS_H
#include <stdlib.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <sys/sem.h>
#include <sys/stat... | 3,191 | C++ | .h | 105 | 28.409524 | 91 | 0.729677 | OpenGenus/cosmos | 13,556 | 3,669 | 2,596 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,454 | main.cpp | tindy2013_subconverter/src/main.cpp | #include <iostream>
#include <string>
#include <unistd.h>
#include <csignal>
#include <sys/types.h>
#include <dirent.h>
#include "config/ruleset.h"
#include "handler/interfaces.h"
#include "handler/webget.h"
#include "handler/settings.h"
#include "script/cron.h"
#include "server/socket.h"
#include "server/webserver.h... | 9,590 | C++ | .cpp | 274 | 28.171533 | 142 | 0.605408 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,455 | script.cpp | tindy2013_subconverter/src/script/script.cpp | #include <string>
#include <iostream>
#include <duktape.h>
#include <duk_module_node.h>
#include "utils/string.h"
#include "utils/string_hash.h"
#include "handler/webget.h"
#include "handler/multithread.h"
#include "utils/base64/base64.h"
#include "utils/network.h"
extern int gCacheConfig;
extern std::string gProxyCo... | 7,996 | C++ | .cpp | 252 | 26.801587 | 119 | 0.627542 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,456 | cron.cpp | tindy2013_subconverter/src/script/cron.cpp | #include <string>
#include <iostream>
#include <libcron/Cron.h>
#include "config/crontask.h"
#include "handler/interfaces.h"
#include "handler/multithread.h"
#include "handler/settings.h"
#include "server/webserver.h"
#include "utils/logger.h"
#include "utils/rapidjson_extra.h"
#include "utils/system.h"
#include "scri... | 3,236 | C++ | .cpp | 107 | 22.411215 | 143 | 0.576233 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,457 | script_quickjs.cpp | tindy2013_subconverter/src/script/script_quickjs.cpp | #include <string>
#include <map>
#include <iostream>
#include <quickjspp.hpp>
#include <utility>
#include <quickjs/quickjs-libc.h>
#ifdef _WIN32
#include <windows.h>
#endif // _WIN32
#include "handler/multithread.h"
#include "handler/webget.h"
#include "handler/settings.h"
#include "parser/config/proxy.h"
#include "u... | 16,519 | C++ | .cpp | 490 | 27.185714 | 148 | 0.604446 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,458 | template_jinja2.cpp | tindy2013_subconverter/src/generator/template/template_jinja2.cpp | #include <string>
#include <jinja2cpp/user_callable.h>
#include <jinja2cpp/binding/nlohmann_json.h>
#include <jinja2cpp/template.h>
#include <nlohmann/json.hpp>
#include "handler/interfaces.h"
#include "utils/regexp.h"
#include "templates.h"
static inline void parse_json_pointer(nlohmann::json &json, const std::stri... | 1,745 | C++ | .cpp | 42 | 37.02381 | 167 | 0.665686 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,459 | templates.cpp | tindy2013_subconverter/src/generator/template/templates.cpp | #include <string>
#include <map>
#include <sstream>
#include <filesystem>
#include <inja.hpp>
#include <nlohmann/json.hpp>
#include "handler/interfaces.h"
#include "handler/settings.h"
#include "handler/webget.h"
#include "utils/logger.h"
#include "utils/network.h"
#include "utils/regexp.h"
#include "utils/urlencode.h... | 22,518 | C++ | .cpp | 544 | 31.134191 | 209 | 0.532146 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,460 | nodemanip.cpp | tindy2013_subconverter/src/generator/config/nodemanip.cpp | #include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include "handler/settings.h"
#include "handler/webget.h"
#include "parser/config/proxy.h"
#include "parser/infoparser.h"
#include "parser/subparser.h"
#include "script/script_quickjs.h"
#include "utils/file_extra.h"
#include "utils/logger.h"... | 18,342 | C++ | .cpp | 491 | 26.405295 | 280 | 0.530491 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,461 | ruleconvert.cpp | tindy2013_subconverter/src/generator/config/ruleconvert.cpp | #include <string>
#include "handler/settings.h"
#include "utils/logger.h"
#include "utils/network.h"
#include "utils/regexp.h"
#include "utils/string.h"
#include "utils/rapidjson_extra.h"
#include "subexport.h"
/// rule type lists
#define basic_types "DOMAIN", "DOMAIN-SUFFIX", "DOMAIN-KEYWORD", "IP-CIDR", "SRC-IP-CID... | 24,379 | C++ | .cpp | 558 | 32.137993 | 253 | 0.5383 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,462 | subexport.cpp | tindy2013_subconverter/src/generator/config/subexport.cpp | #include <algorithm>
#include <iostream>
#include <numeric>
#include <cmath>
#include <climits>
#include "config/regmatch.h"
#include "generator/config/subexport.h"
#include "generator/template/templates.h"
#include "handler/settings.h"
#include "parser/config/proxy.h"
#include "script/script_quickjs.h"
#include "util... | 93,425 | C++ | .cpp | 2,199 | 31.019554 | 402 | 0.531684 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,463 | wrapper.cpp | tindy2013_subconverter/src/lib/wrapper.cpp | #include "handler/settings.h"
#include <string>
Settings global;
bool fileExist(const std::string&, bool) { return false; }
std::string fileGet(const std::string&, bool) { return ""; }
| 187 | C++ | .cpp | 5 | 36 | 60 | 0.733333 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,464 | subparser.cpp | tindy2013_subconverter/src/parser/subparser.cpp | #include <string>
#include <map>
#include "utils/base64/base64.h"
#include "utils/ini_reader/ini_reader.h"
#include "utils/network.h"
#include "utils/rapidjson_extra.h"
#include "utils/regexp.h"
#include "utils/string.h"
#include "utils/string_hash.h"
#include "utils/urlencode.h"
#include "utils/yamlcpp_extra.h"
#incl... | 85,352 | C++ | .cpp | 2,130 | 28.0723 | 488 | 0.505887 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,465 | infoparser.cpp | tindy2013_subconverter/src/parser/infoparser.cpp | #include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include "config/regmatch.h"
#include "parser/config/proxy.h"
#include "utils/base64/base64.h"
#include "utils/rapidjson_extra.h"
#include "utils/regexp.h"
#include "utils/string.h"
unsigned long long streamToInt(const std::string &stream)
{
if... | 5,892 | C++ | .cpp | 179 | 24.301676 | 154 | 0.539515 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,466 | string.cpp | tindy2013_subconverter/src/utils/string.cpp | #include <algorithm>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <random>
#include "string.h"
#include "map_extra.h"
std::vector<std::string> split(const std::string &s, const std::string &separator)
{
string_size bpos = 0, epos = s.find(s... | 10,477 | C++ | .cpp | 386 | 20.049223 | 141 | 0.51187 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,467 | network.cpp | tindy2013_subconverter/src/utils/network.cpp | #include <string>
#include <vector>
#include <sstream>
#include "server/socket.h"
#include "string.h"
#include "regexp.h"
std::string hostnameToIPAddr(const std::string &host)
{
int retVal;
std::string retAddr;
char cAddr[128] = {};
struct sockaddr_in *target;
struct sockaddr_in6 *target6;
str... | 4,231 | C++ | .cpp | 143 | 20.755245 | 284 | 0.467615 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,468 | regexp.cpp | tindy2013_subconverter/src/utils/regexp.cpp | #include <string>
#include <cstdarg>
/*
#ifdef USE_STD_REGEX
#include <regex>
#else
*/
#include <jpcre2.hpp>
using jp = jpcre2::select<char>;
//#endif // USE_STD_REGEX
#include "regexp.h"
/*
#ifdef USE_STD_REGEX
bool regValid(const std::string ®)
{
try
{
std::regex r(reg, std::regex::ECMAScript);
... | 5,711 | C++ | .cpp | 210 | 20.790476 | 127 | 0.567627 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,469 | logger.cpp | tindy2013_subconverter/src/utils/logger.cpp | #include <string>
#include <iostream>
#include <thread>
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>
#include "handler/settings.h"
#include "defer.h"
#include "lock.h"
#include "logger.h"
std::string getTime(int type)
{
time_t lt;
char tmpbuf[32], cMillis[7];
std::string format;
ti... | 2,170 | C++ | .cpp | 85 | 21.341176 | 90 | 0.598361 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,470 | system.cpp | tindy2013_subconverter/src/utils/system.cpp | #include <string>
#include <vector>
#include <memory>
#include <chrono>
#include <thread>
#include <stdlib.h>
#ifdef _WIN32
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#endif // _WIN32
#include "string.h"
void sleepMs(int interval)
{
/*
#ifdef _WIN32
Sleep(interval);
#else
// Portabl... | 3,387 | C++ | .cpp | 108 | 24.833333 | 142 | 0.565749 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,471 | urlencode.cpp | tindy2013_subconverter/src/utils/urlencode.cpp | #include <string>
#include "string.h"
unsigned char toHex(unsigned char x)
{
return x > 9 ? x + 55 : x + 48;
}
unsigned char fromHex(unsigned char x)
{
unsigned char y;
if (x >= 'A' && x <= 'Z')
y = x - 'A' + 10;
else if (x >= 'a' && x <= 'z')
y = x - 'a' + 10;
else if (x >= '0' ... | 1,983 | C++ | .cpp | 79 | 17.64557 | 70 | 0.448894 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,472 | codepage.cpp | tindy2013_subconverter/src/utils/codepage.cpp | #include <string>
#ifdef _WIN32
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#endif // _WIN32
// ANSI code page (GBK on 936) to UTF8
std::string acpToUTF8(const std::string &str_src)
{
#ifdef _WIN32
const char* strGBK = str_src.c_str();
int len = MultiByteToWideChar(CP_ACP, 0, strGBK, -1, NULL, 0);
wc... | 2,200 | C++ | .cpp | 69 | 27.869565 | 76 | 0.631876 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,473 | file.cpp | tindy2013_subconverter/src/utils/file.cpp | #include <string>
#include <fstream>
#include <sys/stat.h>
#include "utils/string.h"
bool isInScope(const std::string &path)
{
#ifdef _WIN32
if(path.find(":\\") != path.npos || path.find("..") != path.npos)
return false;
#else
if(startsWith(path, "/") || path.find("..") != path.npos)
return fa... | 2,648 | C++ | .cpp | 101 | 21.009901 | 87 | 0.589441 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,474 | base64.cpp | tindy2013_subconverter/src/utils/base64/base64.cpp | #include <string>
#include "utils/string.h"
static const std::string base64_chars =
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"abcdefghijklmnopqrstuvwxyz"
"0123456789+/";
std::string base64Encode(const std::string &string_to_encode)
{
char const* bytes_to_encode = string_to_encode.data();
unsigned int in_len ... | 4,603 | C++ | .cpp | 122 | 30.081967 | 115 | 0.524023 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,476 | interfaces.cpp | tindy2013_subconverter/src/handler/interfaces.cpp | #include <iostream>
#include <string>
#include <mutex>
#include <numeric>
#include <yaml-cpp/yaml.h>
#include "config/binding.h"
#include "generator/config/nodemanip.h"
#include "generator/config/ruleconvert.h"
#include "generator/config/subexport.h"
#include "generator/template/templates.h"
#include "script/script_q... | 56,417 | C++ | .cpp | 1,364 | 32.719941 | 218 | 0.59605 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,477 | webget.cpp | tindy2013_subconverter/src/handler/webget.cpp | #include <iostream>
#include <unistd.h>
#include <sys/stat.h>
//#include <mutex>
#include <thread>
#include <atomic>
#include <curl/curl.h>
#include "handler/settings.h"
#include "utils/base64/base64.h"
#include "utils/defer.h"
#include "utils/file_extra.h"
#include "utils/lock.h"
#include "utils/logger.h"
#include "... | 13,922 | C++ | .cpp | 374 | 30.580214 | 167 | 0.6338 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,478 | settings.cpp | tindy2013_subconverter/src/handler/settings.cpp | #include <string>
#include <mutex>
#include <toml.hpp>
#include "config/binding.h"
#include "handler/webget.h"
#include "script/cron.h"
#include "server/webserver.h"
#include "utils/logger.h"
#include "utils/network.h"
#include "interfaces.h"
#include "multithread.h"
#include "settings.h"
//multi-thread lock
std::mut... | 50,401 | C++ | .cpp | 1,189 | 33.585366 | 191 | 0.608306 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,479 | multithread.cpp | tindy2013_subconverter/src/handler/multithread.cpp | #include <future>
#include <thread>
#include "handler/settings.h"
#include "utils/network.h"
#include "webget.h"
#include "multithread.h"
//#include "vfs.h"
//safety lock for multi-thread
std::mutex on_emoji, on_rename, on_stream, on_time;
RegexMatchConfigs safe_get_emojis()
{
guarded_mutex guard(on_emoji);
... | 2,067 | C++ | .cpp | 68 | 27.220588 | 141 | 0.713639 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,480 | upload.cpp | tindy2013_subconverter/src/handler/upload.cpp | #include <string>
#include "utils/ini_reader/ini_reader.h"
#include "utils/logger.h"
#include "utils/rapidjson_extra.h"
#include "utils/system.h"
#include "webget.h"
std::string buildGistData(std::string name, std::string content)
{
rapidjson::StringBuffer sb;
rapidjson::Writer<rapidjson::StringBuffer> writer... | 4,082 | C++ | .cpp | 106 | 32.198113 | 161 | 0.599748 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,481 | webserver_httplib.cpp | tindy2013_subconverter/src/server/webserver_httplib.cpp | #include <string>
#ifdef MALLOC_TRIM
#include <malloc.h>
#endif // MALLOC_TRIM
#define CPPHTTPLIB_REQUEST_URI_MAX_LENGTH 16384
#include "httplib.h"
#include "utils/base64/base64.h"
#include "utils/logger.h"
#include "utils/string_hash.h"
#include "utils/stl_extra.h"
#include "utils/urlencode.h"
#include "webserver.h"
... | 7,761 | C++ | .cpp | 237 | 23.71308 | 129 | 0.53754 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,488 | version.h | tindy2013_subconverter/src/version.h | #ifndef VERSION_H_INCLUDED
#define VERSION_H_INCLUDED
#define VERSION "v0.9.0"
#endif // VERSION_H_INCLUDED
| 110 | C++ | .h | 4 | 26 | 28 | 0.788462 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,489 | script_duktape.h | tindy2013_subconverter/src/script/script_duktape.h | #ifndef SCRIPT_DUKTAPE_H_INCLUDED
#define SCRIPT_DUKTAPE_H_INCLUDED
#include <string>
#include <duktape.h>
#include "nodeinfo.h"
#include "misc.h"
duk_context *duktape_init();
int duktape_push_nodeinfo(duk_context *ctx, const nodeInfo &node);
int duktape_push_nodeinfo_arr(duk_context *ctx, const nodeInfo &node, duk_... | 834 | C++ | .h | 19 | 42.210526 | 92 | 0.751852 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,490 | script.h | tindy2013_subconverter/src/script/script.h | #ifndef SCRIPT_H_INCLUDED
#define SCRIPT_H_INCLUDED
#include <string>
#include <chaiscript/chaiscript.hpp>
template <typename... input_type, typename return_type> int evalScript(const std::string &script, return_type &return_value, input_type&... input_value)
{
chaiscript::ChaiScript chai;
try
{
a... | 547 | C++ | .h | 19 | 24.684211 | 152 | 0.674286 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,491 | cron.h | tindy2013_subconverter/src/script/cron.h | #ifndef CRON_H_INCLUDED
#define CRON_H_INCLUDED
void refresh_schedule();
size_t cron_tick();
#endif // CRON_H_INCLUDED
| 121 | C++ | .h | 5 | 22.8 | 25 | 0.77193 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,492 | script_quickjs.h | tindy2013_subconverter/src/script/script_quickjs.h | #ifndef SCRIPT_QUICKJS_H_INCLUDED
#define SCRIPT_QUICKJS_H_INCLUDED
#include "parser/config/proxy.h"
#include "utils/defer.h"
#ifndef NO_JS_RUNTIME
#include <quickjspp.hpp>
void script_runtime_init(qjs::Runtime &runtime);
int script_context_init(qjs::Context &context);
int script_cleanup(qjs::Context &context);
voi... | 11,580 | C++ | .h | 199 | 48.251256 | 128 | 0.62392 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,493 | templates.h | tindy2013_subconverter/src/generator/template/templates.h | #ifndef TEMPLATES_H_INCLUDED
#define TEMPLATES_H_INCLUDED
#include <string>
#include <map>
#include "generator/config/subexport.h"
#include "utils/string.h"
struct template_args
{
string_map global_vars;
string_map request_params;
string_map local_vars;
string_map node_list;
};
int render_template(c... | 685 | C++ | .h | 16 | 40.5 | 208 | 0.775602 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,494 | ruleconvert.h | tindy2013_subconverter/src/generator/config/ruleconvert.h | #ifndef RULECONVERT_H_INCLUDED
#define RULECONVERT_H_INCLUDED
#include <string>
#include <vector>
#include <future>
#include <yaml-cpp/yaml.h>
#include <rapidjson/document.h>
#include "utils/ini_reader/ini_reader.h"
enum ruleset_type
{
RULESET_SURGE,
RULESET_QUANX,
RULESET_CLASH_DOMAIN,
RULESET_CLAS... | 1,316 | C++ | .h | 31 | 39.806452 | 179 | 0.776213 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,495 | subexport.h | tindy2013_subconverter/src/generator/config/subexport.h | #ifndef SUBEXPORT_H_INCLUDED
#define SUBEXPORT_H_INCLUDED
#include <string>
#ifndef NO_JS_RUNTIME
#include <quickjspp.hpp>
#endif // NO_JS_RUNTIME
#include "config/proxygroup.h"
#include "config/regmatch.h"
#include "parser/config/proxy.h"
#include "utils/ini_reader/ini_reader.h"
#include "utils/string.h"
#include "... | 4,024 | C++ | .h | 67 | 56.776119 | 214 | 0.754813 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,496 | nodemanip.h | tindy2013_subconverter/src/generator/config/nodemanip.h | #ifndef NODEMANIP_H_INCLUDED
#define NODEMANIP_H_INCLUDED
#include <string>
#include <vector>
#include <limits.h>
#ifndef NO_JS_RUNTIME
#include <quickjspp.hpp>
#endif // NO_JS_RUNTIME
#include "config/regmatch.h"
#include "parser/config/proxy.h"
#include "utils/map_extra.h"
#include "utils/string.h"
struct parse_s... | 1,201 | C++ | .h | 32 | 35.09375 | 119 | 0.750645 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,497 | infoparser.h | tindy2013_subconverter/src/parser/infoparser.h | #ifndef INFOPARSER_H_INCLUDED
#define INFOPARSER_H_INCLUDED
#include <string>
#include "utils/string.h"
#include "config/proxy.h"
#include "config/regmatch.h"
bool getSubInfoFromHeader(const std::string &header, std::string &result);
bool getSubInfoFromNodes(const std::vector<Proxy> &nodes, const RegexMatchConfigs &... | 555 | C++ | .h | 11 | 49 | 155 | 0.801484 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,498 | subparser.h | tindy2013_subconverter/src/parser/subparser.h | #ifndef SUBPARSER_H_INCLUDED
#define SUBPARSER_H_INCLUDED
#include <string>
#include "config/proxy.h"
enum class ConfType
{
Unknow,
SS,
SSR,
V2Ray,
SSConf,
SSTap,
Netch,
SOCKS,
HTTP,
SUB,
Local
};
void vmessConstruct(Proxy &node, const std::string &group, const std::strin... | 3,791 | C++ | .h | 40 | 92.55 | 526 | 0.730913 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,499 | proxy.h | tindy2013_subconverter/src/parser/config/proxy.h | #ifndef PROXY_H_INCLUDED
#define PROXY_H_INCLUDED
#include <string>
#include <vector>
#include "utils/tribool.h"
using String = std::string;
using StringArray = std::vector<String>;
enum class ProxyType
{
Unknown,
Shadowsocks,
ShadowsocksR,
VMess,
Trojan,
Snell,
HTTP,
HTTPS,
SOCK... | 2,306 | C++ | .h | 100 | 18.55 | 46 | 0.692834 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,500 | regexp.h | tindy2013_subconverter/src/utils/regexp.h | #ifndef REGEXP_H_INCLUDED
#define REGEXP_H_INCLUDED
#include <string>
bool regValid(const std::string ®);
bool regFind(const std::string &src, const std::string &match);
std::string regReplace(const std::string &src, const std::string &match, const std::string &rep, bool global = true, bool multiline = true);
bool... | 663 | C++ | .h | 11 | 59 | 140 | 0.748844 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,501 | tribool.h | tindy2013_subconverter/src/utils/tribool.h | #ifndef TRIBOOL_H_INCLUDED
#define TRIBOOL_H_INCLUDED
#include <string>
#include "string.h"
#include "string_hash.h"
class tribool
{
public:
tribool() : value_(indeterminate) {}
tribool(bool value) : value_(value ? true_value : false_value) {}
tribool(const std::string& str) { set(str); }
tribool(co... | 2,545 | C++ | .h | 91 | 19.472527 | 82 | 0.52422 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,502 | lock.h | tindy2013_subconverter/src/utils/lock.h | #ifndef LOCK_H_INCLUDED
#define LOCK_H_INCLUDED
#include <atomic>
#include <thread>
class RWLock
{
static constexpr int WRITE_LOCK_STATUS = -1;
static constexpr int FREE_STATUS = 0;
private:
const std::thread::id NULL_THREAD;
const bool WRITE_FIRST;
std::thread::id m_write_thread_id;
std::atom... | 2,318 | C++ | .h | 76 | 21.828947 | 129 | 0.545779 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,503 | checkpoint.h | tindy2013_subconverter/src/utils/checkpoint.h | #ifndef CHECKPOINT_H_INCLUDED
#define CHECKPOINT_H_INCLUDED
#include <chrono>
#include <iostream>
inline std::chrono::time_point<std::chrono::steady_clock, std::chrono::nanoseconds> start_time;
inline void checkpoint()
{
if(start_time == std::chrono::time_point<std::chrono::steady_clock, std::chrono::nanoseconds... | 687 | C++ | .h | 18 | 33.833333 | 118 | 0.682707 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,504 | system.h | tindy2013_subconverter/src/utils/system.h | #ifndef SYSTEM_H_INCLUDED
#define SYSTEM_H_INCLUDED
#include <string>
void sleepMs(int interval);
std::string getEnv(const std::string &name);
std::string getSystemProxy();
#endif // SYSTEM_H_INCLUDED
| 204 | C++ | .h | 7 | 27.714286 | 44 | 0.78866 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,505 | file.h | tindy2013_subconverter/src/utils/file.h | #ifndef FILE_H_INCLUDED
#define FILE_H_INCLUDED
#include <string>
#include <string.h>
#ifdef _WIN32
#include <unistd.h>
#define PATH_SLASH "\\"
#else
#include <sys/types.h>
#include <sys/stat.h>
#define PATH_SLASH "//"
#endif // _WIN32
#include <sys/types.h>
#include <dirent.h>
std::string fileGet(const std::string... | 1,161 | C++ | .h | 45 | 22.422222 | 83 | 0.645627 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,506 | yamlcpp_extra.h | tindy2013_subconverter/src/utils/yamlcpp_extra.h | #ifndef YAMLCPP_EXTRA_H_INCLUDED
#define YAMLCPP_EXTRA_H_INCLUDED
#include <yaml-cpp/yaml.h>
#include <string>
#include <vector>
template <typename T> void operator >> (const YAML::Node& node, T& i)
{
if(node.IsDefined() && !node.IsNull()) //fail-safe
i = node.as<T>();
};
template <typename T> T safe_as ... | 1,217 | C++ | .h | 37 | 28.567568 | 103 | 0.619778 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,507 | bitwise.h | tindy2013_subconverter/src/utils/bitwise.h | #ifndef BITWISE_H_INCLUDED
#define BITWISE_H_INCLUDED
#define GETBIT(x,n) (((int)x < 1) ? 0 : ((x >> (n - 1)) & 1))
#define SETBIT(x,n,v) x ^= (-v ^ x) & (1UL << (n - 1))
#endif // BITWISE_H_INCLUDED
| 202 | C++ | .h | 5 | 39 | 61 | 0.574359 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,509 | defer.h | tindy2013_subconverter/src/utils/defer.h | #ifndef DEFER_H_INCLUDED
#define DEFER_H_INCLUDED
#define CONCAT(a,b) a ## b
#define DO_CONCAT(a,b) CONCAT(a,b)
template <typename T> class __defer_struct final {private: T fn; bool __cancelled = false; public: explicit __defer_struct(T func) : fn(std::move(func)) {} ~__defer_struct() {if(!__cancelled) fn();} void can... | 565 | C++ | .h | 8 | 69.375 | 237 | 0.654054 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,510 | urlencode.h | tindy2013_subconverter/src/utils/urlencode.h | #ifndef URLENCODE_H_INCLUDED
#define URLENCODE_H_INCLUDED
#include <string>
#include "utils/string.h"
std::string urlEncode(const std::string& str);
std::string urlDecode(const std::string& str);
std::string joinArguments(const string_multimap &args);
#endif // URLENCODE_H_INCLUDED
| 287 | C++ | .h | 8 | 34.375 | 55 | 0.792727 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,512 | file_extra.h | tindy2013_subconverter/src/utils/file_extra.h | #ifndef FILE_EXTRA_H_INCLUDED
#define FILE_EXTRA_H_INCLUDED
#include "base64/base64.h"
#include "file.h"
#include "md5/md5_interface.h"
inline std::string fileToBase64(const std::string &filepath)
{
return base64Encode(fileGet(filepath));
}
inline std::string fileGetMD5(const std::string &filepath)
{
return ... | 382 | C++ | .h | 14 | 25.428571 | 60 | 0.774725 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,513 | rapidjson_extra.h | tindy2013_subconverter/src/utils/rapidjson_extra.h | #ifndef RAPIDJSON_EXTRA_H_INCLUDED
#define RAPIDJSON_EXTRA_H_INCLUDED
#include <stdexcept>
template <typename T> void exception_thrower(T e, const std::string &cond, const std::string &file, int line)
{
if(!e)
throw std::runtime_error("rapidjson assertion failed: " + cond + " (" + file + ":" + std::to_str... | 6,691 | C++ | .h | 157 | 34.56051 | 154 | 0.631029 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,514 | stl_extra.h | tindy2013_subconverter/src/utils/stl_extra.h | #ifndef STL_EXTRA_H_INCLUDED
#define STL_EXTRA_H_INCLUDED
#include <vector>
template <typename T> inline void eraseElements(std::vector<T> &target)
{
target.clear();
target.shrink_to_fit();
}
template <typename T> inline void eraseElements(T &target)
{
T().swap(target);
}
#if __cpp_concepts >= 201907L /... | 1,497 | C++ | .h | 39 | 35.974359 | 136 | 0.739461 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,515 | string.h | tindy2013_subconverter/src/utils/string.h | #ifndef STRING_H_INCLUDED
#define STRING_H_INCLUDED
#include <numeric>
#include <string>
#include <sstream>
#include <vector>
#include <map>
using string = std::string;
using string_size = std::string::size_type;
using string_array = std::vector<std::string>;
using string_view_array = std::vector<std::string_view>;
u... | 5,458 | C++ | .h | 137 | 37.218978 | 137 | 0.715581 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,516 | map_extra.h | tindy2013_subconverter/src/utils/map_extra.h | #ifndef MAP_EXTRA_H_INCLUDED
#define MAP_EXTRA_H_INCLUDED
#include <string>
#include <map>
#include <algorithm>
struct strICaseComp
{
bool operator() (const std::string &lhs, const std::string &rhs) const
{
return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(),
... | 733 | C++ | .h | 19 | 24.526316 | 85 | 0.48169 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,517 | codepage.h | tindy2013_subconverter/src/utils/codepage.h | #ifndef CODEPAGE_H_INCLUDED
#define CODEPAGE_H_INCLUDED
#include <string>
std::string utf8ToACP(const std::string &str_src);
std::string acpToUTF8(const std::string &str_src);
#endif // CODEPAGE_H_INCLUDED
| 209 | C++ | .h | 6 | 33.333333 | 50 | 0.785 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,518 | network.h | tindy2013_subconverter/src/utils/network.h | #ifndef NETWORK_H_INCLUDED
#define NETWORK_H_INCLUDED
#include <string>
#include "string.h"
std::string getFormData(const std::string &raw_data);
std::string getUrlArg(const std::string &url, const std::string &request);
bool isIPv4(const std::string &address);
bool isIPv6(const std::string &address);
void urlParse(... | 632 | C++ | .h | 15 | 40.533333 | 97 | 0.736928 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,520 | base64.h | tindy2013_subconverter/src/utils/base64/base64.h | #ifndef BASE64_H_INCLUDED
#define BASE64_H_INCLUDED
#include <string>
std::string base64Decode(const std::string &encoded_string, bool accept_urlsafe = false);
std::string base64Encode(const std::string &string_to_encode);
std::string urlSafeBase64Apply(const std::string &encoded_string);
std::string urlSafeBase64Re... | 529 | C++ | .h | 10 | 51.5 | 89 | 0.805825 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,522 | md5_interface.h | tindy2013_subconverter/src/utils/md5/md5_interface.h | #ifndef MD5_INTERFACE_H_INCLUDED
#define MD5_INTERFACE_H_INCLUDED
#include <string>
#include "md5.h"
inline std::string getMD5(const std::string &data)
{
std::string result;
/*
unsigned int i = 0;
unsigned char digest[16] = {};
#ifdef USE_MBEDTLS
mbedtls_md5_context ctx;
mbedtls_md5_init(&... | 1,105 | C++ | .h | 39 | 23.974359 | 99 | 0.63981 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,524 | webget.h | tindy2013_subconverter/src/handler/webget.h | #ifndef WEBGET_H_INCLUDED
#define WEBGET_H_INCLUDED
#include <string>
#include <map>
#include "utils/map_extra.h"
#include "utils/string.h"
enum http_method
{
HTTP_GET,
HTTP_HEAD,
HTTP_POST,
HTTP_PATCH
};
struct FetchArgument
{
const http_method method;
const std::string url;
const std::... | 1,688 | C++ | .h | 41 | 38.414634 | 188 | 0.733374 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,525 | multithread.h | tindy2013_subconverter/src/handler/multithread.h | #ifndef MULTITHREAD_H_INCLUDED
#define MULTITHREAD_H_INCLUDED
#include <mutex>
#include <future>
#include <yaml-cpp/yaml.h>
#include "config/regmatch.h"
#include "utils/ini_reader/ini_reader.h"
#include "utils/string.h"
using guarded_mutex = std::lock_guard<std::mutex>;
RegexMatchConfigs safe_get_emojis();
RegexMa... | 983 | C++ | .h | 22 | 43.409091 | 157 | 0.789529 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,526 | interfaces.h | tindy2013_subconverter/src/handler/interfaces.h | #ifndef INTERFACES_H_INCLUDED
#define INTERFACES_H_INCLUDED
#include <string>
#include <map>
#include <inja.hpp>
#include "config/ruleset.h"
#include "generator/config/subexport.h"
#include "server/webserver.h"
std::string parseProxy(const std::string &source);
void refreshRulesets(RulesetConfigs &ruleset_list, std... | 952 | C++ | .h | 23 | 40 | 85 | 0.808696 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,527 | settings.h | tindy2013_subconverter/src/handler/settings.h | #ifndef SETTINGS_H_INCLUDED
#define SETTINGS_H_INCLUDED
#include <string>
#include "config/crontask.h"
#include "config/regmatch.h"
#include "config/proxygroup.h"
#include "config/ruleset.h"
#include "generator/config/ruleconvert.h"
#include "generator/template/templates.h"
#include "utils/logger.h"
#include "utils/s... | 4,029 | C++ | .h | 108 | 32.675926 | 137 | 0.723431 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
10,528 | upload.h | tindy2013_subconverter/src/handler/upload.h | #ifndef UPLOAD_H_INCLUDED
#define UPLOAD_H_INCLUDED
#include <string>
std::string buildGistData(std::string name, std::string content);
int uploadGist(std::string name, std::string path, std::string content, bool writeManageURL);
#endif // UPLOAD_H_INCLUDED
| 261 | C++ | .h | 6 | 42 | 93 | 0.789683 | tindy2013/subconverter | 12,883 | 2,744 | 197 | GPL-3.0 | 9/20/2024, 9:26:25 PM (Europe/Amsterdam) | false | false | false | false | false | false | false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.