class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: od.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
  while comparison to a regular mapping is order-insensitive.
docstr_tok: ["od.__eq__","(","y",")","<","==",">","od==y",".","Comparison","to","another","OD","is","order-sensitive","while","comparison","to","a","regular","mapping","is","order-insensitive","."]
code: def __eq__(self, other):
      """od.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
      while comparison to a regular mapping is order-insensitive.
  
      """
      if isinstance(other, OrderedDict):
          return len(self) == len(other) and all(
              p == q for p, q in zip(self.items(), other.items())
          )
      return dict.__eq__(self, other)
  
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 16 for calling the OrderedDict obj's underlying member method code with example usage: obj.__eq__(other) and returns: dict, unknown