@Override public List<PhEntry<Object>> queryAll(long[] min, long[] max) { return tree.queryAll(min, max); }
/** * Same as {@link PhTreeF#queryAll(double[], double[])}, except that it also accepts * a limit for the result size, a filter and a mapper. * @param min min key * @param max max key * @param maxResults maximum result count * @param filter filter object (optional) * @param mapper mapper object (optional) * @return List of query results * @param <R> value type */ public <R> List<R> queryAll(double[] min, double[] max, int maxResults, PhFilter filter, PhMapper<T, R> mapper) { long[] lUpp = new long[min.length]; long[] lLow = new long[max.length]; pre.pre(min, lLow); pre.pre(max, lUpp); return pht.queryAll(lLow, lUpp, maxResults, filter, mapper); }
/** * Same as {@link #queryIntersectAll(double[], double[], int, PhFilter, PhMapper)}, * except that it returns a list instead of an iterator. * This may be faster for small result sets. * @param lower min value * @param upper max value * @param maxResults max result count * @param filter filter instance * @param mapper mapper instance for mapping double[] to long[] * @return List of query results * @param <R> result type */ public <R> List<R> queryIntersectAll(double[] lower, double[] upper, int maxResults, PhFilter filter, PhMapper<T,R> mapper) { long[] lUpp = new long[lower.length << 1]; long[] lLow = new long[lower.length << 1]; pre.pre(qMIN, lower, lLow); pre.pre(upper, qMAX, lUpp); return pht.queryAll(lLow, lUpp, maxResults, filter, mapper); }