public void put(int key, int value) {

        int index = indexer.put(key);

        // make sure there is room
        if (index >= capacity) {
            grow();
        }

        values[index] = 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.
@param key the key for the new entry.
@param value the value for the new entry.
@exception ArrayIndexOutOfBoundsException thrown if the maximum capacity is
reached.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/IntIntHashtable.java