public class AntiCollisionHashMap<K,V> extends AbstractMap<K,V> implements Map<K,V>, Cloneable, Serializable
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| 构造器和说明 |
|---|
AntiCollisionHashMap()
已过时。
Constructs an empty SafelyHashMap with the default initial
capacity (16) and the default load factor (0.75).
|
AntiCollisionHashMap(int initialCapacity)
已过时。
Constructs an empty SafelyHashMap with the specified initial
capacity and the default load factor (0.75).
|
AntiCollisionHashMap(int initialCapacity,
float loadFactor)
已过时。
|
AntiCollisionHashMap(Map<? extends K,? extends V> m)
已过时。
Constructs a new SafelyHashMap with the same mappings as the
specified Map.
|
| 限定符和类型 | 方法和说明 |
|---|---|
void |
clear()
已过时。
Removes all of the mappings from this map.
|
Object |
clone()
已过时。
Returns a shallow copy of this SafelyHashMap instance: the keys
and values themselves are not cloned.
|
boolean |
containsKey(Object key)
已过时。
Returns true if this map contains a mapping for the specified
key.
|
boolean |
containsValue(Object value)
已过时。
Returns true if this map maps one or more keys to the specified
value.
|
Set<Map.Entry<K,V>> |
entrySet()
已过时。
Returns a
Set view of the mappings contained in this map. |
V |
get(Object key)
已过时。
Returns the value to which the specified key is mapped, or
null
if this map contains no mapping for the key. |
boolean |
isEmpty()
已过时。
Returns true if this map contains no key-value mappings.
|
Set<K> |
keySet()
已过时。
Returns a
Set view of the keys contained in this map. |
V |
put(K key,
V value)
已过时。
Associates the specified value with the specified key in this map.
|
void |
putAll(Map<? extends K,? extends V> m)
已过时。
Copies all of the mappings from the specified map to this map.
|
V |
remove(Object key)
已过时。
Removes the mapping for the specified key from this map if present.
|
int |
size()
已过时。
Returns the number of key-value mappings in this map.
|
Collection<V> |
values()
已过时。
Returns a
Collection view of the values contained in this map. |
equals, hashCode, toStringcompute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAllpublic AntiCollisionHashMap(int initialCapacity,
float loadFactor)
public AntiCollisionHashMap(int initialCapacity)
initialCapacity - the initial capacity.IllegalArgumentException - if the initial capacity is negative.public AntiCollisionHashMap()
public AntiCollisionHashMap(Map<? extends K,? extends V> m)
m - the map whose mappings are to be placed in this mapNullPointerException - if the specified map is nullpublic int size()
public boolean isEmpty()
public V get(Object key)
null
if this map contains no mapping for the key.
More formally, if this map contains a mapping from a key k to a
value v such that (key==null ? k==null :
key.equals(k)), then this method returns v; otherwise it returns
null. (There can be at most one such mapping.)
A return value of null does not necessarily indicate that
the map contains no mapping for the key; it's also possible that the map
explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.
get 在接口中 Map<K,V>get 在类中 AbstractMap<K,V>put(Object, Object)public boolean containsKey(Object key)
containsKey 在接口中 Map<K,V>containsKey 在类中 AbstractMap<K,V>key - The key whose presence in this map is to be testedpublic V put(K key, V value)
put 在接口中 Map<K,V>put 在类中 AbstractMap<K,V>key - key with which the specified value is to be associatedvalue - value to be associated with the specified keypublic void putAll(Map<? extends K,? extends V> m)
putAll 在接口中 Map<K,V>putAll 在类中 AbstractMap<K,V>m - mappings to be stored in this mapNullPointerException - if the specified map is nullpublic V remove(Object key)
public void clear()
public boolean containsValue(Object value)
containsValue 在接口中 Map<K,V>containsValue 在类中 AbstractMap<K,V>value - value whose presence in this map is to be testedpublic Object clone()
clone 在类中 AbstractMap<K,V>public Set<K> keySet()
Set view of the keys contained in this map. The set is
backed by the map, so changes to the map are reflected in the set, and
vice-versa. If the map is modified while an iteration over the set is in
progress (except through the iterator's own remove operation),
the results of the iteration are undefined. The set supports element
removal, which removes the corresponding mapping from the map, via the
Iterator.remove, Set.remove, removeAll,
retainAll, and clear operations. It does not support
the add or addAll operations.public Collection<V> values()
Collection view of the values contained in this map.
The collection is backed by the map, so changes to the map are reflected
in the collection, and vice-versa. If the map is modified while an
iteration over the collection is in progress (except through the
iterator's own remove operation), the results of the iteration
are undefined. The collection supports element removal, which removes the
corresponding mapping from the map, via the Iterator.remove,
Collection.remove, removeAll, retainAll and
clear operations. It does not support the add or
addAll operations.public Set<Map.Entry<K,V>> entrySet()
Set view of the mappings contained in this map. The set
is backed by the map, so changes to the map are reflected in the set, and
vice-versa. If the map is modified while an iteration over the set is in
progress (except through the iterator's own remove operation, or
through the setValue operation on a map entry returned by the
iterator) the results of the iteration are undefined. The set supports
element removal, which removes the corresponding mapping from the map,
via the Iterator.remove, Set.remove, removeAll
, retainAll and clear operations. It does not support
the add or addAll operations.Copyright © 2012–2020 Alibaba Group. All rights reserved.