class_docstr: Dictionary that remembers insertion order
class_docstr_tok: ["Dictionary","that","remembers","insertion","order"]
docstr: od.pop(k[,d]) -> v, remove specified key and return the corresponding
  value.  If key is not found, d is returned if given, otherwise KeyError
  is raised.
docstr_tok: ["od.pop","(","k","[",",","d","]",")","-",">","v",",","remove","specified","key","and","return","the","corresponding","value",".","If","key","is","not","found",",","d","is","returned","if","given",",","otherwise","KeyError","is","raised","."]
code: def pop(self, key, default=__marker):
      """od.pop(k[,d]) -> v, remove specified key and return the corresponding
      value.  If key is not found, d is returned if given, otherwise KeyError
      is raised.
  
      """
      if key in self:
          result = self[key]
          del self[key]
          return result
      if default is self.__marker:
          raise KeyError(key)
      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 10 for calling the OrderedDict obj's underlying member method code with example usage: obj.pop(key, default) and returns: default, result