1000copy

/*
 * Author : Pierre-Henri Symoneaux
 */

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

//Hashtable element structure
typedef struct hash_elem_t {
	struct hash_elem_t* next; // Next element in case of a collision

1000copy

#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <map>

// return given mumber as a string
std::string str(long n) { std::ostringstream os; os << n; return os.str(); }

1000copy

###
#Step 1 - Generate server certificates etc...  (most of this code is horribly ripped off from nodejs docs currently -> http://nodejs.org/docs/latest/api/tls.html)
###

#Assuming your starting from a clean directory

mkdir server
cd server

#generate private key

1000copy

import bisect
import itertools
import operator


class _BNode(object):
    __slots__ = ["tree", "contents", "children"]

    def __init__(self, tree, contents=None, children=None):
        self.tree = tree