def __init__(self, sourceCollection=None, capacity=None):
if capacity == None:
self._capacity = HashSet.DEFAULT_CAPACITY
else:
self._capacity = capacity
self._item = Array(self._capacity)
self._foundNode = self._priorNode = None
self._index = -1
AbstractCollection.__init__(self, sourceCollection)
def __init__(self,sourceColletion=None):
"""Will copy items to the collection
from souceCollection if it's present"""
AbstractCollection.__init__(self)
if sourceColletion:
#sourceCollection need to be a
#key/value list, e.g., sourceCollection
#=[('a',1)]
if type(sourceColletion)==tuple:
for key,value in [sourceColletion]:
self[key]=value
else:
sourcelist=[]
for i in sourceColletion:
sourcelist.append(i)
for key,value in sourcelist:
self[key]=value
def __init__(self, sourveCollection=None):
"""Sets the initial state of self, which includes the
contents of sourceCollection, if it's present."""
self._root = None
AbstractCollection.__init__(self, sourveCollection)
def __init__(self, DEFAULT_CAPCITY=10, sourceCollection=None):
self.DEFAULT_CAPCITY = DEFAULT_CAPCITY
self._items = Array(DEFAULT_CAPCITY)
AbstractCollection.__init__(self, sourceCollection)
def __init__(self, sourceCollection=None):
AbstractCollection.__init__(self, sourceCollection)
def __init__(self, sourceCollection=None):
self._front = self._rear = None
AbstractCollection.__init__(self, sourceCollection)
def __init__(self):
self._heap = Array(MinHeap.DEFAULT_CAPACITY)
AbstractCollection.__init__(self)
def __init__(self):
AbstractCollection.__init__(self)
def __init__(self): self._items = Array(self.DEFAULT_CAPACITY) self._front = self._rear = self._size = 0 AbstractCollection.__init__(self)
def __init__(self): self._front = None self._rear = None AbstractCollection.__init__(self)
def __init__(self, sourceCollection=None):
self._item = None
AbstractCollection.__init__(self, sourceCollection)
def __init__(self):
self._root = None
AbstractCollection.__init__(self)
