private PhEntryDist<Object> createEntry(long[] key, Object val, double dist) { if (pool.isEmpty()) { return new PhEntryDist<Object>(key, val, dist); } PhEntryDist<Object> e = pool.remove(pool.size() - 1); e.setKeyInternal(key); e.set(val, dist); return e; }
public void setCopyKey(long[] key, T val, double dist) { System.arraycopy(key, 0, getKey(), 0, getKey().length); set(val, dist); }
PhEntry<T> e = itEx.nextEntryReuse(); PhEntryDist<T> e2 = results.getFreeEntry(); e2.set(e, distance.dist(val, e.getKey())); checker.set(val, distance, Double.MAX_VALUE); results.phOffer(e2);
private PhEntryDist<Object> createEntry(long[] key, Object val, double dist) { if (pool.isEmpty()) { return new PhEntryDist<Object>(key, val, dist); } PhEntryDist<Object> e = pool.remove(pool.size() - 1); e.setKeyInternal(key); e.set(val, dist); return e; }
PhEntry<T> e = itEx.nextEntryReuse(); PhEntryDist<T> e2 = results.getFreeEntry(); e2.set(e, distance.dist(val, e.getKey())); checker.set(val, distance, Double.MAX_VALUE); results.phOffer(e2);
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 PhEntryDist<Object> createEntry(long[] key, Object val, double dist) { if (pool.isEmpty()) { return new PhEntryDist<Object>(key, val, dist); } PhEntryDist<Object> e = pool.remove(pool.size() - 1); e.setKeyInternal(key); e.set(val, dist); return e; }
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 static <T> PhEntryDist<T> createEntry(ArrayList<PhEntryDist<T>> pool, long[] key, T val, double dist) { if (pool.isEmpty()) { return new PhEntryDist<T>(key, val, dist); } PhEntryDist<T> e = pool.remove(pool.size() - 1); e.setKeyInternal(key); e.set(val, dist); return e; }
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 PhEntryDist<Object> createEntry(long[] key, Object val, double dist) { if (pool.isEmpty()) { return new PhEntryDist<Object>(key, val, dist); } PhEntryDist<Object> e = pool.remove(pool.size() - 1); e.setKeyInternal(key); e.set(val, dist); return e; }