@Override public boolean update(long[] p1, long[] p2) { return tree.update(p1, p2) != null; }
/** * @param lo1 old lower left corner * @param up1 old upper right corner * @param lo2 new lower left corner * @param up2 new upper right corner * @return true, if the value could be replaced. * @see PhTree#update(long[], long[]) */ public T update(long[] lo1, long[] up1, long[] lo2, long[] up2) { long[] pOld = new long[lo1.length << 1]; long[] pNew = new long[lo1.length << 1]; pre.pre(lo1, up1, pOld); pre.pre(lo2, up2, pNew); return pht.update(pOld, pNew); }
/** * @param lo1 old min value * @param up1 old max value * @param lo2 new min value * @param up2 new max value * @return true, if the value could be replaced. * @see PhTree#update(long[], long[]) */ public T update(double[] lo1, double[] up1, double[] lo2, double[] up2) { long[] pOld = new long[lo1.length << 1]; long[] pNew = new long[lo1.length << 1]; pre.pre(lo1, up1, pOld); pre.pre(lo2, up2, pNew); return pht.update(pOld, pNew); }
/** * Update the key of an entry. Update may fail if the old key does not exist, or if the new * key already exists. * @param oldKey old key * @param newKey new key * @return the value (can be {@code null}) associated with the updated key if the key could be * updated, otherwise {@code null}. */ public T update(double[] oldKey, double[] newKey) { long[] oldL = new long[oldKey.length]; long[] newL = new long[newKey.length]; pre.pre(oldKey, oldL); pre.pre(newKey, newL); return pht.update(oldL, newL); }