code: def _siftdown(heap, startpos, pos):
      newitem = heap[pos]
      # Follow the path to the root, moving parents down until finding a place
      # newitem fits.
      while pos > startpos:
          parentpos = (pos - 1) >> 1
          parent = heap[parentpos]
          if newitem < parent:
              heap[pos] = parent
              pos = parentpos
              continue
          break
      heap[pos] = newitem
  
file_path: cpython/Lib/heapq.py
label_desc: Use image node_id 9 for calling a global function with example usage: _siftdown(heap, startpos, pos) without return types