estimator.OrderedDict

class estimator.OrderedDict(*args, **kwds)[source]

Dictionary that remembers insertion order

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

__init__(*args, **kwds)[source]

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

Methods

__init__(*args, **kwds) Initialize an ordered dictionary.
clear(() -> None.  Remove all items from od.)
copy(() -> a shallow copy of od)
fromkeys((S[, ...) If not specified, the value defaults to None.
get((k[,d]) -> D[k] if k in D, ...)
has_key((k) -> True if D has a key k, else False)
items(() -> list of (key, value) pairs in od)
iteritems() od.iteritems -> an iterator over the (key, value) pairs 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, ...) value. If key is not found, d is returned if given, otherwise KeyError
popitem(() -> (k, v), ...) Pairs are returned in LIFO order if last is true or FIFO order if false.
setdefault((k[,d]) -> od.get(k,d), ...)
update(([E, ...) If E present and has a .keys() method, does: for k in E: D[k] = E[k]
values(() -> list of values in od)
viewitems(...)
viewkeys(...)
viewvalues(...)