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: 14 Jan 2005 14:28:06 -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-14 14:28 -------
Yes, we are already using something similar, elsewhere (e.g., our copy_tracker
class). For the present needs, a tweaked version of your test program will do
rather well: even with std::allocator, the new numbers are very stable and much
improved, both in absolute value and as a trend. I will revisit the issue in
the context of 19433, perhaps.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=19422