org.exolab.adaptx.util

Class HashMap

public class HashMap extends Object

My implementation of a JDK 1.2 Map. I do not use synchronization, so be careful in a threaded environment. I also do not specifically "implements" java.util.Map, since support for JDK 1.1 is needed.

Version: $Revision: 3633 $ $Date: 2003-03-01 02:38:44 -0500 (Sat, 01 Mar 2003) $

Author: Keith Visco

Field Summary
static int	DEFAULT_SIZE The default number of buckets in this Map

Constructor Summary
	HashMap() Creates a new HashMap with the default number of buckets
	HashMap(int size) Creates a new HashMap with the given number of buckets.

Method Summary
void	clear() Removes all entries from this Map
boolean	containsKey(Object key) Returns true if the given object is a key contained in this Map
boolean	containsValue(Object value) Returns true if the given object is a value contained in this Map Note: Depending on the size of the Map, this could be a slow operation.
Iterator	entries() Returns an interator for the entries of this Map.
boolean	equals(Object object) Returns true if the given Object is a HashMap which contains equivalent HashMap entries as this HashMap.
Object	get(Object key) Returns the value associated with the given key
int	hashCode() Returns the hashCode for this Map.
boolean	isEmpty() Returns true if this map contains no entries
Iterator	keys()
void	put(Object key, Object value) Associated the specified value with the given key in this Map
Object	remove(Object key) Removes the association with the given Key in the Map.
int	size() Returns the number of associations in the Map

Field Detail

DEFAULT_SIZE

public static final int DEFAULT_SIZE

The default number of buckets in this Map

Constructor Detail

HashMap

public HashMap()

Creates a new HashMap with the default number of buckets

HashMap

public HashMap(int size)

Creates a new HashMap with the given number of buckets.

Parameters: size, the number of buckets to use, this value must be a non-zero positive integer, if not the default size will be used.
Note:The number of buckets is not the same as the allocating space for a desired number of entries. If fact, if you know number of entries that will be in the hash, you might want to use a HashMap with a different implementation. This Map is implemented using separate chaining.

Method Detail

clear

public void clear()

Removes all entries from this Map

containsKey

public boolean containsKey(Object key)

Returns true if the given object is a key contained in this Map

Returns: true if the given object is a key contained in this Map

containsValue

public boolean containsValue(Object value)

Returns true if the given object is a value contained in this Map
Note: Depending on the size of the Map, this could be a slow operation. If you know the key an object would be associated with, contains key would be much faster, or simply do (get(key) != null).

Returns: true if the given object is a value contained in this Map

entries

public Iterator entries()

Returns an interator for the entries of this Map. Each element returned by a call to Iterator#next() is a Map.Entry.
Note: This is different than a JDK 1.2 Map because I didn't want to deal with implementing Sets at this point.

Returns: an Iterator for the entries of this Map.

equals

public boolean equals(Object object)

Returns true if the given Object is a HashMap which contains equivalent HashMap entries as this HashMap.

Returns: true if the given Object is a HashMap, and is equivalent to this Map
I will be probably make an interface for Map, to allow comparisons with different Map implemenations.