def test_successor():
d = OrderedTreeDict()
d.put(0, 0)
d.put(-1, -1)
d.put(1, 1)
assert d.successor(-1) == (0, 0)
assert d.successor(0) == (1, 1)
def test_sorted():
"""A test to ensure the tree maintains sorted order."""
keys = list(set([randint(0, 2 ^ 64) for i in range(0, 128)]))
items = [(key, None) for key in keys]
d = OrderedTreeDict(items)
assert len(keys) == len(d)
assert len(keys) == len(list(d))
assert list(sorted(keys)) == list(d.keys())
def test_insertion_left_and_right():
d = OrderedTreeDict()
d.put(0, 0)
d.put(-1, -1)
d.put(1, 1)
assert len(d) == 3, "Length should reflect number of items inserted,"
assert d.depth() <= 2, "Not balanced."
def test_predecessor():
d = OrderedTreeDict()
d.put(0, 0)
d.put(-1, -1)
d.put(1, 1)
assert d.predecessor(0) == (-1, -1)
assert d.predecessor(1) == (0, 0)
def test_fuzz_deletions():
"""A test that inserts random keys into the tree and checks that they were all inserted."""
key_range = 2**64
value_range = 1024
key_set = set()
d = OrderedTreeDict()
for value in range(0, value_range):
key = randint(0, key_range)
d.put(key, value)
key_set.add(key)
sorted_keys = list(sorted(key_set))
sorted_keys_slice = sorted_keys[0:len(sorted_keys) // 2]
for key in sorted_keys_slice:
d.delete(key)
assert len(d) > 0
assert key not in d
assert d.depth() <= int(2 * math.log(
len(d), 2)), "Should stay as balanced as a red black tree. "
keys = list(d.keys())
assert len(
keys) == len(sorted_keys_slice
), "Length should reflect number of items inserted."
assert len(keys) == len(
list(keys)), "Iteration should find all items in tree."
def test_copy():
d = OrderedTreeDict.fromkeys(['a', 'b'], 1)
e = d.copy()
assert d is not e
assert 'a' in e
assert 'b' in e
assert e['a'] == 1
assert e['b'] == 1
def test_fromkeys():
d = OrderedTreeDict.fromkeys(['a', 'b', 'c'], 1)
assert 'a' in d
assert 'b' in d
assert 'c' in d
assert d['a'] == 1
assert d['b'] == 1
assert d['c'] == 1
def test_magic_methods():
d = OrderedTreeDict()
d['a'] = 'a'
assert 'a' in d
assert d['a'] == 'a'
del d['a']
assert 'a' not in d
try:
d['a']
except KeyError:
pass
else:
assert False
def test_fuzz_insertions():
"""A test that inserts random keys into the tree and checks that they were all inserted."""
key_range = 2**64
value_range = 1024
key_set = set()
d = OrderedTreeDict()
for value in range(0, value_range):
key = randint(0, key_range)
d.put(key, value)
key_set.add(key)
keys = list(d.keys())
assert len(keys) == len(
key_set), "Length should reflect number of items inserted."
assert len(keys) == len(
list(keys)), "Iteration should find all items in tree."
assert d.depth() <= math.ceil(1.44 * math.log2(len(d))), "Should stay as balanced as an avl tree as long as " \
"there are only insertions. "
def test_rank_negative():
"""A test to check that rank finds index of a key in sorted order."""
keys = list(range(-100, 100))
d = OrderedTreeDict((key, None) for key in keys)
assert all(list(keys[d.rank(k)] == k for k in keys))
def test_rank_simple():
d = OrderedTreeDict([(0, 0), (1, 1), (2, 2)])
assert len(d) == 3
assert (d.rank(0) == 0)
assert (d.rank(1) == 1)
assert (d.rank(2) == 2)
def test_select_simple():
d = OrderedTreeDict([(0, 0), (1, 1), (2, 2)])
assert len(d) == 3
assert (d.select(0) == (0, 0))
assert (d.select(1) == (1, 1))
assert (d.select(2) == (2, 2))
def test_select():
"""A test to check that select finds the nth item in sorted order."""
keys = list(range(100))
d = OrderedTreeDict((key, None) for key in keys)
assert all(d.select(k)[0] == k for k in keys)
def test_clear():
d = OrderedTreeDict.fromkeys(['a', 'b'], 1)
d.clear()
assert len(d) == 0
assert d.get('b') is None
def test_pop_item():
d = OrderedTreeDict({'a': 'a'}.items())
assert d.popitem() == ('a', 'a')
assert 'a' not in d
def test_deletion():
d = OrderedTreeDict()
d.put(0, 0)
d.put(-1, -1)
d.put(1, 1)
assert len(d) == 3, "Length should reflect number of items inserted,"
assert 0 in d
d.delete(0)
assert len(d) == 2
assert 0 not in d
d.delete(1)
assert len(d) == 1
assert 1 not in d