re PR libstdc++/19422 (assoc. containers: ctor taking range is O(n log n) even if...
authorPaolo Carlini <pcarlini@suse.de>
Fri, 14 Jan 2005 21:09:38 +0000 (21:09 +0000)
committerPaolo Carlini <paolo@gcc.gnu.org>
Fri, 14 Jan 2005 21:09:38 +0000 (21:09 +0000)
commit21c332dc936d8008a3c959ce16899b97d9afe245
tree1edc62653f696883b1dd317ef506925f15342695
parent66f9a6de4ccd427bcbec14104465b1f0efa7c10f
re PR libstdc++/19422 (assoc. containers: ctor taking range is O(n log n) even if the range is sorted)

2005-01-14  Paolo Carlini  <pcarlini@suse.de>

PR libstdc++/19422
* include/bits/stl_tree.h (_Rb_tree<>::insert_equal(_II, _II),
_Rb_tree<>::insert_unique(_II, _II)): Use insert_equal (insert_unique,
respectively) with hint (end()).
* testsuite/performance/23_containers/set_create_from_sorted.cc: New.

From-SVN: r93663
libstdc++-v3/ChangeLog
libstdc++-v3/include/bits/stl_tree.h
libstdc++-v3/testsuite/performance/23_containers/set_create_from_sorted.cc [new file with mode: 0644]