def test_appendExtendQueueStart3(self):
q = Queue()
q.append('zero')
q.extend(['one', 'two'])
self.assertEqual([], list(q.iterItems(start=3)))
# iterItems is idempotent
self.assertEqual([], list(q.iterItems(start=3)))
def test_ackNumberTooHigh1(self):
q = Queue()
q.append('zero')
badSACK = q.handleSACK(SACK(1, ()))
self.assertEqual(True, badSACK)
# Items were still removed, despite it being a bad SACK
self.assertEqual([], list(q.iterItems()))
def test_appendExtendQueue(self):
q = Queue()
q.append('zero')
q.extend(['one', 'two'])
self.assertEqual([(0, 'zero'), (1, 'one'), (2, 'two')], list(q.iterItems(start=0)))
# iterItems is idempotent
self.assertEqual([(0, 'zero'), (1, 'one'), (2, 'two')], list(q.iterItems(start=0)))
def test_handleSACKOnlyAckNumber(self):
q = Queue()
q.append('zero')
q.extend(['one', 'two'])
self.assertEqual(False, q.handleSACK(SACK(0, ())))
self.assertEqual([(1, 'one'), (2, 'two')], list(q.iterItems(start=1)))
# Removing again is idempotent
self.assertEqual(False, q.handleSACK(SACK(0, ())))
self.assertEqual([(1, 'one'), (2, 'two')], list(q.iterItems(start=1)))
def test_iterItemsNoStartNumber(self):
"""
A L{start} for iterItems is not required.
"""
q = Queue()
q.append('zero')
q.extend(['one', 'two'])
self.assertEqual([(0, 'zero'), (1, 'one'), (2, 'two')], list(q.iterItems()))
self.assertEqual(False, q.handleSACK(SACK(-1, ())))
self.assertEqual([(0, 'zero'), (1, 'one'), (2, 'two')], list(q.iterItems()))
self.assertEqual(False, q.handleSACK(SACK(0, ())))
self.assertEqual([(1, 'one'), (2, 'two')], list(q.iterItems()))
def test_getMaxConsumption(self):
"""
The size of the Queue increases when we extend it or append to it,
and decreases when we give it an ackNumber or sackNum that
causes it to remove items.
"""
q = Queue()
self.assertEqual(0, q.getMaxConsumption())
q.extend(['a', 'b'])
self.assertEqual(totalSizeOf('a') * 2, q.getMaxConsumption())
q.handleSACK(SACK(0, ()))
self.assertEqual(totalSizeOf('a'), q.getMaxConsumption())
# strange-looking SACK, but it does exercise the code we want to exercise
q.handleSACK(SACK(0, (1,)))
self.assertEqual(0, q.getMaxConsumption())
q.handleSACK(SACK(1, ()))
self.assertEqual(0, q.getMaxConsumption())
q.append('cc')
self.assertEqual(totalSizeOf('cc'), q.getMaxConsumption())
def test_handleSACK(self):
"""
handleSACK actually removes the selectively-acknowledged items from the queue
"""
q = Queue()
q.append('zero')
q.extend(['one', 'two', 'three'])
self.assertEqual([(0, 'zero'), (1, 'one'), (2, 'two'), (3, 'three')], list(q.iterItems()))
self.assertEqual(False, q.handleSACK(SACK(-1, (1,))))
self.assertEqual([(0, 'zero'), (2, 'two'), (3, 'three')], list(q.iterItems()))
self.assertEqual(False, q.handleSACK(SACK(0, (3,))))
self.assertEqual([(2, 'two')], list(q.iterItems()))
q.append('four')
self.assertEqual([(2, 'two'), (4, 'four')], list(q.iterItems()))
# although this is a very strange SACK because it should have
# been (4, ()), it is still legal
self.assertEqual(False, q.handleSACK(SACK(0, (2, 4))))
self.assertEqual([], list(q.iterItems()))
q.append('five')
self.assertEqual([(5, 'five')], list(q.iterItems()))
