|
SunSPOT API V3.0 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object com.sun.squawk.util.IntHashtable
public class IntHashtable
This class implements an unsynchronized hashtable, which maps keys to values. Any
non-null
object can be used as a value, but only primitive integers (ints) can be used as keys.
An instance of IntHashtable
has two parameters that
affect its efficiency: its capacity and its load
factor. The load factor is 0.75. When
the number of entries in the hashtable exceeds the product of the
load factor and the current capacity, the capacity is increased by
calling the rehash
method.
If many entries are to be made into a IntHashtable
,
creating it with a sufficiently large capacity may allow the
entries to be inserted more efficiently than letting it perform
automatic rehashing as needed to grow the table.
This example creates a hashtable of numbers. It uses the int value of the numbers as keys:
IntHashtable numbers = new IntHashtable(); numbers.put(1, new Integer(1)); numbers.put(2, new Integer(2)); numbers.put(3, new Integer(3));
To retrieve a number, use the following code:
Integer n = (Integer)numbers.get(2); if (n != null) { System.out.println("two = " + n); }
Note: To conserve space, the CLDC implementation is based on JDK 1.1.8, not JDK 1.3.
Object.equals(java.lang.Object)
,
Object.hashCode()
,
rehash()
,
Hashtable
Field Summary | |
---|---|
protected int |
count
The total number of entries in the hash table. |
protected com.sun.squawk.util.IntHashtableEntry[] |
table
The hash table data. |
protected int |
threshold
Rehashes the table when count exceeds this threshold. |
Constructor Summary | |
---|---|
IntHashtable()
Constructs a new, empty hashtable with a default capacity and load factor. |
|
IntHashtable(int initialCapacity)
Constructs a new, empty hashtable with the specified initial capacity. |
Method Summary | |
---|---|
void |
clear()
Clears this hashtable so that it contains no keys. |
boolean |
contains(Object value)
Tests if some key maps into the specified value in this hashtable. |
boolean |
containsKey(int key)
Tests if the specified object is a key in this hashtable. |
Enumeration |
elements()
Returns an enumeration of the values in this hashtable. |
Object |
get(int key)
Returns the value to which the specified key is mapped in this hashtable. |
boolean |
isEmpty()
Tests if this hashtable maps no keys to values. |
Enumeration |
keys()
Returns an enumeration of the keys in this hashtable. |
Object |
put(int key,
Object value)
Maps the specified key to the specified
value in this hashtable. |
protected void |
rehash()
Rehashes the contents of the hashtable into a hashtable with a larger capacity. |
Object |
remove(int key)
Removes the key (and its corresponding value) from this hashtable. |
int |
size()
Returns the number of keys in this hashtable. |
String |
toString()
Returns a rather long string representation of this hashtable. |
void |
visit(IntHashtableVisitor visitor)
Visitor |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
protected int count
protected com.sun.squawk.util.IntHashtableEntry[] table
protected int threshold
Constructor Detail |
---|
public IntHashtable()
public IntHashtable(int initialCapacity)
initialCapacity
- the initial capacity of the hashtable.
IllegalArgumentException
- if the initial capacity is less
than zeroMethod Detail |
---|
public void clear()
public boolean contains(Object value)
containsKey
method.
value
- a value to search for.
true
if some key maps to the
value
argument in this hashtable;
false
otherwise.
NullPointerException
- if the value is null
.Hashtable.containsKey(java.lang.Object)
public boolean containsKey(int key)
key
- possible key.
true
if the specified object is a key in this
hashtable; false
otherwise.Hashtable.contains(java.lang.Object)
public Enumeration elements()
Enumeration
,
Hashtable.keys()
public Object get(int key)
key
- a key in the hashtable.
null
if the key is not mapped to any value in
this hashtable.Hashtable.put(java.lang.Object, java.lang.Object)
public final boolean isEmpty()
true
if this hashtable maps no keys to values;
false
otherwise.public Enumeration keys()
Enumeration
,
Hashtable.elements()
public Object put(int key, Object value)
key
to the specified
value
in this hashtable. Neither the key nor the
value can be null
.
The value can be retrieved by calling the get
method
with a key that is equal to the original key.
key
- the hashtable key.value
- the value.
null
if it did not have one.
NullPointerException
- if the key or value is
null
.Object.equals(java.lang.Object)
,
Hashtable.get(java.lang.Object)
protected void rehash()
public Object remove(int key)
key
- the key that needs to be removed.
null
if the key did not have a mapping.public final int size()
public String toString()
toString
in class Object
public void visit(IntHashtableVisitor visitor)
visitor
- the visitor object
|
SunSPOT API V3.0 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |