@Override public boolean insert(long... key) { return tree.put(key, VALUE_PLACEHOLDER) != null; }
/** * Insert an entry associated with a k dimensional key. * @param key the key to store the value to store * @param value the value * @return the previously associated value or {@code null} if the key was found */ public T put(double[] key, T value) { long[] lKey = new long[key.length]; pre.pre(key, lKey); return pht.put(lKey, value); }
/** * Inserts a new ranged object into the tree. * @param lower lower left corner * @param upper upper right corner * @param value value * @return the previous value or {@code null} if no entry existed * * @see PhTree#put(long[], Object) */ public T put(long[] lower, long[] upper, T value) { long[] lVal = new long[lower.length*2]; pre.pre(lower, upper, lVal); return pht.put(lVal, value); }
/** * Inserts a new ranged object into the tree. * @param lower lower left corner * @param upper upper right corner * @param value the value * @return the previous value or {@code null} if no entry existed * * @see PhTree#put(long[], Object) */ public T put(double[] lower, double[] upper, T value) { long[] lVal = new long[lower.length*2]; pre.pre(lower, upper, lVal); return pht.put(lVal, value); }