Uses of Interface
io.vavr.collection.Traversable
-
Packages that use Traversable Package Description io.vavr BesideAPIthe 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>>
RValueModule. toTraversable(Value<T> value, R empty, java.util.function.Function<T,R> ofElement, java.util.function.Function<java.lang.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 classJavaConverters.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 interfaceBitSet<T>An immutableBitSetimplementation.interfaceIndexedSeq<T>Represents an immutable, indexed sequence of elements.interfaceIterator<T>A compositional alternative tojava.util.Iteratordesigned for single-pass traversal of a sequence.interfaceLinearSeq<T>Interface for immutable, linear sequences.interfaceList<T>An immutableListis an eager sequence of elements.interfaceMap<K,V>An immutableMapinterface.interfaceMultimap<K,V>An immutableMultimapinterface.interfaceSeq<T>Base interface for immutable, sequential collections.interfaceSet<T>An immutableSetinterface.interfaceSortedMap<K,V>An immutableSortedMapinterface.interfaceSortedMultimap<K,V>An immutableSortedMultimapinterface.interfaceSortedSet<T>An immutableSortedSetinterface.interfaceStream<T>An immutableStreamis lazy sequence of elements which may be infinitely long.interfaceTree<T>A general Tree interface.Classes in io.vavr.collection that implement Traversable Modifier and Type Class Description (package private) classAbstractIterator<T>Provides a commonObject.toString()implementation.(package private) classAbstractMultimap<K,V,M extends Multimap<K,V>>An abstract base implementation of theMultimapinterface that provides common functionality for concrete Multimap implementations.(package private) classAbstractQueue<T,Q extends AbstractQueue<T,Q>>classArray<T>Array is an immutable Traversable wrapper forObject[]containing elements of typeT.static classBitSetModule.AbstractBitSet<T>static classBitSetModule.BitSet1<T>static classBitSetModule.BitSet2<T>static classBitSetModule.BitSetIterator<T>static classBitSetModule.BitSetN<T>classCharSeqThe CharSeq (read: character sequence) collection essentially is a rich String wrapper having all operations we know from the functional Vavr collections.static classHashArrayMappedTrieModule.LeafNodeIterator<K,V>classHashMap<K,V>An immutableHashMapimplementation based on a Hash array mapped trie (HAMT).classHashMultimap<K,V>classHashSet<T>An immutableHashSetimplementation.static classIteratorModule.CachedIterator<T>static classIteratorModule.ConcatIterator<T>static classIteratorModule.DistinctIterator<T,U>static classIteratorModule.EmptyIteratorstatic classIteratorModule.GroupedIterator<T>classLinkedHashMap<K,V>An immutableLinkedHashMapimplementation that has predictable (insertion-order) iteration.classLinkedHashMultimap<K,V>ALinkedHashMap-based implementation ofMultimapclassLinkedHashSet<T>An immutableHashSetimplementation that has predictable (insertion-order) iteration.static classList.Cons<T>Non-emptyList, consisting of aheadand atail.static classList.Nil<T>Representation of the singleton emptyList.classPriorityQueue<T>A PriorityQueue.classQueue<T>An immutableQueuestores elements allowing a first-in-first-out (FIFO) retrieval.static classStream.Cons<T>Non-emptyStream, consisting of ahead, andtail.static classStream.Empty<T>The empty Stream.static classStreamModule.AppendElements<T>static classStreamModule.ConsImpl<T>static classStreamModule.FlatMapIterator<T,U>static classStreamModule.StreamIterator<T>static classTree.Empty<T>The empty tree.static classTree.Node<T>Represents a tree node.classTreeMap<K,V>An immutableSortedMapimplementation backed by a Red-Black tree.classTreeMultimap<K,V>classTreeSet<T>SortedSet implementation, backed by a Red/Black Tree.classVector<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 CJavaConverters.HasDelegate. delegateFields in io.vavr.collection with type parameters of type Traversable Modifier and Type Field Description private java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>>Multimap.ContainerType. addprivate java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>>Multimap.ContainerType. addprotected Map<K,Traversable<V>>AbstractMultimap. backThe backing map that stores the key-value pairs.protected AbstractMultimap.SerializableSupplier<Traversable<?>>AbstractMultimap. emptyContainerA supplier that creates empty containers for new key entries.private AbstractMultimap.SerializableSupplier<Traversable<?>>HashMultimap.Builder. emptyContainerprivate AbstractMultimap.SerializableSupplier<Traversable<?>>LinkedHashMultimap.Builder. emptyContainerprivate AbstractMultimap.SerializableSupplier<Traversable<?>>TreeMultimap.Builder. emptyContainerprivate java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>>Multimap.ContainerType. removeprivate java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>>Multimap.ContainerType. removeMethods in io.vavr.collection with type parameters of type Traversable Modifier and Type Method Description (package private) static <C extends Traversable<T>,T>
CCollections. fill(int n, java.util.function.Supplier<? extends T> s, C empty, java.util.function.Function<T[],C> of)(package private) static <C extends Traversable<T>,T>
CCollections. fillObject(int n, T element, @NonNull C empty, @NonNull java.util.function.Function<T[],C> of)(package private) static <C extends Traversable<T>,T>
Tuple2<C,C>Collections. partition(C collection, java.util.function.Function<java.lang.Iterable<T>,C> creator, java.util.function.Predicate<? super T> predicate)(package private) static <C extends Traversable<T>,T>
CCollections. reject(C source, java.util.function.Predicate<? super T> predicate)(package private) static <C extends Traversable<T>,T>
CCollections. removeAll(C source, java.lang.Iterable<? extends T> elements)(package private) static <C extends Traversable<T>,T>
CCollections. removeAll(C source, T element)(package private) static <C extends Traversable<T>,T>
CCollections. retainAll(C source, java.lang.Iterable<? extends T> elements)(package private) static <T,U,R extends Traversable<U>>
RCollections. scanLeft(Traversable<? extends T> source, U zero, java.util.function.BiFunction<? super U,? super T,? extends U> operation, java.util.function.Function<Iterator<U>,R> finisher)(package private) static <T,U,R extends Traversable<U>>
RCollections. scanRight(Traversable<? extends T> source, U zero, java.util.function.BiFunction<? super T,? super U,? extends U> operation, java.util.function.Function<Iterator<U>,R> finisher)(package private) static <C extends Traversable<T>,T>
CCollections. tabulate(int n, java.util.function.Function<? super java.lang.Integer,? extends T> f, C empty, java.util.function.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 aPartialFunctionto all elements that are defined for it and collects the results.Traversable<T>Traversable. distinct()Returns a newTraversablecontaining the elements of this instance with all duplicates removed.Traversable<T>Traversable. distinctBy(@NonNull java.util.Comparator<? super T> comparator)Returns a newTraversablecontaining the elements of this instance without duplicates, as determined by the givencomparator.<U> Traversable<T>Traversable. distinctBy(@NonNull java.util.function.Function<? super T,? extends U> keyExtractor)Returns a newTraversablecontaining the elements of this instance without duplicates, based on keys extracted from elements usingkeyExtractor.Traversable<T>Traversable. drop(int n)Returns a newTraversablewithout the firstnelements, or an empty instance if this contains fewer thannelements.Traversable<T>Traversable. dropRight(int n)Returns a newTraversablewithout the lastnelements, or an empty instance if this contains fewer thannelements.Traversable<T>Traversable. dropUntil(@NonNull java.util.function.Predicate<? super T> predicate)Returns a newTraversablestarting from the first element that satisfies the givenpredicate, dropping all preceding elements.Traversable<T>Traversable. dropWhile(@NonNull java.util.function.Predicate<? super T> predicate)Returns a newTraversablestarting from the first element that does not satisfy the givenpredicate, dropping all preceding elements.Traversable<T>Traversable. filter(@NonNull java.util.function.Predicate<? super T> predicate)Returns a new traversable containing only the elements that satisfy the given predicate.<U> Traversable<U>Traversable. flatMap(@NonNull java.util.function.Function<? super T,? extends java.lang.Iterable<? extends U>> mapper)Transforms each element of this Traversable into anIterableof 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 mapTraversable<T>Traversable. init()Returns all elements of this Traversable except the last one.<U> Traversable<U>Traversable. map(@NonNull java.util.function.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<java.lang.Void>Traversable. mapToVoid()static <T> Traversable<T>Traversable. narrow(Traversable<? extends T> traversable)Narrows aTraversable<? extends T>toTraversable<T>with a type-safe cast.Traversable<T>Traversable. orElse(@NonNull java.util.function.Supplier<? extends java.lang.Iterable<? extends T>> supplier)Returns thisTraversableif it is non-empty; otherwise, returns the result of evaluating the given supplier.Traversable<T>Traversable. orElse(java.lang.Iterable<? extends T> other)Returns thisTraversableif it is non-empty; otherwise, returns the given alternative.Traversable<T>Traversable. peek(@NonNull java.util.function.Consumer<? super T> action)default Traversable<T>Traversable. reject(@NonNull java.util.function.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 ofcurrentElementwithnewElement, if it exists.Traversable<T>Traversable. replaceAll(T currentElement, T newElement)Replaces all occurrences ofcurrentElementwithnewElement.Traversable<T>Traversable. retainAll(@NonNull java.lang.Iterable<? extends T> elements)Retains only the elements from this Traversable that are contained in the givenelements.default Traversable<T>Iterator. scan(T zero, @NonNull java.util.function.BiFunction<? super T,? super T,? extends T> operation)Traversable<T>Traversable. scan(T zero, @NonNull java.util.function.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 java.util.function.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 java.util.function.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 newTraversablewithout its first element.Traversable<T>Traversable. take(int n)Returns the firstnelements of thisTraversable, or all elements ifnexceeds the length.Traversable<T>Traversable. takeRight(int n)Returns the lastnelements of thisTraversable, or all elements ifnexceeds the length.Traversable<T>Traversable. takeUntil(@NonNull java.util.function.Predicate<? super T> predicate)Takes elements from thisTraversableuntil the given predicate holds for an element.Traversable<T>Traversable. takeWhile(@NonNull java.util.function.Predicate<? super T> predicate)Takes elements from thisTraversablewhile the given predicate holds.Traversable<V>AbstractMultimap. values()Traversable<V>Multimap. values()Returns aTraversablecontaining all the values of thisMultimap.<U> Traversable<Tuple2<T,U>>Traversable. zip(@NonNull java.lang.Iterable<? extends U> that)Returns aTraversableformed by pairing elements of thisTraversablewith elements of anotherIterable.<U> Traversable<Tuple2<T,U>>Traversable. zipAll(@NonNull java.lang.Iterable<? extends U> that, T thisElem, U thatElem)Returns aTraversableformed by pairing elements of thisTraversablewith elements of anotherIterable, filling in placeholder elements when one collection is shorter than the other.<U,R>
Traversable<R>Traversable. zipWith(@NonNull java.lang.Iterable<? extends U> that, java.util.function.BiFunction<? super T,? super U,? extends R> mapper)Returns aTraversableby combining elements of thisTraversablewith elements of anotherIterableusing a mapping function.Traversable<Tuple2<T,java.lang.Integer>>Traversable. zipWithIndex()Zips thisTraversablewith its indices, starting at 0.<U> Traversable<U>Traversable. zipWithIndex(@NonNull java.util.function.BiFunction<? super T,? super java.lang.Integer,? extends U> mapper)Zips thisTraversablewith 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 thisMultimapto aMapdefault PartialFunction<K,Traversable<V>>Multimap. asPartialFunction()Turns thisMultimapinto aPartialFunctionwhich is defined at a specific index, if thisMultimapcontains the given key.Option<Traversable<V>>AbstractMultimap. get(K key)Option<Traversable<V>>Multimap. get(K key)Returns theSomeof value to which the specified key is mapped, orNoneif this multimap contains no mapping for the key.<C> Map<C,? extends Traversable<T>>Traversable. groupBy(@NonNull java.util.function.Function<? super T,? extends C> classifier)Groups elements of thisTraversablebased on a classifier function.Iterator<? extends Traversable<T>>Traversable. grouped(int size)Splits thisTraversableinto 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 anOption.Tuple2<? extends Traversable<T>,? extends Traversable<T>>Traversable. partition(@NonNull java.util.function.Predicate<? super T> predicate)Splits thisTraversableinto two partitions according to a predicate.Tuple2<? extends Traversable<T>,? extends Traversable<T>>Traversable. partition(@NonNull java.util.function.Predicate<? super T> predicate)Splits thisTraversableinto two partitions according to a predicate.Iterator<? extends Traversable<T>>Traversable. slideBy(@NonNull java.util.function.Function<? super T,?> classifier)Partitions thisTraversableinto consecutive non-overlapping windows according to a classification function.Iterator<? extends Traversable<T>>Traversable. sliding(int size)Slides a window of a givensizeover thisTraversablewith a step size of 1.Iterator<? extends Traversable<T>>Traversable. sliding(int size, int step)Slides a window of a specificsizewith a givenstepover thisTraversable.Tuple2<? extends Traversable<T>,? extends Traversable<T>>Traversable. span(@NonNull java.util.function.Predicate<? super T> predicate)Splits thisTraversableinto a prefix and remainder according to the givenpredicate.Tuple2<? extends Traversable<T>,? extends Traversable<T>>Traversable. span(@NonNull java.util.function.Predicate<? super T> predicate)Splits thisTraversableinto a prefix and remainder according to the givenpredicate.default Option<? extends Traversable<T>>Traversable. tailOption()Returns a newTraversablewithout its first element as anOption.<T1,T2>
Tuple2<? extends Traversable<T1>,? extends Traversable<T2>>Traversable. unzip(@NonNull java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)Unzips the elements of thisTraversableby mapping each element to a pair and splitting them into two separateTraversablecollections.<T1,T2>
Tuple2<? extends Traversable<T1>,? extends Traversable<T2>>Traversable. unzip(@NonNull java.util.function.Function<? super T,Tuple2<? extends T1,? extends T2>> unzipper)Unzips the elements of thisTraversableby mapping each element to a pair and splitting them into two separateTraversablecollections.<T1,T2,T3>
Tuple3<? extends Traversable<T1>,? extends Traversable<T2>,? extends Traversable<T3>>Traversable. unzip3(@NonNull java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)Unzips the elements of thisTraversableby mapping each element to a triple and splitting them into three separateTraversablecollections.<T1,T2,T3>
Tuple3<? extends Traversable<T1>,? extends Traversable<T2>,? extends Traversable<T3>>Traversable. unzip3(@NonNull java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)Unzips the elements of thisTraversableby mapping each element to a triple and splitting them into three separateTraversablecollections.<T1,T2,T3>
Tuple3<? extends Traversable<T1>,? extends Traversable<T2>,? extends Traversable<T3>>Traversable. unzip3(@NonNull java.util.function.Function<? super T,Tuple3<? extends T1,? extends T2,? extends T3>> unzipper)Unzips the elements of thisTraversableby mapping each element to a triple and splitting them into three separateTraversablecollections.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 mapprivate static <T,C>
java.util.Set<java.util.Map.Entry<C,java.util.Collection<T>>>Collections. groupBy(Traversable<T> source, java.util.function.Function<? super T,? extends C> classifier)(package private) static <T,C,R extends java.lang.Iterable<T>>
Map<C,R>Collections. groupBy(Traversable<T> source, java.util.function.Function<? super T,? extends C> classifier, java.util.function.Function<? super java.lang.Iterable<T>,R> mapper)(package private) static <T> TCollections. last(Traversable<T> source)static <T> Traversable<T>Traversable. narrow(Traversable<? extends T> traversable)Narrows aTraversable<? extends T>toTraversable<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>>
RCollections. scanLeft(Traversable<? extends T> source, U zero, java.util.function.BiFunction<? super U,? super T,? extends U> operation, java.util.function.Function<Iterator<U>,R> finisher)(package private) static <T,U,R extends Traversable<U>>
RCollections. scanRight(Traversable<? extends T> source, U zero, java.util.function.BiFunction<? super T,? super U,? extends U> operation, java.util.function.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>
MAbstractMultimap. merge(@NonNull Multimap<K2,V2> that, @NonNull java.util.function.BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)<K2 extends K,V2 extends V>
MAbstractMultimap. merge(@NonNull Multimap<K2,V2> that, @NonNull java.util.function.BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)<K2 extends K,V2 extends V>
MAbstractMultimap. merge(@NonNull Multimap<K2,V2> that, @NonNull java.util.function.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 java.util.function.BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)Creates a new multimap which by merging the entries ofthismultimap andthatmultimap.<K2 extends K,V2 extends V>
Multimap<K,V>Multimap. merge(@NonNull Multimap<K2,V2> that, @NonNull java.util.function.BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)Creates a new multimap which by merging the entries ofthismultimap andthatmultimap.<K2 extends K,V2 extends V>
Multimap<K,V>Multimap. merge(@NonNull Multimap<K2,V2> that, @NonNull java.util.function.BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)Creates a new multimap which by merging the entries ofthismultimap andthatmultimap.<K2 extends K,V2 extends V>
SortedMultimap<K,V>SortedMultimap. merge(@NonNull Multimap<K2,V2> that, @NonNull java.util.function.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 java.util.function.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 java.util.function.BiFunction<Traversable<V>,Traversable<V2>,Traversable<V>> collisionResolution)(package private) static <K,V,M extends Map<K,V>>
MMaps. scan(M map, Tuple2<K,V> zero, java.util.function.BiFunction<? super Tuple2<K,V>,? super Tuple2<K,V>,? extends Tuple2<K,V>> operation, java.util.function.Function<Iterator<Tuple2<K,V>>,Traversable<Tuple2<K,V>>> finisher)Constructor parameters in io.vavr.collection with type arguments of type Traversable Constructor Description 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.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.Builder(Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)Builder(Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)Builder(Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)ContainerType(java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>> add, java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>> remove, java.util.function.Supplier<java.util.Collection<?>> instantiate)ContainerType(java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>> add, java.util.function.BiFunction<Traversable<?>,java.lang.Object,Traversable<?>> remove, java.util.function.Supplier<java.util.Collection<?>> instantiate)HashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)HashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)LinkedHashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)LinkedHashMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)TreeMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)TreeMultimap(Map<K,Traversable<V>> back, Multimap.ContainerType containerType, AbstractMultimap.SerializableSupplier<Traversable<?>> emptyContainer)
-