pyhrf.tools.backports.
OrderedDict
(*args, **kwds)¶Bases: dict
Dictionary that remembers insertion order
clear
() → None. Remove all items from od.¶copy
() → a shallow copy of od¶fromkeys
(S[, v]) → New ordered dictionary with keys from S¶and values equal to v (which defaults to None).
items
() → list of (key, value) pairs in od¶iteritems
()¶od.iteritems -> an iterator over the (key, value) items in od
iterkeys
() → an iterator over the keys in od¶itervalues
()¶od.itervalues -> an iterator over the values in od
keys
() → list of keys in 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
() → (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
(k[, d]) → od.get(k,d), also set od[k]=d if k not in 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
() → list of values in od¶viewitems
() → a set-like object providing a view on od's items¶viewkeys
() → a set-like object providing a view on od's keys¶viewvalues
() → an object providing a view on od's values¶