This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/19422] assoc. containers: ctor taking range is O(n log n) even if the range is sorted
- From: "pcarlini at suse dot de" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 13 Jan 2005 13:05:55 -0000
- Subject: [Bug libstdc++/19422] assoc. containers: ctor taking range is O(n log n) even if the range is sorted
- References: <20050113120525.19422.SWElef@post.sk>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- 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