def test_ArrayQueue_front(self): queue = ArrayQueue() for i in range(100): queue.enqueue(i + 1) for i in range(100): assert_equal(i + 1, queue.front()) queue.dequeue()
def test_ArrayQueue_dequeue(self): queue = ArrayQueue() for i in range(100): queue.enqueue(i + 1) for i in range(100): assert_equal(i + 1, queue.dequeue()) assert_equal(99 - i, len(queue)) assert_equal(0, len(queue))
def test_ArrayQueue_multipleoperations(self): queue = ArrayQueue() for i in range(100): queue.enqueue(i + 100) for i in range(50): queue.dequeue() for i in range(100): queue.enqueue(i + 200) assert_equal(150, queue.front())
def test(): Q = ArrayQueue() Q.enqueue(5) Q.enqueue(3) print(Q.data) print(Q.dequeue()) print(Q.is_empty()) print(Q.first()) print(Q.data)
def breadthfirst(self): """ Breadth first iteration of all tree positions """ if not self.is_empty(): fringe = ArrayQueue() fringe.enqueue(self.root()) while not fringe.is_empty(): p = fringe.dequeue() yield p for c in self.children(p): fringe.enqueue(c)
from arrayqueue import ArrayQueue # sample usage if __name__ == '__main__': myq = ArrayQueue() print(myq.is_empty()) myq.enqueue('hello') myq.enqueue(7) print(myq.__len__()) print(myq.dequeue())
def test_ArrayQueue_enqueue(self): queue = ArrayQueue() for i in range(100): queue.enqueue(i + 1) assert_equal(1, queue.front()) assert_equal(100, len(queue))