| Home | Trees | Indices | Help |
|---|
|
|
A queue data structure built on top of a linked list
attributes:
items: A list that holds objects in the queue
type: LinkedList
methods:
__init__(self): constructor of the class
isEmpty(self): returns True if the queue instance is empty
push(self,item): inserts item to the queue
pop(self,item): removes first item in the queue if no item is
specified removes the given item if item is
specified
size(self): returns the size of the queue
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
x.__init__(...) initializes x; see help(type(x)) for signature
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Fri Mar 28 15:03:23 2014 | http://epydoc.sourceforge.net |