Uses of Interface
io.vavr.collection.Map
Packages that use Map
Package
Description
Beside
API the io.vavr package contains core types like (Checked)Functions and Tuples.Purely functional collections based on Traversable.
-
Uses of Map in io.vavr
Modifier and TypeMethodDescriptionstatic <K,V> Map <K, V> API.LinkedMap()Alias forLinkedHashMap.empty()static <K,V> Map <K, V> Deprecated.Will be removed in a future version.static <K,V> Map <K, V> API.LinkedMap(K k1, V v1) Alias forLinkedHashMap.of(Object, Object)static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7, K k8, V v8) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7, K k8, V v8, K k9, V v9) static <K,V> Map <K, V> API.LinkedMap(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7, K k8, V v8, K k9, V v9, K k10, V v10) static <K,V> Map <K, V> API.Map()Alias forHashMap.empty()static <K,V> Map <K, V> Deprecated.Will be removed in a future version.static <K,V> Map <K, V> API.Map(K k1, V v1) Alias forHashMap.of(Object, Object)static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7, K k8, V v8) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7, K k8, V v8, K k9, V v9) static <K,V> Map <K, V> API.Map(K k1, V v1, K k2, V v2, K k3, V v3, K k4, V v4, K k5, V v5, K k6, V v6, K k7, V v7, K k8, V v8, K k9, V v9, K k10, V v10) default <K,V> Map <K, V> Value.toLinkedMap(Function<? super T, ? extends Tuple2<? extends K, ? extends V>> f) Converts this to aMap.default <K,V> Map <K, V> Value.toLinkedMap(Function<? super T, ? extends K> keyMapper, Function<? super T, ? extends V> valueMapper) Converts this to aMap.default <K,V> Map <K, V> Converts this to aMap.default <K,V> Map <K, V> Value.toMap(Function<? super T, ? extends K> keyMapper, Function<? super T, ? extends V> valueMapper) Converts this to aMap. -
Uses of Map in io.vavr.collection
Subinterfaces of Map in io.vavr.collectionClasses in io.vavr.collection that implement MapModifier and TypeClassDescriptionfinal classHashMap<K,V> An immutableHashMapimplementation based on a Hash array mapped trie (HAMT).final classLinkedHashMap<K,V> An immutableLinkedHashMapimplementation that has predictable (insertion-order) iteration.final classTreeMap<K,V> SortedMap implementation, backed by a Red/Black Tree.Fields in io.vavr.collection declared as MapModifier and TypeFieldDescriptionprotected final Map<K, Traversable<V>> AbstractMultimap.backprotected final Map<K, Traversable<V>> AbstractMultimap.backprotected final Map<K, Traversable<V>> AbstractMultimap.backMethods in io.vavr.collection that return MapModifier and TypeMethodDescriptionMap<K, Traversable<V>> Multimap.asMap()Converts thisMultimapto aMap<K2,V2> Map <K2, V2> Map.bimap(Function<? super K, ? extends K2> keyMapper, Function<? super V, ? extends V2> valueMapper) Maps thisMapto a newMapwith different component type by applying a function to its elements.Map.distinct()Map.distinctBy(Comparator<? super Tuple2<K, V>> comparator) Map.distinctBy(Function<? super Tuple2<K, V>, ? extends U> keyExtractor) Map.drop(int n) Map.dropRight(int n) protected <K2,V2> Map <K2, V2> HashMultimap.emptyMapSupplier()protected <K2,V2> Map <K2, V2> LinkedHashMultimap.emptyMapSupplier()protected <K2,V2> Map <K2, V2> TreeMultimap.emptyMapSupplier()Map.filter(BiPredicate<? super K, ? super V> predicate) Returns a new Map consisting of all elements which satisfy the given predicate.Map.filterKeys(Predicate<? super K> predicate) Returns a new Map consisting of all elements with keys which satisfy the given predicate.Map.filterValues(Predicate<? super V> predicate) Returns a new Map consisting of all elements with values which satisfy the given predicate.<K2,V2> Map <K2, V2> FlatMaps thisMapto a newMapwith different component type.<C> Map<C, ? extends IndexedSeq<T>> <C> Map<C, LinkedHashMap<K, V>> <C> Map<C, LinkedHashSet<T>> <C> Map<C, ? extends PriorityQueue<T>> <C> Map<C, ? extends SortedMultimap<K, V>> <C> Map<C, ? extends Traversable<T>> Groups this elements by classifying the elements.Map.init()<K2,V2> Map <K2, V2> Map.map(BiFunction<? super K, ? super V, Tuple2<K2, V2>> mapper) Maps the entries of thisMapto form a newMap.Maps the keys of thisMapwhile preserving the corresponding values.Map.mapKeys(Function<? super K, ? extends K2> keyMapper, BiFunction<? super V, ? super V, ? extends V> valueMerge) Maps the keys of thisMapwhile preserving the corresponding values and applying a value merge function on collisions.Maps the values of thisMapwhile preserving the corresponding keys.Creates a new map which by merging the entries ofthismap andthatmap.Map.merge(Map<? extends K, U> that, BiFunction<? super V, ? super U, ? extends V> collisionResolution) Creates a new map which by merging the entries ofthismap andthatmap.static <K,V> Map <K, V> Narrows a widenedMap<? extends K, ? extends V>toMap<K, V>by performing a type-safe cast.Convenience method forput(entry._1, entry._2).Convenience method forput(entry._1, entry._2, merge).Map.put(K key, U value, BiFunction<? super V, ? super U, ? extends V> merge) Associates the specified value with the specified key in this map.Associates the specified value with the specified key in this map.Map.reject(BiPredicate<? super K, ? super V> predicate) Returns a new Map consisting of all elements which do not satisfy the given predicate.Map.rejectKeys(Predicate<? super K> predicate) Returns a new Map consisting of all elements with keys which do not satisfy the given predicate.Map.rejectValues(Predicate<? super V> predicate) Returns a new Map consisting of all elements with values which do not satisfy the given predicate.Removes the mapping for a key from this map if it is present.Removes the mapping for a key from this map if it is present.Map.removeAll(BiPredicate<? super K, ? super V> predicate) Deprecated.Please useMap.reject(BiPredicate)Map.removeKeys(Predicate<? super K> predicate) Deprecated.Please useMap.rejectKeys(Predicate)Map.removeValues(Predicate<? super V> predicate) Deprecated.Please useMap.rejectValues(Predicate)Replaces the entry for the specified key only if currently mapped to the specified value.Map.replaceAll(BiFunction<? super K, ? super V, ? extends V> function) Replaces each entry's value with the result of invoking the given function on that entry until all entries have been processed or the function throws an exception.Map.replaceValue(K key, V value) Replaces the entry for the specified key only if it is currently mapped to some value.Map.scan(Tuple2<K, V> zero, BiFunction<? super Tuple2<K, V>, ? super Tuple2<K, V>, ? extends Tuple2<K, V>> operation) Map.tail()Map.take(int n) Map.takeRight(int n) Methods in io.vavr.collection that return types with arguments of type MapModifier and TypeMethodDescriptionMatches each element with a unique key that you extract from it.Map.computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.Map.computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.Map.grouped(int size) Map.initOption()Map.sliding(int size) Map.sliding(int size, int step) Map.tailOption()Methods in io.vavr.collection with parameters of type MapModifier and TypeMethodDescriptionprotected <K2,V2> HashMultimap <K2, V2> HashMultimap.createFromMap(Map<K2, Traversable<V2>> back) protected <K2,V2> LinkedHashMultimap <K2, V2> LinkedHashMultimap.createFromMap(Map<K2, Traversable<V2>> back) protected <K2,V2> TreeMultimap <K2, V2> TreeMultimap.createFromMap(Map<K2, Traversable<V2>> back) HashMap.merge(Map<? extends K, U> that, BiFunction<? super V, ? super U, ? extends V> collisionResolution) <U extends V>
LinkedHashMap<K, V> LinkedHashMap.merge(Map<? extends K, U> that, BiFunction<? super V, ? super U, ? extends V> collisionResolution) Creates a new map which by merging the entries ofthismap andthatmap.Map.merge(Map<? extends K, U> that, BiFunction<? super V, ? super U, ? extends V> collisionResolution) Creates a new map which by merging the entries ofthismap andthatmap.SortedMap.merge(Map<? extends K, U> that, BiFunction<? super V, ? super U, ? extends V> collisionResolution) TreeMap.merge(Map<? extends K, U> that, BiFunction<? super V, ? super U, ? extends V> collisionResolution) static <K,V> Map <K, V> Narrows a widenedMap<? extends K, ? extends V>toMap<K, V>by performing a type-safe cast.Method parameters in io.vavr.collection with type arguments of type Map