Method:
hash(key)
produces a hash code with it.set(key, value)
assignvalue
withkey
to hashmap. If akey
already exists, then the oldvalue
is overwritten.get(key)
returns thevalue
that is assigned to thiskey
. If akey
is not found, returnnull
.has(key)
returnstrue
orfalse
based on whether or not thekey
is in the hash map.remove(key)
If the givenkey
is in the hash map, it should remove the entry with thatkey
and returntrue
. If the key isn’t in the hash map, it should returnfalse
.length()
returns the number of stored keys in the hash map.clear()
removes all entries in the hash map.keys()
returns an array containing all the keys inside the hash map.values()
returns an array containing all the values.entries()
returns an array that contains each key, value pair.