mirror of git://gcc.gnu.org/git/gcc.git
2015-08-24 François Dumont <fdumont@gcc.gnu.org> PR libstdc++/60519 * include/debug/formatter.h (_Debug_msg_id::__msg_irreflexive_ordering): New enum entry. * include/debug/functions.h (_Irreflexive_checker): New. (__is_irreflexive, __is_irreflexive_pred): New. * include/debug/macros.h (__glibcxx_check_irreflexive, __glibcxx_check_irreflexive_pred): New macros. (__glibcxx_check_irreflexive2, __glibcxx_check_irreflexive_pred2): New macros limited to post-C++11 mode. * include/debug/debug.h (__glibcxx_requires_irreflexive, __glibcxx_requires_irreflexive_pred): New macros, use latter. (__glibcxx_requires_irreflexive2, __glibcxx_requires_irreflexive_pred2): Likewise. * include/bits/stl_algo.h (partial_sort_copy): Add irreflexive debug check. (partial_sort_copy): Likewise. (lower_bound): Likewise. (upper_bound): Likewise. (equal_range): Likewise. (binary_search): Likewise. (inplace_merge): Likewise. (includes): Likewise. (next_permutation): Likewise. (prev_permutation): Likewise. (is_sorted_until): Likewise. (minmax_element): Likewise. (partial_sort): Likewise. (nth_element): Likewise. (sort): Likewise. (merge): Likewise. (stable_sort): Likewise. (set_union): Likewise. (set_intersection): Likewise. (set_difference): Likewise. (set_symmetric_difference): Likewise. (min_element): Likewise. (max_element): Likewise. * include/bits/stl_algobase.h (lower_bound): Likewise. (lexicographical_compare): Likewise. * include/bits/stl_heap.h (push_heap): Likewise. (pop_heap): Likewise. (make_heap): Likewise. (sort_heap): Likewise. (is_heap_until): Likewise. * testsuite/25_algorithms/lexicographical_compare/debug/ irreflexive_neg.cc: New. * testsuite/25_algorithms/lower_bound/debug/irreflexive.cc: New. * testsuite/25_algorithms/partial_sort_copy/debug/irreflexive_neg.cc: New. From-SVN: r227189 |
||
|---|---|---|
| .. | ||
| 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 | ||
| generate/requirements/explicit_instantiation | ||
| generate_n | ||
| headers | ||
| heap | ||
| includes | ||
| inplace_merge | ||
| is_heap | ||
| is_heap_until | ||
| is_partitioned | ||
| is_permutation | ||
| is_sorted | ||
| is_sorted_until | ||
| iter_swap | ||
| lexicographical_compare | ||
| lower_bound | ||
| make_heap | ||
| 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 | ||
| prev_permutation | ||
| push_heap | ||
| 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 | ||
| shuffle | ||
| sort | ||
| sort_heap | ||
| stable_partition | ||
| stable_sort | ||
| swap | ||
| swap_ranges | ||
| transform/requirements/explicit_instantiation | ||
| unique | ||
| unique_copy | ||
| upper_bound | ||