assert (tree.contains(j))
assert (tree.lastSearchDepth <= maxDepth)
@timer
def removeTest(tree, items):
print 'test 3 - deleting all the elements...'
for j in items:
tree.removeValue(j)
ins, cons, rem = [], [], []
for x in xrange(5):
print 'Test N%d' % x
tree = TTTree()
print 'generating set...'
items = set()
for x in xrange(ITEMS):
val = random.randint(0, RANDMAX)
if val not in items: items.add(val)
print 'done'
# cProfile.runctx('insertTest(tree, items)', globals(), locals())
ins.append(insertTest(tree, items))
cons.append(consTest(tree, items))
print 'shuffling...'
items = list(items)
random.shuffle(items)
print 'done'
rem.append(removeTest(tree, items))
assert (tree.root is None)
def __init__(self, dim, defaultVal=0):
self.dim = dim
self.defVal = defaultVal
self.trunk = TTTree()
self.getidx = []
self.maxIdx = self.__indexFunc(map(lambda x: x - 1, self.dim))
