summaryrefslogtreecommitdiff
path: root/compile
diff options
context:
space:
mode:
authorpaolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4>2005-01-17 14:14:26 +0000
committerpaolo <paolo@138bc75d-0d04-0410-961f-82ee72b054a4>2005-01-17 14:14:26 +0000
commit56448917e5645809e6760973710fd6ddd511b3cc (patch)
tree06c3e5f2c891c55b59db68dc352490470d7d95b6 /compile
parentfed806852c04a7ce4880b42034016a97522f4613 (diff)
downloadgcc-56448917e5645809e6760973710fd6ddd511b3cc.tar.gz
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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@93761 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'compile')
0 files changed, 0 insertions, 0 deletions