public static <C, K extends C, V extends C> Object[] update(Object[] btree, Comparator<C> comparator, Collection<K> updateWith, UpdateFunction<K, V> updateF) { return update(btree, comparator, updateWith, updateWith.size(), updateF); }
public static <C, K extends C, V extends C> Object[] update(Object[] btree, Comparator<C> comparator, Collection<K> updateWith, UpdateFunction<K, V> updateF) { return update(btree, comparator, updateWith, updateWith.size(), updateF); }
public static <C, K extends C, V extends C> Object[] update(Object[] btree, Comparator<C> comparator, Collection<K> updateWith, UpdateFunction<K, V> updateF) { return update(btree, comparator, updateWith, updateWith.size(), updateF); }
public static <C, K extends C, V extends C> Object[] update(Object[] btree, Comparator<C> comparator, Collection<K> updateWith, UpdateFunction<K, V> updateF) { return update(btree, comparator, updateWith, updateWith.size(), updateF); }
public static <V> Object[] update(Object[] btree, Comparator<V> comparator, Collection<V> updateWith, boolean updateWithIsSorted, UpdateFunction<V> updateF) { return update(btree, comparator, updateWith, updateWith.size(), updateWithIsSorted, updateF); }
public BTreeSet<V> update(Collection<V> updateWith) { return new BTreeSet<>(BTree.update(tree, comparator, updateWith, UpdateFunction.<V>noOp()), comparator); }
public BTreeSet<V> update(Collection<V> updateWith) { return new BTreeSet<>(BTree.update(tree, comparator, updateWith, UpdateFunction.<V>noOp()), comparator); }
public BTreeSet<V> update(Collection<V> updateWith) { return new BTreeSet<>(BTree.update(tree, comparator, updateWith, UpdateFunction.<V>noOp()), comparator); }
public BTreeSet<V> update(Collection<V> updateWith, boolean isSorted) { return new BTreeSet<>(BTree.update(tree, comparator, updateWith, isSorted, UpdateFunction.NoOp.<V>instance()), comparator); }
public BTreeSet<V> update(Collection<V> updateWith) { return new BTreeSet<>(BTree.update(tree, comparator, updateWith, UpdateFunction.<V>noOp()), comparator); }
public static <K> Object[] merge(Object[] tree1, Object[] tree2, Comparator<? super K> comparator, UpdateFunction<K, K> updateF) { if (size(tree1) < size(tree2)) { Object[] tmp = tree1; tree1 = tree2; tree2 = tmp; } return update(tree1, comparator, new BTreeSet<>(tree2, comparator), updateF); }
public static <K> Object[] merge(Object[] tree1, Object[] tree2, Comparator<? super K> comparator, UpdateFunction<K, K> updateF) { if (size(tree1) < size(tree2)) { Object[] tmp = tree1; tree1 = tree2; tree2 = tmp; } return update(tree1, comparator, new BTreeSet<>(tree2, comparator), updateF); }
public static <K> Object[] merge(Object[] tree1, Object[] tree2, Comparator<? super K> comparator, UpdateFunction<K, K> updateF) { if (size(tree1) < size(tree2)) { Object[] tmp = tree1; tree1 = tree2; tree2 = tmp; } return update(tree1, comparator, new BTreeSet<>(tree2, comparator), updateF); }
public static <K> Object[] merge(Object[] tree1, Object[] tree2, Comparator<? super K> comparator, UpdateFunction<K, K> updateF) { if (size(tree1) < size(tree2)) { Object[] tmp = tree1; tree1 = tree2; tree2 = tmp; } return update(tree1, comparator, new BTreeSet<>(tree2, comparator), updateF); }
Object[] tree = BTree.update(current.tree, metadata.comparator.columnComparator(Memtable.MEMORY_POOL instanceof NativePool), cm, cm.getColumnCount(), true, updater);
? current.staticRow : (current.staticRow.isEmpty() ? updater.apply(newStatic) : updater.apply(current.staticRow, newStatic)); Object[] tree = BTree.update(current.tree, update.metadata().comparator, update, update.rowCount(), updater); EncodingStats newStats = current.stats.mergeWith(update.stats());
? current.staticRow : (current.staticRow.isEmpty() ? updater.apply(newStatic) : updater.apply(current.staticRow, newStatic)); Object[] tree = BTree.update(current.tree, update.metadata().comparator, update, update.rowCount(), updater); EncodingStats newStats = current.stats.mergeWith(update.stats());
? current.staticRow : (current.staticRow.isEmpty() ? updater.apply(newStatic) : updater.apply(current.staticRow, newStatic)); Object[] tree = BTree.update(current.tree, update.metadata().comparator, update, update.rowCount(), updater); EncodingStats newStats = current.stats.mergeWith(update.stats());
? current.staticRow : (current.staticRow.isEmpty() ? updater.apply(newStatic) : updater.apply(current.staticRow, newStatic)); Object[] tree = BTree.update(current.tree, update.metadata().comparator, update, update.rowCount(), updater); EncodingStats newStats = current.stats.mergeWith(update.stats());