public class EnumMap4D<K extends java.lang.Enum<K>,V> extends AbstractMap4D<K,V> implements java.lang.Cloneable
AbstractMap4D.SimpleEntry<K,V>, AbstractMap4D.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
EnumMap4D(java.lang.Class<K> keyType) |
EnumMap4D(EnumMap4D<K,? extends V> map) |
EnumMap4D(java.util.Map<K,? extends V> map) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Remove all entries from this Map (optional operation).
|
EnumMap4D<K,V> |
clone()
Create a shallow copy of this Map, no keys or values are copied.
|
boolean |
containsKey(java.lang.Object key)
Returns true if this contains a mapping for the given key.
|
boolean |
containsValue(java.lang.Object value)
Returns true if this contains at least one mapping with the given value.
|
java.util.Set<java.util.Map.Entry<K,V>> |
entrySet()
Returns a set view of the mappings in this Map.
|
boolean |
equals(java.lang.Object o)
Compares the specified object with this map for equality.
|
V |
get(java.lang.Object key)
Returns the value mapped by the given key.
|
java.util.Set<K> |
keySet()
Returns a set view of this map's keys.
|
V |
put(K key,
V value)
Associates the given key to the given value (optional operation).
|
void |
putAll(java.util.Map<? extends K,? extends V> map)
Copies all entries of the given map to this one (optional operation).
|
V |
remove(java.lang.Object key)
Removes the mapping for this key if present (optional operation).
|
int |
size()
Returns the number of key-value mappings in the map.
|
java.util.Collection<V> |
values()
Returns a collection or bag view of this map's values.
|
equals, hashCode, hashCode, isEmpty, toStringpublic EnumMap4D(java.lang.Class<K> keyType)
public int size()
AbstractMap4DentrySet().size().public boolean containsValue(java.lang.Object value)
AbstractMap4DentrySet(), returning true if a match
is found, false if the iteration ends. A match is
defined as a value, v, where (value == null ? v == null :
value.equals(v)). Subclasses are unlikely to implement
this more efficiently.containsValue in interface java.util.Map<K extends java.lang.Enum<K>,V>containsValue in class AbstractMap4D<K extends java.lang.Enum<K>,V>value - the value to search forAbstractMap4D.containsKey(Object)public boolean containsKey(java.lang.Object key)
AbstractMap4DentrySet(), returning true if a match
is found, false if the iteration ends. Many subclasses
can implement this more efficiently.containsKey in interface java.util.Map<K extends java.lang.Enum<K>,V>containsKey in class AbstractMap4D<K extends java.lang.Enum<K>,V>key - the key to search forAbstractMap4D.containsValue(Object)public V get(java.lang.Object key)
AbstractMap4Dnull if
there is no mapping. However, in Maps that accept null values, you
must rely on containsKey to determine if a mapping exists.
This iteration takes linear time, searching entrySet().iterator() of
the key. Many implementations override this method.get in interface java.util.Map<K extends java.lang.Enum<K>,V>get in class AbstractMap4D<K extends java.lang.Enum<K>,V>key - the key to look upAbstractMap4D.containsKey(Object)public V put(K key, V value)
AbstractMap4Dnull values, a null return does not always
imply that the mapping was created.put in interface java.util.Map<K extends java.lang.Enum<K>,V>put in class AbstractMap4D<K extends java.lang.Enum<K>,V>key - the key to mapvalue - the value to be mappedAbstractMap4D.containsKey(Object)public V remove(java.lang.Object key)
AbstractMap4Dremove method.
It returns the result of getValue() on the entry, if found,
or null if no entry is found. Note that maps which permit null values
may also return null if the key was removed. If the entrySet does not
support removal, this will also fail. This is O(n), so many
implementations override it for efficiency.remove in interface java.util.Map<K extends java.lang.Enum<K>,V>remove in class AbstractMap4D<K extends java.lang.Enum<K>,V>key - the key to removeIterator.remove()public void putAll(java.util.Map<? extends K,? extends V> map)
AbstractMap4Dput,
so it is not supported if puts are not.putAll in interface java.util.Map<K extends java.lang.Enum<K>,V>putAll in class AbstractMap4D<K extends java.lang.Enum<K>,V>map - the mapping to load into this mapAbstractMap4D.put(Object, Object)public void clear()
AbstractMap4DAbstractMap.clear unless you want an infinite loop.public java.util.Set<K> keySet()
AbstractMap4DThis implementation creates an AbstractSet, where the iterator wraps the entrySet iterator, size defers to the Map's size, and contains defers to the Map's containsKey. The set is created on first use, and returned on subsequent uses, although since no synchronization occurs, there is a slight possibility of creating two sets.
keySet in interface java.util.Map<K extends java.lang.Enum<K>,V>keySet in class AbstractMap4D<K extends java.lang.Enum<K>,V>Set.iterator(),
AbstractMap4D.size(),
AbstractMap4D.containsKey(Object),
AbstractMap4D.values()public java.util.Collection<V> values()
AbstractMap4DThis implementation creates an AbstractCollection, where the iterator wraps the entrySet iterator, size defers to the Map's size, and contains defers to the Map's containsValue. The collection is created on first use, and returned on subsequent uses, although since no synchronization occurs, there is a slight possibility of creating two collections.
values in interface java.util.Map<K extends java.lang.Enum<K>,V>values in class AbstractMap4D<K extends java.lang.Enum<K>,V>Collection.iterator(),
AbstractMap4D.size(),
AbstractMap4D.containsValue(Object),
AbstractMap4D.keySet()public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
AbstractMap4DIterator.remove, Set.remove,
removeAll, retainAll, and clear.
Element addition is not supported via this set.public boolean equals(java.lang.Object o)
AbstractMap4Dtrue if the other object is a Map with the same mappings,
that is,o instanceof Map && entrySet().equals(((Map) o).entrySet();public EnumMap4D<K,V> clone()
AbstractMap4Dsuper.clone().clone in class AbstractMap4D<K extends java.lang.Enum<K>,V>Cloneable,
Object.clone()