33
33
self.assertEqual(2, c[1])
34
34
self.assertEqual(2, c.get(1))
35
35
self.assertEqual(2, c.get(1, None))
36
self.assertEqual([1], c.keys())
37
self.assertEqual([1], list(c.iterkeys()))
38
self.assertEqual([(1, 2)], c.items())
39
self.assertEqual([(1, 2)], list(c.iteritems()))
40
self.assertEqual([2], c.values())
41
self.assertEqual([2], list(c.itervalues()))
36
self.assertEqual([1], list(c))
37
self.assertEqual({1}, c.keys())
38
self.assertEqual([(1, 2)], sorted(c.items()))
39
self.assertEqual([2], sorted(c.values()))
42
40
self.assertEqual({1: 2}, c)
44
42
def test_cache_size(self):
54
52
self.assertEqual(0, len(c))
55
53
self.assertEqual(None, c.get(1))
56
54
self.assertEqual(None, c.get(1, None))
57
self.assertEqual([], c.keys())
58
self.assertEqual([], list(c.iterkeys()))
59
self.assertEqual([], c.items())
60
self.assertEqual([], list(c.iteritems()))
61
self.assertEqual([], c.values())
62
self.assertEqual([], list(c.itervalues()))
55
self.assertEqual([], list(c))
56
self.assertEqual(set(), c.keys())
57
self.assertEqual([], list(c.items()))
58
self.assertEqual([], list(c.values()))
63
59
self.assertEqual({}, c)
65
61
def test_add_maintains_fifo(self):
71
self.assertEqual([1, 2, 3, 4], sorted(c.keys()))
67
self.assertEqual({1, 2, 3, 4}, c.keys())
73
69
# This should pop out the oldest entry
74
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
70
self.assertEqual({2, 3, 4, 5}, c.keys())
75
71
# Replacing an item doesn't change the stored keys
77
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
73
self.assertEqual({2, 3, 4, 5}, c.keys())
78
74
# But it does change the position in the FIFO
80
self.assertEqual([2, 4, 5, 6], sorted(c.keys()))
76
self.assertEqual({2, 4, 5, 6}, c.keys())
81
77
self.assertEqual([4, 5, 2, 6], list(c._queue))
83
79
def test_default_after_cleanup_count(self):
91
87
# So far, everything fits
92
self.assertEqual([1, 2, 3, 4, 5], sorted(c.keys()))
88
self.assertEqual({1, 2, 3, 4, 5}, c.keys())
94
90
# But adding one more should shrink down to after_cleanup_count
95
self.assertEqual([3, 4, 5, 6], sorted(c.keys()))
91
self.assertEqual({3, 4, 5, 6}, c.keys())
97
93
def test_clear(self):
98
94
c = fifo_cache.FIFOCache(5)
105
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
101
self.assertEqual({2, 3, 4, 5}, c.keys())
107
self.assertEqual([], c.keys())
103
self.assertEqual(set(), c.keys())
108
104
self.assertEqual([], list(c._queue))
109
105
self.assertEqual({}, c)
194
190
def test_cleanup_funcs(self):
196
193
def logging_cleanup(key, value):
197
194
log.append((key, value))
198
195
c = fifo_cache.FIFOCache(5, 4)
199
196
c.add(1, 2, cleanup=logging_cleanup)
200
197
c.add(2, 3, cleanup=logging_cleanup)
201
198
c.add(3, 4, cleanup=logging_cleanup)
202
c.add(4, 5, cleanup=None) # no cleanup for 4
203
c[5] = 6 # no cleanup for 5
199
c.add(4, 5, cleanup=None) # no cleanup for 4
200
c[5] = 6 # no cleanup for 5
204
201
self.assertEqual([], log)
205
202
# Adding another key should cleanup 1 & 2
206
203
c.add(6, 7, cleanup=logging_cleanup)
225
222
def test_cleanup_at_deconstruct(self):
227
225
def logging_cleanup(key, value):
228
226
log.append((key, value))
229
227
c = fifo_cache.FIFOCache()
230
228
c.add(1, 2, cleanup=logging_cleanup)
232
# TODO: We currently don't support calling the cleanup() funcs during
233
# __del__. We might want to consider implementing this.
234
self.expectFailure("we don't call cleanups during __del__",
235
self.assertEqual, [(1, 2)], log)
236
self.assertEqual([(1, 2)], log)
230
# As a matter of design, bzr does not (can not) count on anything
231
# being run from Python __del__ methods, because they may not run for
232
# a long time, and because in cPython merely having them defined
233
# interferes with garbage collection.
234
self.assertEqual([], log)
239
237
class TestFIFOSizeCache(tests.TestCase):
246
244
self.assertEqual('2', c[1])
247
245
self.assertEqual('2', c.get(1))
248
246
self.assertEqual('2', c.get(1, None))
249
self.assertEqual([1], c.keys())
250
self.assertEqual([1], list(c.iterkeys()))
251
self.assertEqual([(1, '2')], c.items())
252
self.assertEqual([(1, '2')], list(c.iteritems()))
253
self.assertEqual(['2'], c.values())
254
self.assertEqual(['2'], list(c.itervalues()))
247
self.assertEqual([1], list(c))
248
self.assertEqual({1}, c.keys())
249
self.assertEqual([(1, '2')], sorted(c.items()))
250
self.assertEqual(['2'], sorted(c.values()))
255
251
self.assertEqual({1: '2'}, c)
256
self.assertEqual(1024*1024, c.cache_size())
252
self.assertEqual(1024 * 1024, c.cache_size())
258
254
def test_missing(self):
259
255
c = fifo_cache.FIFOSizeCache()
262
258
self.assertEqual(0, len(c))
263
259
self.assertEqual(None, c.get(1))
264
260
self.assertEqual(None, c.get(1, None))
265
self.assertEqual([], c.keys())
266
self.assertEqual([], list(c.iterkeys()))
267
self.assertEqual([], c.items())
268
self.assertEqual([], list(c.iteritems()))
269
self.assertEqual([], c.values())
270
self.assertEqual([], list(c.itervalues()))
261
self.assertEqual([], list(c))
262
self.assertEqual(set(), c.keys())
263
self.assertEqual([], list(c.items()))
264
self.assertEqual([], list(c.values()))
271
265
self.assertEqual({}, c)
273
267
def test_add_maintains_fifo(self):
278
272
self.assertEqual({1: 'ab', 2: 'cde', 3: 'fghi'}, c)
279
c[4] = 'jkl' # Collapse
273
c[4] = 'jkl' # Collapse
280
274
self.assertEqual({3: 'fghi', 4: 'jkl'}, c)
281
275
# Replacing an item will bump it to the end of the queue
287
281
def test_adding_large_key(self):
288
282
c = fifo_cache.FIFOSizeCache(10, 8)
289
c[1] = 'abcdefgh' # Adding a large key won't get cached at all
283
c[1] = 'abcdefgh' # Adding a large key won't get cached at all
290
284
self.assertEqual({}, c)
292
286
self.assertEqual({1: 'abcdefg'}, c)