What happens in case of hash collisions in a map?

In Go, the map is designed so that in case of collisions (when different keys have the same hash), elements are stored in a single "bucket".

Inside the bucket, keys and values are stored in slices, and during search, a sequential comparison of keys is performed for an exact match.

That is, even if hashes match, the map correctly distinguishes keys by their value.

If the number of collisions in a bucket becomes too large, the Go runtime may redistribute elements by increasing the number of buckets to maintain performance.

Thus, collisions do not lead to data loss, but they can slightly slow down search operations due to the need to compare keys.