|
LimeWire Collection Component API | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.limewire.collection.LongHashMap<V>
public class LongHashMap<V>
A hash map that uses primitive longs for the key rather than objects.
LongHashMap<String> lhm = new LongHashMap(3);
lhm.put(1, "Abby");
System.out.println(lhm.get(1));
Output:
Abby
HashMap| Constructor Summary | |
|---|---|
LongHashMap()
Constructs a new, empty hashtable with a default capacity and load factor, which is 20 and 0.75 respectively. |
|
LongHashMap(int initialCapacity)
Constructs a new, empty hashtable with the specified initial capacity and default load factor, which is 0.75. |
|
LongHashMap(int initialCapacity,
float loadFactor)
Constructs a new, empty hashtable with the specified initial capacity and the specified load factor. |
|
LongHashMap(LongHashMap<? extends V> m)
Copy constructor |
|
| 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(long key)
Tests if the specified object is a key in this hashtable. |
boolean |
containsValue(Object value)
Returns true if this HashMap maps one or more keys
to this value. |
V |
get(long key)
Returns the value to which the specified key is mapped in this map. |
boolean |
isEmpty()
Tests if this hashtable maps no keys to values. |
V |
put(long key,
V value)
Maps the specified key to the specified
value in this hashtable. |
void |
putAll(LongHashMap<? extends V> m)
Adds all elements from m to this. |
protected void |
rehash()
Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently. |
V |
remove(long key)
Removes the key (and its corresponding value) from this hashtable. |
int |
size()
Returns the number of keys in this hashtable. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public LongHashMap()
Constructs a new, empty hashtable with a default capacity and load
factor, which is 20 and 0.75 respectively.
public LongHashMap(int initialCapacity)
Constructs a new, empty hashtable with the specified initial capacity
and default load factor, which is 0.75.
initialCapacity - the initial capacity of the hashtable.
IllegalArgumentException - if the initial capacity is less
than zero.
public LongHashMap(int initialCapacity,
float loadFactor)
Constructs a new, empty hashtable with the specified initial capacity and the specified load factor.
initialCapacity - the initial capacity of the hashtable.loadFactor - the load factor of the hashtable.
IllegalArgumentException - if the initial capacity is less
than zero, or if the load factor is nonpositive.public LongHashMap(LongHashMap<? extends V> m)
m - The IntHashMap to copy| Method Detail |
|---|
public void putAll(LongHashMap<? extends V> m)
public int size()
Returns the number of keys in this hashtable.
public boolean isEmpty()
Tests if this hashtable maps no keys to values.
true if this hashtable maps no keys to values;
false otherwise.public boolean contains(Object 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).
value - a value to search for.
true if and only if some key maps to the
value argument in this hashtable as
determined by the equals method;
false otherwise.
NullPointerException - if the value is null.containsKey(long),
containsValue(Object),
Mappublic boolean containsValue(Object 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).
value - value whose presence in this HashMap is to be tested.
Mappublic boolean containsKey(long key)
Tests if the specified object is a key in this hashtable.
key - possible key.
true if and only if the specified object is a
key in this hashtable, as determined by the equals
method; false otherwise.contains(Object)public V get(long key)
Returns the value to which the specified key is mapped in this map.
key - a key in the hashtable.
null if the key is not mapped to any value in
this hashtable.put(long, Object)protected void rehash()
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.
public V put(long key,
V value)
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.
key - the hashtable key.value - the value.
null if it did not have one.
NullPointerException - if the key is null.get(long)public V remove(long key)
Removes the key (and its corresponding value) from this hashtable.
This method does nothing if the key is not present in the hashtable.
key - the key that needs to be removed.
null if the key did not have a mapping.public void clear()
Clears this hashtable so that it contains no keys.
|
LimeWire Collection Component API | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||