def test_setitem(self):
s = test_items_seq()
tree = AnderssonTree(s)
self.check_aatree_properties(tree)
keys = [x[0] for x in s]
shuffle(keys)
for k in keys:
val = k * 10
tree[k] = val
self.assertEqual(tree.get(k), val)
def test_get(self):
s = test_items_seq()
tree = AnderssonTree(s)
self.check_aatree_properties(tree)
keys = [x[0] for x in s]
shuffle(keys)
for k in keys:
self.assertEqual(tree.get(k), k)
self.assertEqual(tree[k], k)
max_ = max(keys)
self.assertEqual(tree[max_ + 1], None)
