code: private V linearSearch(final K iKey) {
      V value = null;
      int i = 0;
      tree.pageItemComparator = -1;
      for (int s = getSize(); i < s; ++i) {
        if (tree.comparator != null)
          tree.pageItemComparator = tree.comparator.compare(getKeyAt(i), iKey);
        else
          tree.pageItemComparator = ((Comparable<? super K>) getKeyAt(i)).compareTo(iKey);
  
        if (tree.pageItemComparator == 0) {
          // FOUND: SET THE INDEX AND RETURN THE NODE
          tree.pageItemFound = true;
          value = getValueAt(i);
          break;
        } else if (tree.pageItemComparator > 0)
          break;
      }
  
      tree.pageIndex = i;
  
      return value;
    }
docs: Linear search inside the node
  
  @param iKey
  Key to search
  @return Value if found, otherwise null and the tree.pageIndex updated with the closest-after-first position valid for further
  inserts.