collisions at map

[luirro777]

Hi.

I know that an ordinary way to solve the collisions problem in a hash table is by means of a linked list.
My question is: how does c++ solve this problem at a map? Does it solve that by itself??

Thanks.

[hanst99]

A map isn't the same thing as a hash table. If you try to insert a new key/value pair and the key is already taken, the insertion fails. There is a container called multimap that allows multiple elements to have the same key, it provides 2 functions to access values, one takes a key and returns an iterator to a value, the other takes a key and returns a pair of iterators that make up the range of all values with that key.

[luirro777]

Yes, you're right.
I was wrong. I thought than once you insert a pair <key,value>, c++ made a "hash" of the key and then inserted the value into a hash table.
Thanks.