def demo_hashsoup(table={}):
# Create N trees
N = 100
inds = range(N)
import random
random.shuffle(inds)
RB = HashTableRB(table=table)
D = RB.E
index = [D]
for i in inds:
D = RB.insert(i, D)
index.append(D)
index2 = [RB.E]
for D,i in zip(index,inds):
D = RB.insert(i, D)
index2.append(D)
assert index == index2
D = RB.reconstruct(index[1])
print D, index[1]
def demo_hashsoup(table={}):
# Create N trees
N = 100
inds = range(N)
import random
random.shuffle(inds)
RB = HashTableRB(table=table)
D = RB.E
index = [D]
for i in inds:
D = RB.insert(i, D)
index.append(D)
index2 = [RB.E]
for D, i in zip(index, inds):
D = RB.insert(i, D)
index2.append(D)
assert index == index2
D = RB.reconstruct(index[1])
print D, index[1]
