1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
import gc
from rpython.rlib.rweaklist import RWeakListMixin, INITIAL_SIZE
class A(object):
pass
def test_simple():
a1 = A(); a2 = A()
wlist = RWeakListMixin(); wlist.initialize()
i = wlist.add_handle(a1)
assert i == INITIAL_SIZE - 1
i = wlist.reserve_next_handle_index()
assert i == INITIAL_SIZE - 2
wlist.store_handle(i, a2)
assert wlist.fetch_handle(INITIAL_SIZE - 1) is a1
assert wlist.fetch_handle(INITIAL_SIZE - 2) is a2
#
del a2
for i in range(5):
gc.collect()
if wlist.fetch_handle(INITIAL_SIZE - 2) is None:
break
else:
raise AssertionError("second handle() did not disappear")
assert wlist.fetch_handle(INITIAL_SIZE - 1) is a1
def test_reuse():
alist = [A() for i in range(200)]
wlist = RWeakListMixin(); wlist.initialize()
mapping = []
for i in range(200):
j = wlist.reserve_next_handle_index()
mapping.append(j)
wlist.store_handle(j, alist[i])
#
del alist[1::2]
del alist[1::2]
del alist[1::2]
del alist[1::2]
del alist[1::2]
for i in range(5):
gc.collect()
#
for i, j in enumerate(mapping):
a = wlist.fetch_handle(j)
if i % 32 == 0:
assert a is alist[i // 32]
else:
assert a is None
#
maximum = -1
for i in range(200):
j = wlist.reserve_next_handle_index()
assert wlist.fetch_handle(j) is None
maximum = max(maximum, j)
wlist.store_handle(j, A())
assert maximum < 256
|
