@Test @Ignore public void printTree(){ System.out.println(TreeSet.range(0,10_000).printTree()); }
public String printTree(){ return map.tree(); }
TreeSet implements ImmutableSortedSet<T>,
                                         Higher<treeSet,T>,
                                         Serializable { public String printTree(){ return map.tree(); } }
TreeSet implements ImmutableSortedSet<T>,
                                         Higher<treeSet,T>,
                                         Serializable { public String printTree(){ return map.tree(); } TreeSet(RedBlackTree.Tree<T, T> map, Comparator<? super T> comp); }
TreeSet implements ImmutableSortedSet<T>,
                                         Higher<treeSet,T>,
                                         Serializable { public String printTree(){ return map.tree(); } TreeSet(RedBlackTree.Tree<T, T> map, Comparator<? super T> comp); static TreeSet<T> empty(); static TreeSet<T> singleton(T value); static TreeSet<T> singleton(Comparator<? super T> comp,T value); static TreeSet<T> empty(Comparator<? super T> comp); static TreeSet<T> fromStream(Stream<T> stream, Comparator<? super T> comp); static TreeSet<T> fromIterable(Iterable<T> it,Comparator<? super T> comp); static TreeSet<T> fromIterable(Iterable<T> it); @Override TreeSet<R> unitIterable(Iterable<R> it); ReactiveSeq<T> stream(); static TreeSet<T> of(Comparator<? super T> comp, T... values); static TreeSet<T> of(T... values); static TreeSet<T> fromSortedSet(SortedSet<T> set, Comparator<? super T> comp); boolean containsValue(T value); @Override int size(); @Override TreeSet<T> add(T value); @Override TreeSet<T> removeValue(T value); @Override boolean isEmpty(); @Override TreeSet<R> map(Function<? super T, ? extends R> fn); TreeSet<R> map(Function<? super T, ? extends R> fn, Comparator<? super R> comp); @Override TreeSet<R> flatMap(Function<? super T, ? extends ImmutableSet<? extends R>> fn); TreeSet<R> flatMap(Function<? super T, ? extends ImmutableSet<? extends R>> fn,Comparator<? super R> comp); @Override TreeSet<R> concatMap(Function<? super T, ? extends Iterable<? extends R>> fn); @Override TreeSet<R> mergeMap(Function<? super T, ? extends Publisher<? extends R>> fn); @Override TreeSet<R> mergeMap(int maxConcurecy, Function<? super T, ? extends Publisher<? extends R>> fn); TreeSet<R> concatMap(Function<? super T, ? extends Iterable<? extends R>> fn,Comparator<? super R> comp); @Override TreeSet<T> filter(Predicate<? super T> predicate); @Override TreeSet<R> unitStream(Stream<R> stream); @Override ImmutableSortedSet<T> unitStream(Stream<T> stream, Comparator<? super T> comp); TreeSet<T> plus(T value); @Override TreeSet<T> plusAll(Iterable<? extends T> list); @Override TreeSet<T> removeAll(Iterable<? extends T> list); @Override Option<T> get(int index); @Override Iterator<T> iterator(); @Override Comparator<? super T> comparator(); @Override ImmutableSortedSet<T> subSet(T fromElement, T toElement); @Override Option<T> first(); @Override Option<T> last(); @Override ImmutableSortedSet<T> drop(int num); @Override ImmutableSortedSet<T> take(int num); String printTree(); @Override boolean equals(Object o); @Override int hashCode(); @Override String toString(); TreeSet<T> take(final long n); TreeSet<T> takeWhile(Predicate<? super T> p); TreeSet<T> dropWhile(Predicate<? super T> p); TreeSet<T> drop(final long num); TreeSet<T> reverse(); Tuple2<TreeSet<T>,TreeSet<T>> duplicate(); Tuple2<TreeSet<R1>, TreeSet<R2>> unzip(Function<? super T, Tuple2<? extends R1, ? extends R2>> fn); @Override TreeSet<T> removeFirst(Predicate<? super T> pred); TreeSet<T> append(T append); TreeSet<T> appendAll(Iterable<? extends T> it); R foldLeft(R zero, BiFunction<R, ? super T, R> f); @Override TreeSet<U> ofType(Class<? extends U> type); @Override TreeSet<T> filterNot(Predicate<? super T> predicate); @Override TreeSet<T> notNull(); @Override TreeSet<T> peek(Consumer<? super T> c); @Override TreeSet<T> removeStream(Stream<? extends T> stream); @Override TreeSet<T> retainAll(Iterable<? extends T> it); @Override TreeSet<T> retainStream(Stream<? extends T> stream); @Override TreeSet<T> retainAll(T... values); @Override TreeSet<ReactiveSeq<T>> permutations(); @Override TreeSet<ReactiveSeq<T>> combinations(int size); @Override TreeSet<ReactiveSeq<T>> combinations(); @Override TreeSet<R> zip(BiFunction<? super T, ? super T2, ? extends R> fn, Publisher<? extends T2> publisher); @Override TreeSet<R> zipWithStream(Stream<? extends U> other, BiFunction<? super T, ? super U, ? extends R> zipper); @Override TreeSet<Tuple2<T, U>> zipWithPublisher(Publisher<? extends U> other); @Override TreeSet<Tuple2<T, U>> zip(Iterable<? extends U> other); @Override TreeSet<R> zip3(Iterable<? extends S> second, Iterable<? extends U> third, Function3<? super T, ? super S, ? super U, ? extends R> fn3); @Override TreeSet<R> zip4(Iterable<? extends T2> second, Iterable<? extends T3> third, Iterable<? extends T4> fourth, Function4<? super T, ? super T2, ? super T3, ? super T4, ? extends R> fn); @Override TreeSet<T> combine(BiPredicate<? super T, ? super T> predicate, BinaryOperator<T> op); @Override TreeSet<T> combine(Monoid<T> op, BiPredicate<? super T, ? super T> predicate); @Override TreeSet<T> cycle(long times); @Override TreeSet<T> cycle(Monoid<T> m, long times); @Override TreeSet<T> cycleWhile(Predicate<? super T> predicate); @Override TreeSet<T> cycleUntil(Predicate<? super T> predicate); @Override TreeSet<R> zip(Iterable<? extends U> other, BiFunction<? super T, ? super U, ? extends R> zipper); @Override TreeSet<Tuple3<T, S, U>> zip3(Iterable<? extends S> second, Iterable<? extends U> third); @Override TreeSet<Tuple4<T, T2, T3, T4>> zip4(Iterable<? extends T2> second, Iterable<? extends T3> third, Iterable<? extends T4> fourth); @Override TreeSet<Tuple2<T, Long>> zipWithIndex(); @Override TreeSet<Seq<T>> sliding(int windowSize); @Override TreeSet<Seq<T>> sliding(int windowSize, int increment); @Override TreeSet<C> grouped(int size, Supplier<C> supplier); @Override TreeSet<Vector<T>> groupedUntil(Predicate<? super T> predicate); @Override TreeSet<Vector<T>> groupedUntil(BiPredicate<Vector<? super T>, ? super T> predicate); @Override TreeSet<Tuple2<T, U>> zipWithStream(Stream<? extends U> other); @Override TreeSet<Vector<T>> groupedWhile(Predicate<? super T> predicate); @Override TreeSet<C> groupedWhile(Predicate<? super T> predicate, Supplier<C> factory); @Override TreeSet<C> groupedUntil(Predicate<? super T> predicate, Supplier<C> factory); @Override TreeSet<Vector<T>> grouped(int groupSize); @Override TreeSet<T> distinct(); @Override TreeSet<T> scanLeft(Monoid<T> monoid); @Override TreeSet<U> scanLeft(U seed, BiFunction<? super U, ? super T, ? extends U> function); @Override TreeSet<T> scanRight(Monoid<T> monoid); @Override TreeSet<U> scanRight(U identity, BiFunction<? super T, ? super U, ? extends U> combiner); @Override TreeSet<T> sorted(); @Override TreeSet<T> sorted(Comparator<? super T> c); @Override TreeSet<T> takeUntil(Predicate<? super T> p); @Override TreeSet<T> dropUntil(Predicate<? super T> p); @Override TreeSet<T> dropRight(int num); @Override TreeSet<T> takeRight(int num); @Override TreeSet<T> intersperse(T value); @Override TreeSet<T> shuffle(); @Override TreeSet<T> shuffle(Random random); @Override TreeSet<T> slice(long from, long to); @Override TreeSet<T> prependStream(Stream<? extends T> stream); @Override TreeSet<T> appendAll(T... values); @Override TreeSet<T> prependAll(T... values); @Override TreeSet<T> deleteBetween(int start, int end); @Override TreeSet<T> insertStreamAt(int pos, Stream<T> stream); @Override TreeSet<T> sorted(Function<? super T, ? extends U> function); String mkString(); @Override TreeSet<T> onEmpty(T value); @Override TreeSet<T> onEmptyGet(Supplier<? extends T> supplier); @Override TreeSet<T> removeAll(T... values); @Override TreeSet<T> prepend(T value); @Override TreeSet<T> removeAt(long pos); @Override TreeSet<T> prependAll(Iterable<? extends T> value); @Override TreeSet<R> forEach4(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, ? extends Iterable<R3>> iterable3, Function4<? super T, ? super R1, ? super R2, ? super R3, ? extends R> yieldingFunction); @Override TreeSet<R> forEach4(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, ? extends Iterable<R3>> iterable3, Function4<? super T, ? super R1, ? super R2, ? super R3, Boolean> filterFunction, Function4<? super T, ? super R1, ? super R2, ? super R3, ? extends R> yieldingFunction); @Override TreeSet<R> forEach3(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, ? extends R> yieldingFunction); @Override TreeSet<R> forEach3(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, Boolean> filterFunction, Function3<? super T, ? super R1, ? super R2, ? extends R> yieldingFunction); @Override TreeSet<R> forEach2(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends R> yieldingFunction); @Override TreeSet<R> forEach2(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, Boolean> filterFunction, BiFunction<? super T, ? super R1, ? extends R> yieldingFunction); @Override TreeSet<T> updateAt(int pos, T value); @Override TreeSet<T> insertAt(int pos, Iterable<? extends T> values); @Override TreeSet<T> insertAt(int i, T value); @Override TreeSet<T> insertAt(int pos, T... values); }
TreeSet implements ImmutableSortedSet<T>,
                                         Higher<treeSet,T>,
                                         Serializable { public String printTree(){ return map.tree(); } TreeSet(RedBlackTree.Tree<T, T> map, Comparator<? super T> comp); static TreeSet<T> empty(); static TreeSet<T> singleton(T value); static TreeSet<T> singleton(Comparator<? super T> comp,T value); static TreeSet<T> empty(Comparator<? super T> comp); static TreeSet<T> fromStream(Stream<T> stream, Comparator<? super T> comp); static TreeSet<T> fromIterable(Iterable<T> it,Comparator<? super T> comp); static TreeSet<T> fromIterable(Iterable<T> it); @Override TreeSet<R> unitIterable(Iterable<R> it); ReactiveSeq<T> stream(); static TreeSet<T> of(Comparator<? super T> comp, T... values); static TreeSet<T> of(T... values); static TreeSet<T> fromSortedSet(SortedSet<T> set, Comparator<? super T> comp); boolean containsValue(T value); @Override int size(); @Override TreeSet<T> add(T value); @Override TreeSet<T> removeValue(T value); @Override boolean isEmpty(); @Override TreeSet<R> map(Function<? super T, ? extends R> fn); TreeSet<R> map(Function<? super T, ? extends R> fn, Comparator<? super R> comp); @Override TreeSet<R> flatMap(Function<? super T, ? extends ImmutableSet<? extends R>> fn); TreeSet<R> flatMap(Function<? super T, ? extends ImmutableSet<? extends R>> fn,Comparator<? super R> comp); @Override TreeSet<R> concatMap(Function<? super T, ? extends Iterable<? extends R>> fn); @Override TreeSet<R> mergeMap(Function<? super T, ? extends Publisher<? extends R>> fn); @Override TreeSet<R> mergeMap(int maxConcurecy, Function<? super T, ? extends Publisher<? extends R>> fn); TreeSet<R> concatMap(Function<? super T, ? extends Iterable<? extends R>> fn,Comparator<? super R> comp); @Override TreeSet<T> filter(Predicate<? super T> predicate); @Override TreeSet<R> unitStream(Stream<R> stream); @Override ImmutableSortedSet<T> unitStream(Stream<T> stream, Comparator<? super T> comp); TreeSet<T> plus(T value); @Override TreeSet<T> plusAll(Iterable<? extends T> list); @Override TreeSet<T> removeAll(Iterable<? extends T> list); @Override Option<T> get(int index); @Override Iterator<T> iterator(); @Override Comparator<? super T> comparator(); @Override ImmutableSortedSet<T> subSet(T fromElement, T toElement); @Override Option<T> first(); @Override Option<T> last(); @Override ImmutableSortedSet<T> drop(int num); @Override ImmutableSortedSet<T> take(int num); String printTree(); @Override boolean equals(Object o); @Override int hashCode(); @Override String toString(); TreeSet<T> take(final long n); TreeSet<T> takeWhile(Predicate<? super T> p); TreeSet<T> dropWhile(Predicate<? super T> p); TreeSet<T> drop(final long num); TreeSet<T> reverse(); Tuple2<TreeSet<T>,TreeSet<T>> duplicate(); Tuple2<TreeSet<R1>, TreeSet<R2>> unzip(Function<? super T, Tuple2<? extends R1, ? extends R2>> fn); @Override TreeSet<T> removeFirst(Predicate<? super T> pred); TreeSet<T> append(T append); TreeSet<T> appendAll(Iterable<? extends T> it); R foldLeft(R zero, BiFunction<R, ? super T, R> f); @Override TreeSet<U> ofType(Class<? extends U> type); @Override TreeSet<T> filterNot(Predicate<? super T> predicate); @Override TreeSet<T> notNull(); @Override TreeSet<T> peek(Consumer<? super T> c); @Override TreeSet<T> removeStream(Stream<? extends T> stream); @Override TreeSet<T> retainAll(Iterable<? extends T> it); @Override TreeSet<T> retainStream(Stream<? extends T> stream); @Override TreeSet<T> retainAll(T... values); @Override TreeSet<ReactiveSeq<T>> permutations(); @Override TreeSet<ReactiveSeq<T>> combinations(int size); @Override TreeSet<ReactiveSeq<T>> combinations(); @Override TreeSet<R> zip(BiFunction<? super T, ? super T2, ? extends R> fn, Publisher<? extends T2> publisher); @Override TreeSet<R> zipWithStream(Stream<? extends U> other, BiFunction<? super T, ? super U, ? extends R> zipper); @Override TreeSet<Tuple2<T, U>> zipWithPublisher(Publisher<? extends U> other); @Override TreeSet<Tuple2<T, U>> zip(Iterable<? extends U> other); @Override TreeSet<R> zip3(Iterable<? extends S> second, Iterable<? extends U> third, Function3<? super T, ? super S, ? super U, ? extends R> fn3); @Override TreeSet<R> zip4(Iterable<? extends T2> second, Iterable<? extends T3> third, Iterable<? extends T4> fourth, Function4<? super T, ? super T2, ? super T3, ? super T4, ? extends R> fn); @Override TreeSet<T> combine(BiPredicate<? super T, ? super T> predicate, BinaryOperator<T> op); @Override TreeSet<T> combine(Monoid<T> op, BiPredicate<? super T, ? super T> predicate); @Override TreeSet<T> cycle(long times); @Override TreeSet<T> cycle(Monoid<T> m, long times); @Override TreeSet<T> cycleWhile(Predicate<? super T> predicate); @Override TreeSet<T> cycleUntil(Predicate<? super T> predicate); @Override TreeSet<R> zip(Iterable<? extends U> other, BiFunction<? super T, ? super U, ? extends R> zipper); @Override TreeSet<Tuple3<T, S, U>> zip3(Iterable<? extends S> second, Iterable<? extends U> third); @Override TreeSet<Tuple4<T, T2, T3, T4>> zip4(Iterable<? extends T2> second, Iterable<? extends T3> third, Iterable<? extends T4> fourth); @Override TreeSet<Tuple2<T, Long>> zipWithIndex(); @Override TreeSet<Seq<T>> sliding(int windowSize); @Override TreeSet<Seq<T>> sliding(int windowSize, int increment); @Override TreeSet<C> grouped(int size, Supplier<C> supplier); @Override TreeSet<Vector<T>> groupedUntil(Predicate<? super T> predicate); @Override TreeSet<Vector<T>> groupedUntil(BiPredicate<Vector<? super T>, ? super T> predicate); @Override TreeSet<Tuple2<T, U>> zipWithStream(Stream<? extends U> other); @Override TreeSet<Vector<T>> groupedWhile(Predicate<? super T> predicate); @Override TreeSet<C> groupedWhile(Predicate<? super T> predicate, Supplier<C> factory); @Override TreeSet<C> groupedUntil(Predicate<? super T> predicate, Supplier<C> factory); @Override TreeSet<Vector<T>> grouped(int groupSize); @Override TreeSet<T> distinct(); @Override TreeSet<T> scanLeft(Monoid<T> monoid); @Override TreeSet<U> scanLeft(U seed, BiFunction<? super U, ? super T, ? extends U> function); @Override TreeSet<T> scanRight(Monoid<T> monoid); @Override TreeSet<U> scanRight(U identity, BiFunction<? super T, ? super U, ? extends U> combiner); @Override TreeSet<T> sorted(); @Override TreeSet<T> sorted(Comparator<? super T> c); @Override TreeSet<T> takeUntil(Predicate<? super T> p); @Override TreeSet<T> dropUntil(Predicate<? super T> p); @Override TreeSet<T> dropRight(int num); @Override TreeSet<T> takeRight(int num); @Override TreeSet<T> intersperse(T value); @Override TreeSet<T> shuffle(); @Override TreeSet<T> shuffle(Random random); @Override TreeSet<T> slice(long from, long to); @Override TreeSet<T> prependStream(Stream<? extends T> stream); @Override TreeSet<T> appendAll(T... values); @Override TreeSet<T> prependAll(T... values); @Override TreeSet<T> deleteBetween(int start, int end); @Override TreeSet<T> insertStreamAt(int pos, Stream<T> stream); @Override TreeSet<T> sorted(Function<? super T, ? extends U> function); String mkString(); @Override TreeSet<T> onEmpty(T value); @Override TreeSet<T> onEmptyGet(Supplier<? extends T> supplier); @Override TreeSet<T> removeAll(T... values); @Override TreeSet<T> prepend(T value); @Override TreeSet<T> removeAt(long pos); @Override TreeSet<T> prependAll(Iterable<? extends T> value); @Override TreeSet<R> forEach4(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, ? extends Iterable<R3>> iterable3, Function4<? super T, ? super R1, ? super R2, ? super R3, ? extends R> yieldingFunction); @Override TreeSet<R> forEach4(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, ? extends Iterable<R3>> iterable3, Function4<? super T, ? super R1, ? super R2, ? super R3, Boolean> filterFunction, Function4<? super T, ? super R1, ? super R2, ? super R3, ? extends R> yieldingFunction); @Override TreeSet<R> forEach3(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, ? extends R> yieldingFunction); @Override TreeSet<R> forEach3(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends Iterable<R2>> iterable2, Function3<? super T, ? super R1, ? super R2, Boolean> filterFunction, Function3<? super T, ? super R1, ? super R2, ? extends R> yieldingFunction); @Override TreeSet<R> forEach2(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, ? extends R> yieldingFunction); @Override TreeSet<R> forEach2(Function<? super T, ? extends Iterable<R1>> iterable1, BiFunction<? super T, ? super R1, Boolean> filterFunction, BiFunction<? super T, ? super R1, ? extends R> yieldingFunction); @Override TreeSet<T> updateAt(int pos, T value); @Override TreeSet<T> insertAt(int pos, Iterable<? extends T> values); @Override TreeSet<T> insertAt(int i, T value); @Override TreeSet<T> insertAt(int pos, T... values);  }