aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-inline.c
diff options
context:
space:
mode:
authorPaolo Carlini <pcarlini@suse.de>2005-01-17 14:14:26 +0000
committerPaolo Carlini <paolo@gcc.gnu.org>2005-01-17 14:14:26 +0000
commitac317859d409434b0f5ef8ec89a7abcacb10bd3e (patch)
tree06c3e5f2c891c55b59db68dc352490470d7d95b6 /gcc/tree-inline.c
parentef9312c1c71822c6d5ab5367ff9489301a00e257 (diff)
downloadgcc-ac317859d409434b0f5ef8ec89a7abcacb10bd3e.zip
gcc-ac317859d409434b0f5ef8ec89a7abcacb10bd3e.tar.gz
gcc-ac317859d409434b0f5ef8ec89a7abcacb10bd3e.tar.bz2
re PR libstdc++/19433 (set, multiset, map, multimap misuse hint on insert)
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
Diffstat (limited to 'gcc/tree-inline.c')
0 files changed, 0 insertions, 0 deletions