(self, key, dict_delitem=dict.__delitem__)
od.__delitem__(y) <==> del od[y]
od.__delitem__(y) <==> del od[y]
od . __delitem__ ( y ) < == > del od [ y ]
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 is
        # then removed by updating the links in the predecessor and successor nodes.
        dict_delitem(self, key)
        link_prev, link_next, key = self.__map.pop(key)
        link_prev[1] = link_next
        link_next[0] = link_prev
def __delitem__ ( self , key , dict_delitem = dict . __delitem__ ) : # Deleting an existing item uses self.__map to find the link which is # then removed by updating the links in the predecessor and successor nodes. dict_delitem ( self , key ) link_prev , link_next , key = self . __map . pop ( key ) link_prev [ 1 ] = link_next link_next [ 0 ] = link_prev