@Override public boolean delete(long... key) { return tree.remove(key) != null; }
/** * Remove the entry associated with a k dimensional key. * @param key the key to remove * @return the associated value or {@code null} if the key was found */ public T remove(double... key) { long[] lKey = new long[key.length]; pre.pre(key, lKey); return pht.remove(lKey); }
/** * Removes a ranged object from the tree. * @param lower lower left corner * @param upper upper right corner * @return the value or {@code null} if no entry existed * * @see PhTree#remove(long...) */ public T remove(double[] lower, double[] upper) { long[] lVal = new long[lower.length*2]; pre.pre(lower, upper, lVal); return pht.remove(lVal); }
/** * Removes a ranged object from the tree. * @param lower lower left corner * @param upper upper right corner * @return the value or {@code null} if no entry existed * * @see PhTree#remove(long...) */ public T remove(long[] lower, long[] upper) { long[] lVal = new long[lower.length*2]; pre.pre(lower, upper, lVal); return pht.remove(lVal); }