| java.lang.Object
 com.lowagie.text.pdf.IntHashtable
| IntHashtable | | public class IntHashtable implements Cloneable(Code) | | A hash map that uses primitive ints for the key rather than objects.
Note that this class is for internal optimization purposes only, and may
not be supported in future releases of Jakarta Commons Lang. Utilities of
this sort may be included in future releases of Jakarta Commons Collections.
author:
Justin Couch
author:
Alex Chaffee (alex@apache.org)
author:
Stephen Colebourne
author:
Bruno Lowagie (change Objects as keys into int values)
author:
Paulo Soares (added extra methods) |
| Inner Class :static class Entry | |
| Inner Class :static class IntHashtableIterator implements Iterator | |
| Method Summary | |
| public void | clear()
| | public Object | clone()
| | public boolean | contains(int value)
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. | | public boolean | containsKey(int key)
Tests if the specified int is a key in this hashtable.
Parameters:
key - possible key. | | public boolean | containsValue(int value)
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. | | public int | get(int key)
Returns the value to which the specified key is mapped in this map.
Parameters:
key - a key in the hashtable. | | public Iterator | getEntryIterator()
| | public int[] | getKeys()
| | public int | getOneKey()
| | public boolean | isEmpty()
| | public int | put(int key, int value)
Maps the specified key to the specified
value in this hashtable. | | protected void | rehash()
| | public int | remove(int key)
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. | | public int | size()
| | public int[] | toOrderedKeys()
|
| IntHashtable | | public IntHashtable()(Code) | | Constructs a new, empty hashtable with a default capacity and load
factor, which is 20 and 0.75 respectively.
|
| IntHashtable | | public IntHashtable(int initialCapacity)(Code) | | 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.
throws:
IllegalArgumentException - if the initial capacity is lessthan zero. |
| IntHashtable | | public IntHashtable(int initialCapacity, float loadFactor)(Code) | | Constructs a new, empty hashtable with the specified initial
capacity and the specified load factor.
Parameters:
initialCapacity - the initial capacity of the hashtable.
Parameters:
loadFactor - the load factor of the hashtable.
throws:
IllegalArgumentException - if the initial capacity is lessthan zero, or if the load factor is nonpositive. |
| clear | | public void clear()(Code) | | Clears this hashtable so that it contains no keys.
|
| contains | | public boolean contains(int value)(Code) | | 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. true if and only if some key maps to thevalue argument in this hashtable asdetermined by the equals method;false otherwise.
throws:
NullPointerException - if the value is null.
See Also: IntHashtable.containsKey(int)
See Also: IntHashtable.containsValue(int)
See Also: java.util.Map |
| containsKey | | public boolean containsKey(int key)(Code) | | Tests if the specified int is a key in this hashtable.
Parameters:
key - possible key. true if and only if the specified int is akey in this hashtable, as determined by the equalsmethod; false otherwise.
See Also: IntHashtable.contains(int) |
| containsValue | | public boolean containsValue(int value)(Code) | | 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. boolean true if the value is contained
See Also: java.util.Map
since:
JDK1.2 |
| get | | public int get(int key)(Code) | | Returns the value to which the specified key is mapped in this map.
Parameters:
key - a key in the hashtable. the value to which the key is mapped in this hashtable;null if the key is not mapped to any value inthis hashtable.
See Also: IntHashtable.put(int,int) |
| getKeys | | public int[] getKeys()(Code) | | |
| getOneKey | | public int getOneKey()(Code) | | |
| isEmpty | | public boolean isEmpty()(Code) | | Tests if this hashtable maps no keys to values.
true if this hashtable maps no keys to values;false otherwise. |
| put | | public int put(int key, int value)(Code) | | 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.
Parameters:
value - the value. the previous value of the specified key in this hashtable,or null if it did not have one.
throws:
NullPointerException - if the key is null.
See Also: IntHashtable.get(int) |
| rehash | | protected void rehash()(Code) | | 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.
|
| remove | | public int remove(int key)(Code) | | 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. the value to which the key had been mapped in this hashtable,or null if the key did not have a mapping. |
| size | | public int size()(Code) | | Returns the number of keys in this hashtable.
the number of keys in this hashtable. |
| toOrderedKeys | | public int[] toOrderedKeys()(Code) | | |
|
|