1edd1a8317
2008-09-16 Chris Fairles <chris.fairles@gmail.com> * testsuite/25_algorithms/min/requirements/explicit_instantiation/3.cc: New. * testsuite/25_algorithms/min/requirements/explicit_instantiation/ pod2.cc: Likewise. * testsuite/25_algorithms/min/3.cc: Likewise. * testsuite/25_algorithms/min/4.cc: Likewise. * testsuite/25_algorithms/max/requirements/explicit_instantiation/3.cc: Likewise. * testsuite/25_algorithms/max/requirements/explicit_instantiation/ pod2.cc: Likewise. * testsuite/25_algorithms/max/3.cc: Likewise. * testsuite/25_algorithms/max/4.cc: Likewise. * testsuite/25_algorithms/minmax/requirements/explicit_instantiation/ 3.cc: Likewise. * testsuite/25_algorithms/minmax/requirements/explicit_instantiation/ pod2.cc: Likewise. * testsuite/25_algorithms/minmax/2.cc: Likewise. * testsuite/25_algorithms/minmax/3.cc: Likewise. 2008-09-16 Paolo Carlini <paolo.carlini@oracle.com> * include/bits/stl_algo.h (min(initializer_list<>), min(initializer_list<>, Compare), max(initializer_list<>), max(initializer_list<>, Compare), minmax(initializer_list<>), minmax(initializer_list<>, Compare)): Add in C++0x mode. * include/bits/algorithmfwd.h: Add. * testsuite/25_algorithms/headers/algorithm/synopsis.cc: Likewise. From-SVN: r140404 |
||
---|---|---|
.. | ||
adjacent_find | ||
all_of | ||
any_of | ||
binary_search | ||
copy | ||
copy_backward | ||
copy_if | ||
copy_n | ||
count | ||
count_if | ||
equal | ||
equal_range | ||
fill | ||
fill_n | ||
find | ||
find_end | ||
find_first_of | ||
find_if | ||
find_if_not | ||
for_each/requirements/explicit_instantiation | ||
generate/requirements/explicit_instantiation | ||
generate_n/requirements/explicit_instantiation | ||
headers | ||
heap | ||
includes | ||
inplace_merge | ||
is_heap | ||
is_heap_until | ||
is_partitioned | ||
is_sorted | ||
is_sorted_until | ||
iter_swap | ||
lexicographical_compare | ||
lower_bound | ||
make_heap/requirements/explicit_instantiation | ||
max | ||
max_element | ||
merge | ||
min | ||
min_element | ||
minmax | ||
minmax_element | ||
mismatch | ||
move | ||
move_backward | ||
next_permutation | ||
none_of | ||
nth_element | ||
partial_sort | ||
partial_sort_copy | ||
partition | ||
partition_copy | ||
partition_point | ||
pop_heap/requirements/explicit_instantiation | ||
prev_permutation | ||
push_heap/requirements/explicit_instantiation | ||
random_shuffle | ||
remove | ||
remove_copy/requirements/explicit_instantiation | ||
remove_copy_if | ||
remove_if | ||
replace | ||
replace_copy | ||
replace_copy_if | ||
replace_if | ||
reverse | ||
reverse_copy/explicit_instantiation | ||
rotate | ||
rotate_copy/requirements/explicit_instantiation | ||
search | ||
search_n | ||
set_difference | ||
set_intersection | ||
set_symmetric_difference | ||
set_union | ||
sort | ||
sort_heap/requirements/explicit_instantiation | ||
stable_partition | ||
stable_sort | ||
swap | ||
swap_ranges | ||
transform/requirements/explicit_instantiation | ||
unique | ||
unique_copy | ||
upper_bound |