[Bug libstdc++/19422] assoc. containers: ctor taking range is O(n log n) even if the range is sorted

[SWElef at post dot sk]

------- Additional Comments From SWElef at post dot sk  2005-01-13 16:59 -------
Created an attachment (id=7953)
 --> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=7953&action=view)
performance test

This is my test program.

After giving it some thought I believe that calling the
insert_unique/insert_equal function is wrong. I don't think that any hint
(position) can help to make the running time linear in distance(first,last).
A special function should be writen for this purpose.

Regards,
Vladimir Marko


-- 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=19422