def test_update(self):
data = [(random.randint(0, 1000), random.randint(-1000, 1000))
for _ in range(10000)]
d = dict()
m = TreeMap()
d.update(data)
m.update(data)
self.assertEqual(len(m), len(d))
self.assertEqual(list(m.items()), sorted(d.items()))
def test_init(self):
m = TreeMap({"c": 2, "a": 3, "b": 1})
self.assertEqual(list(m.items()), [("a", 3), ("b", 1), ("c", 2)])
self.assertEqual(len(m), 3)
m = TreeMap([("b", 1), ("a", 3), ("c", 2)])
self.assertEqual(list(m.items()), [("a", 3), ("b", 1), ("c", 2)])
self.assertEqual(len(m), 3)
m = TreeMap(c=2, a=3, b=1)
self.assertEqual(list(m.items()), [("a", 3), ("b", 1), ("c", 2)])
self.assertEqual(len(m), 3)
data = [(random.randint(0, 1000), random.randint(-1000, 1000))
for _ in range(10000)]
d = dict(data)
m = TreeMap(data)
self.assertEqual(list(m.items()), sorted(d.items()))
self.assertEqual(len(m), len(d))
def test_set(self):
d = dict()
m = TreeMap()
for _ in range(10000):
k = random.randint(1, 1000)
v = random.randint(1, 1000)
d[k] = v
m[k] = v
self.assertEqual(len(m), len(d))
self.assertEqual(m[k], d[k])
self.assertEqual(list(m.items()), sorted(d.items()))
def test_del(self):
data = [(n, n) for n in range(1000)]
d = dict(data)
m = TreeMap(data)
for n in range(0, 1000, 2):
del d[n]
del m[n]
self.assertEqual(len(m), len(d))
self.assertEqual(list(m.items()), sorted(d.items()))
with self.assertRaises(KeyError):
del m[10000]
def test_at(self):
m = TreeMap({n: n for n in range(100)})
items = list(m.items())
# test loc
for i, item in enumerate(items):
self.assertEqual(item, m.loc(i))
with self.assertRaises(IndexError):
m.loc(101)
# test at_most
self.assertEqual(m.at_most(23.3), 23)
# test at_least
self.assertEqual(m.at_least(23.3), 24)
def test_clear(self):
m = TreeMap((random.randint(0, 1000), random.randint(-1000, 1000))
for _ in range(10000))
m.clear()
self.assertEqual(list(m.items()), [])
self.assertEqual(len(m), 0)