code: private void findIndex(
      int              lower,
      int              upper,
      Object           new1,
      NodeInsertPoint  point)
    {
      int nkeys = numKeys(lower, upper);
      if (nkeys < 4)
        sequentialFindIndex(lower, upper, new1, point);
      else
        binaryFindIndex(lower, upper, new1, point);
    }
docs: Find the insert point for a new key.
  
  <p>Find the insert point for a new key.  This method finds the point
  AFTER which the new key should be inserted.  The key does not
  need to be bounded by the node value and duplicates are allowed.
  If the new key is less than the lowest value already in the node,
  -1 is returned as the insert point.</p>
  
  <p>If the node is full, the PRE-insert point returned may be the
  right-most slot in the node.  In that case, the new key REPLACES
  the maximum value in the node.</p>
  
  @param lower Lower bound for search
  @param upper Upper bound for search
  @param new1  New Object to be inserted
  @param point Found insertion point