/** * Performs a rectangular window query. The parameters are the min and max keys which * contain the minimum respectively the maximum keys in every dimension. * @param min Minimum values * @param max Maximum values * @return Result iterator. */ @Override public PhQuery<T> query(long[] min, long[] max) { if (min.length != dims || max.length != dims) { throw new IllegalArgumentException("Invalid number of arguments: " + min.length + " / " + max.length + " DIM=" + dims); } PhQuery<T> q = new PhIteratorNoGC<>(this, null); q.reset(min, max); return q; }
/** * Performs a rectangular window query. The parameters are the min and max keys which * contain the minimum respectively the maximum keys in every dimension. * @param min Minimum values * @param max Maximum values * @return Result iterator. */ @Override public PhQuery<T> query(long[] min, long[] max) { if (min.length != DIM || max.length != DIM) { throw new IllegalArgumentException("Invalid number of arguments: " + min.length + " / " + max.length + " DIM=" + DIM); } //return new PhIteratorHighK<T>(getRoot(), min, max, DIM, DEPTH); PhQuery<T> q = new PhIteratorNoGC<>(this, null); q.reset(min, max); return q; }
/** * Performs a rectangular window query. The parameters are the min and max keys which * contain the minimum respectively the maximum keys in every dimension. * @param min Minimum values * @param max Maximum values * @return Result iterator. */ @Override public PhQuery<T> query(long[] min, long[] max) { if (min.length != dims || max.length != dims) { throw new IllegalArgumentException("Invalid number of arguments: " + min.length + " / " + max.length + " DIM=" + dims); } PhQuery<T> q = new PhIteratorNoGC<>(this, null); q.reset(min, max); return q; }
/** * Restarts the query with a new query rectangle. * @param lower minimum values of query rectangle * @param upper maximum values of query rectangle * @return this */ public PhQuerySF<T> reset(double[] lower, double[] upper) { if (intersect) { pre.pre(qMIN, lower, lLow); pre.pre(upper, qMAX, lUpp); } else { //include pre.pre(lower, lower, lLow); pre.pre(upper, upper, lUpp); } q.reset(lLow, lUpp); return this; } }
/** * Restarts the query with a new query rectangle. * @param lower minimum values of query rectangle * @param upper maximum values of query rectangle */ public void reset(long[] lower, long[] upper) { if (intersect) { pre.pre(qMIN, lower, lLow); pre.pre(upper, qMAX, lUpp); } else { //include pre.pre(lower, lower, lLow); pre.pre(upper, upper, lUpp); } q.reset(lLow, lUpp); } }
/** * Performs a rectangular window query. The parameters are the min and max keys which * contain the minimum respectively the maximum keys in every dimension. * @param min Minimum values * @param max Maximum values * @return Result iterator. */ @Override public PhQuery<T> query(long[] min, long[] max) { if (min.length != dims || max.length != dims) { throw new IllegalArgumentException("Invalid number of arguments: " + min.length + " / " + max.length + " DIM=" + dims); } PhQuery<T> q = new PhIteratorNoGC<>(this, null); q.reset(min, max); return q; }
/** * Performs a rectangular window query. The parameters are the min and max keys which * contain the minimum respectively the maximum keys in every dimension. * @param min Minimum values * @param max Maximum values * @return Result iterator. */ @Override public PhQuery<T> query(long[] min, long[] max) { if (min.length != dims || max.length != dims) { throw new IllegalArgumentException("Invalid number of arguments: " + min.length + " / " + max.length + " DIM=" + dims); } PhQuery<T> q = new PhIteratorNoGC<>(this, null); q.reset(min, max); return q; }
public PhRangeQuery<T> reset(double range, long... center) { filter.set(center, dist, range); dist.toMBB(range, center, min, max); q.reset(min, max); return this; }
/** * Restarts the query with a new query rectangle. * @param lower minimum values of query rectangle * @param upper maximum values of query rectangle */ public void reset(double[] lower, double[] upper) { pre.pre(lower, lMin); pre.pre(upper, lMax); q.reset(lMin, lMax); } }