Uses of Interface
io.vavr.collection.Traversable

Packages that use Traversable

Package	Description
io.vavr	Beside API the io.vavr package contains core types like (Checked)Functions and Tuples.
io.vavr.collection	Purely functional collections based on Traversable.

Uses of Traversable in io.vavr

Methods in io.vavr with type parameters of type Traversable

Modifier and Type	Method	Description
static <T, R extends Traversable<T>> R	ValueModule.toTraversable(Value<T> value, R empty, Function<T,R> ofElement, Function<Iterable<T>,R> ofAll)

Uses of Traversable in io.vavr.collection

Classes in io.vavr.collection with type parameters of type Traversable

Modifier and Type	Class	Description
private static class	JavaConverters.HasDelegate<C extends Traversable<?>>	Encapsulates the access to delegate and performs mutability checks.

Subinterfaces of Traversable in io.vavr.collection

Modifier and Type	Interface	Description
interface	BitSet<T>	An immutable BitSet implementation.
interface	IndexedSeq<T>	Represents an immutable, indexed sequence of elements.
interface	Iterator<T>	A compositional alternative to java.util.Iterator designed for single-pass traversal of a sequence.
interface	LinearSeq<T>	Interface for immutable, linear sequences.
interface	List<T>	An immutable List is an eager sequence of elements.
interface	Map<K,V>	An immutable Map interface.
interface	Multimap<K,V>	An immutable Multimap interface.
interface	Seq<T>	Base interface for immutable, sequential collections.
interface	Set<T>	An immutable Set interface.
interface	SortedMap<K,V>	An immutable SortedMap interface.
interface	SortedMultimap<K,V>	An immutable SortedMultimap interface.
interface	SortedSet<T>	An immutable SortedSet interface.
interface	Stream<T>	An immutable Stream is lazy sequence of elements which may be infinitely long.
interface	Tree<T>	A general Tree interface.

Classes in io.vavr.collection that implement Traversable

Modifier and Type	Class	Description
(package private) class	AbstractIterator<T>	Provides a common Object.toString() implementation.
(package private) class	AbstractMultimap<K,V,M extends Multimap<K,V>>	An abstract base implementation of the Multimap interface that provides common functionality for concrete Multimap implementations.
(package private) class	AbstractQueue<T,Q extends AbstractQueue<T,Q>>
final class	Array<T>	Array is an immutable Traversable wrapper for Object[] containing elements of type T.
static class	BitSetModule.AbstractBitSet<T>
static class	BitSetModule.BitSet1<T>
static class	BitSetModule.BitSet2<T>
static class	BitSetModule.BitSetIterator<T>
static class	BitSetModule.BitSetN<T>
final class	CharSeq	The CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.
static class	HashArrayMappedTrieModule.LeafNodeIterator<K,V>
final class	HashMap<K,V>	An immutable HashMap implementation based on a Hash array mapped trie (HAMT).
final class	HashMultimap<K,V>	A HashMap-based implementation of Multimap
final class	HashSet<T>	An immutable HashSet implementation.
static final class	IteratorModule.CachedIterator<T>
static final class	IteratorModule.ConcatIterator<T>
static final class	IteratorModule.DistinctIterator<T,U>
static final class	IteratorModule.EmptyIterator
static final class	IteratorModule.GroupedIterator<T>
final class	LinkedHashMap<K,V>	An immutable LinkedHashMap implementation that has predictable (insertion-order) iteration.
final class	LinkedHashMultimap<K,V>	A LinkedHashMap-based implementation of Multimap
final class	LinkedHashSet<T>	An immutable HashSet implementation that has predictable (insertion-order) iteration.
static final class	List.Cons<T>	Non-empty List, consisting of a head and a tail.
static final class	List.Nil<T>	Representation of the singleton empty List.
final class	PriorityQueue<T>	A PriorityQueue.
final class	Queue<T>	An immutable Queue stores elements allowing a first-in-first-out (FIFO) retrieval.
static class	Stream.Cons<T>	Non-empty Stream, consisting of a head, and tail.
static final class	Stream.Empty<T>	The empty Stream.
static final class	StreamModule.AppendElements<T>
static final class	StreamModule.ConsImpl<T>
static final class	StreamModule.FlatMapIterator<T,U>
static final class	StreamModule.StreamIterator<T>
static final class	Tree.Empty<T>	The empty tree.
static final class	Tree.Node<T>	Represents a tree node.
final class	TreeMap<K,V>	An immutable SortedMap implementation backed by a Red-Black tree.
final class	TreeMultimap<K,V>	A TreeMap-based implementation of Multimap
final class	TreeSet<T>	SortedSet implementation, backed by a Red/Black Tree.
final class	Vector<T>	Vector is the default Seq implementation that provides effectively constant time access to any element.

Fields in io.vavr.collection declared as Traversable

Modifier and Type	Field	Description
private C	JavaConverters.HasDelegate.delegate

Fields in io.vavr.collection with type parameters of type Traversable

Modifier and Type	Field	Description
private final BiFunction<Traversable<?>,Object,Traversable<?>>	Multimap.ContainerType.add
private final BiFunction<Traversable<?>,Object,Traversable<?>>	Multimap.ContainerType.add
protected final Map<K,Traversable<V>>	AbstractMultimap.back	The backing map that stores the key-value pairs.
protected final AbstractMultimap.SerializableSupplier<Traversable<?>>	AbstractMultimap.emptyContainer	A supplier that creates empty containers for new key entries.
private final AbstractMultimap.SerializableSupplier<Traversable<?>>	HashMultimap.Builder.emptyContainer
private final AbstractMultimap.SerializableSupplier<Traversable<?>>	LinkedHashMultimap.Builder.emptyContainer
private final AbstractMultimap.SerializableSupplier<Traversable<?>>	TreeMultimap.Builder.emptyContainer
private final BiFunction<Traversable<?>,Object,Traversable<?>>	Multimap.ContainerType.remove
private final BiFunction<Traversable<?>,Object,Traversable<?>>	Multimap.ContainerType.remove

Methods in io.vavr.collection with type parameters of type Traversable

Modifier and Type	Method	Description
(package private) static <C extends Traversable<T>, T> C	Collections.fill(int n, Supplier<? extends T> s, C empty, Function<T[],C> of)
(package private) static <C extends Traversable<T>, T> C	Collections.fillObject(int n, T element, @NonNull C empty, @NonNull Function<T[],C> of)
(package private) static <C extends Traversable<T>, T> Tuple2<C,C>	Collections.partition(C collection, Function<Iterable<T>,C> creator, Predicate<? super T> predicate)
(package private) static <C extends Traversable<T>, T> C	Collections.reject(C source, Predicate<? super T> predicate)
(package private) static <C extends Traversable<T>, T> C	Collections.removeAll(C source, Iterable<? extends T> elements)
(package private) static <C extends Traversable<T>, T> C	Collections.removeAll(C source, T element)
(package private) static <C extends Traversable<T>, T> C	Collections.retainAll(C source, Iterable<? extends T> elements)
(package private) static <T, U, R extends Traversable<U>> R	Collections.scanLeft(Traversable<? extends T> source, U zero, BiFunction<? super U,? super T,? extends U> operation, Function<Iterator<U>,R> finisher)
(package private) static <T, U, R extends Traversable<U>> R	Collections.scanRight(Traversable<? extends T> source, U zero, BiFunction<? super T,? super U,? extends U> operation, Function<Iterator<U>,R> finisher)
(package private) static <C extends Traversable<T>, T> C	Collections.tabulate(int n, Function<? super Integer,? extends T> f, C empty, Function<T[],C> of)

Methods in io.vavr.collection that return Traversable

Modifier and Type	Method	Description
(package private) <T> Traversable<T>	Multimap.ContainerType.add(Traversable<?> container, T elem)
default Traversable<V>	Multimap.apply(K key)	Deprecated.
<R> Traversable<R>	Traversable.collect(@NonNull PartialFunction<? super T,? extends R> partialFunction)	Applies a PartialFunction to all elements that are defined for it and collects the results.
Traversable<T>	Traversable.distinct()	Returns a new Traversable containing the elements of this instance with all duplicates removed.
Traversable<T>	Traversable.distinctBy(@NonNull Comparator<? super T> comparator)	Returns a new Traversable containing the elements of this instance without duplicates, as determined by the given comparator.
<U> Traversable<T>	Traversable.distinctBy(@NonNull Function<? super T,? extends U> keyExtractor)	Returns a new Traversable containing the elements of this instance without duplicates, based on keys extracted from elements using keyExtractor.
Traversable<T>	Traversable.drop(int n)	Returns a new Traversable without the first n elements, or an empty instance if this contains fewer than n elements.
Traversable<T>	Traversable.dropRight(int n)	Returns a new Traversable without the last n elements, or an empty instance if this contains fewer than n elements.
Traversable<T>	Traversable.dropUntil(@NonNull Predicate<? super T> predicate)	Returns a new Traversable starting from the first element that satisfies the given predicate, dropping all preceding elements.
Traversable<T>	Traversable.dropWhile(@NonNull Predicate<? super T> predicate)	Returns a new Traversable starting from the first element that does not satisfy the given predicate, dropping all preceding elements.
Traversable<T>	Traversable.filter(@NonNull Predicate<? super T> predicate)	Returns a new traversable containing only the elements that satisfy the given predicate.
<U> Traversable<U>	Traversable.flatMap(@NonNull Function<? super T,? extends Iterable<? extends U>> mapper)	Transforms each element of this Traversable into an Iterable of elements and flattens the resulting iterables into a single Traversable.
Traversable<V>	AbstractMultimap.getOrElse(K key, Traversable<? extends V> defaultValue)
Traversable<V>	Multimap.getOrElse(K key, Traversable<? extends V> defaultValue)	Returns the value associated with a key, or a default value if the key is not contained in the map
Traversable<T>	Traversable.init()	Returns all elements of this Traversable except the last one.
<U> Traversable<U>	Traversable.map(@NonNull Function<? super T,? extends U> mapper)	Transforms the elements of this Traversable to a new type, preserving order if defined.
default <U> Traversable<U>	Traversable.mapTo(U value)
default Traversable<Void>	Traversable.mapToVoid()
static <T> Traversable<T>	Traversable.narrow(Traversable<? extends T> traversable)	Narrows a Traversable<? extends T> to Traversable<T> with a type-safe cast.
Traversable<T>	Traversable.orElse(Iterable<? extends T> other)	Returns this Traversable if it is non-empty; otherwise, returns the given alternative.
Traversable<T>	Traversable.orElse(@NonNull Supplier<? extends Iterable<? extends T>> supplier)	Returns this Traversable if it is non-empty; otherwise, returns the result of evaluating the given supplier.
Traversable<T>	Traversable.peek(@NonNull Consumer<? super T> action)
default Traversable<T>	Traversable.reject(@NonNull Predicate<? super T> predicate)	Returns a new traversable containing only the elements that do not satisfy the given predicate.
(package private) <T> Traversable<T>	Multimap.ContainerType.remove(Traversable<?> container, T elem)
Traversable<T>	Traversable.replace(T currentElement, T newElement)	Replaces the first occurrence of currentElement with newElement, if it exists.
Traversable<T>	Traversable.replaceAll(T currentElement, T newElement)	Replaces all occurrences of currentElement with newElement.
Traversable<T>	Traversable.retainAll(@NonNull Iterable<? extends T> elements)	Retains only the elements from this Traversable that are contained in the given elements.
default Traversable<T>	Iterator.scan(T zero, @NonNull BiFunction<? super T,? super T,? extends T> operation)
Traversable<T>	Traversable.scan(T zero, @NonNull BiFunction<? super T,? super T,? extends T> operation)	Computes a prefix scan of the elements of this Traversable.
<U> Traversable<U>	Traversable.scanLeft(U zero, @NonNull BiFunction<? super U,? super T,? extends U> operation)	Produces a collection containing cumulative results of applying the operator from left to right.
<U> Traversable<U>	Traversable.scanRight(U zero, @NonNull BiFunction<? super T,? super U,? extends U> operation)	Produces a collection containing cumulative results of applying the operator from right to left.
Traversable<T>	Traversable.tail()	Returns a new Traversable without its first element.
Traversable<T>	Traversable.take(int n)	Returns the first n elements of this Traversable, or all elements if n exceeds the length.
Traversable<T>	Traversable.takeRight(int n)	Returns the last n elements of this Traversable, or all elements if n exceeds the length.
Traversable<T>	Traversable.takeUntil(@NonNull Predicate<? super T> predicate)	Takes elements from this Traversable until the given predicate holds for an element.
Traversable<T>	Traversable.takeWhile(@NonNull Predicate<? super T> predicate)	Takes elements from this Traversable while the given predicate holds.
Traversable<V>	AbstractMultimap.values()
Traversable<V>	Multimap.values()	Returns a Traversable containing all the values of this Multimap.
<U> Traversable<Tuple2<T,U>>	Traversable.zip(@NonNull Iterable<? extends U> that)	Returns a Traversable formed by pairing elements of this Traversable with elements of another Iterable.
<U> Traversable<Tuple2<T,U>>	Traversable.zipAll(@NonNull Iterable<? extends U> that, T thisElem, U thatElem)	Returns a Traversable formed by pairing elements of this Traversable with elements of another Iterable, filling in placeholder elements when one collection is shorter than the other.
<U, R> Traversable<R>	Traversable.zipWith(@NonNull Iterable<? extends U> that, BiFunction<? super T,? super U,? extends R> mapper)	Returns a Traversable by combining elements of this Traversable with elements of another Iterable using a mapping function.
Traversable<Tuple2<T,Integer>>	Traversable.zipWithIndex()	Zips this Traversable with its indices, starting at 0.
<U> Traversable<U>	Traversable.zipWithIndex(@NonNull BiFunction<? super T,? super Integer,? extends U> mapper)	Zips this Traversable with its indices and maps the resulting pairs using the provided mapper.

Methods in io.vavr.collection that return types with arguments of type Traversable

Modifier and Type	Method	Description
Map<K,Traversable<V>>	AbstractMultimap.asMap()
Map<K,Traversable<V>>	Multimap.asMap()	Converts this Multimap to a Map
default PartialFunction<K,Traversable<V>>	Multimap.asPartialFunction()	Turns this Multimap into a PartialFunction which is defined at a specific index, if this Multimap contains the given key.
Option<Traversable<V>>	AbstractMultimap.get(K key)
Option<Traversable<V>>	Multimap.get(K key)	Returns the Some of value to which the specified key is mapped, or None if this multimap contains no mapping for the key.
<C> Map<C,? extends Traversable<T>>	Traversable.groupBy(@NonNull Function<? super T,? extends C> classifier)	Groups elements of this Traversable based on a classifier function.
Iterator<? extends Traversable<T>>	Traversable.grouped(int size)	Splits this Traversable into consecutive blocks of the given size.
default Option<? extends Traversable<T>>	Traversable.initOption()	Returns all elements of this Traversable except the last one, wrapped in an Option.
Tuple2<? extends Traversable<T>,? extends Traversable<T>>	Traversable.partition(@NonNull Predicate<? super T> predicate)	Splits this Traversable into two partitions according to a predicate.
Tuple2<? extends Traversable<T>,? extends Traversable<T>>	Traversable.partition(@NonNull Predicate<? super T> predicate)	Splits this Traversable into two partitions according to a predicate.
Iterator<? extends Traversable<T>>	Traversable.slideBy(@NonNull Function<? super T,?> classifier)	Partitions this Traversable into consecutive non-overlapping windows according to a classification function.
Iterator<? extends Traversable<T>>	Traversable.sliding(int size)	Slides a window of a given size over this Traversable with a step size of 1.
Iterator<? extends Traversable<T>>	Traversable.sliding(int size, int step)	Slides a window of a specific size with a given step over this Traversable.
Tuple2<? extends Traversable<T>,? extends Traversable<T>>	Traversable.span(@NonNull Predicate<? super T> predicate)	Splits this Traversable into a prefix and remainder according to the given predicate.
Tuple2<? extends Traversable<T>,? extends Traversable<T>>	Traversable.span(@NonNull Predicate<? super T> predicate)	Splits this Traversable into a prefix and remainder according to the given predicate.
default Option<? extends Traversable<T>>	Traversable.tailOption()	Returns a new Traversable without its first element as an Option.
<T1, T2> Tuple2<? extends Traversable<T1>,? extends Traversable<T2>>	Traversable.unzip(@NonNull Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)	Unzips the elements of this Traversable by mapping each element to a pair and splitting them into two separate Traversable collections.
<T1, T2> Tuple2<? extends Traversable<T1>,? extends Traversable<T2>>	Traversable.unzip(@NonNull Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)	Unzips the elements of this Traversable by mapping each element to a pair and splitting them into two separate Traversable collections.
<T1, T2, T3> Tuple3<? extends Traversable<T1>,? extends Traversable<T2>,? extends Traversable<T3>>	Traversable.unzip3(@NonNull Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)	Unzips the elements of this Traversable by mapping each element to a triple and splitting them into three separate Traversable collections.
<T1, T2, T3> Tuple3<? extends Traversable<T1>,? extends Traversable<T2>,? extends Traversable<T3>>	Traversable.unzip3(@NonNull Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)	Unzips the elements of this Traversable by mapping each element to a triple and splitting them into three separate Traversable collections.
<T1, T2, T3> Tuple3<? extends Traversable<T1>,? extends Traversable<T2>,? extends Traversable<T3>>	Traversable.unzip3(@NonNull Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)	Unzips the elements of this Traversable by mapping each element to a triple and splitting them into three separate Traversable collections.

Methods in io.vavr.collection with parameters of type Traversable

Modifier and Type	Method	Description
(package private) <T> Traversable<T>	Multimap.ContainerType.add(Traversable<?> container, T elem)
Traversable<V>	AbstractMultimap.getOrElse(K key, Traversable<? extends V> defaultValue)
Traversable<V>	Multimap.getOrElse(K key, Traversable<? extends V> defaultValue)	Returns the value associated with a key, or a default value if the key is not contained in the map
private static <T, C> Set<Map.Entry<C,Collection<T>>>	Collections.groupBy(Traversable<T> source, Function<? super T,? extends C> classifier)
(package private) static <T, C, R extends Iterable<T>> Map<C,R>	Collections.groupBy(Traversable<T> source, Function<? super T,? extends C> classifier, Function<? super Iterable<T>,R> mapper)
(package private) static <T> T	Collections.last(Traversable<T> source)
static <T> Traversable<T>	Traversable.narrow(Traversable<? extends T> traversable)	Narrows a Traversable<? extends T> to Traversable<T> with a type-safe cast.
(package private) <T> Traversable<T>	Multimap.ContainerType.remove(Traversable<?> container, T elem)
(package private) static <T, U, R extends Traversable<U>> R	Collections.scanLeft(Traversable<? extends T> source, U zero, BiFunction<? super U,? super T,? extends U> operation, Function<Iterator<U>,R> finisher)
(package private) static <T, U, R extends Traversable<U>> R	Collections.scanRight(Traversable<? extends T> source, U zero, BiFunction<? super T,? super U,? extends U> operation, Function<Iterator<U>,R> finisher)

Method parameters in io.vavr.collection with type arguments of type Traversable

Modifier and Type	Method	Description
protected abstract <K2, V2> Multimap<K2,V2>	AbstractMultimap.createFromMap(Map<K2,Traversable<V2>> back)	Creates a new Multimap instance from the given backing map.
protected <K2, V2> HashMultimap<K2,V2>	HashMultimap.createFromMap(Map<K2,Traversable<V2>> back)
protected <K2, V2> LinkedHashMultimap<K2,V2>	LinkedHashMultimap.createFromMap(@NonNull Map<K2,Traversable<V2>> back)
protected <K2, V2> TreeMultimap<K2,V2>	TreeMultimap.createFromMap(@NonNull Map<K2,Traversable<V2>> back)
<K2 extends K, V2 extends V> M	AbstractMultimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)
<K2 extends K, V2 extends V> M	AbstractMultimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)
<K2 extends K, V2 extends V> M	AbstractMultimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)
<K2 extends K, V2 extends V> Multimap<K,V>	Multimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)	Creates a new multimap which by merging the entries of this multimap and that multimap.
<K2 extends K, V2 extends V> Multimap<K,V>	Multimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)	Creates a new multimap which by merging the entries of this multimap and that multimap.
<K2 extends K, V2 extends V> Multimap<K,V>	Multimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)	Creates a new multimap which by merging the entries of this multimap and that multimap.
<K2 extends K, V2 extends V> SortedMultimap<K,V>	SortedMultimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)
<K2 extends K, V2 extends V> SortedMultimap<K,V>	SortedMultimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)
<K2 extends K, V2 extends V> SortedMultimap<K,V>	SortedMultimap.merge(@NonNull Multimap<K2,V2> that, @NonNull BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)
(package private) static <K, V, M extends Map<K, V>> M	Maps.scan(M map, Tuple2<K,V> zero, BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)

Constructor parameters in io.vavr.collection with type arguments of type Traversable

Modifier	Constructor	Description
(package private)	AbstractMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)	Creates a new AbstractMultimap with the specified backing map, container type, and empty container supplier.
(package private)	AbstractMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)	Creates a new AbstractMultimap with the specified backing map, container type, and empty container supplier.
private	Builder(Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	Builder(Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	Builder(Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	ContainerType(BiFunction<Traversable<?>,Object,Traversable<?>> add, BiFunction<Traversable<?>,Object,Traversable<?>> remove, Supplier<Collection<?>> instantiate)
private	ContainerType(BiFunction<Traversable<?>,Object,Traversable<?>> add, BiFunction<Traversable<?>,Object,Traversable<?>> remove, Supplier<Collection<?>> instantiate)
private	HashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	HashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	LinkedHashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	LinkedHashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	TreeMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
private	TreeMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)