A hash table is an array of linked lists. Each list is called a bucket. To find the place of an object in the table, compute its hash code and reduce it modulo the total number of buckets.
The resulting number is the index of the bucket that holds the element. For example, if an object has hash code 345 and there are 101 buckets, then the object is placed in bucket 42 (because the remainder of the integer division 345/101 is 42).
Could please somebody elaborated why the rest of the division (in this case 42) points to the "bucket"?
Normally one talks, concerning maps. about keys and values, right?
So the bucket here is the key?