def __init__(self):
self._quips = OOBTree()
self._followed = OOBTree()
self._followed_tags = OOBTree()
# AppendStack defaults seem too low for search to make sense
self._recent = AppendStack(max_layers=20, max_length=500)
self._archive = Archive()
def test_addQuip_with_pruning(self):
from appendonly import AppendStack
cb = self._makeOne()
# replace the stack with one which overflows quickly.
cb._recent = AppendStack(1, 1)
name1 = cb.addQuip('TEXT1', 'USER1')
name2 = cb.addQuip('TEXT2', 'USER2')
name3 = cb.addQuip('TEXT3', 'USER3')
self.assertEqual(len(cb), 3)
self.assertEqual(sorted(cb), sorted([name3, name2, name1]))
# Overflowed twice
self.assertEqual(cb._archive._generation, 1)
def __init__(self):
self._stack = AppendStack(APPENDSTACK_MAX_LAYERS,
APPENDSTACK_MAX_LENGTH)
def __init__(self):
self._stack = AppendStack()
