how map in golang solve hash collision?

[xie cui]

I am discussing with my friends about how map solve hash collision. 

In my opinion, map uses separate chaining to solve hash collision.

but some of my friends think it is linear probing that solve the hash collision.

[Axel Wagner]

I recommend https://www.youtube.com/watch?v=Tl7mi9QmLns to learn about how Go maps work. It's quite in-depth.

To your specific question: Go maps use separate chaining. Every bucket is a linked list, where every list element stores 8 map entries.

--
You received this message because you are subscribed to the Google Groups "golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/aef554b8-5067-401e-b9d4-a09adf9691c2n%40googlegroups.com.