std::map - Does find() operation need to be thread safe?

Abhijit Acharekar said:

Is map implemented in TI complier as red-black tree?

Yes

Abhijit Acharekar said:

if element is being added/deleted into a map, does find()  guarantee correct operation if perform simultaneously?

I presume you have two different threads of execution accessing the same map container.  I think the answer is no.  But I'll get back to you on that.

Thanks and regards,

-George

Hello George,

Thank you for response; as par my understanding, an insert operation to map will not modify memory location of existing elements. I think delete can cause the modification. So insert and find operation can perform simultaneously. Can you please confirm this?

Thank you for explanation; I did not clearly understand your below statement; I will deep dive further. Thank you. 

George Mock said:

the pointers inside those element do chang

The elements in the red-black tree contain fields that are pointers.  They have names similar to left and right.  They each point to one element of a red-black tree. An insert operation may cause a tree to be rebalanced.  If so, some of these left and right fields in the elements change value.  A find operation uses the left and right fields to navigate through the tree.  If both operations occur at once, bad things are likely to happen.

Thanks and regards,

-George