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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
from pylru import *
import random
# This tests PyLRU by fuzzing it with random operations, then checking the
# results against another, simpler, LRU cache implementation.
class simplelrucache:
def __init__(self, size):
# Initialize the cache as empty.
self.cache = []
self.size = size
def __contains__(self, key):
for x in self.cache:
if x[0] == key:
return True
return False
def __getitem__(self, key):
for i in range(len(self.cache)):
x = self.cache[i]
if x[0] == key:
del self.cache[i]
self.cache.append(x)
return x[1]
raise KeyError
def __setitem__(self, key, obj):
for i in range(len(self.cache)):
x = self.cache[i]
if x[0] == key:
x[1] = obj
del self.cache[i]
self.cache.append(x)
return
if len(self.cache) == self.size:
self.cache = self.cache[1:]
self.cache.append([key, obj])
def __delitem__(self, key):
for i in range(len(self.cache)):
if self.cache[i][0] == key:
del self.cache[i]
return
raise KeyError
def test(a, b, c, d, verify):
for i in range(1000):
x = random.randint(0, 512)
y = random.randint(0, 512)
a[x] = y
b[x] = y
verify(c, d)
for i in range(1000):
x = random.randint(0, 512)
if x in a:
assert x in b
z = a[x]
z += b[x]
else:
assert x not in b
verify(c, d)
for i in range(256):
x = random.randint(0, 512)
if x in a:
assert x in b
del a[x]
del b[x]
else:
assert x not in b
verify(c, d)
def testcache():
def verify(a, b):
q = []
z = a.head
for j in range(len(a.table)):
q.append([z.key, z.obj])
z = z.next
assert q == b.cache[::-1]
a = lrucache(128)
b = simplelrucache(128)
test(a, b, a, b, verify)
def wraptest():
def verify(p, q):
assert p == q
p = dict()
q = dict()
x = lruwrap(q, 128)
test(p, x, p, q, verify)
def wraptest2():
def verify(x, y):
pass
p = dict()
q = dict()
x = lruwrap(q, 128, True)
test(p, x, None, None, verify)
x.sync()
assert p == q
def wraptest3():
def verify(x, y):
pass
p = dict()
q = dict()
with lruwrap(q, 128, True) as x:
test(p, x, None, None, verify)
assert p == q
@lrudecorator(25)
def square(x):
return x*x
def testDecorator():
for i in range(1000):
x = random.randint(0, 1493)
assert square(x) == x*x
def testItems():
a = lrucache(128)
b = simplelrucache(128)
for i in range(1000):
x = random.randint(0, 512)
y = random.randint(0, 512)
a[x] = y
b[x] = y
for k, v in a.items():
assert k in a
assert a[k] == v
assert b[k] == v
# ensure the order returned in items() is correct.
items = a.items()
for k, v in reversed(items):
a[k] = v
# test the order is returned correctly.
assert items == a.items()
if __name__ == '__main__':
random.seed()
for i in range(20):
testcache()
wraptest()
wraptest2()
wraptest3()
testDecorator()
testItems()
|
