class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od
docstr_tok: ["od.setdefault","(","k","[",",","d","]",")","-",">","od.get","(","k",",","d",")",",","also","set","od","[","k","]","=d","if","k","not","in","od"]
code: def setdefault(self, key, default=None):
      "od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od"
      if key in self:
          return self[key]
      self[key] = default
      return default
  
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 11 for calling the OrderedDict obj's underlying member method code with example usage: obj.setdefault(key, default) and returns: default, self