Remove the entry associated with the specified key.
key - the key to remove the value for
forceRemoveValue - if true, then forcibly clean the underlying data structure;
otherwise, the implementation may decide not to dereference the
stored objects, which may cause excessive memory usage when a
large number of deletions occur.
the value previously associated with the specified key, or null if
no entry with that key exists.
void clear(boolean forceRemoveValues)
Some implementations may lazily remove entries, which would leave an
element behind in the hashtable. This can cause confusion with memory (and
potentially memory problems if a large number of deletions occur). By specifying
forceRemoveValues = true, the implementation should forcibly remove entries,
and thus improve overall memory usage (generally at a performance penalty).
the ratio of filled entries to available entries. Mostly useful for debugging
and other monitoring.