Esempio n. 1
0
def bintree_build_delete():
    tree = BinaryTree.from_keys(keys)
    for key in keys:
        del tree[key]
Esempio n. 2
0
def bintree_build():
    tree = BinaryTree.from_keys(keys)
Esempio n. 3
0
from __main__ import cbintree_build_delete, cbintree_build, cbintree_search, itercbintree
"""


def random_keys():
    import random
    return random.sample(range(KEYRANGE), KEYS)


try:
    with open('testkeys.txt') as fp:
        keys = eval(fp.read())
except IOError:
    keys = random_keys()

py_searchtree = BinaryTree.from_keys(keys)
cy_searchtree = FastBinaryTree.from_keys(keys)


def bintree_build_delete():
    tree = BinaryTree.from_keys(keys)
    for key in keys:
        del tree[key]


def cbintree_build_delete():
    tree = FastBinaryTree.from_keys(keys)
    for key in keys:
        del tree[key]

Esempio n. 4
0
def bintree_build():
    tree = BinaryTree.from_keys(keys)
Esempio n. 5
0
def bintree_build_delete():
    tree = BinaryTree.from_keys(keys)
    for key in keys:
        del tree[key]
Esempio n. 6
0
    keys = set()
    while len(keys) < KEYS:
        keys.add(randint(0, KEYRANGE))
    keys = list(keys)
    shuffle(keys)
    return keys


try:
    fp = open("testkeys.txt")
    keys = eval(fp.read())
    fp.close()
except IOError:
    keys = random_keys()

py_searchtree = BinaryTree.from_keys(keys)


def bintree_build_delete():
    tree = BinaryTree.from_keys(keys)
    for key in keys:
        del tree[key]


def bintree_build():
    tree = BinaryTree.from_keys(keys)


def bintree_search():
    for key in keys:
        obj = py_searchtree[key]
def bintree_build2():
    BinaryTree.from_keys(keys)