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], list(c))
37
self.assertEqual({1}, c.keys())
38
self.assertEqual([(1, 2)], sorted(c.items()))
39
self.assertEqual([2], sorted(c.values()))
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()))
40
42
self.assertEqual({1: 2}, c)
42
44
def test_cache_size(self):
52
54
self.assertEqual(0, len(c))
53
55
self.assertEqual(None, c.get(1))
54
56
self.assertEqual(None, c.get(1, None))
55
self.assertEqual([], list(c))
56
self.assertEqual(set(), c.keys())
57
self.assertEqual([], list(c.items()))
58
self.assertEqual([], list(c.values()))
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()))
59
63
self.assertEqual({}, c)
61
65
def test_add_maintains_fifo(self):
67
self.assertEqual({1, 2, 3, 4}, c.keys())
71
self.assertEqual([1, 2, 3, 4], sorted(c.keys()))
69
73
# This should pop out the oldest entry
70
self.assertEqual({2, 3, 4, 5}, c.keys())
74
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
71
75
# Replacing an item doesn't change the stored keys
73
self.assertEqual({2, 3, 4, 5}, c.keys())
77
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
74
78
# But it does change the position in the FIFO
76
self.assertEqual({2, 4, 5, 6}, c.keys())
80
self.assertEqual([2, 4, 5, 6], sorted(c.keys()))
77
81
self.assertEqual([4, 5, 2, 6], list(c._queue))
79
83
def test_default_after_cleanup_count(self):
87
91
# So far, everything fits
88
self.assertEqual({1, 2, 3, 4, 5}, c.keys())
92
self.assertEqual([1, 2, 3, 4, 5], sorted(c.keys()))
90
94
# But adding one more should shrink down to after_cleanup_count
91
self.assertEqual({3, 4, 5, 6}, c.keys())
95
self.assertEqual([3, 4, 5, 6], sorted(c.keys()))
93
97
def test_clear(self):
94
98
c = fifo_cache.FIFOCache(5)
101
self.assertEqual({2, 3, 4, 5}, c.keys())
105
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
103
self.assertEqual(set(), c.keys())
107
self.assertEqual([], c.keys())
104
108
self.assertEqual([], list(c._queue))
105
109
self.assertEqual({}, c)
190
194
def test_cleanup_funcs(self):
193
196
def logging_cleanup(key, value):
194
197
log.append((key, value))
195
198
c = fifo_cache.FIFOCache(5, 4)
196
199
c.add(1, 2, cleanup=logging_cleanup)
197
200
c.add(2, 3, cleanup=logging_cleanup)
198
201
c.add(3, 4, cleanup=logging_cleanup)
199
c.add(4, 5, cleanup=None) # no cleanup for 4
200
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
201
204
self.assertEqual([], log)
202
205
# Adding another key should cleanup 1 & 2
203
206
c.add(6, 7, cleanup=logging_cleanup)
244
246
self.assertEqual('2', c[1])
245
247
self.assertEqual('2', c.get(1))
246
248
self.assertEqual('2', c.get(1, None))
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()))
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()))
251
255
self.assertEqual({1: '2'}, c)
252
self.assertEqual(1024 * 1024, c.cache_size())
256
self.assertEqual(1024*1024, c.cache_size())
254
258
def test_missing(self):
255
259
c = fifo_cache.FIFOSizeCache()
258
262
self.assertEqual(0, len(c))
259
263
self.assertEqual(None, c.get(1))
260
264
self.assertEqual(None, c.get(1, None))
261
self.assertEqual([], list(c))
262
self.assertEqual(set(), c.keys())
263
self.assertEqual([], list(c.items()))
264
self.assertEqual([], list(c.values()))
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()))
265
271
self.assertEqual({}, c)
267
273
def test_add_maintains_fifo(self):
272
278
self.assertEqual({1: 'ab', 2: 'cde', 3: 'fghi'}, c)
273
c[4] = 'jkl' # Collapse
279
c[4] = 'jkl' # Collapse
274
280
self.assertEqual({3: 'fghi', 4: 'jkl'}, c)
275
281
# Replacing an item will bump it to the end of the queue
281
287
def test_adding_large_key(self):
282
288
c = fifo_cache.FIFOSizeCache(10, 8)
283
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
284
290
self.assertEqual({}, c)
286
292
self.assertEqual({1: 'abcdefg'}, c)