private void addEntry(PhEntry<T> e, long[] center) { double dist = distance.dist(center, e.getKey()); if (resultSize < entries.size()) { entries.get(resultSize).set(e, dist); } else { PhEntryDist<T> de = new PhEntryDist<>(e, dist); entries.add(de); } resultSize++; }
private void addEntry(PhEntry<T> e, long[] center) { double dist = distance.dist(center, e.getKey()); if (resultSize < entries.size()) { entries.get(resultSize).set(e, dist); } else { PhEntryDist<T> de = new PhEntryDist<>(e, dist); entries.add(de); } resultSize++; }
private void addEntry(PhEntry<T> e, long[] center) { double dist = distance.dist(center, e.getKey()); if (resultSize < entries.size()) { entries.get(resultSize).set(e, dist); } else { PhEntryDist<T> de = new PhEntryDist<>(e, dist); entries.add(de); } resultSize++; }
/** * @return the key of the next entry */ public double[] nextKey() { double[] d = new double[dims]; pre.post(iter.nextEntryReuse().getKey(), d); return d; }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override public <R> List<R> queryAll(long[] min, long[] max, int maxResults, PhFilter filter, PhMapperKey<R> mapper) { if (mapper != null) { return tree.queryAll(min, max, maxResults, filter, ((e) -> mapper.map(e.getKey())) ); } else { return tree.queryAll(min, max, maxResults, null, null); } }
public void set(PhEntry<T> e, double dist) { super.setValue(e.getValue()); System.arraycopy(e.getKey(), 0, getKey(), 0, getKey().length); this.dist = dist; }
@Override public PhEntryF<T> nextEntry() { double[] d = new double[dims]; PhEntry<T> e = iter.nextEntryReuse(); pre.post(e.getKey(), d); return new PhEntryF<>(d, e.getValue()); }
@Override public PhEntryS<T> nextEntryReuse() { PhEntry<T> pvEntry = iter.nextEntryReuse(); pre.post(pvEntry.getKey(), buffer.lower, buffer.upper); buffer.setValue( pvEntry.getValue() ); return buffer; } @Override
@Override public PhEntrySF<T> nextEntry() { double[] lower = new double[dims]; double[] upper = new double[dims]; PhEntry<T> pvEntry = iter.nextEntryReuse(); pre.post(pvEntry.getKey(), lower, upper); return new PhEntrySF<>(lower, upper, pvEntry.getValue()); } @Override
@Override public PhEntrySF<T> nextEntryReuse() { PhEntry<T> pvEntry = iter.nextEntryReuse(); pre.post(pvEntry.getKey(), buffer.lower, buffer.upper); buffer.setValue( pvEntry.getValue() ); return buffer; } @Override
@Override public PhEntryF<T> nextEntryReuse() { PhEntry<T> e = iter.nextEntryReuse(); pre.post(e.getKey(), buffer.getKey()); buffer.setValue( e.getValue() ); return buffer; }
private boolean niFindNextIter(PhEntry<T> result) { while (niIterator.hasNext()) { NtEntry<Object> e = niIterator.nextEntryReuse(); System.arraycopy(e.getKdKey(), 0, result.getKey(), 0, dims); if (readValue(e.key(), e.value(), result)) { next = e.getKey(); //This is required for kNN-adjusting of iterators return true; } } return false; }
private boolean niFindNextIter(PhEntry<T> result) { while (niIterator.hasNext()) { NtEntry<Object> e = niIterator.nextEntryReuse(); System.arraycopy(e.getKdKey(), 0, result.getKey(), 0, dims); if (readValue(e.key(), e.value(), result)) { next = e.getKey(); //This is required for kNN-adjusting of iterators return true; } } return false; }