.. |
adjacent_find
|
|
|
all_of
|
|
|
any_of
|
|
|
binary_search
|
|
|
copy
|
|
|
copy_backward
|
stl_deque.h (copy_backward(_Deque_iterator, _Deque_iterator, _Deque_iterator), [...]): Declare.
|
2009-12-24 12:47:37 +00:00 |
copy_if
|
|
|
copy_n
|
|
|
count
|
|
|
count_if
|
|
|
equal
|
|
|
equal_range
|
|
|
fill
|
|
|
fill_n
|
re PR libstdc++/25306 (fill_n, generate_n assume Size is modifiable)
|
2010-05-21 16:57:17 +00:00 |
find
|
|
|
find_end
|
|
|
find_first_of
|
|
|
find_if
|
|
|
find_if_not
|
|
|
for_each
|
stl_algo.h (for_each): Implement resolution of DR 1110.
|
2010-02-19 17:38:18 +00:00 |
generate/requirements/explicit_instantiation
|
|
|
generate_n
|
re PR libstdc++/25306 (fill_n, generate_n assume Size is modifiable)
|
2010-05-21 16:57:17 +00:00 |
headers
|
|
|
heap
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
includes
|
|
|
inplace_merge
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
is_heap
|
|
|
is_heap_until
|
|
|
is_partitioned
|
|
|
is_sorted
|
|
|
is_sorted_until
|
|
|
iter_swap
|
|
|
lexicographical_compare
|
|
|
lower_bound
|
list: Implement DR 1133 here too.
|
2010-01-04 01:58:21 +00:00 |
make_heap/requirements/explicit_instantiation
|
|
|
max
|
|
|
max_element
|
|
|
merge
|
|
|
min
|
|
|
min_element
|
|
|
minmax
|
order_statistics_imp.hpp: Avoid -Wall warnings.
|
2010-06-08 00:45:02 +00:00 |
minmax_element
|
|
|
mismatch
|
|
|
move
|
|
|
move_backward
|
stl_deque.h (copy_backward(_Deque_iterator, _Deque_iterator, _Deque_iterator), [...]): Declare.
|
2009-12-24 12:47:37 +00:00 |
next_permutation
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
none_of
|
|
|
nth_element
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
partial_sort
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
partial_sort_copy
|
|
|
partition
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
partition_copy
|
|
|
partition_point
|
|
|
pop_heap/requirements/explicit_instantiation
|
|
|
prev_permutation
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
push_heap/requirements/explicit_instantiation
|
|
|
random_shuffle
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
remove
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
remove_copy/requirements/explicit_instantiation
|
|
|
remove_copy_if
|
|
|
remove_if
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
replace
|
|
|
replace_copy
|
|
|
replace_copy_if
|
|
|
replace_if
|
|
|
reverse
|
|
|
reverse_copy/explicit_instantiation
|
|
|
rotate
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
rotate_copy/requirements/explicit_instantiation
|
|
|
search
|
|
|
search_n
|
re PR libstdc++/42712 (search_n/iterator.cc times out in parallel-mode)
|
2010-01-19 11:18:03 +00:00 |
set_difference
|
list: Implement DR 1133 here too.
|
2010-01-04 01:58:21 +00:00 |
set_intersection
|
list: Implement DR 1133 here too.
|
2010-01-04 01:58:21 +00:00 |
set_symmetric_difference
|
|
|
set_union
|
|
|
shuffle
|
stl_algo.h (shuffle): Change signature consistently with random_shuffle (US 121).
|
2010-08-11 17:10:04 +00:00 |
sort
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
sort_heap/requirements/explicit_instantiation
|
|
|
stable_partition
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
stable_sort
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
swap
|
|
|
swap_ranges
|
|
|
transform/requirements/explicit_instantiation
|
|
|
unique
|
using_namespace_std_tr1_neg.cc: Do not run in parallel-mode.
|
2010-01-12 17:16:25 +00:00 |
unique_copy
|
|
|
upper_bound
|
list: Implement DR 1133 here too.
|
2010-01-04 01:58:21 +00:00 |