repo_name stringlengths 6 97 | path stringlengths 3 341 | text stringlengths 8 1.02M |
|---|---|---|
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 4/game-of-two-stacks.cpp | #include <bits/stdc++.h>
using namespace std;
// int twoStacks(int x, vector<int> a, vector<int> b) {
// int score = 0;
// int sum = 0;
//
// int ai = 0; // Poiter to the stack A
// int bi = 0; // Poiter to the stack B
// while((sum < x) && (sum +a[ai] < x|| sum +b[bi] < x)){ // After taking one from the sta... |
bimalka98/Data-Structures-and-Algorithms | Sorting Algorithms/Hackerrank Problems/Big Sorting/Bigsorting.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms
// -----------------------------------------------------------------------------
// Author : <NAME>
// GitHub : https://github.com/bimalka98
// Last Modified : 26.11.2020
// Link: https://www.hackerrank.com/challenges/big-sort... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 3/BinarySearchusingDivideandConquer.cpp | #include <bits/stdc++.h>
using namespace std;
int bin_search(int *sorted_arr, int query ,int left, int right); // binary search function declaration
int main() {
int len_array, num_queries;
cin >> len_array >> num_queries; // getting numbers of inputs
int Sorted_array[len_array];
for(int i = 0; i <... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 5/poisonousPlants.cpp | int poisonousPlants(vector<int> p) {
int num_of_plants = p.size(); // Number of plants at the begining.
int days = 0;
while(true){
// Trying to get the remaining plants after a day.
// There's no plant left to the first plant. Therefore it is preserved anyway.
vector<int> remainin... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 4/castle-on-the-grid.cpp | // Declaring functions
int up(vector<string> &grid, int& currentX, int& currentY){ // Function to move upward in the grid
int count = 0;
while((currentX < grid.size()-1)){
if(grid[currentX+1][currentY] == '.'){ // Loop continuous as long as the current path is clear.
grid[currentX][currentY] = 'X'; //Re... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 2/2D_Array_DS.cpp | // Complete the hourglassSum function below.
int hourglassSum(vector<vector<int>> arr) {
vector<int> sums; // declaring a vector to store the sums since we have no idea about the range of sums[min, max]
for(int i = 0; i <4; i++){
for(int j = 0; j <4;j++){
int sum = arr[i][j] + arr[i][j+1] ... |
bimalka98/Data-Structures-and-Algorithms | Graphs/Kruskal's algorithm/main.cpp | <filename>Graphs/Kruskal's algorithm/main.cpp
/*
MST-Kruskal(G, w)
1. A <- NULL;
2. For each vertex v IN G.V
3. MAKE-SET(v)
4. sort the edges of G.E in nondecreasingorder of weight
5. for each edge (u, v) IN G.E, in order of nondecreasing weight
6.if FIND-SET(u) INEQUAL FIND-SET (v)
7. A <- A U {(u,v)}
8.... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 2/Matrix_sum_Challenge.cpp | // Matrix Sum Challenge
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int N;
cin >> N;
if(N == 1) cout << 1; // if N == 1 then simply return 1 ... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 5/BalancedBrackets.cpp | <gh_stars>1-10
//One of the use cases of the stacks is checking the balanced brackets.
string isBalanced(string s) {
int length = s.length();
if(length == 0) return "YES"; //case 1 : An empty string
else{//case 2 : A non-empty string
vector<char> stack = {}; // create a stack to store opening brackets... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/BinaryTree.cpp | <filename>Data Structures/BinaryTree.cpp
#include<iostream>
#include <queue>
using namespace std;
//==============================================================================
//dynamically crerated nodes are used to store
// Node = binary search tree
struct Node
{
int data;
// char data;
Node* leftChi... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 6/Breadth First Search Shortest Reach/main.cpp | <gh_stars>1-10
vector<int> bfs(int n, int m, vector<vector<int>> edges, int s);
int dist(vector<vector<int>> adjList, int n, int s, int k );
// Complete the bfs function below.
vector<int> bfs(int n, int m, vector<vector<int>> edges, int s) {
//creating the graph as an adjascnecy list
std::vector<vecto... |
bimalka98/Data-Structures-and-Algorithms | Sorting Algorithms/Merge Sort/main.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms
#include <bits/stdc++.h>
using namespace std;
// begin = array.begin() = 0
// end = array.end() = 8
// middle = 4
// [0,1,2,3,4,5,6,7,8] n1 = 4-0 +1 = 5; n2 = 8-4 = 4;
void mergeF(int* primary_array, int begin, int middle, int end) {
int n1 = middle - begin +... |
bimalka98/Data-Structures-and-Algorithms | Sorting Algorithms/Bubble Sort/main.cpp | // -----------------------------------------------------------------------------
// Author : <NAME>
// GitHub : https://github.com/bimalka98
// Last Modified : 27.11.2020
// -----------------------------------------------------------------------------
#include <iostream>
in... |
bimalka98/Data-Structures-and-Algorithms | Graphs/HackerRank/Roads and Libraries/dfs.cpp | <filename>Graphs/HackerRank/Roads and Libraries/dfs.cpp
// =============================================================================
// https://www.youtube.com/watch?v=kVyIhwYnLNs
void dfs(const vector<vector<int>> & vec, int s);
int dfs1(vector<vector<int>> & vec, int src, vector<bool> &visited);
int dfs(vector<v... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 5/tree-height-of-a-binary-tree.cpp | #include <bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *left;
Node *right;
Node(int d) {
data = d;
left = NULL;
right = NULL;
}
};
class Solution {
public:
Node* insert(Node* root, int data) {
... |
bimalka98/Data-Structures-and-Algorithms | Sorting Algorithms/Hackerrank Problems/The Full Counting Sort/main.cpp | // Complete the countSort function below.
void countSort(vector<vector<string>> arr) {
// since integer associated with sitrings less than 100
// Initiate a vector of vectors of 100 rows (0 to 99)
vector<vector<string>> sorted(100);
int size = arr.size(); // get the size of the input array to iterate
for (int i = 0;... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/ReverseLinkList_stack.cpp | #include<iostream>
#include <stack>
#include <string.h>
using namespace std;
// no worries about overflow
struct Node
{
int data;
Node *next;
};
//==============================================================================
// Initializing a pointer to the top Node as null: an empty linked list
Node* head = ... |
bimalka98/Data-Structures-and-Algorithms | Mini-xtreme-2021/Answers/q2.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms<gh_stars>1-10
//Teacher and his Students
//timeout with 4 samples
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >>t; //test cases
for(int i =0; i < t; i++){
int n,m;
cin >> n;
cin >> m;
int total = n+m;
set<unsigned... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/BalanceParantheses.cpp | // ususally run by compilers at the compile time to check syntax errors
#include<iostream>
#include <stack>
#include <string.h>
using namespace std;
char mirror(char c){
if(c=='}') return '{';
if(c==']') return '[';
if(c==')') return '(';
}
bool isBalanced(string s){
int length = s.length();
if(length == ... |
bimalka98/Data-Structures-and-Algorithms | Mini-xtreme-2021/Answers/q3.cpp | <gh_stars>1-10
//Drone Navigation
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >>t; //test cases
for(int i =0; i < t; i++){
int x,y;
cin >> x;
cin >> y;
string orders;
cin >> orders;
int R = 0;int L = 0;int U = 0;int D = 0;
for(char order:orders){
if(o... |
bimalka98/Data-Structures-and-Algorithms | Dynamic Programming/fib.cpp | <filename>Dynamic Programming/fib.cpp
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
ull Fibonacci(int position, map<int ,ull> &memo){
// time complexity = 2^n
// space complexity = n
// ====solution through memoization====
if (position <=2) return 1; // base case
// if key ... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/ReverseString_stack.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms
#include<iostream>
#include <stack>
#include <string.h>
using namespace std;
// time complexity is O(n);
// Space complexity is O(n);
void reverseString(char *C, int n){
stack<char> charStack;
for(int i =0; i < n; i++) charStack.push(C[i]); // filling the sta... |
bimalka98/Data-Structures-and-Algorithms | Recursion Algorithms/RecursiveDigitSum.cpp | //https://www.hackerrank.com/challenges/recursive-digit-sum/problem
string sumstr(string p){
int len = p.length();
if (len==1) return p;
else{
int var = 0;
//The value of the char '0' is 48. The value of the char '1' is 49.
//so when you do '1' - '0' you get the result 1
for... |
bimalka98/Data-Structures-and-Algorithms | Dynamic Programming/bestSum.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> bestSum(int targetSum, vector<int> &numbers, map<int, vector<int>> &memo){
//If a combination is readily available
if(memo.find(targetSum) != memo.end()) return memo[targetSum];
// checking the base cases
if(targetSum==0) return {}; // Combination ex... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/StackLinkList.cpp | <filename>Data Structures/StackLinkList.cpp
//=================================Stacks=======================================
/*
* Author : <NAME>
* GitHub : https://github.com/bimalka98
*/
#include <iostream>
using namespace std;
//=============================Stacks using Linked lists========================
// n... |
bimalka98/Data-Structures-and-Algorithms | Mini-xtreme-2021/Answers/q7.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms<gh_stars>1-10
// // John’s Party
// #include <bits/stdc++.h>
// using namespace std;
// #define ull unsigned long long
//
// // List of connections
// int main(){
// int N;
// cin >>N; //test cases
// vector<vector<int>> connections(N+1);
// for(int i =0; i < N... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 6/Prim's (MST) Special Subtree/main.cpp | //https://github.com/OmarAhmedSaleh/competitive-programming/blob/master/HackerRank/Prim's%20(MST)%20:%20Special%20Subtree.CPP
//https://www.cplusplus.com/reference/queue/priority_queue/
void MaintainMinPQ(priority_queue<pair<int, int>> &priorityQ, int node, vector<bool> &visited, vector<vector<pair<int, int>>> & adjLi... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/DoublyLinkedLists.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms
//==========================doubly linked lists=================================
/*
* Author : <NAME>
* GitHub : https://github.com/bimalka98
*/
// advantags : reverse look up due to previus address
// each node consists of three fields
#include <iostream>
using... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 6/Decent Number/gh.cpp | // get combinations of threes and fives which sums upto n
void getCombinations(vector<pair<int, int>> &combs, int n) {
int fives = 0;
int threes = 0;
while (true) {
fives = n - threes;
if (fives < 0) break;
//The number of 5's it contains is divisible by 3.
if (fives % 3 =... |
bimalka98/Data-Structures-and-Algorithms | Dynamic Programming/canSum.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms<filename>Dynamic Programming/canSum.cpp
#include <bits/stdc++.h>
using namespace std;
/*
// all inputs are non negative
// any element can be use any times
bool canSum(int targetsum, vector<int> & array){
// time complexity = O(m^n) m -target sum, n -lenght of array.
... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/Stacks.cpp | //=================================Stacks using arrays==========================
/*
* Author : <NAME>
* GitHub : https://github.com/bimalka98
*/
#include <iostream>
using namespace std;
// =============================Stacks using arrays=============================
// Global variable definitions
#ifndef MAX_SIZE... |
bimalka98/Data-Structures-and-Algorithms | Mini-xtreme-2021/Answers/q1.cpp | <gh_stars>1-10
//Count Dracula 1
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
int main(){
int numkeys;
cin >> numkeys;
int*array;
array = new int[numkeys];
for(int i = 0; i < numkeys; i++) std::cin >> array[i];
// Bubble sort algorithm
//-------------------------------... |
bimalka98/Data-Structures-and-Algorithms | Recursion Algorithms/main.cpp | #include <bits/stdc++.h>
using namespace std;
// The Power Sum usnig recursive backtracking
// Find the number of ways that a given integer, X, can be expressed
// as the sum of the Nth powers of unique, natural numbers.
int powerSum(int X, int N) {
}
int main(){
int X, N;
cin >> X >> N;
}
|
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 4/truck-tour.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms
#include <bits/stdc++.h>
using namespace std;
int truckTour(vector<vector<int>> petrolpumps) {
int stations = petrolpumps.size();
int start = -1; //initializing a random variable to store the start.
for(int i = 0; i< stations;i++){
if(start != -1) ... |
bimalka98/Data-Structures-and-Algorithms | C++ Basics/arrayin.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
//#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
int intarr[n];
for(int i=0; i<n;i++) cin >> intarr[i];
for(int i=0;... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/InPrePostFixes.cpp | /*
EvaluatePostfix(exp){
create a stack
for i =0 to length of exp-1{
if (exp[i]) is operand push(exp[i])
else if (exp[i] is operator){
op2 = top(); pop()
op1 = top(); pop()
result = perform(exp[i], op1, op2)
}
}
return top of stack
}
*/
/*
EvaluatePrefix(exp){
create a stack
for i =0 to length of exp-1{
if (exp[i]) is... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 3/Cheatingslotmachine.cpp | <filename>Lab Sessions/Lab 3/Cheatingslotmachine.cpp<gh_stars>1-10
//find the strategy to find the best first and the last slot
//machines to play with
#include <bits/stdc++.h>
using namespace std;
// Function declaration
// int a(int num1, int *array);
// int b(int num2, int *array);
// int c(int num3, int *ar... |
bimalka98/Data-Structures-and-Algorithms | Searching Algorithm/bin_search.cpp | <reponame>bimalka98/Data-Structures-and-Algorithms
// Binary Search Algorithm
// The Algorithm : Narrows the Search by a Factor of Two at Each Iteration
// BINARY_SEARCH(List, Key)
// if length of the List is 0
// Return false
// else if the middle element is equal to Key
// return true/ return index
// ... |
bimalka98/Data-Structures-and-Algorithms | Dynamic Programming/howSum.cpp | #include <bits/stdc++.h>
using namespace std;
vector<int> howSum(int targetSum, vector<int> &numbers, map<int, vector<int>> &memo){
//If a combination is readily available
if(memo.find(targetSum) != memo.end()) return memo[targetSum];
// checking the base cases
if(targetSum==0) return {}; // Combination exis... |
bimalka98/Data-Structures-and-Algorithms | Dynamic Programming/gridtraveler.cpp | #include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
// Recursive approach
// time complexity 2^(m+n)
/*
int gridTraveler(int m, int n){
if( m==1 && n==1) return 1;
if( m==0 || n==0) return 0;
return gridTraveler(m -1, n) + gridTraveler(m, n -1);
}
*/
// memoization approach to reduce ti... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/SinglyLinkedLists.cpp | //==========================singly linked lists=================================
/*
* Author : <NAME>
* GitHub : https://github.com/bimalka98
*/
#include <iostream>
using namespace std;
//==============================================================================
struct Node
{
int data;
Node *next;
};
... |
bimalka98/Data-Structures-and-Algorithms | C++ Basics/classes.cpp | #include <iostream>
#include <string>
using namespace std;
class Person{
private://only inside this class
//varibale declaratioon
int age;
string name;
public: // inside and out side the class
Person(string name, int age){
//cout << "Constructor called!"<< '\n';
this->name = name;
this->a... |
bimalka98/Data-Structures-and-Algorithms | Sorting Algorithms/Insertion Sort/main.cpp | <filename>Sorting Algorithms/Insertion Sort/main.cpp
// -----------------------------------------------------------------------------
// Author : <NAME>
// GitHub : https://github.com/bimalka98
// Last Modified : 26.11.2020
// --------------------------------------------------... |
bimalka98/Data-Structures-and-Algorithms | Sorting Algorithms/Heap Sort/main.cpp | // Heap Sort
#include <bits/stdc++.h>
using namespace std;
const int arraySize = 10; // We have a fixed size array
int heapSize = 7; // But variable size heap
void swap(int* array, int index1, int index2){
int tempvar = array[index1];
array[index1] = array[index2];
array[index2] = tempvar;
}
/*
the LEFT proced... |
bimalka98/Data-Structures-and-Algorithms | Data Structures/QueuesArray.cpp | <gh_stars>1-10
#include<iostream>
using namespace std;
#define length 10
int array[length];
int front = -1;
int rear = -1;
inline bool isQEmpty(){ return (front==-1)? true:false;}
inline bool isQfull() { return (rear=length-1)? true:false;}
// Circular array implementation of the queues
void enqueue(int x){
// if ... |
bimalka98/Data-Structures-and-Algorithms | Graphs/HackerRank/Roads and Libraries/main.cpp | #include <bits/stdc++.h>
using namespace std;
// int n, int c_lib, int c_road;
// n = 3;c_lib = 2; c_road = 1;
//long roadsAndLibraries(int n, int c_lib, int c_road, vector<vector<int>> cities) {
/*
* int n: integer, the number of cities
* int c_lib: integer, the cost to build a library
* int c_road: integer, t... |
bimalka98/Data-Structures-and-Algorithms | Lab Sessions/Lab 2/Left_Rotation.cpp | vector<int> rotateLeft(int d, vector<int> arr) {
int i = 0; // declaring a temporarily variable to store the number of steps
while(i < d){
int temp = *arr.begin(); // storing the first element in the vector to a temporarily variable
arr.erase(arr.begin()); // erasing the first element
arr... |
Wunkolo/qHilbert | include/qHilbert.hpp | <reponame>Wunkolo/qHilbert
#pragma once
#include <cstdint>
#include <cstddef>
#include <glm/glm.hpp>
void qHilbert2D(
std::size_t Order,
const std::uint32_t Distances[],
glm::u32vec2 Positions[],
std::size_t Count
);
// Wikipedia implementation
void d2xy(int n, int d, int* x, int* y);
|
Wunkolo/qHilbert | source/qHilbert.cpp | #include <qHilbert.hpp>
#include <algorithm>
#if defined(__x86_64__) || defined(_M_X64)
#include <immintrin.h>
#ifdef _MSC_VER
#include <intrin.h>
#endif
#elif defined(__ARM_NEON)
#include <arm_neon.h>
#else
#endif
enum SIMDSize
{
Serial = 0,
Size2 = 1,
Size4 = 2,
Size8 = 3,
Size16 = 4,
Size32 = ... |
Wunkolo/qHilbert | tests/benchmark.cpp | #include <cstddef>
#include <cstdint>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <array>
#include <vector>
#include <functional>
#include "TestBed.hpp"
#include <qHilbert.hpp>
#define TRIALCOUNT 10
// With a 2D Hilbert curve, every 2 b... |
Wunkolo/qHilbert | tests/TestBed.hpp | #pragma once
#include <cstdint>
#include <cstddef>
#include <string>
#include <chrono>
#ifdef _WIN32
#include <intrin.h>
#define NOMINMAX
#include <Windows.h>
// Statically enables "ENABLE_VIRTUAL_TERMINAL_PROCESSING" for the terminal
// at runtime to allow for unix-style escape sequences.
static const bool _WndV100... |
fmdunlap/NetcodeEEProject | edge.cpp | <filename>edge.cpp
#include "edge.h"
int main(int argc, char* argv[]){
if(!beginListening()) {
cout << "BEGIN LISTENING ERROR" << endl;
return -1;
}
}
bool beginListening(){
memset(&tcp_hints, 0, sizeof tcp_hints);
tcp_hints.ai_family = AF_UNSPEC;
... |
fmdunlap/NetcodeEEProject | client.cpp | <filename>client.cpp
#include "client.h"
//happily abstracted main! Basically, we just tell the user that the file is up,
//then we load the file into the job vector, and ~magically~ send it to the
//edge server. (Unless they opened the file wrong...)
int main(int argc,char* argv[]){
if(argc == 2) {
... |
fmdunlap/NetcodeEEProject | server_or.cpp | <gh_stars>0
#include "server_or.h"
//Our friend the trim fn from both client and edge
string trim0s(string in){
int i = in.find_first_of("1");
if(i != string::npos) return in.substr(i);
else return "0";
}
int main(){
//make our buffer,
char buf[1000];
//make sure hints is clear, and the... |
Milezoefif/virtual-robot | src/main/cpp/TrainDrive.cpp | <reponame>Milezoefif/virtual-robot
#include "TrainDrive.h"
TrainDrive::TrainDrive(float left, float right)
{
}
float TrainDrive::getRight(){
}
float TrainDrive::getLeft(){
} |
jnpmartel/caffe | src/caffe/layers/softmax_vector_loss_layer.cpp | <reponame>jnpmartel/caffe
// Copyright 2014 <NAME>
#include <algorithm>
#include <cfloat>
#include <vector>
#include "caffe/layer.hpp"
#include "caffe/vision_layers.hpp"
#include "caffe/util/math_functions.hpp"
namespace caffe {
template <typename Dtype>
void SoftmaxWithVectorLossLayer<Dtype>::SetUp(const vector<Bl... |
jnpmartel/caffe | src/caffe/layer_factory.cpp | // Copyright 2013 <NAME>
#ifndef CAFFE_LAYER_FACTORY_HPP_
#define CAFFE_LAYER_FACTORY_HPP_
#include <string>
#include "caffe/layer.hpp"
#include "caffe/vision_layers.hpp"
#include "caffe/proto/caffe.pb.h"
namespace caffe {
// A function to get a specific layer from the specification given in
// LayerParameter. I... |
jnpmartel/caffe | src/caffe/layers/datarandtransform_layer.cpp | <filename>src/caffe/layers/datarandtransform_layer.cpp
// Copyright 2014 <NAME>
#include "caffe/layer.hpp"
#include "caffe/util/io.hpp"
#include "caffe/vision_layers.hpp"
#include <opencv2/opencv.hpp>
#include <opencv2/imgproc/imgproc.hpp>
namespace caffe {
template <typename Dtype>
DataRandTransformLayer<Dtype>::~... |
andresfsilva/vcf-validator | inc/vcf/error-odb.ipp | <filename>inc/vcf/error-odb.ipp
// This file was generated by ODB, object-relational mapping (ORM)
// compiler for C++.
//
namespace odb
{
// Error
//
inline
access::object_traits< ::ebi::vcf::Error >::id_type
access::object_traits< ::ebi::vcf::Error >::
id (const object_type& o)
{
return o.id_;
}... |
andresfsilva/vcf-validator | test/vcf/debugulator_test.cpp | /**
* Copyright 2015-2017 EMBL - European Bioinformatics Institute
*
* 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 require... |
andresfsilva/vcf-validator | inc/util/cli_utils.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | test/vcf/test_utils.hpp | <reponame>andresfsilva/vcf-validator<gh_stars>1-10
/**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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... |
andresfsilva/vcf-validator | inc/vcf/normalizer.hpp | <reponame>andresfsilva/vcf-validator<filename>inc/vcf/normalizer.hpp
/**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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
*
* ... |
andresfsilva/vcf-validator | inc/vcf/assembly_check_report_writer.hpp | <filename>inc/vcf/assembly_check_report_writer.hpp
/**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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... |
andresfsilva/vcf-validator | src/fasta/faidx.cpp | <reponame>andresfsilva/vcf-validator
/**
* Copyright 2019 EMBL - European Bioinformatics Institute
*
* 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/... |
andresfsilva/vcf-validator | test/fasta/faidx_test.cpp | <reponame>andresfsilva/vcf-validator
/**
* Copyright 2019 EMBL - European Bioinformatics Institute
*
* 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/... |
andresfsilva/vcf-validator | inc/vcf/validator_detail_v42.hpp |
#line 1 "src/vcf/vcf_v42.ragel"
/**
* Copyright 2014-2017 EMBL - European Bioinformatics Institute
*
* 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... |
andresfsilva/vcf-validator | test/assembly_report/assembly_report_test.cpp | <filename>test/assembly_report/assembly_report_test.cpp
/**
* Copyright 2018 EMBL - European Bioinformatics Institute
*
* 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.a... |
andresfsilva/vcf-validator | src/vcf/fixer.cpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | inc/vcf/error-odb.hpp | <filename>inc/vcf/error-odb.hpp<gh_stars>100-1000
// This file was generated by ODB, object-relational mapping (ORM)
// compiler for C++.
//
#ifndef ERROR_ODB_HPP
#define ERROR_ODB_HPP
#include <odb/version.hxx>
#if (ODB_VERSION != 20400UL)
#error ODB runtime version mismatch
#endif
#include <odb/pre.hxx>
#include... |
andresfsilva/vcf-validator | inc/util/stream_utils.hpp | <reponame>andresfsilva/vcf-validator<filename>inc/util/stream_utils.hpp
/**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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
*
... |
andresfsilva/vcf-validator | inc/vcf/meta_entry_visitor.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | src/vcf/compression.cpp | <reponame>andresfsilva/vcf-validator
/**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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/... |
andresfsilva/vcf-validator | inc/vcf/optional_policy.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | src/vcf/debugulator.cpp | <gh_stars>100-1000
/**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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
*
* ... |
andresfsilva/vcf-validator | src/assembly_checker_main.cpp | <reponame>andresfsilva/vcf-validator<gh_stars>0
/**
* Copyright 2018 EMBL - European Bioinformatics Institute
*
* 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.or... |
andresfsilva/vcf-validator | inc/vcf/odb_report.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | inc/util/algo_utils.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | src/vcf/meta_entry.cpp | <reponame>andresfsilva/vcf-validator
/**
* Copyright 2014-2017 EMBL - European Bioinformatics Institute
*
* 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/lice... |
andresfsilva/vcf-validator | inc/vcf/fixer.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | test/vcf/metaentry_test.cpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | inc/fasta/fasta.hpp | /**
* Copyright 2018 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | src/vcf/source.cpp | /**
* Copyright 2014-2017 EMBL - European Bioinformatics Institute
*
* 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 require... |
andresfsilva/vcf-validator | inc/vcf/debugulator.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | inc/vcf/record_cache.hpp | /**
* Copyright 2017 EMBL - European Bioinformatics Institute
*
* 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 ... |
andresfsilva/vcf-validator | inc/vcf/compression.hpp | <filename>inc/vcf/compression.hpp
/**
* Copyright 2014-2017 EMBL - European Bioinformatics Institute
*
* 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/license... |
andresfsilva/vcf-validator | test/vcf/parser_v42_test.cpp | /**
* Copyright 2015-2017 EMBL - European Bioinformatics Institute
*
* 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 require... |
andresfsilva/vcf-validator | inc/vcf/file_structure.hpp | <filename>inc/vcf/file_structure.hpp
/**
* Copyright 2014-2017 EMBL - European Bioinformatics Institute
*
* 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/lice... |
acoget/BabylonNative | Plugins/NativeEngine/Source/ShaderCompilerOpenGL.cpp | <reponame>acoget/BabylonNative
#include "ShaderCompiler.h"
#include "ResourceLimits.h"
#include <arcana/experimental/array.h>
#include <glslang/Public/ShaderLang.h>
#include <SPIRV/GlslangToSpv.h>
#include <spirv_parser.hpp>
#include <spirv_glsl.hpp>
namespace Babylon
{
extern const TBuiltInResource DefaultTBuiltI... |
acoget/BabylonNative | Core/AppRuntime/Source/AppRuntimeWin32.cpp | <filename>Core/AppRuntime/Source/AppRuntimeWin32.cpp
#include "AppRuntime.h"
#include <Objbase.h>
#include <gsl/gsl>
#include <cassert>
namespace Babylon
{
namespace
{
constexpr size_t FILENAME_BUFFER_SIZE = 1024;
}
void AppRuntime::RunPlatformTier()
{
HRESULT hr = CoInitializeEx... |
acoget/BabylonNative | Plugins/NativeInput/Source/NativeInput.cpp | #include "NativeInput.h"
#include "DeviceInputSystem.h"
#include <Babylon/JsRuntime.h>
#include <Babylon/Plugins/NativeInput.h>
#include <sstream>
namespace Babylon::Plugins
{
namespace
{
constexpr auto JS_NATIVE_INPUT_NAME = "_nativeInput";
constexpr auto POINTER_BASE_DEVICE_ID = "Pointer";
... |
acoget/BabylonNative | Dependencies/xr/Source/ARCore/XR.cpp | <reponame>acoget/BabylonNative
#include <XR.h>
#include <assert.h>
#include <optional>
#include <sstream>
#include <chrono>
#include <arcana/threading/task.h>
#include <arcana/threading/dispatcher.h>
#include <thread>
#include <GLES2/gl2.h>
#include <GLES2/gl2ext.h>
#include <GLES3/gl3.h>
#include <EGL/egl.h>
#inclu... |
acoget/BabylonNative | Plugins/NativeInput/Source/DeviceInputSystem.cpp | #include "DeviceInputSystem.h"
namespace Babylon::Plugins
{
void NativeInput::Impl::DeviceInputSystem::Initialize(Napi::Env env)
{
Napi::HandleScope scope{env};
static constexpr auto JS_CONSTRUCTOR_NAME = "DeviceInputSystem";
Napi::Function func
{
DefineClass(
... |
acoget/BabylonNative | Core/AppRuntime/Source/AppRuntimeV8.cpp | <filename>Core/AppRuntime/Source/AppRuntimeV8.cpp
#include "AppRuntime.h"
#include <v8.h>
#include <libplatform/libplatform.h>
namespace Babylon
{
namespace
{
class Module final
{
public:
Module(const char* executablePath)
{
v8::V8::InitializeICU... |
stjude/fuzzion | fuzzion.cpp | //------------------------------------------------------------------------------------
//
// fuzzion.cpp - program to find the reads in a BAM file containing two target
// sequences, or containing one target sequence and not containing a
// second target sequence; each sequence is matched ap... |
RTAndroid/android_packages_apps_Ballsort | app/src/main/jni/color.cpp | /*
* Copyright (C) 2017 RTAndroid Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or... |
RTAndroid/android_packages_apps_Ballsort | app/src/main/jni/sorter.cpp | <gh_stars>1-10
/*
* Copyright (C) 2017 RTAndroid Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by ap... |
RTAndroid/android_packages_apps_Ballsort | app/src/main/jni/utils.cpp | <reponame>RTAndroid/android_packages_apps_Ballsort<filename>app/src/main/jni/utils.cpp<gh_stars>1-10
/*
* Copyright (C) 2017 RTAndroid Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the Licens... |
Jojooo0o/programmiersprachen-aufgabenblatt-4 | source/List.hpp | <reponame>Jojooo0o/programmiersprachen-aufgabenblatt-4<filename>source/List.hpp<gh_stars>0
#ifndef BUW_LIST_HPP
#define BUW_LIST_HPP
#include <cstddef>
// List.hpp
template < typename T >
struct List ;
template < typename T >
struct ListNode
{
ListNode () : m_value (), m_prev ( nullptr ), m_next ( nullptr ) {}
... |
Jojooo0o/programmiersprachen-aufgabenblatt-4 | source/main.cpp | <reponame>Jojooo0o/programmiersprachen-aufgabenblatt-4
#include <cstdlib> //std::rand()
#include <vector> //std::vector<>
#include <list> //std::list<>
#include <iostream> //std::cout
#include <iterator> //std::ostream_iterator<>
#include <algorithm> //std::reserve, std::generate
int main ()
{
std::vector<int> v0(10... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.