def test_delitem(): random.seed(0) slt = SortedKeyList(range(100), key=negate) slt._reset(17) while len(slt) > 0: del slt[random.randrange(len(slt))] slt._check()
def test_key(): slt = SortedKeyList(range(10000), key=lambda val: val % 10) slt._check() values = sorted(range(10000), key=lambda val: (val % 10, val)) assert slt == values assert all(val in slt for val in range(10000))
def test_bisect_right(): slt = SortedKeyList(key=modulo) assert slt.bisect_right(10) == 0 slt = SortedKeyList(range(100), key=modulo) slt._reset(17) slt.update(range(100)) slt._check() assert slt.bisect_right(10) == 20 assert slt.bisect_right(0) == 20
def test_bisect(): slt = SortedKeyList(key=negate) assert slt.bisect(10) == 0 slt = SortedKeyList(range(100), key=negate) slt._reset(17) slt.update(range(100)) slt._check() assert slt.bisect(10) == 180 assert slt.bisect(0) == 200
def test_delete(): slt = SortedKeyList(range(20), key=modulo) slt._reset(4) slt._check() for val in range(20): slt.remove(val) slt._check() assert len(slt) == 0 assert slt._maxes == [] assert slt._lists == []
def test_update(): slt = SortedKeyList(key=modulo) slt.update(range(1000)) assert all(tup[0] == tup[1] for tup in zip(slt, sorted(range(1000), key=modulo))) assert len(slt) == 1000 slt._check() slt.update(range(10000)) assert len(slt) == 11000 slt._check()
def test_pop(): slt = SortedKeyList(range(10), key=modulo) slt._reset(4) slt._check() assert slt.pop() == 9 slt._check() assert slt.pop(0) == 0 slt._check() assert slt.pop(-2) == 7 slt._check() assert slt.pop(4) == 5 slt._check()
def test_pop(): slt = SortedKeyList(range(10), key=negate) slt._reset(4) slt._check() assert slt.pop() == 0 slt._check() assert slt.pop(0) == 9 slt._check() assert slt.pop(-2) == 2 slt._check() assert slt.pop(4) == 4 slt._check()
def test_count(): slt = SortedKeyList(key=negate) slt._reset(7) assert slt.count(0) == 0 for iii in range(100): for jjj in range(iii): slt.add(iii) slt._check() for iii in range(100): assert slt.count(iii) == iii
def test_contains(): slt = SortedKeyList(key=negate) assert 0 not in slt slt.update(range(10000)) for val in range(10000): assert val in slt assert 10000 not in slt assert -1 not in slt slt._check()
def test_stress(repeat=1000): slt = SortedKeyList((random.random() for rpt in range(1000))) for rpt in range(repeat): action = random.choice(actions) action(slt) slt._check() while len(slt) > 2000: # Shorten the sortedlist. This maintains the "jaggedness" # of the sublists which helps coverage. pos = random.randrange(len(slt._maxes)) del slt._maxes[pos] del slt._keys[pos] del slt._lists[pos] slt._len = sum(len(sublist) for sublist in slt._lists) slt._index = [] slt._check() slt._check() stress_update(slt) while len(slt) > 0: pos = random.randrange(len(slt)) del slt[pos] slt._check()
def test_delitem(): random.seed(0) slt = SortedKeyList(range(100), key=modulo) slt._reset(17) while len(slt) > 0: del slt[random.randrange(len(slt))] slt._check() slt = SortedKeyList(range(100), key=modulo) slt._reset(17) del slt[:] assert len(slt) == 0 slt._check()
def test_remove(): slt = SortedKeyList(key=modulo) assert slt.discard(0) == None assert len(slt) == 0 slt._check() slt = SortedKeyList([1, 2, 2, 2, 3, 3, 5], key=modulo) slt._reset(4) slt.remove(2) slt._check() assert all(tup[0] == tup[1] for tup in zip(slt, [1, 2, 2, 3, 3, 5]))
def test_count(): slt = SortedKeyList(key=modulo) slt._reset(7) assert slt.count(0) == 0 for iii in range(100): for jjj in range(iii): slt.add(iii) slt._check() for iii in range(100): assert slt.count(iii) == iii slt = SortedKeyList(range(8), key=modulo) assert slt.count(9) == 0
def test_getitem(): random.seed(0) slt = SortedKeyList(key=modulo) slt._reset(17) slt.add(5) slt._build_index() slt._check() slt.clear() lst = list(random.random() for rpt in range(100)) slt.update(lst) lst.sort(key=modulo) assert all(slt[idx] == lst[idx] for idx in range(100)) assert all(slt[idx - 99] == lst[idx - 99] for idx in range(100))
def test_contains(): slt = SortedKeyList(key=modulo) slt._reset(7) assert 0 not in slt slt.update(range(100)) for val in range(100): assert val in slt assert 100 not in slt slt._check() slt = SortedKeyList(range(100), key=modulo) slt._reset(4) assert all(val not in slt for val in range(100, 200))
def test_update_order_consistency(): def negate_el0(tup): return -tup[0] slt1 = SortedKeyList(key=negate_el0) slt2 = SortedKeyList(key=negate_el0) def add_from_iterable(slt, it): for item in it: slt.add(item) def add_from_all_iterables(slt, its): for it in its: add_from_iterable(slt, it) def update_from_all_iterables(slt, its): for it in its: slt.update(it) # the following iterators are set up (from large to small) such that they # attempt to force the two kinds of internal update logic (extending upon # the incoming iterable or appending to the existing elements by use of # `add()`) it1 = list(zip(repeat(0), range(5))) it2 = list(zip(repeat(0), range(4))) it3 = list(zip(repeat(0), range(3))) it4 = list(zip(repeat(0), range(2))) it5 = list(zip(repeat(0), range(1))) it12345 = [it1, it2, it3, it4, it5] add_from_all_iterables(slt1, it12345) update_from_all_iterables(slt2, it12345) slt1._check() slt2._check() assert all(tup[0] == tup[1] for tup in zip(slt1, slt2))
def test_discard(): slt = SortedKeyList(key=negate) assert slt.discard(0) == None assert len(slt) == 0 slt._check() slt = SortedKeyList([1, 2, 2, 2, 3, 3, 5], key=negate) slt._reset(4) slt.discard(6) slt._check() slt.discard(4) slt._check() slt.discard(2) slt._check() assert all(tup[0] == tup[1] for tup in zip(slt, reversed([1, 2, 2, 3, 3, 5])))
def test_add(): random.seed(0) slt = SortedKeyList(key=modulo) for val in range(1000): slt.add(val) slt._check() slt = SortedKeyList(key=modulo) for val in range(1000, 0, -1): slt.add(val) slt._check() slt = SortedKeyList(key=modulo) for val in range(1000): slt.add(random.random()) slt._check()
def test_init(): slt = SortedKeyList(key=negate) slt._check() slt = SortedKeyList(key=negate) slt._reset(10000) assert slt._load == 10000 slt._check() slt = SortedKeyList(range(10000), key=negate) assert all(tup[0] == tup[1] for tup in zip(slt, reversed(range(10000)))) slt.clear() assert slt._len == 0 assert slt._maxes == [] assert slt._lists == [] slt._check()
def test_update(): slt = SortedKeyList(key=negate) slt.update(range(1000)) assert len(slt) == 1000 slt._check() slt.update(range(100)) assert len(slt) == 1100 slt._check() slt.update(range(10000)) assert len(slt) == 11100 slt._check() values = sorted((val for val in chain(range(100), range(1000), range(10000))), key=negate) assert all(tup[0] == tup[1] for tup in zip(slt, values))
def test_update(): slt = SortedKeyList(key=negate) slt.update(range(1000)) assert len(slt) == 1000 slt._check() slt.update(range(100)) assert len(slt) == 1100 slt._check() slt.update(range(10000)) assert len(slt) == 11100 slt._check() values = sorted( (val for val in chain(range(100), range(1000), range(10000))), key=negate) assert all(tup[0] == tup[1] for tup in zip(slt, values))
def test_init(): slt = SortedKeyList(key=modulo) assert slt.key == modulo slt._check() slt = SortedKeyList(key=modulo) slt._reset(10000) assert slt._load == 10000 slt._check() slt = SortedKeyList(range(10000), key=modulo) assert all(tup[0] == tup[1] for tup in zip(slt, sorted(range(10000), key=modulo))) slt.clear() assert slt._len == 0 assert slt._maxes == [] assert slt._lists == [] assert isinstance(slt, SortedList) assert isinstance(slt, SortedKeyList) slt._check()
def test_check(): slt = SortedKeyList(range(10), key=modulo) slt._reset(4) slt._len = 5 with pytest.raises(AssertionError): slt._check()
def test_identity(): slt = SortedKeyList(range(100)) slt._reset(7) slt._check()