java.util

Class AbstractMap<K,V>

Implemented Interfaces:
Map<K,V>
Known Direct Subclasses:
ConcurrentHashMap<K,V>, ConcurrentSkipListMap<K,V>, EnumMap<K,extends,Enum,K,V>, HashMap<K,V>, IdentityHashMap<K,V>, TreeMap<K,V>, WeakHashMap<K,V>

public abstract class AbstractMap<K,V>
extends Object
implements Map<K,V>

An abstract implementation of Map to make it easier to create your own implementations. In order to create an unmodifiable Map, subclass AbstractMap and implement the entrySet (usually via an AbstractSet). To make it modifiable, also implement put, and have entrySet().iterator() support remove.

It is recommended that classes which extend this support at least the no-argument constructor, and a constructor which accepts another Map. Further methods in this class may be overridden if you have a more efficient implementation.

Since:
1.2
See Also:
Map, Collection, HashMap, LinkedHashMap, TreeMap, WeakHashMap, IdentityHashMap

Nested Class Summary

static class
AbstractMap.SimpleEntry
A class which implements Map.Entry.
static class
AbstractMap.SimpleImmutableEntry
A class containing an immutable key and value.

Constructor Summary

AbstractMap()
The main constructor, for use by subclasses.

Method Summary

abstract Set
V>> entrySet()
Returns a set view of the mappings in this Map.
void
clear()
Remove all entries from this Map (optional operation).
protected Object
clone()
Create a shallow copy of this Map, no keys or values are copied.
boolean
containsKey(Object key)
Returns true if this contains a mapping for the given key.
boolean
containsValue(Object value)
Returns true if this contains at least one mapping with the given value.
boolean
equals(Object o)
Compares the specified object with this map for equality.
V
get(Object key)
Returns the value mapped by the given key.
int
hashCode()
Returns the hash code for this map.
boolean
isEmpty()
Returns true if the map contains no mappings.
Set
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(extends K, V> m)
Copies all entries of the given map to this one (optional operation).
V
remove(Object key)
Removes the mapping for this key if present (optional operation).
int
size()
Returns the number of key-value mappings in the map.
String
toString()
Returns a String representation of this map.
Collection
values()
Returns a collection or bag view of this map's values.

Methods inherited from class java.lang.Object

clone, equals, extends Object> getClass, finalize, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

AbstractMap

protected AbstractMap()
The main constructor, for use by subclasses.

Method Details

V>> entrySet

public abstract SetV>> entrySet()
Returns a set view of the mappings in this Map. Each element in the set must be an implementation of Map.Entry. The set is backed by the map, so that changes in one show up in the other. Modifications made while an iterator is in progress cause undefined behavior. If the set supports removal, these methods must be valid: Iterator.remove, Set.remove, removeAll, retainAll, and clear. Element addition is not supported via this set.
Specified by:
V>> entrySet in interface Map<K,V>
Returns:
the entry set
See Also:
Map.Entry

clear

public void clear()
Remove all entries from this Map (optional operation). This default implementation calls entrySet().clear(). NOTE: If the entry set does not permit clearing, then this will fail, too. Subclasses often override this for efficiency. Your implementation of entrySet() should not call AbstractMap.clear unless you want an infinite loop.
Specified by:
clear in interface Map<K,V>
Throws:
UnsupportedOperationException - if entrySet().clear() does not support clearing.
See Also:
Set.clear()

clone

protected Object clone()
            throws CloneNotSupportedException
Create a shallow copy of this Map, no keys or values are copied. The default implementation simply calls super.clone().
Overrides:
clone in interface Object
Returns:
the shallow clone
Throws:
CloneNotSupportedException - if a subclass is not Cloneable

containsKey

public boolean containsKey(Object key)
Returns true if this contains a mapping for the given key. This implementation does a linear search, O(n), over the entrySet(), returning true if a match is found, false if the iteration ends. Many subclasses can implement this more efficiently.
Specified by:
containsKey in interface Map<K,V>
Parameters:
key - the key to search for
Returns:
true if the map contains the key
Throws:
NullPointerException - if key is null but the map does not permit null keys

containsValue

public boolean containsValue(Object value)
Returns true if this contains at least one mapping with the given value. This implementation does a linear search, O(n), over the entrySet(), 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.
Specified by:
containsValue in interface Map<K,V>
Parameters:
value - the value to search for
Returns:
true if the map contains the value

equals

public boolean equals(Object o)
Compares the specified object with this map for equality. Returns true if the other object is a Map with the same mappings, that is,
o instanceof Map && entrySet().equals(((Map) o).entrySet();
Specified by:
equals in interface Map<K,V>
Overrides:
equals in interface Object
Parameters:
o - the object to be compared
Returns:
true if the object equals this map

get

public V get(Object key)
Returns the value mapped by the given key. Returns null 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.
Specified by:
get in interface Map<K,V>
Parameters:
key - the key to look up
Returns:
the value associated with the key, or null if key not in map
Throws:
NullPointerException - if this map does not accept null keys

hashCode

public int hashCode()
Returns the hash code for this map. As defined in Map, this is the sum of all hashcodes for each Map.Entry object in entrySet, or basically entrySet().hashCode().
Specified by:
hashCode in interface Map<K,V>
Overrides:
hashCode in interface Object
Returns:
the hash code

isEmpty

public boolean isEmpty()
Returns true if the map contains no mappings. This is implemented by size() == 0.
Specified by:
isEmpty in interface Map<K,V>
Returns:
true if the map is empty
See Also:
size()

keySet

public Set keySet()
Returns a set view of this map's keys. The set is backed by the map, so changes in one show up in the other. Modifications while an iteration is in progress produce undefined behavior. The set supports removal if entrySet() does, but does not support element addition.

This 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.

Specified by:
keySet in interface Map<K,V>
Returns:
a Set view of the keys

put

public V put(K key,
             V value)
Associates the given key to the given value (optional operation). If the map already contains the key, its value is replaced. This implementation simply throws an UnsupportedOperationException. Be aware that in a map that permits null values, a null return does not always imply that the mapping was created.
Specified by:
put in interface Map<K,V>
Parameters:
key - the key to map
value - the value to be mapped
Returns:
the previous value of the key, or null if there was no mapping
Throws:
UnsupportedOperationException - if the operation is not supported
ClassCastException - if the key or value is of the wrong type
IllegalArgumentException - if something about this key or value prevents it from existing in this map
NullPointerException - if the map forbids null keys or values

putAll

public void putAll(extends K,
                   V> m)
Copies all entries of the given map to this one (optional operation). If the map already contains a key, its value is replaced. This implementation simply iterates over the map's entrySet(), calling put, so it is not supported if puts are not.
Specified by:
putAll in interface Map<K,V>
Parameters:
m - the mapping to load into this map
Throws:
UnsupportedOperationException - if the operation is not supported by this map.
ClassCastException - if a key or value is of the wrong type for adding to this map.
IllegalArgumentException - if something about a key or value prevents it from existing in this map.
NullPointerException - if the map forbids null keys or values.
NullPointerException - if m is null.
See Also:
put(Object, Object)

remove

public V remove(Object key)
Removes the mapping for this key if present (optional operation). This implementation iterates over the entrySet searching for a matching key, at which point it calls the iterator's remove 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.
Specified by:
remove in interface Map<K,V>
Parameters:
key - the key to remove
Returns:
the value the key mapped to, or null if not present. Null may also be returned if null values are allowed in the map and the value of this mapping is null.
Throws:
UnsupportedOperationException - if deletion is unsupported

size

public int size()
Returns the number of key-value mappings in the map. If there are more than Integer.MAX_VALUE mappings, return Integer.MAX_VALUE. This is implemented as entrySet().size().
Specified by:
size in interface Map<K,V>
Returns:
the number of mappings
See Also:
Set.size()

toString

public String toString()
Returns a String representation of this map. This is a listing of the map entries (which are specified in Map.Entry as being getKey() + "=" + getValue()), separated by a comma and space (", "), and surrounded by braces ('{' and '}'). This implementation uses a StringBuffer and iterates over the entrySet to build the String. Note that this can fail with an exception if underlying keys or values complete abruptly in toString().
Overrides:
toString in interface Object
Returns:
a String representation

values

public Collection values()
Returns a collection or bag view of this map's values. The collection is backed by the map, so changes in one show up in the other. Modifications while an iteration is in progress produce undefined behavior. The collection supports removal if entrySet() does, but does not support element addition.

This 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.

Specified by:
values in interface Map<K,V>
Returns:
a Collection view of the values

AbstractMap.java -- Abstract implementation of most of Map Copyright (C) 1998, 1999, 2000, 2001, 2002, 2004, 2005 Free Software Foundation, Inc. This file is part of GNU Classpath. GNU Classpath is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Classpath is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Classpath; see the file COPYING. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Linking this library statically or dynamically with other modules is making a combined work based on this library. Thus, the terms and conditions of the GNU General Public License cover the whole combination. As a special exception, the copyright holders of this library give you permission to link this library with independent modules to produce an executable, regardless of the license terms of these independent modules, and to copy and distribute the resulting executable under terms of your choice, provided that you also meet, for each linked independent module, the terms and conditions of the license of that module. An independent module is a module which is not derived from or based on this library. If you modify this library, you may extend this exception to your version of the library, but you are not obligated to do so. If you do not wish to do so, delete this exception statement from your version.