class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: Initialize an ordered dictionary.  The signature is the same as
  regular dictionaries, but keyword arguments are not recommended because
  their insertion order is arbitrary.
docstr_tok: ["Initialize","an","ordered","dictionary",".","The","signature","is","the","same","as","regular","dictionaries",",","but","keyword","arguments","are","not","recommended","because","their","insertion","order","is","arbitrary","."]
code: def __init__(self, *args, **kwds):
      """Initialize an ordered dictionary.  The signature is the same as
      regular dictionaries, but keyword arguments are not recommended because
      their insertion order is arbitrary.
  
      """
      if len(args) > 1:
          raise TypeError(
              "expected at most 1 arguments, got %d" % len(args)
          )
      try:
          self.__root
      except AttributeError:
          self.__hardroot = _Link()
          self.__root = root = _proxy(self.__hardroot)
          root.prev = root.next = root
          self.__map = {}
      self.__update(*args, **kwds)
  
imports: from _functools import partial, reduce
  from collections import MutableMapping, namedtuple
  from .reprlib32 import recursive_repr
  from weakref import proxy
  import sys
label_desc: Use image node_id 1 to create a new OrderedDict object from inherited base classes: dict with example: obj = OrderedDict()