def test_reasonable_speed(N=1000):
d = emptyset
for i in range(N):
d |= FSet([i])
checktree(d)
assert list(d) == range(N)
d = emptyset
for i in range(N - 1, -1, -1):
d |= FSet([i])
checktree(d)
assert list(d) == range(N)
d = emptyset
lst = range(N)
random.shuffle(lst)
for i in lst:
d |= FSet([i])
checktree(d)
assert list(d) == range(N)
def test_reasonable_speed(N=1000):
d = emptyset
for i in range(N):
d |= FSet([i])
checktree(d)
assert list(d) == range(N)
d = emptyset
for i in range(N-1, -1, -1):
d |= FSet([i])
checktree(d)
assert list(d) == range(N)
d = emptyset
lst = range(N)
random.shuffle(lst)
for i in lst:
d |= FSet([i])
checktree(d)
assert list(d) == range(N)
def test_empty():
assert FSet() is FSet([]) is emptyset
assert len(emptyset) == 0
assert list(emptyset) == []
checktree(emptyset)
def test_new():
s = FSet(range(6, 42) + range(13))
assert len(s) == 42
assert list(s) == range(42)
assert FSet(s) is s
checktree(s)
def test_iter():
s = FSet(range(42))
assert len(s) == 42
assert list(s) == range(42)
checktree(s)
def test_empty():
assert FSet() is FSet([]) is emptyset
assert len(emptyset) == 0
assert list(emptyset) == []
checktree(emptyset)
def test_new():
s = FSet(range(6, 42) + range(13))
assert len(s) == 42
assert list(s) == range(42)
assert FSet(s) is s
checktree(s)
def test_iter():
s = FSet(range(42))
assert len(s) == 42
assert list(s) == range(42)
checktree(s)
