Remove a key-value pair from the table. Return the number of key-value pairs within the table. Construct a hash table that is capable of holding at least initialCapacity values. If that value is approached, it will be expanded appropriately. It is probably best if the capacity is prime.
Table is initially empty.
The initial capacity of the hash table. Construct a hash table that is initially empty. The number of key-value pairs currently in table. True if table is empty. Returns true if a specific value appears within the table.