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

[pcarlini at suse dot de]

------- Additional Comments From pcarlini at suse dot de  2005-01-13 13:05 -------
A naive idea (I haven't really studied the issue in detail): wouldn't be of help
calling in the insert_unique/insert_equal loops the overloads taking an iterator
(which would be end()) and a value?

-- 


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