class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: od.__iter__() <==> iter(od)
docstr_tok: ["od.__iter__","(",")","<","==",">","iter","(","od",")"]
code: def __iter__(self):
      "od.__iter__() <==> iter(od)"
      # Traverse the linked list in order.
      root = self.__root
      curr = root.next
      while curr is not root:
          yield curr.key
          curr = curr.next
  
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 4 for calling the OrderedDict obj's underlying member method code with example usage: obj.__iter__() without return types