Package ghidra.util.datastruct
Class StringIntHashtable
- java.lang.Object
- 
- ghidra.util.datastruct.StringIntHashtable
 
- 
- All Implemented Interfaces:
- java.io.Serializable
 
 public class StringIntHashtable extends java.lang.Object implements java.io.SerializableClass that implements a hashtable with String keys and int values.- See Also:
- Serialized Form
 
- 
- 
Constructor SummaryConstructors Constructor Description StringIntHashtable()Default constructor creates a table with an initial default capacity.StringIntHashtable(int capacity)Constructor creates a table with an initial given capacity.
 - 
Method SummaryAll Methods Instance Methods Concrete Methods Modifier and Type Method Description booleancontains(java.lang.String key)Return true if the given key is in the hashtable.intget(java.lang.String key)Returns the value for the given key.java.util.Iterator<java.lang.String>getKeyIterator()Returns an iterator over the strings in this hash table.java.lang.String[]getKeys()Returns an array containing all the String keys.voidput(java.lang.String key, int value)Adds a key/value pair to the hashtable.booleanremove(java.lang.String key)Removes a key from the hashtablevoidremoveAll()Remove all entries from the hashtable.intsize()Return the number of key/value pairs stored in the hashtable.
 
- 
- 
- 
Constructor Detail- 
StringIntHashtablepublic StringIntHashtable() Default constructor creates a table with an initial default capacity.
 - 
StringIntHashtablepublic StringIntHashtable(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- 
getKeyIteratorpublic java.util.Iterator<java.lang.String> getKeyIterator() Returns an iterator over the strings in this hash table.
 - 
putpublic void put(java.lang.String 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.
 
 - 
getpublic int get(java.lang.String key) throws NoValueExceptionReturns 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.
 
 - 
removepublic boolean remove(java.lang.String 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.
 
 - 
removeAllpublic void removeAll() Remove all entries from the hashtable.
 - 
containspublic boolean contains(java.lang.String key) Return true if the given key is in the hashtable.- Parameters:
- key- the key whose presence in this map is to be tested.
 
 - 
sizepublic int size() Return the number of key/value pairs stored in the hashtable.
 - 
getKeyspublic java.lang.String[] getKeys() Returns an array containing all the String keys.
 
- 
 
-