# Programmer: Sriram Pemmaraju
# Date: April 26th, 2012

# Implements a queue that allows access to a collection of items in a "first in first out" (FIFO)
# manner. A queue is implemented as a list with elements arriving at the front of the list into
# slot 0 and elements leaving from the list from the back.

class queue():
    
    # Constructs and empty queue
    def __init__(self):
        self.L = []

    def enqueue(self, item):
        self.L.insert(0, item)

    def dequeue(self):
        return self.L.pop()
 
    def __repr__(self):
        return str(self.L)