Package ghidra.util.datastruct
Class LongIntHashtable
- java.lang.Object
-
- ghidra.util.datastruct.LongIntHashtable
-
- All Implemented Interfaces:
java.io.Serializable
- Direct Known Subclasses:
AddableLongIntHashtable
public class LongIntHashtable extends java.lang.Object implements java.io.Serializable
Class that implements a hashtable with long keys and int values. Because this class uses array of primitives to store the information, it serializes very fast. This implementation uses separate chaining to resolve collisions.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description LongIntHashtable()
Default constructor creates a table with an initial default capacity.LongIntHashtable(int capacity)
Constructor creates a table with an initial given capacity.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
contains(long key)
Return true if the given key is in the hashtable.int
get(long key)
Returns the value for the given key.long[]
getKeys()
Returns an array containing all the long keys.void
put(long key, int value)
Adds a key/value pair to the hashtable.boolean
remove(long key)
Removes a key from the hashtablevoid
removeAll()
Remove all entries from the hashtable.int
size()
Return the number of key/value pairs stored in the hashtable.
-
-
-
Constructor Detail
-
LongIntHashtable
public LongIntHashtable()
Default constructor creates a table with an initial default capacity.
-
LongIntHashtable
public LongIntHashtable(int capacity)
Constructor creates a table with an initial given capacity. The capacity will be adjusted to the next highest prime in the PRIMES table.- Parameters:
capacity
- the initial capacity.
-
-
Method Detail
-
put
public void put(long key, int value)
Adds a key/value pair to the hashtable. If the key is already in the table, the old value is replaced with the new value. If the hashtable is already full, the hashtable will attempt to approximately double in size (it will use a prime number), and all the current entries will be rehashed.- Parameters:
key
- the key to associate with the given value.value
- the value to associate with the given key.- Throws:
java.lang.ArrayIndexOutOfBoundsException
- thrown if the maximum capacity is reached.
-
get
public int get(long key) throws NoValueException
Returns the value for the given key.- Parameters:
key
- the key whose associated value is to be returned.- Throws:
NoValueException
- thrown if there is no value for the given key.
-
remove
public boolean remove(long key)
Removes a key from the hashtable- Parameters:
key
- key to be removed from the hashtable.- Returns:
- true if key is found and removed, false otherwise.
-
removeAll
public void removeAll()
Remove all entries from the hashtable.
-
contains
public boolean contains(long key)
Return true if the given key is in the hashtable.- Parameters:
key
- the key whose presence in this map is to be tested.
-
size
public int size()
Return the number of key/value pairs stored in the hashtable.
-
getKeys
public long[] getKeys()
Returns an array containing all the long keys.
-
-