public static <V> BTreeSet<V> wrap(Object[] btree, Comparator<V> comparator) { return new BTreeSet<>(btree, comparator); }
public static <V> BTreeSet<V> wrap(Object[] btree, Comparator<V> comparator) { return new BTreeSet<>(btree, comparator); }
public static <V> BTreeSet<V> of(Comparator<? super V> comparator, V value) { return new BTreeSet<>(BTree.singleton(value), comparator); } }
public BTreeSet<V> build() { return new BTreeSet<>(builder.build(), builder.comparator); } }
public BTreeSet<V> build() { return new BTreeSet<>(builder.build(), builder.comparator); } }
public static <V> BTreeSet<V> of(Comparator<? super V> comparator, V value) { return new BTreeSet<>(BTree.singleton(value), comparator); } }
public BTreeSet<V> build() { return new BTreeSet<>(builder.build(), builder.comparator); } }
public static <V> BTreeSet<V> of(Comparator<? super V> comparator, V value) { return new BTreeSet<>(BTree.singleton(value), comparator); } }
public static <V> BTreeSet<V> of(Comparator<? super V> comparator, V value) { return new BTreeSet<>(BTree.singleton(value), comparator); } }
public BTreeSet<V> build() { return new BTreeSet<>(builder.build(), builder.comparator); } }
public static <V> BTreeSet<V> empty(Comparator<? super V> comparator) { return new BTreeSet<>(BTree.empty(), comparator); }
public static <V extends Comparable<V>> BTreeSet<V> of(V value) { return new BTreeSet<>(BTree.build(ImmutableList.of(value), UpdateFunction.<V>noOp()), Ordering.<V>natural()); }
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 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); }
public static <V extends Comparable<V>> BTreeSet<V> of(Collection<V> sortedValues) { return new BTreeSet<>(BTree.build(sortedValues, UpdateFunction.<V>noOp()), Ordering.<V>natural()); }
public static <V extends Comparable<V>> BTreeSet<V> of(V value) { return new BTreeSet<>(BTree.build(ImmutableList.of(value), UpdateFunction.<V>noOp()), Ordering.<V>natural()); }