Dictionary that remembers insertion order
Initialize self. See help(type(self)) for accurate signature.
Create a new ordered dictionary with keys from iterable and values set to value.
Return the value for key if key is in the dictionary, else default.
Move an existing element to the end (or beginning if last is false).
Remove and return a (key, value) pair from the dictionary.
Insert key with a value of default if key is not in the dictionary.
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]