| |
- Method resolution order:
- OrderedDict
- __builtin__.dict
- __builtin__.object
Methods defined here:
- __delitem__(self, key, dict_delitem=<slot wrapper '__delitem__' of 'dict' objects>)
- od.__delitem__(y) <==> del od[y]
- __eq__(self, other)
- od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
- __init__(self, *args, **kwds)
- Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
- __iter__(self)
- od.__iter__() <==> iter(od)
- __ne__(self, other)
- __reduce__(self)
- Return state information for pickling
- __repr__(self, _repr_running={})
- od.__repr__() <==> repr(od)
- __reversed__(self)
- od.__reversed__() <==> reversed(od)
- __setitem__(self, key, value, dict_setitem=<slot wrapper '__setitem__' of 'dict' objects>)
- od.__setitem__(i, y) <==> od[i]=y
- clear(self)
- od.clear() -> None. Remove all items from od.
- copy(self)
- od.copy() -> a shallow copy of od
- items(self)
- od.items() -> list of (key, value) pairs in od
- iteritems(self)
- od.iteritems -> an iterator over the (key, value) items in od
- iterkeys(self)
- od.iterkeys() -> an iterator over the keys in od
- itervalues(self)
- od.itervalues -> an iterator over the values in od
- keys(self)
- od.keys() -> list of keys in od
- pop(self, key, default=<object object>)
- 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.
- 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.
- setdefault(self, key, default=None)
- od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od
- update(*args, **kwds)
- od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
- values(self)
- od.values() -> list of values in od
- viewitems(self)
- od.viewitems() -> a set-like object providing a view on od's items
- viewkeys(self)
- od.viewkeys() -> a set-like object providing a view on od's keys
- viewvalues(self)
- od.viewvalues() -> an object providing a view on od's values
Class methods defined here:
- fromkeys(cls, iterable, value=None) from __builtin__.type
- OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
Data descriptors defined here:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
Methods inherited from __builtin__.dict:
- __cmp__(...)
- x.__cmp__(y) <==> cmp(x,y)
- __contains__(...)
- D.__contains__(k) -> True if D has a key k, else False
- __ge__(...)
- x.__ge__(y) <==> x>=y
- __getattribute__(...)
- x.__getattribute__('name') <==> x.name
- __getitem__(...)
- x.__getitem__(y) <==> x[y]
- __gt__(...)
- x.__gt__(y) <==> x>y
- __le__(...)
- x.__le__(y) <==> x<=y
- __len__(...)
- x.__len__() <==> len(x)
- __lt__(...)
- x.__lt__(y) <==> x<y
- __sizeof__(...)
- D.__sizeof__() -> size of D in memory, in bytes
- get(...)
- D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.
- has_key(...)
- D.has_key(k) -> True if D has a key k, else False
Data and other attributes inherited from __builtin__.dict:
- __hash__ = None
- __new__ = <built-in method __new__ of type object>
- T.__new__(S, ...) -> a new object with type S, a subtype of T
|