class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: od.__setitem__(i, y) <==> od[i]=y
docstr_tok: ["od.__setitem__","(","i",",","y",")","<","==",">","od","[","i","]","=y"]
code: def __setitem__(
      self,
      key,
      value,
      dict_setitem=dict.__setitem__,
      proxy=_proxy,
      Link=_Link,
  ):
      "od.__setitem__(i, y) <==> od[i]=y"
      # Setting a new item creates a new link at the end of the linked list,
      # and the inherited dictionary is updated with the new key/value pair.
      if key not in self:
          self.__map[key] = link = Link()
          root = self.__root
          last = root.prev
          link.prev, link.next, link.key = last, root, key
          last.next = link
          root.prev = proxy(link)
      dict_setitem(self, key, value)
  
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 2 for calling the OrderedDict obj's underlying member method code with example usage: obj.__setitem__(key, value, dict_setitem, proxy, Link) without return types