Overview  Package   Class  Use  Deprecated  Index
Home >> All >> edu >> emory >> mathcs >> [ util overview ]	PREV CLASS  NEXT CLASS
SUMMARY:  JAVADOC |  SOURCE |  DOWNLOAD | NESTED | FIELD | CONSTR | METHOD	DETAIL: FIELD | CONSTR | METHOD

---

edu.emory.mathcs.util
Class AbstractIntMap  

java.lang.Object
  edu.emory.mathcs.util.AbstractIntMap

All Implemented Interfaces:

IntMap

Direct Known Subclasses:

HashIntMap

---

public abstract class AbstractIntMap

extends java.lang.Object

implements IntMap

This class provides a skeletal implementation of the IntMap interface, to minimize the effort required to implement this interface.

To implement an unmodifiable map, the programmer needs only to extend this class and provide an implementation for the entrySet method, which returns a set-view of the map's mappings. Typically, the returned set will, in turn, be implemented atop AbstractSet. This set should not support the add or remove methods, and its iterator should not support the remove method.

To implement a modifiable map, the programmer must additionally override this class's put method (which otherwise throws an UnsupportedOperationException), and the iterator returned by entrySet().iterator() must additionally implement its remove method.

The programmer should generally provide a void (no argument) and map constructor, as per the recommendation in the Map interface specification.

The documentation for each non-abstract methods in this class describes its implementation in detail. Each of these methods may be overridden if the map being implemented admits a more efficient implementation.

Version:

1.0

---

Nested Class Summary

 

Nested classes inherited from class edu.emory.mathcs.util.IntMap

IntMap.Entry

 

Field Summary
private  java.util.Collection	values

 

Constructor Summary
protected	AbstractIntMap()           Sole constructor.

 

Method Summary
void	clear()           Removes all mappings from this map (optional operation).
boolean	containsKey(int key)           Returns true if this map contains a mapping for the specified key.
boolean	containsValue(java.lang.Object value)           Returns true if this map maps one or more keys to this value.
abstract  java.util.Set	entrySet()           Returns a set view of the mappings contained in this map.
boolean	equals(java.lang.Object o)           Compares the specified object with this map for equality.
java.lang.Object	get(int key)           Returns the value to which this map maps the specified key.
int	hashCode()           Returns the hash code value for this map.
boolean	isEmpty()           Returns true if this map contains no key-value mappings.
java.lang.Object	put(int key, java.lang.Object value)           Associates the specified value with the specified key in this map (optional operation).
void	putAll(java.util.Map t)           Copies all of the mappings from the specified map to this map (optional operation).
java.lang.Object	remove(int key)           Removes the mapping for this key from this map if present (optional operation).
int	size()           Returns the number of key-value mappings in this map.
java.lang.String	toString()           Returns a string representation of this map.
java.util.Collection	values()           Returns a collection view of the values contained in this map.

 

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

 

Methods inherited from interface edu.emory.mathcs.util.IntMap

putAll

 

Field Detail

values

private transient java.util.Collection values

Constructor Detail

AbstractIntMap

protected AbstractIntMap()

Sole constructor. (For invocation by subclass constructors, typically implicit.)

Method Detail

size

public int size()

Returns the number of key-value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

This implementation returns entrySet().size().

Specified by:

size in interface IntMap

---

isEmpty

public boolean isEmpty()

Returns true if this map contains no key-value mappings.

This implementation returns size() == 0.

Specified by:

isEmpty in interface IntMap

---

containsValue

public boolean containsValue(java.lang.Object value)

Returns true if this map maps one or more keys to this value. More formally, returns true if and only if this map contains at least one mapping to a value v such that (value==null ? v==null : value.equals(v)). This operation will probably require time linear in the map size for most implementations of map.

This implementation iterates over entrySet() searching for an entry with the specified value. If such an entry is found, true is returned. If the iteration termixnates without finding such an entry, false is returned. Note that this implementation requires linear time in the size of the map.

Specified by:

containsValue in interface IntMap

---

containsKey

public boolean containsKey(int key)

Returns true if this map contains a mapping for the specified key.

This implementation iterates over entrySet() searching for an entry with the specified key. If such an entry is found, true is returned. If the iteration termixnates without finding such an entry, false is returned. Note that this implementation requires linear time in the size of the map; many implementations will override this method.

Specified by:

containsKey in interface IntMap

---

get

public java.lang.Object get(int key)

Returns the value to which this map maps the specified key. Returns null if the map contains no mapping for this key. 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.

This implementation iterates over entrySet() searching for an entry with the specified key. If such an entry is found, the entry's value is returned. If the iteration termixnates without finding such an entry, null is returned. Note that this implementation requires linear time in the size of the map; many implementations will override this method.

Specified by:

get in interface IntMap

---

put

public java.lang.Object put(int key,
                            java.lang.Object value)

Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for this key, the old value is replaced.

This implementation always throws an UnsupportedOperationException.

Specified by:

put in interface IntMap

---

remove

public java.lang.Object remove(int key)

Removes the mapping for this key from this map if present (optional operation).

This implementation iterates over entrySet() searching for an entry with the specified key. If such an entry is found, its value is obtained with its getValue operation, the entry is is removed from the Collection (and the backing map) with the iterator's remove operation, and the saved value is returned. If the iteration termixnates without finding such an entry, null is returned. Note that this implementation requires linear time in the size of the map; many implementations will override this method.

Specified by:

remove in interface IntMap

---

putAll

public void putAll(java.util.Map t)

Copies all of the mappings from the specified map to this map (optional operation). These mappings will replace any mappings that this map had for any of the keys currently in the specified map.

This implementation iterates over the specified map's entrySet() collection, and calls this map's put operation once for each entry returned by the iteration.

---

clear

public void clear()

Removes all mappings from this map (optional operation).

This implementation calls entrySet().clear().

Specified by:

clear in interface IntMap

---

values

public java.util.Collection values()

Returns a 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, the results of the iteration are undefined.) The collection supports element removal, which removes the corresponding entry from the map, via the Iterator.remove, Collection.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.

This implementation returns a collection that subclasses abstract collection. The subclass's iterator method returns a "wrapper object" over this map's entrySet() iterator. The size method delegates to this map's size method and the contains method delegates to this map's containsValue method.

The collection is created the first time this method is called, and returned in response to all subsequent calls. No synchronization is performed, so there is a slight chance that multiple calls to this method will not all return the same Collection.

Specified by:

values in interface IntMap

---

entrySet

public abstract java.util.Set entrySet()

Returns a set view of the mappings contained in this map. Each element in this set is a Map.Entry. 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, the results of the iteration are undefined.) The set supports element removal, which removes the corresponding entry from the map, via the Iterator.remove, Set.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.

Specified by:

entrySet in interface IntMap

---

equals

public boolean equals(java.lang.Object o)

Compares the specified object with this map for equality. Returns true if the given object is also a map and the two maps represent the same mappings. More formally, two maps t1 and t2 represent the same mappings if t1.keySet().equals(t2.keySet()) and for every key k in t1.keySet(), (t1.get(k)==null ? t2.get(k)==null : t1.get(k).equals(t2.get(k))) . This ensures that the equals method works properly across different implementations of the map interface.

This implementation first checks if the specified object is this map; if so it returns true. Then, it checks if the specified object is a map whose size is identical to the size of this set; if not, it it returns false. If so, it iterates over this map's entrySet collection, and checks that the specified map contains each mapping that this map contains. If the specified map fails to contain such a mapping, false is returned. If the iteration completes, true is returned.

Specified by:

equals in interface IntMap

---

hashCode

public int hashCode()

Returns the hash code value for this map. The hash code of a map is defined to be the sum of the hash codes of each entry in the map's entrySet() view. This ensures that t1.equals(t2) implies that t1.hashCode()==t2.hashCode() for any two maps t1 and t2, as required by the general contract of Object.hashCode.

This implementation iterates over entrySet(), calling hashCode on each element (entry) in the Collection, and adding up the results.

Specified by:

hashCode in interface IntMap

---

toString

public java.lang.String toString()

Returns a string representation of this map. The string representation consists of a list of key-value mappings in the order returned by the map's entrySet view's iterator, enclosed in braces ("{}"). Adjacent mappings are separated by the characters ", " (comma and space). Each key-value mapping is rendered as the key followed by an equals sign ("=") followed by the associated value. Keys and values are converted to strings as by String.valueOf(Object).

This implementation creates an empty string buffer, appends a left brace, and iterates over the map's entrySet view, appending the string representation of each map.entry in turn. After appending each entry except the last, the string ", " is appended. Finally a right brace is appended. A string is obtained from the stringbuffer, and returned.

---

Overview  Package   Class  Use  Deprecated  Index
Home >> All >> edu >> emory >> mathcs >> [ util overview ]	PREV CLASS  NEXT CLASS
SUMMARY:  JAVADOC |  SOURCE |  DOWNLOAD | NESTED | FIELD | CONSTR | METHOD	DETAIL: FIELD | CONSTR | METHOD

---