The auto-compaction factor for the table.
The number of removes that should be performed before an auto-compaction occurs.
the number of elements this iterator believes are in the
data structure it accesses.
the current number of free slots in the hash.
the data structure this iterator traverses
the collection on which this iterator operates.
strategy used to hash values in this collection
strategy used to hash values in this collection
strategy used to hash values in this collection
strategy used to hash values in this collection
strategy used to hash values in this collection
the strategy used to hash objects in this collection.
strategy used to hash values in this collection
the index used for iteration.
the list used to hold the stack values.
the list used to hold the stack values.
the list used to hold the stack values.
the list used to hold the stack values.
the list used to hold the stack values.
the list used to hold the stack values.
Determines how full the internal table can become before
rehashing is required.
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
the wrapped primitive map
The maximum number of elements allowed without allocating more
space.
the index after the last entry in the list
the index after the last entry in the list
the index after the last entry in the list
the index after the last entry in the list
the index after the last entry in the list
the index after the last entry in the list
the wrapped primitive set
the wrapped primitive set
the wrapped primitive set
the wrapped primitive set
the wrapped primitive set
the wrapped primitive set
the current number of occupied slots in the hash.
the number of elements in the list
flags indicating whether each position in the hash is
FREE, FULL, or REMOVED