Markus Trippelsdorf e13afbace1 stl_heap.h (pop_heap): Check for non-empty range in overload taking a predicate. ... * include/bits/stl_heap.h (pop_heap): Check for non-empty range in overload taking a predicate. * testsuite/25_algorithms/pop_heap/empty2_neg.cc: New. Co-Authored-By: Jonathan Wakely <jwakely.gcc@gmail.com> From-SVN: r181987		2011-12-04 13:21:53 +00:00
..
adjacent_find
all_of
any_of
binary_search
copy
copy_backward
copy_if
copy_n	re PR libstdc++/50119 ([C++0x] copy_n advances InputIterator one more time than necessary)	2011-08-18 16:32:23 +00:00
count
count_if
equal
equal_range
fill
fill_n
find
find_end
find_first_of
find_if
find_if_not
for_each
generate/requirements/explicit_instantiation
generate_n
headers
heap	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
includes
inplace_merge	re PR libstdc++/49559 ([C++0x] stable_sort calls self-move-assignment operator)	2011-07-11 18:38:54 +00:00
is_heap
is_heap_until
is_partitioned
is_permutation
is_sorted
is_sorted_until
iter_swap
lexicographical_compare
lower_bound
make_heap/requirements/explicit_instantiation
max	re PR c++/51060 (Temporary object stack space is not re-used)	2011-11-12 19:44:39 -05:00
max_element
merge
min	re PR c++/51060 (Temporary object stack space is not re-used)	2011-11-12 19:44:39 -05:00
min_element
minmax	re PR c++/51060 (Temporary object stack space is not re-used)	2011-11-12 19:44:39 -05:00
minmax_element
mismatch
move
move_backward
next_permutation	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
none_of
nth_element
partial_sort
partial_sort_copy
partition	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-17 23:15:28 +00:00
partition_copy
partition_point
pop_heap	stl_heap.h (pop_heap): Check for non-empty range in overload taking a predicate.	2011-12-04 13:21:53 +00:00
prev_permutation	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
push_heap/requirements/explicit_instantiation
random_shuffle
remove	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
remove_copy/requirements/explicit_instantiation
remove_copy_if
remove_if	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
replace
replace_copy
replace_copy_if
replace_if
reverse	tuple (tuple<>::operator=(tuple&&)): Specify as noexcept.	2011-05-19 17:20:22 +00:00
reverse_copy/explicit_instantiation
rotate	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
rotate_copy/requirements/explicit_instantiation
search
search_n
set_difference
set_intersection
set_symmetric_difference
set_union
shuffle
sort	tie2.cc: Fix for C++0x mode.	2011-06-23 11:32:23 +01:00
sort_heap	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
stable_partition	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
stable_sort	re PR libstdc++/49559 ([C++0x] stable_sort calls self-move-assignment operator)	2011-07-11 18:38:54 +00:00
swap	move.h (__is_nothrow_swappable): Add.	2011-06-21 23:01:03 +00:00
swap_ranges	tuple (tuple<>::operator=(tuple&&)): Specify as noexcept.	2011-05-19 17:20:22 +00:00
transform/requirements/explicit_instantiation
unique	moveable.cc: Actually run it in parallel-mode for check-parallel.	2011-04-11 17:50:39 +00:00
unique_copy
upper_bound