code: public OMVRBTreeEntry<K, V> getHigherEntry(final K key) {
      final OMVRBTreeEntry<K, V> p = getEntry(key, true, PartialSearchMode.HIGHEST_BOUNDARY);
  
      if (p == null)
        return null;
  
      if (pageItemFound)
        // MATCH, RETURN THE NEXT ONE
        return next(p);
      else if (pageIndex < p.getSize())
        // NOT MATCHED, POSITION IS ALREADY TO THE NEXT ONE
        return p;
  
      return null;
    }
docs: Gets the entry for the least key greater than the specified key; if no such entry exists, returns the entry for the least key
  greater than the specified key; if no such entry exists returns <tt>null</tt>.