def test_sort(self): data = list(range(2 * _getrecursionlimit())) rnddata = list(data) _shuffle(rnddata) self.assertNotEqual(data, rnddata) self.assertEqual(data, list(self.cls(rnddata))) self.assertEqual(list(reversed(data)), list(reversed(self.cls(rnddata))))
def test_height_after_ordered_set(self): data = list(range(2 * _getrecursionlimit())) size = len(data) t = self.cls() self.assertNode(t) for i in data: t._set(i, i) self.assertNode(t) self.assertLessEqual(t._root.height(), 2.0 * _log(size, 2))
def setUp(self): self.cls = sortedtable.SortedSet self.data = list(range(2 * _getrecursionlimit()))
def setUp(self): self.cls = sortedtable.SortedMapping self.data = [(i, chr(i)) for i in range(2 * _getrecursionlimit())]