goldsborough

import java.util.*;

public class BTree<Key extends Comparable>
{
    public BTree(int degree)
    {
        if (degree <= 0)
        {
            throw new IllegalArgumentException("Degree must be greater 0!");
        }

goldsborough

template<typename Iterator, typename Value>
struct Position
{
	Position(const Iterator& iterator_, const Value& value_)
	: iterator(iterator_)
	, value(value_)
	{ }

	Iterator iterator;
	

goldsborough

#ifndef UTILITY_HPP
#define UTILITY_HPP

#include "global.hpp"

#include <algorithm>
#include <chrono>
#include <cmath>
#include <ctime>
#include <iterator>

goldsborough

bool graph_exists(std::vector<int> degrees)
{
	auto remaining = degrees.size();
	
	for (auto i = degrees.begin(), end = degrees.end(); i != end; ++i)
	{
		std::sort(i, end, std::greater<int>());

		if (*i == 0) return true;
		

goldsborough

#include <iostream>
#include <netdb.h>
#include <netinet/in.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <unistd.h>

goldsborough

#!/usr/bin/env python3
# -*- coding: utf-8 -*-

from __future__ import print_function, division

import re
import sys
import numpy as np

goldsborough

#include <assert.h>
#include <stdlib.h>
#include <string.h>

#include "hashtable.h"


#include <stdio.h>

goldsborough

#include <arpa/inet.h>
#include <asm/byteorder.h>
#include <assert.h>
#include <errno.h>
#include <net/ethernet.h>
#include <netinet/ether.h>
#include <netinet/icmp6.h>
#include <netinet/ip6.h>
#include <stdio.h>
#include <stdlib.h>

goldsborough

#!/usr/bin/env python
# -*- coding: utf-8 -*-

from __future__ import division

import numpy as np

def pca(X, cutoff=2):
    """
    Performs principal components analysis on a data-set.

goldsborough

#!/usr/bin/env python
# -*- coding: utf-8 -*-

import math
import random

WORD_SIZE = 32
WORD_MAX = 1 << 32
WORD_MASK = WORD_MAX - 1