class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: od.__delitem__(y) <==> del od[y]
docstr_tok: ["od.__delitem__","(","y",")","<","==",">","del","od","[","y","]"]
code: def __delitem__(self, key, dict_delitem=dict.__delitem__):
      "od.__delitem__(y) <==> del od[y]"
      # Deleting an existing item uses self.__map to find the link which gets
      # removed by updating the links in the predecessor and successor nodes.
      dict_delitem(self, key)
      link = self.__map.pop(key)
      link_prev = link.prev
      link_next = link.next
      link_prev.next = link_next
      link_next.prev = link_prev
  
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 3 for calling the OrderedDict obj's underlying member method code with example usage: obj.__delitem__(key, dict_delitem) without return types