remove un-necessary comments

python · rhettinger · Sep 23, 2024 · Jul 3, 2024 · Jul 3, 2024 · Jul 3, 2024
commit 8815a17e7d8b0db2fd3b41bde22965e0ea99a02d
@@ -1191,10 +1191,6 @@ anywhere a regular dictionary is used.
 .. versionchanged:: 3.9
    Added merge (``|``) and update (``|=``) operators, specified in :pep:`584`.
 
-.. versionchanged:: 3.14
-   Mutating :class:`OrderedDict` objects during an equality comparison raises
-   a :exc:`RuntimeError`.
-
 
 :class:`OrderedDict` Examples and Recipes
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

diff --git a/Lib/collections/__init__.py b/Lib/collections/__init__.py
@@ -314,13 +314,6 @@ def __eq__(self, other):
         while comparison to a regular mapping is order-insensitive.
 
         '''
-        # The Python implementation differs from the C implementation in the
-        # sense that it does not track mutations occurring in __eq__() of keys
-        # or values.
-        #
-        # Since it was decided not to change the Python implementation,
-        # calling ``del self[key]`` in the ``key.__class__.__eq__`` may
-        # raise an AttributeError during iteration.
         if isinstance(other, OrderedDict):
             return dict.__eq__(self, other) and all(map(_eq, self, other))
         return dict.__eq__(self, other)

diff --git a/Objects/odictobject.c b/Objects/odictobject.c
@@ -699,7 +699,7 @@ _odict_add_new_node(PyODictObject *od, PyObject *key, Py_hash_t hash)
 
     _odictnode_KEY(node) = key;
     _odictnode_HASH(node) = hash;
-    _odict_add_tail(od, node); // this updates 'od_state'
+    _odict_add_tail(od, node);
     od->od_fast_nodes[i] = node;
     return 0;
 }
@@ -773,7 +773,7 @@ _odict_clear_node(PyODictObject *od, _ODictNode *node, PyObject *key,
 
     // Now clear the node.
     od->od_fast_nodes[i] = NULL;
-    _odict_remove_node(od, node); // this updates 'od_state'
+    _odict_remove_node(od, node);
     _odictnode_DEALLOC(node);
     return 0;
 }