Can I preload an STL map without the map performing any rotations?

Question

I have sorted data coming from a database to initialize an STL map. Only 5% of data will be changed later on inside the map.

As I understand, there will be an overhead of rotations incurred for each insertions. Is it possible to bypass the overhead for sorted data? e.g. is there an option to skip rotation, and another STL algoritm to do create a balanced tree with sorted data?

PS : I am aware there will be only 2 max rotations, but was wondering if I can improve performance further.

Answer 1

I assume you're interesting only in efficient loading of the initial sorted data?

The standard map :: map (InputIterator first, InputIterator last) constructor seems to do the right thing.

"For the iterator constructor, linear in the distance between the iterators (copy constructions) if the elements are already sorted according to comp. For unsorted sequences, linearithmic (N*logN) in that distance (sorting,copy constructions)."