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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
########################################################################
# File name: test_cache.py
# This file is part of: aioxmpp
#
# LICENSE
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as
# published by the Free Software Foundation, either version 3 of the
# License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this program. If not, see
# <http://www.gnu.org/licenses/>.
#
########################################################################
import collections.abc
import unittest
import aioxmpp.cache as cache
class TestLRUDict(unittest.TestCase):
def setUp(self):
self.d = cache.LRUDict()
def tearDown(self):
del self.d
def test_is_mutable_mapping(self):
self.assertIsInstance(
self.d,
collections.abc.MutableMapping,
)
def test_default_maxsize(self):
self.assertEqual(
self.d.maxsize,
1,
)
def test_store_and_retrieve(self):
key = object()
value = object()
self.d[key] = value
result = self.d[key]
self.assertEqual(result, value)
def test_raise_KeyError_for_unknown_key(self):
key = object()
with self.assertRaises(KeyError):
self.d[key]
self.assertTrue(self.d._test_consistency())
value = object()
self.d[key] = value
self.assertTrue(self.d._test_consistency())
with self.assertRaises(KeyError):
self.d[object()]
self.assertTrue(self.d._test_consistency())
def test_store_multiple(self):
size = 3
self.d.maxsize = size
keys = [object() for i in range(size)]
values = [object() for i in range(size)]
for i, (k, v) in enumerate(zip(keys, values)):
self.assertEqual(
len(self.d),
i,
)
self.d[k] = v
self.assertEqual(
self.d[k],
v,
)
self.assertEqual(
len(self.d),
i + 1,
)
self.assertTrue(self.d._test_consistency())
for k, v in zip(keys, values):
self.assertEqual(
self.d[k],
v,
)
self.assertTrue(self.d._test_consistency())
def test_iter_iterates_over_keys(self):
size = 3
self.d.maxsize = size
keys = [object() for i in range(size)]
values = [object() for i in range(size)]
for k, v in zip(keys, values):
self.d[k] = v
self.assertEqual(
self.d[k],
v,
)
self.assertTrue(self.d._test_consistency())
self.assertSetEqual(
set(self.d),
set(keys),
)
def test_maxsize_can_be_written(self):
self.d.maxsize = 4
self.assertEqual(self.d.maxsize, 4)
def test_maxsize_rejects_non_positive_integers(self):
with self.assertRaisesRegex(ValueError, "must be positive"):
self.d.maxsize = 0
with self.assertRaisesRegex(ValueError, "must be positive"):
self.d.maxsize = -1
def test_maxsize_accepts_None(self):
self.d.maxsize = None
self.assertIsNone(self.d.maxsize)
def test_fetch_does_not_create_ghost_keys(self):
with self.assertRaises(KeyError):
self.d[object()]
self.assertTrue(self.d._test_consistency())
self.d[object()] = object()
self.assertTrue(self.d._test_consistency())
# "ghost key": if one part of the data structure (the "last used") is
# updated before the check for existence of the key is made
# in this case, the second store would raise because there is a key
# in the "last used" data structure which isn’t in the main data
# structure
self.d[object()] = object()
self.assertTrue(self.d._test_consistency())
def test_lru_purge_when_decreasing_maxsize(self):
size = 4
self.d.maxsize = size
keys = [object() for i in range(size)]
values = [object() for i in range(size)]
for k, v in zip(keys, values):
self.d[k] = v
self.assertEqual(
self.d[k],
v,
)
self.assertTrue(self.d._test_consistency())
# keys have now been fetached in insertion order
# reducing maxsize by one should remove first key, but not the others
self.d.maxsize = size - 1
self.assertTrue(self.d._test_consistency())
with self.assertRaises(KeyError):
self.d[keys[0]]
self.assertTrue(self.d._test_consistency())
# we now fetch the second key, so that the third is purged instead of
# the second when we reduce maxsize again
self.d[keys[1]]
self.assertTrue(self.d._test_consistency())
self.d.maxsize = size - 2
with self.assertRaises(KeyError):
self.d[keys[2]]
self.assertTrue(self.d._test_consistency())
self.assertEqual(
self.d[keys[1]],
values[1]
)
self.assertTrue(self.d._test_consistency())
# reducing the size to 1 should leave only the third key
self.d.maxsize = 1
self.assertEqual(
self.d[keys[1]],
values[1]
)
self.assertTrue(self.d._test_consistency())
for i in [0, 2, 3]:
with self.assertRaises(KeyError):
self.d[keys[i]]
self.assertTrue(self.d._test_consistency())
def test_lru_purge_when_storing(self):
size = 4
self.d.maxsize = size
keys = [object() for i in range(size + 2)]
values = [object() for i in range(size + 2)]
for k, v in zip(keys[:size], values[:size]):
self.d[k] = v
self.assertEqual(
self.d[k],
v,
)
self.assertTrue(self.d._test_consistency())
# keys have now been fetached in insertion order
# reducing maxsize by one should remove first key, but not the others
self.d[keys[size]] = values[size]
self.assertTrue(self.d._test_consistency())
with self.assertRaises(KeyError):
self.d[keys[0]]
self.assertTrue(self.d._test_consistency())
# we now fetch the second key, so that the third is purged instead of
# the second when we reduce maxsize again
self.d[keys[2]]
self.assertTrue(self.d._test_consistency())
self.d[keys[size + 1]] = values[size + 1]
self.assertTrue(self.d._test_consistency())
with self.assertRaises(KeyError):
self.d[keys[1]]
self.assertTrue(self.d._test_consistency())
self.assertEqual(
self.d[keys[2]],
values[2]
)
self.assertTrue(self.d._test_consistency())
for i in [0, 1]:
with self.assertRaises(KeyError, msg=i):
self.d[keys[i]]
self.assertTrue(self.d._test_consistency())
for i in [2, 3, 4, 5]:
self.assertEqual(
self.d[keys[i]],
values[i],
)
self.assertTrue(self.d._test_consistency())
def test_expire_removes_from_cache(self):
key = object()
value = object()
self.d[key] = value
self.assertTrue(self.d._test_consistency())
del self.d[key]
self.assertTrue(self.d._test_consistency())
with self.assertRaises(KeyError):
self.d[key]
self.assertTrue(self.d._test_consistency())
self.d[object()] = value
self.assertTrue(self.d._test_consistency())
self.d[object()] = value
self.assertTrue(self.d._test_consistency())
def test_clear_removes_items(self):
size = 3
self.d.maxsize = size
keys = [object() for i in range(size)]
values = [object() for i in range(size)]
for i, (k, v) in enumerate(zip(keys, values)):
self.d[k] = v
self.assertTrue(self.d._test_consistency())
self.d.clear()
self.assertTrue(self.d._test_consistency())
self.assertEqual(len(self.d), 0)
for k in keys:
with self.assertRaises(KeyError):
self.d[k]
self.assertTrue(self.d._test_consistency())
|
