public void put(T key, long 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 to associate with the given value.
@param value the value to associate with the given key.
@exception ArrayIndexOutOfBoundsException thrown if the maximum capacity is
reached.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/ObjectLongHashtable.java