def test_removals():
bt = BTree(20)
l = range(2000)
map(bt.insert, l)
rand = l[:]
random.shuffle(rand)
while l:
assert list(bt) == l
rem = rand.pop()
l.remove(rem)
bt.remove(rem)
assert list(bt) == l
def test_removals():
bt = BTree(20)
l = range(2000)
map(bt.insert, l)
rand = l[:]
random.shuffle(rand)
while l:
assert list(bt) == l
rem = rand.pop()
l.remove(rem)
bt.remove(rem)
assert list(bt) == l
def test_additions():
bt = BTree(20)
rl = [index.Span(a, a + 5) for a in range(0, 100, 5)]
for i, r in enumerate(rl):
bt.insert(r)
assert list(bt) == rl[:i + 1]
def test_additions():
bt = BTree(20)
rl = [index.Span(a, a + 5) for a in range(0, 100, 5)]
for i, r in enumerate(rl):
bt.insert(r)
assert list(bt) == rl[:i + 1]
def test_additions():
bt = BTree(20)
l = range(2000)
for i, item in enumerate(l):
bt.insert(item)
assert list(bt) == l[:i + 1]
def test_insert_regression():
bt = BTree.bulkload(range(2000), 50)
for i in xrange(100000):
bt.insert(random.randrange(2000))
def test_bulkloads():
bt = BTree.bulkload(range(2000), 20)
assert list(bt) == range(2000)
def test_additions():
bt = BTree(20)
l = range(2000)
for i, item in enumerate(l):
bt.insert(item)
assert list(bt) == l[:i + 1]
def test_insert_regression():
bt = BTree.bulkload(range(2000), 50)
for i in xrange(100000):
bt.insert(random.randrange(2000))
def test_bulkloads():
bt = BTree.bulkload(range(2000), 20)
assert list(bt) == range(2000)
