2014-01-12 18:23:36 +00:00
|
|
|
s = {1}
|
|
|
|
|
print(s.pop())
|
|
|
|
|
try:
|
|
|
|
|
print(s.pop(), "!!!")
|
|
|
|
|
except KeyError:
|
|
|
|
|
pass
|
|
|
|
|
else:
|
|
|
|
|
print("Failed to raise KeyError")
|
|
|
|
|
|
2016-12-20 03:25:06 +00:00
|
|
|
# this tests an optimisation in mp_set_remove_first
|
|
|
|
|
# N must not be equal to one of the values in hash_allocation_sizes
|
|
|
|
|
N = 11
|
|
|
|
|
s = set(range(N))
|
|
|
|
|
while s:
|
|
|
|
|
print(s.pop()) # last pop() should trigger the optimisation
|
|
|
|
|
for i in range(N):
|
|
|
|
|
s.add(i) # check that we can add the numbers back to the set
|
|
|
|
|
print(list(s))
|
