Vavr 0.10.6 · io.vavr.collection.TreeModule · APIdia, the JavaDoc alternative

Because the empty tree Empty cannot be a child of an existing tree, method implementations distinguish between the empty and non-empty case. Because the structure of trees is recursive, often we have commands in the form of module classes with one static method.

Method Summary

Modifier and Type	Method and Description
public static <T, U> Tree<U>	flatMap(Tree.Node<T> node, Function<? super T, ? extends Iterable<? extends U>> mapper)
public static <T, U> Tree.Node<U>	map(Tree.Node<T> node, Function<? super T, ? extends U> mapper)
public static <T> Tree.Node<T>	replace(Tree.Node<T> node, T currentElement, T newElement)
public static <T> Stream<Tree.Node<T>>	traverseInOrder(Tree.Node<T> node)
public static <T> Stream<Tree.Node<T>>	traverseLevelOrder(Tree.Node<T> node)
public static <T> Stream<Tree.Node<T>>	traversePostOrder(Tree.Node<T> node)
public static <T> Stream<Tree.Node<T>>	traversePreOrder(Tree.Node<T> node)
public static <T, T1, T2> Tuple2<Tree.Node<T1>, Tree.Node<T2>>	unzip(Tree.Node<T> node, Function<? super T, Tuple2<? extends T1, ? extends T2>> unzipper)
public static <T, T1, T2, T3> Tuple3<Tree.Node<T1>, Tree.Node<T2>, Tree.Node<T3>>	unzip3(Tree.Node<T> node, Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper)
public static <T, U, R> Tree<R>	zip(Tree.Node<T> node, Iterator<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper)
public static <T, U> Tree<Tuple2<T, U>>	zipAll(Tree.Node<T> node, Iterator<? extends U> that, U thatElem)

Method Detail

flatMap	back to summary
public static <T, U> Tree<U> flatMap(Tree.Node<T> node, Function<? super T, ? extends Iterable<? extends U>> mapper) Annotations @SuppressWarnings:unchecked

map	back to summary
public static <T, U> Tree.Node<U> map(Tree.Node<T> node, Function<? super T, ? extends U> mapper)

replace	back to summary
public static <T> Tree.Node<T> replace(Tree.Node<T> node, T currentElement, T newElement)

traverseInOrder	back to summary
public static <T> Stream<Tree.Node<T>> traverseInOrder(Tree.Node<T> node)

traverseLevelOrder	back to summary
public static <T> Stream<Tree.Node<T>> traverseLevelOrder(Tree.Node<T> node)

traversePostOrder	back to summary
public static <T> Stream<Tree.Node<T>> traversePostOrder(Tree.Node<T> node)

traversePreOrder	back to summary
public static <T> Stream<Tree.Node<T>> traversePreOrder(Tree.Node<T> node)

unzip	back to summary
public static <T, T1, T2> Tuple2<Tree.Node<T1>, Tree.Node<T2>> unzip(Tree.Node<T> node, Function<? super T, Tuple2<? extends T1, ? extends T2>> unzipper)

unzip3	back to summary
public static <T, T1, T2, T3> Tuple3<Tree.Node<T1>, Tree.Node<T2>, Tree.Node<T3>> unzip3(Tree.Node<T> node, Function<? super T, Tuple3<? extends T1, ? extends T2, ? extends T3>> unzipper)

zip	back to summary
public static <T, U, R> Tree<R> zip(Tree.Node<T> node, Iterator<? extends U> that, BiFunction<? super T, ? super U, ? extends R> mapper) Annotations @SuppressWarnings:unchecked

zipAll	back to summary
public static <T, U> Tree<Tuple2<T, U>> zipAll(Tree.Node<T> node, Iterator<? extends U> that, U thatElem) Annotations @SuppressWarnings:unchecked

pack-priv Interface TreeModule

Method Summary

Method Detail