Package io.microsphere.collection
Class MapUtils
- java.lang.Object
-
- io.microsphere.collection.MapUtils
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
MapUtils.ImmutableEntry<K,V>
-
Field Summary
Fields Modifier and Type Field Description protected static float
FIXED_LOAD_FACTOR
The fixed load factor forHashMap
orHashtable
= 1.00static float
MIN_LOAD_FACTOR
The min load factor forHashMap
orHashtable
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static <K,V>
java.util.Map.Entry<K,V>immutableEntry(K key, V value)
static boolean
isEmpty(java.util.Map<?,?> map)
static boolean
isNotEmpty(java.util.Map<?,?> map)
static <K,V>
java.util.concurrent.ConcurrentHashMap<K,V>newConcurrentHashMap()
static <K,V>
java.util.concurrent.ConcurrentHashMap<K,V>newConcurrentHashMap(int initialCapacity)
static <K,V>
java.util.concurrent.ConcurrentHashMap<K,V>newConcurrentHashMap(int initialCapacity, float loadFactor)
static <K,V>
java.util.concurrent.ConcurrentHashMap<K,V>newConcurrentHashMap(java.util.Map<? extends K,? extends V> map)
static <K,V>
java.util.Map<K,V>newFixedHashMap(int size)
static <K,V>
java.util.Map<K,V>newFixedLinkedHashMap(int size)
static <K,V>
java.util.HashMap<K,V>newHashMap()
static <K,V>
java.util.HashMap<K,V>newHashMap(int initialCapacity)
static <K,V>
java.util.HashMap<K,V>newHashMap(int initialCapacity, float loadFactor)
static <K,V>
java.util.HashMap<K,V>newHashMap(java.util.Map<? extends K,? extends V> map)
static <K,V>
java.util.LinkedHashMap<K,V>newLinkedHashMap()
static <K,V>
java.util.LinkedHashMap<K,V>newLinkedHashMap(int initialCapacity)
static <K,V>
java.util.LinkedHashMap<K,V>newLinkedHashMap(int initialCapacity, float loadFactor)
static <K,V>
java.util.LinkedHashMap<K,V>newLinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)
static <K,V>
java.util.LinkedHashMap<K,V>newLinkedHashMap(java.util.Map<? extends K,? extends V> map)
static <K,V>
java.util.TreeMap<K,V>newTreeMap()
static <K,V>
java.util.TreeMap<K,V>newTreeMap(java.util.Comparator<? super K> comparator)
static <K,V>
java.util.TreeMap<K,V>newTreeMap(java.util.Map<? extends K,? extends V> map)
static <K,V>
java.util.TreeMap<K,V>newTreeMap(java.util.SortedMap<K,? extends V> map)
static java.util.Map
of(java.lang.Object... values)
static <K,V>
java.util.Map<K,V>of(java.util.Map.Entry<? extends K,? extends V>... entries)
static <K,V>
java.util.Map<K,V>of(K key, V value)
static <K,V>
java.util.Map<K,V>of(K key1, V value1, K key2, V value2)
static <K,V>
java.util.Map<K,V>of(K key1, V value1, K key2, V value2, K key3, V value3)
static <K,V>
java.util.Map<K,V>of(K key1, V value1, K key2, V value2, K key3, V value3, K key4, V value4)
static <K,V>
java.util.Map<K,V>of(K key1, V value1, K key2, V value2, K key3, V value3, K key4, V value4, K key5, V value5)
static <K,V>
java.util.Map.Entry<K,V>ofEntry(K key, V value)
static java.util.Map
ofMap(java.lang.Object... keyValuePairs)
static <K,V>
java.util.Map<K,V>ofMap(K key, V value)
static <K,V>
java.util.Map<K,V>shallowCloneMap(java.util.Map<K,V> source)
Shallow CloneMap
static <K,V,E>
java.util.Map<K,V>toFixedMap(java.util.Collection<E> values, java.util.function.Function<E,java.util.Map.Entry<K,V>> entryMapper)
-
-
-
Field Detail
-
MIN_LOAD_FACTOR
public static final float MIN_LOAD_FACTOR
The min load factor forHashMap
orHashtable
- See Also:
- Constant Field Values
-
FIXED_LOAD_FACTOR
protected static final float FIXED_LOAD_FACTOR
The fixed load factor forHashMap
orHashtable
= 1.00- See Also:
- Constant Field Values
-
-
Method Detail
-
isEmpty
public static boolean isEmpty(java.util.Map<?,?> map)
-
isNotEmpty
public static boolean isNotEmpty(java.util.Map<?,?> map)
-
of
public static <K,V> java.util.Map<K,V> of(K key, V value)
-
of
public static <K,V> java.util.Map<K,V> of(K key1, V value1, K key2, V value2)
-
of
public static <K,V> java.util.Map<K,V> of(K key1, V value1, K key2, V value2, K key3, V value3)
-
of
public static <K,V> java.util.Map<K,V> of(K key1, V value1, K key2, V value2, K key3, V value3, K key4, V value4)
-
of
public static <K,V> java.util.Map<K,V> of(K key1, V value1, K key2, V value2, K key3, V value3, K key4, V value4, K key5, V value5)
-
of
public static java.util.Map of(java.lang.Object... values)
-
of
public static <K,V> java.util.Map<K,V> of(java.util.Map.Entry<? extends K,? extends V>... entries)
-
ofMap
public static <K,V> java.util.Map<K,V> ofMap(K key, V value)
-
ofMap
public static java.util.Map ofMap(java.lang.Object... keyValuePairs)
-
newHashMap
public static <K,V> java.util.HashMap<K,V> newHashMap()
-
newHashMap
public static <K,V> java.util.HashMap<K,V> newHashMap(int initialCapacity)
-
newHashMap
public static <K,V> java.util.HashMap<K,V> newHashMap(int initialCapacity, float loadFactor)
-
newHashMap
public static <K,V> java.util.HashMap<K,V> newHashMap(java.util.Map<? extends K,? extends V> map)
-
newLinkedHashMap
public static <K,V> java.util.LinkedHashMap<K,V> newLinkedHashMap()
-
newLinkedHashMap
public static <K,V> java.util.LinkedHashMap<K,V> newLinkedHashMap(int initialCapacity)
-
newLinkedHashMap
public static <K,V> java.util.LinkedHashMap<K,V> newLinkedHashMap(int initialCapacity, float loadFactor)
-
newLinkedHashMap
public static <K,V> java.util.LinkedHashMap<K,V> newLinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)
-
newLinkedHashMap
public static <K,V> java.util.LinkedHashMap<K,V> newLinkedHashMap(java.util.Map<? extends K,? extends V> map)
-
newConcurrentHashMap
public static <K,V> java.util.concurrent.ConcurrentHashMap<K,V> newConcurrentHashMap()
-
newConcurrentHashMap
public static <K,V> java.util.concurrent.ConcurrentHashMap<K,V> newConcurrentHashMap(int initialCapacity)
-
newConcurrentHashMap
public static <K,V> java.util.concurrent.ConcurrentHashMap<K,V> newConcurrentHashMap(int initialCapacity, float loadFactor)
-
newConcurrentHashMap
public static <K,V> java.util.concurrent.ConcurrentHashMap<K,V> newConcurrentHashMap(java.util.Map<? extends K,? extends V> map)
-
newTreeMap
public static <K,V> java.util.TreeMap<K,V> newTreeMap()
-
newTreeMap
public static <K,V> java.util.TreeMap<K,V> newTreeMap(java.util.Comparator<? super K> comparator)
-
newTreeMap
public static <K,V> java.util.TreeMap<K,V> newTreeMap(java.util.Map<? extends K,? extends V> map)
-
newTreeMap
public static <K,V> java.util.TreeMap<K,V> newTreeMap(java.util.SortedMap<K,? extends V> map)
-
shallowCloneMap
@Nonnull public static <K,V> java.util.Map<K,V> shallowCloneMap(@Nonnull java.util.Map<K,V> source)
Shallow CloneMap
- Type Parameters:
K
- thetype
of keyV
- thetype
of value- Parameters:
source
- the source ofMap
- Returns:
- non-null
-
newFixedHashMap
public static <K,V> java.util.Map<K,V> newFixedHashMap(int size)
-
newFixedLinkedHashMap
public static <K,V> java.util.Map<K,V> newFixedLinkedHashMap(int size)
-
toFixedMap
public static <K,V,E> java.util.Map<K,V> toFixedMap(java.util.Collection<E> values, java.util.function.Function<E,java.util.Map.Entry<K,V>> entryMapper)
-
ofEntry
public static <K,V> java.util.Map.Entry<K,V> ofEntry(K key, V value)
-
immutableEntry
public static <K,V> java.util.Map.Entry<K,V> immutableEntry(K key, V value)
-
-