Dictionary that remembers insertion order

Public members¶

__repr__()[source]

Return repr(self).

__lt__(value, /)[source]

Return self<value.

__le__(value, /)[source]

Return self<=value.

__eq__(value, /)[source]

Return self==value.

__ne__(value, /)[source]

Return self!=value.

__gt__(value, /)[source]

Return self>value.

__ge__(value, /)[source]

Return self>=value.

__iter__()[source]

Implement iter(self).

__or__(value, /)[source]

Return self|value.

__ror__(value, /)[source]

Return value|self.

__ior__(value, /)[source]

Return self|=value.

__setitem__(key, value, /)[source]

Set self[key] to value.

__delitem__(key, /)[source]

Delete self[key].

fromkeys(value=None)[source]

Create a new ordered dictionary with keys from iterable and values set to value.

__reduce__()[source]

Return state information for pickling

setdefault(key, default=None)[source]

Insert key with a value of default if key is not in the dictionary.

pop(...) → v, remove specified key and return the corresponding value.[source]

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem(last=True)[source]

Remove and return a (key, value) pair from the dictionary.

keys() → a set-like object providing a view on D's keys[source]

values() → an object providing a view on D's values[source]

items() → a set-like object providing a view on D's items[source]

update([E, ]**F) → None.  Update D from dict/iterable E and F.[source]

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

clear() → None.  Remove all items from od.[source]

copy() → a shallow copy of od[source]

move_to_end(key, last=True)[source]

Move an existing element to the end (or beginning if last is false).