com::cosylab::acs::maci::manager::IntHashMap Class Reference

Collaboration diagram for com::cosylab::acs::maci::manager::IntHashMap:
Collaboration graph
[legend]

List of all members.

Classes

class  Entry

Public Member Functions

 IntHashMap ()
 IntHashMap (int initialCapacity)
 IntHashMap (int initialCapacity, float loadFactor)
int size ()
boolean isEmpty ()
boolean contains (int value)
boolean containsValue (int value)
boolean containsKey (int key)
int get (int key)
int put (int key, int value)
int remove (int key)
void clear ()
int[] toArray (int[] arr)

Protected Member Functions

void rehash ()

Private Attributes

transient Entry table []
transient int count
int threshold
float loadFactor

Detailed Description

A hash map that uses primitive ints for the key and values instead of objects. NOTE: this implementatio is not synced, client has to care of that.

This implemenation is based on original java implementation.

Author:
Matej Sekoranja
Version:
$id$
See also:
java.util.HashMap

Constructor & Destructor Documentation

com::cosylab::acs::maci::manager::IntHashMap::IntHashMap (  )  [inline]

Constructs a new, empty hashtable with a default capacity and load factor, which is 20 and 0.75 respectively.

com::cosylab::acs::maci::manager::IntHashMap::IntHashMap ( int  initialCapacity  )  [inline]

Constructs a new, empty hashtable with the specified initial capacity and default load factor, which is 0.75.

Parameters:
initialCapacity the initial capacity of the hashtable.
Exceptions:
IllegalArgumentException if the initial capacity is less than zero.
com::cosylab::acs::maci::manager::IntHashMap::IntHashMap ( int  initialCapacity,
float  loadFactor 
) [inline]

Constructs a new, empty hashtable with the specified initial capacity and the specified load factor.

Parameters:
initialCapacity the initial capacity of the hashtable.
loadFactor the load factor of the hashtable.
Exceptions:
IllegalArgumentException if the initial capacity is less than zero, or if the load factor is nonpositive.

References table, and threshold.

Member Function Documentation

void com::cosylab::acs::maci::manager::IntHashMap::clear (  )  [inline]

Clears this hashtable so that it contains no keys.

References count, and table.

boolean com::cosylab::acs::maci::manager::IntHashMap::contains ( int  value  )  [inline]

Tests if some key maps into the specified value in this hashtable. This operation is more expensive than the containsKey method.

Note that this method is identical in functionality to containsValue, (which is part of the Map interface in the collections framework).

Parameters:
value a value to search for.
Returns:
true if and only if some key maps to the value argument in this hashtable as determined by the equals method; false otherwise.
Exceptions:
NullPointerException if the value is null.
See also:
containsKey(int)
containsValue(Object)
java.util.Map

References com::cosylab::acs::maci::manager::IntHashMap::Entry::next, and table.

Referenced by containsValue().

boolean com::cosylab::acs::maci::manager::IntHashMap::containsKey ( int  key  )  [inline]

Tests if the specified object is a key in this hashtable.

Parameters:
key possible key.
Returns:
true if and only if the specified object is a key in this hashtable, as determined by the equals method; false otherwise.
See also:
contains(Object)

References com::cosylab::acs::maci::manager::IntHashMap::Entry::next, and table.

boolean com::cosylab::acs::maci::manager::IntHashMap::containsValue ( int  value  )  [inline]

Returns true if this HashMap maps one or more keys to this value.

Note that this method is identical in functionality to contains (which predates the Map interface).

Parameters:
value value whose presence in this HashMap is to be tested.
Returns:
boolean true if the value is contained
See also:
java.util.Map
Since:
JDK1.2

References contains().

int com::cosylab::acs::maci::manager::IntHashMap::get ( int  key  )  [inline]

Returns the value to which the specified key is mapped in this map.

Parameters:
key a key in the hashtable.
Returns:
the value to which the key is mapped in this hashtable; -1 if the key is not mapped to any value in this hashtable.
See also:
put(int, Object)

References com::cosylab::acs::maci::manager::IntHashMap::Entry::next, table, and com::cosylab::acs::maci::manager::IntHashMap::Entry::value.

Referenced by com::cosylab::acs::maci::manager::ComponentInfoTopologicalSort::extract().

boolean com::cosylab::acs::maci::manager::IntHashMap::isEmpty (  )  [inline]

Tests if this hashtable maps no keys to values.

Returns:
true if this hashtable maps no keys to values; false otherwise.

References count.

int com::cosylab::acs::maci::manager::IntHashMap::put ( int  key,
int  value 
) [inline]

Maps the specified key to the specified value in this hashtable. The key cannot be null.

The value can be retrieved by calling the get method with a key that is equal to the original key.

Parameters:
key the hashtable key.
value the value.
Returns:
the previous value of the specified key in this hashtable, or -1 if it did not have one.
Exceptions:
NullPointerException if the key is null.
See also:
get(int)

References count, com::cosylab::acs::maci::manager::IntHashMap::Entry::next, rehash(), table, threshold, and com::cosylab::acs::maci::manager::IntHashMap::Entry::value.

Referenced by com::cosylab::acs::maci::manager::ComponentInfoTopologicalSort::downheap(), and com::cosylab::acs::maci::manager::ComponentInfoTopologicalSort::heapExtract().

void com::cosylab::acs::maci::manager::IntHashMap::rehash (  )  [inline, protected]

Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently.

This method is called automatically when the number of keys in the hashtable exceeds this hashtable's capacity and load factor.

References com::cosylab::acs::maci::manager::IntHashMap::Entry::hash, loadFactor, com::cosylab::acs::maci::manager::IntHashMap::Entry::next, table, and threshold.

Referenced by put().

int com::cosylab::acs::maci::manager::IntHashMap::remove ( int  key  )  [inline]

Removes the key (and its corresponding value) from this hashtable.

This method does nothing if the key is not present in the hashtable.

Parameters:
key the key that needs to be removed.
Returns:
the value to which the key had been mapped in this hashtable, or -1 if the key did not have a mapping.

References count, com::cosylab::acs::maci::manager::IntHashMap::Entry::next, and table.

Referenced by com::cosylab::acs::maci::manager::ComponentInfoTopologicalSort::heapExtract().

int com::cosylab::acs::maci::manager::IntHashMap::size (  )  [inline]

Returns the number of keys in this hashtable.

Returns:
the number of keys in this hashtable.

References count.

int [] com::cosylab::acs::maci::manager::IntHashMap::toArray ( int[]  arr  )  [inline]

Copies values to array. Note that array capacity has to be large enough.

Parameters:
arr array to be filled
array (new if given not large enough) of values.

References count, com::cosylab::acs::maci::manager::IntHashMap::Entry::next, table, and com::cosylab::acs::maci::manager::IntHashMap::Entry::value.

Member Data Documentation

transient int com::cosylab::acs::maci::manager::IntHashMap::count [private]

The total number of entries in the hash table.

Referenced by clear(), isEmpty(), put(), remove(), size(), and toArray().

float com::cosylab::acs::maci::manager::IntHashMap::loadFactor [private]

The load factor for the hashtable.

Referenced by rehash().

transient Entry com::cosylab::acs::maci::manager::IntHashMap::table[] [private]

The hash table data.

Referenced by clear(), contains(), containsKey(), get(), IntHashMap(), put(), rehash(), remove(), and toArray().

int com::cosylab::acs::maci::manager::IntHashMap::threshold [private]

The table is rehashed when its size exceeds this threshold. (The value of this field is (int)(capacity * loadFactor).)

Referenced by IntHashMap(), put(), and rehash().

The documentation for this class was generated from the following file:
Generated by  doxygen 1.6.2