code: func (n *node) childIndex(child *node) int {
  	index := sort.Search(len(n.inodes), func(i int) bool { return bytes.Compare(n.inodes[i].key, child.key) != -1 })
  	return index
  }
docs: // childIndex returns the index of a given child node.