38
33
self.assertEqual(2, c[1])
39
34
self.assertEqual(2, c.get(1))
40
35
self.assertEqual(2, c.get(1, None))
41
self.assertEqual([1], list(c))
42
self.assertEqual({1}, viewkeys(c))
43
self.assertEqual([(1, 2)], sorted(viewitems(c)))
44
self.assertEqual([2], sorted(viewvalues(c)))
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()))
45
42
self.assertEqual({1: 2}, c)
47
44
def test_cache_size(self):
57
54
self.assertEqual(0, len(c))
58
55
self.assertEqual(None, c.get(1))
59
56
self.assertEqual(None, c.get(1, None))
60
self.assertEqual([], list(c))
61
self.assertEqual(set(), viewkeys(c))
62
self.assertEqual([], list(viewitems(c)))
63
self.assertEqual([], list(viewvalues(c)))
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()))
64
63
self.assertEqual({}, c)
66
65
def test_add_maintains_fifo(self):
72
self.assertEqual({1, 2, 3, 4}, viewkeys(c))
71
self.assertEqual([1, 2, 3, 4], sorted(c.keys()))
74
73
# This should pop out the oldest entry
75
self.assertEqual({2, 3, 4, 5}, viewkeys(c))
74
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
76
75
# Replacing an item doesn't change the stored keys
78
self.assertEqual({2, 3, 4, 5}, viewkeys(c))
77
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
79
78
# But it does change the position in the FIFO
81
self.assertEqual({2, 4, 5, 6}, viewkeys(c))
80
self.assertEqual([2, 4, 5, 6], sorted(c.keys()))
82
81
self.assertEqual([4, 5, 2, 6], list(c._queue))
84
83
def test_default_after_cleanup_count(self):
92
91
# So far, everything fits
93
self.assertEqual({1, 2, 3, 4, 5}, viewkeys(c))
92
self.assertEqual([1, 2, 3, 4, 5], sorted(c.keys()))
95
94
# But adding one more should shrink down to after_cleanup_count
96
self.assertEqual({3, 4, 5, 6}, viewkeys(c))
95
self.assertEqual([3, 4, 5, 6], sorted(c.keys()))
98
97
def test_clear(self):
99
98
c = fifo_cache.FIFOCache(5)
106
self.assertEqual({2, 3, 4, 5}, viewkeys(c))
105
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
108
self.assertEqual(set(), viewkeys(c))
107
self.assertEqual([], c.keys())
109
108
self.assertEqual([], list(c._queue))
110
109
self.assertEqual({}, c)
195
194
def test_cleanup_funcs(self):
198
196
def logging_cleanup(key, value):
199
197
log.append((key, value))
200
198
c = fifo_cache.FIFOCache(5, 4)
201
199
c.add(1, 2, cleanup=logging_cleanup)
202
200
c.add(2, 3, cleanup=logging_cleanup)
203
201
c.add(3, 4, cleanup=logging_cleanup)
204
c.add(4, 5, cleanup=None) # no cleanup for 4
205
c[5] = 6 # no cleanup for 5
202
c.add(4, 5, cleanup=None) # no cleanup for 4
203
c[5] = 6 # no cleanup for 5
206
204
self.assertEqual([], log)
207
205
# Adding another key should cleanup 1 & 2
208
206
c.add(6, 7, cleanup=logging_cleanup)
227
225
def test_cleanup_at_deconstruct(self):
230
227
def logging_cleanup(key, value):
231
228
log.append((key, value))
232
229
c = fifo_cache.FIFOCache()
233
230
c.add(1, 2, cleanup=logging_cleanup)
235
# As a matter of design, bzr does not (can not) count on anything
236
# being run from Python __del__ methods, because they may not run for
237
# a long time, and because in cPython merely having them defined
238
# interferes with garbage collection.
239
self.assertEqual([], log)
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)
242
239
class TestFIFOSizeCache(tests.TestCase):
249
246
self.assertEqual('2', c[1])
250
247
self.assertEqual('2', c.get(1))
251
248
self.assertEqual('2', c.get(1, None))
252
self.assertEqual([1], list(c))
253
self.assertEqual({1}, viewkeys(c))
254
self.assertEqual([(1, '2')], sorted(viewitems(c)))
255
self.assertEqual(['2'], sorted(viewvalues(c)))
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()))
256
255
self.assertEqual({1: '2'}, c)
257
self.assertEqual(1024 * 1024, c.cache_size())
256
self.assertEqual(1024*1024, c.cache_size())
259
258
def test_missing(self):
260
259
c = fifo_cache.FIFOSizeCache()
263
262
self.assertEqual(0, len(c))
264
263
self.assertEqual(None, c.get(1))
265
264
self.assertEqual(None, c.get(1, None))
266
self.assertEqual([], list(c))
267
self.assertEqual(set(), viewkeys(c))
268
self.assertEqual([], list(viewitems(c)))
269
self.assertEqual([], list(viewvalues(c)))
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()))
270
271
self.assertEqual({}, c)
272
273
def test_add_maintains_fifo(self):
277
278
self.assertEqual({1: 'ab', 2: 'cde', 3: 'fghi'}, c)
278
c[4] = 'jkl' # Collapse
279
c[4] = 'jkl' # Collapse
279
280
self.assertEqual({3: 'fghi', 4: 'jkl'}, c)
280
281
# Replacing an item will bump it to the end of the queue
286
287
def test_adding_large_key(self):
287
288
c = fifo_cache.FIFOSizeCache(10, 8)
288
c[1] = 'abcdefgh' # Adding a large key won't get cached at all
289
c[1] = 'abcdefgh' # Adding a large key won't get cached at all
289
290
self.assertEqual({}, c)
291
292
self.assertEqual({1: 'abcdefg'}, c)