2005-01-17 Paolo Carlini <pcarlini@suse.de> PR libstdc++/19433 * include/bits/stl_tree.h (_Rb_tree<>::insert_unique(iterator, const _Val&), _Rb_tree<>::insert_equal(iterator, const _Val&)): Obtain amortized constant complexity if t is inserted right after p - not before p - as per Table 69. * testsuite/performance/23_containers/set_insert_from_sorted.cc: New. * testsuite/23_containers/multiset/insert/2.cc: New. * testsuite/23_containers/set/insert/1.cc: Likewise. * testsuite/performance/23_containers/set_create_from_sorted.cc: Simplify. * include/bits/stl_tree.h: Add a few missing std:: qualifications. From-SVN: r93761 |
||
---|---|---|
.. | ||
container_benchmark.cc | ||
list_create_fill_sort.cc | ||
map_create_fill.cc | ||
set_create_from_sorted.cc | ||
set_insert_from_sorted.cc |