Modifier and Type | Class and Description |
---|---|
static class |
Maps.Entry<K,V> |
static class |
Maps.HashEntry<K,V> |
Modifier and Type | Field and Description |
---|---|
static BiPredicate |
DEFAULT_EQUALS |
static ToLongFunction |
DEFAULT_HASH_CODE |
static BinaryOperator |
MERGE_LAST_WRITE_WINS |
Constructor and Description |
---|
Maps() |
Modifier and Type | Method and Description |
---|---|
static <T,K,V> Collector<T,Map<K,V>,Map<K,V>> |
collector(Function<T,K> keyFn,
Function<T,V> valFn) |
static <T,K,V> Collector<T,Map<K,V>,Map<K,V>> |
collector(Function<T,K> keyFn,
Function<T,V> valFn,
BinaryOperator<V> mergeFn) |
static <K,V> boolean |
equals(IMap<K,V> a,
IMap<K,V> b) |
static <K,V> boolean |
equals(IMap<K,V> a,
IMap<K,V> b,
BiPredicate<V,V> valEquals) |
static <K> boolean |
equivEquality(IMap<K,?> a,
IMap<K,?> b) |
static <K> boolean |
equivEquality(IMap<K,?> a,
ISet<K> b) |
static <K,V> IMap<K,V> |
from(ISet<K> keys,
Function<K,V> lookup) |
static <K,V> IMap<K,V> |
from(ISet<K> keys,
Function<K,V> lookup,
Supplier<Iterator<IEntry<K,V>>> iterator) |
static <K,V> ISortedMap<K,V> |
from(ISortedSet<K> keys,
Function<K,V> lookup) |
static <K,V> ISortedMap<K,V> |
from(ISortedSet<K> keys,
Function<K,V> lookup,
Supplier<Iterator<IEntry<K,V>>> iterator) |
static <K,V> long |
hash(IMap<K,V> m) |
static <K,V> long |
hash(IMap<K,V> m,
ToLongFunction<IEntry<K,V>> hash,
LongBinaryOperator combiner) |
static <T,K,V> Collector<T,LinearMap<K,V>,LinearMap<K,V>> |
linearCollector(Function<T,K> keyFn,
Function<T,V> valFn) |
static <T,K,V> Collector<T,LinearMap<K,V>,LinearMap<K,V>> |
linearCollector(Function<T,K> keyFn,
Function<T,V> valFn,
BinaryOperator<V> mergeFn,
int capacity) |
static <T,K,V> Collector<T,LinearMap<K,V>,LinearMap<K,V>> |
linearCollector(Function<T,K> keyFn,
Function<T,V> valFn,
int capacity) |
static <K,V> Map.Entry<K,V> |
toEntry(IEntry<K,V> entry) |
static <K,V> Map<K,V> |
toMap(IMap<K,V> map) |
static <K,V> String |
toString(IMap<K,V> m) |
static <K,V> String |
toString(IMap<K,V> m,
Function<K,String> keyPrinter,
Function<V,String> valPrinter) |
public static final BinaryOperator MERGE_LAST_WRITE_WINS
public static final ToLongFunction DEFAULT_HASH_CODE
public static final BiPredicate DEFAULT_EQUALS
public static <K,V> String toString(IMap<K,V> m, Function<K,String> keyPrinter, Function<V,String> valPrinter)
public static <K,V> long hash(IMap<K,V> m)
public static <K,V> long hash(IMap<K,V> m, ToLongFunction<IEntry<K,V>> hash, LongBinaryOperator combiner)
public static <K,V> boolean equals(IMap<K,V> a, IMap<K,V> b, BiPredicate<V,V> valEquals)
public static <K,V> ISortedMap<K,V> from(ISortedSet<K> keys, Function<K,V> lookup)
public static <K,V> ISortedMap<K,V> from(ISortedSet<K> keys, Function<K,V> lookup, Supplier<Iterator<IEntry<K,V>>> iterator)
public static <K,V> IMap<K,V> from(ISet<K> keys, Function<K,V> lookup, Supplier<Iterator<IEntry<K,V>>> iterator)
public static <T,K,V> Collector<T,LinearMap<K,V>,LinearMap<K,V>> linearCollector(Function<T,K> keyFn, Function<T,V> valFn, int capacity)
public static <T,K,V> Collector<T,LinearMap<K,V>,LinearMap<K,V>> linearCollector(Function<T,K> keyFn, Function<T,V> valFn)
public static <T,K,V> Collector<T,LinearMap<K,V>,LinearMap<K,V>> linearCollector(Function<T,K> keyFn, Function<T,V> valFn, BinaryOperator<V> mergeFn, int capacity)
public static <T,K,V> Collector<T,Map<K,V>,Map<K,V>> collector(Function<T,K> keyFn, Function<T,V> valFn)