structure5
Class AbstractMap<K,V>

java.lang.Object
  structure5.AbstractMap<K,V>

All Implemented Interfaces:

Map<K,V>

Direct Known Subclasses:

ChainedHashtable, Table

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

Associations establish a link between a key and a value. An associative array or map is a structure that allows a disjoint set of keys to become associated with an arbitrary set of values. The convenience of an associative array is that the values used to index the elements need not be comparable and their range need not be known ahead of time. Furthermore, there is no upper bound on the size of the structure. It is able to maintain an arbitrary number of different pieces of information simultaneously. Maps are sometimes called dictionaries because of the uniqueness of the association of words and definitions in a household dictionary.

This class implements methods common to all maps and should be extended by classes that wish to implement the map interface.

Constructor Summary

AbstractMap()

Method Summary

int	hashCode() Compute the hashCode for elements of this map
void	putAll(Map<K,V> other)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface structure5.Map

clear, containsKey, containsValue, entrySet, equals, get, isEmpty, keySet, put, remove, size, values

Constructor Detail

AbstractMap

public AbstractMap()

Method Detail

putAll

public void putAll(Map<K,V> other)

Specified by:

putAll in interface Map<K,V>

Precondition:

other is a valid map

Postcondition:

adds the map entries of other map into this, possibly replacing value

hashCode

public int hashCode()

Compute the hashCode for elements of this map

Specified by:

hashCode in interface Map<K,V>

Overrides:

hashCode in class java.lang.Object