| .. |
|
adjacent_find
|
|
|
|
all_of
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
any_of
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
binary_search
|
|
|
|
copy
|
|
|
|
copy_backward
|
|
|
|
copy_if
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
copy_n
|
stl_algo.h (copy_n): Add in C++0x mode.
|
2008-06-29 11:08:26 +00:00 |
|
count
|
|
|
|
count_if
|
|
|
|
equal
|
|
|
|
equal_range
|
|
|
|
fill
|
re PR libstdc++/35725 (ambiguous std::fill with character array)
|
2008-03-29 22:38:19 +00:00 |
|
fill_n
|
re PR libstdc++/35725 (ambiguous std::fill with character array)
|
2008-03-29 22:38:19 +00:00 |
|
find
|
|
|
|
find_end
|
|
|
|
find_first_of
|
|
|
|
find_if
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
find_if_not
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
for_each/requirements/explicit_instantiation
|
|
|
|
generate/requirements/explicit_instantiation
|
|
|
|
generate_n/requirements/explicit_instantiation
|
|
|
|
headers
|
re PR libstdc++/37547 ([c++0x] minmax with initializer_list gives incorrect results)
|
2008-09-17 22:58:38 +00:00 |
|
heap
|
vector (insert(iterator, _Tp&&), [...]): Enable only when _Tp != bool.
|
2008-07-18 20:11:21 +00:00 |
|
includes
|
|
|
|
inplace_merge
|
|
|
|
is_heap
|
|
|
|
is_heap_until
|
|
|
|
is_partitioned
|
stl_algo.h (is_partitioned): Add in C++0x mode.
|
2008-06-27 17:42:18 +00:00 |
|
is_sorted
|
|
|
|
is_sorted_until
|
|
|
|
iter_swap
|
|
|
|
lexicographical_compare
|
|
|
|
lower_bound
|
|
|
|
make_heap/requirements/explicit_instantiation
|
|
|
|
max
|
37547.cc: Return void to avoid warnings.
|
2008-09-23 18:24:20 +00:00 |
|
max_element
|
|
|
|
merge
|
|
|
|
min
|
37547.cc: Return void to avoid warnings.
|
2008-09-23 18:24:20 +00:00 |
|
min_element
|
|
|
|
minmax
|
37547.cc: Return void to avoid warnings.
|
2008-09-23 18:24:20 +00:00 |
|
minmax_element
|
|
|
|
mismatch
|
|
|
|
move
|
|
|
|
move_backward
|
|
|
|
next_permutation
|
|
|
|
none_of
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
nth_element
|
2.cc: Constrain iterations when testing on a simultor.
|
2008-08-30 17:31:22 +00:00 |
|
partial_sort
|
|
|
|
partial_sort_copy
|
|
|
|
partition
|
|
|
|
partition_copy
|
stl_algo.h (partition_copy): Add in C++0x mode.
|
2008-06-26 17:55:23 +00:00 |
|
partition_point
|
stl_algo.h (partition_point): Add in C++0x mode.
|
2008-06-28 22:39:59 +00:00 |
|
pop_heap/requirements/explicit_instantiation
|
|
|
|
prev_permutation
|
|
|
|
push_heap/requirements/explicit_instantiation
|
|
|
|
random_shuffle
|
random_shuffle.h: (sequential_random_shuffle) Copy data back.
|
2008-07-09 15:26:56 +00:00 |
|
remove
|
|
|
|
remove_copy/requirements/explicit_instantiation
|
|
|
|
remove_copy_if
|
stl_algo.h (__find_if_not, [...]): Add in C++0x, per N2666.
|
2008-06-25 16:39:15 +00:00 |
|
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
|
re PR libstdc++/35588 ([parallel mode] parallel std::sort and bind())
|
2008-04-07 08:27:34 +00:00 |
|
sort_heap/requirements/explicit_instantiation
|
|
|
|
stable_partition
|
|
|
|
stable_sort
|
|
|
|
swap
|
move.h (swap(_Tp (&)[_Nm], _Tp (&)[_Nm])): Add, per DR 809.
|
2008-06-22 13:57:06 +00:00 |
|
swap_ranges
|
|
|
|
transform/requirements/explicit_instantiation
|
|
|
|
unique
|
|
|
|
unique_copy
|
|
|
|
upper_bound
|
|
|
