def test_cleanup_funcs(self):
log = []
def logging_cleanup(key, value):
log.append((key, value))
c = fifo_cache.FIFOCache(5, 4)
c.add(1, 2, cleanup=logging_cleanup)
c.add(2, 3, cleanup=logging_cleanup)
c.add(3, 4, cleanup=logging_cleanup)
c.add(4, 5, cleanup=None) # no cleanup for 4
c[5] = 6 # no cleanup for 5
self.assertEqual([], log)
# Adding another key should cleanup 1 & 2
c.add(6, 7, cleanup=logging_cleanup)
self.assertEqual([(1, 2), (2, 3)], log)
del log[:]
# replacing 3 should trigger a cleanup
c.add(3, 8, cleanup=logging_cleanup)
self.assertEqual([(3, 4)], log)
del log[:]
c[3] = 9
self.assertEqual([(3, 8)], log)
del log[:]
# Clearing everything should call all remaining cleanups
c.clear()
self.assertEqual([(6, 7)], log)
del log[:]
c.add(8, 9, cleanup=logging_cleanup)
# __delitem__ should also trigger a cleanup
del c[8]
self.assertEqual([(8, 9)], log)
def test_cleanup_at_deconstruct(self):
log = []
def logging_cleanup(key, value):
log.append((key, value))
c = fifo_cache.FIFOCache()
c.add(1, 2, cleanup=logging_cleanup)
del c
# As a matter of design, bzr does not (can not) count on anything
# being run from Python __del__ methods, because they may not run for
# a long time, and because in cPython merely having them defined
# interferes with garbage collection.
self.assertEqual([], log)
def test_clear(self):
c = fifo_cache.FIFOCache(5)
c[1] = 2
c[2] = 3
c[3] = 4
c[4] = 5
c[5] = 6
c.cleanup()
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
c.clear()
self.assertEqual([], c.keys())
self.assertEqual([], list(c._queue))
self.assertEqual({}, c)
def test_default_after_cleanup_count(self):
c = fifo_cache.FIFOCache(5)
self.assertEqual(4, c._after_cleanup_count)
c[1] = 2
c[2] = 3
c[3] = 4
c[4] = 5
c[5] = 6
# So far, everything fits
self.assertEqual([1, 2, 3, 4, 5], sorted(c.keys()))
c[6] = 7
# But adding one more should shrink down to after_cleanup_count
self.assertEqual([3, 4, 5, 6], sorted(c.keys()))
def test_setdefault(self):
c = fifo_cache.FIFOCache(5, 4)
c['one'] = 1
c['two'] = 2
c['three'] = 3
myobj = object()
self.assertIs(myobj, c.setdefault('four', myobj))
self.assertEqual({'one': 1, 'two': 2, 'three': 3, 'four': myobj}, c)
self.assertEqual(3, c.setdefault('three', myobj))
c.setdefault('five', myobj)
c.setdefault('six', myobj)
self.assertEqual({'three': 3, 'four': myobj, 'five': myobj,
'six': myobj}, c)
def test_missing(self):
c = fifo_cache.FIFOCache()
self.assertRaises(KeyError, c.__getitem__, 1)
self.assertFalse(1 in c)
self.assertEqual(0, len(c))
self.assertEqual(None, c.get(1))
self.assertEqual(None, c.get(1, None))
self.assertEqual([], c.keys())
self.assertEqual([], list(c.iterkeys()))
self.assertEqual([], c.items())
self.assertEqual([], list(c.iteritems()))
self.assertEqual([], c.values())
self.assertEqual([], list(c.itervalues()))
self.assertEqual({}, c)
def test_add_is_present(self):
c = fifo_cache.FIFOCache()
c[1] = 2
self.assertTrue(1 in c)
self.assertEqual(1, len(c))
self.assertEqual(2, c[1])
self.assertEqual(2, c.get(1))
self.assertEqual(2, c.get(1, None))
self.assertEqual([1], c.keys())
self.assertEqual([1], list(c.iterkeys()))
self.assertEqual([(1, 2)], c.items())
self.assertEqual([(1, 2)], list(c.iteritems()))
self.assertEqual([2], c.values())
self.assertEqual([2], list(c.itervalues()))
self.assertEqual({1: 2}, c)
def test_resize_smaller(self):
c = fifo_cache.FIFOCache()
c[1] = 2
c[2] = 3
c[3] = 4
c[4] = 5
c[5] = 6
# No cleanup, because it is the exact size
c.resize(5)
self.assertEqual({1: 2, 2: 3, 3: 4, 4: 5, 5: 6}, c)
self.assertEqual(5, c.cache_size())
# Adding one more will trigger a cleanup, though
c[6] = 7
self.assertEqual({3: 4, 4: 5, 5: 6, 6: 7}, c)
c.resize(3, 2)
self.assertEqual({5: 6, 6: 7}, c)
def test_add_maintains_fifo(self):
c = fifo_cache.FIFOCache(4, 4)
c[1] = 2
c[2] = 3
c[3] = 4
c[4] = 5
self.assertEqual([1, 2, 3, 4], sorted(c.keys()))
c[5] = 6
# This should pop out the oldest entry
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
# Replacing an item doesn't change the stored keys
c[2] = 7
self.assertEqual([2, 3, 4, 5], sorted(c.keys()))
# But it does change the position in the FIFO
c[6] = 7
self.assertEqual([2, 4, 5, 6], sorted(c.keys()))
self.assertEqual([4, 5, 2, 6], list(c._queue))
def test_update(self):
c = fifo_cache.FIFOCache(5, 4)
# We allow an iterable
c.update([(1, 2), (3, 4)])
self.assertEqual({1: 2, 3: 4}, c)
# Or kwarg form
c.update(foo=3, bar=4)
self.assertEqual({1: 2, 3: 4, 'foo': 3, 'bar': 4}, c)
# Even a dict (This triggers a cleanup)
c.update({'baz': 'biz', 'bing': 'bang'})
self.assertEqual({'foo': 3, 'bar': 4, 'baz': 'biz', 'bing': 'bang'}, c)
# We only allow 1 iterable, just like dict
self.assertRaises(TypeError, c.update, [(1, 2)], [(3, 4)])
# But you can mix and match. kwargs take precedence over iterable
c.update([('a', 'b'), ('d', 'e')], a='c', q='r')
self.assertEqual({'baz': 'biz', 'bing': 'bang',
'a': 'c', 'd': 'e', 'q': 'r'}, c)
def test_unpack_inventory_5a_cache_no_copy(self):
# Passing an entry_cache should get populated with the objects
# The returned objects should be exact if return_from_cache is
# True
entry_cache = fifo_cache.FIFOCache()
inv = bzrlib.xml5.serializer_v5.read_inventory_from_string(
_inventory_v5a,
revision_id='test-rev-id',
entry_cache=entry_cache,
return_from_cache=True)
for entry in inv.iter_just_entries():
key = (entry.file_id, entry.revision)
if entry.file_id is inv.root.file_id:
# The root id is inferred for xml v5
self.assertFalse(key in entry_cache)
else:
self.assertIs(entry, entry_cache[key])
def test_resize_larger(self):
c = fifo_cache.FIFOCache(5, 4)
c[1] = 2
c[2] = 3
c[3] = 4
c[4] = 5
c[5] = 6
# No cleanup, because it is the exact size
c.resize(10)
self.assertEqual({1: 2, 2: 3, 3: 4, 4: 5, 5: 6}, c)
self.assertEqual(10, c.cache_size())
c[6] = 7
c[7] = 8
c[8] = 9
c[9] = 10
c[10] = 11
self.assertEqual({1: 2, 2: 3, 3: 4, 4: 5, 5: 6, 6: 7, 7: 8, 8: 9,
9: 10, 10: 11}, c)
c[11] = 12
self.assertEqual({4: 5, 5: 6, 6: 7, 7: 8, 8: 9, 9: 10, 10: 11,
11: 12}, c)
def test_cache_size(self):
c = fifo_cache.FIFOCache()
self.assertEqual(100, c.cache_size())
c.resize(20, 5)
self.assertEqual(20, c.cache_size())
def test_popitem_not_implemeted(self):
c = fifo_cache.FIFOCache()
self.assertRaises(NotImplementedError, c.popitem)
def test_copy_not_implemented(self):
c = fifo_cache.FIFOCache()
self.assertRaises(NotImplementedError, c.copy)
