gcc/libstdc++-v3/testsuite/performance
Paolo Carlini 21c332dc93 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
2005-01-14 21:09:38 +00:00
..
20_util/allocator list_sort_search.cc: Include <ext/new_allocator.h>. 2004-10-19 08:56:32 +00:00
21_strings basic_string.tcc (_S_create): Use consistently the exponential policy, simplify. 2004-10-13 08:58:41 +00:00
22_locale
23_containers re PR libstdc++/19422 (assoc. containers: ctor taking range is O(n log n) even if the range is sorted) 2005-01-14 21:09:38 +00:00
25_algorithms testsuite_iterators.h: New. 2004-11-24 06:24:10 +00:00
26_numerics
27_io ifstream_getline-2.cc: New. 2004-11-07 12:35:48 +00:00