Memory allocation in std :: map

Question

I am reporting on various C ++ dictionary implementations (map, dictionary, vectors, etc.).

Attachment results using std :: map show that performance is O (log n). There are also constant bursts in performance. I am not 100% sure what causes this; I think they are caused by memory allocation, but I could not find any literature / documentation to prove this.

Can someone clear this case or point me in the right direction?

Greetings.

Answer 1

: O (log n). ( ).

. http://www.sgi.com/tech/stl/UniqueSortedAssociativeContainer.html . O (log n) O (1), , .

, . , ,

Answer 2

, STL. , , std:: map.

, . , STL-, ; STL - , .

Answer 3

, std:: map - - . , std:: map , . , node, .