question: compresses the hashtable to the minimum prime size as defined by primefinder that will hold all of the elements currently in the table . if you have done a lot of remove operations and plan to do a lot of queries or insertions or iteration , it is a good idea to invoke this method . doing so will accomplish two things : you 'll free memory allocated to the table but no longer needed because of the remove s. you 'll get better query/insert/iterator performance because there wo n't be any removed slots to skip over when probing for indices in the table . concode_field_sep int _size concode_elem_sep int _free concode_elem_sep float _loadFactor concode_elem_sep long serialVersionUID concode_elem_sep int _maxSize concode_elem_sep boolean _autoCompactTemporaryDisable concode_elem_sep float _autoCompactionFactor concode_elem_sep int _autoCompactRemovesRemaining concode_elem_sep float DEFAULT_LOAD_FACTOR concode_elem_sep int DEFAULT_INITIAL_CAPACITY concode_field_sep void setAutoCompactionFactor concode_elem_sep void writeExternal concode_elem_sep void trimToSize concode_elem_sep boolean isEmpty concode_elem_sep void clear concode_elem_sep void rehash concode_elem_sep float getAutoCompactionFactor concode_elem_sep void reenableAutoCompaction concode_elem_sep int capacity concode_elem_sep int size concode_elem_sep void tempDisableAutoCompaction concode_elem_sep void postInsertHook concode_elem_sep void computeMaxSize concode_elem_sep Object clone concode_elem_sep void readExternal concode_elem_sep void removeAt concode_elem_sep int setUp concode_elem_sep void computeNextAutoCompactionAmount concode_elem_sep void ensureCapacity concode_elem_sep int calculateGrownCapacity
target: void function ( ) { rehash ( PrimeFinder . nextPrime ( ( int ) Math . ceil ( size ( ) / _loadFactor ) + 1 ) ) ; computeMaxSize ( capacity ( ) ) ; if ( _autoCompactionFactor != 0 ) { computeNextAutoCompactionAmount ( size ( ) ) ; } }