Library.Memory.collections.OrderedDict Class Reference

OrderedDict. More...

Inheritance diagram for Library.Memory.collections.OrderedDict:

Public Member Functions
def	__init__
def	__setitem__
def	__delitem__
def	__iter__
def	__reversed__
def	clear
def	keys
def	values
def	items
def	iterkeys
def	itervalues
def	iteritems
def	pop
def	setdefault
def	popitem
def	__repr__
def	__reduce__
def	copy
def	fromkeys
def	__eq__
def	__ne__
def	viewkeys
def	viewvalues
def	viewitems

Static Public Attributes
	update = MutableMapping.update

Detailed Description

OrderedDict.

Constructor & Destructor Documentation

def Library.Memory.collections.OrderedDict.__init__	(		self,
			args,
			kwds
	)

Initialize an ordered dictionary.  The signature is the same as
regular dictionaries, but keyword arguments are not recommended because
their insertion order is arbitrary.

Member Function Documentation

def Library.Memory.collections.OrderedDict.__eq__	(		self,
			other
	)

od.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.

def Library.Memory.collections.OrderedDict.fromkeys	(		cls,
			iterable,
			value = None
	)

OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
If not specified, the value defaults to None.

def Library.Memory.collections.OrderedDict.pop	(		self,
			key,
			default = __marker
	)

od.pop(k[,d]) -> v, remove specified key and return the corresponding
value.  If key is not found, d is returned if given, otherwise KeyError
is raised.

def Library.Memory.collections.OrderedDict.popitem	(		self,
			last = True
	)

od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.

---

The documentation for this class was generated from the following file:

• Library/Memory/collections.py